fpy2 0.2.4__tar.gz → 0.3.0__tar.gz

fpy2-0.3.0/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

fpy2-0.3.0/NOTICE

@@ -0,0 +1,2 @@
+FPy
+Copyright 2025-2026 Brett Saiki

{fpy2-0.2.4 → fpy2-0.3.0}/PKG-INFO

@@ -1,9 +1,9 @@
 Metadata-Version: 2.4
 Name: fpy2
-Version: 0.2.4
+Version: 0.3.0
 Summary: An embedded DSL for numerical computing
 Author-email: Brett Saiki <bsaiki@cs.washington.edu>
-License-Expression: MIT
+License-Expression: Apache-2.0
 Project-URL: Homepage, https://github.com/bksaiki/fpy
 Project-URL: Issues, https://github.com/bksaiki/fpy/issues
 Project-URL: Documentation, https://fpy.readthedocs.io/
@@ -12,6 +12,7 @@ Classifier: Operating System :: OS Independent
 Requires-Python: >=3.11
 Description-Content-Type: text/markdown
 License-File: LICENSE
+License-File: NOTICE
 Requires-Dist: titanfp==0.1.2
 Requires-Dist: gmpy2==2.3.1
 Requires-Dist: numpy

{fpy2-0.2.4 → fpy2-0.3.0}/fpy2/analysis/alias.py

@@ -47,6 +47,9 @@ elements part, ``fld(c, i)`` field *i*):
 ``for row in xss``         ``reg(row) ≡ elts(xss)``
 ``xs if c else ys``        ``reg(result) ≡ reg(xs) ≡ reg(ys)``
 ``enumerate``/``zip``      ``elts(result) ≡ elts(arg)``
+``f(xs, ys)``              if ``f`` may keep ``xs``: each list in ``xs`` ≡
+                           each same-shaped one in ``result``, or in ``ys``
+                           if ``f`` may write it
 =========================  ==========================================
 
 Equality rather than inclusion is deliberate.  Each place denotes exactly one
@@ -64,13 +67,12 @@ The ownership queries stay sound because shared-outward poisons them;
 :meth:`AliasAnalysis.may_alias` is sound only for the routes above.
 
 Two routes leave the function, and they mean opposite things for ownership.
-*Shared outward* — handed to a call, or to an unmodelled operation — means
-something else may hold the list while this function still does: **E-App** keeps
-no store of its own, so a callee writes the caller's cells.  *Returned* is
-**E-Ret** handing a location out, which is a transfer; see
-:meth:`AliasAnalysis.transfers_ownership`.  Collapsing the two would forgo every
-returned value: 37 of the corpus's 299 allocation sites are fresh values that are
-returned and nothing else.
+*Shared outward* — kept by a call, or handed to an unmodelled operation — means
+something else may hold the list while this function still does.  A call that
+only writes it is flagged apart (:meth:`AliasAnalysis.callee_writes_at`):
+**E-App** keeps no store of its own, so a callee writes the caller's cells.
+*Returned* is **E-Ret** handing a location out, which is a transfer; see
+:meth:`AliasAnalysis.transfers_ownership`.
 
 Limitations
 -----------
@@ -79,12 +81,13 @@ One *summary* store for the whole function, not one per program point, so it is
 flow-insensitive: ``ys = xs`` marks ``xs`` shared even if ``ys`` is dead
 immediately afterwards, and a container part counts as a referrer even if the
 container itself is never read — except :attr:`AliasAnalysis.consumed_defs`,
-which buys back one flow-sensitive fact under narrow guards.  Intraprocedural: a
-list handed to a call is shared outward, without asking whether the callee
-retains it.  Index-insensitive: ``xs[0]`` and ``xs[1]`` are one part.  All three
+which buys back one flow-sensitive fact under narrow guards.  Context-insensitive:
+one summary of a callee (:mod:`fpy2.analysis.escape`) answers for every call to
+it.  Index-insensitive: ``xs[0]`` and ``xs[1]`` are one part.  All three
 cost precision, not soundness.
 """
 
+from collections.abc import Iterator
 from dataclasses import dataclass, field
 from typing import TYPE_CHECKING, Literal, overload
 
@@ -121,7 +124,7 @@ from ..ast import (
     Zip,
 )
 from ..function import Function
-from ..types import ListType, TupleType, Type
+from ..types import ListType, TupleType, Type, VarType
 from ..utils import Unionfind
 from .array_size import (
     ArraySizeAnalysis,
@@ -132,7 +135,7 @@ from .array_size import (
 )
 from .define_use import DefineUse, DefineUseAnalysis
 from .reaching_defs import AssignDef, Definition, same_object_defs
-from .type_infer import TypeAnalysis, TypeInfer
+from .type_infer import TypeAnalysis, TypeInfer, TypeInferError
 
 if TYPE_CHECKING:
     # `escape` builds on this module; the dependency only goes the other way
@@ -156,10 +159,10 @@ def _carries_list(ty: Type | None) -> bool:
     """Whether a value of type *ty* can hold a list reference anywhere inside it.
 
     Values that cannot are not given regions at all — nothing about them is
