Home
last modified time | relevance | path

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

12345

/netbsd-src/external/apache2/llvm/dist/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()
280 std::vector<Edge> SortedEdges; in dump()
282 llvm::sort(SortedEdges, [](const Edge &LHS, const Edge &RHS) { in dump()
359 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()
402 Edge GE(Kind, FixupAddress - BlockToFix->getAddress(), *TargetSymbol, in addRelocations()
424 bool isGOTEdgeToFix(Edge &E) const { in isGOTEdgeToFix()
434 void fixGOTEdge(Edge &E, Symbol &GOTEntry) { in fixGOTEdge()
450 bool isExternalBranchEdge(Edge &E) { in isExternalBranchEdge()
459 void fixPLTEdge(Edge &E, Symbol &Stub) { in fixPLTEdge()
580 Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup()
H A DMachO_arm64.cpp102 parsePairRelocation(Block &BlockToFix, Edge::Kind SubtractorKind, in parsePairRelocation()
392 Edge GE(*Kind, FixupAddress - BlockToFix->getAddress(), *TargetSymbol, in addRelocations()
415 bool isGOTEdgeToFix(Edge &E) const { in isGOTEdgeToFix()
428 void fixGOTEdge(Edge &E, Symbol &GOTEntry) { in fixGOTEdge()
439 bool isExternalBranchEdge(Edge &E) { in isExternalBranchEdge()
452 void fixPLTEdge(Edge &E, Symbol &Stub) { in fixPLTEdge()
529 Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup()
699 const char *getMachOARM64RelocationKindName(Edge::Kind R) { in getMachOARM64RelocationKindName()
730 return getGenericEdgeKindName(static_cast<Edge::Kind>(R)); in getMachOARM64RelocationKindName()
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 DEHFrameSupport.cpp124 unsigned PointerSize, Edge::Kind Delta64, in EHFrameEdgeFixer()
125 Edge::Kind Delta32, Edge::Kind NegDelta32) in EHFrameEdgeFixer()
469 Edge::Kind PCBeginEdgeKind = PCBeginPtrInfo->second; in processFDE()
513 PCBeginBlock->addEdge(Edge::KeepAlive, 0, FDESymbol, 0); in processFDE()
535 Edge::Kind LSDAEdgeKind = LSDAPointerInfo->second; in processFDE()
649 Expected<std::pair<JITTargetAddress, Edge::Kind>>
668 Edge::Kind PointerEdgeKind; in readEncodedPointer()
704 if (PointerEdgeKind == Edge::Invalid) in readEncodedPointer()
/netbsd-src/external/apache2/llvm/dist/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 makeArrayRef(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.cpp121 using Edge = typename GraphT::Edge; typedef
124 std::unique_ptr<Edge[]> Edges, size_type NodesSize, in MachineGadgetGraph()
128 static inline bool isCFGEdge(const Edge &E) { in isCFGEdge()
131 static inline bool isGadgetEdge(const Edge &E) { in isGadgetEdge()
152 using Edge = MachineGadgetGraph::Edge; typedef in __anonfec41a3c0111::X86LoadValueInjectionLoadHardeningPass
548 for (const Edge &E : G.edges()) { in elimMitigatedEdgesAndNodes()
553 for (const Edge &DE : Dest->edges()) in elimMitigatedEdgesAndNodes()
572 for (const Edge &E : N->edges()) { in elimMitigatedEdgesAndNodes()
582 for (const Edge &E : RootN.edges()) { in elimMitigatedEdgesAndNodes()
636 for (const Edge &E : Graph->edges()) { in hardenLoadsWithPlugin()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DLazyCallGraph.cpp44 Edge::Kind EK) { in insertEdgeInternal()
49 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()
58 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
63 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge()
65 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { in addEdge()
70 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
109 LazyCallGraph::Edge::Call); in populateSlow()
123 LazyCallGraph::Edge::Ref); in populateSlow()
131 LazyCallGraph::Edge::Ref); in populateSlow()
177 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref); in LazyCallGraph()
[all …]
H A DBranchProbabilityInfo.cpp252 bool BranchProbabilityInfo::isLoopEnteringEdge(const LoopEdge &Edge) const { in isLoopEnteringEdge()
253 const auto &SrcBlock = Edge.first; in isLoopEnteringEdge()
254 const auto &DstBlock = Edge.second; in isLoopEnteringEdge()
262 bool BranchProbabilityInfo::isLoopExitingEdge(const LoopEdge &Edge) const { in isLoopExitingEdge()
263 return isLoopEnteringEdge({Edge.second, Edge.first}); in isLoopExitingEdge()
267 const LoopEdge &Edge) const { in isLoopEnteringExitingEdge()
268 return isLoopEnteringEdge(Edge) || isLoopExitingEdge(Edge); in isLoopEnteringExitingEdge()
271 bool BranchProbabilityInfo::isLoopBackEdge(const LoopEdge &Edge) const { in isLoopBackEdge()
272 const auto &SrcBlock = Edge.first; in isLoopBackEdge()
273 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()
/netbsd-src/external/apache2/llvm/dist/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()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h133 class Edge {
138 Edge();
139 explicit Edge(Node &N, Kind K);
189 using VectorT = SmallVector<Edge, 4>;
190 using VectorImplT = SmallVectorImpl<Edge>;
259 Edge &operator[](Node &N) {
266 Edge *lookup(Node &N) { in lookup()
298 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);
301 void setEdgeKind(Node &ChildN, Edge::Kind EK);
747 void insertOutgoingEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]
H A DBranchProbabilityInfo.h324 using Edge = std::pair<const BasicBlock *, unsigned>; variable
326 DenseMap<Edge, BranchProbability> Probs;
350 bool isLoopEnteringEdge(const LoopEdge &Edge) const;
354 bool isLoopExitingEdge(const LoopEdge &Edge) const;
357 bool isLoopEnteringExitingEdge(const LoopEdge &Edge) const;
360 bool isLoopBackEdge(const LoopEdge &Edge) const;
378 Optional<uint32_t> getEstimatedEdgeWeight(const LoopEdge &Edge) const;
/netbsd-src/external/apache2/llvm/dist/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()
/netbsd-src/external/apache2/llvm/dist/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()
/netbsd-src/external/apache2/llvm/dist/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;
222 void SampleProfileLoaderBaseImpl<BT>::printEdgeWeight(raw_ostream &OS, Edge E) {
508 uint64_t SampleProfileLoaderBaseImpl<BT>::visitEdge(Edge E,
510 Edge *UnknownEdge) {
550 Edge UnknownEdge, SelfReferentialEdge, SingleEdge;
556 Edge E = std::make_pair(Pred, BB);
[all …]
/netbsd-src/crypto/dist/ipsec-tools/src/racoon/rfc/
H A Ddraft-ietf-ipsec-isakmp-hybrid-auth-05.txt47 entity, typically an Edge Device (e.g. firewall), authenticates using
123 stages. The first stage is used to authenticate the Edge Device and
158 participants in the IKE is a User, while the other is an Edge Device
184 consists of three messages: a challenge by the Edge Device; a
186 success/failure) sent by the Edge Device. However, in many cases the
192 authenticate the Edge Device and to establish an IKE SA. In the
201 used by the Edge Devices. In that case, the situation resembles the
208 Edge Devices) is possible without a full-public key infrastructure
211 In some scenarios, security policy on the Edge Device might call for
219 User and an Edge Device. The participants start to negotiate, using
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ExecutionEngine/JITLink/
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()
/netbsd-src/external/apache2/llvm/dist/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()
/netbsd-src/external/apache2/llvm/dist/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()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dcfg-flags.def117 /* Edge out of a basic block that ends with a CALL_INSN with abnormal
142 /* Edge in a part of the CFG that is an irreducible loop. */
145 /* Edge taken when controlling predicate is nonzero.
149 /* Edge taken when controlling predicate is zero.
153 /* Edge is executable. This is only used in GIMPLE SSA-CCP and VRP.
157 /* Edge crosses between hot and cold sections, when we do partitioning.
161 /* Edge from a sibcall CALL_INSN to exit.

12345