Tianqi Chen
275114b327
## Summary - Make `PrimExpr` a typed C++ view over `Expr` values whose `ExprNode::ty` is `PrimType`, instead of using a separate runtime node class as the proof of primitive-ness. - Use the shared `ir::Call` node for Relax, TIRX, and primitive-valued calls, while keeping primitive-only APIs explicit at their semantic boundaries. - Keep Python on the general `Expr` surface for primitive-typed values so `isinstance` behavior does not imply a nominal primitive-expression subclass. ## Design Rationale The main advantage of this change is that common expression nodes such as `Call` can be unified without specializing each one to `PrimType`. A single `ir::Call` can represent a Relax tensor call, a Relax scalar call, or a primitive-valued intrinsic call; the result type stored in `ExprNode::ty` determines whether that particular value can be viewed as `PrimExpr`. This keeps the IR node hierarchy focused on expression structure rather than result-type categories. Nodes that are intrinsically primitive, such as integer and floating-point literals or TIRX primitive operators, still have strongly typed C++ APIs and data structures. General nodes whose result type may vary, such as `Call`, remain general `Expr` nodes and are narrowed to `PrimExpr` only where primitive-only semantics are required. The PR also keeps the compatibility surface practical: C++ primitive-only APIs continue to accept `PrimExpr`, Python exposes a compatibility predicate for checking the primitive typed category, and visitors/printers use one natural `Call` path rather than duplicating Relax and primitive call handling. Missing expression types are represented explicitly with `Type::Missing()` so constructors can leave type inference to later analysis without relying on nullable `Type` values.
62 lines
1.8 KiB
Python
62 lines
1.8 KiB
Python
# Licensed to the Apache Software Foundation (ASF) under one
|
|
# or more contributor license agreements. See the NOTICE file
|
|
# distributed with this work for additional information
|
|
# regarding copyright ownership. The ASF licenses this file
|
|
# to you 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.
|
|
"""Detect common patterns."""
|
|
|
|
from . import _ffi_api
|
|
|
|
|
|
def detect_linear_equation(expr, var_list):
|
|
"""Match `expr = sum_{i=0}^{n-1} var[i] * coeff[i] + coeff[n]`
|
|
|
|
Where coeff[i] and base are invariant of var[j] for all i and j.
|
|
|
|
Parameters
|
|
----------
|
|
expr : Expr
|
|
The expression to be matched.
|
|
|
|
var_list : List[tvm.tirx.Var]
|
|
A list of variables.
|
|
|
|
Returns
|
|
-------
|
|
coeff : List[Expr]
|
|
A list of co-efficients if the match is successful.
|
|
An empty list if the match failed.
|
|
"""
|
|
return _ffi_api.DetectLinearEquation(expr, var_list)
|
|
|
|
|
|
def detect_clip_bound(expr, var_list):
|
|
"""Detect if expression corresponds to clip bound of the vars
|
|
|
|
Parameters
|
|
----------
|
|
expr : Expr
|
|
The expression to be matched.
|
|
|
|
var_list : List[tvm.tirx.Var]
|
|
A list of variables.
|
|
|
|
Returns
|
|
-------
|
|
coeff : List[Expr]
|
|
`concat([min_value[i], max_value[i]] for i, v in enumerate(var_list))`
|
|
An empty list if the match failed.
|
|
"""
|
|
return _ffi_api.DetectClipBound(expr, var_list)
|