-    observable through aliasing.
+    observable through aliasing.  A type variable may be a list.
     """
     match ty:
-        case ListType():
+        case ListType() | VarType():
             return True
         case TupleType():
             return any(_carries_list(elt) for elt in ty.elts)
@@ -167,6 +170,17 @@ def _carries_list(ty: Type | None) -> bool:
             return False
 
 
+def _shape(ty: Type | None) -> object:
+    """*ty*'s list and tuple nesting, without sizes or scalar types."""
+    match ty:
+        case ListType():
+            return ('list', _shape(ty.elt))
+        case TupleType():
+            return tuple(_shape(elt) for elt in ty.elts)
+        case _:
+            return None
+
+
 class AllocSite:
     """A place a list value comes into existence.
 
@@ -233,12 +247,14 @@ class _Regions:
         # things for ownership -- see `AliasAnalysis.transfers_ownership`.
         self._shared_out: set[Region] = set()
         self._returned: set[Region] = set()
+        # handed to a callee that may store into it, which need not keep it
+        self._callee_written: set[Region] = set()
         self._parts: dict[Region, dict[_PartKey, Region]] = {}
 
     @property
     def _flags(self) -> tuple[set[Region], ...]:
         """Every downward-propagating class flag, so each is handled alike."""
-        return (self._shared_out, self._returned)
+        return (self._shared_out, self._returned, self._callee_written)
 
     def new(
         self, kind: str, *, name: NamedId | None = None, slot: bool = False,
@@ -363,14 +379,20 @@ class _Regions:
         inherit the flag in :meth:`part`, so the two directions together are
         order-independent.
         """
+        flag.update(self.within(c))
+
+    def parts(self, c: Region) -> dict[_PartKey, Region]:
+        return {k: self.find(r) for k, r in self._parts.get(self.find(c), {}).items()}
+
+    def within(self, c: Region) -> set[Region]:
+        """*c* and every class reachable inside it, through elements and fields."""
         pending, seen = [self.find(c)], set()
         while pending:
             root = self.find(pending.pop())
-            if root in seen:
-                continue
-            seen.add(root)
-            flag.add(root)
-            pending.extend(self._parts.get(root, {}).values())
+            if root not in seen:
+                seen.add(root)
+                pending.extend(self._parts.get(root, {}).values())
+        return seen
 
     def mark_shared_out(self, c: Region) -> None:
         """*c* may be held by something outside while this function holds it."""
@@ -380,9 +402,16 @@ class _Regions:
         """*c* is handed to the caller by a ``return``."""
         self._spread(self._returned, c)
 
+    def mark_callee_written(self, c: Region) -> None:
+        """*c* is handed to a callee that may store into it."""
+        self._spread(self._callee_written, c)
+
     def is_shared_out(self, c: Region) -> bool:
         return self.find(c) in self._shared_out
 
+    def is_callee_written(self, c: Region) -> bool:
+        return self.find(c) in self._callee_written
+
     def is_returned(self, c: Region) -> bool:
         return self.find(c) in self._returned
 
@@ -453,6 +482,14 @@ class AliasAnalysis:
         """The region *depth* list levels inside *region*."""
         return self._walk(region, depth)
 
+    def parts(self, region: Region) -> dict[_PartKey, Region]:
+        """*region*'s parts by key: its elements (:data:`ELTS`) or field *i*."""
+        return self._regions.parts(region)
+
+    def within(self, region: Region) -> frozenset[Region]:
+        """*region* and every region it holds, through elements and fields."""
+        return frozenset(self._regions.within(region))
+
     def region_field(self, region: Region | None, i: int) -> Region | None:
         """The region held by field *i* of *region*'s tuple."""
         if region is None:
@@ -509,9 +546,13 @@ class AliasAnalysis:
 
     def escapes_at(self, region: Region) -> bool:
         """Whether *region* is held by something outside while this function
-        still holds it — handed to a call, or to an unmodelled operation."""
+        still holds it — kept by a call, or handed to an unmodelled operation."""
         return self._regions.is_shared_out(region)
 
+    def callee_writes_at(self, region: Region) -> bool:
+        """Whether a callee *region* is handed to may store into it."""
+        return self._regions.is_callee_written(region)
+
     def returned_at(self, region: Region) -> bool:
         """Whether *region* is handed to the caller by a ``return``."""
         return self._regions.is_returned(region)
@@ -537,7 +578,7 @@ class AliasAnalysis:
 
     def escapes(self, site: AllocSite) -> bool:
         """Whether *site*, or a container holding it, leaves the function at all
-        — handed to a call, or returned.
+        — kept by a call, or returned.
 
         Says nothing about *which*; :meth:`transfers_ownership` separates them.
         """
@@ -591,11 +632,31 @@ class AliasAnalysis:
             return False
         return self._regions.find(ca) is self._regions.find(cb)
 
+    def may_write(self, region: Region) -> bool:
+        """Whether this function may store into *region*, or into a list it
+        holds, itself or through a call it hands one to."""
+        return any(
+            r in self.written_regions or r in self.stored_regions
+            or self.escapes_at(r) or self.callee_writes_at(r)
+            for r in self.within(region)
+        )
+
+    def param_regions(self, func: FuncDef, def_use: DefineUseAnalysis) -> dict[int, Region]:
+        """The region of each of *func*'s list parameters, by position."""
+        out: dict[int, Region] = {}
+        for i, arg in enumerate(func.args):
+            if isinstance(arg.name, NamedId):
+                r = self.region_of(def_use.find_def_from_site(arg.name, arg))
+                if r is not None:
+                    out[i] = r
+        return out
+
     def may_change(self, d: Definition) -> bool:
         """Whether the list *d* names may have an element replaced, through
         any name here or by a call it is handed to."""
         r = self.region_of(d)
-        return r is None or r in self.stored_regions or self.escapes_at(r)
+        return (r is None or r in self.stored_regions
+                or self.escapes_at(r) or self.callee_writes_at(r))
 
 
 class _EscapeVars(DefaultVisitor):
@@ -628,11 +689,13 @@ class _Builder(DefaultVisitor):
 
     def __init__(self, func: FuncDef, def_use: DefineUseAnalysis,
                  type_info: TypeAnalysis,
-                 summaries: 'dict[FuncDef, EscapeSummary]'):
+                 summaries: 'dict[FuncDef, EscapeSummary]',
+                 linked: frozenset[tuple[int, int]]):
         self.func = func
         self.def_use = def_use
         self.types = type_info
         self.summaries = summaries
+        self.linked = linked
         self.regions = _Regions()
         self.sites: list[AllocSite] = []
         self.by_def: dict[Definition, Region] = {}
@@ -721,13 +784,28 @@ class _Builder(DefaultVisitor):
                 self.regions.merge(self._reg(d), self._reg(self.def_use.defs[i]))
 
     def _seed_params(self) -> None:
-        for arg in self.func.args:
+        params: dict[int, tuple[Region, Type | None]] = {}
+        for i, arg in enumerate(self.func.args):
             if not isinstance(arg.name, NamedId):
                 continue
             d = self.def_use.find_def_from_site(arg.name, arg)
             ty = self.types.by_def.get(d)
             if _carries_list(ty):
                 self._seed(self._reg(d), ty, arg, 0)
+                params[i] = (self._reg(d), ty)
+        for i, j in self.linked:
+            if i in params and j in params:
+                self._merge_by_shape(*params[i], *params[j])
+
+    def _merge_by_shape(
+        self, a: Region, a_ty: Type | None, b: Region, b_ty: Type | None,
+    ) -> None:
+        """Merge each list in *a* with each list in *b* of the same shape."""
+        theirs = list(self._lists_in(b, b_ty))
+        for r, ty in list(self._lists_in(a, a_ty)):
+            for q, qty in theirs:
+                if _shape(ty) == _shape(qty):
+                    self.regions.merge(r, q)
 
     def _seed(self, region: Region, ty: Type | None, arg: Argument,
               depth: int) -> None:
@@ -738,6 +816,8 @@ class _Builder(DefaultVisitor):
                 self._site('param', arg, region, depth)
                 if _carries_list(ty.elt):
                     self._seed(self._part(region), ty.elt, arg, depth + 1)
+            case VarType():
+                self._site('param', arg, region, depth)
             case TupleType():
                 for i, elt in enumerate(ty.elts):
                     if _carries_list(elt):
@@ -823,9 +903,8 @@ class _Builder(DefaultVisitor):
                         )
                 return region
             case Call():
-                region = self._alloc('call', e, deep=True)
-                self._escape_args(e)
-                return region
+                # linked to what the callee keeps by `_visit_call`
+                return self._alloc('call', e, deep=True)
             case Range1() | Range2() | Range3() | Empty():
                 # A fresh sequence over *integer* arguments: there is nothing
                 # list-shaped for it to retain, so unlike the catch-all below it
@@ -874,23 +953,32 @@ class _Builder(DefaultVisitor):
                 for i, elt in enumerate(target.elts):
                     self._bind(elt, self._part(region, i), site)
 
