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

org.apache.flink.runtime.io.network.partition.consumer.UnionInputGate Maven / Gradle / Ivy

There is a newer version: 1.3.3
Show newest version
/*
 * 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.runtime.io.network.partition.consumer;

import com.google.common.collect.Maps;
import com.google.common.collect.Sets;
import org.apache.flink.runtime.event.TaskEvent;
import org.apache.flink.runtime.io.network.api.EndOfPartitionEvent;
import org.apache.flink.runtime.util.event.EventListener;

import java.io.IOException;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.CopyOnWriteArrayList;
import java.util.concurrent.LinkedBlockingQueue;

import static org.apache.flink.util.Preconditions.checkArgument;
import static org.apache.flink.util.Preconditions.checkNotNull;

/**
 * Input gate wrapper to union the input from multiple input gates.
 *
 * 

Each input gate has input channels attached from which it reads data. At each input gate, the * input channels have unique IDs from 0 (inclusive) to the number of input channels (exclusive). * *

 * +---+---+      +---+---+---+
 * | 0 | 1 |      | 0 | 1 | 2 |
 * +--------------+--------------+
 * | Input gate 0 | Input gate 1 |
 * +--------------+--------------+
 * 
* * The union input gate maps these IDs from 0 to the *total* number of input channels across all * unioned input gates, e.g. the channels of input gate 0 keep their original indexes and the * channel indexes of input gate 1 are set off by 2 to 2--4. * *
 * +---+---++---+---+---+
 * | 0 | 1 || 2 | 3 | 4 |
 * +--------------------+
 * | Union input gate   |
 * +--------------------+
 * 
* * It is possible to recursively union union input gates. */ public class UnionInputGate implements InputGate { /** The input gates to union. */ private final InputGate[] inputGates; private final Set inputGatesWithRemainingData; /** Data availability listener across all unioned input gates. */ private final InputGateListener inputGateListener; /** The total number of input channels across all unioned input gates. */ private final int totalNumberOfInputChannels; /** * A mapping from input gate to (logical) channel index offset. Valid channel indexes go from 0 * (inclusive) to the total number of input channels (exclusive). */ private final Map inputGateToIndexOffsetMap; /** Flag indicating whether partitions have been requested. */ private boolean requestedPartitionsFlag; public UnionInputGate(InputGate... inputGates) { this.inputGates = checkNotNull(inputGates); checkArgument(inputGates.length > 1, "Union input gate should union at least two input gates."); this.inputGateToIndexOffsetMap = Maps.newHashMapWithExpectedSize(inputGates.length); this.inputGatesWithRemainingData = Sets.newHashSetWithExpectedSize(inputGates.length); int currentNumberOfInputChannels = 0; for (InputGate inputGate : inputGates) { // The offset to use for buffer or event instances received from this input gate. inputGateToIndexOffsetMap.put(checkNotNull(inputGate), currentNumberOfInputChannels); inputGatesWithRemainingData.add(inputGate); currentNumberOfInputChannels += inputGate.getNumberOfInputChannels(); } this.totalNumberOfInputChannels = currentNumberOfInputChannels; this.inputGateListener = new InputGateListener(inputGates, this); } /** * Returns the total number of input channels across all unioned input gates. */ @Override public int getNumberOfInputChannels() { return totalNumberOfInputChannels; } @Override public boolean isFinished() { for (InputGate inputGate : inputGates) { if (!inputGate.isFinished()) { return false; } } return true; } @Override public void requestPartitions() throws IOException, InterruptedException { if (!requestedPartitionsFlag) { for (InputGate inputGate : inputGates) { inputGate.requestPartitions(); } requestedPartitionsFlag = true; } } @Override public BufferOrEvent getNextBufferOrEvent() throws IOException, InterruptedException { if (inputGatesWithRemainingData.isEmpty()) { return null; } // Make sure to request the partitions, if they have not been requested before. requestPartitions(); final InputGate inputGate = inputGateListener.getNextInputGateToReadFrom(); final BufferOrEvent bufferOrEvent = inputGate.getNextBufferOrEvent(); if (bufferOrEvent.isEvent() && bufferOrEvent.getEvent().getClass() == EndOfPartitionEvent.class && inputGate.isFinished()) { if (!inputGatesWithRemainingData.remove(inputGate)) { throw new IllegalStateException("Couldn't find input gate in set of remaining " + "input gates."); } } // Set the channel index to identify the input channel (across all unioned input gates) final int channelIndexOffset = inputGateToIndexOffsetMap.get(inputGate); bufferOrEvent.setChannelIndex(channelIndexOffset + bufferOrEvent.getChannelIndex()); return bufferOrEvent; } @Override public void sendTaskEvent(TaskEvent event) throws IOException { for (InputGate inputGate : inputGates) { inputGate.sendTaskEvent(event); } } @Override public void registerListener(EventListener listener) { // This method is called from the consuming task thread. inputGateListener.registerListener(listener); } @Override public int getPageSize() { int pageSize = -1; for (InputGate gate : inputGates) { if (pageSize == -1) { pageSize = gate.getPageSize(); } else if (gate.getPageSize() != pageSize) { throw new IllegalStateException("Found input gates with different page sizes."); } } return pageSize; } /** * Data availability listener at all unioned input gates. * *

The listener registers itself at each input gate and is notified for *each incoming * buffer* at one of the unioned input gates. */ private static class InputGateListener implements EventListener { private final UnionInputGate unionInputGate; private final BlockingQueue inputGatesWithData = new LinkedBlockingQueue(); private final List> registeredListeners = new CopyOnWriteArrayList>(); public InputGateListener(InputGate[] inputGates, UnionInputGate unionInputGate) { for (InputGate inputGate : inputGates) { inputGate.registerListener(this); } this.unionInputGate = unionInputGate; } @Override public void onEvent(InputGate inputGate) { // This method is called from the input channel thread, which can be either the same // thread as the consuming task thread or a different one. inputGatesWithData.add(inputGate); for (int i = 0; i < registeredListeners.size(); i++) { registeredListeners.get(i).onEvent(unionInputGate); } } InputGate getNextInputGateToReadFrom() throws InterruptedException { return inputGatesWithData.take(); } public void registerListener(EventListener listener) { registeredListeners.add(checkNotNull(listener)); } } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy