Caml1999I037„•¦¾â(–‡ .Lift_constants ° .lift_constantsZÐÀÁ@À³¡’'Flambda'program@@õá@úÀÁ'backendÀ› ¡’,Backend_intf!S@õá@ûÀ³¡'program@@õá@ü@õá@ý@õá@þ@°À %middle_end/flambda/lift_constants.mli~ › ›ÀA è ü@@±'@@@@„•¦¾¦Têü  .Lift_constants0Ì°ÍŽOQýcÝ/âcXa  (Warnings0mîJÉ’kÇÓgr¢îs‘ìºüº›  -Stdlib__Uchar056ýuf¾¹4ºæÍ[_  +Stdlib__Sys0 û-ռ鱦sÎ5¶/Á  .Stdlib__String0Óï<¤ˆž¬IPúÔ¦âç  +Stdlib__Set0ß\ª$¸ªõ›Ÿ;7¤Õ  +Stdlib__Seq0nw¹™zúG&amgùõ  .Stdlib__Result0³²§6 ý‘]«/ÅJ²ÿ  +Stdlib__Map0LÞò5xE|O0~,ÝJ-  .Stdlib__Lexing0êä‡e÷<.‚ÔV«Ç   ,Stdlib__Lazy0* -S™$.)æ"“0DË  -Stdlib__Int640¯Óãl-…J œ~m¶ï-Û  /Stdlib__Hashtbl0ѱ·Nù]à[ßç/!Þ©  .Stdlib__Format0É¢b täâÅæÁLÿir  .Stdlib__Either0VªÙy`¢ìu~c à .Stdlib__Domain0B€¡j¾|Ä5s¥)Ú  .Stdlib__Digest0 µl!LHgEr†Î¶”‡å   .Stdlib__Buffer0î8ŒAPüF”<¿ ¬t€µ.  &Stdlib0øLÍkÇàu]8Ê_Ù  0Static_exception0’e6Z@³F<jiÞ¢2_  3Simple_value_approx0Ü3Š ¼ô„£È"ߨMœi  %Shape0ø®„oN¡Õ„ûˆ€BH  6Set_of_closures_origin0ù 7|ÎMÓ‘TrÑœ¡t™  2Set_of_closures_id0wi xŒtW#S»ýÐSD=  *Projection0$WŠ¼F¿Ð ƒ „ßÆ8E  )Primitive0©Â²»¹~å$x½z¹Tà·  $Path0Y2kŠfÒÖ¯J.š_¿çÏ  )Parsetree0UÒ©¿=p²Ð>*¡Ú%"e  )Parameter0OÙº×K༛tÏÒ\  +Outcometree0Íe³uëWÇS~½ûÕdææ  'Numbers0ve"™ùÿ„ŒNçHS©Ôqt  0Mutable_variable0“¦~emPÍWA+ÖÙÅä9*X´  *Freshening0/·½ü^ãÿ* „bÀ1R  *Format_doc0š÷¨“Š¶Ž]mWÏ“:ãMÝ  'Flambda0Id¸v£Èóøu °"  )Export_id0-ò™bw+éœîžLO†  #Env0H×/‡]‰0K+êG  )Debuginfo0¯Pð²tJ=^£w¶/  *Data_types0I²¶û'µUe`wq]Ñ  0Compilation_unit0ù Ç{p-ŠV©gÜ_  *Cmi_format0AÚ™%Òñ ¬÷âCŒÀõÔ<  .Closure_origin0v–ˆt¥T¸êÏ{(}„zú  *Closure_id0£¹•¹5Ú:ÿÇîø•z[Þ†  /Closure_element0Yë€WZžÌ¡Q.æhVè&  2Clambda_primitives0³½1âòU¨ˆ1ÈÕ”  0CamlinternalLazy0&žÍ‚7 Îÿ”ÂôêPˆ  8CamlinternalFormatBasics0“%˜FU(Q/TþùÇu°  5Build_path_prefix_map0¸¶z’ ÙÃHÇkGsí  ,Backend_intf0)ø”ÒLÔS…äxjf1š½  (Asttypes0>‘nœ{¬T±8cئ  /Allocated_const0°Ð–¢ã¥îûÝ”®TWÅ@„•¦¾ @@Caml1999T037„•¦¾-Ð%Ì’C.Lift_constants’° °ž° -ocaml.warning°À %middle_end/flambda/lift_constants.mliQ„ˆÀQ„•@   À‘ ²2+a-4-9-30-40-41-42°À Q„—ÀQ„©@@°ÀQ„–ÀQ„ª@°@@@@@°ÀQ„„ÀQ„«@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@ n Y@ @ @@@@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@@A ° 54@’£)Not_foundZ#O@@@A  ° =<@’£-Out_of_memoryW#W@@@A ° ED@’£.Stack_overflow^#_@@@A ° ML@’£.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#‰@@@AF ° wIvI@’’&Stdlib@A°zy@ °ž° *ocaml.textT   À‘ ² ç The aim of this pass is to assign symbols to values known to be constant (in other words, whose values we know at compile time), with appropriate sharing of constants, and replace the occurrences of the constants with their corresponding symbols. This pass uses the results of two other passes, [Inconstant_idents] and [Alias_analysis]. The relationship between these two deserves some attention. [Inconstant_idents] is a "backwards" analysis that propagates implications about inconstantness of variables and set of closures IDs. [Alias_analysis] is a "forwards" analysis that is analogous to the propagation of [Simple_value_approx.t] values during [Inline_and_simplify]. It gives us information about relationships between values but not actually about their constantness. Combining these two into a single pass has been attempted previously, but was not thought to be successful; this experiment could be repeated in the future. (If "constant" is considered as "top" and "inconstant" is considered as "bottom", then [Alias_analysis] corresponds to a least fixed point and [Inconstant_idents] corresponds to a greatest fixed point.) At a high level, this pass operates as follows. Symbols are assigned to variables known to be constant and their defining expressions examined. Based on the results of [Alias_analysis], we simplify the destructive elements within the defining expressions (specifically, projection of fields from blocks), to eventually yield [Flambda.constant_defining_value]s that are entirely constructive. These will be bound to symbols in the resulting program. Another approach to this pass could be to only use the results of [Inconstant_idents] and then repeatedly lift constants and run [Inline_and_simplify] until a fixpoint. It was thought more robust to instead use [Alias_analysis], where the fixpointing involves a less complicated function. We still run [Inline_and_simplify] once after this pass since the lifting of constants may enable more functions to become closed; the simplification pass provides an easy way of cleaning up (e.g. making sure [free_vars] maps in sets of closures are correct). °ÀžS­­ÀŸ| — ™@@@@@@Š °ð .lift_constantsW °À¨~ › ŸÀ©~ › ­@б@г¡’'Flambda'program ¡ 'Flambda°À¹ ® ³Àº ® º@  °À½ ® »À¾ ® Â@°@@À³@@õá@ q­° @@б'backendЙÀ¡’,Backend_intf!S@¡ ¡ ,Backend_intf°ÀÙ@ à ØÀÚ@ à ä@  °ÀÝ@ à åÀÞ@ à æ@°@À› @õá@ rÍ°Àä@ à ÐÀå@ à ç@@г¡:'program ¡ 'Flambda°ÀñA è íÀòA è ô@  °ÀõA è õÀöA è ü@°@@À³@@õá@ så° @@ÀÁ8@õá@ tè°Àÿ@ Ã È @@ÀÁ@B@õá@ uì°J @@Ð@°À~ › ›@@±@@@°@@ò@ °f@@3ôóóôôôôô@°óh @A@   H************************************************************************°ÀA@@ÀA@L@   H °ÀBMMÀBM™@   H OCaml °ÀCššÀCšæ@   H °À"DççÀ#Dç3@   H Pierre Chambart, OCamlPro °À(E44À)E4€@   H Mark Shinwell and Leo White, Jane Street Europe °À.FÀ/FÍ@   H °À4GÎÎÀ5GÎ@   H Copyright 2013--2016 OCamlPro SAS °À:HÀ;Hg@   H Copyright 2014--2016 Jane Street Group LLC °À@IhhÀAIh´@   H °ÀFJµµÀGJµ@   H All rights reserved. This file is distributed under the terms of °ÀLKÀMKN@   H the GNU Lesser General Public License version 2.1, with the °ÀRLOOÀSLO›@   H special exception on linking described in the file LICENSE. °ÀXMœœÀYMœè@   H °À^NééÀ_Né5@   H************************************************************************°ÀdO66ÀeO6‚@   è* The aim of this pass is to assign symbols to values known to be constant (in other words, whose values we know at compile time), with appropriate sharing of constants, and replace the occurrences of the constants with their corresponding symbols. This pass uses the results of two other passes, [Inconstant_idents] and [Alias_analysis]. The relationship between these two deserves some attention. [Inconstant_idents] is a "backwards" analysis that propagates implications about inconstantness of variables and set of closures IDs. [Alias_analysis] is a "forwards" analysis that is analogous to the propagation of [Simple_value_approx.t] values during [Inline_and_simplify]. It gives us information about relationships between values but not actually about their constantness. Combining these two into a single pass has been attempted previously, but was not thought to be successful; this experiment could be repeated in the future. (If "constant" is considered as "top" and "inconstant" is considered as "bottom", then [Alias_analysis] corresponds to a least fixed point and [Inconstant_idents] corresponds to a greatest fixed point.) At a high level, this pass operates as follows. Symbols are assigned to variables known to be constant and their defining expressions examined. Based on the results of [Alias_analysis], we simplify the destructive elements within the defining expressions (specifically, projection of fields from blocks), to eventually yield [Flambda.constant_defining_value]s that are entirely constructive. These will be bound to symbols in the resulting program. Another approach to this pass could be to only use the results of [Inconstant_idents] and then repeatedly lift constants and run [Inline_and_simplify] until a fixpoint. It was thought more robust to instead use [Alias_analysis], where the fixpointing involves a less complicated function. We still run [Inline_and_simplify] once after this pass since the lifting of constants may enable more functions to become closed; the simplification pass provides an easy way of cleaning up (e.g. making sure [free_vars] maps in sets of closures are correct). Ì@ó-./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¤¥ ?/home/ci/builds/workspace/main/flambda/false/label/ocaml-alpine    > 1 0 / . - , + * ) ( ' & % $ # " !     @@0;ëÛg[Š˜^8 ’DÒ3¬««¬¬¬¬¬@ª@@  /Allocated_const0°Ð–¢ã¥îûÝ”®TWÅ  (Asttypes0>‘nœ{¬T±8cئ  ø0)ø”ÒLÔS…äxjf1š½  5Build_path_prefix_map0¸¶z’ ÙÃHÇkGsí  8CamlinternalFormatBasics0“%˜FU(Q/TþùÇu°  0CamlinternalLazy0&žÍ‚7 Îÿ”ÂôêPˆ  2Clambda_primitives0³½1âòU¨ˆ1ÈÕ”  /Closure_element0Yë€WZžÌ¡Q.æhVè&  *Closure_id0£¹•¹5Ú:ÿÇîø•z[Þ†  .Closure_origin0v–ˆt¥T¸êÏ{(}„zú  *Cmi_format0AÚ™%Òñ ¬÷âCŒÀõÔ<  0Compilation_unit0ù Ç{p-ŠV©gÜ_  *Data_types0I²¶û'µUe`wq]Ñ  )Debuginfo0¯Pð²tJ=^£w¶/  #Env0H×/‡]‰0K+êG  )Export_id0-ò™bw+éœîžLO†  ]0Id¸v£Èóøu °"  *Format_doc0š÷¨“Š¶Ž]mWÏ“:ãMÝ  *Freshening0/·½ü^ãÿ* „bÀ1R  %Ident0›">WA+ÖÙÅä9*X´  ,Identifiable0Œ ‚{µþdð\ØFX'`û  7Internal_variable_names0ü½HdýeöÕ„éL Ô©  &Lambda0îæz—1x]&ZŒÖ×T·  @0Ì°ÍŽOQýcÝ/âcXa  ,Linkage_name0EwKÑ°… …®ÚŠŠs  )Load_path0˜“ï»ßIÀÑ@18 ~  (Location0aÂù7cK_H%9Ðý  )Longident0s ÿ`ö7¦mÉ•äc  $Misc0ú[¤@þ@ãPc+zDì  0Mutable_variable0“¦~emPÍ*¡Ú%"e  $Path0Y2kŠfÒÖ¯J.š_¿çÏ  )Primitive0©Â²»¹~å$x½z¹Tà·  *Projection0$WŠ¼F¿Ð ƒ „ßÆ8E  2Set_of_closures_id0wi xŒtW#S»ýÐSD=  6Set_of_closures_origin0ù 7|ÎMÓ‘TrÑœ¡t™  %Shape0ø®„oN¡Õ„ûˆ€BH  3Simple_value_approx0Ü3Š ¼ô„£È"ߨMœi  0Static_exception0’e6Z@³F<jiÞ¢2_  &Stdlib0øLÍkÇàu]8Ê_Ù  .Stdlib__Buffer0î8ŒAPüF”<¿ ¬t€µ.  .Stdlib__Digest0 µl!LHgEr†Î¶”‡å   .Stdlib__Domain0B€¡j¾|Ä5s¥)Ú  .Stdlib__Either0VªÙy`¢ìu~c à .Stdlib__Format0É¢b täâÅæÁLÿir  /Stdlib__Hashtbl0ѱ·Nù]à[ßç/!Þ©  -Stdlib__Int640¯Óãl-…J œ~m¶ï-Û  ,Stdlib__Lazy0* -S™$.)æ"“0DË  .Stdlib__Lexing0êä‡e÷<.‚ÔV«Ç   +Stdlib__Map0LÞò5xE|O0~,ÝJ-  .Stdlib__Result0³²§6 ý‘]«/ÅJ²ÿ  +Stdlib__Seq0nw¹™zúG&amgùõ  +Stdlib__Set0ß\ª$¸ªõ›Ÿ;7¤Õ  .Stdlib__String0Óï<¤ˆž¬IPúÔ¦âç  +Stdlib__Sys0 û-ռ鱦sÎ5¶/Á  -Stdlib__Uchar056ýuf¾¹4ºæÍ[_  %Subst0Ú™þÙÜ>îs‘ìºüº›  &Symbol0‹‚Ò¡¼4d³Çß,  #Tag0\Ý…àËÞëáÿñ¸}x´Öû  .Type_immediacy0AÊ^µÄab¨O³ûhÕ  %Types0xÃøüH÷‰Œ¬+}š‰Ëq  )Unit_info0ÜÚ€h§%ßå£ýÎý(  2Var_within_closure00ÞSSJh‹¡6 —  (Variable0ý†'½ ÀÂßõGÒrÖã  (Warnings0mîJÉ’kÇÓgr¢