Caml1999I037 K3Inlining_transforms?inline_by_copying_function_body#env7Inline_and_simplify_aux#Env!t@@@@@!r&Result!t@@@@@2lhs_of_application(Variable!t@@@@@0inline_requested&Lambda0inline_attribute@@@@@4specialise_requested4specialise_attribute@@@@@8closure_id_being_applied*Closure_id!t@@@@@-function_decl3Simple_value_approx4function_declaration@@@@@-function_body-function_body@@@@@(fun_varsQ#Set!t@@@@@$args$listKd!t@@@@@@@@#dbg)Debuginfo!t@@@@@(simplify6Inlining_decision_intf(simplify@@@@@@'Flambda!t@@@@&Result!t@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ *middle_end/flambda/inlining_transforms.mliC  P  @@B@@ &inline_by_copying_function_declaration#env#Env!t@@@@@!r&Result!t@@@@@.function_decls5function_declarations@@@@@2lhs_of_application!t@@@@@0inline_requested0inline_attribute@@@@@8closure_id_being_applied!t@@@@@-function_decl4function_declaration@@@@@$args !t@@@@@@@@,args_approxs!t@@@@@@@@0invariant_params&lazy_tP.#Map!t6#Set!t@@@@@@@@@@@0specialised_argsF#Map!t.specialised_to@@@@@@@@)free_vars[#Map!t.specialised_to@@@@@@@@6direct_call_surrogatesH#Map!tO!t@@@@@@@@#dbg!t@@@@@(simplify(simplify@@@@@&optionL@!t@@@@&Result!t@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@YhhiH@@C@@@ Mh=<3Inlining_transforms0dzdZK<%4cK.f(Warnings0Ef{&(Variable0?l猵eY2Var_within_closure0``ݗXFR⠠)Unit_info0'T Χ@aR%Types0"|Vȷ`X .Type_immediacy00$ jbv\"k&#Tag0&b rٍ&Symbol03E?Y7(%Subst0=aqT/!p+-Stdlib__Uchar0=H^V9>ɠ+Stdlib__Sys0b'8=OIn.Stdlib__String0 w_OA4D"Q~~+Stdlib__Set0ܔ@Z8XWaa2+Stdlib__Seq0?72#[O.Stdlib__Result0p~ !ԥ//+Stdlib__Map0*4ɇ2.Stdlib__Domain0'Ϳo\0m.K.Stdlib__Digest0#z25I*.Stdlib__Buffer0,I[?z&Stdlib0t0VoS%{<F:0Static_exception0Jmyrqܒx-8ɞ3Simple_value_approx0 c[k%S\KѠ%Shape0 M``ll6Set_of_closures_origin0!YA _XO 2Set_of_closures_id0LbO`ܩ&M*Projection02hS xj56)Primitive0dU=\I/}$Path0k.tbGmᠠ)Parsetree0v o[pY Y)Parameter0zk^f2my19+Outcometree0BuG^)= 9c 'Numbers0 q޷He0Mutable_variable0CQᷧ$$Misc0Bpg]?[q)Longident0wP q;ɡ(Location0nBɊOn?7~ؠ)Load_path0,j " nn7ݠ,Linkage_name0tԈK1G&Lambda0x_edT-uq7Internal_variable_names0TbgѹG+L4Inlining_stats_types0)x0pukC\6Inlining_decision_intf0ԥȨ?o!-Inlining_cost0i(wypP1 󰠠7Inline_and_simplify_aux0E#X̕B,;x ,Identifiable0]/*N %Ident0>ЃzV)j⠠*Freshening0xW("-9wVԠ*Format_doc0uy@GmWUࠠ'Flambda0VJ͟)Export_id0CJ9DןRa7ݷ$E#Env0S B2)Debuginfo0_ |PooGq*Data_types0v\3,Svh0Compilation_unit0Dl ]wN*Cmi_format0`M{?w}@.Closure_origin0!Havl5"_*Closure_id0 (?$/Closure_element0ǔf#M2Clambda_primitives0|& %ZIǝz0CamlinternalLazy0zY# #4#-8CamlinternalFormatBasics0|.e1R$|o5Build_path_prefix_map0DGl}%Y5Lhi,Backend_intf0󋚕LQ:X^r#(Asttypes0eT$BbRM dc/Allocated_const0/vVǟx@@@Caml1999T037I% D)Q$C3Inlining_transforms-ocaml.warning *middle_end/flambda/inlining_transforms.mliQQ@2+a-4-9-30-40-41-42 QQ@@QQ@@@@@@QQ@3@@@@@@#intA;@@#intA@@@@@&_none_@@A@A@$charB;@@$charA@@@@@ @A@&stringQ;@@&stringA@@@@@@@@%bytesC;@@%bytesA@@@@@@@@%floatD;@@%floatA@@@@@@@@$boolE;@@%falsec@@%@$trued@@+@@@A@@@@@,@A@$unitF;@@"()e@@6@@@A@@@@@7@A@ #exnG;@@@A@@@@@;@@@#effH;@@O@A@A@@@@@@D@@@,continuationI;@@Q@@P@B,continuationA@nY@@@@@@T@@@%arrayJ;@@R@A%arrayA@@@@@@_@@@ $listK;@@S@A"[]f@@l@"::g@@@T@@y@ @@A@Y@@@@@|@@@&optionL;@@V@A$Noneh@@@$Somei@@@@@A@Y@@@@@@@@)nativeintM;@@)nativeintA@@@@@@@@%int32N;@@%int32A@@@@@@@@%int64O;@@%int64A@@@@@@@@&lazy_tP;@@X@A&lazy_tA@Y@@@@@@@@ 5extension_constructorR;@@5extension_constructorA@@@@@@@@*floatarrayS;@@*floatarrayA@@@@@@@@&iarrayT;@@Y@A&iarrayA@Y@@@@@@@@ *atomic_locU;@@Z@A*atomic_locA@@@@@@@@@ .Assert_failure`#@@@@@J@@@@@@@@[@@A頰=ocaml.warn_on_literal_pattern@@0Division_by_zero]#@@@A󠰠  @+End_of_file\#$@@@A@'FailureY#,@'@@A@0Invalid_argumentX#5@0@@A $#@-Match_failureV#>@@=@9@;@@a@@A5!4!@)Not_foundZ#O@@@A&=)<)@-Out_of_memoryW#W@@@A.E1D1@.Stack_overflow^#_@@@A6M9L9@.Sys_blocked_io_#g@@@A>UATA@)Sys_error[#o@j@@AG^J]J@:Undefined_recursive_modulea#x@@w@s@u@@h@@AXo[n[@:Continuation_already_takenb#@@@A`wcvc@&Stdlib@A@*ocaml.textn 3 Source code transformations used during inlining. SS@@@@@@?inline_by_copying_function_bodyˠC  C  @б#envг7Inline_and_simplify_aux#Env!t7Inline_and_simplify_auxD  D  @ D  D  @@D  D  @ @@@@@ )Ӱ@@б!rг%&Result!t7Inline_and_simplify_auxE  E  @ E  E  @@E  E  @ @@@@@ @@б2lhs_of_applicationг(Variable!t(VariableF  /F  7@ "F  8#F  9@@@@@@  @@б0inline_requestedг&Lambda0inline_attribute&Lambda:G : P;G : V@ >G : W?G : g@@@@@@. @@б4specialise_requestedг4specialise_attribute&LambdaTH h UH h @ XH h YH h @@@@@@H @@б8closure_id_being_appliedг*Closure_id!t*Closure_idpI  qI  @ tI  uI  @@@@@@Rd @@б-function_declг3Simple_value_approx4function_declaration3Simple_value_approxJ  J  @ J  J  @@@@@@K @@б-function_bodyг-function_body3Simple_value_approxK  K  +@ K  ,K  9@@@@@@L @@б(fun_varsг#Set!t(VariableL : HL : P@ L : QL : T@@L : UL : V@ @@@@@@@б$argsг:$listM W lM W p@г!t(VariableM W aM W i@ M W jM W k@@@@@@ @@@ @@@@@б#dbgг)Debuginfo!t)DebuginfoN q zN q @ N q N q @@@@@@\ @@б(simplifyг6Inlining_decision_intf(simplify6Inlining_decision_intf*O  +O  @ .O  /O  @@@@@@ @@В@г'Flambda!t'FlambdaFP  GP  @ JP  KP  @@@@@@: @@@г&Result!t7Inline_and_simplify_auxbP  cP  @ fP  gP  @@kP  lP  @ @@@@@[@@@@)@ @@b3 @@`L@@ @@g~O  @@n@@ @@mN q v@@@@ @@sM W \@@@@ @@yL : ?%@@@@ @@K  +@@@@ @@J  1@@>*@@ @@I  7@@^L@@ @@H h m=@@l@@ @@G : ?C@@@@ @@F  I@@@@ @@E  O@@@@ @@D  U@@@C  X@)ocaml.doc  Inline a function by substituting its body (which may be subject to further transformation) at a call site. The function's declaration is not copied. This transformation is used when: - inlining a call to a non-recursive function; - inlining a call, within a recursive or mutually-recursive function, to the same or another function being defined simultaneously ("unrolling"). The maximum depth of unrolling is bounded (see [E.unrolling_allowed]). In both cases, the body of the function is copied, within a sequence of [let]s that bind the function parameters, the variables "bound by the closure" (see flambda.mli), and any function identifiers introduced by the set of closures. These stages are delimited below by comments. As an example, suppose we are inlining the following function: let f x = x + y ... let p = f, f in (fst p) 42 The call site [ (fst p) 42] will be transformed to: let clos_id = fst p in (* must eventually yield a closure *) let y = in let x' = 42 in let x = x' in x + y When unrolling a recursive function we rename the arguments to the recursive call in order to avoid clashes with existing bindings. For example, suppose we are inlining the following call to [f], which lies within its own declaration: let rec f x y = f (fst x) (y + snd x) This will be transformed to: let rec f x y = let clos_id = f in (* not used this time, since [f] has no free vars *) let x' = fst x in let y' = y + snd x in f (fst x') (y' + snd x') (* body of [f] with parameters freshened *) UB  @@@@@@@B@@j@@@@@@@ &inline_by_copying_function_declaration@YhlYh@б#envг&#Env!t7Inline_and_simplify_auxZZ@ ZZ@@ZZ@ @@@@@3@PN@A@@б!rгK&Result!t7Inline_and_simplify_aux#[$[@ '[([@@,[-[@ @@@@@%@@б.function_declsг5function_declarations3Simple_value_approxB\C\ @ F\ G\@@@@@@? @@б2lhs_of_applicationг@!t(Variable\] 8]] @@ `] Aa] B@@@@@@Y @@б0inline_requestedг>0inline_attribute&Lambdav^CYw^C_@ z^C`{^Cp@@@@@@s @@б8closure_id_being_appliedг"!t*Closure_id_q_q@ _q_q@@@@@@ @@б-function_declг 4function_declaration3Simple_value_approx``@ ``@@@@@@ @@б$argsг$listaa@г!t(Variableaa@ aa@@@@@@˰ @@@ @@@а@@б,args_approxsгD$listbb@гm!t3Simple_value_approxbb@ bb@@@@@@ @@@ @@@@@б0invariant_paramsг'&lazy_tcScY@г#Map!t(Variable$cD%cL@ (cM)cP@@-cQ.cR@ @г!#Set!t(Variable@c5Ac=@ Dc>EcA@@IcBJcC@ @@@@@$(B@@@;@@@$*G'@@@J@@@$,LG@@б0specialised_argsгN#Map!t(VariablemdZndZ@ qdZrdZ@@vdZwdZ@ @гA.specialised_to'FlambdadZpdZw@ dZxdZ@@@@@@$- @@@2@@@$/@@б)free_varsг#Map!t(Variableee@ ee@@ee@ @г|.specialised_to'Flambdaee@ ee@@@@@@$0 @@@2@@@$2°@@б6direct_call_surrogatesгr#Map!t*Closure_idff@ ff@@ff@ @г!t*Closure_idff@ ff@@@@@@(g @@@2@@@(i@@б#dbgг!t)Debuginfogg@ gg@@@@@@(j @@б(simplifyг (simplify6Inlining_decision_intf4h(5h>@ 8h?9hG@@@@@@(k1 @@г&optionFiH|GiH@В@г!t'FlambdaXiHNYiHU@ \iHV]iHW@@@@@@(lU @@@г&Result!t7Inline_and_simplify_auxtiHZuiHq@ xiHryiHx@@}iHy~iHz@ @@@@@(mv@@@@)@ @@(n}3 @@@L @@@(piHMJ@@lZ@@(q @@(rhP@@z@@(s @@(tg V@@@@(u @@(vf\@@@@(w @@(xeb@@O@@(y @@(zdZ_h@@^@@({ @@(|c$n@@@@(} @@(~bt@@@@( @@(az@@&@@( @@(`@@F4@@( @@(_qv@@fT@@( @@(İ^CH@@t@@( @@(ʰ] %@@@@( @@(а\@@@@( @@(ְ[@@@@( @@(ܰZ@@@Yhh@* { Inlining of recursive function(s) yields a copy of the functions' definitions (not just their bodies, unlike the non-recursive case) and a direct application of the new body. Note: the function really does need to be recursive (but possibly only via some mutual recursion) to end up in here; a simultaneous binding [that is non-recursive] is not sufficient. R  Xeg@@@@@@@C@@@:@@@@@@@LJ@("@@3@*$@A@ H************************************************************************A@@A@L@ H BMMBM@ H OCaml C C@ H %D&D3@ H Pierre Chambart, OCamlPro +E44,E4@ H Mark Shinwell and Leo White, Jane Street Europe 1F2F@ H 7G8G@ H Copyright 2013--2016 OCamlPro SAS =H>Hg@ H Copyright 2014--2016 Jane Street Group LLC CIhhDIh@ H IJJJ@ H All rights reserved. This file is distributed under the terms of OKPKN@ H the GNU Lesser General Public License version 2.1, with the ULOOVLO@ H special exception on linking described in the file LICENSE. [M\M@ H aNbN5@ H************************************************************************gO66hO6@ 4* Source code transformations used during inlining.  * Inline a function by substituting its body (which may be subject to further transformation) at a call site. The function's declaration is not copied. This transformation is used when: - inlining a call to a non-recursive function; - inlining a call, within a recursive or mutually-recursive function, to the same or another function being defined simultaneously ("unrolling"). The maximum depth of unrolling is bounded (see [E.unrolling_allowed]). In both cases, the body of the function is copied, within a sequence of [let]s that bind the function parameters, the variables "bound by the closure" (see flambda.mli), and any function identifiers introduced by the set of closures. These stages are delimited below by comments. As an example, suppose we are inlining the following function: let f x = x + y ... let p = f, f in (fst p) 42 The call site [ (fst p) 42] will be transformed to: let clos_id = fst p in (* must eventually yield a closure *) let y = in let x' = 42 in let x = x' in x + y When unrolling a recursive function we rename the arguments to the recursive call in order to avoid clashes with existing bindings. For example, suppose we are inlining the following call to [f], which lies within its own declaration: let rec f x y = f (fst x) (y + snd x) This will be transformed to: let rec f x y = let clos_id = f in (* not used this time, since [f] has no free vars *) let x' = fst x in let y' = y + snd x in f (fst x') (y' + snd x') (* body of [f] with parameters freshened *)  |* Inlining of recursive function(s) yields a copy of the functions' definitions (not just their bodies, unlike the non-recursive case) and a direct application of the new body. Note: the function really does need to be recursive (but possibly only via some mutual recursion) to end up in here; a simultaneous binding [that is non-recursive] is not sufficient. y@-./boot/ocamlc)-nostdlib"-I&./boot*-use-prims2runtime/primitives"-g0-strict-sequence*-principal(-absname"-w8+a-4-9-40-41-42-44-45-48+-warn-error"+a*-bin-annot/-strict-formats"-I2middle_end/flambda"-I%utils"-I'parsing"-I&typing"-I(bytecomp"-I,file_formats"-I&lambda"-I*middle_end"-I2middle_end/closure"-I2middle_end/flambda"-I=middle_end/flambda/base_types"-I'asmcomp"-I&driver"-I(toplevel"-I%tools"-I'runtime"-I1otherlibs/dynlink"-I-otherlibs/str"-I4otherlibs/systhreads"-I.otherlibs/unix"-I8otherlibs/runtime_events"-c F/home/ci/builds/workspace/main/flambda/false/label/ocaml-ubuntu-latest >10/.-,+*)('&%$#"! @@0 Q7=G`6`03@@@/Allocated_const0/vVǟx(Asttypes0eT$BbRM dc,Backend_intf0󋚕LQ:X^r#5Build_path_prefix_map0DGl}%Y5Lhi8CamlinternalFormatBasics0|.e1R$|o0CamlinternalLazy0zY# #4#-2Clambda_primitives0|& %ZIǝz/Closure_element0ǔf#M*Closure_id0 (?$.Closure_origin0!Havl5"_*Cmi_format0`M{?w}@0Compilation_unit0Dl ]wN*Data_types0v\3,Svh)Debuginfo0_ |PooGq#Env0S B2)Export_id0CJ9DןRa7ݷ$E'Flambda0VJ͟*Format_doc0uy@GmWUࠠ*Freshening0xW("-9wVԠ%Ident0>ЃzV)j⠠,Identifiable0]/*N _0E#X̕B,;x -Inlining_cost0i(wypP1 󰠠0ԥȨ?o!4Inlining_stats_types0)x0pukC\S0dzdZK<%4cK.f7Internal_variable_names0TbgѹG+L&Lambda0x_edT-uq,Linkage_name0tԈK1G)Load_path0,j " nn7ݠ(Location0nBɊOn?7~ؠ)Longident0wP q;ɡ$Misc0Bpg]?[q0Mutable_variable0CQᷧ$'Numbers0 q޷He+Outcometree0BuG^)= 9c )Parameter0zk^f2my19)Parsetree0v o[pY Y$Path0k.tbGmᠠ)Primitive0dU=\I/}*Projection02hS xj562Set_of_closures_id0LbO`ܩ&M6Set_of_closures_origin0!YA _XO %Shape0 M``ll3Simple_value_approx0 c[k%S\KѠ0Static_exception0Jmyrqܒx-8ɞ&Stdlib0t0VoS%{<F:.Stdlib__Buffer0,I[?z.Stdlib__Digest0#z25I*.Stdlib__Domain0'Ϳo\0m.K.Stdlib__Either0HD ?|>.Stdlib__Format00FClW/Stdlib__Hashtbl0(L%bԠ-Stdlib__Int640q=cT?Q1ˠ,Stdlib__Lazy0$1mlࠠ.Stdlib__Lexing0^m|e+Stdlib__Map0*4ɇ2ɠ%Subst0=aqT/!p+&Symbol03E?Y7(#Tag0&b rٍ.Type_immediacy00$ jbv\"k&%Types0"|Vȷ`X )Unit_info0'T Χ@aR2Var_within_closure0``ݗXFR⠠(Variable0?l猵eY(Warnings0Ef{&@0dzdZK<%4cK.fABC@@@@@@@@@@@@@@@:Sd{@@P@@