Package soot.toolkits.graph

Examples of soot.toolkits.graph.HashMutableEdgeLabelledDirectedGraph.addNode()

314
315
316
317
318
319
320
321
322
323
324
                    DeadlockAvoidanceEdge dae = new DeadlockAvoidanceEdge(tn1.method.getDeclaringClass());
                    EquivalentValue daeEqVal = new EquivalentValue(dae);
                   
                    // Register it as a static lock
                    Integer daeNum = new Integer(-lockPTSets.size()); // negative indicates a static lock
                    permanentOrder.addNode(daeNum);
                    lockToLockNum.put(dae, daeNum);
                    PointsToSetInternal dummyLockPT = new HashPointsToSet(lock1.getType(), (PAG) Scene.v().getPointsToAnalysis());
                    lockPTSets.add(dummyLockPT);

                    // Add it to the locksets of tn1 and whoever says l2 before l1
View Full Code Here
324
325
326
327
328
329
330
331
332
333
334
                    // Add it to the locksets of tn1 and whoever says l2 before l1
                    for(EquivalentValue lockEqVal : tn1.lockset)
                    {
                      Integer lockNum = lockToLockNum.get(lockEqVal.getValue());
                      if(!permanentOrder.containsNode(lockNum))
                        permanentOrder.addNode(lockNum);
                      permanentOrder.addEdge(daeNum, lockNum, tn1);
                    }
                    tn1.lockset.add(daeEqVal);

                    List forwardLabels = lockOrder.getLabelsForEdges(lock1Num, lock2Num);
View Full Code Here
341
342
343
344
345
346
347
348
349
350
351
                        {
                          for(EquivalentValue lockEqVal : tn.lockset)
                          {
                            Integer lockNum = lockToLockNum.get(lockEqVal.getValue());
                            if(!permanentOrder.containsNode(lockNum))
                              permanentOrder.addNode(lockNum);
                            permanentOrder.addEdge(daeNum, lockNum, tn);
                          }
                          tn.lockset.add(daeEqVal);
                        }
                      }
View Full Code Here
361
362
363
364
365
366
367
368
369
370
371
                        {
                          for(EquivalentValue lockEqVal : tn.lockset)
                          {
                            Integer lockNum = lockToLockNum.get(lockEqVal.getValue());
                            if(!permanentOrder.containsNode(lockNum))
                              permanentOrder.addNode(lockNum);
                            permanentOrder.addEdge(daeNum, lockNum, tn);
                          }
                          tn.lockset.add(daeEqVal);
                            G.v().out.println("[DeadlockDetector]   Adding deadlock avoidance edge between " +
                              (tn1.name) + " and " + (tn.name));
View Full Code Here
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.