Skip to content

Instantly share code, notes, and snippets.

@MasterDuke17

MasterDuke17/SIL.report Secret

Created February 22, 2021 10:42
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save MasterDuke17/d74f0b761f6757d87ee2c85e0e2d83f2 to your computer and use it in GitHub Desktop.
Save MasterDuke17/d74f0b761f6757d87ee2c85e0e2d83f2 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
SIL.report
[dan@alexandria rakudo]$ ./rakudo-m -I lib/ t/09-moar/14-inline-comparators-str.t
1..7
not ok 1 - Was infix:<eq> inlined?
# Failed test 'Was infix:<eq> inlined?'
# at t/09-moar/14-inline-comparators-str.t line 16
# Spesh Inline Log Report of Process #644292 (2021-02-22T10:41:59Z)
# Executing: t/09-moar/14-inline-comparators-str.t
#
# Successful inlines
# --------------------------------------------------------------------------------
# has_compile_time_value BB(1, 24 bytes) -> visit_children BB(93)
# compile_time_value BB(2, 20 bytes) -> value BB(96)
# 2x blocks BB(2, 46 bytes) -> find_single_symbol BB(203)
# 2x addstate BB(3, 104 bytes) -> mergesubstates BB(24)
# 22x write_uint32 BB(4, 80 bytes) -> write_frame BB(173)
# states BB(5, 20 bytes) -> !protoregex BB(100)
# 3x read_uint32_at BB(6, 64 bytes) -> insert_bytecode BB(75)
# write_uint32_at BB(7, 74 bytes) -> add-internal BB(158)
# 3x write_uint32_at BB(7, 74 bytes) -> insert_bytecode BB(75)
# 2x compare_multi_sigs BB(7, 130 bytes) -> apply BB(320)
# 11x write_uint16 BB(8, 80 bytes) -> write_frame BB(173)
# write_uint8 BB(9, 80 bytes) -> add-internal BB(158)
# signature BB(9, 46 bytes) -> sort_dispatchees BB(4)
# types BB(11, 46 bytes) -> sort_dispatchees BB(4)
# write_buf_at BB(11, 52 bytes) -> insert_bytecode BB(75)
# definednesses BB(12, 46 bytes) -> sort_dispatchees BB(4)
# 2x Regex BB(13, 46 bytes) -> visit_children BB(93)
# extop_known BB(14, 52 bytes) -> compile_mastop BB(39)
# 2x PseudoStash BB(14, 46 bytes) -> visit_children BB(93)
# has-captures BB(15, 62 bytes) -> MATCH BB(139)
# extop_signature BB(15, 172 bytes) -> compile_mastop BB(39)
# 2x AST BB(18, 46 bytes) -> visit_children BB(93)
# onlyname BB(18, 46 bytes) -> MATCH BB(139)
# generic BB(21, 54 bytes) -> accepts_type BB(272)
# set BB(21, 124 bytes) -> new BB(85)
# 3x set BB(21, 124 bytes) -> new BB(95)
# 2x generic BB(21, 54 bytes) -> BB(107)
# generic BB(21, 54 bytes) -> BB(103)
# node BB(23, 172 bytes) -> visit_children BB(93)
# 2x coercive BB(23, 58 bytes) -> BB(95)
# 3x coercive BB(23, 90 bytes) -> BB(131)
# 4x returns BB(24, 122 bytes) -> visit_children BB(93)
# returns BB(24, 20 bytes) -> lexical_vars_to_locals BB(62)
# run BB(25, 118 bytes) -> !protoregex BB(100)
# CAPS BB(25, 46 bytes) -> MATCH BB(139)
# 2x run_alt BB(26, 92 bytes) -> !alt BB(103)
# isflag BB(29, 60 bytes) -> wanted BB(30)
# isflag BB(29, 60 bytes) -> final BB(34)
# isflag BB(29, 60 bytes) -> sunk BB(31)
# wanted BB(30, 74 bytes) -> visit_children BB(93)
# sunk BB(31, 74 bytes) -> visit_children BB(93)
# default BB(32, 20 bytes) -> default BB(42)
# dynamic BB(33, 46 bytes) -> lexical_vars_to_locals BB(62)
# 2x new BB(34, 40 bytes) -> compile_all_the_stmts BB(122)
# 2x new BB(34, 92 bytes) -> compile_mastop BB(39)
# 2x result_reg BB(35, 20 bytes) -> compile_all_the_stmts BB(122)
# 4x result_reg BB(35, 46 bytes) -> compile_mastop BB(39)
# new BB(35, 78 bytes) -> fresh_register BB(66)
# role_typecheck_list BB(35, 52 bytes) -> publish_type_cache BB(87)
# result_reg BB(35, 20 bytes) -> append BB(37)
# 4x result_kind BB(36, 18 bytes) -> compile_all_the_stmts BB(122)
# result_kind BB(36, 18 bytes) -> append BB(37)
# result_kind BB(36, 18 bytes) -> coerce BB(109)
# index BB(36, 18 bytes) -> is_var BB(80)
# result_kind BB(36, 18 bytes) -> compile_mastop BB(39)
# has_compile_time_value BB(37, 24 bytes) -> compile_mastop BB(39)
# append BB(37, 156 bytes) -> coerce BB(109)
# next BB(40, 38 bytes) -> default BB(42)
# ann BB(41, 168 bytes) -> visit_children BB(93)
# 2x ann BB(41, 140 bytes) -> lexical_vars_to_locals BB(62)
# 2x pos BB(42, 18 bytes) -> MARKED BB(98)
# default BB(42, 26 bytes) -> AT_KEY_CONTAINER BB(7866)
# new BB(44, 104 bytes) -> compile_mastop BB(39)
# push BB(45, 36 bytes) -> c3_merge BB(158)
# 2x push BB(45, 22 bytes) -> accepts_type BB(272)
# 2x push BB(45, 22 bytes) -> BB(103)
# 2x Str BB(46, 156 bytes) -> EXPR BB(92)
# 2x unshift BB(47, 36 bytes) -> publish_method_cache BB(166)
# unshift BB(47, 36 bytes) -> c3_merge BB(158)
# key BB(49, 30 bytes) -> sorted_keys BB(108)
# key BB(49, 30 bytes) -> shallow_copy BB(105)
# 2x key BB(49, 16 bytes) -> publish_method_cache BB(166)
# value BB(50, 30 bytes) -> shallow_copy BB(105)
# 2x value BB(50, 16 bytes) -> publish_method_cache BB(166)
# start_offset BB(52, 46 bytes) -> write_frame BB(173)
# 2x made BB(52, 20 bytes) -> EXPR BB(92)
# end_offset BB(53, 46 bytes) -> write_frame BB(173)
# wrappee BB(54, 98 bytes) -> BB(131)
# 2x category_mask BB(54, 46 bytes) -> write_frame BB(173)
# action BB(55, 46 bytes) -> write_frame BB(173)
# label BB(56, 46 bytes) -> write_frame BB(173)
# new BB(57, 54 bytes) -> AT_KEY_CONTAINER BB(7866)
# 2x pretending_to_be BB(58, 26 bytes) -> type_check BB(306)
# local BB(59, 46 bytes) -> write_frame BB(173)
# actions BB(65, 42 bytes) -> !reduce BB(95)
# bytecode BB(66, 46 bytes) -> insert_bytecode BB(75)
# annotations-offset BB(67, 46 bytes) -> insert_bytecode BB(75)
# annotations-end BB(68, 46 bytes) -> insert_bytecode BB(75)
# label-fixups BB(69, 46 bytes) -> insert_bytecode BB(75)
# labels BB(70, 46 bytes) -> insert_bytecode BB(75)
# handlers BB(71, 46 bytes) -> insert_bytecode BB(75)
# is_array_type BB(77, 52 bytes) -> compose_repr BB(85)
# is_var BB(80, 68 bytes) -> release_register BB(71)
# add_local BB(84, 100 bytes) -> fresh_register BB(66)
# new BB(85, 180 bytes) -> lexical_vars_to_locals BB(62)
# 2x ws BB(86, 114 bytes) -> EXPR BB(92)
# debug_map BB(86, 46 bytes) -> write_frame BB(173)
# debug_map_idxs BB(87, 46 bytes) -> write_frame BB(173)
# publish_boolification_spec BB(89, 170 bytes) -> compose BB(84)
# outer BB(91, 46 bytes) -> write_frame BB(173)
# BUILDPLAN BB(91, 52 bytes) -> create_BUILDPLAN BB(90)
# parents BB(93, 148 bytes) -> compose_repr BB(85)
# mro BB(94, 52 bytes) -> publish_type_cache BB(87)
# mro BB(94, 52 bytes) -> create_BUILDPLAN BB(90)
# 3x new BB(95, 138 bytes) -> lexical_vars_to_locals BB(62)
# !reduce BB(95, 138 bytes) -> !cursor_pass BB(88)
# !reduce BB(95, 138 bytes) -> EXPR BB(92)
# role_typecheck_list BB(96, 52 bytes) -> publish_type_cache BB(87)
# 6x value BB(96, 166 bytes) -> visit_children BB(93)
# cuuid-idx BB(98, 46 bytes) -> write_frame BB(173)
# method_table BB(99, 52 bytes) -> publish_method_cache BB(88)
# method_table BB(99, 52 bytes) -> create_BUILDPLAN BB(90)
# name-idx BB(99, 46 bytes) -> write_frame BB(173)
# bytecode-length BB(101, 52 bytes) -> write_frame BB(173)
# bytecode-offset BB(102, 46 bytes) -> write_frame BB(173)
# annotations-offset BB(104, 46 bytes) -> write_frame BB(173)
# mast_compunit BB(105, 46 bytes) -> compile_mastop BB(39)
# local_types BB(107, 46 bytes) -> write_frame BB(173)
# 2x name BB(108, 60 bytes) -> lexical_vars_to_locals BB(62)
# lexical_types BB(108, 46 bytes) -> write_frame BB(173)
# lexical-name-idxs BB(109, 46 bytes) -> write_frame BB(173)
# static_lex_values BB(110, 46 bytes) -> write_frame BB(173)
# decl BB(110, 60 bytes) -> lexical_vars_to_locals BB(62)
# 2x flags BB(111, 46 bytes) -> write_frame BB(173)
# cache_get BB(111, 82 bytes) -> !protoregex BB(100)
# 2x cache_get BB(111, 98 bytes) -> !alt BB(103)
# code_obj_sc_dep_idx BB(112, 46 bytes) -> write_frame BB(173)
# code_obj_sc_idx BB(113, 46 bytes) -> write_frame BB(173)
# value BB(114, 122 bytes) -> lexical_vars_to_locals BB(62)
# num-annotations BB(114, 46 bytes) -> write_frame BB(173)
# handlers BB(115, 46 bytes) -> write_frame BB(173)
# 3x BB(115, 112 bytes) -> BB(131)
# BB(116, 86 bytes) -> SUBST BB(4468)
# BB(122, 134 bytes) -> BB(4)
# resolve-label BB(122, 112 bytes) -> write_frame BB(173)
# BB(122, 134 bytes) -> SUBST BB(4468)
# 3x name BB(123, 20 bytes) -> apply BB(320)
# compile_node BB(123, 170 bytes) -> as_mast BB(111)
# 4x code BB(124, 46 bytes) -> apply BB(320)
# compile_node BB(125, 108 bytes) -> as_mast BB(111)
# resultchild BB(137, 122 bytes) -> visit_children BB(93)
# BB(137, 94 bytes) -> BB(141)
# name BB(138, 46 bytes) -> compose_repr BB(85)
# type BB(139, 110 bytes) -> compose_repr BB(85)
# BB(141, 62 bytes) -> apply BB(320)
# box_target BB(144, 162 bytes) -> compose_repr BB(85)
# auto_viv_container BB(145, 110 bytes) -> compose_repr BB(85)
# 2x is_narrower_type BB(148, 140 bytes) -> is_narrower BB(149)
# is_narrower_type BB(148, 140 bytes) -> dispatch BB(5)
# positional_delegate BB(149, 162 bytes) -> compose_repr BB(85)
# associative_delegate BB(150, 162 bytes) -> compose_repr BB(85)
# compose BB(151, 24 bytes) -> compose BB(84)
# add_local_debug_mapping BB(161, 152 bytes) -> lexical_vars_to_locals BB(62)
# 2x add_to_cache BB(169, 104 bytes) -> BB(133)
# reverse BB(177, 86 bytes) -> publish_method_cache BB(88)
# identity BB(179, 10 bytes) -> new BB(5416)
# identity BB(179, 10 bytes) -> STORE BB(5444)
# identity BB(179, 10 bytes) -> infix:<ge> BB(4796)
# 2x identity BB(179, 10 bytes) -> push-until-lazy BB(5419)
# identity BB(179, 10 bytes) -> iterator BB(4945)
# identity BB(179, 10 bytes) -> SET-SELF BB(5415)
# identity BB(179, 10 bytes) -> infix:<,> BB(5527)
# identity BB(179, 10 bytes) -> infix:<le> BB(4792)
# identity BB(179, 10 bytes) -> MERGESORT-REIFIED-LIST BB(1997)
# 2x identity BB(179, 10 bytes) -> push-at-least BB(939)
# 2x identity BB(179, 10 bytes) -> iterator BB(5422)
# 2x identity BB(179, 10 bytes) -> new BB(4943)
# 4x identity BB(179, 10 bytes) -> infix:<leg> BB(4784)
# 2x identity BB(179, 10 bytes) -> from-iterator BB(5391)
# identity BB(179, 10 bytes) -> Bool BB(5396)
# identity BB(179, 10 bytes) -> infix:<ne> BB(4788)
# identity BB(179, 10 bytes) -> infix:<eq> BB(4786)
# identity BB(179, 10 bytes) -> infix:<lt> BB(4790)
# identity BB(179, 10 bytes) -> infix:<gt> BB(4794)
# identity BB(179, 10 bytes) -> new BB(1739)
# identity BB(179, 10 bytes) -> ReifiedList BB(1748)
# identity BB(179, 10 bytes) -> named BB(8137)
# identity BB(179, 10 bytes) -> reify-at-least BB(5385)
# 2x assign-scalar-no-whence-no-typecheck BB(182, 24 bytes) -> push BB(6790)
# 2x assign-scalar-no-whence-no-typecheck BB(182, 46 bytes) -> BB(4)
# 5x assign-scalar-no-whence-no-typecheck BB(182, 24 bytes) -> abs2rel BB(12041)
# 2x context BB(224, 20 bytes) -> find_single_symbol BB(203)
# BB(232, 156 bytes) -> compile_mastop BB(39)
# decont BB(245, 18 bytes) -> push BB(4904)
# decont BB(245, 18 bytes) -> shift BB(6865)
# curried_role BB(267, 52 bytes) -> accepts_type BB(272)
# role_arguments BB(268, 52 bytes) -> accepts_type BB(272)
# return BB(275, 174 bytes) -> abs2rel BB(12041)
# !get_nonsignatured_candidate BB(318, 182 bytes) -> type_check BB(306)
# archetypes BB(321, 12 bytes) -> BB(107)
# 2x archetypes BB(321, 12 bytes) -> BB(95)
# role_typecheck_list BB(329, 156 bytes) -> type_check BB(170)
# role_typecheck_list BB(329, 156 bytes) -> accepts_type BB(272)
# 2x is_composed BB(330, 52 bytes) -> publish_method_cache BB(166)
# 2x sink BB(331, 14 bytes) -> reify-at-least BB(5385)
# 3x sink BB(331, 14 bytes) -> abs2rel BB(12041)
# 2x has_fallbacks BB(333, 154 bytes) -> publish_method_cache BB(166)
# target_type BB(403, 52 bytes) -> BB(131)
# constraint_type BB(404, 52 bytes) -> BB(131)
# has_private_method BB(495, 154 bytes) -> apply BB(320)
# 2x check_instantiated BB(516, 64 bytes) -> base_type BB(423)
# 2x check_instantiated BB(516, 64 bytes) -> definite BB(424)
# 2x SET-SELF BB(1738, 272 bytes) -> new BB(1739)
# new BB(1739, 28 bytes) -> ReifiedList BB(1748)
# 2x pull-one BB(1740, 164 bytes) -> STORE BB(5444)
# prefix:<!> BB(3656, 64 bytes) -> abs2rel BB(12041)
# infix:<leg> BB(4784, 174 bytes) -> BB(3)
# infix:<ne> BB(4788, 68 bytes) -> BB(3)
# infix:<lt> BB(4790, 68 bytes) -> BB(3)
# infix:<le> BB(4792, 68 bytes) -> BB(3)
# infix:<gt> BB(4794, 68 bytes) -> BB(3)
# infix:<ge> BB(4796, 68 bytes) -> BB(3)
# push BB(4904, 78 bytes) -> reify-at-least BB(5385)
# 2x fully-reified BB(5388, 174 bytes) -> push-until-lazy BB(5419)
# SET-SELF BB(5415, 136 bytes) -> new BB(5416)
# done BB(5418, 152 bytes) -> pull-one BB(5417)
# 2x done BB(5418, 152 bytes) -> push-until-lazy BB(5419)
# 2x iterator BB(5422, 294 bytes) -> STORE BB(5444)
# iterator BB(5422, 294 bytes) -> SUBST BB(4468)
# 2x postcircumfix:<[ ]> BB(6530, 48 bytes) -> abs2rel BB(12041)
# push BB(6790, 128 bytes) -> push-all BB(1742)
# AT-POS BB(6842, 188 bytes) -> postcircumfix:<[ ]> BB(6530)
# AT_KEY_CONTAINER BB(7866, 104 bytes) -> AT-KEY BB(7867)
# AT-KEY BB(7867, 88 bytes) -> postcircumfix:<{ }> BB(2490)
# --------------------------------------------------------------------------------
#
# Unsuccessful inlines:
# --------------------------------------------------------------------------------
# 3x compile_time_value BB(2, 52 bytes) -> value BB(96):
# target has a :noinline instruction - ins: getlexperinvtype_o
# BB(3, 554 bytes) -> BB(4):
# no spesh candidate available and bytecode too large to produce an inline
# sort_dispatchees BB(4, 3238 bytes) -> dispatch BB(5):
# bytecode is too large to inline
# 7x addedge BB(4, 982 bytes) -> mergesubstates BB(24):
# no spesh candidate available and bytecode too large to produce an inline
# 2x list BB(9, 52 bytes) -> visit_children BB(93):
# target has a :noinline instruction - ins: getlexperinvtype_o
# push BB(11, 64 bytes) -> lexical_vars_to_locals BB(62):
# target has a :noinline instruction - ins: getlexperinvtype_o
# unshift BB(13, 64 bytes) -> lexical_vars_to_locals BB(62):
# target has a :noinline instruction - ins: getlexperinvtype_o
# prepare-list BB(16, 312 bytes) -> MATCH BB(139):
# no spesh candidate available and bytecode too large to produce an inline
# prepare-hash BB(17, 348 bytes) -> MATCH BB(139):
# no spesh candidate available and bytecode too large to produce an inline
# mergesubrule BB(23, 1500 bytes) -> mergesubstates BB(24):
# no spesh candidate available and bytecode too large to produce an inline
# force_value BB(24, 290 bytes) -> find_lexical BB(21):
# no spesh candidate available and bytecode too large to produce an inline
# 2x is_bindable BB(24, 194 bytes) -> BB(133):
# no spesh candidate available and bytecode too large to produce an inline
# named BB(25, 212 bytes) -> visit_children BB(93):
# no spesh candidate available and bytecode too large to produce an inline
# wanted BB(30, 266 bytes) -> visit_children BB(93):
# no spesh candidate available and bytecode too large to produce an inline
# sunk BB(31, 266 bytes) -> visit_children BB(93):
# no spesh candidate available and bytecode too large to produce an inline
# !braid_init BB(34, 214 bytes) -> !cursor_start BB(82):
# no spesh candidate available and bytecode too large to produce an inline
# !braid_init BB(34, 214 bytes) -> !cursor_start_cur BB(83):
# no spesh candidate available and bytecode too large to produce an inline
# 2x final BB(34, 266 bytes) -> visit_children BB(93):
# no spesh candidate available and bytecode too large to produce an inline
# apply BB(37, 1512 bytes) -> compose BB(84):
# no spesh candidate available and bytecode too large to produce an inline
# compile_op BB(38, 444 bytes) -> compile_node BB(123):
# no spesh candidate available and bytecode too large to produce an inline
# 2x next BB(40, 154 bytes) -> BB(95):
# target has a :noinline instruction - ins: getlexperinvtype_o
# to BB(43, 82 bytes) -> Str BB(46):
# target has a :noinline instruction - ins: getlexperinvtype_o
# unique BB(44, 306 bytes) -> lexical_vars_to_locals BB(62):
# no spesh candidate available and bytecode too large to produce an inline
# lang-rev-before BB(46, 200 bytes) -> apply BB(320):
# no spesh candidate available and bytecode too large to produce an inline
# new_with_operand_array BB(47, 1186 bytes) -> compile_mastop BB(39):
# no spesh candidate available and bytecode too large to produce an inline
# !find_wrappee BB(53, 892 bytes) -> wrappee BB(54):
# no spesh candidate available and bytecode too large to produce an inline
# add-offset BB(61, 294 bytes) -> insert_bytecode BB(75):
# no spesh candidate available and bytecode too large to produce an inline
# 2x fresh_register BB(66, 418 bytes) -> compile_mastop BB(39):
# bytecode is too large to inline
# 2x package BB(67, 74 bytes) -> find_single_symbol BB(203):
# target has a :noinline instruction - ins: getlexperinvtype_o
# assigned BB(68, 226 bytes) -> BB(95):
# no spesh candidate available and bytecode too large to produce an inline
# visit_block BB(71, 3338 bytes) -> visit_children BB(93):
# no spesh candidate available and bytecode too large to produce an inline
# release_register BB(71, 376 bytes) -> compile_all_the_stmts BB(122):
# bytecode is too large to inline
# 2x visit_op BB(72, 22742 bytes) -> visit_children BB(93):
# no spesh candidate available and bytecode too large to produce an inline
# !cursor_start BB(82, 304 bytes) -> BB(87):
# bytecode is too large to inline
# !cursor_start_cur BB(83, 546 bytes) -> EXPR BB(92):
# bytecode is too large to inline
# !cursor_start_fail BB(84, 74 bytes) -> MARKED BB(98):
# target has a :noinline instruction - ins: getlexperinvtype_o
# compose_repr BB(85, 1096 bytes) -> compose BB(84):
# no spesh candidate available and bytecode too large to produce an inline
# incorporate_multi_candidates BB(86, 1542 bytes) -> compose BB(84):
# no spesh candidate available and bytecode too large to produce an inline
# _ws BB(87, 2534 bytes) -> ws BB(86):
# no spesh candidate available and bytecode too large to produce an inline
# publish_type_cache BB(87, 436 bytes) -> compose BB(84):
# no spesh candidate available and bytecode too large to produce an inline
# publish_method_cache BB(88, 296 bytes) -> compose BB(84):
# no spesh candidate available and bytecode too large to produce an inline
# !cursor_pass BB(88, 218 bytes) -> BB(87):
# bytecode is too large to inline
# visit_want BB(89, 3546 bytes) -> visit_children BB(93):
# no spesh candidate available and bytecode too large to produce an inline
# 2x visit_var BB(90, 2258 bytes) -> visit_children BB(93):
# no spesh candidate available and bytecode too large to produce an inline
# create_BUILDPLAN BB(90, 1284 bytes) -> compose BB(84):
# no spesh candidate available and bytecode too large to produce an inline
# !cursor_fail BB(90, 198 bytes) -> BB(87):
# no spesh candidate available and bytecode too large to produce an inline
# 3x visit_children BB(93, 6252 bytes) -> visit_children BB(93):
# no spesh candidate available and bytecode too large to produce an inline
# 2x EXPR_reduce BB(93, 982 bytes) -> EXPR BB(92):
# no spesh candidate available and bytecode too large to produce an inline
# !clone_match_at BB(94, 1496 bytes) -> EXPR BB(92):
# no spesh candidate available and bytecode too large to produce an inline
# 2x !reduce BB(95, 208 bytes) -> !cursor_pass BB(88):
# no spesh candidate available and bytecode too large to produce an inline
# 2x methods BB(97, 302 bytes) -> !protoregex_table BB(102):
# bytecode is too large to inline
# 3x methods BB(97, 354 bytes) -> methods BB(97):
# no spesh candidate available and bytecode too large to produce an inline
# MARKED BB(98, 218 bytes) -> ws BB(86):
# bytecode is too large to inline
# attributes BB(99, 522 bytes) -> lexical_vars_to_locals BB(62):
# no spesh candidate available and bytecode too large to produce an inline
# !protoregex_nfa BB(101, 574 bytes) -> !protoregex BB(100):
# no spesh candidate available and bytecode too large to produce an inline
# attributes BB(104, 372 bytes) -> create_BUILDPLAN BB(90):
# no spesh candidate available and bytecode too large to produce an inline
# attributes BB(104, 372 bytes) -> attributes BB(104):
# no spesh candidate available and bytecode too large to produce an inline
# attributes BB(104, 372 bytes) -> compose BB(84):
# no spesh candidate available and bytecode too large to produce an inline
# attributes BB(104, 372 bytes) -> compose_repr BB(85):
# no spesh candidate available and bytecode too large to produce an inline
# method_order BB(106, 58 bytes) -> apply BB(320):
# target has a :noinline instruction - ins: getlexperinvtype_o
# method_names BB(107, 58 bytes) -> apply BB(320):
# target has a :noinline instruction - ins: getlexperinvtype_o
# BB(107, 248 bytes) -> BB(103):
# bytecode is too large to inline
# 5x new BB(107, 306 bytes) -> lexical_vars_to_locals BB(62):
# no spesh candidate available and bytecode too large to produce an inline
# BB(108, 1018 bytes) -> BB(103):
# no spesh candidate available and bytecode too large to produce an inline
# 2x name BB(108, 208 bytes) -> lexical_vars_to_locals BB(62):
# no spesh candidate available and bytecode too large to produce an inline
# 2x method_table BB(108, 58 bytes) -> publish_method_cache BB(166):
# target has a :noinline instruction - ins: getlexperinvtype_o
# 4x scope BB(109, 208 bytes) -> lexical_vars_to_locals BB(62):
# no spesh candidate available and bytecode too large to produce an inline
# 2x sift_down BB(109, 696 bytes) -> sorted_keys BB(108):
# bytecode is too large to inline
# 2x submethod_table BB(109, 58 bytes) -> publish_method_cache BB(166):
# target has a :noinline instruction - ins: getlexperinvtype_o
# 3x coerce BB(109, 204 bytes) -> as_mast BB(111):
# bytecode is too large to inline
# decl BB(110, 208 bytes) -> lexical_vars_to_locals BB(62):
# no spesh candidate available and bytecode too large to produce an inline
# coercion BB(110, 8690 bytes) -> coerce BB(109):
# no spesh candidate available and bytecode too large to produce an inline
# as_mast BB(111, 506 bytes) -> compile_mastop BB(39):
# no spesh candidate available and bytecode too large to produce an inline
# 2x as_mast BB(111, 506 bytes) -> compile_all_the_stmts BB(122):
# no spesh candidate available and bytecode too large to produce an inline
# cache_add BB(112, 192 bytes) -> !protoregex BB(100):
# no spesh candidate available and bytecode too large to produce an inline
# BB(116, 294 bytes) -> abs2rel BB(12041):
# no spesh candidate available and bytecode too large to produce an inline
# add_private_method BB(116, 370 bytes) -> apply BB(320):
# no spesh candidate available and bytecode too large to produce an inline
# private_method_table BB(117, 58 bytes) -> has_private_method BB(495):
# target has a :noinline instruction - ins: getlexperinvtype_o
# private_methods BB(118, 58 bytes) -> apply BB(320):
# target has a :noinline instruction - ins: getlexperinvtype_o
# private_method_names BB(119, 58 bytes) -> apply BB(320):
# target has a :noinline instruction - ins: getlexperinvtype_o
# 3x new BB(123, 246 bytes) -> lexical_vars_to_locals BB(62):
# no spesh candidate available and bytecode too large to produce an inline
# add_multi_method BB(125, 322 bytes) -> apply BB(320):
# no spesh candidate available and bytecode too large to produce an inline
# 2x multi_methods_to_incorporate BB(126, 58 bytes) -> apply BB(320):
# target has a :noinline instruction - ins: getlexperinvtype_o
# compile_var BB(127, 21424 bytes) -> compile_node BB(125):
# no spesh candidate available and bytecode too large to produce an inline
# BB(133, 5394 bytes) -> Bool BB(361):
# no spesh candidate available and bytecode too large to produce an inline
# roles_to_compose BB(137, 58 bytes) -> role_typecheck_list BB(329):
# target has a :noinline instruction - ins: getlexperinvtype_o
# 2x MATCH BB(139, 2168 bytes) -> EXPR BB(92):
# bytecode is too large to inline
# MATCH BB(139, 2168 bytes) -> !reduce BB(95):
# bytecode is too large to inline
# 2x MATCH BB(139, 2230 bytes) -> MATCH BB(139):
# no spesh candidate available and bytecode too large to produce an inline
# is_narrower BB(149, 1366 bytes) -> sort_dispatchees BB(4):
# bytecode is too large to inline
# 2x symbol BB(158, 424 bytes) -> SET_BLOCK_OUTER_CTX BB(105):
# bytecode is too large to inline
# 2x symbol BB(158, 534 bytes) -> find_single_symbol BB(203):
# no spesh candidate available and bytecode too large to produce an inline
# add-internal BB(158, 1014 bytes) -> add BB(159):
# bytecode is too large to inline
# symbol BB(158, 534 bytes) -> lexical_vars_to_locals BB(62):
# no spesh candidate available and bytecode too large to produce an inline
# c3_merge BB(158, 1070 bytes) -> c3_merge BB(158):
# no spesh candidate available and bytecode too large to produce an inline
# symbol BB(158, 432 bytes) -> find_lexical BB(21):
# bytecode is too large to inline
# mro BB(159, 344 bytes) -> type_check BB(170):
# no spesh candidate available and bytecode too large to produce an inline
# 2x mro BB(159, 344 bytes) -> publish_method_cache BB(166):
# no spesh candidate available and bytecode too large to produce an inline
# mro BB(159, 344 bytes) -> lexical_vars_to_locals BB(62):
# no spesh candidate available and bytecode too large to produce an inline
# 3x is_narrower BB(168, 3154 bytes) -> BB(131):
# bytecode is too large to inline
# compute_c3_mro BB(175, 420 bytes) -> compose BB(84):
# no spesh candidate available and bytecode too large to produce an inline
# get_frame_index BB(188, 448 bytes) -> write_frame BB(173):
# no spesh candidate available and bytecode too large to produce an inline
# 4x bind_one_param BB(191, 5468 bytes) -> bind BB(205):
# no spesh candidate available and bytecode too large to produce an inline
# handle_optional BB(204, 418 bytes) -> bind BB(205):
# no spesh candidate available and bytecode too large to produce an inline
# 2x force_value BB(211, 290 bytes) -> find_single_symbol BB(203):
# no spesh candidate available and bytecode too large to produce an inline
# 2x type_to_local_type BB(216, 570 bytes) -> write_frame BB(173):
# no spesh candidate available and bytecode too large to produce an inline
# archetypes BB(259, 230 bytes) -> accepts_type BB(272):
# no spesh candidate available and bytecode too large to produce an inline
# type_check_parents BB(289, 240 bytes) -> type_check BB(306):
# no spesh candidate available and bytecode too large to produce an inline
# want BB(290, 570 bytes) -> as_mast BB(111):
# no spesh candidate available and bytecode too large to produce an inline
# compose_method_table BB(496, 1306 bytes) -> apply BB(320):
# no spesh candidate available and bytecode too large to produce an inline
# infixish BB(543, 9164 bytes) -> EXPR BB(92):
# no spesh candidate available and bytecode too large to produce an inline
# push-exactly BB(938, 768 bytes) -> push-at-least BB(939):
# no spesh candidate available and bytecode too large to produce an inline
# push-at-least BB(939, 558 bytes) -> reify-at-least BB(5385):
# no spesh candidate available and bytecode too large to produce an inline
# INITIALIZE-DYNAMIC BB(1175, 358 bytes) -> DYNAMIC BB(260):
# target has a :noinline instruction - ins: capturelex
# new BB(1518, 196 bytes) -> pull-one BB(1519):
# target has a :noinline instruction - ins: assertparamcheck
# pull-one BB(1519, 738 bytes) -> pull-one BB(1519):
# no spesh candidate available and bytecode too large to produce an inline
# new BB(1739, 234 bytes) -> ReifiedList BB(1748):
# target has a :noinline instruction - ins: speshresolve
# push-exactly BB(1741, 586 bytes) -> push-at-least BB(939):
# no spesh candidate available and bytecode too large to produce an inline
# ReifiedList BB(1748, 244 bytes) -> iterator BB(5422):
# target has a :noinline instruction - ins: speshresolve
# APPLY-MATCHES BB(4483, 958 bytes) -> SUBST BB(4468):
# no spesh candidate available and bytecode too large to produce an inline
# infix:<cmp> BB(4780, 474 bytes) -> MERGESORT-REIFIED-LIST BB(1997):
# no spesh candidate available and bytecode too large to produce an inline
# 3x infix:<eq> BB(4786, 234 bytes) -> abs2rel BB(12041):
# target has a :noinline instruction - ins: speshresolve
# push BB(4904, 144 bytes) -> push-until-lazy BB(5419):
# target has a :noinline instruction - ins: speshresolve
# reify-at-least BB(5385, 1106 bytes) -> pull-one BB(5417):
# bytecode is too large to inline
# 2x reify-until-lazy BB(5386, 1238 bytes) -> push-until-lazy BB(5419):
# no spesh candidate available and bytecode too large to produce an inline
# from-iterator BB(5391, 396 bytes) -> STORE BB(5444):
# no spesh candidate available and bytecode too large to produce an inline
# from-slurpy-flat BB(5394, 1178 bytes) -> catdir BB(12031):
# no spesh candidate available and bytecode too large to produce an inline
# SET-SELF BB(5415, 426 bytes) -> new BB(5416):
# no spesh candidate available and bytecode too large to produce an inline
# new BB(5416, 234 bytes) -> iterator BB(5422):
# target has a :noinline instruction - ins: speshresolve
# iterator BB(5422, 464 bytes) -> reify-at-least BB(5385):
# no spesh candidate available and bytecode too large to produce an inline
# 2x sink BB(5434, 82 bytes) -> abs2rel BB(12041):
# target has a :noinline instruction - ins: assertparamcheck
# 2x STORE BB(5444, 1322 bytes) -> abs2rel BB(12041):
# bytecode is too large to inline
# 2x infix:<,> BB(5526, 298 bytes) -> abs2rel BB(12041):
# target has a :noinline instruction - ins: speshresolve
# infix:<xx> BB(5549, 640 bytes) -> abs2rel BB(12041):
# no spesh candidate available and bytecode too large to produce an inline
# push BB(6790, 272 bytes) -> push-until-lazy BB(5419):
# target has a :noinline instruction - ins: speshresolve
# 2x STORE BB(6824, 908 bytes) -> abs2rel BB(12041):
# no spesh candidate available and bytecode too large to produce an inline
# 3x shift BB(6865, 446 bytes) -> abs2rel BB(12041):
# bytecode is too large to inline
# canonpath BB(12007, 2460 bytes) -> abs2rel BB(12041):
# no spesh candidate available and bytecode too large to produce an inline
# canonpath BB(12007, 2460 bytes) -> catdir BB(12031):
# no spesh candidate available and bytecode too large to produce an inline
# rootdir BB(12011, 128 bytes) -> abs2rel BB(12041):
# target has a :noinline instruction - ins: speshresolve
# is-absolute BB(12020, 286 bytes) -> abs2rel BB(12041):
# target has a :noinline instruction - ins: assertparamcheck
# 2x splitpath BB(12027, 562 bytes) -> abs2rel BB(12041):
# no spesh candidate available and bytecode too large to produce an inline
# catpath BB(12030, 582 bytes) -> abs2rel BB(12041):
# no spesh candidate available and bytecode too large to produce an inline
# catdir BB(12031, 376 bytes) -> abs2rel BB(12041):
# target has a :noinline instruction - ins: speshresolve
# 2x splitdir BB(12032, 380 bytes) -> abs2rel BB(12041):
# target has a :noinline instruction - ins: speshresolve
# 2x rel2abs BB(12042, 1080 bytes) -> abs2rel BB(12041):
# no spesh candidate available and bytecode too large to produce an inline
# --------------------------------------------------------------------------------
ok 2 - Was infix:<ne> inlined?
ok 3 - Was infix:<gt> inlined?
ok 4 - Was infix:<ge> inlined?
ok 5 - Was infix:<lt> inlined?
ok 6 - Was infix:<le> inlined?
ok 7 - Was infix:<leg> inlined?
# You failed 1 test of 7
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment