Package eu.stratosphere.pact.compiler

Source Code of eu.stratosphere.pact.compiler.CompilerTestBase$OperatorResolver

/***********************************************************************************************************************
* Copyright (C) 2010-2013 by the Stratosphere project (http://stratosphere.eu)
*
* Licensed 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 eu.stratosphere.pact.compiler;

import java.net.InetSocketAddress;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;

import org.junit.Before;
import org.junit.BeforeClass;

import eu.stratosphere.api.common.Plan;
import eu.stratosphere.api.common.functions.Function;
import eu.stratosphere.api.common.io.FileInputFormat.FileBaseStatistics;
import eu.stratosphere.api.common.operators.Operator;
import eu.stratosphere.api.common.operators.base.GenericDataSourceBase;
import eu.stratosphere.api.java.record.operators.BulkIteration;
import eu.stratosphere.api.java.record.operators.DeltaIteration;
import eu.stratosphere.compiler.DataStatistics;
import eu.stratosphere.compiler.PactCompiler;
import eu.stratosphere.compiler.costs.DefaultCostEstimator;
import eu.stratosphere.compiler.plan.OptimizedPlan;
import eu.stratosphere.compiler.plan.PlanNode;
import eu.stratosphere.compiler.plan.SingleInputPlanNode;
import eu.stratosphere.nephele.instance.HardwareDescription;
import eu.stratosphere.nephele.instance.HardwareDescriptionFactory;
import eu.stratosphere.nephele.instance.InstanceType;
import eu.stratosphere.nephele.instance.InstanceTypeDescription;
import eu.stratosphere.nephele.instance.InstanceTypeDescriptionFactory;
import eu.stratosphere.nephele.instance.InstanceTypeFactory;
import eu.stratosphere.util.LogUtils;
import eu.stratosphere.util.OperatingSystem;
import eu.stratosphere.util.Visitor;

/**
*
*/
public abstract class CompilerTestBase implements java.io.Serializable {
 
  private static final long serialVersionUID = 1L;

  protected static final String IN_FILE = OperatingSystem.isWindows() ? "file:/c:/" : "file:///dev/random";
 
  protected static final String OUT_FILE = OperatingSystem.isWindows() ? "file:/c:/" : "file:///dev/null";
 
  protected static final int DEFAULT_PARALLELISM = 8;
 
  protected static final String DEFAULT_PARALLELISM_STRING = String.valueOf(DEFAULT_PARALLELISM);
 
  private static final String CACHE_KEY = "cachekey";
 
  // ------------------------------------------------------------------------
 
  protected transient DataStatistics dataStats;
 
  protected transient PactCompiler withStatsCompiler;
 
  protected transient PactCompiler noStatsCompiler;
 
  protected transient InstanceTypeDescription instanceType;
 
  private transient int statCounter;
 
  // ------------------------------------------------------------------------ 
 
  @BeforeClass
  public static void initialize() {
    LogUtils.initializeDefaultTestConsoleLogger();
  }
 
  @Before
  public void setup() {
    InetSocketAddress dummyAddr = new InetSocketAddress("localhost", 12345);
   
    this.dataStats = new DataStatistics();
    this.withStatsCompiler = new PactCompiler(this.dataStats, new DefaultCostEstimator(), dummyAddr);
    this.withStatsCompiler.setDefaultDegreeOfParallelism(DEFAULT_PARALLELISM);
   
    this.noStatsCompiler = new PactCompiler(null, new DefaultCostEstimator(), dummyAddr);
    this.noStatsCompiler.setDefaultDegreeOfParallelism(DEFAULT_PARALLELISM);
   
    // create the instance type description
    InstanceType iType = InstanceTypeFactory.construct("standard", 6, 2, 4096, 100, 0);
    HardwareDescription hDesc = HardwareDescriptionFactory.construct(2, 4096 * 1024 * 1024, 2000 * 1024 * 1024);
    this.instanceType = InstanceTypeDescriptionFactory.construct(iType, hDesc, DEFAULT_PARALLELISM * 2);
  }
 
  // ------------------------------------------------------------------------
 
  public OptimizedPlan compileWithStats(Plan p) {
    return this.withStatsCompiler.compile(p, this.instanceType);
  }
 
  public OptimizedPlan compileNoStats(Plan p) {
    return this.noStatsCompiler.compile(p, this.instanceType);
  }
 
  public void setSourceStatistics(GenericDataSourceBase<?, ?> source, long size, float recordWidth) {
    setSourceStatistics(source, new FileBaseStatistics(Long.MAX_VALUE, size, recordWidth));
  }
 
  public void setSourceStatistics(GenericDataSourceBase<?, ?> source, FileBaseStatistics stats) {
    final String key = CACHE_KEY + this.statCounter++;
    this.dataStats.cacheBaseStatistics(stats, key);
    source.setStatisticsKey(key);
  }
 
  // ------------------------------------------------------------------------
  public static OperatorResolver getContractResolver(Plan plan) {
    return new OperatorResolver(plan);
  }
 
  public static OptimizerPlanNodeResolver getOptimizerPlanNodeResolver(OptimizedPlan plan) {
    return new OptimizerPlanNodeResolver(plan);
  }
 
  // ------------------------------------------------------------------------
 
  public static final class OptimizerPlanNodeResolver {
   
    private final Map<String, ArrayList<PlanNode>> map;
   
