All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.apache.flink.optimizer.plan.SinkJoinerPlanNode Maven / Gradle / Ivy

/*
 * 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.optimizer.plan;

import org.apache.flink.optimizer.CompilerException;
import org.apache.flink.optimizer.costs.Costs;
import org.apache.flink.optimizer.dag.SinkJoiner;
import org.apache.flink.runtime.operators.DriverStrategy;

import java.util.List;

/** */
public class SinkJoinerPlanNode extends DualInputPlanNode {

    public SinkJoinerPlanNode(SinkJoiner template, Channel input1, Channel input2) {
        super(template, "", input1, input2, DriverStrategy.BINARY_NO_OP);
    }

    // --------------------------------------------------------------------------------------------

    public void setCosts(Costs nodeCosts) {
        // the plan enumeration logic works as for regular two-input-operators, which is important
        // because of the branch handling logic. it does pick redistributing network channels
        // between the sink and the sink joiner, because sinks joiner has a different parallelism
        // than the sink.
        // we discard any cost and simply use the sum of the costs from the two children.

        Costs totalCosts = getInput1().getSource().getCumulativeCosts().clone();
        totalCosts.addCosts(getInput2().getSource().getCumulativeCosts());
        super.setCosts(totalCosts);
    }

    // --------------------------------------------------------------------------------------------

    public void getDataSinks(List sinks) {
        final PlanNode in1 = this.input1.getSource();
        final PlanNode in2 = this.input2.getSource();

        if (in1 instanceof SinkPlanNode) {
            sinks.add((SinkPlanNode) in1);
        } else if (in1 instanceof SinkJoinerPlanNode) {
            ((SinkJoinerPlanNode) in1).getDataSinks(sinks);
        } else {
            throw new CompilerException(
                    "Illegal child node for a sink joiner utility node: Neither Sink nor Sink Joiner");
        }

        if (in2 instanceof SinkPlanNode) {
            sinks.add((SinkPlanNode) in2);
        } else if (in2 instanceof SinkJoinerPlanNode) {
            ((SinkJoinerPlanNode) in2).getDataSinks(sinks);
        } else {
            throw new CompilerException(
                    "Illegal child node for a sink joiner utility node: Neither Sink nor Sink Joiner");
        }
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy