blob: 5afd0a3da23cd9d72a7c29a6352f8e698b807317 [file] [log] [blame]
/*
* 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.
*/
package org.apache.flink.table.plan.nodes.logical
import org.apache.flink.table.api.{TableConfig, TableConfigOptions}
import org.apache.flink.table.plan.metadata.FlinkRelMetadataQuery
import org.apache.flink.table.plan.nodes.FlinkConventions
import org.apache.flink.table.plan.util.SortUtil
import org.apache.calcite.plan._
import org.apache.calcite.rel.convert.ConverterRule
import org.apache.calcite.rel.core.Sort
import org.apache.calcite.rel.logical.LogicalSort
import org.apache.calcite.rel.metadata.RelMetadataQuery
import org.apache.calcite.rel.{RelCollation, RelCollationTraitDef, RelNode}
import org.apache.calcite.rex.{RexLiteral, RexNode}
import org.apache.calcite.sql.`type`.SqlTypeName
class FlinkLogicalSort(
cluster: RelOptCluster,
traits: RelTraitSet,
child: RelNode,
collation: RelCollation,
sortOffset: RexNode,
sortFetch: RexNode)
extends Sort(cluster, traits, child, collation, sortOffset, sortFetch)
with FlinkLogicalRel {
private val limitStart: Long = if (offset != null) {
RexLiteral.intValue(offset)
} else {
0L
}
override def copy(
traitSet: RelTraitSet,
newInput: RelNode,
newCollation: RelCollation,
offset: RexNode,
fetch: RexNode): Sort = {
new FlinkLogicalSort(cluster, traitSet, newInput, newCollation, offset, fetch)
}
override def estimateRowCount(mq: RelMetadataQuery): Double = {
val inputRowCnt = mq.getRowCount(this.getInput)
if (inputRowCnt == null) {
inputRowCnt
} else {
val rowCount = (inputRowCnt - limitStart).max(1.0)
if (fetch != null) {
val limit = RexLiteral.intValue(fetch)
rowCount.min(limit)
} else {
rowCount
}
}
}
override def computeSelfCost(planner: RelOptPlanner, mq: RelMetadataQuery): RelOptCost = {
// by default, assume cost is proportional to number of rows
val rowCount: Double = mq.getRowCount(this)
planner.getCostFactory.makeCost(rowCount, rowCount, 0)
}
override def isDeterministic: Boolean = SortUtil.isDeterministic(offset, fetch)
}
class FlinkLogicalSortStreamConverter
extends ConverterRule(
classOf[LogicalSort],
Convention.NONE,
FlinkConventions.LOGICAL,
"FlinkLogicalSortStreamConverter") {
override def convert(rel: RelNode): RelNode = {
val sort = rel.asInstanceOf[LogicalSort]
val newInput = RelOptRule.convert(sort.getInput, FlinkConventions.LOGICAL)
FlinkLogicalSort.create(
newInput,
sort.getCollation,
sort.offset,
sort.fetch)
}
}
class FlinkLogicalSortBatchConverter extends ConverterRule(
classOf[LogicalSort],
Convention.NONE,
FlinkConventions.LOGICAL,
"FlinkLogicalSortBatchConverter") {
override def convert(rel: RelNode): RelNode = {
val sort = rel.asInstanceOf[LogicalSort]
val newInput = RelOptRule.convert(sort.getInput, FlinkConventions.LOGICAL)
val conf = sort.getCluster.getPlanner.getContext.unwrap(classOf[TableConfig])
val enableRangeSort = conf.getConf.getBoolean(TableConfigOptions.SQL_EXEC_SORT_RANGE_ENABLED)
val limitValue = conf.getConf.getInteger(TableConfigOptions.SQL_EXEC_SORT_DEFAULT_LIMIT)
val (offset, fetch) = if (sort.fetch == null && sort.offset == null
&& !enableRangeSort && limitValue > 0) {
//force the sort add limit
val typeFactory = rel.getCluster.getTypeFactory
val rexBuilder = rel.getCluster.getRexBuilder
val offset = rexBuilder.makeLiteral(0, typeFactory.createSqlType(SqlTypeName.INTEGER), true)
val limit = rexBuilder.makeLiteral(
limitValue, typeFactory.createSqlType(SqlTypeName.INTEGER), true)
(offset, limit)
} else {
(sort.offset, sort.fetch)
}
FlinkLogicalSort.create(
newInput,
sort.getCollation,
offset,
fetch)
}
}
object FlinkLogicalSort {
val BATCH_CONVERTER: RelOptRule = new FlinkLogicalSortBatchConverter
val STREAM_CONVERTER: RelOptRule = new FlinkLogicalSortStreamConverter
def create(
input: RelNode,
collation: RelCollation,
sortOffset: RexNode,
sortFetch: RexNode): FlinkLogicalSort = {
val cluster = input.getCluster
val collationTrait = RelCollationTraitDef.INSTANCE.canonize(collation)
val traitSet = input.getTraitSet.replace(Convention.NONE).replace(collationTrait)
// FIXME: FlinkRelMdDistribution requires the current RelNode to compute
// the distribution trait, so we have to create FlinkLogicalSort to
// calculate the distribution trait
val sort = new FlinkLogicalSort(
cluster,
traitSet,
input,
collation,
sortOffset,
sortFetch)
val newTraitSet = FlinkRelMetadataQuery.traitSet(sort)
.replace(FlinkConventions.LOGICAL).simplify()
sort.copy(newTraitSet, sort.getInputs).asInstanceOf[FlinkLogicalSort]
}
}