    OptimizerPlanNodeResolver(OptimizedPlan p) {
      HashMap<String, ArrayList<PlanNode>> map = new HashMap<String, ArrayList<PlanNode>>();
     
      for (PlanNode n : p.getAllNodes()) {
        Operator<?> c = n.getOriginalOptimizerNode().getPactContract();
        String name = c.getName();
       
        ArrayList<PlanNode> list = map.get(name);
        if (list == null) {
          list = new ArrayList<PlanNode>(2);
          map.put(name, list);
        }
       
        // check whether this node is a child of a node with the same contract (aka combiner)
        boolean shouldAdd = true;
        for (Iterator<PlanNode> iter = list.iterator(); iter.hasNext();) {
          PlanNode in = iter.next();
          if (in.getOriginalOptimizerNode().getPactContract() == c) {
            // is this the child or is our node the child
            if (in instanceof SingleInputPlanNode && n instanceof SingleInputPlanNode) {
              SingleInputPlanNode thisNode = (SingleInputPlanNode) n;
              SingleInputPlanNode otherNode = (SingleInputPlanNode) in;
             
              if (thisNode.getPredecessor() == otherNode) {
                // other node is child, remove it
                iter.remove();
              } else if (otherNode.getPredecessor() == thisNode) {
                shouldAdd = false;
              }
            } else {
              throw new RuntimeException("Unrecodnized case in test.");
            }
          }
        }
       
        if (shouldAdd) {
          list.add(n);
        }
      }
     
      this.map = map;
    }
   
   
    @SuppressWarnings("unchecked")
    public <T extends PlanNode> T getNode(String name) {
      List<PlanNode> nodes = this.map.get(name);
      if (nodes == null || nodes.isEmpty()) {
        throw new RuntimeException("No node found with the given name.");
      } else if (nodes.size() != 1) {
        throw new RuntimeException("Multiple nodes found with the given name.");
      } else {
        return (T) nodes.get(0);
      }
    }
   
    @SuppressWarnings("unchecked")
    public <T extends PlanNode> T getNode(String name, Class<? extends Function> stubClass) {
      List<PlanNode> nodes = this.map.get(name);
      if (nodes == null || nodes.isEmpty()) {
        throw new RuntimeException("No node found with the given name and stub class.");
      } else {
        PlanNode found = null;
        for (PlanNode node : nodes) {
          if (node.getClass() == stubClass) {
            if (found == null) {
              found = node;
            } else {
              throw new RuntimeException("Multiple nodes found with the given name and stub class.");
            }
          }
        }
        if (found == null) {
          throw new RuntimeException("No node found with the given name and stub class.");
        } else {
          return (T) found;
        }
      }
    }
   
    public List<PlanNode> getNodes(String name) {
      List<PlanNode> nodes = this.map.get(name);
      if (nodes == null || nodes.isEmpty()) {
        throw new RuntimeException("No node found with the given name.");
      } else {
        return new ArrayList<PlanNode>(nodes);
      }
    }
  }
 
  // ------------------------------------------------------------------------
 
  public static final class OperatorResolver implements Visitor<Operator<?>> {
   
    private final Map<String, List<Operator<?>>> map;
    private Set<Operator<?>> seen;
   
    OperatorResolver(Plan p) {
      this.map = new HashMap<String, List<Operator<?>>>();
      this.seen = new HashSet<Operator<?>>();
     
      p.accept(this);
      this.seen = null;
    }
   
   
    @SuppressWarnings("unchecked")
    public <T extends Operator<?>> T getNode(String name) {
      List<Operator<?>> nodes = this.map.get(name);
      if (nodes == null || nodes.isEmpty()) {
        throw new RuntimeException("No nodes found with the given name.");
      } else if (nodes.size() != 1) {
        throw new RuntimeException("Multiple nodes found with the given name.");
      } else {
        return (T) nodes.get(0);
      }
    }
   
    @SuppressWarnings("unchecked")
    public <T extends Operator<?>> T getNode(String name, Class<? extends Function> stubClass) {
      List<Operator<?>> nodes = this.map.get(name);
      if (nodes == null || nodes.isEmpty()) {
        throw new RuntimeException("No node found with the given name and stub class.");
      } else {
        Operator<?> found = null;
        for (Operator<?> node : nodes) {
          if (node.getClass() == stubClass) {
            if (found == null) {
              found = node;
            } else {
              throw new RuntimeException("Multiple nodes found with the given name and stub class.");
            }
          }
        }
        if (found == null) {
          throw new RuntimeException("No node found with the given name and stub class.");
        } else {
          return (T) found;
        }
      }
    }
   
    public List<Operator<?>> getNodes(String name) {
      List<Operator<?>> nodes = this.map.get(name);
      if (nodes == null || nodes.isEmpty()) {
        throw new RuntimeException("No node found with the given name.");
      } else {
        return new ArrayList<Operator<?>>(nodes);
      }
    }

    @Override
    public boolean preVisit(Operator<?> visitable) {
      if (this.seen.add(visitable)) {
        // add to  the map
        final String name = visitable.getName();
        List<Operator<?>> list = this.map.get(name);
        if (list == null) {
          list = new ArrayList<Operator<?>>(2);
          this.map.put(name, list);
        }
        list.add(visitable);
       
        // recurse into bulk iterations
        if (visitable instanceof BulkIteration) {
          ((BulkIteration) visitable).getNextPartialSolution().accept(this);
        } else if (visitable instanceof DeltaIteration) {
          ((DeltaIteration) visitable).getSolutionSetDelta().accept(this);
          ((DeltaIteration) visitable).getNextWorkset().accept(this);
        }
       
        return true;
      } else {
        return false;
      }
    }

    @Override
    public void postVisit(Operator<?> visitable) {}
  }
}
TOP

Related Classes of eu.stratosphere.pact.compiler.CompilerTestBase$OperatorResolver

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.