ruby-changes:68898
From: John <ko1@a...>
Date: Thu, 21 Oct 2021 08:15:07 +0900 (JST)
Subject: [ruby-changes:68898] eb6e5be038 (master): Add newhash and newarray instructions to yjit codegen (#48)
https://git.ruby-lang.org/ruby.git/commit/?id=eb6e5be038 From eb6e5be038a94c622f09188c957370d86650628c Mon Sep 17 00:00:00 2001 From: John Hawthorn <john@h...> Date: Thu, 27 May 2021 10:59:41 -0700 Subject: Add newhash and newarray instructions to yjit codegen (#48) * Implement gen_newarray * Implement newhash for n=0 * Add yjit tests for newhash/newarray * Fix integer size warning on clang * Save PC and SP in newhash and newarray Co-authored-by: Maxime Chevalier-Boisvert <maximechevalierb@g...> --- bootstraptest/test_yjit.rb | 50 ++++++++++++++++++++++++++++++++++++++++++ yjit_codegen.c | 54 ++++++++++++++++++++++++++++++++++++++++++++++ 2 files changed, 104 insertions(+) diff --git a/bootstraptest/test_yjit.rb b/bootstraptest/test_yjit.rb index 524b387502..51b4a9b85f 100644 --- a/bootstraptest/test_yjit.rb +++ b/bootstraptest/test_yjit.rb @@ -927,3 +927,53 @@ assert_equal '[Proc, 1, 2, 3, Proc]', %q{ https://github.com/ruby/ruby/blob/trunk/bootstraptest/test_yjit.rb#L927 [use_zero] + use_three } + +# test building empty array +assert_equal '[]', %q{ + def build_arr + [] + end + + build_arr + build_arr +} + +# test building array of one element +assert_equal '[5]', %q{ + def build_arr(val) + [val] + end + + build_arr(5) + build_arr(5) +} + +# test building array of several element +assert_equal '[5, 5, 5, 5, 5]', %q{ + def build_arr(val) + [val, val, val, val, val] + end + + build_arr(5) + build_arr(5) +} + +# test building empty hash +assert_equal '{}', %q{ + def build_hash + {} + end + + build_hash + build_hash +} + +# test building hash with values +assert_equal '{:foo=>:bar}', %q{ + def build_hash(val) + { foo: val } + end + + build_hash(:bar) + build_hash(:bar) +} diff --git a/yjit_codegen.c b/yjit_codegen.c index a2572520c8..b1b427ab75 100644 --- a/yjit_codegen.c +++ b/yjit_codegen.c @@ -595,6 +595,58 @@ gen_adjuststack(jitstate_t* jit, ctx_t* ctx) https://github.com/ruby/ruby/blob/trunk/yjit_codegen.c#L595 return YJIT_KEEP_COMPILING; } +// new array initialized from top N values +static codegen_status_t +gen_newarray(jitstate_t* jit, ctx_t* ctx) +{ + rb_num_t n = (rb_num_t)jit_get_arg(jit, 0); + + // Save the PC and SP because we are allocating + jit_save_pc(jit, REG0); + jit_save_sp(jit, ctx); + + x86opnd_t values_ptr = ctx_sp_opnd(ctx, -(sizeof(VALUE) * (uint32_t)n)); + + // call rb_ec_ary_new_from_values(struct rb_execution_context_struct *ec, long n, const VALUE *elts); + yjit_save_regs(cb); + mov(cb, C_ARG_REGS[0], REG_EC); + mov(cb, C_ARG_REGS[1], imm_opnd(n)); + lea(cb, C_ARG_REGS[2], values_ptr); + call_ptr(cb, REG0, (void *)rb_ec_ary_new_from_values); + yjit_load_regs(cb); + + ctx_stack_pop(ctx, n); + x86opnd_t stack_ret = ctx_stack_push(ctx, TYPE_ARRAY); + mov(cb, stack_ret, RAX); + + return YJIT_KEEP_COMPILING; +} + +// new hash initialized from top N values +static codegen_status_t +gen_newhash(jitstate_t* jit, ctx_t* ctx) +{ + rb_num_t n = (rb_num_t)jit_get_arg(jit, 0); + + if (n == 0) { + // Save the PC and SP because we are allocating + jit_save_pc(jit, REG0); + jit_save_sp(jit, ctx); + + // val = rb_hash_new(); + yjit_save_regs(cb); + call_ptr(cb, REG0, (void *)rb_hash_new); + yjit_load_regs(cb); + + x86opnd_t stack_ret = ctx_stack_push(ctx, TYPE_HASH); + mov(cb, stack_ret, RAX); + + return YJIT_KEEP_COMPILING; + } else { + return YJIT_CANT_COMPILE; + } +} + static codegen_status_t gen_putnil(jitstate_t* jit, ctx_t* ctx) { @@ -2848,6 +2900,8 @@ yjit_init_codegen(void) https://github.com/ruby/ruby/blob/trunk/yjit_codegen.c#L2900 yjit_reg_op(BIN(setn), gen_setn); yjit_reg_op(BIN(pop), gen_pop); yjit_reg_op(BIN(adjuststack), gen_adjuststack); + yjit_reg_op(BIN(newarray), gen_newarray); + yjit_reg_op(BIN(newhash), gen_newhash); yjit_reg_op(BIN(putnil), gen_putnil); yjit_reg_op(BIN(putobject), gen_putobject); yjit_reg_op(BIN(putobject_INT2FIX_0_), gen_putobject_int2fix); -- cgit v1.2.1 -- ML: ruby-changes@q... Info: http://www.atdot.net/~ko1/quickml/