1/*
2 * Licensed to the Apache Software Foundation (ASF) under one
3 * or more contributor license agreements. See the NOTICE file
4 * distributed with this work for additional information
5 * regarding copyright ownership. The ASF licenses this file
6 * to you under the Apache License, Version 2.0 (the
7 * "License"); you may not use this file except in compliance
8 * with the License. You may obtain a copy of the License at
9 *
10 * http://www.apache.org/licenses/LICENSE-2.0
11 *
12 * Unless required by applicable law or agreed to in writing,
13 * software distributed under the License is distributed on an
14 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15 * KIND, either express or implied. See the License for the
16 * specific language governing permissions and limitations
17 * under the License.
18 */
19
20/*!
21 * \file tvm/arith/pattern.h
22 * \brief Expression pattern detectors.
23 */
24#ifndef TVM_ARITH_PATTERN_H_
25#define TVM_ARITH_PATTERN_H_
26
27#include <tvm/ir/expr.h>
28#include <tvm/tir/expr.h>
29
30namespace tvm {
31namespace arith {
32/*!
33 * \brief Detect if e can be rewritten as e = sum_{i=0}^{n-1} var[i] * coeff[i] + coeff[n]
34 * Where coeff[i] and base are invariant of var[j] for all i and j.
35 *
36 * \param e The expression to be detected.
37 * \param vars List of variables to be used in detection.
38 * \return [coeff[i]] if it is possible, empty array if it is not.
39 */
40Array<PrimExpr> DetectLinearEquation(const PrimExpr& e, const Array<tir::Var>& vars);
41
42/*!
43 * \brief Detect if expression corresponds to clip bound of the vars
44 *
45 * \param e The expression to be detected.
46 * \param vars List of variables to be used in detection.
47 * \return concat([min_value[i], max_value[i]]), None is returned if there is no min or max value
48 * return empty if the e does not match the pattern.
49 */
50Array<PrimExpr> DetectClipBound(const PrimExpr& e, const Array<tir::Var>& vars);
51
52} // namespace arith
53} // namespace tvm
54#endif // TVM_ARITH_PATTERN_H_
55