Home
last modified time | relevance | path

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

12345

/freebsd-13.1/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DEHFrameSupportImpl.h44 Edge::Kind Delta64, Edge::Kind Delta32,
45 Edge::Kind NegDelta32);
67 EdgeTarget(const Edge &E) : Target(&E.getTarget()), Addend(E.getAddend()) {} in EdgeTarget()
70 Edge::AddendT Addend = 0;
73 using BlockEdgeMap = DenseMap<Edge::OffsetT, EdgeTarget>;
105 Expected<std::pair<JITTargetAddress, Edge::Kind>>
114 Edge::Kind Delta64;
115 Edge::Kind Delta32;
116 Edge::Kind NegDelta32;
H A DJITLink.cpp60 const char *getGenericEdgeKindName(Edge::Kind K) { in getGenericEdgeKindName()
62 case Edge::Invalid: in getGenericEdgeKindName()
64 case Edge::KeepAlive: in getGenericEdgeKindName()
115 void printEdge(raw_ostream &OS, const Block &B, const Edge &E, in printEdge()
283 std::vector<Edge> SortedEdges; in dump()
285 llvm::sort(SortedEdges, [](const Edge &LHS, const Edge &RHS) { in dump()
362 const Edge &E) { in makeTargetOutOfRangeError()
H A DMachO_x86_64.cpp116 using PairRelocInfo = std::tuple<Edge::Kind, Symbol *, uint64_t>;
178 Edge::Kind DeltaKind; in parsePairRelocation()
278 Edge::Kind Kind = Edge::Invalid; in addRelocations()
407 Edge GE(Kind, FixupAddress - BlockToFix->getAddress(), *TargetSymbol, in addRelocations()
429 bool isGOTEdgeToFix(Edge &E) const { in isGOTEdgeToFix()
439 void fixGOTEdge(Edge &E, Symbol &GOTEntry) { in fixGOTEdge()
455 bool isExternalBranchEdge(Edge &E) { in isExternalBranchEdge()
464 void fixPLTEdge(Edge &E, Symbol &Stub) { in fixPLTEdge()
584 Error applyFixup(LinkGraph &G, Block &B, const Edge &E) const { in applyFixup()
H A Dx86_64.cpp21 const char *getEdgeKindName(Edge::Kind K) { in getEdgeKindName()
52 return getGenericEdgeKindName(static_cast<Edge::Kind>(K)); in getEdgeKindName()
H A DELF_x86_64.cpp46 bool isGOTEdgeToFix(Edge &E) const { in isGOTEdgeToFix()
65 void fixGOTEdge(Edge &E, Symbol &GOTEntry) { in fixGOTEdge()
90 bool isExternalBranchEdge(Edge &E) { in isExternalBranchEdge()
103 void fixPLTEdge(Edge &E, Symbol &Stub) { in fixPLTEdge()
347 Edge GE(*Kind, FixupAddress - BlockToFix->getAddress(), *TargetSymbol, in addRelocations()
429 Error applyFixup(LinkGraph &G, Block &B, const Edge &E) const { in applyFixup()
579 const char *getELFX86RelocationKindName(Edge::Kind R) { in getELFX86RelocationKindName()
622 return getGenericEdgeKindName(static_cast<Edge::Kind>(R)); in getELFX86RelocationKindName()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineDominators.cpp101 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
103 MachineBasicBlock *Succ = Edge.ToBB; in applySplitCriticalEdges()
107 if (PredBB == Edge.NewBB) in applySplitCriticalEdges()
137 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
139 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB); in applySplitCriticalEdges()
145 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode); in applySplitCriticalEdges()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h47 class Edge {
62 const Edge *Edges;
74 ArrayRef<Edge> edges() const { in edges()
106 size_type getEdgeIndex(const Edge &E) const { in getEdgeIndex()
206 bool insert(const Edge &E) { in insert()
212 void erase(const Edge &E) { in erase()
216 bool contains(const Edge &E) const { in contains()
272 Edge *operator*() const {
289 std::unique_ptr<Edge[]> Edges;
306 using Edge = typename GraphT::Edge; variable
[all …]
H A DX86LoadValueInjectionLoadHardening.cpp121 using Edge = typename GraphT::Edge; typedef
152 using Edge = MachineGadgetGraph::Edge; typedef in __anon6c45a0450111::X86LoadValueInjectionLoadHardeningPass
548 for (const Edge &E : G.edges()) { in elimMitigatedEdgesAndNodes()
553 for (const Edge &DE : Dest->edges()) in elimMitigatedEdgesAndNodes()
582 for (const Edge &E : RootN.edges()) { in elimMitigatedEdgesAndNodes()
636 for (const Edge &E : Graph->edges()) { in hardenLoadsWithPlugin()
677 for (const Edge &E : Graph->edges()) in hardenLoadsWithHeuristic()
690 for (const Edge &E : N.edges()) { in hardenLoadsWithHeuristic()
710 for (const Edge *E : EdgesToCut) in hardenLoadsWithHeuristic()
730 for (const Edge &E : N.edges()) { in insertFences()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp257 for (Edge &E : **N) in verify()
368 for (Edge &E : *N) { in verify()
414 for (Edge &E : *N) in isParentOf()
436 for (Edge &E : *N) { in isAncestorOf()
658 for (Edge &E : *N) { in switchInternalEdgeToCall()
1044 for (Edge &E : *N) in insertIncomingRefEdge()
1428 E.setKind(Edge::Call); in insertTrivialCallEdge()
1632 for (Edge &E : *NewN) { in addSplitFunction()
1645 for (Edge &E : *NewN) { in addSplitFunction()
1717 for (Edge &E : *NewN) { in addSplitRefRecursiveFunctions()
[all …]
H A DDDGPrinter.cpp130 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getSimpleEdgeAttributes() argument
133 DDGEdge::EdgeKind Kind = Edge->getKind(); in getSimpleEdgeAttributes()
139 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getVerboseEdgeAttributes() argument
142 DDGEdge::EdgeKind Kind = Edge->getKind(); in getVerboseEdgeAttributes()
145 OS << G->getDependenceString(*Src, Edge->getTargetNode()); in getVerboseEdgeAttributes()
H A DBranchProbabilityInfo.cpp253 const auto &SrcBlock = Edge.first; in isLoopEnteringEdge()
254 const auto &DstBlock = Edge.second; in isLoopEnteringEdge()
263 return isLoopEnteringEdge({Edge.second, Edge.first}); in isLoopExitingEdge()
267 const LoopEdge &Edge) const { in isLoopEnteringExitingEdge()
268 return isLoopEnteringEdge(Edge) || isLoopExitingEdge(Edge); in isLoopEnteringExitingEdge()
272 const auto &SrcBlock = Edge.first; in isLoopBackEdge()
273 const auto &DstBlock = Edge.second; in isLoopBackEdge()
614 return isLoopEnteringEdge(Edge) in getEstimatedEdgeWeight()
708 } else if (isLoopExitingEdge(Edge)) { in propagateEstimatedBlockWeight()
848 Weight = getEstimatedEdgeWeight(Edge); in calcEstimatedHeuristics()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h134 class Edge {
139 Edge();
140 explicit Edge(Node &N, Kind K);
190 using VectorT = SmallVector<Edge, 4>;
191 using VectorImplT = SmallVectorImpl<Edge>;
260 Edge &operator[](Node &N) {
267 Edge *lookup(Node &N) { in lookup()
302 void setEdgeKind(Node &ChildN, Edge::Kind EK);
1212 inline LazyCallGraph::Edge::Edge() : Value() {} in Edge() function
1213 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} in Edge() function
[all …]
H A DBranchProbabilityInfo.h318 using Edge = std::pair<const BasicBlock *, unsigned>; variable
320 DenseMap<Edge, BranchProbability> Probs;
344 bool isLoopEnteringEdge(const LoopEdge &Edge) const;
348 bool isLoopExitingEdge(const LoopEdge &Edge) const;
351 bool isLoopEnteringExitingEdge(const LoopEdge &Edge) const;
354 bool isLoopBackEdge(const LoopEdge &Edge) const;
372 Optional<uint32_t> getEstimatedEdgeWeight(const LoopEdge &Edge) const;
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h29 typedef std::pair<const T*, const T*> Edge; typedef
30 typedef std::pair<Edge, double> EdgeWeight;
33 typedef std::vector<Edge> MaxSpanTree;
78 Edge e = (*EWi).first; in MaximumSpanningTree()
87 Edge e = (*EWi).first; in MaximumSpanningTree()
H A DCFGMST.h39 template <class Edge, class BBInfo> class CFGMST {
45 std::vector<std::unique_ptr<Edge>> AllEdges;
108 Edge *EntryIncoming = nullptr, *EntryOutgoing = nullptr, in buildEdges()
168 Edge *ExitO = &addEdge(&BB, nullptr, BBWeight); in buildEdges()
205 llvm::stable_sort(AllEdges, [](const std::unique_ptr<Edge> &Edge1, in sortEdgesByWeight()
206 const std::unique_ptr<Edge> &Edge2) { in sortEdgesByWeight()
260 Edge &addEdge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W) { in addEdge()
274 AllEdges.emplace_back(new Edge(Src, Dest, W)); in addEdge()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A Driscv.h23 enum EdgeKind_riscv : Edge::Kind {
31 R_RISCV_32 = Edge::FirstRelocation,
79 const char *getEdgeKindName(Edge::Kind K);
H A DMachO_arm64.h23 enum MachOARM64RelocationKind : Edge::Kind {
24 Branch26 = Edge::FirstRelocation,
64 const char *getMachOARM64RelocationKindName(Edge::Kind R);
H A DELF_x86_64.h22 enum ELFX86RelocationKind : Edge::Kind {
23 Branch32 = Edge::FirstRelocation,
64 const char *getELFX86RelocationKindName(Edge::Kind R);
H A Dx86_64.h25 enum EdgeKind_x86_64 : Edge::Kind {
32 Pointer64 = Edge::FirstRelocation,
247 const char *getEdgeKindName(Edge::Kind K);
261 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E) { in applyFixup()
/freebsd-13.1/contrib/llvm-project/llvm/lib/LTO/
H A DSummaryBasedOptimizations.cpp53 auto GetCallSiteRelFreq = [](FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts() argument
54 return Scaled64(Edge.second.RelBlockFreq, -CalleeInfo::ScaleShift); in computeSyntheticCounts()
76 auto GetProfileCount = [&](ValueInfo V, FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts() argument
77 auto RelFreq = GetCallSiteRelFreq(Edge); in computeSyntheticCounts()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileLoaderBaseImpl.h100 using Edge = std::pair<const BasicBlockT *, const BasicBlockT *>;
101 using EdgeWeightMap = DenseMap<Edge, uint64_t>;
124 void printEdgeWeight(raw_ostream &OS, Edge E);
134 uint64_t visitEdge(Edge E, unsigned *NumUnknownEdges, Edge *UnknownEdge);
160 SmallSet<Edge, 32> VisitedEdges;
511 uint64_t SampleProfileLoaderBaseImpl<BT>::visitEdge(Edge E,
553 Edge UnknownEdge, SelfReferentialEdge, SingleEdge;
559 Edge E = std::make_pair(Pred, BB);
571 Edge E = std::make_pair(BB, Succ);
648 Edge E = std::make_pair(Pred, BB);
[all …]
/freebsd-13.1/sys/contrib/device-tree/Bindings/net/
H A Dmscc-phy-vsc8531.txt11 Edge rate sets the drive strength of the MAC
24 Ref: Table:1 - Edge rate change (below).
38 Table: 1 - Edge rate change
40 | Edge Rate Change (VDDMAC) |
/freebsd-13.1/contrib/llvm-project/llvm/lib/Support/
H A DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument
48 Parent.Children[Edge] = N; in insertLeaf()
55 unsigned EndIdx, unsigned Edge) { in insertInternalNode() argument
65 Parent->Children[Edge] = N; in insertInternalNode()
/freebsd-13.1/contrib/llvm-project/lld/MachO/
H A DExportTrie.cpp52 struct Edge { struct
53 Edge(StringRef s, TrieNode *node) : substring(s), child(node) {} in Edge() function
83 std::vector<Edge> edges;
111 for (const Edge &edge : edges) { in updateOffset()
140 for (const Edge &edge : edges) { in writeTo()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSyntheticCountsPropagation.cpp109 const CallGraphNode::CallRecord &Edge) { in run() argument
111 if (!Edge.first) in run()
113 CallBase &CB = *cast<CallBase>(*Edge.first); in run()

12345