Home
last modified time | relevance | path

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

1234567

/freebsd-14.2/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);
176 static const FixupInfoBase *getDynFixupInfo(Edge::Kind K);
274 Edge::Kind Kind);
278 Edge::Kind Kind);
287 Edge::OffsetT Offset, Edge::Kind Kind,
315 Edge::Kind Kind = E.getKind();
335 bool visitEdge(LinkGraph &G, Block *B, Edge &E);
356 bool visitEdge(LinkGraph &G, Block *B, Edge &E);
[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 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,
391 const char *getEdgeKindName(Edge::Kind K);
394 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup()
571 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
572 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
598 assert(KindToSet != Edge::Invalid && in visitEdge()
631 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;
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 Driscv.h24 enum EdgeKind_riscv : Edge::Kind {
32 R_RISCV_32 = Edge::FirstRelocation,
227 const char *getEdgeKindName(Edge::Kind K);
/freebsd-14.2/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DEHFrameSupportImpl.h32 Edge::Kind Pointer32, Edge::Kind Pointer64,
33 Edge::Kind Delta32, Edge::Kind Delta64,
34 Edge::Kind NegDelta32);
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;
113 Edge::Kind Delta64;
[all …]
H A DELF_aarch64.cpp40 Error applyFixup(LinkGraph &G, Block &B, const Edge &E) const { in applyFixup()
48 enum ELFAArch64RelocationKind : Edge::Kind {
49 ELFCall26 = Edge::FirstRelocation,
179 Edge::OffsetT Offset = FixupAddress - BlockToFix.getAddress(); in addSingleRelocation()
185 Edge::Kind Kind = Edge::Invalid; in addSingleRelocation()
365 Edge GE(Kind, Offset, *GraphSymbol, Addend); in addSingleRelocation()
378 const char *getELFAArch64RelocationKindName(Edge::Kind R) { in getELFAArch64RelocationKindName()
425 return getGenericEdgeKindName(static_cast<Edge::Kind>(R)); in getELFAArch64RelocationKindName()
489 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge()
490 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
[all …]
H A Daarch32.cpp240 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()
471 Edge::Kind Kind = E.getKind(); in applyFixupData()
525 Edge::Kind Kind = E.getKind(); in applyFixupArm()
601 Edge::Kind Kind = E.getKind(); in applyFixupThumb()
723 Edge::Kind KindToSet = Edge::Invalid; in visitEdge()
801 static bool needsStub(const Edge &E) { in needsStub()
[all …]
H A DELF_riscv.cpp66 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()
136 static Expected<const Edge &> getRISCVPCRelHi20(const Edge &E) { in getRISCVPCRelHi20()
487 SmallVector<Edge *, 0> RelaxEdges;
492 SmallVector<Edge::Kind, 0> EdgeKinds;
514 static bool isRelaxable(const Edge &E) { in isRelaxable()
702 case Edge::Invalid: in finalizeBlockRelax()
744 if (Aux.EdgeKinds[I] != Edge::Invalid) in finalizeBlockRelax()
973 ".eh_frame", G->getPointerSize(), Edge::Invalid, Edge::Invalid, in link_ELF_riscv()
[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 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-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp116 TotalCost += Edge.Cost * Edge.Flow; in run()
137 Edge SrcEdge; in addEdge()
144 Edge DstEdge; in addEdge()
166 Flow.push_back(std::make_pair(Edge.Dst, Edge.Flow)); in getFlow()
272 if (Edge.Flow < Edge.Capacity) { in findAugmentingPath()
482 assert(uint64_t(Edge->Capacity - Edge->Flow) >= Edge->AugmentedFlow); in augmentFlowAlongDAG()
484 auto &RevEdge = Edges[Edge->Dst][Edge->RevEdgeIndex]; in augmentFlowAlongDAG()
485 Edge->Flow += Edge->AugmentedFlow; in augmentFlowAlongDAG()
487 if (Edge->Capacity == Edge->Flow && Edge->AugmentedFlow > 0) in augmentFlowAlongDAG()
517 Edge.Capacity > Edge.Flow && in identifyShortestEdges()
[all …]
H A DCodeLayout.cpp634 ++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()
1156 Queue.insert(Edge); in mergeChainPairs()
1185 if (Edge->srcChain()->numBlocks() + Edge->dstChain()->numBlocks() > in mergeChainPairs()
1194 Queue.insert(Edge); in mergeChainPairs()
1438 for (auto Edge : EdgeCounts) in calcExtTspScore() local
1439 ++OutDegree[Edge.src]; in calcExtTspScore()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h333 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
352 NodeInfoMap[Edge->Target].IncomingMSTEdges.insert(Edge); in scc_member_iterator()
356 for (auto *Edge : SortedEdges) { in scc_member_iterator()
359 Queue.push(Edge->Source); in scc_member_iterator()
369 NodeInfoMap[Edge.Target].IncomingMSTEdges.erase(&Edge); in scc_member_iterator()
370 if (MSTEdges.count(&Edge) && in scc_member_iterator()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMemProfContextDisambiguation.cpp347 Edge.print(OS); in operator <<()
833 Edge->Callee->eraseCallerEdge(Edge.get()); in removeNoneTypeCalleeEdges()
1090 Edge->Callee->eraseCallerEdge(Edge.get()); in connectNewNode()
1093 Edge->Caller->eraseCalleeEdge(Edge.get()); in connectNewNode()
1118 if (!Edge) in assignStackNodesPostOrder()
1190 if (!Edge) { in assignStackNodesPostOrder()
1731 auto Edge = *EI; in calleesMatch() local
1762 Callee, Caller, Edge->AllocTypes, Edge->ContextIds); in calleesMatch()
1809 Edge->Callee->eraseCallerEdge(Edge.get()); in calleesMatch()
2475 if (Edge->Callee == nullptr && Edge->Caller == nullptr) { in identifyClones()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineDominators.cpp103 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
105 MachineBasicBlock *Succ = Edge.ToBB; in applySplitCriticalEdges()
109 if (PredBB == Edge.NewBB) in applySplitCriticalEdges()
139 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
141 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB); in applySplitCriticalEdges()
147 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode); in applySplitCriticalEdges()
/freebsd-14.2/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.cpp120 using Edge = typename GraphT::Edge; typedef
151 using Edge = MachineGadgetGraph::Edge; typedef in __anon2f1af8870111::X86LoadValueInjectionLoadHardeningPass
547 for (const Edge &E : G.edges()) { in elimMitigatedEdgesAndNodes()
552 for (const Edge &DE : Dest->edges()) in elimMitigatedEdgesAndNodes()
581 for (const Edge &E : RootN.edges()) { in elimMitigatedEdgesAndNodes()
634 for (const Edge &E : Graph->edges()) { in hardenLoadsWithPlugin()
675 for (const Edge &E : Graph->edges()) in hardenLoadsWithHeuristic()
688 for (const Edge &E : N.edges()) { in hardenLoadsWithHeuristic()
708 for (const Edge *E : EdgesToCut) in hardenLoadsWithHeuristic()
728 for (const Edge &E : N.edges()) { in insertFences()
[all …]
/freebsd-14.2/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()
299 void setEdgeKind(Node &ChildN, Edge::Kind EK);
1211 inline LazyCallGraph::Edge::Edge() = default;
1212 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} in Edge() function
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp252 for (Edge &E : **N) in verify()
361 for (Edge &E : *N) { in verify()
407 for (Edge &E : *N) in isParentOf()
429 for (Edge &E : *N) { in isAncestorOf()
649 for (Edge &E : *N) { in switchInternalEdgeToCall()
1029 for (Edge &E : *N) in insertIncomingRefEdge()
1411 E.setKind(Edge::Call); in insertTrivialCallEdge()
1629 for (Edge &E : *NewN) { in addSplitFunction()
1642 for (Edge &E : *NewN) { in addSplitFunction()
1714 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.cpp326 const auto &SrcBlock = Edge.first; in isLoopEnteringEdge()
327 const auto &DstBlock = Edge.second; in isLoopEnteringEdge()
336 return isLoopEnteringEdge({Edge.second, Edge.first}); in isLoopExitingEdge()
340 const LoopEdge &Edge) const { in isLoopEnteringExitingEdge()
341 return isLoopEnteringEdge(Edge) || isLoopExitingEdge(Edge); in isLoopEnteringExitingEdge()
345 const auto &SrcBlock = Edge.first; in isLoopBackEdge()
346 const auto &DstBlock = Edge.second; in isLoopBackEdge()
665 return isLoopEnteringEdge(Edge) in getEstimatedEdgeWeight()
759 } else if (isLoopExitingEdge(Edge)) { in propagateEstimatedBlockWeight()
897 Weight = getEstimatedEdgeWeight(Edge); in calcEstimatedHeuristics()
[all …]
/freebsd-14.2/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 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-14.2/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()

1234567