-    def _escape_args(self, e: Call) -> None:
-        """A list handed to a call may be kept by the callee.
+    def _summary(self, e: Call) -> 'EscapeSummary | None':
+        """The callee's summary, computed when not given; ``None`` for a foreign
+        function or one that does not type on its own, which means the
+        conservative answer."""
+        if not isinstance(e.fn, Function):
+            return None
+        fd = e.fn.ast
+        if fd not in self.summaries:
+            from .escape import Escape
+            try:
+                self.summaries[fd] = Escape.analyze(fd, self.summaries)
+            except TypeInferError:
+                return None
+        return self.summaries[fd]
 
-        Unless its summary says otherwise: a callee that only reads or writes
-        its argument holds nothing once it returns, so the caller's list is no
-        more shared than before the call.  No summary — a foreign function, or
-        one not yet analyzed — means the conservative answer.
-        """
-        summary = None
-        if isinstance(e.fn, Function):
-            summary = self.summaries.get(e.fn.ast)
-        for i, a in enumerate(e.args):
-            ac = self._region_for(a)
-            if ac is None:
-                continue
-            if summary is None or summary.retains(i):
-                self.regions.mark_shared_out(ac)
+    def _lists_in(self, region: Region, ty: Type | None) -> Iterator[tuple[Region, Type]]:
+        """Every list *region* holds, itself included, with its type."""
+        match ty:
+            case ListType():
+                yield region, ty
+                if _carries_list(ty.elt):
+                    yield from self._lists_in(self._part(region), ty.elt)
+            case TupleType():
+                for i, elt in enumerate(ty.elts):
+                    if _carries_list(elt):
+                        yield from self._lists_in(self._part(region, i), elt)
 
     # -- constraint-generating hooks ---------------------------------------
     #
@@ -904,9 +992,23 @@ class _Builder(DefaultVisitor):
         return super()._visit_expr(e, ctx)
 
     def _visit_call(self, e: Call, ctx):
-        """A list handed to a call escapes: whether the callee retains it is not
-        decidable here."""
-        self._escape_args(e)
+        """An argument the callee may write is marked so; one it may keep is
+        shared outward and joins each same-shaped list in the result or in a
+        written argument."""
+        summary = self._summary(e)
+        written = [a for i, a in enumerate(e.args) if summary is None or summary.writes(i)]
+        retained = [a for i, a in enumerate(e.args) if summary is None or summary.retains(i)]
+        reach = [(x, xc) for x in (e, *written) if (xc := self._region_for(x)) is not None]
+        for x, xc in reach:
+            if x is not e:
+                self.regions.mark_callee_written(xc)
+        for a in retained:
+            if (ac := self._region_for(a)) is None:
+                continue
+            self.regions.mark_shared_out(ac)
+            for x, xc in reach:
+                self._merge_by_shape(
+                    ac, self.types.by_expr.get(a), xc, self.types.by_expr.get(x))
         super()._visit_call(e, ctx)
 
     def _visit_assign(self, stmt: Assign, ctx):
@@ -1170,6 +1272,7 @@ class Alias:
         def_use: DefineUseAnalysis | None = None,
         type_info: TypeAnalysis | None = None,
         summaries: 'dict[FuncDef, EscapeSummary] | None' = None,
+        linked: frozenset[tuple[int, int]] = frozenset(),
     ) -> AliasAnalysis:
         """Compute what may refer to each list in *func*.
 
@@ -1179,8 +1282,11 @@ class Alias:
             type_info: reuse an existing type analysis (needed to tell which
                 expressions carry lists).
             summaries: escape summaries for the callees, so an argument a callee
-                does not retain is not treated as shared.  A callee absent from
-                it is assumed to retain everything.
+                does not retain is not treated as shared.  A memo: one absent
+                from it is computed and added.  A foreign callee, or one that
+                does not type on its own, is assumed to retain everything.
+            linked: pairs of parameters a caller may pass one list to, at any
+                depth; their same-shaped lists share regions.
         """
         if not isinstance(func, FuncDef):
             raise TypeError(f"expected a 'FuncDef', got {func}")
@@ -1188,4 +1294,5 @@ class Alias:
             def_use = DefineUse.analyze(func)
         if type_info is None:
             type_info = TypeInfer.check(func, def_use=def_use)
-        return _Builder(func, def_use, type_info, summaries or {}).run()
+        summaries = {} if summaries is None else summaries
+        return _Builder(func, def_use, type_info, summaries, linked).run()

{fpy2-0.2.4 → fpy2-0.3.0}/fpy2/analysis/digit_bound/__init__.py

@@ -2,7 +2,7 @@
 
 Answers one question -- how many binades separate a value from the position it
 is rounded at -- which is the precision of the resulting fixed-point value.
-See ``docs/todos/digit-bound-inference.md``.
+See ``docs/todos/digit-bound.md``.
 
 :mod:`solver` is the constraint language and its backend, :mod:`store` the
 domain and its queries, and :mod:`infer` the pass over a program.