Home
last modified time | relevance | path

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

123456

/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DEHFrameSupport.h50 Edge *getPersonalityEdge() const { in getPersonalityEdge()
60 Edge *getCIEEdge() const { return CIEEdge; } in getCIEEdge()
65 Edge *getPCBeginEdge() const { return PCBeginEdge; } in getPCBeginEdge()
69 Edge *getLSDAEdge() const { in getLSDAEdge()
75 EHFrameCFIBlockInspector(Edge *PersonalityEdge);
76 EHFrameCFIBlockInspector(Edge &CIEEdge, Edge &PCBeginEdge, Edge *LSDAEdge);
78 Edge *CIEEdge = nullptr;
79 Edge *PCBeginEdge = nullptr;
81 Edge *PersonalityEdge;
82 Edge *LSDAEdge;
H A Daarch32.h30 enum EdgeKind_aarch32 : Edge::Kind {
36 FirstDataRelocation = Edge::FirstRelocation,
123 const char *getEdgeKindName(Edge::Kind K); in getArmConfigForCPUArch()
176 static const FixupInfoBase *getDynFixupInfo(Edge::Kind K);
273 Expected<int64_t> readAddendData(LinkGraph &G, Block &B, Edge::OffsetT Offset,
274 Edge::Kind Kind);
277 Expected<int64_t> readAddendArm(LinkGraph &G, Block &B, Edge::OffsetT Offset,
278 Edge::Kind Kind);
281 Expected<int64_t> readAddendThumb(LinkGraph &G, Block &B, Edge::OffsetT Offset,
282 Edge
[all...]
H A Di386.h21 enum EdgeKind_i386 : Edge::Kind {
24 None = Edge::FirstRelocation,
194 const char *getEdgeKindName(Edge::Kind K);
197 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup()
343 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
344 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
358 assert(KindToSet != Edge::Invalid && in visitEdge()
391 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
H A Dppc64.h23 enum EdgeKind_ppc64 : Edge::Kind {
24 Pointer64 = Edge::FirstRelocation,
83 Edge::Kind K; in pickStub()
85 Edge::AddendT A; in pickStub()
121 Edge::AddendT Addend = isLE ? 8 : 10; in createAnonymousPointerJumpStub()
163 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in getOrCreateTOCSection()
164 Edge::Kind K = E.getKind(); in getOrCreateTOCSection()
210 bool visitEdge(LinkGraph &G, Block *B, Edge &E) {
212 Edge::Kind K = E.getKind();
262 const char *getEdgeKindName(Edge in applyFixup()
[all...]
H A Dloongarch.h25 enum EdgeKind_loongarch : Edge::Kind {
31 Pointer64 = Edge::FirstRelocation,
165 const char *getEdgeKindName(Edge::Kind K);
173 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E) { in applyFixup()
319 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
320 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
331 assert(KindToSet != Edge::Invalid && in visitEdge()
365 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
H A Dx86_64.h24 enum EdgeKind_x86_64 : Edge::Kind {
31 Pointer64 = Edge::FirstRelocation,
404 const char *getEdgeKindName(Edge::Kind K);
407 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup()
593 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
594 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
620 assert(KindToSet != Edge::Invalid && in visitEdge()
653 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
H A Driscv.h24 enum EdgeKind_riscv : Edge::Kind {
32 R_RISCV_32 = Edge::FirstRelocation,
227 const char *getEdgeKindName(Edge::Kind K);
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp96 Edges = std::vector<std::vector<Edge>>(NodeCount, std::vector<Edge>()); in initialize()
99 std::vector<std::vector<Edge *>>(NodeCount, std::vector<Edge *>()); in initialize()
114 for (auto &Edge : Edges[Src]) { in run() local
115 if (Edge.Flow > 0) { in run()
116 TotalCost += Edge.Cost * Edge.Flow; in run()
118 TotalFlow += Edge.Flow; in run()
137 Edge SrcEdge; in addEdge()
144 Edge DstEdge; in addEdge()
164 for (const auto &Edge : Edges[Src]) { in getFlow() local
165 if (Edge.Flow > 0) in getFlow()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h276 bool unionGroups(const EdgeType *Edge) { in unionGroups() argument
277 NodeInfo *G1 = find(&NodeInfoMap[Edge->Source]); in unionGroups()
278 NodeInfo *G2 = find(&NodeInfoMap[Edge->Target]); in unionGroups()
331 for (auto &Edge : Node->Edges) { in scc_member_iterator()
332 if (NodeInfoMap.count(Edge.Target)) in scc_member_iterator()
333 SortedEdges.insert(&Edge); in scc_member_iterator()
340 for (auto *Edge : SortedEdges) { in scc_member_iterator()
341 if (unionGroups(Edge)) in scc_member_iterator()
342 MSTEdges.insert(Edge); in scc_member_iterator()
351 for (const auto *Edge : MSTEdges) in scc_member_iterator() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DEHFrameSupportImpl.h30 /// Edge::Invalid should be used.
32 Edge::Kind Pointer32, Edge::Kind Pointer64,
33 Edge::Kind Delta32, Edge::Kind Delta64,
34 Edge::Kind NegDelta32);
57 EdgeTarget(const Edge &E) : Target(&E.getTarget()), Addend(E.getAddend()) {} in EdgeTarget()
60 Edge::AddendT Addend = 0;
64 DenseMap<Edge::OffsetT, EdgeTarget> TargetMap;
65 DenseSet<Edge
[all...]
H A DELF_aarch64.cpp42 Error applyFixup(LinkGraph &G, Block &B, const Edge &E) const { in applyFixup()
50 enum ELFAArch64RelocationKind : Edge::Kind {
51 ELFCall26 = Edge::FirstRelocation,
184 Edge::OffsetT Offset = FixupAddress - BlockToFix.getAddress(); in addSingleRelocation()
190 Edge::Kind Kind = Edge::Invalid; in addSingleRelocation()
379 Edge GE(Kind, Offset, *GraphSymbol, Addend); in addSingleRelocation()
392 const char *getELFAArch64RelocationKindName(Edge::Kind R) { in getELFAArch64RelocationKindName()
439 return getGenericEdgeKindName(static_cast<Edge::Kind>(R)); in getELFAArch64RelocationKindName()
459 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { return false; } in visitEdge()
503 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
[all …]
H A DELF_riscv.cpp47 bool isGOTEdgeToFix(Edge &E) const { return E.getKind() == R_RISCV_GOT_HI20; } in isGOTEdgeToFix()
66 void fixGOTEdge(Edge &E, Symbol &GOTEntry) { in fixGOTEdge()
74 void fixPLTEdge(Edge &E, Symbol &PLTStubs) { in fixPLTEdge()
82 bool isExternalBranchEdge(Edge &E) const { in isExternalBranchEdge()
161 DenseMap<std::pair<const Block *, orc::ExecutorAddrDiff>, const Edge *>
166 for (Edge &E : B->edges()) in gatherRISCVPCRelHi20()
173 Expected<const Edge &> getRISCVPCRelHi20(const Edge &E) const { in getRISCVPCRelHi20()
192 Error applyFixup(LinkGraph &G, Block &B, const Edge &E) const { in applyFixup()
489 SmallVector<Edge *, 0> RelaxEdges;
494 SmallVector<Edge::Kind, 0> EdgeKinds;
[all …]
H A Daarch32.cpp240 Edge::Kind Kind) { in readAddendThumb()
248 Edge::Kind Kind) { in readAddendThumb()
280 const FixupInfoBase *getEntry(Edge::Kind K) { in applyFixupData()
316 Edge::Kind Kind) { in applyFixupData()
318 "Edge kind must be Arm relocation"); in applyFixupData()
329 Edge::Kind Kind) { in applyFixupArm()
331 "Edge kind must be Thumb relocation"); in applyFixupArm()
341 const FixupInfoBase *FixupInfoBase::getDynFixupInfo(Edge::Kind K) { in applyFixupThumb()
390 Expected<int64_t> readAddendData(LinkGraph &G, Block &B, Edge::OffsetT Offset, in applyFixupThumb()
391 Edge in applyFixupThumb()
[all...]
H A DEHFrameSupport.cpp23 unsigned PointerSize, Edge::Kind Pointer32, in EHFrameEdgeFixer()
24 Edge::Kind Pointer64, Edge::Kind Delta32, in EHFrameEdgeFixer()
25 Edge::Kind Delta64, Edge::Kind NegDelta32) in EHFrameEdgeFixer()
371 (*PCBegin)->getBlock().addEdge(Edge::KeepAlive, 0, FDESymbol, 0); in processFDE()
577 Edge::Kind PtrEdgeKind = Edge::Invalid; in getOrCreateEncodedPointerEdge()
664 SmallVector<Edge *, 3> Es; in deregisterEHFrames()
668 llvm::sort(Es, [](const Edge *LH in FromEdgeScan()
[all...]
H A DMachO_arm64.cpp36 enum MachOARM64RelocationKind : Edge::Kind {
37 MachOBranch26 = Edge::FirstRelocation,
126 using PairRelocInfo = std::tuple<Edge::Kind, Symbol *, uint64_t>;
131 parsePairRelocation(Block &BlockToFix, Edge::Kind SubtractorKind, in parsePairRelocation()
189 Edge::Kind DeltaKind; in parsePairRelocation()
300 Edge::Kind Kind = Edge::Invalid; in addRelocations()
475 Edge GE(Kind, FixupAddress - BlockToFix->getAddress(), *TargetSymbol, in addRelocations()
488 const char *getMachOARM64RelocationKindName(Edge::Kind R) { in getMachOARM64RelocationKindName()
523 return getGenericEdgeKindName(static_cast<Edge::Kind>(R)); in getMachOARM64RelocationKindName()
554 Error applyFixup(LinkGraph &G, Block &B, const Edge &E) const { in applyFixup()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMemProfContextDisambiguation.cpp294 for (auto &Edge : *Edges) in getContextIds()
295 Count += Edge->getContextIds().size(); in getContextIds()
297 for (auto &Edge : *Edges) in getContextIds()
298 ContextIds.insert(Edge->getContextIds().begin(), in getContextIds()
299 Edge->getContextIds().end()); in getContextIds()
312 for (auto &Edge : *Edges) { in computeAllocType()
313 AllocType |= Edge->AllocTypes; in computeAllocType()
327 for (auto &Edge : *Edges) { in emptyContextIds()
328 if (!Edge->getContextIds().empty()) in emptyContextIds()
367 void eraseCalleeEdge(const ContextEdge *Edge);
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h47 class Edge {
62 const Edge *Edges;
68 const Edge *edges_begin() const { return Edges; } in edges_begin()
73 const Edge *edges_end() const { return (this + 1)->Edges; } in edges_end()
74 ArrayRef<Edge> edges() const { in edges()
80 ImmutableGraph(std::unique_ptr<Node[]> Nodes, std::unique_ptr<Edge[]> Edges, in ImmutableGraph()
94 ArrayRef<Edge> edges() const { return ArrayRef(Edges.get(), EdgesSize); } in edges()
95 const Edge *edges_begin() const { return edges().begin(); } in edges_begin()
96 const Edge *edges_end() const { return edges().end(); } in edges_end()
106 size_type getEdgeIndex(const Edge &E) const { in getEdgeIndex()
[all …]
H A DX86LoadValueInjectionLoadHardening.cpp120 using Edge = typename GraphT::Edge; typedef
123 std::unique_ptr<Edge[]> Edges, size_type NodesSize, in MachineGadgetGraph()
127 static inline bool isCFGEdge(const Edge &E) { in isCFGEdge()
130 static inline bool isGadgetEdge(const Edge &E) { in isGadgetEdge()
151 using Edge = MachineGadgetGraph::Edge; typedef in __anond4b80a110111::X86LoadValueInjectionLoadHardeningPass
546 for (const Edge &E : G.edges()) { in elimMitigatedEdgesAndNodes()
551 for (const Edge &DE : Dest->edges()) in elimMitigatedEdgesAndNodes()
570 for (const Edge &E : N->edges()) { in elimMitigatedEdgesAndNodes()
580 for (const Edge &E : RootN.edges()) { in elimMitigatedEdgesAndNodes()
633 for (const Edge &E : Graph->edges()) { in hardenLoadsWithPlugin()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp41 Edge::Kind EK) { in insertEdgeInternal()
46 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()
55 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
60 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge()
62 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { in addEdge()
67 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
106 LazyCallGraph::Edge::Call); in populateSlow()
120 LazyCallGraph::Edge::Ref); in populateSlow()
128 LazyCallGraph::Edge::Ref); in populateSlow()
174 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref); in LazyCallGraph()
[all …]
H A DBranchProbabilityInfo.cpp325 bool BranchProbabilityInfo::isLoopEnteringEdge(const LoopEdge &Edge) const { in isLoopEnteringEdge()
326 const auto &SrcBlock = Edge.first; in isLoopEnteringEdge()
327 const auto &DstBlock = Edge.second; in isLoopEnteringEdge()
335 bool BranchProbabilityInfo::isLoopExitingEdge(const LoopEdge &Edge) const { in isLoopExitingEdge()
336 return isLoopEnteringEdge({Edge.second, Edge.first}); in isLoopExitingEdge()
340 const LoopEdge &Edge) const { in isLoopEnteringExitingEdge()
341 return isLoopEnteringEdge(Edge) || isLoopExitingEdge(Edge); in isLoopEnteringExitingEdge()
344 bool BranchProbabilityInfo::isLoopBackEdge(const LoopEdge &Edge) const { in isLoopBackEdge()
345 const auto &SrcBlock = Edge.first; in isLoopBackEdge()
346 const auto &DstBlock = Edge.second; in isLoopBackEdge()
[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()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h131 class Edge {
136 Edge();
137 explicit Edge(Node &N, Kind K);
187 using VectorT = SmallVector<Edge, 4>;
188 using VectorImplT = SmallVectorImpl<Edge>;
257 Edge &operator[](Node &N) {
264 Edge *lookup(Node &N) { in lookup()
296 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);
299 void setEdgeKind(Node &ChildN, Edge::Kind EK);
754 void insertOutgoingEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineDominators.cpp139 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
141 MachineBasicBlock *Succ = Edge.ToBB; in applySplitCriticalEdges()
145 if (PredBB == Edge.NewBB) in applySplitCriticalEdges()
175 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
179 Edge.NewBB, Edge.FromBB); in applySplitCriticalEdges()
186 Base::getNode(Edge.ToBB), NewDTNode); in applySplitCriticalEdges()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Instrumentation/
H A DCFGMST.h39 template <class Edge, class BBInfo> class CFGMST {
44 std::vector<std::unique_ptr<Edge>> AllEdges;
87 void handleCoroSuspendEdge(Edge *E) { in getBBInfo()
114 LLVM_DEBUG(dbgs() << "Build Edge on " << F.getName() << "\n"); in buildEdges()
122 Edge *EntryIncoming = nullptr, *EntryOutgoing = nullptr, in buildEdges()
128 LLVM_DEBUG(dbgs() << " Edge: from fake node to " << Entry->getName() in buildEdges()
162 LLVM_DEBUG(dbgs() << " Edge: from " << BB.getName() << " to " in buildEdges()
183 Edge *ExitO = &addEdge(&BB, nullptr, BBWeight); in buildEdges()
188 LLVM_DEBUG(dbgs() << " Edge: from " << BB.getName() << " to fake exit" in buildEdges()
220 llvm::stable_sort(AllEdges, [](const std::unique_ptr<Edge> in computeMinimumSpanningTree()
[all...]
/freebsd/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()

123456