Searched refs:addEdge (Results 1 - 14 of 14) sorted by relevance

/freebsd-11.0-release/contrib/llvm/lib/Transforms/Instrumentation/
H A DCFGMST.h91 addEdge(nullptr, BB, EntryWeight);
95 addEdge(BB, nullptr, EntryWeight);
119 addEdge(&*BB, TargetBB, Weight).IsCritical = Critical;
124 addEdge(&*BB, nullptr, BBWeight);
185 Edge &addEdge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W) { function in class:llvm::CFGMST
H A DPGOInstrumentation.cpp484 PGOUseEdge &NewEdge = FuncInfo.MST.addEdge(SrcBB, InstrBB, 0);
487 PGOUseEdge &NewEdge1 = FuncInfo.MST.addEdge(InstrBB, DestBB, 0);
H A DGCOVProfiling.cpp253 void addEdge(GCOVBlock &Successor) { function in class:__anon3153::GCOVBlock
530 Block.addEdge(Func.getBlock(TI->getSuccessor(i)));
533 Block.addEdge(Func.getReturnBlock());
/freebsd-11.0-release/contrib/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_bvgraph.h44 bool addEdge(uptr from, uptr to) { function in class:__sanitizer::BVGraph
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h131 YZEId = G.addEdge(YNId, ZNId, Delta);
H A DGraph.h416 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { function in class:llvm::PBQP::Graph
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h600 void addEdge(IrrNode &Irr, const BlockNode &Succ,
629 addEdge(Irr, I.first, OuterLoop);
1151 G.addEdge(Irr, BFI.getNode(*I), OuterLoop);
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp203 G.addEdge(node1, node2, std::move(costs));
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DCFLAliasAnalysis.cpp605 void addEdge(Node From, Node To, const EdgeTypeT &Weight, function in class:__anon2380::WeightedBidirectionalGraph
851 Graph.addEdge(From, To, std::make_pair(E.Weight, Attrs),
H A DBlockFrequencyInfoImpl.cpp582 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ, function in class:IrreducibleGraph
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp395 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M));
456 G.addEdge(N1Id, N2Id, std::move(Costs));
H A DMachineScheduler.cpp525 bool ScheduleDAGMI::addEdge(SUnit *SuccSU, const SDep &PredDep) { function in class:ScheduleDAGMI
1338 && DAG->addEdge(SUb, SDep(SUa, SDep::Cluster))) {
1351 DAG->addEdge(SI->getSUnit(), SDep(SUb, SDep::Artificial));
1451 bool Success = DAG->addEdge(&ExitSU, SDep(&SU, SDep::Cluster));
1618 DAG->addEdge(GlobalSU, SDep(*I, SDep::Weak));
1624 DAG->addEdge(FirstLocalSU, SDep(*I, SDep::Weak));
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DBugReporter.cpp1020 void addEdge(PathDiagnosticLocation NewLoc, bool alwaysAdd = false,
1117 void EdgeBuilder::addEdge(PathDiagnosticLocation NewLoc, bool alwaysAdd, function in class:EdgeBuilder
1422 EB.addEdge(C->callReturn, /*AlwaysAdd=*/true, /*IsPostJump=*/true);
1438 EB.addEdge(pos);
1505 EB.addEdge(p->getLocation(), true);
1511 EB.addEdge(BL);
1532 EB.addEdge(PE->getLocation(), true);
1570 EB.addEdge(Loc, true);
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h295 bool addEdge(SUnit *SuccSU, const SDep &PredDep);

Completed in 167 milliseconds