inducer · alexfikl · Dec 5, 2025 · Dec 12, 2025 · Dec 12, 2025 · Dec 12, 2025
diff --git a/.basedpyright/baseline.json b/.basedpyright/baseline.json
diff --git a/doc/conf.py b/doc/conf.py
@@ -62,6 +62,7 @@
     # loopy
     "InameStr": "obj:loopy.typing.InameStr",
     "InameStrSet": "obj:loopy.typing.InameStrSet",
+    "ToInameStrSetConvertible": "obj:loopy.typing.ToInameStrSetConvertible",
     "KernelIname": "obj:loopy.kernel.data.Iname",
     "LoopNestTree": "obj:loopy.schedule.tools.LoopNestTree",
     "LoopTree": "obj:loopy.schedule.tools.LoopTree",

diff --git a/doc/ref_kernel.rst b/doc/ref_kernel.rst
@@ -192,9 +192,9 @@ Values of domain parameters arise from
 Iname Implementation Tags
 ^^^^^^^^^^^^^^^^^^^^^^^^^
 
-=============================== ====================================================
+=============================== ======================================================
 Tag                             Meaning
-=============================== ====================================================
+=============================== ======================================================
 ``None`` | ``"for"``            Sequential loop
 ``"ord"``                       Forced-order sequential loop
 ``"l.N"``                       Local (intra-group) axis N ("local")
@@ -205,8 +205,8 @@ Tag                             Meaning
 ``"ilp"`` | ``"ilp.unr"``       Unroll using instruction-level parallelism
 ``"ilp.seq"``                   Realize parallel iname as innermost loop
 ``"like.INAME"``                Can be used when tagging inames to tag like another
-``"unused.g"`` | ``"unused.l"`` Can be to tag as the next unused group/local axis
-=============================== ====================================================
+``"unused.g"`` | ``"unused.l"`` Can be used to tag as the next unused group/local axis
+=============================== ======================================================
 
 (Throughout this table, `N` must be replaced by an actual, zero-based number.)
 

diff --git a/loopy/isl_helpers.py b/loopy/isl_helpers.py
@@ -1,4 +1,5 @@
 """isl helpers"""
+
 from __future__ import annotations
 
 
@@ -50,13 +51,14 @@
 
     if len(pieces) == 0:
         raise RuntimeError("PwAff does not have any pieces")
+
     if len(pieces) > 1:
         _, first_aff = pieces[0]
         for _, other_aff in pieces[1:]:
             if not first_aff.plain_is_equal(other_aff):
                 raise NotImplementedError("only single-valued piecewise affine "
                         "expressions are supported here--encountered "
-                        "multi-valued expression '%s'" % pw_aff)
+                        f"multi-valued expression '{pw_aff}'")
 
         return first_aff
 
@@ -65,34 +67,24 @@
 
 # {{{ make_slab
 
-def make_slab(space, iname, start, stop, iname_multiplier=1):
+def make_slab(space: isl.Space,
+              iname: str | tuple[dim_type, int],
+              start: isl.Aff | isl.PwAff | ArithmeticExpression,
+              stop: isl.Aff | isl.PwAff | ArithmeticExpression,
+              iname_multiplier: int = 1) -> isl.BasicSet:
     """
     Returns an instance of :class:`islpy._isl.BasicSet`, which satisfies the
     constraint ``start <= iname_multiplier*iname < stop``.
 
     :arg space: An instance of :class:`islpy._isl.Space`.
-
-    :arg iname:
-
-        Either an instance of :class:`str` as a name of the ``iname`` or a
+    :arg iname: Either an instance of :class:`str` as a name of the ``iname`` or a
         tuple of ``(iname_dt, iname_dx)`` indicating the *iname* in the space.
-
-    :arg start:
-
-        An instance of :class:`int`  or an instance of
-        :class:`islpy._isl.Aff` indicating the lower bound of
-        ``iname_multiplier*iname``(inclusive).
-
-    :arg stop:
-
-        An instance of :class:`int`  or an instance of
-        :class:`islpy._isl.Aff` indicating the upper bound of
-        ``iname_multiplier*iname``.
-
-    :arg iname_multiplier:
-
-        A strictly positive :class:`int` denoting *iname*'s coefficient in the
-        above inequality expression.
+    :arg start: An instance of :class:`int`  or an instance of :class:`islpy._isl.Aff`
+        indicating the lower bound of ``iname_multiplier*iname``(inclusive).
+    :arg stop: An instance of :class:`int`  or an instance of :class:`islpy._isl.Aff`
+        indicating the upper bound of ``iname_multiplier*iname``.
+    :arg iname_multiplier: A strictly positive :class:`int` denoting *iname*'s
+        coefficient in the above inequality expression.
     """
     zero = isl.Aff.zero_on_domain(space)
 
@@ -195,7 +187,7 @@
                if i == j:
                    continue

                if aff_i.gist(dom_j).is_equal(aff_j):
                    # aff_i is sufficient to cover aff_j, eliminate aff_j
                    new_pieces = pieces[:]
                    if i < j:
@@ -245,8 +237,8 @@
     if len(pieces) == 1:
         (_, result), = pieces
         if constants_only and not result.is_cst():
-            raise StaticValueFindingError("a numeric %s was not found for PwAff '%s'"
-                    % (what, pw_aff))
+            raise StaticValueFindingError(
+                f"a numeric {what} was not found for PwAff '{pw_aff}'")
         return result
 
     from pytools import flatten, memoize

diff --git a/loopy/kernel/data.py b/loopy/kernel/data.py
@@ -314,7 +314,7 @@ def parse_tag(tag: ToInameTagConvertible) -> Tag | None:
         return tag
 
     if not isinstance(tag, str):
-        raise ValueError("cannot parse tag: %s" % tag)
+        raise ValueError(f"cannot parse tag: {tag!r}")
 
     if tag == "for":
         return None
@@ -342,7 +342,7 @@ def parse_tag(tag: ToInameTagConvertible) -> Tag | None:
         else:
             return LocalInameTag(int(axis))
     else:
-        raise ValueError("cannot parse tag: %s" % tag)
+        raise ValueError(f"cannot parse tag: {tag!r}")
 
 # }}}
 

diff --git a/loopy/match.py b/loopy/match.py
@@ -618,6 +618,7 @@ def parse_stack_match(smatch: ToStackMatchConvertible) -> ConcreteStackMatch:
 
     if isinstance(smatch, ConcreteStackMatch):
         return smatch
+
     if isinstance(smatch, MatchExpressionBase):
         return ConcreteStackMatch(
                 StackItemMatchComponent(