|
| 1 | +/* |
| 2 | + * Licensed to the Apache Software Foundation (ASF) under one or more |
| 3 | + * contributor license agreements. See the NOTICE file distributed with |
| 4 | + * this work for additional information regarding copyright ownership. |
| 5 | + * The ASF licenses this file to You under the Apache License, Version 2.0 |
| 6 | + * (the "License"); you may not use this file except in compliance with |
| 7 | + * the License. You may obtain a copy of the License at |
| 8 | + * |
| 9 | + * http://www.apache.org/licenses/LICENSE-2.0 |
| 10 | + * |
| 11 | + * Unless required by applicable law or agreed to in writing, software |
| 12 | + * distributed under the License is distributed on an "AS IS" BASIS, |
| 13 | + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 14 | + * See the License for the specific language governing permissions and |
| 15 | + * limitations under the License. |
| 16 | + */ |
| 17 | +package org.apache.gluten.expression |
| 18 | + |
| 19 | +import org.apache.gluten.config.GlutenConfig |
| 20 | +import org.apache.gluten.substrait.expression.{ExpressionBuilder, ExpressionNode} |
| 21 | + |
| 22 | +import org.apache.spark.internal.Logging |
| 23 | +import org.apache.spark.sql.catalyst.expressions._ |
| 24 | +import org.apache.spark.sql.types.DataType |
| 25 | + |
| 26 | +import java.util |
| 27 | + |
| 28 | +/** |
| 29 | + * Collapse nested expressions for optimization, to reduce expression calls. Now support `and`, |
| 30 | + * `or`. e.g. select ... and(and(a=1, b=2), c=3) => select ... and(a=1, b=2, c=3). |
| 31 | + */ |
| 32 | +case class CHCollapseNestedExpressionsTransformer( |
| 33 | + substraitExprName: String, |
| 34 | + children: Seq[ExpressionTransformer], |
| 35 | + original: Expression) |
| 36 | + extends ExpressionTransformer |
| 37 | + with Logging { |
| 38 | + |
| 39 | + override def doTransform(args: Object): ExpressionNode = { |
| 40 | + if (canBeOptimized(original)) { |
| 41 | + val functionMap = args.asInstanceOf[util.HashMap[String, java.lang.Long]] |
| 42 | + val newExprNode = doTransform(original, children, functionMap) |
| 43 | + logDebug("The new expression node: " + newExprNode.toProtobuf) |
| 44 | + newExprNode |
| 45 | + } else { |
| 46 | + super.doTransform(args) |
| 47 | + } |
| 48 | + } |
| 49 | + |
| 50 | + def getExpressionName(expr: Expression): Option[String] = expr match { |
| 51 | + case _: And => ExpressionMappings.expressionsMap.get(classOf[And]) |
| 52 | + case _: Or => ExpressionMappings.expressionsMap.get(classOf[Or]) |
| 53 | + case _ => Option.empty[String] |
| 54 | + } |
| 55 | + |
| 56 | + private def canBeOptimized(expr: Expression): Boolean = { |
| 57 | + var exprCall = expr |
| 58 | + expr match { |
| 59 | + case a: Alias => exprCall = a.child |
| 60 | + case _ => |
| 61 | + } |
| 62 | + val exprName = getExpressionName(exprCall) |
| 63 | + exprName match { |
| 64 | + case None => |
| 65 | + exprCall match { |
| 66 | + case _: LeafExpression => false |
| 67 | + case _ => exprCall.children.exists(c => canBeOptimized(c)) |
| 68 | + } |
| 69 | + case Some(f) => |
| 70 | + GlutenConfig.get.getSupportedCollapsedExpressions.split(",").exists(c => c.equals(f)) |
| 71 | + } |
| 72 | + } |
| 73 | + |
| 74 | + private def doTransform0( |
| 75 | + expr: Expression, |
| 76 | + dataType: DataType, |
| 77 | + childNodes: Seq[ExpressionNode], |
| 78 | + childTypes: Seq[DataType], |
| 79 | + functionMap: util.Map[String, java.lang.Long]): ExpressionNode = { |
| 80 | + val funcName: String = ConverterUtils.makeFuncName(substraitExprName, childTypes) |
| 81 | + val functionId = ExpressionBuilder.newScalarFunction(functionMap, funcName) |
| 82 | + val childNodeList = new util.ArrayList[ExpressionNode]() |
| 83 | + childNodes.foreach(c => childNodeList.add(c)) |
| 84 | + val typeNode = ConverterUtils.getTypeNode(dataType, expr.nullable) |
| 85 | + ExpressionBuilder.makeScalarFunction(functionId, childNodeList, typeNode) |
| 86 | + } |
| 87 | + |
| 88 | + private def doTransform( |
| 89 | + expr: Expression, |
| 90 | + transformers: Seq[ExpressionTransformer], |
| 91 | + functionMap: util.Map[String, java.lang.Long]): ExpressionNode = { |
| 92 | + |
| 93 | + var dataType = null.asInstanceOf[DataType] |
| 94 | + var children = Seq.empty[ExpressionNode] |
| 95 | + var childTypes = Seq.empty[DataType] |
| 96 | + |
| 97 | + def f( |
| 98 | + e: Expression, |
| 99 | + ts: ExpressionTransformer = null, |
| 100 | + parent: Option[Expression] = Option.empty): Unit = { |
| 101 | + parent match { |
| 102 | + case None => |
| 103 | + dataType = e.dataType |
| 104 | + e match { |
| 105 | + case a: And if canBeOptimized(a) => |
| 106 | + f(a.left, transformers.head, Option.apply(a)) |
| 107 | + f(a.right, transformers(1), Option.apply(a)) |
| 108 | + case o: Or if canBeOptimized(o) => |
| 109 | + f(o.left, transformers.head, Option.apply(o)) |
| 110 | + f(o.right, transformers(1), Option.apply(o)) |
| 111 | + case _ => |
| 112 | + } |
| 113 | + case Some(_: And) => |
| 114 | + e match { |
| 115 | + case a: And if canBeOptimized(a) => |
| 116 | + val childTransformers = ts.children |
| 117 | + f(a.left, childTransformers.head, Option.apply(a)) |
| 118 | + f(a.right, childTransformers(1), Option.apply(a)) |
| 119 | + case _ => |
| 120 | + children +:= ts.doTransform(functionMap) |
| 121 | + childTypes +:= e.dataType |
| 122 | + } |
| 123 | + case Some(_: Or) => |
| 124 | + e match { |
| 125 | + case o: Or if canBeOptimized(o) => |
| 126 | + val childTransformers = ts.children |
| 127 | + f(o.left, childTransformers.head, Option.apply(o)) |
| 128 | + f(o.right, childTransformers(1), Option.apply(o)) |
| 129 | + case _ => |
| 130 | + children +:= ts.doTransform(functionMap) |
| 131 | + childTypes +:= e.dataType |
| 132 | + } |
| 133 | + case _ => |
| 134 | + } |
| 135 | + } |
| 136 | + f(expr) |
| 137 | + doTransform0(expr, dataType, children, childTypes, functionMap) |
| 138 | + } |
| 139 | +} |
0 commit comments