Home
last modified time | relevance | path

Searched refs:addPredecessor (Results 1 – 17 of 17) sorted by relevance

/external/testng/src/test/java/test/
DGraphTest.java29 g.addPredecessor("3", "2"); in sort()
30 g.addPredecessor("3", "2.1"); in sort()
31 g.addPredecessor("3", "2.2"); in sort()
32 g.addPredecessor("2", "1"); in sort()
33 g.addPredecessor("2.1", "1"); in sort()
34 g.addPredecessor("2.2", "1"); in sort()
78 g.addPredecessor("3", "2"); in createCyclicGraph()
79 g.addPredecessor("2", "1"); in createCyclicGraph()
80 g.addPredecessor("1", "3"); in createCyclicGraph()
96 g.addPredecessor("3", "2"); in findPredecessors()
[all …]
/external/testng/src/main/java/org/testng/internal/
DGraph.java48 public void addPredecessor(T tm, T predecessor) { in addPredecessor() method in Graph
54 node.addPredecessor(predecessor); in addPredecessor()
279 result.addPredecessor(pred); in clone()
325 public void addPredecessor(T tm) { in addPredecessor() method in Graph.Node
DTarjan.java71 g.addPredecessor(edges[i], edges[i+1]); in main()
DMethodHelper.java227 result.addPredecessor(m, predecessor); in topologicalSort()
/external/clang/lib/StaticAnalyzer/Core/
DCoreEngine.cpp517 Node->addPredecessor(Pred, G); // Link 'Node' with its predecessor. in generateNode()
570 Succ->addPredecessor(N, G); in enqueueStmtNode()
586 Node->addPredecessor(N, G); in generateCallExitBeginNode()
632 N->addPredecessor(FromN, C.Eng.G); in generateNodeImpl()
676 Succ->addPredecessor(Pred, Eng.G); in generateNode()
696 Succ->addPredecessor(Pred, Eng.G); in generateCaseStmtNode()
721 Succ->addPredecessor(Pred, Eng.G); in generateDefaultCaseNode()
DExplodedGraph.cpp218 void ExplodedNode::addPredecessor(ExplodedNode *V, ExplodedGraph &G) { in addPredecessor() function in ExplodedNode
420 NewN->addPredecessor(const_cast<ExplodedNode *>(PI->second), *G); in trim()
431 const_cast<ExplodedNode *>(PI->second)->addPredecessor(NewN, *G); in trim()
DExprEngineCallAndReturn.cpp63 Node->addPredecessor(Pred, G); in processCallEnter()
289 BindedRetNode->addPredecessor(CEBNode, G); in processCallExit()
316 CEENode->addPredecessor(*I, G); in processCallExit()
453 N->addPredecessor(Pred, G); in REGISTER_TRAIT_WITH_PROGRAMSTATE()
DExprEngine.cpp1392 NewNode->addPredecessor(BeforeProcessingCall, G); in replayWithoutInlining()
DBugReporter.cpp2935 Succ->addPredecessor(NewN, *GNew); in popNextReportGraph()
/external/llvm/lib/CodeGen/
DMachineBasicBlock.cpp531 Succ->addPredecessor(this); in addSuccessor()
540 Succ->addPredecessor(this); in addSuccessorWithoutProb()
591 New->addPredecessor(this); in replaceSuccessor()
606 void MachineBasicBlock::addPredecessor(MachineBasicBlock *Pred) { in addPredecessor() function in MachineBasicBlock
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/
DAnalyzedInstruction.java124 protected boolean addPredecessor(AnalyzedInstruction predecessor) { in addPredecessor() method in AnalyzedInstruction
DMethodAnalyzer.java548 if (!successor.addPredecessor(predecessor)) {
/external/clang/lib/Analysis/
DThreadSafetyTIL.cpp56 unsigned BasicBlock::addPredecessor(BasicBlock *Pred) { in addPredecessor() function in BasicBlock
DThreadSafetyCommon.cpp836 CurrentBB->addPredecessor(BlockMap[Pred->getBlockID()]); in handlePredecessor()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h176 void addPredecessor(ExplodedNode *V, ExplodedGraph &G);
/external/llvm/include/llvm/CodeGen/
DMachineBasicBlock.h770 void addPredecessor(MachineBasicBlock *Pred);
/external/clang/include/clang/Analysis/Analyses/
DThreadSafetyTIL.h1610 unsigned addPredecessor(BasicBlock *Pred);