Ruby Racing: Challenging Ruby Methods

Transcript

1. Ruby Racing: Challenging Ruby Methods Danielle Adams / @adamzdanielle
4. Ruby Racing: Challenging Ruby Methods
5. outline • code execution at runtime • speeding up code • dive into source code
6. outline • code execution at runtime • speeding up code • dive into source code
7. static VALUE rb_ary_pop_m(int argc, VALUE *argv, VALUE ary) { VALUE result; if (argc == 0) { return rb_ary_pop(ary); } rb_ary_modify(ary); result = ary_take_first_or_last(argc, argv, ary, ARY_TAKE_LAST); ARY_INCREASE_LEN(ary, -RARRAY_LEN(result)); return str; }
8. #pop
9. How do Ruby methods work?
10. code
11. # hello_ruby_day.rb def say_hello(name) puts "Hello, #{name}!" end say_hello("Ruby Day")
12. tokens
13. AST abstract syntax trees
14. bytecode
15. bytecode + YARV
16. (This is only true for CRuby.)
17. outline • code execution at runtime • speeding up code • dive into source code
18. story time
19. What is Ruby Racing?
20. $ gem install ruby-racer
22. #flatten_race.rb require 'ruby_racer' require_relative 'flatten'
23. #flatten_race.rb require 'ruby_racer' require_relative 'flatten' input = [ 1, [ 2, 3 ] ] proc = Proc.new { |input| flatten(input) }
24. #flatten_race.rb require 'ruby_racer' require_relative 'flatten' input = [ 1, [ 2, 3 ] ] proc = Proc.new { |input| flatten(input) } RubyRacer.go(:flatten, input, &proc)
25. demo
26. What makes code faster?
27. primitive operations
28. primitive operations are fast
29. # max with each enumerable def max(array) (...) array.each do |el| max = el if el > max (...) end
30. # max with while loop def max(array) (...) while i < arr.length if array[i] > max max = array[i] (...) end
31. # benchmark iterations = 1000000 input = [ 1, 2, 3 ] operation = el + el user total real with each: 0.2500 0.2500 (0.251002) with while: 0.2200 0.2200 (0.226902)
32. array mutation
33. array mutation is costly
34. # array appending vs assignment [] << 1 [nil][0] = 1 # => [1]
35. # benchmark iterations = 1000000 user total real with append: 0.1000 0.1000 (0.096824) with assign: 0.0900 0.0900 (0.095280)
36. complex algorithms
37. complex algorithms are slow
38. outline • code execution at runtime • speeding up code • dive into source code
39. static VALUE rb_ary_flatten(int argc, VALUE *argv, VALUE ary) { int mod = 0, level = -1; VALUE result, lv; (...) result = flatten(ary, level, &mod); OBJ_INFECT(result, ary); return result; } # ruby/array.c:4631
40. static VALUE rb_ary_flatten(int argc, VALUE *argv, VALUE ary) { int mod = 0, level = -1; VALUE result, lv; (...) result = flatten(ary, level, &mod); OBJ_INFECT(result, ary); return result; } # ruby/array.c:4641
41. static VALUE flatten(VALUE ary, int level, int *modified) { long i = 0; VALUE stack, result, tmp, elt; (...) stack = ary_new(0, ARY_DEFAULT_SIZE); result = ary_new(0, RARRAY_LEN(ary)); # ruby/array.c:4508
42. static VALUE flatten(VALUE ary, int level, int *modified) { long i = 0; VALUE stack, result, tmp, elt; (...) stack = ary_new(0, ARY_DEFAULT_SIZE); result = ary_new(0, RARRAY_LEN(ary)); # ruby/array.c:4516
43. static VALUE flatten(VALUE ary, int level, int *modified) { long i = 0; VALUE stack, result, tmp, elt; (...) stack = ary_new(0, ARY_DEFAULT_SIZE); result = ary_new(0, RARRAY_LEN(ary)); # ruby/array.c:4517
44. static VALUE flatten(VALUE ary, int level, int *modified) { (...) while (i < RARRAY_LEN(ary)) { if (level >= 0 && RARRAY_LEN(stack) / 2 >= level) { rb_ary_push(result, elt); continue; (...) else { rb_ary_push(stack, ary); # ruby/array.c:4508
45. static VALUE flatten(VALUE ary, int level, int *modified) { (...) while (i < RARRAY_LEN(ary)) { if (level >= 0 && RARRAY_LEN(stack) / 2 >= level) { rb_ary_push(result, elt); continue; (...) else { rb_ary_push(stack, ary); # ruby/array.c:4544
46. static VALUE flatten(VALUE ary, int level, int *modified) { (...) while (i < RARRAY_LEN(ary)) { if (level >= 0 && RARRAY_LEN(stack) / 2 >= level) { rb_ary_push(result, elt); continue; (...) else { rb_ary_push(stack, ary); # ruby/array.c:4525
47. static VALUE flatten(VALUE ary, int level, int *modified) { (...) while (i < RARRAY_LEN(ary)) { if (level >= 0 && RARRAY_LEN(stack) / 2 >= level) { rb_ary_push(result, elt); continue; (...) else { rb_ary_push(stack, ary); # ruby/array.c:4526
48. static VALUE rb_ary_uniq(VALUE ary) { VALUE hash, uniq; (...) if (RARRAY_LEN(ary) <= 1) return rb_ary_dup(ary); (...) else { hash = ary_make_hash(ary); uniq = rb_hash_values(hash); } # ruby/array.c:4382
49. static VALUE rb_ary_uniq(VALUE ary) { VALUE hash, uniq; (...) if (RARRAY_LEN(ary) <= 1) return rb_ary_dup(ary); (...) else { hash = ary_make_hash(ary); uniq = rb_hash_values(hash); } # ruby/array.c:4387
50. static VALUE rb_ary_uniq(VALUE ary) { VALUE hash, uniq; (...) if (RARRAY_LEN(ary) <= 1) return rb_ary_dup(ary); (...) else { hash = ary_make_hash(ary); uniq = rb_hash_values(hash); } # ruby/array.c:4388
51. static VALUE rb_ary_uniq(VALUE ary) { VALUE hash, uniq; (...) if (RARRAY_LEN(ary) <= 1) return rb_ary_dup(ary); (...) else { hash = ary_make_hash(ary); uniq = rb_hash_values(hash); } # ruby/array.c:4394
52. static VALUE rb_ary_uniq(VALUE ary) { VALUE hash, uniq; (...) if (RARRAY_LEN(ary) <= 1) return rb_ary_dup(ary); (...) else { hash = ary_make_hash(ary); uniq = rb_hash_values(hash); } # ruby/array.c:4395
53. VALUE rb_ary_sort(VALUE ary) { ary = rb_ary_dup(ary); rb_ary_sort_bang(ary); return ary; } # ruby/array.c:2527
54. VALUE rb_ary_sort(VALUE ary) { ary = rb_ary_dup(ary); rb_ary_sort_bang(ary); return ary; } # ruby/array.c:2530
55. VALUE rb_ary_sort(VALUE ary) { ary = rb_ary_dup(ary); rb_ary_sort_bang(ary); return ary; } # ruby/array.c:2531
56. There are a few factors that will affect performance if we are willing to sacrifice other methodologies.
57. How do we define code quality?
58. What is Ruby best at?
60. I didn't work hard to make Ruby perfect for everyone, because you feel differently from me. No language is perfect for everyone. [...] The perfect language for Guido van Rossum is probably Python. - Yukihiro "Matz" Matsumoto
61. (Guido van Rossum wrote Python.)
62. resources
63. PyPy pypy.org
64. If you want your code to run faster, you should probably just use PyPy. - Guido van Rossum
65. Ruby Under the Microscope Pat Shaughnessy
66. Why?
67. Ruby is designed to make programmers happy. - Matz
68. @adamzdanielle code: github.com/danielleadams/ruby-racer thank you