Home
last modified time | relevance | path

Searched refs:Edge (Results 1 – 25 of 62) sorted by relevance

123

/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h135 class Edge {
140 Edge();
141 explicit Edge(Node &N, Kind K);
191 using VectorT = SmallVector<Edge, 4>;
192 using VectorImplT = SmallVectorImpl<Edge>;
261 Edge &operator[](int i) { return Edges[i]; }
262 Edge &operator[](Node &N) {
269 Edge *lookup(Node &N) { in lookup()
1196 inline LazyCallGraph::Edge::Edge() : Value() {} in Edge() function
1197 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} in Edge() function
[all …]
H A DBranchProbabilityInfo.h170 using Edge = std::pair<const BasicBlock *, unsigned>; variable
180 DenseMap<Edge, BranchProbability> Probs;
H A DSparsePropagation.h130 using Edge = std::pair<BasicBlock *, BasicBlock *>; variable
134 std::set<Edge> KnownFeasibleEdges;
270 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second) in markEdgeExecutable()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMachineDominators.cpp104 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
106 MachineBasicBlock *Succ = Edge.ToBB; in applySplitCriticalEdges()
110 if (PredBB == Edge.NewBB) in applySplitCriticalEdges()
140 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
142 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB); in applySplitCriticalEdges()
148 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode); in applySplitCriticalEdges()
H A DCriticalAntiDepBreaker.cpp555 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) { in BreakAntiDependencies() local
556 const SUnit *NextSU = Edge->getSUnit(); in BreakAntiDependencies()
559 if (Edge->getKind() == SDep::Anti) { in BreakAntiDependencies()
560 AntiDepReg = Edge->getReg(); in BreakAntiDependencies()
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DLazyCallGraph.cpp58 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
231 for (Edge &E : **N) in verify()
242 for (Edge &E : N->calls()) in isParentOf()
324 for (Edge &E : *N) { in verify()
345 for (Edge &E : *N) in isParentOf()
367 for (Edge &E : *N) { in isAncestorOf()
591 for (Edge &E : *N) { in switchInternalEdgeToCall()
987 for (Edge &E : *N) in insertIncomingRefEdge()
1012 for (Edge &E : *N) { in insertIncomingRefEdge()
1393 E.setKind(Edge::Call); in insertTrivialCallEdge()
[all …]
H A DCGSCCPassManager.cpp425 using Edge = LazyCallGraph::Edge; in updateCGAndAnalysisManagerForFunctionPass() typedef
450 Edge *E = N->lookup(CalleeN); in updateCGAndAnalysisManagerForFunctionPass()
475 Edge *E = N->lookup(RefereeN); in updateCGAndAnalysisManagerForFunctionPass()
500 for (Edge &E : *N) { in updateCGAndAnalysisManagerForFunctionPass()
H A DCFLGraph.h63 struct Edge { struct
68 using EdgeList = std::vector<Edge>; argument
134 FromInfo->Edges.push_back(Edge{To, Offset});
135 ToInfo->ReverseEdges.push_back(Edge{From, Offset});
/freebsd-12.1/contrib/llvm/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h30 typedef std::pair<const T*, const T*> Edge; typedef
31 typedef std::pair<Edge, double> EdgeWeight;
34 typedef std::vector<Edge> MaxSpanTree;
80 Edge e = (*EWi).first; in MaximumSpanningTree()
89 Edge e = (*EWi).first; in MaximumSpanningTree()
H A DCFGMST.h38 template <class Edge, class BBInfo> class CFGMST {
44 std::vector<std::unique_ptr<Edge>> AllEdges;
104 Edge *EntryIncoming = nullptr, *EntryOutgoing = nullptr, in buildEdges()
162 Edge *ExitO = &addEdge(&*BB, nullptr, BBWeight); in buildEdges()
200 [](const std::unique_ptr<Edge> &Edge1, in sortEdgesByWeight()
201 const std::unique_ptr<Edge> &Edge2) { in sortEdgesByWeight()
255 Edge &addEdge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W) { in addEdge()
269 AllEdges.emplace_back(new Edge(Src, Dest, W)); in addEdge()
H A DPGOInstrumentation.cpp496 template <class Edge, class BBInfo> class FuncPGOInstrumentation {
517 CFGMST<Edge, BBInfo> MST;
521 BasicBlock *getInstrBB(Edge *E);
584 template <class Edge, class BBInfo>
585 void FuncPGOInstrumentation<Edge, BBInfo>::computeCFGHash() { in computeCFGHash()
638 template <class Edge, class BBInfo>
639 void FuncPGOInstrumentation<Edge, BBInfo>::renameComdatFunction() { in renameComdatFunction()
686 template <class Edge, class BBInfo>
687 BasicBlock *FuncPGOInstrumentation<Edge, BBInfo>::getInstrBB(Edge *E) { in getInstrBB()
/freebsd-12.1/contrib/llvm/lib/LTO/
H A DSummaryBasedOptimizations.cpp51 auto GetCallSiteRelFreq = [](FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts() argument
52 return Scaled64(Edge.second.RelBlockFreq, -CalleeInfo::ScaleShift); in computeSyntheticCounts()
74 auto GetProfileCount = [&](ValueInfo V, FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts() argument
75 auto RelFreq = GetCallSiteRelFreq(Edge); in computeSyntheticCounts()
/freebsd-12.1/contrib/llvm/lib/Transforms/IPO/
H A DSyntheticCountsPropagation.cpp110 const CallGraphNode::CallRecord &Edge) { in run() argument
112 if (!Edge.first) in run()
114 assert(isa<Instruction>(Edge.first)); in run()
115 CallSite CS(cast<Instruction>(Edge.first)); in run()
H A DSampleProfile.cpp136 using Edge = std::pair<const BasicBlock *, const BasicBlock *>; typedef
137 using EdgeWeightMap = DenseMap<Edge, uint64_t>;
226 void printEdgeWeight(raw_ostream &OS, Edge E);
236 uint64_t visitEdge(Edge E, unsigned *NumUnknownEdges, Edge *UnknownEdge);
258 SmallSet<Edge, 32> VisitedEdges;
1031 Edge UnknownEdge, SelfReferentialEdge, SingleEdge; in propagateThroughEdges()
1037 Edge E = std::make_pair(Pred, BB); in propagateThroughEdges()
1049 Edge E = std::make_pair(BB, Succ); in propagateThroughEdges()
1126 Edge E = std::make_pair(Pred, BB); in propagateThroughEdges()
1132 Edge E = std::make_pair(BB, Succ); in propagateThroughEdges()
[all …]
H A DFunctionImport.cpp358 for (auto &Edge : Summary.calls()) { in computeImportForFunction() local
359 ValueInfo VI = Edge.first; in computeImportForFunction()
389 Threshold * GetBonusMultiplier(Edge.second.getHotness()); in computeImportForFunction()
399 Edge.second.getHotness() == CalleeInfo::HotnessType::Hot; in computeImportForFunction()
401 Edge.second.getHotness() == CalleeInfo::HotnessType::Critical; in computeImportForFunction()
449 std::max(FailureInfo->MaxHotness, Edge.second.getHotness()); in computeImportForFunction()
455 VI, Edge.second.getHotness(), Reason, 1); in computeImportForFunction()
493 for (auto &Edge : ResolvedCalleeSummary->calls()) { in computeImportForFunction() local
494 auto CalleeGUID = Edge.first.getGUID(); in computeImportForFunction()
/freebsd-12.1/contrib/llvm/lib/ProfileData/
H A DGCOV.cpp189 GCOVEdge *Edge = Edges.back().get(); in readGCNO() local
190 Blocks[BlockNo]->addDstEdge(Edge); in readGCNO()
191 Blocks[Dst]->addSrcEdge(Edge); in readGCNO()
416 for (const GCOVEdge *Edge : SrcEdges) in print() local
417 OS << Edge->Src.Number << " (" << Edge->Count << "), "; in print()
422 for (const GCOVEdge *Edge : DstEdges) in print() local
423 OS << Edge->Dst.Number << " (" << Edge->Count << "), "; in print()
858 BranchCounts.push_back(Edge->Count); in printBranchInfo()
859 TotalCounts += Edge->Count; in printBranchInfo()
862 if (Edge->Count) in printBranchInfo()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/ProfileData/
H A DGCOV.h341 void addSrcEdge(GCOVEdge *Edge) { in addSrcEdge() argument
342 assert(&Edge->Dst == this); // up to caller to ensure edge is valid in addSrcEdge()
343 SrcEdges.push_back(Edge); in addSrcEdge()
346 void addDstEdge(GCOVEdge *Edge) { in addDstEdge() argument
347 assert(&Edge->Src == this); // up to caller to ensure edge is valid in addDstEdge()
349 if (DstEdges.size() && DstEdges.back()->Dst.Number > Edge->Dst.Number) in addDstEdge()
351 DstEdges.push_back(Edge); in addDstEdge()
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DDominators.h116 static unsigned getHashValue(const BasicBlockEdge &Edge) {
117 return hash_combine(BBInfo::getHashValue(Edge.getStart()),
118 BBInfo::getHashValue(Edge.getEnd()));
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/GlobalISel/
H A DIRTranslator.h512 void addMachineCFGPred(CFGEdge Edge, MachineBasicBlock *NewPred);
518 SmallVector<MachineBasicBlock *, 1> getMachinePredBBs(CFGEdge Edge) { in getMachinePredBBs() argument
519 auto RemappedEdge = MachinePreds.find(Edge); in getMachinePredBBs()
522 return SmallVector<MachineBasicBlock *, 4>(1, &getMBB(*Edge.first)); in getMachinePredBBs()
/freebsd-12.1/contrib/llvm/tools/lld/ELF/Arch/
H A DMipsArchTree.cpp177 for (const auto &Edge : ArchTree) { in isArchMatched() local
178 if (Res == Edge.Child) { in isArchMatched()
179 Res = Edge.Parent; in isArchMatched()
/freebsd-12.1/contrib/llvm/tools/lld/ELF/
H A DCallGraphSort.cpp54 struct Edge { struct
72 Edge BestPred = {-1, 0};
/freebsd-12.1/tools/tools/ath/athprom/
H A Deeprom-464 =======================Test Group Band Edge Power========================
129 =======================Test Group Band Edge Power========================
194 =======================Test Group Band Edge Power========================
H A Deeprom-1484 =======================Test Group Band Edge Power========================
108 =======================Test Group Band Edge Power========================
/freebsd-12.1/contrib/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_deadlock_detector.h253 Edge e = {(u16)added_edges[i], (u16)cur_idx, in addEdges()
396 struct Edge { struct
410 Edge edges_[BV::kSize * 32]; argument
/freebsd-12.1/sys/gnu/dts/arm64/bitmain/
H A Dbm1880-sophon-edge.dts13 model = "Sophon Edge";

123