| /freebsd-src/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/ |
| H A D | EHFrameSupport.h | 50 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 D | aarch32.h | 30 enum EdgeKind_aarch32 : Edge::Kind {
36 FirstDataRelocation = Edge::FirstRelocation,
123 const char *getEdgeKindName(Edge::Kind K);
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::Kind Kind, const ArmConfig &ArmCfg);
[all …]
|
| H A D | i386.h | 21 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 D | loongarch.h | 25 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 D | x86_64.h | 24 enum EdgeKind_x86_64 : Edge::Kind {
31 Pointer64 = Edge::FirstRelocation,
404 const char *getEdgeKindName(Edge::Kind K); in applyFixup()
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 &&
653 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in getStubsSection()
|
| H A D | ppc64.h | 23 enum EdgeKind_ppc64 : Edge::Kind {
24 Pointer64 = Edge::FirstRelocation,
83 Edge::Kind K;
85 Edge::AddendT A;
121 Edge::AddendT Addend = isLE ? 8 : 10; in pickStub()
163 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
164 Edge::Kind K = E.getKind(); in visitEdge()
210 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
212 Edge::Kind K = E.getKind(); in visitEdge()
262 const char *getEdgeKindName(Edge::Kind K);
[all …]
|
| H A D | riscv.h | 24 enum EdgeKind_riscv : Edge::Kind {
32 R_RISCV_32 = Edge::FirstRelocation,
227 const char *getEdgeKindName(Edge::Kind K);
|
| /freebsd-src/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
| H A D | EHFrameSupportImpl.h | 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::OffsetT> Multiple;
110 Edge::Kind Pointer32;
111 Edge::Kind Pointer64;
112 Edge::Kind Delta32;
[all …]
|
| H A D | ELF_aarch64.cpp | 42 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 getELFAArch64RelocationKindName()
392 const char *getELFAArch64RelocationKindName(Edge::Kind R) { in getELFAArch64RelocationKindName()
439 return getGenericEdgeKindName(static_cast<Edge::Kind>(R));
459 bool visitEdge(LinkGraph &G, Block *B, Edge in getTLSInfoSection()
[all...] |
| H A D | aarch32.cpp | 240 Edge::Kind Kind) { in makeUnexpectedOpcodeError()
248 Edge::Kind Kind) { in makeUnexpectedOpcodeError()
280 const FixupInfoBase *getEntry(Edge::Kind K) { in getEntry()
316 Edge::Kind Kind) { in checkOpcode()
329 Edge::Kind Kind) { in checkOpcode()
341 const FixupInfoBase *FixupInfoBase::getDynFixupInfo(Edge::Kind K) { in getDynFixupInfo()
390 Expected<int64_t> readAddendData(LinkGraph &G, Block &B, Edge::OffsetT Offset, in readAddendData()
391 Edge::Kind Kind) { in readAddendData()
411 Expected<int64_t> readAddendArm(LinkGraph &G, Block &B, Edge::OffsetT Offset, in readAddendArm()
412 Edge::Kind Kind) { in readAddendArm()
[all …]
|
| H A D | ELF_riscv.cpp | 47 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 *> in getRISCVPCRelHi20()
166 for (Edge &E : B->edges()) in getRISCVPCRelHi20()
173 Expected<const Edge &> getRISCVPCRelHi20(const Edge &E) const { in isAlignmentCorrect()
192 Error applyFixup(LinkGraph &G, Block &B, const Edge &E) const { in applyFixup()
489 SmallVector<Edge *,
[all...] |
| H A D | EHFrameSupport.cpp | 23 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 FromEdgeScan()
668 llvm::sort(Es, [](const Edge *LHS, const Edge *RHS) { in FromEdgeScan()
676 EHFrameCFIBlockInspector::EHFrameCFIBlockInspector(Edge *PersonalityEdge) in EHFrameCFIBlockInspector()
679 EHFrameCFIBlockInspector::EHFrameCFIBlockInspector(Edge &CIEEdge, in EHFrameCFIBlockInspector()
680 Edge &PCBeginEdge, in EHFrameCFIBlockInspector()
[all …]
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SampleProfileInference.cpp | 96 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 SrcEdg in addEdge()
164 for (const auto &Edge : Edges[Src]) { getFlow() local
174 for (const auto &Edge : Edges[Src]) { getFlow() local
221 auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex]; computeAugmentingPathCapacity() local
271 auto &Edge = Edges[Src][EdgeIdx]; findAugmentingPath() local
299 auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex]; augmentFlowAlongPath() local
347 auto &Edge = Edges[NodeIdx][EdgeIdx]; findAugmentingDAG() local
387 for (auto &Edge : Edges[Src]) { findAugmentingDAG() local
410 for (auto &Edge : AugmentingEdges[Src]) { augmentFlowAlongDAG() local
423 for (auto &Edge : AugmentingEdges[Src]) { augmentFlowAlongDAG() local
446 for (auto &Edge : AugmentingEdges[Src]) { augmentFlowAlongDAG() local
465 for (auto &Edge : AugmentingEdges[Src]) { augmentFlowAlongDAG() local
481 for (auto &Edge : AugmentingEdges[Src]) { augmentFlowAlongDAG() local
511 for (auto &Edge : Edges[Src]) { identifyShortestEdges() local
551 struct Edge { global() struct in __anoncacc37820111::MinCostMaxFlow
553 Cost__anoncacc37820111::MinCostMaxFlow::Edge global() argument
555 Capacity__anoncacc37820111::MinCostMaxFlow::Edge global() argument
557 Flow__anoncacc37820111::MinCostMaxFlow::Edge global() argument
559 Dst__anoncacc37820111::MinCostMaxFlow::Edge global() argument
561 RevEdgeIndex__anoncacc37820111::MinCostMaxFlow::Edge global() argument
565 OnShortestPath__anoncacc37820111::MinCostMaxFlow::Edge global() argument
567 AugmentedFlow__anoncacc37820111::MinCostMaxFlow::Edge global() argument
[all...] |
| H A D | CodeLayout.cpp | 325 void addEdge(ChainT *Other, ChainEdge *Edge) { in addEdge()
326 Edges.push_back(std::make_pair(Other, Edge)); in addEdge()
633 for (auto Edge : EdgeCounts) { in initialize() local
634 ++OutDegree[Edge.src]; in initialize()
636 if (Edge.src == Edge.dst) in initialize()
639 SuccNodes[Edge.src].push_back(Edge.dst); in initialize()
640 PredNodes[Edge.dst].push_back(Edge.src); in initialize()
641 if (Edge.count > 0) { in initialize()
642 NodeT &PredNode = AllNodes[Edge.src]; in initialize()
643 NodeT &SuccNode = AllNodes[Edge.dst]; in initialize()
[all …]
|
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 276 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 in scc_member_iterator() local
[all...] |
| /freebsd-src/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | MemProfContextDisambiguation.cpp | 294 for (auto &Edge : *Edges)
295 Count += Edge->getContextIds().size();
297 for (auto &Edge : *Edges)
298 ContextIds.insert(Edge->getContextIds().begin(),
299 Edge->getContextIds().end());
312 for (auto &Edge : *Edges) { in isRemoved()
313 AllocType |= Edge->AllocTypes;
327 for (auto &Edge : *Edges) {
328 if (!Edge->getContextIds().empty())
367 void eraseCalleeEdge(const ContextEdge *Edge);
346 operator <<(raw_ostream & OS,const ContextEdge & Edge) operator <<() argument
813 for (auto &Edge : CallerEdges) { addOrUpdateCallerEdge() local
820 std::shared_ptr<ContextEdge> Edge = std::make_shared<ContextEdge>( addOrUpdateCallerEdge() local
830 auto Edge = *EI; removeNoneTypeCalleeEdges() local
844 for (const auto &Edge : CalleeEdges) findEdgeFromCallee() local
854 for (const auto &Edge : CallerEdges) findEdgeFromCaller() local
862 eraseCalleeEdge(const ContextEdge * Edge) eraseCalleeEdge() argument
873 eraseCallerEdge(const ContextEdge * Edge) eraseCallerEdge() argument
1023 for (const auto &Edge : Node->CallerEdges) { propagateDuplicateContextIds() local
1061 auto Edge = *EI; connectNewNode() local
1116 for (auto &Edge : CallerEdges) { assignStackNodesPostOrder() local
1189 auto *Edge = CurNode->findEdgeFromCallee(PrevNode); assignStackNodesPostOrder() local
1349 auto *Edge = CurNode->findEdgeFromCaller(PrevNode); updateStackNodes() local
1688 auto Edge = *EI; handleCallsitesWithMultipleTargets() local
1731 auto Edge = *EI; calleesMatch() local
2091 for (auto &Edge : CalleeEdges) print() local
2094 for (auto &Edge : CallerEdges) print() local
2146 checkEdge(const std::shared_ptr<ContextEdge<DerivedCCG,FuncTy,CallTy>> & Edge) checkEdge() argument
2166 const auto &Edge = *EI; checkNode() local
2182 const auto &Edge = *EI; checkNode() local
2196 for (auto &Edge : Node->CallerEdges) check() local
2293 auto &Edge = *(ChildIter.getCurrent()); getEdgeAttributes() local
2350 moveEdgeToNewCalleeClone(const std::shared_ptr<ContextEdge> & Edge,EdgeIter * CallerEdgeI) moveEdgeToNewCalleeClone() argument
2364 moveEdgeToExistingCalleeClone(const std::shared_ptr<ContextEdge> & Edge,ContextNode * NewCallee,EdgeIter * CallerEdgeI,bool NewClone) moveEdgeToExistingCalleeClone() argument
2473 for (auto &Edge : CallerEdges) { identifyClones() local
2877 const std::shared_ptr<ContextEdge> &Edge = *EI; assignFunctions() local
3006 auto Edge = *EI; assignFunctions() local
3155 for (auto &Edge : Node->CallerEdges) assignFunctions() local
[all...] |
| /freebsd-src/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | ImmutableGraph.h | 47 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 D | X86LoadValueInjectionLoadHardening.cpp | 120 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 __anon1085d5230111::X86LoadValueInjectionLoadHardeningPass
546 for (const Edge &E : G.edges()) { in elimMitigatedEdgesAndNodes()
551 for (const Edge &DE : Dest->edges()) in elimMitigatedEdgesAndNodes()
570 for (const Edge in elimMitigatedEdgesAndNodes()
[all...] |
| /freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MachineDominators.cpp | 139 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) {
179 Edge.NewBB, Edge.FromBB);
186 Base::getNode(Edge.ToBB), NewDTNode);
|
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 131 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
1212 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} Edge() function
[all...] |
| /freebsd-src/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 41 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 in LazyCallGraph()
[all...] |
| H A D | DDGPrinter.cpp | 130 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 D | BranchProbabilityInfo.cpp | 325 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) cons
751 const LoopEdge Edge{DomLoopBB, LoopBB}; propagateEstimatedBlockWeight() local
895 const LoopEdge Edge{LoopBB, SuccLoopBB}; calcEstimatedHeuristics() local
[all...] |
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Instrumentation/ |
| H A D | CFGMST.h | 39 template <class Edge, class BBInfo> class CFGMST {
44 std::vector<std::unique_ptr<Edge>> AllEdges;
87 void handleCoroSuspendEdge(Edge *E) { in handleCoroSuspendEdge()
122 Edge *EntryIncoming = nullptr, *EntryOutgoing = nullptr, in buildEdges()
183 Edge *ExitO = &addEdge(&BB, nullptr, BBWeight); in buildEdges()
220 llvm::stable_sort(AllEdges, [](const std::unique_ptr<Edge> &Edge1, in sortEdgesByWeight()
221 const std::unique_ptr<Edge> &Edge2) { in sortEdgesByWeight()
276 Edge &addEdge(BasicBlock *Src, BasicBlock *Dest, uint64_t W) { in addEdge()
290 AllEdges.emplace_back(new Edge(Src, Dest, W)); in addEdge()
306 const std::vector<std::unique_ptr<Edge>> &allEdges() const { in allEdges()
[all …]
|
| /freebsd-src/contrib/llvm-project/llvm/lib/LTO/ |
| H A D | SummaryBasedOptimizations.cpp | 53 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()
|