Reverting MAPREDUCE-4371 to address test failures.

git-svn-id: https://svn.apache.org/repos/asf/hadoop/common/trunk@1355382 13f79535-47bb-0310-9956-ffa450edef68

Author: revans2

hadoop-mapreduce-project/CHANGES.txt

@@ -123,9 +123,6 @@ Trunk (unreleased changes)
 
     MAPREDUCE-3868. Make Raid Compile. (Weiyan Wang via schen)
 
-    MAPREDUCE-4371. Check for cyclic dependencies in Jobcontrol job DAG
-    (madhukara phatak via bobby)
-
 Branch-2 ( Unreleased changes )
 
   INCOMPATIBLE CHANGES

hadoop-mapreduce-project/hadoop-mapreduce-client/hadoop-mapreduce-client-core/src/main/java/org/apache/hadoop/mapreduce/lib/jobcontrol/JobControl.java

@@ -24,8 +24,6 @@
 import java.util.Iterator;
 import java.util.LinkedList;
 import java.util.List;
-import java.util.HashMap;
-import java.util.HashSet;
 
 import org.apache.commons.logging.Log;
 import org.apache.commons.logging.LogFactory;
@@ -217,10 +215,6 @@ public void run() {
         }
 
         synchronized(this) {
-          if (isCircular(jobsInProgress)) {
-	    throw new IllegalArgumentException(
-		"job control has circular dependency");
-	  }
           Iterator<ControlledJob> it = jobsInProgress.iterator();
           while(it.hasNext()) {
             ControlledJob j = it.next();
@@ -287,64 +281,4 @@ synchronized private void failAllJobs(Throwable t) {
       }
     }
   }
-
- /**
-   * Uses topological sorting algorithm for finding circular dependency
-   */
-  private boolean isCircular(final List<ControlledJob> jobList) {
-    boolean cyclePresent = false;
-    HashSet<ControlledJob> SourceSet = new HashSet<ControlledJob>();
-    HashMap<ControlledJob, List<ControlledJob>> processedMap =
-	new HashMap<ControlledJob, List<ControlledJob>>();
-    for (ControlledJob n : jobList) {
-      processedMap.put(n, new ArrayList<ControlledJob>());
-    }
-    for (ControlledJob n : jobList) {
-      if (!hasInComingEdge(n, jobList, processedMap)) {
-	SourceSet.add(n);
-      }
-    }
-    while (!SourceSet.isEmpty()) {
-      ControlledJob controlledJob = SourceSet.iterator().next();
-      SourceSet.remove(controlledJob);
-      if (controlledJob.getDependentJobs() != null) {
-	for (int i = 0; i < controlledJob.getDependentJobs().size(); i++) {
-	  ControlledJob depenControlledJob =
-	      controlledJob.getDependentJobs().get(i);
-	  processedMap.get(controlledJob).add(depenControlledJob);
-	  if (!hasInComingEdge(controlledJob, jobList, processedMap)) {
-	    SourceSet.add(depenControlledJob);
-	  }
-	}
-      }
-    }
-
-    for (ControlledJob controlledJob : jobList) {
-      if (controlledJob.getDependentJobs() != null
-	  && controlledJob.getDependentJobs().size() != processedMap.get(
-	      controlledJob).size()) {
-	cyclePresent = true;
-	LOG.error("Job control has circular dependency for the  job "
-	    + controlledJob.getJobName());
-	break;
-      }
-    }
-    return cyclePresent;
-  }
-
-  private boolean hasInComingEdge(ControlledJob controlledJob,
-      List<ControlledJob> controlledJobList,
-      HashMap<ControlledJob, List<ControlledJob>> processedMap) {
-    boolean hasIncomingEdge = false;
-    for (ControlledJob k : controlledJobList) {
-      if (k != controlledJob && k.getDependentJobs() != null
-	  && !processedMap.get(k).contains(controlledJob)
-	  && k.getDependentJobs().contains(controlledJob)) {
-	hasIncomingEdge = true;
-	break;
-      }
-    }
-    return hasIncomingEdge;
-
-  }
 }