Caml1999I037s3Inlining_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_requested 4specialise_attribute@@@8closure_id_being_applied*Closure_id!t@@@-function_decl3Simple_value_approx4function_declaration@@@-function_body -function_body@@@(fun_varsE#Set!t@@@$args$listKV!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!t#Set!t@@@@@@@@@0specialised_args#Map!t.specialised_to@@@@@@)free_vars1#Map!t.specialised_to@@@@@@6direct_call_surrogates"#Map!t)!t@@@@@@#dbg!t@@@(simplify(simplify@@@&optionL@!t@@@@&Result!t@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@YhhiH@@C@@@ Mh=<3Inlining_transforms0 q`5d(Warnings0mJɒkgrs-Stdlib__Uchar056uf4[_+Stdlib__Sys0 -ռ鱦s5/.Stdlib__String0Vê>)Longident0s `7mɕc(Location0a7cK_H%9)Load_path0I@18 ~,Linkage_name0EwKсڊs&Lambda0z1x]&ZT7Internal_variable_names0HdeՄL ԩ4Inlining_stats_types0|Ca~T E~O6Inlining_decision_intf0*Q2tZn3v:-Inlining_cost0,30`JD:G2P͠7Inline_and_simplify_aux0#%ۈR bF,Identifiable0 {d\FX'`%Ident0">WA+9*X*Freshening0/^*b1R*Format_doc0]mWϓ:Mݠ'Flambda0Idvu ")Export_id0-bw+LO#Env0zV L{YWI)Debuginfo0PtJ=^w/*Data_types0I'Ue`wq]Ѡ0Compilation_unit0 {p-Vg_*Cmi_format0c˯7͗ԩmݠ.Closure_origin0vˆtT{(}z*Closure_id05:z[ކ/Closure_element0YWZ̡Q.hV&2Clambda_primitives01U10CamlinternalLazy0&͂7 Pˆ8CamlinternalFormatBasics0%FU(Q/Tu5Build_path_prefix_map0z HkGs,Backend_intf0)LSxjf1(Asttypes0>n{T8cئ/Allocated_const0ЖݔTW@@@Caml1999T037Gn(-#vC3Inlining_transforms-ocaml.warning *middle_end/flambda/inlining_transforms.mliQQ@2+a-4-9-30-40-41-42 QQ@@QQ@@@@@@QQ@3@@@@@@#intA;@@@A@@@@@&_none_@@A@A@$charB;@@A@@@@@@A@&stringQ;@@ A@@@@@ @@@%bytesC;@@A@@@@@@@@%floatD;@@A@@@@@@@@$boolE;@@%falsec@@@$trued@@#@@@A@@@@@$@A@$unitF;@@"()e@@.@@@A@@@@@/@A@ #exnG;@@@A@@@@@3@@@#effH;@@O@A@A@@@@@@<@@@,continuationI;@@Q@@P@B@A@nY@@@@@@K@@@%arrayJ;@@R@A@A@@@@@@U@@@ $listK;@@S@A"[]f@@b@"::g@@@T@@o@ @@A@Y@@@@@r@@@&optionL;@@V@A$Noneh@@@$Somei@@@@@A@Y@@@@@@@@)nativeintM;@@A@@@@@@@@%int32N;@@A@@@@@@@@%int64O;@@A@@@@@@@@&lazy_tP;@@X@AJA@Y@@@@@@@@5extension_constructorR;@@A@@@@@@@@*floatarrayS;@@A@@@@@@@@&iarrayT;@@Y@A[A@Y@@@@@@@@*atomic_locU;@@Z@AdA@@@@@@@@@.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@@A54@)Not_foundZ#O@@@A =<@-Out_of_memoryW#W@@@AED@.Stack_overflow^#_@@@AML@.Sys_blocked_io_#g@@@A$U'T'@)Sys_error[#o@j@@A-^0]0@:Undefined_recursive_modulea#x@@w@s@u@@h@@A>oAnA@:Continuation_already_takenb#@@@AFwIvI@&Stdlib@Azy@*ocaml.textT 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  @ @@@@@O@@б!rг%&Result!t7Inline_and_simplify_auxE  E  @ E  E  @@E  E  @ @@@@@۰@@б2lhs_of_applicationг(Variable!t(VariableF  /F  7@ F  8F  9@@@@@@  @@б0inline_requestedг&Lambda0inline_attribute&LambdaG : P G : V@ #G : W$G : g@@@@@@  @@б4specialise_requestedг4specialise_attribute&Lambda9H h :H h @ =H h >H h @@@@@@ - @@б8closure_id_being_appliedг*Closure_id!t*Closure_idUI  VI  @ YI  ZI  @@@@@@ I @@б-function_declг3Simple_value_approx4function_declaration3Simple_value_approxqJ  rJ  @ uJ  vJ  @@@@@@e @@б-function_bodyг-function_body3Simple_value_approxK  K  +@ K  ,K  9@@@@@@ @@б(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 @@@@@@B @@б(simplifyг6Inlining_decision_intf(simplify6Inlining_decision_intfO  O  @ O  O  @@@@@@ @@В@г'Flambda!t'Flambda+P  ,P  @ /P  0P  @@@@@@ @@@г&Result!t7Inline_and_simplify_auxGP  HP  @ KP  LP  @@PP  QP  @ @@@@@@@@@@)@ @@G3 @@`J @@JaO  @@j@@NeN q v@@@@RiM W \@@@@VmL : ?@@@@ZqK  !@@@@^uJ  %@@2@@byI  )@@P<@@f}H h m-@@pZ@@jG : ?1@@z@@nF  5@@@@rE  9@@@@vD  =@@@C  @@)ocaml.docU  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@@R@f@@@@@@ &inline_by_copying_function_declaration=YhlYh@б#envг#Env!t7Inline_and_simplify_auxZZ@ ZZ@@ZZ@ @@@@@3@8N@A@@б!rг3&Result!t7Inline_and_simplify_aux[[@ [[@@[[@ @@@@@%@@б.function_declsг5function_declarations3Simple_value_approx\\ @ \ \@@@@@@? @@б2lhs_of_applicationг(!t(Variable)] 8*] @@ -] A.] B@@@@@@Y @@б0inline_requestedг&0inline_attribute&LambdaC^CYD^C_@ G^C`H^Cp@@@@@@s @@б8closure_id_being_appliedг !t*Closure_id]_q^_q@ a_qb_q@@@@@@ @@б-function_declг4function_declaration3Simple_value_approxw`x`@ {`|`@@@@@@ @@б$argsг$listaa@г!t(Variableaa@ aa@@@@@@˰ @@@ @@@а@@б,args_approxsг$listbb@гU!t3Simple_value_approxbb@ bb@@@@@@ @@@ @@@@@б0invariant_paramsг&lazy_tcScY@г#Map!t(VariablecDcL@ cMcP@@cQcR@ @г #Set!t(Variable c5c=@ c>cA@@cBcC@ @@@@@B@@@;@@@G'@@@J@@@LG@@б0specialised_argsг6#Map!t(Variable:dZ;dZ@ >dZ?dZ@@CdZDdZ@ @г).specialised_to'FlambdaRdZpSdZw@ VdZxWdZ@@@@@@ @@@2@@@@@б)free_varsгq#Map!t(Variableueve@ yeze@@~ee@ @гd.specialised_to'Flambdaee@ ee@@@@@@ @@@2@@@°@@б6direct_call_surrogatesгZ#Map!t*Closure_idff@ ff@@ff@ @гu!t*Closure_idff@ ff@@@@@@ @@@2@@@@@б#dbgг!t)Debuginfogg@ gg@@@@@@ @@б(simplifyг(simplify6Inlining_decision_intfh(h>@ h?hG@@@@@@1 @@г\&optioniH|iH@В@г!t'Flambda%iHN&iHU@ )iHV*iHW@@@@@@U @@@г&Result!t7Inline_and_simplify_auxAiHZBiHq@ EiHrFiHx@@JiHyKiHz@ @@@@@v@@@@)@ @@}3 @@@L @@@]iHMJ@@lX@@ahN@@v@@eg R@@@@ifV@@@@meZ@@G@@qdZ_^@@R@@uc$b@@@@ybf@@@@}aj@@@@`n@@4 @@_qvr@@R>@@^CHv@@p\@@] %z@@z@@\~@@@@[@@@@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@@@p@@@@@@@,@ "@@3@ $@A@ H************************************************************************A@@A@L@ H BMMBM@ H OCaml CC@ H DD3@ H Pierre Chambart, OCamlPro E44E4@ H Mark Shinwell and Leo White, Jane Street Europe FF@ H GG@ H Copyright 2013--2016 OCamlPro SAS HHg@ H Copyright 2014--2016 Jane Street Group LLC IhhIh@ H JJ@ H All rights reserved. This file is distributed under the terms of KKN@ H the GNU Lesser General Public License version 2.1, with the LOOLO@ H special exception on linking described in the file LICENSE.  M M@ H NN5@ H************************************************************************O66O6@ 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\] J/home/ci/builds/workspace/precheck/flambda/false/label/ocaml-ubuntu-latest >10/.-,+*)('&%$#"! @@0 Q7=G`6`03dccddddd@b@@/Allocated_const0ЖݔTWŠ(Asttypes0>n{T8cئ,Backend_intf0)LSxjf15Build_path_prefix_map0z HkGs8CamlinternalFormatBasics0%FU(Q/Tu0CamlinternalLazy0&͂7 Pˆ2Clambda_primitives01U1/Closure_element0YWZ̡Q.hV&*Closure_id05:z[ކ.Closure_origin0vˆtT{(}z*Cmi_format0c˯7͗ԩmݠ0Compilation_unit0 {p-Vg_*Data_types0I'Ue`wq]Ѡ)Debuginfo0PtJ=^w/#Env0zV L{YWI)Export_id0-bw+LO'Flambda0Idvu "*Format_doc0]mWϓ:Mݠ*Freshening0/^*b1R%Ident0">WA+9*X,Identifiable0 {d\FX'`)0#%ۈR bF-Inlining_cost0,30`JD:G2P͠0*Q2tZn3v:4Inlining_stats_types0|Ca~T E~O0 q`5d7Internal_variable_names0HdeՄL ԩ&Lambda0z1x]&ZT,Linkage_name0EwKсڊs)Load_path0I@18 ~(Location0a7cK_H%9)Longident0s `7mɕc$Misc0ob]6>Vê>0Mutable_variable0~emPs&Symbol0ҡ4d,#Tag0\݅}x.Type_immediacy0A^abOhՠ%Types0^Y~# )Unit_info0ڀh%(2Var_within_closure00SSJh6 (Variable0' Gr㠠(Warnings0mJɒkgr