debase-ruby_core_source 0.10.9 → 0.10.13
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/CHANGELOG.md +4 -0
- data/README.md +1 -1
- data/Rakefile +6 -3
- data/debase-ruby_core_source.gemspec +2 -1
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/addr2line.h +2 -3
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/builtin.h +17 -2
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/ccan/build_assert/build_assert.h +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/ccan/check_type/check_type.h +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/ccan/container_of/container_of.h +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/ccan/list/list.h +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/ccan/str/str.h +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/constant.h +10 -5
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/debug_counter.h +127 -48
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/dln.h +3 -18
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/encindex.h +3 -2
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/eval_intern.h +16 -7
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/gc.h +13 -2
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/hrtime.h +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/id.h +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/id_table.h +2 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/insns.inc +0 -4
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/insns_info.inc +323 -536
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/array.h +119 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/bignum.h +246 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/bits.h +566 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/class.h +174 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/compar.h +50 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/compile.h +32 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/compilers.h +108 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/complex.h +29 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/cont.h +25 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/dir.h +17 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/enc.h +20 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/encoding.h +28 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/enum.h +19 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/enumerator.h +22 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/error.h +124 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/eval.h +33 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/file.h +39 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/fixnum.h +185 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/gc.h +161 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/hash.h +241 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/imemo.h +243 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/inits.h +51 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/io.h +35 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/load.h +19 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/loadpath.h +17 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/math.h +24 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/missing.h +19 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/numeric.h +255 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/object.h +83 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/parse.h +23 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/proc.h +33 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/process.h +136 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/random.h +17 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/range.h +41 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/rational.h +71 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/re.h +29 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/sanitizers.h +191 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/scheduler.h +44 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/serial.h +24 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/signal.h +22 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/static_assert.h +17 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/string.h +140 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/struct.h +154 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/symbol.h +41 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/thread.h +54 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/time.h +35 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/transcode.h +21 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/util.h +31 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/variable.h +84 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/vm.h +136 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal/warnings.h +17 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/internal.h +107 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/iseq.h +11 -18
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/known_errors.inc +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/method.h +21 -8
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/mjit.h +89 -48
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/mjit_compile.inc +2746 -2288
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/node.h +32 -24
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/node_name.inc +2 -2
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/opt_sc.inc +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/optinsn.inc +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/optunifs.inc +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/parse.h +1 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/probes_helper.h +2 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/ractor_core.h +343 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/regenc.h +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/regint.h +1 -1
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/regparse.h +0 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/revision.h +2 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/ruby_assert.h +15 -0
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/ruby_atomic.h +23 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/siphash.h +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/symbol.h +4 -4
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/thread_pthread.h +45 -5
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/thread_win32.h +28 -3
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/timev.h +1 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/transcode_data.h +2 -3
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/transient_heap.h +6 -3
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/variable.h +22 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/version.h +23 -11
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/vm.inc +707 -671
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/vm_call_iseq_optimized.inc +93 -86
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/vm_callinfo.h +456 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/vm_core.h +262 -194
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/vm_debug.h +116 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/vm_exec.h +9 -6
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.0.0-p0}/vm_insnhelper.h +28 -26
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/vm_opts.h +6 -5
- data/lib/debase/ruby_core_source/ruby-3.0.0-p0/vm_sync.h +136 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.0.0-p0}/vmtc.inc +0 -4
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/addr2line.h +2 -3
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/builtin.h +83 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/ccan/build_assert/build_assert.h +13 -13
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/ccan/check_type/check_type.h +17 -17
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/ccan/container_of/container_of.h +63 -63
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/ccan/list/list.h +262 -262
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/ccan/str/str.h +4 -4
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/constant.h +10 -9
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/darray.h +198 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/debug_counter.h +137 -48
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/dln.h +3 -23
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/encindex.h +3 -2
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/eval_intern.h +34 -41
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/gc.h +24 -11
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/hrtime.h +9 -9
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/id.h +4 -3
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/id_table.h +3 -1
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/insns.inc +6 -8
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/insns_info.inc +1907 -2543
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/array.h +113 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/bignum.h +246 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/bits.h +565 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/class.h +188 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/compar.h +49 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/compile.h +35 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/compilers.h +107 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/complex.h +29 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/cont.h +24 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/dir.h +16 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/enc.h +19 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/encoding.h +30 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/enum.h +18 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/enumerator.h +21 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/error.h +191 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/eval.h +32 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/file.h +38 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/fixnum.h +184 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/gc.h +175 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/hash.h +243 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/imemo.h +243 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/inits.h +50 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/io.h +38 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/load.h +18 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/loadpath.h +16 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/math.h +23 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/missing.h +18 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/numeric.h +271 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/object.h +83 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/parse.h +23 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/proc.h +32 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/process.h +137 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/random.h +16 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/range.h +40 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/rational.h +72 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/re.h +30 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/sanitizers.h +190 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/serial.h +23 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/signal.h +21 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/static_assert.h +16 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/string.h +141 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/struct.h +153 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/symbol.h +40 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/thread.h +53 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/time.h +34 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/transcode.h +20 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/util.h +27 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/variable.h +83 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/vm.h +132 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal/warnings.h +16 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/internal.h +109 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/iseq.h +44 -35
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/known_errors.inc +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/method.h +21 -4
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/mjit.h +231 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/mjit_compile.inc +3322 -2940
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/node.h +39 -23
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/node_name.inc +210 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/opt_sc.inc +0 -2
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/optinsn.inc +7 -7
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/optunifs.inc +1 -1
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/parse.h +9 -5
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/probes_helper.h +9 -7
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/ractor_core.h +346 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/regenc.h +8 -8
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/regint.h +16 -12
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/regparse.h +2 -2
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/revision.h +2 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/ruby_assert.h +14 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/ruby_atomic.h +23 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/siphash.h +0 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/symbol.h +14 -14
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/thread_pthread.h +45 -5
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/thread_win32.h +30 -5
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/timev.h +1 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/transcode_data.h +49 -50
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/transient_heap.h +6 -3
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/variable.h +21 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/version.h +15 -4
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/vm.inc +1033 -887
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/vm_call_iseq_optimized.inc +244 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/vm_callinfo.h +454 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/vm_core.h +508 -362
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/vm_debug.h +119 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/vm_exec.h +22 -18
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview3 → ruby-3.1.0-preview1}/vm_insnhelper.h +42 -32
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/vm_opts.h +8 -5
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/vm_sync.h +137 -0
- data/lib/debase/ruby_core_source/{ruby-2.7.0-preview2 → ruby-3.1.0-preview1}/vmtc.inc +6 -8
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/yjit.h +63 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/yjit_asm.h +392 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/yjit_codegen.h +19 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/yjit_core.h +302 -0
- data/lib/debase/ruby_core_source/ruby-3.1.0-preview1/yjit_iface.h +38 -0
- data/lib/debase/ruby_core_source/version.rb +1 -1
- data/lib/debase/ruby_core_source.rb +0 -2
- metadata +240 -110
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview2/internal.h +0 -2682
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview2/revision.h +0 -2
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview2/ruby_assert.h +0 -15
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview2/ruby_atomic.h +0 -244
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview2/vm_call_iseq_optimized.inc +0 -237
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview2/vm_debug.h +0 -34
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview3/internal.h +0 -2657
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview3/mjit.h +0 -175
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview3/node_name.inc +0 -208
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview3/revision.h +0 -2
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview3/ruby_assert.h +0 -15
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview3/ruby_atomic.h +0 -244
- data/lib/debase/ruby_core_source/ruby-2.7.0-preview3/vm_debug.h +0 -34
@@ -1,2682 +0,0 @@
|
|
1
|
-
/**********************************************************************
|
2
|
-
|
3
|
-
internal.h -
|
4
|
-
|
5
|
-
$Author$
|
6
|
-
created at: Tue May 17 11:42:20 JST 2011
|
7
|
-
|
8
|
-
Copyright (C) 2011 Yukihiro Matsumoto
|
9
|
-
|
10
|
-
**********************************************************************/
|
11
|
-
|
12
|
-
#ifndef RUBY_INTERNAL_H
|
13
|
-
#define RUBY_INTERNAL_H 1
|
14
|
-
|
15
|
-
#include "ruby.h"
|
16
|
-
|
17
|
-
#if defined(__cplusplus)
|
18
|
-
extern "C" {
|
19
|
-
#if 0
|
20
|
-
} /* satisfy cc-mode */
|
21
|
-
#endif
|
22
|
-
#endif
|
23
|
-
|
24
|
-
#ifdef HAVE_STDBOOL_H
|
25
|
-
# include <stdbool.h>
|
26
|
-
#else
|
27
|
-
# include "missing/stdbool.h"
|
28
|
-
#endif
|
29
|
-
|
30
|
-
/* The most significant bit of the lower part of half-long integer.
|
31
|
-
* If sizeof(long) == 4, this is 0x8000.
|
32
|
-
* If sizeof(long) == 8, this is 0x80000000.
|
33
|
-
*/
|
34
|
-
#define HALF_LONG_MSB ((SIGNED_VALUE)1<<((SIZEOF_LONG*CHAR_BIT-1)/2))
|
35
|
-
|
36
|
-
#define LIKELY(x) RB_LIKELY(x)
|
37
|
-
#define UNLIKELY(x) RB_UNLIKELY(x)
|
38
|
-
|
39
|
-
#ifndef MAYBE_UNUSED
|
40
|
-
# define MAYBE_UNUSED(x) x
|
41
|
-
#endif
|
42
|
-
|
43
|
-
#ifndef WARN_UNUSED_RESULT
|
44
|
-
# define WARN_UNUSED_RESULT(x) x
|
45
|
-
#endif
|
46
|
-
|
47
|
-
#ifndef __has_feature
|
48
|
-
# define __has_feature(x) 0
|
49
|
-
#endif
|
50
|
-
|
51
|
-
#ifndef __has_extension
|
52
|
-
# define __has_extension __has_feature
|
53
|
-
#endif
|
54
|
-
|
55
|
-
#if 0
|
56
|
-
#elif defined(NO_SANITIZE) && __has_feature(memory_sanitizer)
|
57
|
-
# define ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS(x) \
|
58
|
-
NO_SANITIZE("memory", NO_SANITIZE("address", NOINLINE(x)))
|
59
|
-
#elif defined(NO_SANITIZE)
|
60
|
-
# define ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS(x) \
|
61
|
-
NO_SANITIZE("address", NOINLINE(x))
|
62
|
-
#elif defined(NO_SANITIZE_ADDRESS)
|
63
|
-
# define ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS(x) \
|
64
|
-
NO_SANITIZE_ADDRESS(NOINLINE(x))
|
65
|
-
#elif defined(NO_ADDRESS_SAFETY_ANALYSIS)
|
66
|
-
# define ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS(x) \
|
67
|
-
NO_ADDRESS_SAFETY_ANALYSIS(NOINLINE(x))
|
68
|
-
#else
|
69
|
-
# define ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS(x) x
|
70
|
-
#endif
|
71
|
-
|
72
|
-
#if defined(NO_SANITIZE) && defined(__GNUC__) &&! defined(__clang__)
|
73
|
-
/* GCC warns about unknown sanitizer, which is annoying. */
|
74
|
-
#undef NO_SANITIZE
|
75
|
-
#define NO_SANITIZE(x, y) \
|
76
|
-
COMPILER_WARNING_PUSH; \
|
77
|
-
COMPILER_WARNING_IGNORED(-Wattributes); \
|
78
|
-
__attribute__((__no_sanitize__(x))) y; \
|
79
|
-
COMPILER_WARNING_POP
|
80
|
-
#endif
|
81
|
-
|
82
|
-
#ifndef NO_SANITIZE
|
83
|
-
# define NO_SANITIZE(x, y) y
|
84
|
-
#endif
|
85
|
-
|
86
|
-
#ifdef HAVE_VALGRIND_MEMCHECK_H
|
87
|
-
# include <valgrind/memcheck.h>
|
88
|
-
# ifndef VALGRIND_MAKE_MEM_DEFINED
|
89
|
-
# define VALGRIND_MAKE_MEM_DEFINED(p, n) VALGRIND_MAKE_READABLE((p), (n))
|
90
|
-
# endif
|
91
|
-
# ifndef VALGRIND_MAKE_MEM_UNDEFINED
|
92
|
-
# define VALGRIND_MAKE_MEM_UNDEFINED(p, n) VALGRIND_MAKE_WRITABLE((p), (n))
|
93
|
-
# endif
|
94
|
-
#else
|
95
|
-
# define VALGRIND_MAKE_MEM_DEFINED(p, n) 0
|
96
|
-
# define VALGRIND_MAKE_MEM_UNDEFINED(p, n) 0
|
97
|
-
#endif
|
98
|
-
|
99
|
-
#define numberof(array) ((int)(sizeof(array) / sizeof((array)[0])))
|
100
|
-
|
101
|
-
#ifndef MJIT_HEADER
|
102
|
-
|
103
|
-
#ifdef HAVE_SANITIZER_ASAN_INTERFACE_H
|
104
|
-
# include <sanitizer/asan_interface.h>
|
105
|
-
#endif
|
106
|
-
|
107
|
-
#if !__has_feature(address_sanitizer)
|
108
|
-
# define __asan_poison_memory_region(x, y)
|
109
|
-
# define __asan_unpoison_memory_region(x, y)
|
110
|
-
# define __asan_region_is_poisoned(x, y) 0
|
111
|
-
#endif
|
112
|
-
|
113
|
-
#ifdef HAVE_SANITIZER_MSAN_INTERFACE_H
|
114
|
-
# if __has_feature(memory_sanitizer)
|
115
|
-
# include <sanitizer/msan_interface.h>
|
116
|
-
# endif
|
117
|
-
#endif
|
118
|
-
|
119
|
-
#if !__has_feature(memory_sanitizer)
|
120
|
-
# define __msan_allocated_memory(x, y) ((void)(x), (void)(y))
|
121
|
-
# define __msan_poison(x, y) ((void)(x), (void)(y))
|
122
|
-
# define __msan_unpoison(x, y) ((void)(x), (void)(y))
|
123
|
-
# define __msan_unpoison_string(x) ((void)(x))
|
124
|
-
#endif
|
125
|
-
|
126
|
-
/*!
|
127
|
-
* This function asserts that a (continuous) memory region from ptr to size
|
128
|
-
* being "poisoned". Both read / write access to such memory region are
|
129
|
-
* prohibited until properly unpoisoned. The region must be previously
|
130
|
-
* allocated (do not pass a freed pointer here), but not necessarily be an
|
131
|
-
* entire object that the malloc returns. You can punch hole a part of a
|
132
|
-
* gigantic heap arena. This is handy when you do not free an allocated memory
|
133
|
-
* region to reuse later: poison when you keep it unused, and unpoison when you
|
134
|
-
* reuse.
|
135
|
-
*
|
136
|
-
* \param[in] ptr pointer to the beginning of the memory region to poison.
|
137
|
-
* \param[in] size the length of the memory region to poison.
|
138
|
-
*/
|
139
|
-
static inline void
|
140
|
-
asan_poison_memory_region(const volatile void *ptr, size_t size)
|
141
|
-
{
|
142
|
-
__msan_poison(ptr, size);
|
143
|
-
__asan_poison_memory_region(ptr, size);
|
144
|
-
}
|
145
|
-
|
146
|
-
/*!
|
147
|
-
* This is a variant of asan_poison_memory_region that takes a VALUE.
|
148
|
-
*
|
149
|
-
* \param[in] obj target object.
|
150
|
-
*/
|
151
|
-
static inline void
|
152
|
-
asan_poison_object(VALUE obj)
|
153
|
-
{
|
154
|
-
MAYBE_UNUSED(struct RVALUE *) ptr = (void *)obj;
|
155
|
-
asan_poison_memory_region(ptr, SIZEOF_VALUE);
|
156
|
-
}
|
157
|
-
|
158
|
-
#if !__has_feature(address_sanitizer)
|
159
|
-
#define asan_poison_object_if(ptr, obj) ((void)(ptr), (void)(obj))
|
160
|
-
#else
|
161
|
-
#define asan_poison_object_if(ptr, obj) do { \
|
162
|
-
if (ptr) asan_poison_object(obj); \
|
163
|
-
} while (0)
|
164
|
-
#endif
|
165
|
-
|
166
|
-
/*!
|
167
|
-
* This function predicates if the given object is fully addressable or not.
|
168
|
-
*
|
169
|
-
* \param[in] obj target object.
|
170
|
-
* \retval 0 the given object is fully addressable.
|
171
|
-
* \retval otherwise pointer to first such byte who is poisoned.
|
172
|
-
*/
|
173
|
-
static inline void *
|
174
|
-
asan_poisoned_object_p(VALUE obj)
|
175
|
-
{
|
176
|
-
MAYBE_UNUSED(struct RVALUE *) ptr = (void *)obj;
|
177
|
-
return __asan_region_is_poisoned(ptr, SIZEOF_VALUE);
|
178
|
-
}
|
179
|
-
|
180
|
-
/*!
|
181
|
-
* This function asserts that a (formally poisoned) memory region from ptr to
|
182
|
-
* size is now addressable. Write access to such memory region gets allowed.
|
183
|
-
* However read access might or might not be possible depending on situations,
|
184
|
-
* because the region can have contents of previous usages. That information
|
185
|
-
* should be passed by the malloc_p flag. If that is true, the contents of the
|
186
|
-
* region is _not_ fully defined (like the return value of malloc behaves).
|
187
|
-
* Reading from there is NG; write something first. If malloc_p is false on
|
188
|
-
* the other hand, that memory region is fully defined and can be read
|
189
|
-
* immediately.
|
190
|
-
*
|
191
|
-
* \param[in] ptr pointer to the beginning of the memory region to unpoison.
|
192
|
-
* \param[in] size the length of the memory region.
|
193
|
-
* \param[in] malloc_p if the memory region is like a malloc's return value or not.
|
194
|
-
*/
|
195
|
-
static inline void
|
196
|
-
asan_unpoison_memory_region(const volatile void *ptr, size_t size, bool malloc_p)
|
197
|
-
{
|
198
|
-
__asan_unpoison_memory_region(ptr, size);
|
199
|
-
if (malloc_p) {
|
200
|
-
__msan_allocated_memory(ptr, size);
|
201
|
-
}
|
202
|
-
else {
|
203
|
-
__msan_unpoison(ptr, size);
|
204
|
-
}
|
205
|
-
}
|
206
|
-
|
207
|
-
/*!
|
208
|
-
* This is a variant of asan_unpoison_memory_region that takes a VALUE.
|
209
|
-
*
|
210
|
-
* \param[in] obj target object.
|
211
|
-
* \param[in] malloc_p if the memory region is like a malloc's return value or not.
|
212
|
-
*/
|
213
|
-
static inline void
|
214
|
-
asan_unpoison_object(VALUE obj, bool newobj_p)
|
215
|
-
{
|
216
|
-
MAYBE_UNUSED(struct RVALUE *) ptr = (void *)obj;
|
217
|
-
asan_unpoison_memory_region(ptr, SIZEOF_VALUE, newobj_p);
|
218
|
-
}
|
219
|
-
|
220
|
-
#endif
|
221
|
-
|
222
|
-
/* Prevent compiler from reordering access */
|
223
|
-
#define ACCESS_ONCE(type,x) (*((volatile type *)&(x)))
|
224
|
-
|
225
|
-
#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L)
|
226
|
-
# define STATIC_ASSERT(name, expr) _Static_assert(expr, #name ": " #expr)
|
227
|
-
#elif GCC_VERSION_SINCE(4, 6, 0) || __has_extension(c_static_assert)
|
228
|
-
# define STATIC_ASSERT(name, expr) RB_GNUC_EXTENSION _Static_assert(expr, #name ": " #expr)
|
229
|
-
#else
|
230
|
-
# define STATIC_ASSERT(name, expr) typedef int static_assert_##name##_check[1 - 2*!(expr)]
|
231
|
-
#endif
|
232
|
-
|
233
|
-
#define SIGNED_INTEGER_TYPE_P(int_type) (0 > ((int_type)0)-1)
|
234
|
-
#define SIGNED_INTEGER_MAX(sint_type) \
|
235
|
-
(sint_type) \
|
236
|
-
((((sint_type)1) << (sizeof(sint_type) * CHAR_BIT - 2)) | \
|
237
|
-
((((sint_type)1) << (sizeof(sint_type) * CHAR_BIT - 2)) - 1))
|
238
|
-
#define SIGNED_INTEGER_MIN(sint_type) (-SIGNED_INTEGER_MAX(sint_type)-1)
|
239
|
-
#define UNSIGNED_INTEGER_MAX(uint_type) (~(uint_type)0)
|
240
|
-
|
241
|
-
#if SIGNEDNESS_OF_TIME_T < 0 /* signed */
|
242
|
-
# define TIMET_MAX SIGNED_INTEGER_MAX(time_t)
|
243
|
-
# define TIMET_MIN SIGNED_INTEGER_MIN(time_t)
|
244
|
-
#elif SIGNEDNESS_OF_TIME_T > 0 /* unsigned */
|
245
|
-
# define TIMET_MAX UNSIGNED_INTEGER_MAX(time_t)
|
246
|
-
# define TIMET_MIN ((time_t)0)
|
247
|
-
#endif
|
248
|
-
#define TIMET_MAX_PLUS_ONE (2*(double)(TIMET_MAX/2+1))
|
249
|
-
|
250
|
-
#ifdef HAVE_BUILTIN___BUILTIN_MUL_OVERFLOW_P
|
251
|
-
#define MUL_OVERFLOW_P(a, b) \
|
252
|
-
__builtin_mul_overflow_p((a), (b), (__typeof__(a * b))0)
|
253
|
-
#elif defined HAVE_BUILTIN___BUILTIN_MUL_OVERFLOW
|
254
|
-
#define MUL_OVERFLOW_P(a, b) \
|
255
|
-
RB_GNUC_EXTENSION_BLOCK(__typeof__(a) c; __builtin_mul_overflow((a), (b), &c))
|
256
|
-
#endif
|
257
|
-
|
258
|
-
#define MUL_OVERFLOW_SIGNED_INTEGER_P(a, b, min, max) ( \
|
259
|
-
(a) == 0 ? 0 : \
|
260
|
-
(a) == -1 ? (b) < -(max) : \
|
261
|
-
(a) > 0 ? \
|
262
|
-
((b) > 0 ? (max) / (a) < (b) : (min) / (a) > (b)) : \
|
263
|
-
((b) > 0 ? (min) / (a) < (b) : (max) / (a) > (b)))
|
264
|
-
|
265
|
-
#ifdef HAVE_BUILTIN___BUILTIN_MUL_OVERFLOW_P
|
266
|
-
/* __builtin_mul_overflow_p can take bitfield */
|
267
|
-
/* and GCC permits bitfields for integers other than int */
|
268
|
-
#define MUL_OVERFLOW_FIXNUM_P(a, b) RB_GNUC_EXTENSION_BLOCK( \
|
269
|
-
struct { long fixnum : SIZEOF_LONG * CHAR_BIT - 1; } c; \
|
270
|
-
__builtin_mul_overflow_p((a), (b), c.fixnum); \
|
271
|
-
)
|
272
|
-
#else
|
273
|
-
#define MUL_OVERFLOW_FIXNUM_P(a, b) MUL_OVERFLOW_SIGNED_INTEGER_P(a, b, FIXNUM_MIN, FIXNUM_MAX)
|
274
|
-
#endif
|
275
|
-
|
276
|
-
#ifdef MUL_OVERFLOW_P
|
277
|
-
#define MUL_OVERFLOW_LONG_LONG_P(a, b) MUL_OVERFLOW_P(a, b)
|
278
|
-
#define MUL_OVERFLOW_LONG_P(a, b) MUL_OVERFLOW_P(a, b)
|
279
|
-
#define MUL_OVERFLOW_INT_P(a, b) MUL_OVERFLOW_P(a, b)
|
280
|
-
#else
|
281
|
-
#define MUL_OVERFLOW_LONG_LONG_P(a, b) MUL_OVERFLOW_SIGNED_INTEGER_P(a, b, LLONG_MIN, LLONG_MAX)
|
282
|
-
#define MUL_OVERFLOW_LONG_P(a, b) MUL_OVERFLOW_SIGNED_INTEGER_P(a, b, LONG_MIN, LONG_MAX)
|
283
|
-
#define MUL_OVERFLOW_INT_P(a, b) MUL_OVERFLOW_SIGNED_INTEGER_P(a, b, INT_MIN, INT_MAX)
|
284
|
-
#endif
|
285
|
-
|
286
|
-
#ifndef swap16
|
287
|
-
# ifdef HAVE_BUILTIN___BUILTIN_BSWAP16
|
288
|
-
# define swap16(x) __builtin_bswap16(x)
|
289
|
-
# endif
|
290
|
-
#endif
|
291
|
-
|
292
|
-
#ifndef swap16
|
293
|
-
# define swap16(x) ((uint16_t)((((x)&0xFF)<<8) | (((x)>>8)&0xFF)))
|
294
|
-
#endif
|
295
|
-
|
296
|
-
#ifndef swap32
|
297
|
-
# ifdef HAVE_BUILTIN___BUILTIN_BSWAP32
|
298
|
-
# define swap32(x) __builtin_bswap32(x)
|
299
|
-
# endif
|
300
|
-
#endif
|
301
|
-
|
302
|
-
#ifndef swap32
|
303
|
-
# define swap32(x) ((uint32_t)((((x)&0xFF)<<24) \
|
304
|
-
|(((x)>>24)&0xFF) \
|
305
|
-
|(((x)&0x0000FF00)<<8) \
|
306
|
-
|(((x)&0x00FF0000)>>8) ))
|
307
|
-
#endif
|
308
|
-
|
309
|
-
#ifndef swap64
|
310
|
-
# ifdef HAVE_BUILTIN___BUILTIN_BSWAP64
|
311
|
-
# define swap64(x) __builtin_bswap64(x)
|
312
|
-
# endif
|
313
|
-
#endif
|
314
|
-
|
315
|
-
#ifndef swap64
|
316
|
-
# ifdef HAVE_INT64_T
|
317
|
-
# define byte_in_64bit(n) ((uint64_t)0xff << (n))
|
318
|
-
# define swap64(x) ((uint64_t)((((x)&byte_in_64bit(0))<<56) \
|
319
|
-
|(((x)>>56)&0xFF) \
|
320
|
-
|(((x)&byte_in_64bit(8))<<40) \
|
321
|
-
|(((x)&byte_in_64bit(48))>>40) \
|
322
|
-
|(((x)&byte_in_64bit(16))<<24) \
|
323
|
-
|(((x)&byte_in_64bit(40))>>24) \
|
324
|
-
|(((x)&byte_in_64bit(24))<<8) \
|
325
|
-
|(((x)&byte_in_64bit(32))>>8)))
|
326
|
-
# endif
|
327
|
-
#endif
|
328
|
-
|
329
|
-
static inline unsigned int
|
330
|
-
nlz_int(unsigned int x)
|
331
|
-
{
|
332
|
-
#if defined(HAVE_BUILTIN___BUILTIN_CLZ)
|
333
|
-
if (x == 0) return SIZEOF_INT * CHAR_BIT;
|
334
|
-
return (unsigned int)__builtin_clz(x);
|
335
|
-
#else
|
336
|
-
unsigned int y;
|
337
|
-
# if 64 < SIZEOF_INT * CHAR_BIT
|
338
|
-
unsigned int n = 128;
|
339
|
-
# elif 32 < SIZEOF_INT * CHAR_BIT
|
340
|
-
unsigned int n = 64;
|
341
|
-
# else
|
342
|
-
unsigned int n = 32;
|
343
|
-
# endif
|
344
|
-
# if 64 < SIZEOF_INT * CHAR_BIT
|
345
|
-
y = x >> 64; if (y) {n -= 64; x = y;}
|
346
|
-
# endif
|
347
|
-
# if 32 < SIZEOF_INT * CHAR_BIT
|
348
|
-
y = x >> 32; if (y) {n -= 32; x = y;}
|
349
|
-
# endif
|
350
|
-
y = x >> 16; if (y) {n -= 16; x = y;}
|
351
|
-
y = x >> 8; if (y) {n -= 8; x = y;}
|
352
|
-
y = x >> 4; if (y) {n -= 4; x = y;}
|
353
|
-
y = x >> 2; if (y) {n -= 2; x = y;}
|
354
|
-
y = x >> 1; if (y) {return n - 2;}
|
355
|
-
return (unsigned int)(n - x);
|
356
|
-
#endif
|
357
|
-
}
|
358
|
-
|
359
|
-
static inline unsigned int
|
360
|
-
nlz_long(unsigned long x)
|
361
|
-
{
|
362
|
-
#if defined(HAVE_BUILTIN___BUILTIN_CLZL)
|
363
|
-
if (x == 0) return SIZEOF_LONG * CHAR_BIT;
|
364
|
-
return (unsigned int)__builtin_clzl(x);
|
365
|
-
#else
|
366
|
-
unsigned long y;
|
367
|
-
# if 64 < SIZEOF_LONG * CHAR_BIT
|
368
|
-
unsigned int n = 128;
|
369
|
-
# elif 32 < SIZEOF_LONG * CHAR_BIT
|
370
|
-
unsigned int n = 64;
|
371
|
-
# else
|
372
|
-
unsigned int n = 32;
|
373
|
-
# endif
|
374
|
-
# if 64 < SIZEOF_LONG * CHAR_BIT
|
375
|
-
y = x >> 64; if (y) {n -= 64; x = y;}
|
376
|
-
# endif
|
377
|
-
# if 32 < SIZEOF_LONG * CHAR_BIT
|
378
|
-
y = x >> 32; if (y) {n -= 32; x = y;}
|
379
|
-
# endif
|
380
|
-
y = x >> 16; if (y) {n -= 16; x = y;}
|
381
|
-
y = x >> 8; if (y) {n -= 8; x = y;}
|
382
|
-
y = x >> 4; if (y) {n -= 4; x = y;}
|
383
|
-
y = x >> 2; if (y) {n -= 2; x = y;}
|
384
|
-
y = x >> 1; if (y) {return n - 2;}
|
385
|
-
return (unsigned int)(n - x);
|
386
|
-
#endif
|
387
|
-
}
|
388
|
-
|
389
|
-
#ifdef HAVE_LONG_LONG
|
390
|
-
static inline unsigned int
|
391
|
-
nlz_long_long(unsigned LONG_LONG x)
|
392
|
-
{
|
393
|
-
#if defined(HAVE_BUILTIN___BUILTIN_CLZLL)
|
394
|
-
if (x == 0) return SIZEOF_LONG_LONG * CHAR_BIT;
|
395
|
-
return (unsigned int)__builtin_clzll(x);
|
396
|
-
#else
|
397
|
-
unsigned LONG_LONG y;
|
398
|
-
# if 64 < SIZEOF_LONG_LONG * CHAR_BIT
|
399
|
-
unsigned int n = 128;
|
400
|
-
# elif 32 < SIZEOF_LONG_LONG * CHAR_BIT
|
401
|
-
unsigned int n = 64;
|
402
|
-
# else
|
403
|
-
unsigned int n = 32;
|
404
|
-
# endif
|
405
|
-
# if 64 < SIZEOF_LONG_LONG * CHAR_BIT
|
406
|
-
y = x >> 64; if (y) {n -= 64; x = y;}
|
407
|
-
# endif
|
408
|
-
# if 32 < SIZEOF_LONG_LONG * CHAR_BIT
|
409
|
-
y = x >> 32; if (y) {n -= 32; x = y;}
|
410
|
-
# endif
|
411
|
-
y = x >> 16; if (y) {n -= 16; x = y;}
|
412
|
-
y = x >> 8; if (y) {n -= 8; x = y;}
|
413
|
-
y = x >> 4; if (y) {n -= 4; x = y;}
|
414
|
-
y = x >> 2; if (y) {n -= 2; x = y;}
|
415
|
-
y = x >> 1; if (y) {return n - 2;}
|
416
|
-
return (unsigned int)(n - x);
|
417
|
-
#endif
|
418
|
-
}
|
419
|
-
#endif
|
420
|
-
|
421
|
-
#ifdef HAVE_UINT128_T
|
422
|
-
static inline unsigned int
|
423
|
-
nlz_int128(uint128_t x)
|
424
|
-
{
|
425
|
-
uint128_t y;
|
426
|
-
unsigned int n = 128;
|
427
|
-
y = x >> 64; if (y) {n -= 64; x = y;}
|
428
|
-
y = x >> 32; if (y) {n -= 32; x = y;}
|
429
|
-
y = x >> 16; if (y) {n -= 16; x = y;}
|
430
|
-
y = x >> 8; if (y) {n -= 8; x = y;}
|
431
|
-
y = x >> 4; if (y) {n -= 4; x = y;}
|
432
|
-
y = x >> 2; if (y) {n -= 2; x = y;}
|
433
|
-
y = x >> 1; if (y) {return n - 2;}
|
434
|
-
return (unsigned int)(n - x);
|
435
|
-
}
|
436
|
-
#endif
|
437
|
-
|
438
|
-
static inline unsigned int
|
439
|
-
nlz_intptr(uintptr_t x)
|
440
|
-
{
|
441
|
-
#if SIZEOF_UINTPTR_T == SIZEOF_INT
|
442
|
-
return nlz_int(x);
|
443
|
-
#elif SIZEOF_UINTPTR_T == SIZEOF_LONG
|
444
|
-
return nlz_long(x);
|
445
|
-
#elif SIZEOF_UINTPTR_T == SIZEOF_LONG_LONG
|
446
|
-
return nlz_long_long(x);
|
447
|
-
#else
|
448
|
-
#error no known integer type corresponds uintptr_t
|
449
|
-
return /* sane compiler */ ~0;
|
450
|
-
#endif
|
451
|
-
}
|
452
|
-
|
453
|
-
static inline unsigned int
|
454
|
-
rb_popcount32(uint32_t x)
|
455
|
-
{
|
456
|
-
#ifdef HAVE_BUILTIN___BUILTIN_POPCOUNT
|
457
|
-
return (unsigned int)__builtin_popcount(x);
|
458
|
-
#else
|
459
|
-
x = (x & 0x55555555) + (x >> 1 & 0x55555555);
|
460
|
-
x = (x & 0x33333333) + (x >> 2 & 0x33333333);
|
461
|
-
x = (x & 0x0f0f0f0f) + (x >> 4 & 0x0f0f0f0f);
|
462
|
-
x = (x & 0x001f001f) + (x >> 8 & 0x001f001f);
|
463
|
-
return (x & 0x0000003f) + (x >>16 & 0x0000003f);
|
464
|
-
#endif
|
465
|
-
}
|
466
|
-
|
467
|
-
static inline int
|
468
|
-
rb_popcount64(uint64_t x)
|
469
|
-
{
|
470
|
-
#ifdef HAVE_BUILTIN___BUILTIN_POPCOUNT
|
471
|
-
return __builtin_popcountll(x);
|
472
|
-
#else
|
473
|
-
x = (x & 0x5555555555555555) + (x >> 1 & 0x5555555555555555);
|
474
|
-
x = (x & 0x3333333333333333) + (x >> 2 & 0x3333333333333333);
|
475
|
-
x = (x & 0x0707070707070707) + (x >> 4 & 0x0707070707070707);
|
476
|
-
x = (x & 0x001f001f001f001f) + (x >> 8 & 0x001f001f001f001f);
|
477
|
-
x = (x & 0x0000003f0000003f) + (x >>16 & 0x0000003f0000003f);
|
478
|
-
return (x & 0x7f) + (x >>32 & 0x7f);
|
479
|
-
#endif
|
480
|
-
}
|
481
|
-
|
482
|
-
static inline int
|
483
|
-
rb_popcount_intptr(uintptr_t x)
|
484
|
-
{
|
485
|
-
#if SIZEOF_VOIDP == 8
|
486
|
-
return rb_popcount64(x);
|
487
|
-
#elif SIZEOF_VOIDP == 4
|
488
|
-
return rb_popcount32(x);
|
489
|
-
#endif
|
490
|
-
}
|
491
|
-
|
492
|
-
static inline int
|
493
|
-
ntz_int32(uint32_t x)
|
494
|
-
{
|
495
|
-
#ifdef HAVE_BUILTIN___BUILTIN_CTZ
|
496
|
-
return __builtin_ctz(x);
|
497
|
-
#else
|
498
|
-
return rb_popcount32((~x) & (x-1));
|
499
|
-
#endif
|
500
|
-
}
|
501
|
-
|
502
|
-
static inline int
|
503
|
-
ntz_int64(uint64_t x)
|
504
|
-
{
|
505
|
-
#ifdef HAVE_BUILTIN___BUILTIN_CTZLL
|
506
|
-
return __builtin_ctzll(x);
|
507
|
-
#else
|
508
|
-
return rb_popcount64((~x) & (x-1));
|
509
|
-
#endif
|
510
|
-
}
|
511
|
-
|
512
|
-
static inline int
|
513
|
-
ntz_intptr(uintptr_t x)
|
514
|
-
{
|
515
|
-
#if SIZEOF_VOIDP == 8
|
516
|
-
return ntz_int64(x);
|
517
|
-
#elif SIZEOF_VOIDP == 4
|
518
|
-
return ntz_int32(x);
|
519
|
-
#endif
|
520
|
-
}
|
521
|
-
|
522
|
-
#if HAVE_LONG_LONG && SIZEOF_LONG * 2 <= SIZEOF_LONG_LONG
|
523
|
-
# define DLONG LONG_LONG
|
524
|
-
# define DL2NUM(x) LL2NUM(x)
|
525
|
-
#elif defined(HAVE_INT128_T)
|
526
|
-
# define DLONG int128_t
|
527
|
-
# define DL2NUM(x) (RB_FIXABLE(x) ? LONG2FIX(x) : rb_int128t2big(x))
|
528
|
-
VALUE rb_int128t2big(int128_t n);
|
529
|
-
#endif
|
530
|
-
|
531
|
-
static inline long
|
532
|
-
rb_overflowed_fix_to_int(long x)
|
533
|
-
{
|
534
|
-
return (long)((unsigned long)(x >> 1) ^ (1LU << (SIZEOF_LONG * CHAR_BIT - 1)));
|
535
|
-
}
|
536
|
-
|
537
|
-
static inline VALUE
|
538
|
-
rb_fix_plus_fix(VALUE x, VALUE y)
|
539
|
-
{
|
540
|
-
#ifdef HAVE_BUILTIN___BUILTIN_ADD_OVERFLOW
|
541
|
-
long lz;
|
542
|
-
/* NOTE
|
543
|
-
* (1) `LONG2FIX(FIX2LONG(x)+FIX2LONG(y))`
|
544
|
-
+ = `((lx*2+1)/2 + (ly*2+1)/2)*2+1`
|
545
|
-
+ = `lx*2 + ly*2 + 1`
|
546
|
-
+ = `(lx*2+1) + (ly*2+1) - 1`
|
547
|
-
+ = `x + y - 1`
|
548
|
-
* (2) Fixnum's LSB is always 1.
|
549
|
-
* It means you can always run `x - 1` without overflow.
|
550
|
-
* (3) Of course `z = x + (y-1)` may overflow.
|
551
|
-
* At that time true value is
|
552
|
-
* * positive: 0b0 1xxx...1, and z = 0b1xxx...1
|
553
|
-
* * nevative: 0b1 0xxx...1, and z = 0b0xxx...1
|
554
|
-
* To convert this true value to long,
|
555
|
-
* (a) Use arithmetic shift
|
556
|
-
* * positive: 0b11xxx...
|
557
|
-
* * negative: 0b00xxx...
|
558
|
-
* (b) invert MSB
|
559
|
-
* * positive: 0b01xxx...
|
560
|
-
* * negative: 0b10xxx...
|
561
|
-
*/
|
562
|
-
if (__builtin_add_overflow((long)x, (long)y-1, &lz)) {
|
563
|
-
return rb_int2big(rb_overflowed_fix_to_int(lz));
|
564
|
-
}
|
565
|
-
else {
|
566
|
-
return (VALUE)lz;
|
567
|
-
}
|
568
|
-
#else
|
569
|
-
long lz = FIX2LONG(x) + FIX2LONG(y);
|
570
|
-
return LONG2NUM(lz);
|
571
|
-
#endif
|
572
|
-
}
|
573
|
-
|
574
|
-
static inline VALUE
|
575
|
-
rb_fix_minus_fix(VALUE x, VALUE y)
|
576
|
-
{
|
577
|
-
#ifdef HAVE_BUILTIN___BUILTIN_SUB_OVERFLOW
|
578
|
-
long lz;
|
579
|
-
if (__builtin_sub_overflow((long)x, (long)y-1, &lz)) {
|
580
|
-
return rb_int2big(rb_overflowed_fix_to_int(lz));
|
581
|
-
}
|
582
|
-
else {
|
583
|
-
return (VALUE)lz;
|
584
|
-
}
|
585
|
-
#else
|
586
|
-
long lz = FIX2LONG(x) - FIX2LONG(y);
|
587
|
-
return LONG2NUM(lz);
|
588
|
-
#endif
|
589
|
-
}
|
590
|
-
|
591
|
-
/* arguments must be Fixnum */
|
592
|
-
static inline VALUE
|
593
|
-
rb_fix_mul_fix(VALUE x, VALUE y)
|
594
|
-
{
|
595
|
-
long lx = FIX2LONG(x);
|
596
|
-
long ly = FIX2LONG(y);
|
597
|
-
#ifdef DLONG
|
598
|
-
return DL2NUM((DLONG)lx * (DLONG)ly);
|
599
|
-
#else
|
600
|
-
if (MUL_OVERFLOW_FIXNUM_P(lx, ly)) {
|
601
|
-
return rb_big_mul(rb_int2big(lx), rb_int2big(ly));
|
602
|
-
}
|
603
|
-
else {
|
604
|
-
return LONG2FIX(lx * ly);
|
605
|
-
}
|
606
|
-
#endif
|
607
|
-
}
|
608
|
-
|
609
|
-
/*
|
610
|
-
* This behaves different from C99 for negative arguments.
|
611
|
-
* Note that div may overflow fixnum.
|
612
|
-
*/
|
613
|
-
static inline void
|
614
|
-
rb_fix_divmod_fix(VALUE a, VALUE b, VALUE *divp, VALUE *modp)
|
615
|
-
{
|
616
|
-
/* assume / and % comply C99.
|
617
|
-
* ldiv(3) won't be inlined by GCC and clang.
|
618
|
-
* I expect / and % are compiled as single idiv.
|
619
|
-
*/
|
620
|
-
long x = FIX2LONG(a);
|
621
|
-
long y = FIX2LONG(b);
|
622
|
-
long div, mod;
|
623
|
-
if (x == FIXNUM_MIN && y == -1) {
|
624
|
-
if (divp) *divp = LONG2NUM(-FIXNUM_MIN);
|
625
|
-
if (modp) *modp = LONG2FIX(0);
|
626
|
-
return;
|
627
|
-
}
|
628
|
-
div = x / y;
|
629
|
-
mod = x % y;
|
630
|
-
if (y > 0 ? mod < 0 : mod > 0) {
|
631
|
-
mod += y;
|
632
|
-
div -= 1;
|
633
|
-
}
|
634
|
-
if (divp) *divp = LONG2FIX(div);
|
635
|
-
if (modp) *modp = LONG2FIX(mod);
|
636
|
-
}
|
637
|
-
|
638
|
-
/* div() for Ruby
|
639
|
-
* This behaves different from C99 for negative arguments.
|
640
|
-
*/
|
641
|
-
static inline VALUE
|
642
|
-
rb_fix_div_fix(VALUE x, VALUE y)
|
643
|
-
{
|
644
|
-
VALUE div;
|
645
|
-
rb_fix_divmod_fix(x, y, &div, NULL);
|
646
|
-
return div;
|
647
|
-
}
|
648
|
-
|
649
|
-
/* mod() for Ruby
|
650
|
-
* This behaves different from C99 for negative arguments.
|
651
|
-
*/
|
652
|
-
static inline VALUE
|
653
|
-
rb_fix_mod_fix(VALUE x, VALUE y)
|
654
|
-
{
|
655
|
-
VALUE mod;
|
656
|
-
rb_fix_divmod_fix(x, y, NULL, &mod);
|
657
|
-
return mod;
|
658
|
-
}
|
659
|
-
|
660
|
-
#if defined(HAVE_UINT128_T) && defined(HAVE_LONG_LONG)
|
661
|
-
# define bit_length(x) \
|
662
|
-
(unsigned int) \
|
663
|
-
(sizeof(x) <= SIZEOF_INT ? SIZEOF_INT * CHAR_BIT - nlz_int((unsigned int)(x)) : \
|
664
|
-
sizeof(x) <= SIZEOF_LONG ? SIZEOF_LONG * CHAR_BIT - nlz_long((unsigned long)(x)) : \
|
665
|
-
sizeof(x) <= SIZEOF_LONG_LONG ? SIZEOF_LONG_LONG * CHAR_BIT - nlz_long_long((unsigned LONG_LONG)(x)) : \
|
666
|
-
SIZEOF_INT128_T * CHAR_BIT - nlz_int128((uint128_t)(x)))
|
667
|
-
#elif defined(HAVE_UINT128_T)
|
668
|
-
# define bit_length(x) \
|
669
|
-
(unsigned int) \
|
670
|
-
(sizeof(x) <= SIZEOF_INT ? SIZEOF_INT * CHAR_BIT - nlz_int((unsigned int)(x)) : \
|
671
|
-
sizeof(x) <= SIZEOF_LONG ? SIZEOF_LONG * CHAR_BIT - nlz_long((unsigned long)(x)) : \
|
672
|
-
SIZEOF_INT128_T * CHAR_BIT - nlz_int128((uint128_t)(x)))
|
673
|
-
#elif defined(HAVE_LONG_LONG)
|
674
|
-
# define bit_length(x) \
|
675
|
-
(unsigned int) \
|
676
|
-
(sizeof(x) <= SIZEOF_INT ? SIZEOF_INT * CHAR_BIT - nlz_int((unsigned int)(x)) : \
|
677
|
-
sizeof(x) <= SIZEOF_LONG ? SIZEOF_LONG * CHAR_BIT - nlz_long((unsigned long)(x)) : \
|
678
|
-
SIZEOF_LONG_LONG * CHAR_BIT - nlz_long_long((unsigned LONG_LONG)(x)))
|
679
|
-
#else
|
680
|
-
# define bit_length(x) \
|
681
|
-
(unsigned int) \
|
682
|
-
(sizeof(x) <= SIZEOF_INT ? SIZEOF_INT * CHAR_BIT - nlz_int((unsigned int)(x)) : \
|
683
|
-
SIZEOF_LONG * CHAR_BIT - nlz_long((unsigned long)(x)))
|
684
|
-
#endif
|
685
|
-
|
686
|
-
#ifndef BDIGIT
|
687
|
-
# if SIZEOF_INT*2 <= SIZEOF_LONG_LONG
|
688
|
-
# define BDIGIT unsigned int
|
689
|
-
# define SIZEOF_BDIGIT SIZEOF_INT
|
690
|
-
# define BDIGIT_DBL unsigned LONG_LONG
|
691
|
-
# define BDIGIT_DBL_SIGNED LONG_LONG
|
692
|
-
# define PRI_BDIGIT_PREFIX ""
|
693
|
-
# define PRI_BDIGIT_DBL_PREFIX PRI_LL_PREFIX
|
694
|
-
# elif SIZEOF_INT*2 <= SIZEOF_LONG
|
695
|
-
# define BDIGIT unsigned int
|
696
|
-
# define SIZEOF_BDIGIT SIZEOF_INT
|
697
|
-
# define BDIGIT_DBL unsigned long
|
698
|
-
# define BDIGIT_DBL_SIGNED long
|
699
|
-
# define PRI_BDIGIT_PREFIX ""
|
700
|
-
# define PRI_BDIGIT_DBL_PREFIX "l"
|
701
|
-
# elif SIZEOF_SHORT*2 <= SIZEOF_LONG
|
702
|
-
# define BDIGIT unsigned short
|
703
|
-
# define SIZEOF_BDIGIT SIZEOF_SHORT
|
704
|
-
# define BDIGIT_DBL unsigned long
|
705
|
-
# define BDIGIT_DBL_SIGNED long
|
706
|
-
# define PRI_BDIGIT_PREFIX "h"
|
707
|
-
# define PRI_BDIGIT_DBL_PREFIX "l"
|
708
|
-
# else
|
709
|
-
# define BDIGIT unsigned short
|
710
|
-
# define SIZEOF_BDIGIT (SIZEOF_LONG/2)
|
711
|
-
# define SIZEOF_ACTUAL_BDIGIT SIZEOF_LONG
|
712
|
-
# define BDIGIT_DBL unsigned long
|
713
|
-
# define BDIGIT_DBL_SIGNED long
|
714
|
-
# define PRI_BDIGIT_PREFIX "h"
|
715
|
-
# define PRI_BDIGIT_DBL_PREFIX "l"
|
716
|
-
# endif
|
717
|
-
#endif
|
718
|
-
#ifndef SIZEOF_ACTUAL_BDIGIT
|
719
|
-
# define SIZEOF_ACTUAL_BDIGIT SIZEOF_BDIGIT
|
720
|
-
#endif
|
721
|
-
|
722
|
-
#ifdef PRI_BDIGIT_PREFIX
|
723
|
-
# define PRIdBDIGIT PRI_BDIGIT_PREFIX"d"
|
724
|
-
# define PRIiBDIGIT PRI_BDIGIT_PREFIX"i"
|
725
|
-
# define PRIoBDIGIT PRI_BDIGIT_PREFIX"o"
|
726
|
-
# define PRIuBDIGIT PRI_BDIGIT_PREFIX"u"
|
727
|
-
# define PRIxBDIGIT PRI_BDIGIT_PREFIX"x"
|
728
|
-
# define PRIXBDIGIT PRI_BDIGIT_PREFIX"X"
|
729
|
-
#endif
|
730
|
-
|
731
|
-
#ifdef PRI_BDIGIT_DBL_PREFIX
|
732
|
-
# define PRIdBDIGIT_DBL PRI_BDIGIT_DBL_PREFIX"d"
|
733
|
-
# define PRIiBDIGIT_DBL PRI_BDIGIT_DBL_PREFIX"i"
|
734
|
-
# define PRIoBDIGIT_DBL PRI_BDIGIT_DBL_PREFIX"o"
|
735
|
-
# define PRIuBDIGIT_DBL PRI_BDIGIT_DBL_PREFIX"u"
|
736
|
-
# define PRIxBDIGIT_DBL PRI_BDIGIT_DBL_PREFIX"x"
|
737
|
-
# define PRIXBDIGIT_DBL PRI_BDIGIT_DBL_PREFIX"X"
|
738
|
-
#endif
|
739
|
-
|
740
|
-
#define BIGNUM_EMBED_LEN_NUMBITS 3
|
741
|
-
#ifndef BIGNUM_EMBED_LEN_MAX
|
742
|
-
# if (SIZEOF_VALUE*RVALUE_EMBED_LEN_MAX/SIZEOF_ACTUAL_BDIGIT) < (1 << BIGNUM_EMBED_LEN_NUMBITS)-1
|
743
|
-
# define BIGNUM_EMBED_LEN_MAX (SIZEOF_VALUE*RVALUE_EMBED_LEN_MAX/SIZEOF_ACTUAL_BDIGIT)
|
744
|
-
# else
|
745
|
-
# define BIGNUM_EMBED_LEN_MAX ((1 << BIGNUM_EMBED_LEN_NUMBITS)-1)
|
746
|
-
# endif
|
747
|
-
#endif
|
748
|
-
|
749
|
-
struct RBignum {
|
750
|
-
struct RBasic basic;
|
751
|
-
union {
|
752
|
-
struct {
|
753
|
-
size_t len;
|
754
|
-
BDIGIT *digits;
|
755
|
-
} heap;
|
756
|
-
BDIGIT ary[BIGNUM_EMBED_LEN_MAX];
|
757
|
-
} as;
|
758
|
-
};
|
759
|
-
#define BIGNUM_SIGN_BIT ((VALUE)FL_USER1)
|
760
|
-
/* sign: positive:1, negative:0 */
|
761
|
-
#define BIGNUM_SIGN(b) ((RBASIC(b)->flags & BIGNUM_SIGN_BIT) != 0)
|
762
|
-
#define BIGNUM_SET_SIGN(b,sign) \
|
763
|
-
((sign) ? (RBASIC(b)->flags |= BIGNUM_SIGN_BIT) \
|
764
|
-
: (RBASIC(b)->flags &= ~BIGNUM_SIGN_BIT))
|
765
|
-
#define BIGNUM_POSITIVE_P(b) BIGNUM_SIGN(b)
|
766
|
-
#define BIGNUM_NEGATIVE_P(b) (!BIGNUM_SIGN(b))
|
767
|
-
#define BIGNUM_NEGATE(b) (RBASIC(b)->flags ^= BIGNUM_SIGN_BIT)
|
768
|
-
|
769
|
-
#define BIGNUM_EMBED_FLAG ((VALUE)FL_USER2)
|
770
|
-
#define BIGNUM_EMBED_LEN_MASK \
|
771
|
-
(~(~(VALUE)0U << BIGNUM_EMBED_LEN_NUMBITS) << BIGNUM_EMBED_LEN_SHIFT)
|
772
|
-
#define BIGNUM_EMBED_LEN_SHIFT \
|
773
|
-
(FL_USHIFT+3) /* bit offset of BIGNUM_EMBED_LEN_MASK */
|
774
|
-
#define BIGNUM_LEN(b) \
|
775
|
-
((RBASIC(b)->flags & BIGNUM_EMBED_FLAG) ? \
|
776
|
-
(size_t)((RBASIC(b)->flags >> BIGNUM_EMBED_LEN_SHIFT) & \
|
777
|
-
(BIGNUM_EMBED_LEN_MASK >> BIGNUM_EMBED_LEN_SHIFT)) : \
|
778
|
-
RBIGNUM(b)->as.heap.len)
|
779
|
-
/* LSB:BIGNUM_DIGITS(b)[0], MSB:BIGNUM_DIGITS(b)[BIGNUM_LEN(b)-1] */
|
780
|
-
#define BIGNUM_DIGITS(b) \
|
781
|
-
((RBASIC(b)->flags & BIGNUM_EMBED_FLAG) ? \
|
782
|
-
RBIGNUM(b)->as.ary : \
|
783
|
-
RBIGNUM(b)->as.heap.digits)
|
784
|
-
#define BIGNUM_LENINT(b) rb_long2int(BIGNUM_LEN(b))
|
785
|
-
|
786
|
-
#define RBIGNUM(obj) (R_CAST(RBignum)(obj))
|
787
|
-
|
788
|
-
struct RRational {
|
789
|
-
struct RBasic basic;
|
790
|
-
VALUE num;
|
791
|
-
VALUE den;
|
792
|
-
};
|
793
|
-
|
794
|
-
#define RRATIONAL(obj) (R_CAST(RRational)(obj))
|
795
|
-
#define RRATIONAL_SET_NUM(rat, n) RB_OBJ_WRITE((rat), &((struct RRational *)(rat))->num,(n))
|
796
|
-
#define RRATIONAL_SET_DEN(rat, d) RB_OBJ_WRITE((rat), &((struct RRational *)(rat))->den,(d))
|
797
|
-
|
798
|
-
struct RFloat {
|
799
|
-
struct RBasic basic;
|
800
|
-
double float_value;
|
801
|
-
};
|
802
|
-
|
803
|
-
#define RFLOAT(obj) (R_CAST(RFloat)(obj))
|
804
|
-
|
805
|
-
struct RComplex {
|
806
|
-
struct RBasic basic;
|
807
|
-
VALUE real;
|
808
|
-
VALUE imag;
|
809
|
-
};
|
810
|
-
|
811
|
-
#define RCOMPLEX(obj) (R_CAST(RComplex)(obj))
|
812
|
-
|
813
|
-
/* shortcut macro for internal only */
|
814
|
-
#define RCOMPLEX_SET_REAL(cmp, r) RB_OBJ_WRITE((cmp), &((struct RComplex *)(cmp))->real,(r))
|
815
|
-
#define RCOMPLEX_SET_IMAG(cmp, i) RB_OBJ_WRITE((cmp), &((struct RComplex *)(cmp))->imag,(i))
|
816
|
-
|
817
|
-
enum ruby_rhash_flags {
|
818
|
-
RHASH_PASS_AS_KEYWORDS = FL_USER1, /* FL 1 */
|
819
|
-
RHASH_PROC_DEFAULT = FL_USER2, /* FL 2 */
|
820
|
-
RHASH_ST_TABLE_FLAG = FL_USER3, /* FL 3 */
|
821
|
-
#define RHASH_AR_TABLE_MAX_SIZE SIZEOF_VALUE
|
822
|
-
RHASH_AR_TABLE_SIZE_MASK = (FL_USER4|FL_USER5|FL_USER6|FL_USER7), /* FL 4..7 */
|
823
|
-
RHASH_AR_TABLE_SIZE_SHIFT = (FL_USHIFT+4),
|
824
|
-
RHASH_AR_TABLE_BOUND_MASK = (FL_USER8|FL_USER9|FL_USER10|FL_USER11), /* FL 8..11 */
|
825
|
-
RHASH_AR_TABLE_BOUND_SHIFT = (FL_USHIFT+8),
|
826
|
-
|
827
|
-
// we can not put it in "enum" because it can exceed "int" range.
|
828
|
-
#define RHASH_LEV_MASK (FL_USER13 | FL_USER14 | FL_USER15 | /* FL 13..19 */ \
|
829
|
-
FL_USER16 | FL_USER17 | FL_USER18 | FL_USER19)
|
830
|
-
|
831
|
-
#if USE_TRANSIENT_HEAP
|
832
|
-
RHASH_TRANSIENT_FLAG = FL_USER12, /* FL 12 */
|
833
|
-
#endif
|
834
|
-
|
835
|
-
RHASH_LEV_SHIFT = (FL_USHIFT + 13),
|
836
|
-
RHASH_LEV_MAX = 127, /* 7 bits */
|
837
|
-
|
838
|
-
RHASH_ENUM_END
|
839
|
-
};
|
840
|
-
|
841
|
-
#define RHASH_AR_TABLE_SIZE_RAW(h) \
|
842
|
-
((unsigned int)((RBASIC(h)->flags & RHASH_AR_TABLE_SIZE_MASK) >> RHASH_AR_TABLE_SIZE_SHIFT))
|
843
|
-
|
844
|
-
int rb_hash_ar_table_p(VALUE hash);
|
845
|
-
struct ar_table_struct *rb_hash_ar_table(VALUE hash);
|
846
|
-
st_table *rb_hash_st_table(VALUE hash);
|
847
|
-
void rb_hash_st_table_set(VALUE hash, st_table *st);
|
848
|
-
|
849
|
-
#if 0 /* for debug */
|
850
|
-
#define RHASH_AR_TABLE_P(hash) rb_hash_ar_table_p(hash)
|
851
|
-
#define RHASH_AR_TABLE(h) rb_hash_ar_table(h)
|
852
|
-
#define RHASH_ST_TABLE(h) rb_hash_st_table(h)
|
853
|
-
#else
|
854
|
-
#define RHASH_AR_TABLE_P(hash) (!FL_TEST_RAW((hash), RHASH_ST_TABLE_FLAG))
|
855
|
-
#define RHASH_AR_TABLE(hash) (RHASH(hash)->as.ar)
|
856
|
-
#define RHASH_ST_TABLE(hash) (RHASH(hash)->as.st)
|
857
|
-
#endif
|
858
|
-
|
859
|
-
#define RHASH(obj) (R_CAST(RHash)(obj))
|
860
|
-
#define RHASH_ST_SIZE(h) (RHASH_ST_TABLE(h)->num_entries)
|
861
|
-
#define RHASH_ST_TABLE_P(h) (!RHASH_AR_TABLE_P(h))
|
862
|
-
#define RHASH_ST_CLEAR(h) (FL_UNSET_RAW(h, RHASH_ST_TABLE_FLAG), RHASH(h)->as.ar = NULL)
|
863
|
-
|
864
|
-
#define RHASH_AR_TABLE_SIZE_MASK (VALUE)RHASH_AR_TABLE_SIZE_MASK
|
865
|
-
#define RHASH_AR_TABLE_SIZE_SHIFT RHASH_AR_TABLE_SIZE_SHIFT
|
866
|
-
#define RHASH_AR_TABLE_BOUND_MASK (VALUE)RHASH_AR_TABLE_BOUND_MASK
|
867
|
-
#define RHASH_AR_TABLE_BOUND_SHIFT RHASH_AR_TABLE_BOUND_SHIFT
|
868
|
-
|
869
|
-
#if USE_TRANSIENT_HEAP
|
870
|
-
#define RHASH_TRANSIENT_P(hash) FL_TEST_RAW((hash), RHASH_TRANSIENT_FLAG)
|
871
|
-
#define RHASH_SET_TRANSIENT_FLAG(h) FL_SET_RAW(h, RHASH_TRANSIENT_FLAG)
|
872
|
-
#define RHASH_UNSET_TRANSIENT_FLAG(h) FL_UNSET_RAW(h, RHASH_TRANSIENT_FLAG)
|
873
|
-
#else
|
874
|
-
#define RHASH_TRANSIENT_P(hash) 0
|
875
|
-
#define RHASH_SET_TRANSIENT_FLAG(h) ((void)0)
|
876
|
-
#define RHASH_UNSET_TRANSIENT_FLAG(h) ((void)0)
|
877
|
-
#endif
|
878
|
-
|
879
|
-
#if SIZEOF_VALUE / RHASH_AR_TABLE_MAX_SIZE == 2
|
880
|
-
typedef uint16_t ar_hint_t;
|
881
|
-
#elif SIZEOF_VALUE / RHASH_AR_TABLE_MAX_SIZE == 1
|
882
|
-
typedef unsigned char ar_hint_t;
|
883
|
-
#else
|
884
|
-
#error unsupported
|
885
|
-
#endif
|
886
|
-
|
887
|
-
struct RHash {
|
888
|
-
struct RBasic basic;
|
889
|
-
union {
|
890
|
-
st_table *st;
|
891
|
-
struct ar_table_struct *ar; /* possibly 0 */
|
892
|
-
} as;
|
893
|
-
const VALUE ifnone;
|
894
|
-
union {
|
895
|
-
ar_hint_t ary[RHASH_AR_TABLE_MAX_SIZE];
|
896
|
-
VALUE word;
|
897
|
-
} ar_hint;
|
898
|
-
};
|
899
|
-
|
900
|
-
#ifdef RHASH_IFNONE
|
901
|
-
# undef RHASH_IFNONE
|
902
|
-
# undef RHASH_SIZE
|
903
|
-
|
904
|
-
# define RHASH_IFNONE(h) (RHASH(h)->ifnone)
|
905
|
-
# define RHASH_SIZE(h) (RHASH_AR_TABLE_P(h) ? RHASH_AR_TABLE_SIZE_RAW(h) : RHASH_ST_SIZE(h))
|
906
|
-
#endif /* ifdef RHASH_IFNONE */
|
907
|
-
|
908
|
-
struct RMoved {
|
909
|
-
VALUE flags;
|
910
|
-
VALUE destination;
|
911
|
-
VALUE next;
|
912
|
-
};
|
913
|
-
|
914
|
-
/* missing/setproctitle.c */
|
915
|
-
#ifndef HAVE_SETPROCTITLE
|
916
|
-
extern void ruby_init_setproctitle(int argc, char *argv[]);
|
917
|
-
#endif
|
918
|
-
|
919
|
-
#define RSTRUCT_EMBED_LEN_MAX RSTRUCT_EMBED_LEN_MAX
|
920
|
-
#define RSTRUCT_EMBED_LEN_MASK RSTRUCT_EMBED_LEN_MASK
|
921
|
-
#define RSTRUCT_EMBED_LEN_SHIFT RSTRUCT_EMBED_LEN_SHIFT
|
922
|
-
|
923
|
-
enum {
|
924
|
-
RSTRUCT_EMBED_LEN_MAX = RVALUE_EMBED_LEN_MAX,
|
925
|
-
RSTRUCT_EMBED_LEN_MASK = (RUBY_FL_USER2|RUBY_FL_USER1),
|
926
|
-
RSTRUCT_EMBED_LEN_SHIFT = (RUBY_FL_USHIFT+1),
|
927
|
-
RSTRUCT_TRANSIENT_FLAG = FL_USER3,
|
928
|
-
|
929
|
-
RSTRUCT_ENUM_END
|
930
|
-
};
|
931
|
-
|
932
|
-
#if USE_TRANSIENT_HEAP
|
933
|
-
#define RSTRUCT_TRANSIENT_P(st) FL_TEST_RAW((obj), RSTRUCT_TRANSIENT_FLAG)
|
934
|
-
#define RSTRUCT_TRANSIENT_SET(st) FL_SET_RAW((st), RSTRUCT_TRANSIENT_FLAG)
|
935
|
-
#define RSTRUCT_TRANSIENT_UNSET(st) FL_UNSET_RAW((st), RSTRUCT_TRANSIENT_FLAG)
|
936
|
-
#else
|
937
|
-
#define RSTRUCT_TRANSIENT_P(st) 0
|
938
|
-
#define RSTRUCT_TRANSIENT_SET(st) ((void)0)
|
939
|
-
#define RSTRUCT_TRANSIENT_UNSET(st) ((void)0)
|
940
|
-
#endif
|
941
|
-
|
942
|
-
struct RStruct {
|
943
|
-
struct RBasic basic;
|
944
|
-
union {
|
945
|
-
struct {
|
946
|
-
long len;
|
947
|
-
const VALUE *ptr;
|
948
|
-
} heap;
|
949
|
-
const VALUE ary[RSTRUCT_EMBED_LEN_MAX];
|
950
|
-
} as;
|
951
|
-
};
|
952
|
-
|
953
|
-
#undef RSTRUCT_LEN
|
954
|
-
#undef RSTRUCT_PTR
|
955
|
-
#undef RSTRUCT_SET
|
956
|
-
#undef RSTRUCT_GET
|
957
|
-
#define RSTRUCT_EMBED_LEN(st) \
|
958
|
-
(long)((RBASIC(st)->flags >> RSTRUCT_EMBED_LEN_SHIFT) & \
|
959
|
-
(RSTRUCT_EMBED_LEN_MASK >> RSTRUCT_EMBED_LEN_SHIFT))
|
960
|
-
#define RSTRUCT_LEN(st) rb_struct_len(st)
|
961
|
-
#define RSTRUCT_LENINT(st) rb_long2int(RSTRUCT_LEN(st))
|
962
|
-
#define RSTRUCT_CONST_PTR(st) rb_struct_const_ptr(st)
|
963
|
-
#define RSTRUCT_PTR(st) ((VALUE *)RSTRUCT_CONST_PTR(RB_OBJ_WB_UNPROTECT_FOR(STRUCT, st)))
|
964
|
-
#define RSTRUCT_SET(st, idx, v) RB_OBJ_WRITE(st, &RSTRUCT_CONST_PTR(st)[idx], (v))
|
965
|
-
#define RSTRUCT_GET(st, idx) (RSTRUCT_CONST_PTR(st)[idx])
|
966
|
-
#define RSTRUCT(obj) (R_CAST(RStruct)(obj))
|
967
|
-
|
968
|
-
static inline long
|
969
|
-
rb_struct_len(VALUE st)
|
970
|
-
{
|
971
|
-
return (RBASIC(st)->flags & RSTRUCT_EMBED_LEN_MASK) ?
|
972
|
-
RSTRUCT_EMBED_LEN(st) : RSTRUCT(st)->as.heap.len;
|
973
|
-
}
|
974
|
-
|
975
|
-
static inline const VALUE *
|
976
|
-
rb_struct_const_ptr(VALUE st)
|
977
|
-
{
|
978
|
-
return FIX_CONST_VALUE_PTR((RBASIC(st)->flags & RSTRUCT_EMBED_LEN_MASK) ?
|
979
|
-
RSTRUCT(st)->as.ary : RSTRUCT(st)->as.heap.ptr);
|
980
|
-
}
|
981
|
-
|
982
|
-
static inline const VALUE *
|
983
|
-
rb_struct_const_heap_ptr(VALUE st)
|
984
|
-
{
|
985
|
-
/* TODO: check embed on debug mode */
|
986
|
-
return RSTRUCT(st)->as.heap.ptr;
|
987
|
-
}
|
988
|
-
|
989
|
-
/* class.c */
|
990
|
-
|
991
|
-
struct rb_deprecated_classext_struct {
|
992
|
-
char conflict[sizeof(VALUE) * 3];
|
993
|
-
};
|
994
|
-
|
995
|
-
struct rb_subclass_entry;
|
996
|
-
typedef struct rb_subclass_entry rb_subclass_entry_t;
|
997
|
-
|
998
|
-
struct rb_subclass_entry {
|
999
|
-
VALUE klass;
|
1000
|
-
rb_subclass_entry_t *next;
|
1001
|
-
};
|
1002
|
-
|
1003
|
-
#if defined(HAVE_LONG_LONG)
|
1004
|
-
typedef unsigned LONG_LONG rb_serial_t;
|
1005
|
-
#define SERIALT2NUM ULL2NUM
|
1006
|
-
#define PRI_SERIALT_PREFIX PRI_LL_PREFIX
|
1007
|
-
#elif defined(HAVE_UINT64_T)
|
1008
|
-
typedef uint64_t rb_serial_t;
|
1009
|
-
#define SERIALT2NUM SIZET2NUM
|
1010
|
-
#define PRI_SERIALT_PREFIX PRI_64_PREFIX
|
1011
|
-
#else
|
1012
|
-
typedef unsigned long rb_serial_t;
|
1013
|
-
#define SERIALT2NUM ULONG2NUM
|
1014
|
-
#define PRI_SERIALT_PREFIX PRI_LONG_PREFIX
|
1015
|
-
#endif
|
1016
|
-
|
1017
|
-
struct rb_classext_struct {
|
1018
|
-
struct st_table *iv_index_tbl;
|
1019
|
-
struct st_table *iv_tbl;
|
1020
|
-
struct rb_id_table *const_tbl;
|
1021
|
-
struct rb_id_table *callable_m_tbl;
|
1022
|
-
rb_subclass_entry_t *subclasses;
|
1023
|
-
rb_subclass_entry_t **parent_subclasses;
|
1024
|
-
/**
|
1025
|
-
* In the case that this is an `ICLASS`, `module_subclasses` points to the link
|
1026
|
-
* in the module's `subclasses` list that indicates that the klass has been
|
1027
|
-
* included. Hopefully that makes sense.
|
1028
|
-
*/
|
1029
|
-
rb_subclass_entry_t **module_subclasses;
|
1030
|
-
rb_serial_t class_serial;
|
1031
|
-
const VALUE origin_;
|
1032
|
-
const VALUE refined_class;
|
1033
|
-
rb_alloc_func_t allocator;
|
1034
|
-
};
|
1035
|
-
|
1036
|
-
typedef struct rb_classext_struct rb_classext_t;
|
1037
|
-
|
1038
|
-
#undef RClass
|
1039
|
-
struct RClass {
|
1040
|
-
struct RBasic basic;
|
1041
|
-
VALUE super;
|
1042
|
-
rb_classext_t *ptr;
|
1043
|
-
struct rb_id_table *m_tbl;
|
1044
|
-
};
|
1045
|
-
|
1046
|
-
void rb_class_subclass_add(VALUE super, VALUE klass);
|
1047
|
-
void rb_class_remove_from_super_subclasses(VALUE);
|
1048
|
-
int rb_singleton_class_internal_p(VALUE sklass);
|
1049
|
-
|
1050
|
-
#define RCLASS_EXT(c) (RCLASS(c)->ptr)
|
1051
|
-
#define RCLASS_IV_TBL(c) (RCLASS_EXT(c)->iv_tbl)
|
1052
|
-
#define RCLASS_CONST_TBL(c) (RCLASS_EXT(c)->const_tbl)
|
1053
|
-
#define RCLASS_M_TBL(c) (RCLASS(c)->m_tbl)
|
1054
|
-
#define RCLASS_CALLABLE_M_TBL(c) (RCLASS_EXT(c)->callable_m_tbl)
|
1055
|
-
#define RCLASS_IV_INDEX_TBL(c) (RCLASS_EXT(c)->iv_index_tbl)
|
1056
|
-
#define RCLASS_ORIGIN(c) (RCLASS_EXT(c)->origin_)
|
1057
|
-
#define RCLASS_REFINED_CLASS(c) (RCLASS_EXT(c)->refined_class)
|
1058
|
-
#define RCLASS_SERIAL(c) (RCLASS_EXT(c)->class_serial)
|
1059
|
-
|
1060
|
-
#define RCLASS_CLONED FL_USER6
|
1061
|
-
#define RICLASS_IS_ORIGIN FL_USER5
|
1062
|
-
|
1063
|
-
static inline void
|
1064
|
-
RCLASS_SET_ORIGIN(VALUE klass, VALUE origin)
|
1065
|
-
{
|
1066
|
-
RB_OBJ_WRITE(klass, &RCLASS_ORIGIN(klass), origin);
|
1067
|
-
if (klass != origin) FL_SET(origin, RICLASS_IS_ORIGIN);
|
1068
|
-
}
|
1069
|
-
|
1070
|
-
#undef RCLASS_SUPER
|
1071
|
-
static inline VALUE
|
1072
|
-
RCLASS_SUPER(VALUE klass)
|
1073
|
-
{
|
1074
|
-
return RCLASS(klass)->super;
|
1075
|
-
}
|
1076
|
-
|
1077
|
-
static inline VALUE
|
1078
|
-
RCLASS_SET_SUPER(VALUE klass, VALUE super)
|
1079
|
-
{
|
1080
|
-
if (super) {
|
1081
|
-
rb_class_remove_from_super_subclasses(klass);
|
1082
|
-
rb_class_subclass_add(super, klass);
|
1083
|
-
}
|
1084
|
-
RB_OBJ_WRITE(klass, &RCLASS(klass)->super, super);
|
1085
|
-
return super;
|
1086
|
-
}
|
1087
|
-
/* IMEMO: Internal memo object */
|
1088
|
-
|
1089
|
-
#ifndef IMEMO_DEBUG
|
1090
|
-
#define IMEMO_DEBUG 0
|
1091
|
-
#endif
|
1092
|
-
|
1093
|
-
struct RIMemo {
|
1094
|
-
VALUE flags;
|
1095
|
-
VALUE v0;
|
1096
|
-
VALUE v1;
|
1097
|
-
VALUE v2;
|
1098
|
-
VALUE v3;
|
1099
|
-
};
|
1100
|
-
|
1101
|
-
enum imemo_type {
|
1102
|
-
imemo_env = 0,
|
1103
|
-
imemo_cref = 1, /*!< class reference */
|
1104
|
-
imemo_svar = 2, /*!< special variable */
|
1105
|
-
imemo_throw_data = 3,
|
1106
|
-
imemo_ifunc = 4, /*!< iterator function */
|
1107
|
-
imemo_memo = 5,
|
1108
|
-
imemo_ment = 6,
|
1109
|
-
imemo_iseq = 7,
|
1110
|
-
imemo_tmpbuf = 8,
|
1111
|
-
imemo_ast = 9,
|
1112
|
-
imemo_parser_strterm = 10
|
1113
|
-
};
|
1114
|
-
#define IMEMO_MASK 0x0f
|
1115
|
-
|
1116
|
-
static inline enum imemo_type
|
1117
|
-
imemo_type(VALUE imemo)
|
1118
|
-
{
|
1119
|
-
return (RBASIC(imemo)->flags >> FL_USHIFT) & IMEMO_MASK;
|
1120
|
-
}
|
1121
|
-
|
1122
|
-
static inline int
|
1123
|
-
imemo_type_p(VALUE imemo, enum imemo_type imemo_type)
|
1124
|
-
{
|
1125
|
-
if (LIKELY(!RB_SPECIAL_CONST_P(imemo))) {
|
1126
|
-
/* fixed at compile time if imemo_type is given. */
|
1127
|
-
const VALUE mask = (IMEMO_MASK << FL_USHIFT) | RUBY_T_MASK;
|
1128
|
-
const VALUE expected_type = (imemo_type << FL_USHIFT) | T_IMEMO;
|
1129
|
-
/* fixed at runtime. */
|
1130
|
-
return expected_type == (RBASIC(imemo)->flags & mask);
|
1131
|
-
}
|
1132
|
-
else {
|
1133
|
-
return 0;
|
1134
|
-
}
|
1135
|
-
}
|
1136
|
-
|
1137
|
-
VALUE rb_imemo_new(enum imemo_type type, VALUE v1, VALUE v2, VALUE v3, VALUE v0);
|
1138
|
-
|
1139
|
-
/* FL_USER0 to FL_USER3 is for type */
|
1140
|
-
#define IMEMO_FL_USHIFT (FL_USHIFT + 4)
|
1141
|
-
#define IMEMO_FL_USER0 FL_USER4
|
1142
|
-
#define IMEMO_FL_USER1 FL_USER5
|
1143
|
-
#define IMEMO_FL_USER2 FL_USER6
|
1144
|
-
#define IMEMO_FL_USER3 FL_USER7
|
1145
|
-
#define IMEMO_FL_USER4 FL_USER8
|
1146
|
-
|
1147
|
-
/* CREF (Class REFerence) is defined in method.h */
|
1148
|
-
|
1149
|
-
/*! SVAR (Special VARiable) */
|
1150
|
-
struct vm_svar {
|
1151
|
-
VALUE flags;
|
1152
|
-
const VALUE cref_or_me; /*!< class reference or rb_method_entry_t */
|
1153
|
-
const VALUE lastline;
|
1154
|
-
const VALUE backref;
|
1155
|
-
const VALUE others;
|
1156
|
-
};
|
1157
|
-
|
1158
|
-
|
1159
|
-
#define THROW_DATA_CONSUMED IMEMO_FL_USER0
|
1160
|
-
|
1161
|
-
/*! THROW_DATA */
|
1162
|
-
struct vm_throw_data {
|
1163
|
-
VALUE flags;
|
1164
|
-
VALUE reserved;
|
1165
|
-
const VALUE throw_obj;
|
1166
|
-
const struct rb_control_frame_struct *catch_frame;
|
1167
|
-
int throw_state;
|
1168
|
-
};
|
1169
|
-
|
1170
|
-
#define THROW_DATA_P(err) RB_TYPE_P((VALUE)(err), T_IMEMO)
|
1171
|
-
|
1172
|
-
/* IFUNC (Internal FUNCtion) */
|
1173
|
-
|
1174
|
-
struct vm_ifunc_argc {
|
1175
|
-
#if SIZEOF_INT * 2 > SIZEOF_VALUE
|
1176
|
-
signed int min: (SIZEOF_VALUE * CHAR_BIT) / 2;
|
1177
|
-
signed int max: (SIZEOF_VALUE * CHAR_BIT) / 2;
|
1178
|
-
#else
|
1179
|
-
int min, max;
|
1180
|
-
#endif
|
1181
|
-
};
|
1182
|
-
|
1183
|
-
/*! IFUNC (Internal FUNCtion) */
|
1184
|
-
struct vm_ifunc {
|
1185
|
-
VALUE flags;
|
1186
|
-
VALUE reserved;
|
1187
|
-
rb_block_call_func_t func;
|
1188
|
-
const void *data;
|
1189
|
-
struct vm_ifunc_argc argc;
|
1190
|
-
};
|
1191
|
-
|
1192
|
-
#define IFUNC_NEW(a, b, c) ((struct vm_ifunc *)rb_imemo_new(imemo_ifunc, (VALUE)(a), (VALUE)(b), (VALUE)(c), 0))
|
1193
|
-
struct vm_ifunc *rb_vm_ifunc_new(rb_block_call_func_t func, const void *data, int min_argc, int max_argc);
|
1194
|
-
static inline struct vm_ifunc *
|
1195
|
-
rb_vm_ifunc_proc_new(rb_block_call_func_t func, const void *data)
|
1196
|
-
{
|
1197
|
-
return rb_vm_ifunc_new(func, data, 0, UNLIMITED_ARGUMENTS);
|
1198
|
-
}
|
1199
|
-
|
1200
|
-
typedef struct rb_imemo_tmpbuf_struct {
|
1201
|
-
VALUE flags;
|
1202
|
-
VALUE reserved;
|
1203
|
-
VALUE *ptr; /* malloc'ed buffer */
|
1204
|
-
struct rb_imemo_tmpbuf_struct *next; /* next imemo */
|
1205
|
-
size_t cnt; /* buffer size in VALUE */
|
1206
|
-
} rb_imemo_tmpbuf_t;
|
1207
|
-
|
1208
|
-
#define rb_imemo_tmpbuf_auto_free_pointer() rb_imemo_new(imemo_tmpbuf, 0, 0, 0, 0)
|
1209
|
-
VALUE rb_imemo_tmpbuf_auto_free_maybe_mark_buffer(void *buf, size_t cnt);
|
1210
|
-
rb_imemo_tmpbuf_t *rb_imemo_tmpbuf_parser_heap(void *buf, rb_imemo_tmpbuf_t *old_heap, size_t cnt);
|
1211
|
-
|
1212
|
-
#define RB_IMEMO_TMPBUF_PTR(v) \
|
1213
|
-
((void *)(((const struct rb_imemo_tmpbuf_struct *)(v))->ptr))
|
1214
|
-
|
1215
|
-
static inline void *
|
1216
|
-
rb_imemo_tmpbuf_set_ptr(VALUE v, void *ptr)
|
1217
|
-
{
|
1218
|
-
return ((rb_imemo_tmpbuf_t *)v)->ptr = ptr;
|
1219
|
-
}
|
1220
|
-
|
1221
|
-
static inline VALUE
|
1222
|
-
rb_imemo_tmpbuf_auto_free_pointer_new_from_an_RString(VALUE str)
|
1223
|
-
{
|
1224
|
-
const void *src;
|
1225
|
-
VALUE imemo;
|
1226
|
-
rb_imemo_tmpbuf_t *tmpbuf;
|
1227
|
-
void *dst;
|
1228
|
-
size_t len;
|
1229
|
-
|
1230
|
-
SafeStringValue(str);
|
1231
|
-
/* create tmpbuf to keep the pointer before xmalloc */
|
1232
|
-
imemo = rb_imemo_tmpbuf_auto_free_pointer();
|
1233
|
-
tmpbuf = (rb_imemo_tmpbuf_t *)imemo;
|
1234
|
-
len = RSTRING_LEN(str);
|
1235
|
-
src = RSTRING_PTR(str);
|
1236
|
-
dst = ruby_xmalloc(len);
|
1237
|
-
memcpy(dst, src, len);
|
1238
|
-
tmpbuf->ptr = dst;
|
1239
|
-
return imemo;
|
1240
|
-
}
|
1241
|
-
|
1242
|
-
void rb_strterm_mark(VALUE obj);
|
1243
|
-
|
1244
|
-
/*! MEMO
|
1245
|
-
*
|
1246
|
-
* @see imemo_type
|
1247
|
-
* */
|
1248
|
-
struct MEMO {
|
1249
|
-
VALUE flags;
|
1250
|
-
VALUE reserved;
|
1251
|
-
const VALUE v1;
|
1252
|
-
const VALUE v2;
|
1253
|
-
union {
|
1254
|
-
long cnt;
|
1255
|
-
long state;
|
1256
|
-
const VALUE value;
|
1257
|
-
void (*func)(void);
|
1258
|
-
} u3;
|
1259
|
-
};
|
1260
|
-
|
1261
|
-
#define MEMO_V1_SET(m, v) RB_OBJ_WRITE((m), &(m)->v1, (v))
|
1262
|
-
#define MEMO_V2_SET(m, v) RB_OBJ_WRITE((m), &(m)->v2, (v))
|
1263
|
-
|
1264
|
-
#define MEMO_CAST(m) ((struct MEMO *)m)
|
1265
|
-
|
1266
|
-
#define MEMO_NEW(a, b, c) ((struct MEMO *)rb_imemo_new(imemo_memo, (VALUE)(a), (VALUE)(b), (VALUE)(c), 0))
|
1267
|
-
|
1268
|
-
#define roomof(x, y) (((x) + (y) - 1) / (y))
|
1269
|
-
#define type_roomof(x, y) roomof(sizeof(x), sizeof(y))
|
1270
|
-
#define MEMO_FOR(type, value) ((type *)RARRAY_PTR(value))
|
1271
|
-
#define NEW_MEMO_FOR(type, value) \
|
1272
|
-
((value) = rb_ary_tmp_new_fill(type_roomof(type, VALUE)), MEMO_FOR(type, value))
|
1273
|
-
#define NEW_PARTIAL_MEMO_FOR(type, value, member) \
|
1274
|
-
((value) = rb_ary_tmp_new_fill(type_roomof(type, VALUE)), \
|
1275
|
-
rb_ary_set_len((value), offsetof(type, member) / sizeof(VALUE)), \
|
1276
|
-
MEMO_FOR(type, value))
|
1277
|
-
|
1278
|
-
#define STRING_P(s) (RB_TYPE_P((s), T_STRING) && CLASS_OF(s) == rb_cString)
|
1279
|
-
|
1280
|
-
#ifdef RUBY_INTEGER_UNIFICATION
|
1281
|
-
# define rb_cFixnum rb_cInteger
|
1282
|
-
# define rb_cBignum rb_cInteger
|
1283
|
-
#endif
|
1284
|
-
|
1285
|
-
enum {
|
1286
|
-
cmp_opt_Fixnum,
|
1287
|
-
cmp_opt_String,
|
1288
|
-
cmp_opt_Float,
|
1289
|
-
cmp_optimizable_count
|
1290
|
-
};
|
1291
|
-
|
1292
|
-
struct cmp_opt_data {
|
1293
|
-
unsigned int opt_methods;
|
1294
|
-
unsigned int opt_inited;
|
1295
|
-
};
|
1296
|
-
|
1297
|
-
#define NEW_CMP_OPT_MEMO(type, value) \
|
1298
|
-
NEW_PARTIAL_MEMO_FOR(type, value, cmp_opt)
|
1299
|
-
#define CMP_OPTIMIZABLE_BIT(type) (1U << TOKEN_PASTE(cmp_opt_,type))
|
1300
|
-
#define CMP_OPTIMIZABLE(data, type) \
|
1301
|
-
(((data).opt_inited & CMP_OPTIMIZABLE_BIT(type)) ? \
|
1302
|
-
((data).opt_methods & CMP_OPTIMIZABLE_BIT(type)) : \
|
1303
|
-
(((data).opt_inited |= CMP_OPTIMIZABLE_BIT(type)), \
|
1304
|
-
rb_method_basic_definition_p(TOKEN_PASTE(rb_c,type), id_cmp) && \
|
1305
|
-
((data).opt_methods |= CMP_OPTIMIZABLE_BIT(type))))
|
1306
|
-
|
1307
|
-
#define OPTIMIZED_CMP(a, b, data) \
|
1308
|
-
((FIXNUM_P(a) && FIXNUM_P(b) && CMP_OPTIMIZABLE(data, Fixnum)) ? \
|
1309
|
-
(((long)a > (long)b) ? 1 : ((long)a < (long)b) ? -1 : 0) : \
|
1310
|
-
(STRING_P(a) && STRING_P(b) && CMP_OPTIMIZABLE(data, String)) ? \
|
1311
|
-
rb_str_cmp(a, b) : \
|
1312
|
-
(RB_FLOAT_TYPE_P(a) && RB_FLOAT_TYPE_P(b) && CMP_OPTIMIZABLE(data, Float)) ? \
|
1313
|
-
rb_float_cmp(a, b) : \
|
1314
|
-
rb_cmpint(rb_funcallv(a, id_cmp, 1, &b), a, b))
|
1315
|
-
|
1316
|
-
/* ment is in method.h */
|
1317
|
-
|
1318
|
-
/* global variable */
|
1319
|
-
|
1320
|
-
struct rb_global_entry {
|
1321
|
-
struct rb_global_variable *var;
|
1322
|
-
ID id;
|
1323
|
-
};
|
1324
|
-
|
1325
|
-
struct rb_global_entry *rb_global_entry(ID);
|
1326
|
-
VALUE rb_gvar_get(struct rb_global_entry *);
|
1327
|
-
VALUE rb_gvar_set(struct rb_global_entry *, VALUE);
|
1328
|
-
VALUE rb_gvar_defined(struct rb_global_entry *);
|
1329
|
-
|
1330
|
-
/* array.c */
|
1331
|
-
|
1332
|
-
#ifndef ARRAY_DEBUG
|
1333
|
-
#define ARRAY_DEBUG (0+RUBY_DEBUG)
|
1334
|
-
#endif
|
1335
|
-
|
1336
|
-
#ifdef ARRAY_DEBUG
|
1337
|
-
#define RARRAY_PTR_IN_USE_FLAG FL_USER14
|
1338
|
-
#define ARY_PTR_USING_P(ary) FL_TEST_RAW((ary), RARRAY_PTR_IN_USE_FLAG)
|
1339
|
-
#else
|
1340
|
-
|
1341
|
-
/* disable debug function */
|
1342
|
-
#undef RARRAY_PTR_USE_START_TRANSIENT
|
1343
|
-
#undef RARRAY_PTR_USE_END_TRANSIENT
|
1344
|
-
#define RARRAY_PTR_USE_START_TRANSIENT(a) ((VALUE *)RARRAY_CONST_PTR_TRANSIENT(a))
|
1345
|
-
#define RARRAY_PTR_USE_END_TRANSIENT(a)
|
1346
|
-
#define ARY_PTR_USING_P(ary) 0
|
1347
|
-
|
1348
|
-
#endif
|
1349
|
-
|
1350
|
-
#if USE_TRANSIENT_HEAP
|
1351
|
-
#define RARY_TRANSIENT_SET(ary) FL_SET_RAW((ary), RARRAY_TRANSIENT_FLAG);
|
1352
|
-
#define RARY_TRANSIENT_UNSET(ary) FL_UNSET_RAW((ary), RARRAY_TRANSIENT_FLAG);
|
1353
|
-
#else
|
1354
|
-
#undef RARRAY_TRANSIENT_P
|
1355
|
-
#define RARRAY_TRANSIENT_P(a) 0
|
1356
|
-
#define RARY_TRANSIENT_SET(ary) ((void)0)
|
1357
|
-
#define RARY_TRANSIENT_UNSET(ary) ((void)0)
|
1358
|
-
#endif
|
1359
|
-
|
1360
|
-
|
1361
|
-
VALUE rb_ary_last(int, const VALUE *, VALUE);
|
1362
|
-
void rb_ary_set_len(VALUE, long);
|
1363
|
-
void rb_ary_delete_same(VALUE, VALUE);
|
1364
|
-
VALUE rb_ary_tmp_new_fill(long capa);
|
1365
|
-
VALUE rb_ary_at(VALUE, VALUE);
|
1366
|
-
VALUE rb_ary_aref1(VALUE ary, VALUE i);
|
1367
|
-
VALUE rb_ary_aref2(VALUE ary, VALUE b, VALUE e);
|
1368
|
-
size_t rb_ary_memsize(VALUE);
|
1369
|
-
VALUE rb_to_array_type(VALUE obj);
|
1370
|
-
VALUE rb_check_to_array(VALUE ary);
|
1371
|
-
VALUE rb_ary_tmp_new_from_values(VALUE, long, const VALUE *);
|
1372
|
-
VALUE rb_ary_behead(VALUE, long);
|
1373
|
-
#if defined(__GNUC__) && defined(HAVE_VA_ARGS_MACRO)
|
1374
|
-
#define rb_ary_new_from_args(n, ...) \
|
1375
|
-
__extension__ ({ \
|
1376
|
-
const VALUE args_to_new_ary[] = {__VA_ARGS__}; \
|
1377
|
-
if (__builtin_constant_p(n)) { \
|
1378
|
-
STATIC_ASSERT(rb_ary_new_from_args, numberof(args_to_new_ary) == (n)); \
|
1379
|
-
} \
|
1380
|
-
rb_ary_new_from_values(numberof(args_to_new_ary), args_to_new_ary); \
|
1381
|
-
})
|
1382
|
-
#endif
|
1383
|
-
|
1384
|
-
static inline VALUE
|
1385
|
-
rb_ary_entry_internal(VALUE ary, long offset)
|
1386
|
-
{
|
1387
|
-
long len = RARRAY_LEN(ary);
|
1388
|
-
const VALUE *ptr = RARRAY_CONST_PTR_TRANSIENT(ary);
|
1389
|
-
if (len == 0) return Qnil;
|
1390
|
-
if (offset < 0) {
|
1391
|
-
offset += len;
|
1392
|
-
if (offset < 0) return Qnil;
|
1393
|
-
}
|
1394
|
-
else if (len <= offset) {
|
1395
|
-
return Qnil;
|
1396
|
-
}
|
1397
|
-
return ptr[offset];
|
1398
|
-
}
|
1399
|
-
|
1400
|
-
/* MRI debug support */
|
1401
|
-
void rb_obj_info_dump(VALUE obj);
|
1402
|
-
void rb_obj_info_dump_loc(VALUE obj, const char *file, int line, const char *func);
|
1403
|
-
void ruby_debug_breakpoint(void);
|
1404
|
-
|
1405
|
-
// show obj data structure without any side-effect
|
1406
|
-
#define rp(obj) rb_obj_info_dump_loc((VALUE)(obj), __FILE__, __LINE__, __func__)
|
1407
|
-
|
1408
|
-
// same as rp, but add message header
|
1409
|
-
#define rp_m(msg, obj) do { \
|
1410
|
-
fprintf(stderr, "%s", (msg)); \
|
1411
|
-
rb_obj_info_dump((VALUE)obj); \
|
1412
|
-
} while (0)
|
1413
|
-
|
1414
|
-
// `ruby_debug_breakpoint()` does nothing,
|
1415
|
-
// but breakpoint is set in run.gdb, so `make gdb` can stop here.
|
1416
|
-
#define bp() ruby_debug_breakpoint()
|
1417
|
-
|
1418
|
-
/* bignum.c */
|
1419
|
-
extern const char ruby_digitmap[];
|
1420
|
-
double rb_big_fdiv_double(VALUE x, VALUE y);
|
1421
|
-
VALUE rb_big_uminus(VALUE x);
|
1422
|
-
VALUE rb_big_hash(VALUE);
|
1423
|
-
VALUE rb_big_odd_p(VALUE);
|
1424
|
-
VALUE rb_big_even_p(VALUE);
|
1425
|
-
size_t rb_big_size(VALUE);
|
1426
|
-
VALUE rb_integer_float_cmp(VALUE x, VALUE y);
|
1427
|
-
VALUE rb_integer_float_eq(VALUE x, VALUE y);
|
1428
|
-
VALUE rb_cstr_parse_inum(const char *str, ssize_t len, char **endp, int base);
|
1429
|
-
VALUE rb_str_convert_to_inum(VALUE str, int base, int badcheck, int raise_exception);
|
1430
|
-
VALUE rb_big_comp(VALUE x);
|
1431
|
-
VALUE rb_big_aref(VALUE x, VALUE y);
|
1432
|
-
VALUE rb_big_abs(VALUE x);
|
1433
|
-
VALUE rb_big_size_m(VALUE big);
|
1434
|
-
VALUE rb_big_bit_length(VALUE big);
|
1435
|
-
VALUE rb_big_remainder(VALUE x, VALUE y);
|
1436
|
-
VALUE rb_big_gt(VALUE x, VALUE y);
|
1437
|
-
VALUE rb_big_ge(VALUE x, VALUE y);
|
1438
|
-
VALUE rb_big_lt(VALUE x, VALUE y);
|
1439
|
-
VALUE rb_big_le(VALUE x, VALUE y);
|
1440
|
-
VALUE rb_int_powm(int const argc, VALUE * const argv, VALUE const num);
|
1441
|
-
|
1442
|
-
/* class.c */
|
1443
|
-
VALUE rb_class_boot(VALUE);
|
1444
|
-
VALUE rb_class_inherited(VALUE, VALUE);
|
1445
|
-
VALUE rb_make_metaclass(VALUE, VALUE);
|
1446
|
-
VALUE rb_include_class_new(VALUE, VALUE);
|
1447
|
-
void rb_class_foreach_subclass(VALUE klass, void (*f)(VALUE, VALUE), VALUE);
|
1448
|
-
void rb_class_detach_subclasses(VALUE);
|
1449
|
-
void rb_class_detach_module_subclasses(VALUE);
|
1450
|
-
void rb_class_remove_from_module_subclasses(VALUE);
|
1451
|
-
VALUE rb_obj_methods(int argc, const VALUE *argv, VALUE obj);
|
1452
|
-
VALUE rb_obj_protected_methods(int argc, const VALUE *argv, VALUE obj);
|
1453
|
-
VALUE rb_obj_private_methods(int argc, const VALUE *argv, VALUE obj);
|
1454
|
-
VALUE rb_obj_public_methods(int argc, const VALUE *argv, VALUE obj);
|
1455
|
-
VALUE rb_special_singleton_class(VALUE);
|
1456
|
-
VALUE rb_singleton_class_clone_and_attach(VALUE obj, VALUE attach);
|
1457
|
-
VALUE rb_singleton_class_get(VALUE obj);
|
1458
|
-
void Init_class_hierarchy(void);
|
1459
|
-
|
1460
|
-
int rb_class_has_methods(VALUE c);
|
1461
|
-
void rb_undef_methods_from(VALUE klass, VALUE super);
|
1462
|
-
|
1463
|
-
/* compar.c */
|
1464
|
-
VALUE rb_invcmp(VALUE, VALUE);
|
1465
|
-
|
1466
|
-
/* compile.c */
|
1467
|
-
struct rb_block;
|
1468
|
-
struct rb_iseq_struct;
|
1469
|
-
int rb_dvar_defined(ID, const struct rb_iseq_struct *);
|
1470
|
-
int rb_local_defined(ID, const struct rb_iseq_struct *);
|
1471
|
-
const char * rb_insns_name(int i);
|
1472
|
-
VALUE rb_insns_name_array(void);
|
1473
|
-
int rb_vm_insn_addr2insn(const void *);
|
1474
|
-
|
1475
|
-
/* complex.c */
|
1476
|
-
VALUE rb_dbl_complex_new_polar_pi(double abs, double ang);
|
1477
|
-
|
1478
|
-
struct rb_thread_struct;
|
1479
|
-
/* cont.c */
|
1480
|
-
VALUE rb_obj_is_fiber(VALUE);
|
1481
|
-
void rb_fiber_reset_root_local_storage(struct rb_thread_struct *);
|
1482
|
-
void ruby_register_rollback_func_for_ensure(VALUE (*ensure_func)(VALUE), VALUE (*rollback_func)(VALUE));
|
1483
|
-
|
1484
|
-
/* debug.c */
|
1485
|
-
PRINTF_ARGS(void ruby_debug_printf(const char*, ...), 1, 2);
|
1486
|
-
|
1487
|
-
/* dir.c */
|
1488
|
-
VALUE rb_dir_getwd_ospath(void);
|
1489
|
-
|
1490
|
-
/* dmyext.c */
|
1491
|
-
void Init_enc(void);
|
1492
|
-
void Init_ext(void);
|
1493
|
-
|
1494
|
-
/* encoding.c */
|
1495
|
-
ID rb_id_encoding(void);
|
1496
|
-
#ifdef RUBY_ENCODING_H
|
1497
|
-
rb_encoding *rb_enc_get_from_index(int index);
|
1498
|
-
rb_encoding *rb_enc_check_str(VALUE str1, VALUE str2);
|
1499
|
-
#endif
|
1500
|
-
int rb_encdb_replicate(const char *alias, const char *orig);
|
1501
|
-
int rb_encdb_alias(const char *alias, const char *orig);
|
1502
|
-
int rb_encdb_dummy(const char *name);
|
1503
|
-
void rb_encdb_declare(const char *name);
|
1504
|
-
void rb_enc_set_base(const char *name, const char *orig);
|
1505
|
-
int rb_enc_set_dummy(int index);
|
1506
|
-
void rb_encdb_set_unicode(int index);
|
1507
|
-
PUREFUNC(int rb_data_is_encoding(VALUE obj));
|
1508
|
-
|
1509
|
-
/* enum.c */
|
1510
|
-
extern VALUE rb_cArithSeq;
|
1511
|
-
VALUE rb_f_send(int argc, VALUE *argv, VALUE recv);
|
1512
|
-
VALUE rb_nmin_run(VALUE obj, VALUE num, int by, int rev, int ary);
|
1513
|
-
|
1514
|
-
/* error.c */
|
1515
|
-
extern VALUE rb_eEAGAIN;
|
1516
|
-
extern VALUE rb_eEWOULDBLOCK;
|
1517
|
-
extern VALUE rb_eEINPROGRESS;
|
1518
|
-
void rb_report_bug_valist(VALUE file, int line, const char *fmt, va_list args);
|
1519
|
-
VALUE rb_check_backtrace(VALUE);
|
1520
|
-
NORETURN(void rb_async_bug_errno(const char *,int));
|
1521
|
-
const char *rb_builtin_type_name(int t);
|
1522
|
-
const char *rb_builtin_class_name(VALUE x);
|
1523
|
-
PRINTF_ARGS(void rb_sys_warn(const char *fmt, ...), 1, 2);
|
1524
|
-
PRINTF_ARGS(void rb_syserr_warn(int err, const char *fmt, ...), 2, 3);
|
1525
|
-
PRINTF_ARGS(void rb_sys_warning(const char *fmt, ...), 1, 2);
|
1526
|
-
PRINTF_ARGS(void rb_syserr_warning(int err, const char *fmt, ...), 2, 3);
|
1527
|
-
#ifdef RUBY_ENCODING_H
|
1528
|
-
VALUE rb_syntax_error_append(VALUE, VALUE, int, int, rb_encoding*, const char*, va_list);
|
1529
|
-
PRINTF_ARGS(void rb_enc_warn(rb_encoding *enc, const char *fmt, ...), 2, 3);
|
1530
|
-
PRINTF_ARGS(void rb_sys_enc_warn(rb_encoding *enc, const char *fmt, ...), 2, 3);
|
1531
|
-
PRINTF_ARGS(void rb_syserr_enc_warn(int err, rb_encoding *enc, const char *fmt, ...), 3, 4);
|
1532
|
-
PRINTF_ARGS(void rb_enc_warning(rb_encoding *enc, const char *fmt, ...), 2, 3);
|
1533
|
-
PRINTF_ARGS(void rb_sys_enc_warning(rb_encoding *enc, const char *fmt, ...), 2, 3);
|
1534
|
-
PRINTF_ARGS(void rb_syserr_enc_warning(int err, rb_encoding *enc, const char *fmt, ...), 3, 4);
|
1535
|
-
#endif
|
1536
|
-
|
1537
|
-
#define rb_raise_cstr(etype, mesg) \
|
1538
|
-
rb_exc_raise(rb_exc_new_str(etype, rb_str_new_cstr(mesg)))
|
1539
|
-
#define rb_raise_static(etype, mesg) \
|
1540
|
-
rb_exc_raise(rb_exc_new_str(etype, rb_str_new_static(mesg, rb_strlen_lit(mesg))))
|
1541
|
-
|
1542
|
-
VALUE rb_name_err_new(VALUE mesg, VALUE recv, VALUE method);
|
1543
|
-
#define rb_name_err_raise_str(mesg, recv, name) \
|
1544
|
-
rb_exc_raise(rb_name_err_new(mesg, recv, name))
|
1545
|
-
#define rb_name_err_raise(mesg, recv, name) \
|
1546
|
-
rb_name_err_raise_str(rb_fstring_cstr(mesg), (recv), (name))
|
1547
|
-
VALUE rb_nomethod_err_new(VALUE mesg, VALUE recv, VALUE method, VALUE args, int priv);
|
1548
|
-
VALUE rb_key_err_new(VALUE mesg, VALUE recv, VALUE name);
|
1549
|
-
#define rb_key_err_raise(mesg, recv, name) \
|
1550
|
-
rb_exc_raise(rb_key_err_new(mesg, recv, name))
|
1551
|
-
NORETURN(void ruby_deprecated_internal_feature(const char *));
|
1552
|
-
#define DEPRECATED_INTERNAL_FEATURE(func) \
|
1553
|
-
(ruby_deprecated_internal_feature(func), UNREACHABLE)
|
1554
|
-
VALUE rb_warning_warn(VALUE mod, VALUE str);
|
1555
|
-
PRINTF_ARGS(VALUE rb_warning_string(const char *fmt, ...), 1, 2);
|
1556
|
-
NORETURN(void rb_vraise(VALUE, const char *, va_list));
|
1557
|
-
|
1558
|
-
/* eval.c */
|
1559
|
-
VALUE rb_refinement_module_get_refined_class(VALUE module);
|
1560
|
-
extern ID ruby_static_id_signo, ruby_static_id_status;
|
1561
|
-
void rb_class_modify_check(VALUE);
|
1562
|
-
#define id_signo ruby_static_id_signo
|
1563
|
-
#define id_status ruby_static_id_status
|
1564
|
-
NORETURN(VALUE rb_f_raise(int argc, VALUE *argv));
|
1565
|
-
|
1566
|
-
/* eval_error.c */
|
1567
|
-
VALUE rb_get_backtrace(VALUE info);
|
1568
|
-
|
1569
|
-
/* eval_jump.c */
|
1570
|
-
void rb_call_end_proc(VALUE data);
|
1571
|
-
void rb_mark_end_proc(void);
|
1572
|
-
|
1573
|
-
/* file.c */
|
1574
|
-
extern const char ruby_null_device[];
|
1575
|
-
VALUE rb_home_dir_of(VALUE user, VALUE result);
|
1576
|
-
VALUE rb_default_home_dir(VALUE result);
|
1577
|
-
VALUE rb_realpath_internal(VALUE basedir, VALUE path, int strict);
|
1578
|
-
VALUE rb_check_realpath(VALUE basedir, VALUE path);
|
1579
|
-
void rb_file_const(const char*, VALUE);
|
1580
|
-
int rb_file_load_ok(const char *);
|
1581
|
-
VALUE rb_file_expand_path_fast(VALUE, VALUE);
|
1582
|
-
VALUE rb_file_expand_path_internal(VALUE, VALUE, int, int, VALUE);
|
1583
|
-
VALUE rb_get_path_check_to_string(VALUE, int);
|
1584
|
-
VALUE rb_get_path_check_convert(VALUE, VALUE, int);
|
1585
|
-
VALUE rb_get_path_check(VALUE, int);
|
1586
|
-
void Init_File(void);
|
1587
|
-
int ruby_is_fd_loadable(int fd);
|
1588
|
-
|
1589
|
-
#ifdef RUBY_FUNCTION_NAME_STRING
|
1590
|
-
# if defined __GNUC__ && __GNUC__ >= 4
|
1591
|
-
# pragma GCC visibility push(default)
|
1592
|
-
# endif
|
1593
|
-
NORETURN(void rb_sys_fail_path_in(const char *func_name, VALUE path));
|
1594
|
-
NORETURN(void rb_syserr_fail_path_in(const char *func_name, int err, VALUE path));
|
1595
|
-
# if defined __GNUC__ && __GNUC__ >= 4
|
1596
|
-
# pragma GCC visibility pop
|
1597
|
-
# endif
|
1598
|
-
# define rb_sys_fail_path(path) rb_sys_fail_path_in(RUBY_FUNCTION_NAME_STRING, path)
|
1599
|
-
# define rb_syserr_fail_path(err, path) rb_syserr_fail_path_in(RUBY_FUNCTION_NAME_STRING, (err), (path))
|
1600
|
-
#else
|
1601
|
-
# define rb_sys_fail_path(path) rb_sys_fail_str(path)
|
1602
|
-
# define rb_syserr_fail_path(err, path) rb_syserr_fail_str((err), (path))
|
1603
|
-
#endif
|
1604
|
-
|
1605
|
-
/* gc.c */
|
1606
|
-
extern VALUE *ruby_initial_gc_stress_ptr;
|
1607
|
-
extern int ruby_disable_gc;
|
1608
|
-
void Init_heap(void);
|
1609
|
-
void *ruby_mimmalloc(size_t size);
|
1610
|
-
void ruby_mimfree(void *ptr);
|
1611
|
-
void rb_objspace_set_event_hook(const rb_event_flag_t event);
|
1612
|
-
#if USE_RGENGC
|
1613
|
-
void rb_gc_writebarrier_remember(VALUE obj);
|
1614
|
-
#else
|
1615
|
-
#define rb_gc_writebarrier_remember(obj) 0
|
1616
|
-
#endif
|
1617
|
-
void ruby_gc_set_params(int safe_level);
|
1618
|
-
void rb_copy_wb_protected_attribute(VALUE dest, VALUE obj);
|
1619
|
-
|
1620
|
-
#if defined(HAVE_MALLOC_USABLE_SIZE) || defined(HAVE_MALLOC_SIZE) || defined(_WIN32)
|
1621
|
-
#define ruby_sized_xrealloc(ptr, new_size, old_size) ruby_xrealloc(ptr, new_size)
|
1622
|
-
#define ruby_sized_xrealloc2(ptr, new_count, element_size, old_count) ruby_xrealloc2(ptr, new_count, element_size)
|
1623
|
-
#define ruby_sized_xfree(ptr, size) ruby_xfree(ptr)
|
1624
|
-
#define SIZED_REALLOC_N(var,type,n,old_n) REALLOC_N(var, type, n)
|
1625
|
-
#else
|
1626
|
-
RUBY_SYMBOL_EXPORT_BEGIN
|
1627
|
-
void *ruby_sized_xrealloc(void *ptr, size_t new_size, size_t old_size) RUBY_ATTR_ALLOC_SIZE((2));
|
1628
|
-
void *ruby_sized_xrealloc2(void *ptr, size_t new_count, size_t element_size, size_t old_count) RUBY_ATTR_ALLOC_SIZE((2, 3));
|
1629
|
-
void ruby_sized_xfree(void *x, size_t size);
|
1630
|
-
RUBY_SYMBOL_EXPORT_END
|
1631
|
-
#define SIZED_REALLOC_N(var,type,n,old_n) ((var)=(type*)ruby_sized_xrealloc2((void*)(var), (n), sizeof(type), (old_n)))
|
1632
|
-
#endif
|
1633
|
-
|
1634
|
-
/* optimized version of NEWOBJ() */
|
1635
|
-
#undef NEWOBJF_OF
|
1636
|
-
#undef RB_NEWOBJ_OF
|
1637
|
-
#define RB_NEWOBJ_OF(obj,type,klass,flags) \
|
1638
|
-
type *(obj) = (type*)(((flags) & FL_WB_PROTECTED) ? \
|
1639
|
-
rb_wb_protected_newobj_of(klass, (flags) & ~FL_WB_PROTECTED) : \
|
1640
|
-
rb_wb_unprotected_newobj_of(klass, flags))
|
1641
|
-
#define NEWOBJ_OF(obj,type,klass,flags) RB_NEWOBJ_OF(obj,type,klass,flags)
|
1642
|
-
|
1643
|
-
#ifdef __has_attribute
|
1644
|
-
#if __has_attribute(alloc_align)
|
1645
|
-
__attribute__((__alloc_align__(1)))
|
1646
|
-
#endif
|
1647
|
-
#endif
|
1648
|
-
void *rb_aligned_malloc(size_t, size_t) RUBY_ATTR_MALLOC RUBY_ATTR_ALLOC_SIZE((2));
|
1649
|
-
void rb_aligned_free(void *);
|
1650
|
-
|
1651
|
-
size_t rb_size_mul_or_raise(size_t, size_t, VALUE); /* used in compile.c */
|
1652
|
-
size_t rb_size_mul_add_or_raise(size_t, size_t, size_t, VALUE); /* used in iseq.h */
|
1653
|
-
void *rb_xmalloc_mul_add(size_t, size_t, size_t) RUBY_ATTR_MALLOC;
|
1654
|
-
void *rb_xrealloc_mul_add(const void *, size_t, size_t, size_t);
|
1655
|
-
void *rb_xmalloc_mul_add_mul(size_t, size_t, size_t, size_t) RUBY_ATTR_MALLOC;
|
1656
|
-
void *rb_xcalloc_mul_add_mul(size_t, size_t, size_t, size_t) RUBY_ATTR_MALLOC;
|
1657
|
-
|
1658
|
-
/* hash.c */
|
1659
|
-
#if RHASH_CONVERT_TABLE_DEBUG
|
1660
|
-
struct st_table *rb_hash_tbl_raw(VALUE hash, const char *file, int line);
|
1661
|
-
#define RHASH_TBL_RAW(h) rb_hash_tbl_raw(h, __FILE__, __LINE__)
|
1662
|
-
#else
|
1663
|
-
struct st_table *rb_hash_tbl_raw(VALUE hash);
|
1664
|
-
#define RHASH_TBL_RAW(h) rb_hash_tbl_raw(h)
|
1665
|
-
#endif
|
1666
|
-
|
1667
|
-
VALUE rb_hash_new_with_size(st_index_t size);
|
1668
|
-
VALUE rb_hash_has_key(VALUE hash, VALUE key);
|
1669
|
-
VALUE rb_hash_default_value(VALUE hash, VALUE key);
|
1670
|
-
VALUE rb_hash_set_default_proc(VALUE hash, VALUE proc);
|
1671
|
-
long rb_objid_hash(st_index_t index);
|
1672
|
-
long rb_dbl_long_hash(double d);
|
1673
|
-
st_table *rb_init_identtable(void);
|
1674
|
-
st_table *rb_init_identtable_with_size(st_index_t size);
|
1675
|
-
VALUE rb_hash_compare_by_id_p(VALUE hash);
|
1676
|
-
VALUE rb_to_hash_type(VALUE obj);
|
1677
|
-
VALUE rb_hash_key_str(VALUE);
|
1678
|
-
VALUE rb_hash_keys(VALUE hash);
|
1679
|
-
VALUE rb_hash_values(VALUE hash);
|
1680
|
-
VALUE rb_hash_rehash(VALUE hash);
|
1681
|
-
VALUE rb_hash_resurrect(VALUE hash);
|
1682
|
-
int rb_hash_add_new_element(VALUE hash, VALUE key, VALUE val);
|
1683
|
-
VALUE rb_hash_set_pair(VALUE hash, VALUE pair);
|
1684
|
-
|
1685
|
-
int rb_hash_stlike_lookup(VALUE hash, st_data_t key, st_data_t *pval);
|
1686
|
-
int rb_hash_stlike_delete(VALUE hash, st_data_t *pkey, st_data_t *pval);
|
1687
|
-
RUBY_SYMBOL_EXPORT_BEGIN
|
1688
|
-
int rb_hash_stlike_foreach(VALUE hash, st_foreach_callback_func *func, st_data_t arg);
|
1689
|
-
RUBY_SYMBOL_EXPORT_END
|
1690
|
-
int rb_hash_stlike_foreach_with_replace(VALUE hash, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg);
|
1691
|
-
int rb_hash_stlike_update(VALUE hash, st_data_t key, st_update_callback_func func, st_data_t arg);
|
1692
|
-
|
1693
|
-
/* inits.c */
|
1694
|
-
void rb_call_inits(void);
|
1695
|
-
|
1696
|
-
/* io.c */
|
1697
|
-
const char *ruby_get_inplace_mode(void);
|
1698
|
-
void ruby_set_inplace_mode(const char *);
|
1699
|
-
ssize_t rb_io_bufread(VALUE io, void *buf, size_t size);
|
1700
|
-
void rb_stdio_set_default_encoding(void);
|
1701
|
-
VALUE rb_io_flush_raw(VALUE, int);
|
1702
|
-
#ifdef RUBY_IO_H
|
1703
|
-
size_t rb_io_memsize(const rb_io_t *);
|
1704
|
-
#endif
|
1705
|
-
int rb_stderr_tty_p(void);
|
1706
|
-
void rb_io_fptr_finalize_internal(void *ptr);
|
1707
|
-
#define rb_io_fptr_finalize rb_io_fptr_finalize_internal
|
1708
|
-
|
1709
|
-
/* load.c */
|
1710
|
-
VALUE rb_get_load_path(void);
|
1711
|
-
VALUE rb_get_expanded_load_path(void);
|
1712
|
-
int rb_require_internal(VALUE fname, int safe);
|
1713
|
-
NORETURN(void rb_load_fail(VALUE, const char*));
|
1714
|
-
|
1715
|
-
/* loadpath.c */
|
1716
|
-
extern const char ruby_exec_prefix[];
|
1717
|
-
extern const char ruby_initial_load_paths[];
|
1718
|
-
|
1719
|
-
/* localeinit.c */
|
1720
|
-
int Init_enc_set_filesystem_encoding(void);
|
1721
|
-
|
1722
|
-
/* math.c */
|
1723
|
-
VALUE rb_math_atan2(VALUE, VALUE);
|
1724
|
-
VALUE rb_math_cos(VALUE);
|
1725
|
-
VALUE rb_math_cosh(VALUE);
|
1726
|
-
VALUE rb_math_exp(VALUE);
|
1727
|
-
VALUE rb_math_hypot(VALUE, VALUE);
|
1728
|
-
VALUE rb_math_log(int argc, const VALUE *argv);
|
1729
|
-
VALUE rb_math_sin(VALUE);
|
1730
|
-
VALUE rb_math_sinh(VALUE);
|
1731
|
-
VALUE rb_math_sqrt(VALUE);
|
1732
|
-
|
1733
|
-
/* mjit.c */
|
1734
|
-
|
1735
|
-
#if USE_MJIT
|
1736
|
-
extern bool mjit_enabled;
|
1737
|
-
VALUE mjit_pause(bool wait_p);
|
1738
|
-
VALUE mjit_resume(void);
|
1739
|
-
void mjit_finish(bool close_handle_p);
|
1740
|
-
#else
|
1741
|
-
#define mjit_enabled 0
|
1742
|
-
static inline VALUE mjit_pause(bool wait_p){ return Qnil; } // unreachable
|
1743
|
-
static inline VALUE mjit_resume(void){ return Qnil; } // unreachable
|
1744
|
-
static inline void mjit_finish(bool close_handle_p){}
|
1745
|
-
#endif
|
1746
|
-
|
1747
|
-
/* newline.c */
|
1748
|
-
void Init_newline(void);
|
1749
|
-
|
1750
|
-
/* numeric.c */
|
1751
|
-
|
1752
|
-
#define FIXNUM_POSITIVE_P(num) ((SIGNED_VALUE)(num) > (SIGNED_VALUE)INT2FIX(0))
|
1753
|
-
#define FIXNUM_NEGATIVE_P(num) ((SIGNED_VALUE)(num) < 0)
|
1754
|
-
#define FIXNUM_ZERO_P(num) ((num) == INT2FIX(0))
|
1755
|
-
|
1756
|
-
#define INT_NEGATIVE_P(x) (FIXNUM_P(x) ? FIXNUM_NEGATIVE_P(x) : BIGNUM_NEGATIVE_P(x))
|
1757
|
-
|
1758
|
-
#define FLOAT_ZERO_P(x) (RFLOAT_VALUE(x) == 0.0)
|
1759
|
-
|
1760
|
-
#ifndef ROUND_DEFAULT
|
1761
|
-
# define ROUND_DEFAULT RUBY_NUM_ROUND_HALF_UP
|
1762
|
-
#endif
|
1763
|
-
enum ruby_num_rounding_mode {
|
1764
|
-
RUBY_NUM_ROUND_HALF_UP,
|
1765
|
-
RUBY_NUM_ROUND_HALF_EVEN,
|
1766
|
-
RUBY_NUM_ROUND_HALF_DOWN,
|
1767
|
-
RUBY_NUM_ROUND_DEFAULT = ROUND_DEFAULT
|
1768
|
-
};
|
1769
|
-
#define ROUND_TO(mode, even, up, down) \
|
1770
|
-
((mode) == RUBY_NUM_ROUND_HALF_EVEN ? even : \
|
1771
|
-
(mode) == RUBY_NUM_ROUND_HALF_UP ? up : down)
|
1772
|
-
#define ROUND_FUNC(mode, name) \
|
1773
|
-
ROUND_TO(mode, name##_half_even, name##_half_up, name##_half_down)
|
1774
|
-
#define ROUND_CALL(mode, name, args) \
|
1775
|
-
ROUND_TO(mode, name##_half_even args, \
|
1776
|
-
name##_half_up args, name##_half_down args)
|
1777
|
-
|
1778
|
-
int rb_num_to_uint(VALUE val, unsigned int *ret);
|
1779
|
-
VALUE ruby_num_interval_step_size(VALUE from, VALUE to, VALUE step, int excl);
|
1780
|
-
double ruby_float_step_size(double beg, double end, double unit, int excl);
|
1781
|
-
int ruby_float_step(VALUE from, VALUE to, VALUE step, int excl, int allow_endless);
|
1782
|
-
double ruby_float_mod(double x, double y);
|
1783
|
-
int rb_num_negative_p(VALUE);
|
1784
|
-
VALUE rb_int_succ(VALUE num);
|
1785
|
-
VALUE rb_int_pred(VALUE num);
|
1786
|
-
VALUE rb_int_uminus(VALUE num);
|
1787
|
-
VALUE rb_float_uminus(VALUE num);
|
1788
|
-
VALUE rb_int_plus(VALUE x, VALUE y);
|
1789
|
-
VALUE rb_float_plus(VALUE x, VALUE y);
|
1790
|
-
VALUE rb_int_minus(VALUE x, VALUE y);
|
1791
|
-
VALUE rb_int_mul(VALUE x, VALUE y);
|
1792
|
-
VALUE rb_float_mul(VALUE x, VALUE y);
|
1793
|
-
VALUE rb_float_div(VALUE x, VALUE y);
|
1794
|
-
VALUE rb_int_idiv(VALUE x, VALUE y);
|
1795
|
-
VALUE rb_int_modulo(VALUE x, VALUE y);
|
1796
|
-
VALUE rb_int_round(VALUE num, int ndigits, enum ruby_num_rounding_mode mode);
|
1797
|
-
VALUE rb_int2str(VALUE num, int base);
|
1798
|
-
VALUE rb_dbl_hash(double d);
|
1799
|
-
VALUE rb_fix_plus(VALUE x, VALUE y);
|
1800
|
-
VALUE rb_fix_aref(VALUE fix, VALUE idx);
|
1801
|
-
VALUE rb_int_gt(VALUE x, VALUE y);
|
1802
|
-
int rb_float_cmp(VALUE x, VALUE y);
|
1803
|
-
VALUE rb_float_gt(VALUE x, VALUE y);
|
1804
|
-
VALUE rb_int_ge(VALUE x, VALUE y);
|
1805
|
-
enum ruby_num_rounding_mode rb_num_get_rounding_option(VALUE opts);
|
1806
|
-
double rb_int_fdiv_double(VALUE x, VALUE y);
|
1807
|
-
VALUE rb_int_pow(VALUE x, VALUE y);
|
1808
|
-
VALUE rb_float_pow(VALUE x, VALUE y);
|
1809
|
-
VALUE rb_int_cmp(VALUE x, VALUE y);
|
1810
|
-
VALUE rb_int_equal(VALUE x, VALUE y);
|
1811
|
-
VALUE rb_int_divmod(VALUE x, VALUE y);
|
1812
|
-
VALUE rb_int_and(VALUE x, VALUE y);
|
1813
|
-
VALUE rb_int_lshift(VALUE x, VALUE y);
|
1814
|
-
VALUE rb_int_div(VALUE x, VALUE y);
|
1815
|
-
VALUE rb_int_abs(VALUE num);
|
1816
|
-
VALUE rb_int_odd_p(VALUE num);
|
1817
|
-
int rb_int_positive_p(VALUE num);
|
1818
|
-
int rb_int_negative_p(VALUE num);
|
1819
|
-
VALUE rb_num_pow(VALUE x, VALUE y);
|
1820
|
-
VALUE rb_float_ceil(VALUE num, int ndigits);
|
1821
|
-
|
1822
|
-
static inline VALUE
|
1823
|
-
rb_num_compare_with_zero(VALUE num, ID mid)
|
1824
|
-
{
|
1825
|
-
VALUE zero = INT2FIX(0);
|
1826
|
-
VALUE r = rb_check_funcall(num, mid, 1, &zero);
|
1827
|
-
if (r == Qundef) {
|
1828
|
-
rb_cmperr(num, zero);
|
1829
|
-
}
|
1830
|
-
return r;
|
1831
|
-
}
|
1832
|
-
|
1833
|
-
static inline int
|
1834
|
-
rb_num_positive_int_p(VALUE num)
|
1835
|
-
{
|
1836
|
-
const ID mid = '>';
|
1837
|
-
|
1838
|
-
if (FIXNUM_P(num)) {
|
1839
|
-
if (rb_method_basic_definition_p(rb_cInteger, mid))
|
1840
|
-
return FIXNUM_POSITIVE_P(num);
|
1841
|
-
}
|
1842
|
-
else if (RB_TYPE_P(num, T_BIGNUM)) {
|
1843
|
-
if (rb_method_basic_definition_p(rb_cInteger, mid))
|
1844
|
-
return BIGNUM_POSITIVE_P(num);
|
1845
|
-
}
|
1846
|
-
return RTEST(rb_num_compare_with_zero(num, mid));
|
1847
|
-
}
|
1848
|
-
|
1849
|
-
|
1850
|
-
static inline int
|
1851
|
-
rb_num_negative_int_p(VALUE num)
|
1852
|
-
{
|
1853
|
-
const ID mid = '<';
|
1854
|
-
|
1855
|
-
if (FIXNUM_P(num)) {
|
1856
|
-
if (rb_method_basic_definition_p(rb_cInteger, mid))
|
1857
|
-
return FIXNUM_NEGATIVE_P(num);
|
1858
|
-
}
|
1859
|
-
else if (RB_TYPE_P(num, T_BIGNUM)) {
|
1860
|
-
if (rb_method_basic_definition_p(rb_cInteger, mid))
|
1861
|
-
return BIGNUM_NEGATIVE_P(num);
|
1862
|
-
}
|
1863
|
-
return RTEST(rb_num_compare_with_zero(num, mid));
|
1864
|
-
}
|
1865
|
-
|
1866
|
-
|
1867
|
-
VALUE rb_float_abs(VALUE flt);
|
1868
|
-
VALUE rb_float_equal(VALUE x, VALUE y);
|
1869
|
-
VALUE rb_float_eql(VALUE x, VALUE y);
|
1870
|
-
VALUE rb_flo_div_flo(VALUE x, VALUE y);
|
1871
|
-
|
1872
|
-
#if USE_FLONUM
|
1873
|
-
#define RUBY_BIT_ROTL(v, n) (((v) << (n)) | ((v) >> ((sizeof(v) * 8) - n)))
|
1874
|
-
#define RUBY_BIT_ROTR(v, n) (((v) >> (n)) | ((v) << ((sizeof(v) * 8) - n)))
|
1875
|
-
#endif
|
1876
|
-
|
1877
|
-
static inline double
|
1878
|
-
rb_float_flonum_value(VALUE v)
|
1879
|
-
{
|
1880
|
-
#if USE_FLONUM
|
1881
|
-
if (v != (VALUE)0x8000000000000002) { /* LIKELY */
|
1882
|
-
union {
|
1883
|
-
double d;
|
1884
|
-
VALUE v;
|
1885
|
-
} t;
|
1886
|
-
|
1887
|
-
VALUE b63 = (v >> 63);
|
1888
|
-
/* e: xx1... -> 011... */
|
1889
|
-
/* xx0... -> 100... */
|
1890
|
-
/* ^b63 */
|
1891
|
-
t.v = RUBY_BIT_ROTR((2 - b63) | (v & ~(VALUE)0x03), 3);
|
1892
|
-
return t.d;
|
1893
|
-
}
|
1894
|
-
#endif
|
1895
|
-
return 0.0;
|
1896
|
-
}
|
1897
|
-
|
1898
|
-
static inline double
|
1899
|
-
rb_float_noflonum_value(VALUE v)
|
1900
|
-
{
|
1901
|
-
return ((struct RFloat *)v)->float_value;
|
1902
|
-
}
|
1903
|
-
|
1904
|
-
static inline double
|
1905
|
-
rb_float_value_inline(VALUE v)
|
1906
|
-
{
|
1907
|
-
if (FLONUM_P(v)) {
|
1908
|
-
return rb_float_flonum_value(v);
|
1909
|
-
}
|
1910
|
-
return rb_float_noflonum_value(v);
|
1911
|
-
}
|
1912
|
-
|
1913
|
-
static inline VALUE
|
1914
|
-
rb_float_new_inline(double d)
|
1915
|
-
{
|
1916
|
-
#if USE_FLONUM
|
1917
|
-
union {
|
1918
|
-
double d;
|
1919
|
-
VALUE v;
|
1920
|
-
} t;
|
1921
|
-
int bits;
|
1922
|
-
|
1923
|
-
t.d = d;
|
1924
|
-
bits = (int)((VALUE)(t.v >> 60) & 0x7);
|
1925
|
-
/* bits contains 3 bits of b62..b60. */
|
1926
|
-
/* bits - 3 = */
|
1927
|
-
/* b011 -> b000 */
|
1928
|
-
/* b100 -> b001 */
|
1929
|
-
|
1930
|
-
if (t.v != 0x3000000000000000 /* 1.72723e-77 */ &&
|
1931
|
-
!((bits-3) & ~0x01)) {
|
1932
|
-
return (RUBY_BIT_ROTL(t.v, 3) & ~(VALUE)0x01) | 0x02;
|
1933
|
-
}
|
1934
|
-
else if (t.v == (VALUE)0) {
|
1935
|
-
/* +0.0 */
|
1936
|
-
return 0x8000000000000002;
|
1937
|
-
}
|
1938
|
-
/* out of range */
|
1939
|
-
#endif
|
1940
|
-
return rb_float_new_in_heap(d);
|
1941
|
-
}
|
1942
|
-
|
1943
|
-
#define rb_float_value(v) rb_float_value_inline(v)
|
1944
|
-
#define rb_float_new(d) rb_float_new_inline(d)
|
1945
|
-
|
1946
|
-
/* object.c */
|
1947
|
-
void rb_obj_copy_ivar(VALUE dest, VALUE obj);
|
1948
|
-
CONSTFUNC(VALUE rb_obj_equal(VALUE obj1, VALUE obj2));
|
1949
|
-
CONSTFUNC(VALUE rb_obj_not(VALUE obj));
|
1950
|
-
VALUE rb_class_search_ancestor(VALUE klass, VALUE super);
|
1951
|
-
NORETURN(void rb_undefined_alloc(VALUE klass));
|
1952
|
-
double rb_num_to_dbl(VALUE val);
|
1953
|
-
VALUE rb_obj_dig(int argc, VALUE *argv, VALUE self, VALUE notfound);
|
1954
|
-
VALUE rb_immutable_obj_clone(int, VALUE *, VALUE);
|
1955
|
-
VALUE rb_obj_not_equal(VALUE obj1, VALUE obj2);
|
1956
|
-
VALUE rb_convert_type_with_id(VALUE,int,const char*,ID);
|
1957
|
-
VALUE rb_check_convert_type_with_id(VALUE,int,const char*,ID);
|
1958
|
-
int rb_bool_expected(VALUE, const char *);
|
1959
|
-
|
1960
|
-
struct RBasicRaw {
|
1961
|
-
VALUE flags;
|
1962
|
-
VALUE klass;
|
1963
|
-
};
|
1964
|
-
|
1965
|
-
#define RBASIC_CLEAR_CLASS(obj) memset(&(((struct RBasicRaw *)((VALUE)(obj)))->klass), 0, sizeof(VALUE))
|
1966
|
-
#define RBASIC_SET_CLASS_RAW(obj, cls) memcpy(&((struct RBasicRaw *)((VALUE)(obj)))->klass, &(cls), sizeof(VALUE))
|
1967
|
-
#define RBASIC_SET_CLASS(obj, cls) do { \
|
1968
|
-
VALUE _obj_ = (obj); \
|
1969
|
-
RB_OBJ_WRITE(_obj_, &((struct RBasicRaw *)(_obj_))->klass, cls); \
|
1970
|
-
} while (0)
|
1971
|
-
|
1972
|
-
/* parse.y */
|
1973
|
-
#ifndef USE_SYMBOL_GC
|
1974
|
-
#define USE_SYMBOL_GC 1
|
1975
|
-
#endif
|
1976
|
-
VALUE rb_parser_get_yydebug(VALUE);
|
1977
|
-
VALUE rb_parser_set_yydebug(VALUE, VALUE);
|
1978
|
-
RUBY_SYMBOL_EXPORT_BEGIN
|
1979
|
-
VALUE rb_parser_set_context(VALUE, const struct rb_iseq_struct *, int);
|
1980
|
-
RUBY_SYMBOL_EXPORT_END
|
1981
|
-
void *rb_parser_load_file(VALUE parser, VALUE name);
|
1982
|
-
int rb_is_const_name(VALUE name);
|
1983
|
-
int rb_is_class_name(VALUE name);
|
1984
|
-
int rb_is_global_name(VALUE name);
|
1985
|
-
int rb_is_instance_name(VALUE name);
|
1986
|
-
int rb_is_attrset_name(VALUE name);
|
1987
|
-
int rb_is_local_name(VALUE name);
|
1988
|
-
int rb_is_method_name(VALUE name);
|
1989
|
-
int rb_is_junk_name(VALUE name);
|
1990
|
-
PUREFUNC(int rb_is_const_sym(VALUE sym));
|
1991
|
-
PUREFUNC(int rb_is_class_sym(VALUE sym));
|
1992
|
-
PUREFUNC(int rb_is_global_sym(VALUE sym));
|
1993
|
-
PUREFUNC(int rb_is_instance_sym(VALUE sym));
|
1994
|
-
PUREFUNC(int rb_is_attrset_sym(VALUE sym));
|
1995
|
-
PUREFUNC(int rb_is_local_sym(VALUE sym));
|
1996
|
-
PUREFUNC(int rb_is_method_sym(VALUE sym));
|
1997
|
-
PUREFUNC(int rb_is_junk_sym(VALUE sym));
|
1998
|
-
ID rb_make_internal_id(void);
|
1999
|
-
void rb_gc_free_dsymbol(VALUE);
|
2000
|
-
ID rb_id_attrget(ID id);
|
2001
|
-
|
2002
|
-
/* proc.c */
|
2003
|
-
VALUE rb_proc_location(VALUE self);
|
2004
|
-
st_index_t rb_hash_proc(st_index_t hash, VALUE proc);
|
2005
|
-
int rb_block_arity(void);
|
2006
|
-
int rb_block_min_max_arity(int *max);
|
2007
|
-
VALUE rb_func_proc_new(rb_block_call_func_t func, VALUE val);
|
2008
|
-
VALUE rb_func_lambda_new(rb_block_call_func_t func, VALUE val, int min_argc, int max_argc);
|
2009
|
-
VALUE rb_block_to_s(VALUE self, const struct rb_block *block, const char *additional_info);
|
2010
|
-
|
2011
|
-
/* process.c */
|
2012
|
-
#define RB_MAX_GROUPS (65536)
|
2013
|
-
|
2014
|
-
struct waitpid_state;
|
2015
|
-
struct rb_execarg {
|
2016
|
-
union {
|
2017
|
-
struct {
|
2018
|
-
VALUE shell_script;
|
2019
|
-
} sh;
|
2020
|
-
struct {
|
2021
|
-
VALUE command_name;
|
2022
|
-
VALUE command_abspath; /* full path string or nil */
|
2023
|
-
VALUE argv_str;
|
2024
|
-
VALUE argv_buf;
|
2025
|
-
} cmd;
|
2026
|
-
} invoke;
|
2027
|
-
VALUE redirect_fds;
|
2028
|
-
VALUE envp_str;
|
2029
|
-
VALUE envp_buf;
|
2030
|
-
VALUE dup2_tmpbuf;
|
2031
|
-
unsigned use_shell : 1;
|
2032
|
-
unsigned pgroup_given : 1;
|
2033
|
-
unsigned umask_given : 1;
|
2034
|
-
unsigned unsetenv_others_given : 1;
|
2035
|
-
unsigned unsetenv_others_do : 1;
|
2036
|
-
unsigned close_others_given : 1;
|
2037
|
-
unsigned close_others_do : 1;
|
2038
|
-
unsigned chdir_given : 1;
|
2039
|
-
unsigned new_pgroup_given : 1;
|
2040
|
-
unsigned new_pgroup_flag : 1;
|
2041
|
-
unsigned uid_given : 1;
|
2042
|
-
unsigned gid_given : 1;
|
2043
|
-
unsigned exception : 1;
|
2044
|
-
unsigned exception_given : 1;
|
2045
|
-
struct waitpid_state *waitpid_state; /* for async process management */
|
2046
|
-
rb_pid_t pgroup_pgid; /* asis(-1), new pgroup(0), specified pgroup (0<V). */
|
2047
|
-
VALUE rlimit_limits; /* Qfalse or [[rtype, softlim, hardlim], ...] */
|
2048
|
-
mode_t umask_mask;
|
2049
|
-
rb_uid_t uid;
|
2050
|
-
rb_gid_t gid;
|
2051
|
-
int close_others_maxhint;
|
2052
|
-
VALUE fd_dup2;
|
2053
|
-
VALUE fd_close;
|
2054
|
-
VALUE fd_open;
|
2055
|
-
VALUE fd_dup2_child;
|
2056
|
-
VALUE env_modification; /* Qfalse or [[k1,v1], ...] */
|
2057
|
-
VALUE path_env;
|
2058
|
-
VALUE chdir_dir;
|
2059
|
-
};
|
2060
|
-
|
2061
|
-
/* argv_str contains extra two elements.
|
2062
|
-
* The beginning one is for /bin/sh used by exec_with_sh.
|
2063
|
-
* The last one for terminating NULL used by execve.
|
2064
|
-
* See rb_exec_fillarg() in process.c. */
|
2065
|
-
#define ARGVSTR2ARGV(argv_str) ((char **)RB_IMEMO_TMPBUF_PTR(argv_str) + 1)
|
2066
|
-
|
2067
|
-
static inline size_t
|
2068
|
-
ARGVSTR2ARGC(VALUE argv_str)
|
2069
|
-
{
|
2070
|
-
size_t i = 0;
|
2071
|
-
char *const *p = ARGVSTR2ARGV(argv_str);
|
2072
|
-
while (p[i++])
|
2073
|
-
;
|
2074
|
-
return i - 1;
|
2075
|
-
}
|
2076
|
-
|
2077
|
-
rb_pid_t rb_fork_ruby(int *status);
|
2078
|
-
void rb_last_status_clear(void);
|
2079
|
-
|
2080
|
-
/* range.c */
|
2081
|
-
#define RANGE_BEG(r) (RSTRUCT(r)->as.ary[0])
|
2082
|
-
#define RANGE_END(r) (RSTRUCT(r)->as.ary[1])
|
2083
|
-
#define RANGE_EXCL(r) (RSTRUCT(r)->as.ary[2])
|
2084
|
-
|
2085
|
-
/* rational.c */
|
2086
|
-
VALUE rb_rational_canonicalize(VALUE x);
|
2087
|
-
VALUE rb_rational_uminus(VALUE self);
|
2088
|
-
VALUE rb_rational_plus(VALUE self, VALUE other);
|
2089
|
-
VALUE rb_rational_mul(VALUE self, VALUE other);
|
2090
|
-
VALUE rb_lcm(VALUE x, VALUE y);
|
2091
|
-
VALUE rb_rational_reciprocal(VALUE x);
|
2092
|
-
VALUE rb_cstr_to_rat(const char *, int);
|
2093
|
-
VALUE rb_rational_abs(VALUE self);
|
2094
|
-
VALUE rb_rational_cmp(VALUE self, VALUE other);
|
2095
|
-
VALUE rb_rational_pow(VALUE self, VALUE other);
|
2096
|
-
VALUE rb_numeric_quo(VALUE x, VALUE y);
|
2097
|
-
VALUE rb_float_numerator(VALUE x);
|
2098
|
-
VALUE rb_float_denominator(VALUE x);
|
2099
|
-
|
2100
|
-
/* re.c */
|
2101
|
-
VALUE rb_reg_compile(VALUE str, int options, const char *sourcefile, int sourceline);
|
2102
|
-
VALUE rb_reg_check_preprocess(VALUE);
|
2103
|
-
long rb_reg_search0(VALUE, VALUE, long, int, int);
|
2104
|
-
VALUE rb_reg_match_p(VALUE re, VALUE str, long pos);
|
2105
|
-
bool rb_reg_start_with_p(VALUE re, VALUE str);
|
2106
|
-
void rb_backref_set_string(VALUE string, long pos, long len);
|
2107
|
-
void rb_match_unbusy(VALUE);
|
2108
|
-
int rb_match_count(VALUE match);
|
2109
|
-
int rb_match_nth_defined(int nth, VALUE match);
|
2110
|
-
VALUE rb_reg_new_ary(VALUE ary, int options);
|
2111
|
-
|
2112
|
-
/* signal.c */
|
2113
|
-
extern int ruby_enable_coredump;
|
2114
|
-
int rb_get_next_signal(void);
|
2115
|
-
|
2116
|
-
/* string.c */
|
2117
|
-
VALUE rb_fstring(VALUE);
|
2118
|
-
VALUE rb_fstring_new(const char *ptr, long len);
|
2119
|
-
#define rb_fstring_lit(str) rb_fstring_new((str), rb_strlen_lit(str))
|
2120
|
-
#define rb_fstring_literal(str) rb_fstring_lit(str)
|
2121
|
-
VALUE rb_fstring_cstr(const char *str);
|
2122
|
-
#ifdef HAVE_BUILTIN___BUILTIN_CONSTANT_P
|
2123
|
-
# define rb_fstring_cstr(str) RB_GNUC_EXTENSION_BLOCK( \
|
2124
|
-
(__builtin_constant_p(str)) ? \
|
2125
|
-
rb_fstring_new((str), (long)strlen(str)) : \
|
2126
|
-
rb_fstring_cstr(str) \
|
2127
|
-
)
|
2128
|
-
#endif
|
2129
|
-
#ifdef RUBY_ENCODING_H
|
2130
|
-
VALUE rb_fstring_enc_new(const char *ptr, long len, rb_encoding *enc);
|
2131
|
-
#define rb_fstring_enc_lit(str, enc) rb_fstring_enc_new((str), rb_strlen_lit(str), (enc))
|
2132
|
-
#define rb_fstring_enc_literal(str, enc) rb_fstring_enc_lit(str, enc)
|
2133
|
-
VALUE rb_fstring_enc_cstr(const char *ptr, rb_encoding *enc);
|
2134
|
-
# ifdef HAVE_BUILTIN___BUILTIN_CONSTANT_P
|
2135
|
-
# define rb_fstring_enc_cstr(str, enc) RB_GNUC_EXTENSION_BLOCK( \
|
2136
|
-
(__builtin_constant_p(str)) ? \
|
2137
|
-
rb_fstring_enc_new((str), (long)strlen(str), (enc)) : \
|
2138
|
-
rb_fstring_enc_cstr(str, enc) \
|
2139
|
-
)
|
2140
|
-
# endif
|
2141
|
-
#endif
|
2142
|
-
int rb_str_buf_cat_escaped_char(VALUE result, unsigned int c, int unicode_p);
|
2143
|
-
int rb_str_symname_p(VALUE);
|
2144
|
-
VALUE rb_str_quote_unprintable(VALUE);
|
2145
|
-
VALUE rb_id_quote_unprintable(ID);
|
2146
|
-
#define QUOTE(str) rb_str_quote_unprintable(str)
|
2147
|
-
#define QUOTE_ID(id) rb_id_quote_unprintable(id)
|
2148
|
-
char *rb_str_fill_terminator(VALUE str, const int termlen);
|
2149
|
-
void rb_str_change_terminator_length(VALUE str, const int oldtermlen, const int termlen);
|
2150
|
-
VALUE rb_str_locktmp_ensure(VALUE str, VALUE (*func)(VALUE), VALUE arg);
|
2151
|
-
VALUE rb_str_chomp_string(VALUE str, VALUE chomp);
|
2152
|
-
#ifdef RUBY_ENCODING_H
|
2153
|
-
VALUE rb_external_str_with_enc(VALUE str, rb_encoding *eenc);
|
2154
|
-
VALUE rb_str_cat_conv_enc_opts(VALUE newstr, long ofs, const char *ptr, long len,
|
2155
|
-
rb_encoding *from, int ecflags, VALUE ecopts);
|
2156
|
-
VALUE rb_enc_str_scrub(rb_encoding *enc, VALUE str, VALUE repl);
|
2157
|
-
VALUE rb_str_initialize(VALUE str, const char *ptr, long len, rb_encoding *enc);
|
2158
|
-
#endif
|
2159
|
-
#define STR_NOEMBED FL_USER1
|
2160
|
-
#define STR_SHARED FL_USER2 /* = ELTS_SHARED */
|
2161
|
-
#define STR_EMBED_P(str) (!FL_TEST_RAW((str), STR_NOEMBED))
|
2162
|
-
#define STR_SHARED_P(s) FL_ALL_RAW((s), STR_NOEMBED|ELTS_SHARED)
|
2163
|
-
#define is_ascii_string(str) (rb_enc_str_coderange(str) == ENC_CODERANGE_7BIT)
|
2164
|
-
#define is_broken_string(str) (rb_enc_str_coderange(str) == ENC_CODERANGE_BROKEN)
|
2165
|
-
size_t rb_str_memsize(VALUE);
|
2166
|
-
VALUE rb_sym_proc_call(ID mid, int argc, const VALUE *argv, int kw_splat, VALUE passed_proc);
|
2167
|
-
VALUE rb_sym_to_proc(VALUE sym);
|
2168
|
-
char *rb_str_to_cstr(VALUE str);
|
2169
|
-
VALUE rb_str_eql(VALUE str1, VALUE str2);
|
2170
|
-
VALUE rb_obj_as_string_result(VALUE str, VALUE obj);
|
2171
|
-
const char *ruby_escaped_char(int c);
|
2172
|
-
VALUE rb_str_opt_plus(VALUE, VALUE);
|
2173
|
-
|
2174
|
-
/* expect tail call optimization */
|
2175
|
-
static inline VALUE
|
2176
|
-
rb_str_eql_internal(const VALUE str1, const VALUE str2)
|
2177
|
-
{
|
2178
|
-
const long len = RSTRING_LEN(str1);
|
2179
|
-
const char *ptr1, *ptr2;
|
2180
|
-
|
2181
|
-
if (len != RSTRING_LEN(str2)) return Qfalse;
|
2182
|
-
if (!rb_str_comparable(str1, str2)) return Qfalse;
|
2183
|
-
if ((ptr1 = RSTRING_PTR(str1)) == (ptr2 = RSTRING_PTR(str2)))
|
2184
|
-
return Qtrue;
|
2185
|
-
if (memcmp(ptr1, ptr2, len) == 0)
|
2186
|
-
return Qtrue;
|
2187
|
-
return Qfalse;
|
2188
|
-
}
|
2189
|
-
|
2190
|
-
/* symbol.c */
|
2191
|
-
#ifdef RUBY_ENCODING_H
|
2192
|
-
VALUE rb_sym_intern(const char *ptr, long len, rb_encoding *enc);
|
2193
|
-
VALUE rb_sym_intern_cstr(const char *ptr, rb_encoding *enc);
|
2194
|
-
#ifdef __GNUC__
|
2195
|
-
#define rb_sym_intern_cstr(ptr, enc) __extension__ ( \
|
2196
|
-
{ \
|
2197
|
-
(__builtin_constant_p(ptr)) ? \
|
2198
|
-
rb_sym_intern((ptr), (long)strlen(ptr), (enc)) : \
|
2199
|
-
rb_sym_intern_cstr((ptr), (enc)); \
|
2200
|
-
})
|
2201
|
-
#endif
|
2202
|
-
#endif
|
2203
|
-
VALUE rb_sym_intern_ascii(const char *ptr, long len);
|
2204
|
-
VALUE rb_sym_intern_ascii_cstr(const char *ptr);
|
2205
|
-
#ifdef __GNUC__
|
2206
|
-
#define rb_sym_intern_ascii_cstr(ptr) __extension__ ( \
|
2207
|
-
{ \
|
2208
|
-
(__builtin_constant_p(ptr)) ? \
|
2209
|
-
rb_sym_intern_ascii((ptr), (long)strlen(ptr)) : \
|
2210
|
-
rb_sym_intern_ascii_cstr(ptr); \
|
2211
|
-
})
|
2212
|
-
#endif
|
2213
|
-
VALUE rb_to_symbol_type(VALUE obj);
|
2214
|
-
|
2215
|
-
/* struct.c */
|
2216
|
-
VALUE rb_struct_init_copy(VALUE copy, VALUE s);
|
2217
|
-
VALUE rb_struct_lookup(VALUE s, VALUE idx);
|
2218
|
-
VALUE rb_struct_s_keyword_init(VALUE klass);
|
2219
|
-
|
2220
|
-
/* time.c */
|
2221
|
-
struct timeval rb_time_timeval(VALUE);
|
2222
|
-
|
2223
|
-
/* thread.c */
|
2224
|
-
#define COVERAGE_INDEX_LINES 0
|
2225
|
-
#define COVERAGE_INDEX_BRANCHES 1
|
2226
|
-
#define COVERAGE_TARGET_LINES 1
|
2227
|
-
#define COVERAGE_TARGET_BRANCHES 2
|
2228
|
-
#define COVERAGE_TARGET_METHODS 4
|
2229
|
-
#define COVERAGE_TARGET_ONESHOT_LINES 8
|
2230
|
-
|
2231
|
-
VALUE rb_obj_is_mutex(VALUE obj);
|
2232
|
-
VALUE rb_suppress_tracing(VALUE (*func)(VALUE), VALUE arg);
|
2233
|
-
void rb_thread_execute_interrupts(VALUE th);
|
2234
|
-
VALUE rb_get_coverages(void);
|
2235
|
-
int rb_get_coverage_mode(void);
|
2236
|
-
VALUE rb_default_coverage(int);
|
2237
|
-
VALUE rb_thread_shield_new(void);
|
2238
|
-
VALUE rb_thread_shield_wait(VALUE self);
|
2239
|
-
VALUE rb_thread_shield_release(VALUE self);
|
2240
|
-
VALUE rb_thread_shield_destroy(VALUE self);
|
2241
|
-
int rb_thread_to_be_killed(VALUE thread);
|
2242
|
-
void rb_mutex_allow_trap(VALUE self, int val);
|
2243
|
-
VALUE rb_uninterruptible(VALUE (*b_proc)(VALUE), VALUE data);
|
2244
|
-
VALUE rb_mutex_owned_p(VALUE self);
|
2245
|
-
|
2246
|
-
/* transcode.c */
|
2247
|
-
extern VALUE rb_cEncodingConverter;
|
2248
|
-
#ifdef RUBY_ENCODING_H
|
2249
|
-
size_t rb_econv_memsize(rb_econv_t *);
|
2250
|
-
#endif
|
2251
|
-
|
2252
|
-
/* us_ascii.c */
|
2253
|
-
#ifdef RUBY_ENCODING_H
|
2254
|
-
extern rb_encoding OnigEncodingUS_ASCII;
|
2255
|
-
#endif
|
2256
|
-
|
2257
|
-
/* util.c */
|
2258
|
-
char *ruby_dtoa(double d_, int mode, int ndigits, int *decpt, int *sign, char **rve);
|
2259
|
-
char *ruby_hdtoa(double d, const char *xdigs, int ndigits, int *decpt, int *sign, char **rve);
|
2260
|
-
|
2261
|
-
/* utf_8.c */
|
2262
|
-
#ifdef RUBY_ENCODING_H
|
2263
|
-
extern rb_encoding OnigEncodingUTF_8;
|
2264
|
-
#endif
|
2265
|
-
|
2266
|
-
/* variable.c */
|
2267
|
-
#if USE_TRANSIENT_HEAP
|
2268
|
-
#define ROBJECT_TRANSIENT_FLAG FL_USER13
|
2269
|
-
#define ROBJ_TRANSIENT_P(obj) FL_TEST_RAW((obj), ROBJECT_TRANSIENT_FLAG)
|
2270
|
-
#define ROBJ_TRANSIENT_SET(obj) FL_SET_RAW((obj), ROBJECT_TRANSIENT_FLAG)
|
2271
|
-
#define ROBJ_TRANSIENT_UNSET(obj) FL_UNSET_RAW((obj), ROBJECT_TRANSIENT_FLAG)
|
2272
|
-
#else
|
2273
|
-
#define ROBJ_TRANSIENT_P(obj) 0
|
2274
|
-
#define ROBJ_TRANSIENT_SET(obj) ((void)0)
|
2275
|
-
#define ROBJ_TRANSIENT_UNSET(obj) ((void)0)
|
2276
|
-
#endif
|
2277
|
-
void rb_gc_mark_global_tbl(void);
|
2278
|
-
size_t rb_generic_ivar_memsize(VALUE);
|
2279
|
-
VALUE rb_search_class_path(VALUE);
|
2280
|
-
VALUE rb_attr_delete(VALUE, ID);
|
2281
|
-
VALUE rb_ivar_lookup(VALUE obj, ID id, VALUE undef);
|
2282
|
-
void rb_autoload_str(VALUE mod, ID id, VALUE file);
|
2283
|
-
VALUE rb_autoload_at_p(VALUE, ID, int);
|
2284
|
-
void rb_deprecate_constant(VALUE mod, const char *name);
|
2285
|
-
NORETURN(VALUE rb_mod_const_missing(VALUE,VALUE));
|
2286
|
-
rb_gvar_getter_t *rb_gvar_getter_function_of(const struct rb_global_entry *);
|
2287
|
-
rb_gvar_setter_t *rb_gvar_setter_function_of(const struct rb_global_entry *);
|
2288
|
-
bool rb_gvar_is_traced(const struct rb_global_entry *);
|
2289
|
-
|
2290
|
-
/* vm_insnhelper.h */
|
2291
|
-
rb_serial_t rb_next_class_serial(void);
|
2292
|
-
|
2293
|
-
/* vm.c */
|
2294
|
-
VALUE rb_obj_is_thread(VALUE obj);
|
2295
|
-
void rb_vm_mark(void *ptr);
|
2296
|
-
void Init_BareVM(void);
|
2297
|
-
void Init_vm_objects(void);
|
2298
|
-
PUREFUNC(VALUE rb_vm_top_self(void));
|
2299
|
-
void rb_thread_recycle_stack_release(VALUE *);
|
2300
|
-
VALUE *rb_thread_recycle_stack(size_t);
|
2301
|
-
void rb_vm_change_state(void);
|
2302
|
-
void rb_vm_inc_const_missing_count(void);
|
2303
|
-
const void **rb_vm_get_insns_address_table(void);
|
2304
|
-
VALUE rb_source_location(int *pline);
|
2305
|
-
const char *rb_source_location_cstr(int *pline);
|
2306
|
-
MJIT_STATIC void rb_vm_pop_cfunc_frame(void);
|
2307
|
-
int rb_vm_add_root_module(ID id, VALUE module);
|
2308
|
-
void rb_vm_check_redefinition_by_prepend(VALUE klass);
|
2309
|
-
VALUE rb_yield_refine_block(VALUE refinement, VALUE refinements);
|
2310
|
-
MJIT_STATIC VALUE ruby_vm_special_exception_copy(VALUE);
|
2311
|
-
PUREFUNC(st_table *rb_vm_fstring_table(void));
|
2312
|
-
|
2313
|
-
|
2314
|
-
/* vm_dump.c */
|
2315
|
-
void rb_print_backtrace(void);
|
2316
|
-
|
2317
|
-
/* vm_eval.c */
|
2318
|
-
void Init_vm_eval(void);
|
2319
|
-
VALUE rb_adjust_argv_kw_splat(int *, const VALUE **, int *);
|
2320
|
-
VALUE rb_current_realfilepath(void);
|
2321
|
-
VALUE rb_check_block_call(VALUE, ID, int, const VALUE *, rb_block_call_func_t, VALUE);
|
2322
|
-
typedef void rb_check_funcall_hook(int, VALUE, ID, int, const VALUE *, VALUE);
|
2323
|
-
VALUE rb_check_funcall_with_hook(VALUE recv, ID mid, int argc, const VALUE *argv,
|
2324
|
-
rb_check_funcall_hook *hook, VALUE arg);
|
2325
|
-
VALUE rb_check_funcall_with_hook_kw(VALUE recv, ID mid, int argc, const VALUE *argv,
|
2326
|
-
rb_check_funcall_hook *hook, VALUE arg, int kw_splat);
|
2327
|
-
const char *rb_type_str(enum ruby_value_type type);
|
2328
|
-
VALUE rb_check_funcall_default(VALUE, ID, int, const VALUE *, VALUE);
|
2329
|
-
VALUE rb_check_funcall_default_kw(VALUE, ID, int, const VALUE *, VALUE, int);
|
2330
|
-
VALUE rb_yield_1(VALUE val);
|
2331
|
-
VALUE rb_yield_force_blockarg(VALUE values);
|
2332
|
-
VALUE rb_lambda_call(VALUE obj, ID mid, int argc, const VALUE *argv,
|
2333
|
-
rb_block_call_func_t bl_proc, int min_argc, int max_argc,
|
2334
|
-
VALUE data2);
|
2335
|
-
|
2336
|
-
/* vm_insnhelper.c */
|
2337
|
-
VALUE rb_equal_opt(VALUE obj1, VALUE obj2);
|
2338
|
-
VALUE rb_eql_opt(VALUE obj1, VALUE obj2);
|
2339
|
-
void Init_vm_stack_canary(void);
|
2340
|
-
|
2341
|
-
/* vm_method.c */
|
2342
|
-
void Init_eval_method(void);
|
2343
|
-
|
2344
|
-
enum method_missing_reason {
|
2345
|
-
MISSING_NOENTRY = 0x00,
|
2346
|
-
MISSING_PRIVATE = 0x01,
|
2347
|
-
MISSING_PROTECTED = 0x02,
|
2348
|
-
MISSING_FCALL = 0x04,
|
2349
|
-
MISSING_VCALL = 0x08,
|
2350
|
-
MISSING_SUPER = 0x10,
|
2351
|
-
MISSING_MISSING = 0x20,
|
2352
|
-
MISSING_NONE = 0x40
|
2353
|
-
};
|
2354
|
-
struct rb_callable_method_entry_struct;
|
2355
|
-
struct rb_method_definition_struct;
|
2356
|
-
struct rb_execution_context_struct;
|
2357
|
-
struct rb_control_frame_struct;
|
2358
|
-
struct rb_calling_info;
|
2359
|
-
struct rb_call_info;
|
2360
|
-
struct rb_call_cache {
|
2361
|
-
/* inline cache: keys */
|
2362
|
-
rb_serial_t method_state;
|
2363
|
-
rb_serial_t class_serial;
|
2364
|
-
|
2365
|
-
/* inline cache: values */
|
2366
|
-
const struct rb_callable_method_entry_struct *me;
|
2367
|
-
const struct rb_method_definition_struct *def;
|
2368
|
-
|
2369
|
-
VALUE (*call)(struct rb_execution_context_struct *ec,
|
2370
|
-
struct rb_control_frame_struct *cfp,
|
2371
|
-
struct rb_calling_info *calling,
|
2372
|
-
const struct rb_call_info *ci,
|
2373
|
-
struct rb_call_cache *cc);
|
2374
|
-
|
2375
|
-
union {
|
2376
|
-
unsigned int index; /* used by ivar */
|
2377
|
-
enum method_missing_reason method_missing_reason; /* used by method_missing */
|
2378
|
-
int inc_sp; /* used by cfunc */
|
2379
|
-
} aux;
|
2380
|
-
};
|
2381
|
-
struct rb_call_cache_and_mid {
|
2382
|
-
struct rb_call_cache cc;
|
2383
|
-
ID mid;
|
2384
|
-
};
|
2385
|
-
VALUE rb_funcallv_with_cc(struct rb_call_cache_and_mid*, VALUE, ID, int, const VALUE*)
|
2386
|
-
#if GCC_VERSION_SINCE(3, 3, 0) && defined(__OPTIMIZE__)
|
2387
|
-
__attribute__((__visibility__("default"), __nonnull__(1)))
|
2388
|
-
# define rb_funcallv(recv, mid, argc, argv) \
|
2389
|
-
__extension__({ \
|
2390
|
-
static struct rb_call_cache_and_mid \
|
2391
|
-
rb_funcallv_opaque_cc = { {0, }, 0, }; \
|
2392
|
-
rb_funcallv_with_cc(&rb_funcallv_opaque_cc, \
|
2393
|
-
recv, mid, argc,argv); \
|
2394
|
-
})
|
2395
|
-
#endif
|
2396
|
-
;
|
2397
|
-
|
2398
|
-
/* miniprelude.c, prelude.c */
|
2399
|
-
void Init_prelude(void);
|
2400
|
-
|
2401
|
-
/* vm_backtrace.c */
|
2402
|
-
void Init_vm_backtrace(void);
|
2403
|
-
VALUE rb_vm_thread_backtrace(int argc, const VALUE *argv, VALUE thval);
|
2404
|
-
VALUE rb_vm_thread_backtrace_locations(int argc, const VALUE *argv, VALUE thval);
|
2405
|
-
|
2406
|
-
VALUE rb_make_backtrace(void);
|
2407
|
-
void rb_backtrace_print_as_bugreport(void);
|
2408
|
-
int rb_backtrace_p(VALUE obj);
|
2409
|
-
VALUE rb_backtrace_to_str_ary(VALUE obj);
|
2410
|
-
VALUE rb_backtrace_to_location_ary(VALUE obj);
|
2411
|
-
void rb_backtrace_each(VALUE (*iter)(VALUE recv, VALUE str), VALUE output);
|
2412
|
-
|
2413
|
-
RUBY_SYMBOL_EXPORT_BEGIN
|
2414
|
-
const char *rb_objspace_data_type_name(VALUE obj);
|
2415
|
-
|
2416
|
-
/* Temporary. This API will be removed (renamed). */
|
2417
|
-
VALUE rb_thread_io_blocking_region(rb_blocking_function_t *func, void *data1, int fd);
|
2418
|
-
|
2419
|
-
/* array.c (export) */
|
2420
|
-
void rb_ary_detransient(VALUE a);
|
2421
|
-
VALUE *rb_ary_ptr_use_start(VALUE ary);
|
2422
|
-
void rb_ary_ptr_use_end(VALUE ary);
|
2423
|
-
|
2424
|
-
/* bignum.c (export) */
|
2425
|
-
VALUE rb_big_mul_normal(VALUE x, VALUE y);
|
2426
|
-
VALUE rb_big_mul_balance(VALUE x, VALUE y);
|
2427
|
-
VALUE rb_big_mul_karatsuba(VALUE x, VALUE y);
|
2428
|
-
VALUE rb_big_mul_toom3(VALUE x, VALUE y);
|
2429
|
-
VALUE rb_big_sq_fast(VALUE x);
|
2430
|
-
VALUE rb_big_divrem_normal(VALUE x, VALUE y);
|
2431
|
-
VALUE rb_big2str_poweroftwo(VALUE x, int base);
|
2432
|
-
VALUE rb_big2str_generic(VALUE x, int base);
|
2433
|
-
VALUE rb_str2big_poweroftwo(VALUE arg, int base, int badcheck);
|
2434
|
-
VALUE rb_str2big_normal(VALUE arg, int base, int badcheck);
|
2435
|
-
VALUE rb_str2big_karatsuba(VALUE arg, int base, int badcheck);
|
2436
|
-
#if defined(HAVE_LIBGMP) && defined(HAVE_GMP_H)
|
2437
|
-
VALUE rb_big_mul_gmp(VALUE x, VALUE y);
|
2438
|
-
VALUE rb_big_divrem_gmp(VALUE x, VALUE y);
|
2439
|
-
VALUE rb_big2str_gmp(VALUE x, int base);
|
2440
|
-
VALUE rb_str2big_gmp(VALUE arg, int base, int badcheck);
|
2441
|
-
#endif
|
2442
|
-
enum rb_int_parse_flags {
|
2443
|
-
RB_INT_PARSE_SIGN = 0x01,
|
2444
|
-
RB_INT_PARSE_UNDERSCORE = 0x02,
|
2445
|
-
RB_INT_PARSE_PREFIX = 0x04,
|
2446
|
-
RB_INT_PARSE_ALL = 0x07,
|
2447
|
-
RB_INT_PARSE_DEFAULT = 0x07
|
2448
|
-
};
|
2449
|
-
VALUE rb_int_parse_cstr(const char *str, ssize_t len, char **endp, size_t *ndigits, int base, int flags);
|
2450
|
-
|
2451
|
-
/* enumerator.c (export) */
|
2452
|
-
VALUE rb_arith_seq_new(VALUE obj, VALUE meth, int argc, VALUE const *argv,
|
2453
|
-
rb_enumerator_size_func *size_fn,
|
2454
|
-
VALUE beg, VALUE end, VALUE step, int excl);
|
2455
|
-
|
2456
|
-
/* error.c (export) */
|
2457
|
-
int rb_bug_reporter_add(void (*func)(FILE *, void *), void *data);
|
2458
|
-
NORETURN(void rb_unexpected_type(VALUE,int));
|
2459
|
-
#undef Check_Type
|
2460
|
-
#define Check_Type(v, t) \
|
2461
|
-
(!RB_TYPE_P((VALUE)(v), (t)) || \
|
2462
|
-
((t) == RUBY_T_DATA && RTYPEDDATA_P(v)) ? \
|
2463
|
-
rb_unexpected_type((VALUE)(v), (t)) : (void)0)
|
2464
|
-
|
2465
|
-
static inline int
|
2466
|
-
rb_typeddata_is_instance_of_inline(VALUE obj, const rb_data_type_t *data_type)
|
2467
|
-
{
|
2468
|
-
return RB_TYPE_P(obj, T_DATA) && RTYPEDDATA_P(obj) && (RTYPEDDATA_TYPE(obj) == data_type);
|
2469
|
-
}
|
2470
|
-
#define rb_typeddata_is_instance_of rb_typeddata_is_instance_of_inline
|
2471
|
-
|
2472
|
-
/* file.c (export) */
|
2473
|
-
#if defined HAVE_READLINK && defined RUBY_ENCODING_H
|
2474
|
-
VALUE rb_readlink(VALUE path, rb_encoding *enc);
|
2475
|
-
#endif
|
2476
|
-
#ifdef __APPLE__
|
2477
|
-
VALUE rb_str_normalize_ospath(const char *ptr, long len);
|
2478
|
-
#endif
|
2479
|
-
|
2480
|
-
/* hash.c (export) */
|
2481
|
-
VALUE rb_hash_delete_entry(VALUE hash, VALUE key);
|
2482
|
-
VALUE rb_ident_hash_new(void);
|
2483
|
-
|
2484
|
-
/* io.c (export) */
|
2485
|
-
void rb_maygvl_fd_fix_cloexec(int fd);
|
2486
|
-
int rb_gc_for_fd(int err);
|
2487
|
-
void rb_write_error_str(VALUE mesg);
|
2488
|
-
|
2489
|
-
/* numeric.c (export) */
|
2490
|
-
VALUE rb_int_positive_pow(long x, unsigned long y);
|
2491
|
-
|
2492
|
-
/* object.c (export) */
|
2493
|
-
int rb_opts_exception_p(VALUE opts, int default_value);
|
2494
|
-
|
2495
|
-
/* process.c (export) */
|
2496
|
-
int rb_exec_async_signal_safe(const struct rb_execarg *e, char *errmsg, size_t errmsg_buflen);
|
2497
|
-
rb_pid_t rb_fork_async_signal_safe(int *status, int (*chfunc)(void*, char *, size_t), void *charg, VALUE fds, char *errmsg, size_t errmsg_buflen);
|
2498
|
-
VALUE rb_execarg_new(int argc, const VALUE *argv, int accept_shell, int allow_exc_opt);
|
2499
|
-
struct rb_execarg *rb_execarg_get(VALUE execarg_obj); /* dangerous. needs GC guard. */
|
2500
|
-
int rb_execarg_addopt(VALUE execarg_obj, VALUE key, VALUE val);
|
2501
|
-
void rb_execarg_parent_start(VALUE execarg_obj);
|
2502
|
-
void rb_execarg_parent_end(VALUE execarg_obj);
|
2503
|
-
int rb_execarg_run_options(const struct rb_execarg *e, struct rb_execarg *s, char* errmsg, size_t errmsg_buflen);
|
2504
|
-
VALUE rb_execarg_extract_options(VALUE execarg_obj, VALUE opthash);
|
2505
|
-
void rb_execarg_setenv(VALUE execarg_obj, VALUE env);
|
2506
|
-
|
2507
|
-
/* rational.c (export) */
|
2508
|
-
VALUE rb_gcd(VALUE x, VALUE y);
|
2509
|
-
VALUE rb_gcd_normal(VALUE self, VALUE other);
|
2510
|
-
#if defined(HAVE_LIBGMP) && defined(HAVE_GMP_H)
|
2511
|
-
VALUE rb_gcd_gmp(VALUE x, VALUE y);
|
2512
|
-
#endif
|
2513
|
-
|
2514
|
-
/* signal.c (export) */
|
2515
|
-
int rb_grantpt(int fd);
|
2516
|
-
|
2517
|
-
/* string.c (export) */
|
2518
|
-
VALUE rb_str_tmp_frozen_acquire(VALUE str);
|
2519
|
-
void rb_str_tmp_frozen_release(VALUE str, VALUE tmp);
|
2520
|
-
#ifdef RUBY_ENCODING_H
|
2521
|
-
/* internal use */
|
2522
|
-
VALUE rb_setup_fake_str(struct RString *fake_str, const char *name, long len, rb_encoding *enc);
|
2523
|
-
#endif
|
2524
|
-
VALUE rb_str_upto_each(VALUE, VALUE, int, int (*each)(VALUE, VALUE), VALUE);
|
2525
|
-
VALUE rb_str_upto_endless_each(VALUE, int (*each)(VALUE, VALUE), VALUE);
|
2526
|
-
|
2527
|
-
/* thread.c (export) */
|
2528
|
-
int ruby_thread_has_gvl_p(void); /* for ext/fiddle/closure.c */
|
2529
|
-
|
2530
|
-
/* time.c (export) */
|
2531
|
-
void ruby_reset_leap_second_info(void);
|
2532
|
-
|
2533
|
-
/* util.c (export) */
|
2534
|
-
extern const signed char ruby_digit36_to_number_table[];
|
2535
|
-
extern const char ruby_hexdigits[];
|
2536
|
-
extern unsigned long ruby_scan_digits(const char *str, ssize_t len, int base, size_t *retlen, int *overflow);
|
2537
|
-
|
2538
|
-
/* variable.c (export) */
|
2539
|
-
void rb_mark_generic_ivar(VALUE);
|
2540
|
-
void rb_mv_generic_ivar(VALUE src, VALUE dst);
|
2541
|
-
VALUE rb_const_missing(VALUE klass, VALUE name);
|
2542
|
-
int rb_class_ivar_set(VALUE klass, ID vid, VALUE value);
|
2543
|
-
void rb_iv_tbl_copy(VALUE dst, VALUE src);
|
2544
|
-
|
2545
|
-
/* gc.c (export) */
|
2546
|
-
VALUE rb_wb_protected_newobj_of(VALUE, VALUE);
|
2547
|
-
VALUE rb_wb_unprotected_newobj_of(VALUE, VALUE);
|
2548
|
-
|
2549
|
-
size_t rb_obj_memsize_of(VALUE);
|
2550
|
-
void rb_gc_verify_internal_consistency(void);
|
2551
|
-
|
2552
|
-
#define RB_OBJ_GC_FLAGS_MAX 6
|
2553
|
-
size_t rb_obj_gc_flags(VALUE, ID[], size_t);
|
2554
|
-
void rb_gc_mark_values(long n, const VALUE *values);
|
2555
|
-
void rb_gc_mark_vm_stack_values(long n, const VALUE *values);
|
2556
|
-
|
2557
|
-
#if IMEMO_DEBUG
|
2558
|
-
VALUE rb_imemo_new_debug(enum imemo_type type, VALUE v1, VALUE v2, VALUE v3, VALUE v0, const char *file, int line);
|
2559
|
-
#define rb_imemo_new(type, v1, v2, v3, v0) rb_imemo_new_debug(type, v1, v2, v3, v0, __FILE__, __LINE__)
|
2560
|
-
#else
|
2561
|
-
VALUE rb_imemo_new(enum imemo_type type, VALUE v1, VALUE v2, VALUE v3, VALUE v0);
|
2562
|
-
#endif
|
2563
|
-
|
2564
|
-
/* random.c */
|
2565
|
-
int ruby_fill_random_bytes(void *, size_t, int);
|
2566
|
-
|
2567
|
-
RUBY_SYMBOL_EXPORT_END
|
2568
|
-
|
2569
|
-
#define RUBY_DTRACE_CREATE_HOOK(name, arg) \
|
2570
|
-
RUBY_DTRACE_HOOK(name##_CREATE, arg)
|
2571
|
-
#define RUBY_DTRACE_HOOK(name, arg) \
|
2572
|
-
do { \
|
2573
|
-
if (UNLIKELY(RUBY_DTRACE_##name##_ENABLED())) { \
|
2574
|
-
int dtrace_line; \
|
2575
|
-
const char *dtrace_file = rb_source_location_cstr(&dtrace_line); \
|
2576
|
-
if (!dtrace_file) dtrace_file = ""; \
|
2577
|
-
RUBY_DTRACE_##name(arg, dtrace_file, dtrace_line); \
|
2578
|
-
} \
|
2579
|
-
} while (0)
|
2580
|
-
|
2581
|
-
#define RB_OBJ_BUILTIN_TYPE(obj) rb_obj_builtin_type(obj)
|
2582
|
-
#define OBJ_BUILTIN_TYPE(obj) RB_OBJ_BUILTIN_TYPE(obj)
|
2583
|
-
#ifdef __GNUC__
|
2584
|
-
#define rb_obj_builtin_type(obj) \
|
2585
|
-
__extension__({ \
|
2586
|
-
VALUE arg_obj = (obj); \
|
2587
|
-
RB_SPECIAL_CONST_P(arg_obj) ? -1 : \
|
2588
|
-
RB_BUILTIN_TYPE(arg_obj); \
|
2589
|
-
})
|
2590
|
-
#else
|
2591
|
-
static inline int
|
2592
|
-
rb_obj_builtin_type(VALUE obj)
|
2593
|
-
{
|
2594
|
-
return RB_SPECIAL_CONST_P(obj) ? -1 :
|
2595
|
-
RB_BUILTIN_TYPE(obj);
|
2596
|
-
}
|
2597
|
-
#endif
|
2598
|
-
|
2599
|
-
/* A macro for defining a flexible array, like: VALUE ary[FLEX_ARY_LEN]; */
|
2600
|
-
#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)
|
2601
|
-
# define FLEX_ARY_LEN /* VALUE ary[]; */
|
2602
|
-
#elif defined(__GNUC__) && !defined(__STRICT_ANSI__)
|
2603
|
-
# define FLEX_ARY_LEN 0 /* VALUE ary[0]; */
|
2604
|
-
#else
|
2605
|
-
# define FLEX_ARY_LEN 1 /* VALUE ary[1]; */
|
2606
|
-
#endif
|
2607
|
-
|
2608
|
-
/*
|
2609
|
-
* For declaring bitfields out of non-unsigned int types:
|
2610
|
-
* struct date {
|
2611
|
-
* BITFIELD(enum months, month, 4);
|
2612
|
-
* ...
|
2613
|
-
* };
|
2614
|
-
*/
|
2615
|
-
#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)
|
2616
|
-
# define BITFIELD(type, name, size) type name : size
|
2617
|
-
#else
|
2618
|
-
# define BITFIELD(type, name, size) unsigned int name : size
|
2619
|
-
#endif
|
2620
|
-
|
2621
|
-
#if defined(_MSC_VER)
|
2622
|
-
# define COMPILER_WARNING_PUSH __pragma(warning(push))
|
2623
|
-
# define COMPILER_WARNING_POP __pragma(warning(pop))
|
2624
|
-
# define COMPILER_WARNING_ERROR(flag) __pragma(warning(error: flag)))
|
2625
|
-
# define COMPILER_WARNING_IGNORED(flag) __pragma(warning(suppress: flag)))
|
2626
|
-
|
2627
|
-
#elif defined(__clang__) /* clang 2.6 already had this feature */
|
2628
|
-
# define COMPILER_WARNING_PUSH _Pragma("clang diagnostic push")
|
2629
|
-
# define COMPILER_WARNING_POP _Pragma("clang diagnostic pop")
|
2630
|
-
# define COMPILER_WARNING_SPECIFIER(kind, msg) \
|
2631
|
-
clang diagnostic kind # msg
|
2632
|
-
# define COMPILER_WARNING_ERROR(flag) \
|
2633
|
-
COMPILER_WARNING_PRAGMA(COMPILER_WARNING_SPECIFIER(error, flag))
|
2634
|
-
# define COMPILER_WARNING_IGNORED(flag) \
|
2635
|
-
COMPILER_WARNING_PRAGMA(COMPILER_WARNING_SPECIFIER(ignored, flag))
|
2636
|
-
|
2637
|
-
#elif GCC_VERSION_SINCE(4, 6, 0)
|
2638
|
-
/* https://gcc.gnu.org/onlinedocs/gcc-4.6.4/gcc/Diagnostic-Pragmas.html */
|
2639
|
-
# define COMPILER_WARNING_PUSH _Pragma("GCC diagnostic push")
|
2640
|
-
# define COMPILER_WARNING_POP _Pragma("GCC diagnostic pop")
|
2641
|
-
# define COMPILER_WARNING_SPECIFIER(kind, msg) \
|
2642
|
-
GCC diagnostic kind # msg
|
2643
|
-
# define COMPILER_WARNING_ERROR(flag) \
|
2644
|
-
COMPILER_WARNING_PRAGMA(COMPILER_WARNING_SPECIFIER(error, flag))
|
2645
|
-
# define COMPILER_WARNING_IGNORED(flag) \
|
2646
|
-
COMPILER_WARNING_PRAGMA(COMPILER_WARNING_SPECIFIER(ignored, flag))
|
2647
|
-
|
2648
|
-
#else /* other compilers to follow? */
|
2649
|
-
# define COMPILER_WARNING_PUSH /* nop */
|
2650
|
-
# define COMPILER_WARNING_POP /* nop */
|
2651
|
-
# define COMPILER_WARNING_ERROR(flag) /* nop */
|
2652
|
-
# define COMPILER_WARNING_IGNORED(flag) /* nop */
|
2653
|
-
#endif
|
2654
|
-
|
2655
|
-
#define COMPILER_WARNING_PRAGMA(str) COMPILER_WARNING_PRAGMA_(str)
|
2656
|
-
#define COMPILER_WARNING_PRAGMA_(str) _Pragma(#str)
|
2657
|
-
|
2658
|
-
#if defined(USE_UNALIGNED_MEMBER_ACCESS) && USE_UNALIGNED_MEMBER_ACCESS && \
|
2659
|
-
(defined(__clang__) || GCC_VERSION_SINCE(9, 0, 0))
|
2660
|
-
# define UNALIGNED_MEMBER_ACCESS(expr) __extension__({ \
|
2661
|
-
COMPILER_WARNING_PUSH; \
|
2662
|
-
COMPILER_WARNING_IGNORED(-Waddress-of-packed-member); \
|
2663
|
-
typeof(expr) unaligned_member_access_result = (expr); \
|
2664
|
-
COMPILER_WARNING_POP; \
|
2665
|
-
unaligned_member_access_result; \
|
2666
|
-
})
|
2667
|
-
#else
|
2668
|
-
# define UNALIGNED_MEMBER_ACCESS(expr) expr
|
2669
|
-
#endif
|
2670
|
-
#define UNALIGNED_MEMBER_PTR(ptr, mem) UNALIGNED_MEMBER_ACCESS(&(ptr)->mem)
|
2671
|
-
|
2672
|
-
#undef RB_OBJ_WRITE
|
2673
|
-
#define RB_OBJ_WRITE(a, slot, b) UNALIGNED_MEMBER_ACCESS(rb_obj_write((VALUE)(a), (VALUE *)(slot), (VALUE)(b), __FILE__, __LINE__))
|
2674
|
-
|
2675
|
-
#if defined(__cplusplus)
|
2676
|
-
#if 0
|
2677
|
-
{ /* satisfy cc-mode */
|
2678
|
-
#endif
|
2679
|
-
} /* extern "C" { */
|
2680
|
-
#endif
|
2681
|
-
|
2682
|
-
#endif /* RUBY_INTERNAL_H */
|