---

LockOrder.java

package gov.nasa.arc.ase.jpf.jvm.runtime;

import javax.swing.tree.*; 
import java.util.*;
import gov.nasa.arc.ase.jpf.*;
import gov.nasa.arc.ase.jpf.jvm.*;
import gov.nasa.arc.ase.util.Debug;

public class LockOrder{
//#endif RACE
  public static void analyze(LockNode masterNode,LockTree slaveTree){
    analyzeThis(masterNode,slaveTree);
    Enumeration children = masterNode.children();
    LockNode child;
    while (children.hasMoreElements()){
      child = (LockNode)children.nextElement();
      analyze(child,slaveTree);
    };
    slaveTree.unMark(masterNode.getLockNodeInfo().getLock());
  }  
  public static void analyze(LockTree masterTree, LockTree slaveTree){
    LockNode root = masterTree.getRoot();
    Enumeration topNodes = root.children();
    LockNode topNode;
    while (topNodes.hasMoreElements()){
      topNode = (LockNode)topNodes.nextElement();
      analyze(topNode,slaveTree);
    }
  }  
  public static void analyze(VirtualMachine vm){
    KernelState ks = (KernelState)vm.getKernelState();
    printStart(ks);
    int nthreads = ks.getThreadCount();
    for (int master = 0;master < nthreads - 1;master++){
      for (int slave = master+1;slave < nthreads;slave++){
    analyze(ks.getThreadLockTree(master), ks.getThreadLockTree(slave));
      }
    }
    printStatus();
  }  
  public static void analyzeThis(LockNode masterNode,LockTree slaveTree){ 
    Lock lock = masterNode.getLockNodeInfo().getLock();
    Iterator slaveNodes = slaveTree.getLockMap().getIterator(lock);
    LockNode slaveNode;
    while (slaveNodes.hasNext()){
      slaveNode = (LockNode)slaveNodes.next();
      if (!slaveNode.isBelowMark()){
    HashSet pathSet = slaveNode.setAbove();
    analyzeThis(masterNode,pathSet,slaveNode);
    slaveNode.getLockNodeInfo().mark();
      }
    }   
  }  
  public static void analyzeThis(LockNode masterNode,HashSet setAbove,LockNode slaveNode){
    Lock thisLock = masterNode.getLockNodeInfo().getLock();
    if (setAbove.contains(thisLock)){
      Runner.lock_conflicts++;
      printConflict(masterNode,slaveNode);
      RaceWindow.addRace(masterNode,slaveNode);
    } else{
      Enumeration children = masterNode.children();
      LockNode child;
      while (children.hasMoreElements()){
    child = (LockNode)children.nextElement();
    analyzeThis(child,setAbove,slaveNode);
      };
    }   
  }  
  public static void debug_info(String msg){
// ifdef DEBUG_LOCK_ORDER

//#endif DEBUG_LOCK_ORDER
  }  
  public static boolean debug_on(){
    return Debug.getDebugLevel(Debug.LOCK_ORDER) > 0;
  }  
// ifdef RACE
  public static boolean on(){  
    return VirtualMachine.options.lock_order;
  }  
  public static void print(String msg){
    Debug.print(Debug.WARNING,msg);
  }  
  private static void printConflict(LockNode masterNode,LockNode slaveNode){
    println("");
    println("");
    println("******************************");
    println("Lock order conflict!");
    println("------------------------------");
    print("Locks on ");
    masterNode.getLockNodeInfo().getLock().print();
    print(" and ");
    slaveNode.getLockNodeInfo().getLock().print();
    println("");
    println("are taken in opposite order.");
    println("******************************");
    println("");
    println("=============================");
    println(" *** Access description: *** ");
    println("=============================");
    println("");
    masterNode.print();
    slaveNode.print();
    println("==============================");
  }  
  public static void println(String msg){
    Debug.println(Debug.WARNING,msg);
  }  
  private static void printStart(KernelState ks){
    println("");
    println("LOCK ORDER ANALYSIS STARTS!");
    println("");
    if (debug_on()) printTrees(ks);
  }  
  private static void printStatus(){
    println("");
    if (Runner.lock_conflicts == 0)
      println("No lock order conflicts!");
    else
      println("*** Total number of lock order conflicts : " + Runner.lock_conflicts);
  }  
  private static void printTrees(KernelState ks){
    println("======================");
    println("Listing of Lock Trees:");
    println("======================");
    int nthreads = ks.getThreadCount();
    for (int threadnr = 0;threadnr < nthreads;threadnr++) {
      ks.getThreadLockTree(threadnr).print();
    }
  }  
}

---