Home
last modified time | relevance | path

Searched full:edge (Results 1 – 25 of 1316) sorted by relevance

12345678910>>...53

/freebsd-src/contrib/bmake/unit-tests/
H A Dvarmod-edge.exp1 make: "varmod-edge.mk" line 60: while evaluating variable "MOD" with value "${INP:M${:U*)}}": while evaluating variable "INP" with value "(parentheses)": while evaluating "${:U*)" with value "*)": Unclosed expression, expecting '}' for modifier "U*)"
2 make: "varmod-edge.mk" line 88: while evaluating variable "MOD" with value "${INP:M${:U[[}}": while evaluating variable "INP" with value "[ [[ [[[": Unfinished character list in pattern '[[' of modifier ':M'
3 make: "varmod-edge.mk" line 178: while evaluating variable "MOD" with value "${INP:a\=b}": while evaluating variable "INP" with value "file.c file...": Unfinished modifier ('=' missing)
4 make: "varmod-edge.mk" line 194: while evaluating variable "MOD" with value "${INP::::}": while evaluating variable "INP" with value "value": Unknown modifier ":"
5 make: "varmod-edge.mk" line 194: while evaluating variable "MOD" with value "${INP::::}": while evaluating variable "INP" with value "": Unknown modifier ":"
6 make: "varmod-edge.mk" line 203: while evaluating "${:Z}" with value "": Unknown modifier "Z"
7 make: "varmod-edge.mk" line 203: Malformed conditional (${:Z})
8 make: "varmod-edge.mk" line 217: while evaluating "${:S,}" with value "": Unfinished modifier (',' missing)
9 make: "varmod-edge.mk" line 217: Malformed conditional (${:S,})
/freebsd-src/contrib/unbound/edns-subnet/
H A Daddrtree.c46 * Create a new edge
47 * @param node: Child node this edge will connect to.
48 * @param addr: full key to this edge.
59 struct addredge *edge = (struct addredge *)malloc( sizeof (*edge) ); in edge_create() local
60 if (!edge) in edge_create()
62 edge->node = node; in edge_create()
63 edge->len = addrlen; in edge_create()
64 edge->parent_index = parent_index; in edge_create()
65 edge->parent_node = parent_node; in edge_create()
68 edge->str = (addrkey_t *)calloc(n, sizeof (addrkey_t)); in edge_create()
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h36 /// Returns a value representing an invalid (non-existent) edge.
82 // 1) Update the adj index of the edge currently at back(). in removeAdjEdgeId()
83 // 2) Move last Edge down to Idx. in removeAdjEdgeId()
113 "Edge already connected to NIds[NIdx]."); in connectToN()
127 assert(NId == NIds[1] && "Edge not connected to NId"); in setAdjEdgeIdx()
134 "Edge not connected to NIds[NIdx]."); in disconnectFromN()
144 assert(NId == NIds[1] && "Edge does not connect NId"); in disconnectFrom()
207 "Attempt to add duplicate edge."); in addConstructedEdge()
220 // Add the edge to the adjacency sets of its nodes. in addConstructedEdge()
264 this->CurEId = findNextInUse(CurEId); // Move to first in-use edge id in EdgeItr()
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp11 // and edge counts that satisfy flow conservation rules, while minimally modify
67 /// A value indicating an infinite flow/capacity/weight of a block/edge.
84 /// of nodes (source and sink). The output is the flow along each edge of the
85 /// minimum total cost respecting the given edge capacities.
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 in run()
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...]
/freebsd-src/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DEHFrameSupportImpl.h28 /// Create an eh-frame edge fixer.
29 /// If a given edge-kind is not supported on the target architecture then
30 /// 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::OffsetT> Multiple;
[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()
54 // these for finding / building edge targets when processing FDEs. in operator ()()
325 dbgs() << " Adding edge at " in processFDE()
337 dbgs() << " Already has edge at " in processFDE()
344 "CIE edge at " + in processFDE()
364 // Add a keep-alive edge from the FDE target to the FDE to ensure that the in processFDE()
367 dbgs() << " Adding keep-alive edge from target at " in processFDE()
371 (*PCBegin)->getBlock().addEdge(Edge::KeepAlive, 0, FDESymbol, 0); in processFDE()
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DEHFrameSupport.h32 /// Zero or one outgoing edges: Record is CIE. If present, edge points to
35 /// Two or three outgoing edges: Record is an FDE. First edge points to CIE,
47 /// If this is a CIE record, returns the Edge pointing at the personality
50 Edge *getPersonalityEdge() const { in getPersonalityEdge()
55 /// If this is an FDE record, returns the Edge pointing to the CIE.
60 Edge *getCIEEdge() const { return CIEEdge; } in getCIEEdge()
62 /// If this is an FDE record, returns the Edge pointing at the PC-begin
65 Edge *getPCBeginEdge() const { return PCBeginEdge; } in getPCBeginEdge()
67 /// If this is an FDE record, returns the Edge pointing at the LSDA, if any.
69 Edge *getLSDAEdge() const { in getLSDAEdge()
[all …]
H A Daarch32.h30 enum EdgeKind_aarch32 : Edge::Kind {
36 FirstDataRelocation = Edge::FirstRelocation,
122 /// Get a human-readable name for the given AArch32 edge kind.
123 const char *getEdgeKindName(Edge::Kind K);
176 static const FixupInfoBase *getDynFixupInfo(Edge::Kind K);
180 /// FixupInfo checks for Arm edge kinds work on 32-bit words
185 /// FixupInfo check for Thumb32 edge kinds work on a pair of 16-bit halfwords
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,
[all …]
H A Dx86_64.h1 //===-- x86_64.h - Generic JITLink x86-64 edge kinds, utilities -*- C++ -*-===//
23 /// Represents x86-64 fixups and other x86-64-specific edge kinds.
24 enum EdgeKind_x86_64 : Edge::Kind {
31 Pointer64 = Edge::FirstRelocation,
194 /// This edge kind has the same fixup expression as BranchPCRel32, but further
211 /// The edge kind has the same fixup expression as BranchPCRel32ToPtrJumpStub,
228 /// Indicates that this edge should be transformed into a Delta32 targeting
229 /// the GOT entry for the edge's current target, maintaining the same addend.
248 /// Indicates that this edge should be transformed into a Delta64 targeting
249 /// the GOT entry for the edge'
[all...]
H A Di386.h1 //=== i386.h - Generic JITLink i386 edge kinds, utilities -*- C++ -*-===//
21 enum EdgeKind_i386 : Edge::Kind {
24 None = Edge::FirstRelocation,
111 /// Indicates that this edge should be transformed into a Delta32FromGOT
112 /// targeting the GOT entry for the edge's current target, maintaining the
160 /// This edge kind has the same fixup expression as BranchPCRel32, but further
177 /// The edge kind has the same fixup expression as BranchPCRel32ToPtrJumpStub,
192 /// Returns a string name for the given i386 edge. For debugging purposes
194 const char *getEdgeKindName(Edge::Kind K);
196 /// Apply fixup expression for edge to block content.
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h27 /// potential-call-edge graph.
69 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
70 /// DAG. That is, no optimizations will delete, remove, or add an edge such
84 /// an indirect call edge. Another way to think about it is that it represents
87 /// of a function to be an edge in the call graph because this might be
96 /// form even a potential call edge from a function body which may dynamically
129 /// node. This allows the edge structure itself to be a very compact data
131 class Edge {
133 /// The kind of edge in the graph.
136 Edge();
1212 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} Edge() function
[all...]
H A DBranchProbabilityInfo.h45 /// probabilities of each "edge" in the function's CFG where such an edge is
47 /// probability of an edge from one block is always relative to the
51 /// identify an edge, since we can have multiple edges from Src to Dst.
152 /// Get an edge's probability, relative to other out-edges of the Src.
155 /// (0%) and one (100%) of this edge executing, relative to other edges
170 /// Test if an edge is hot relative to other out-edges of the Src.
172 /// Check whether this edge out of the source block is 'hot'. We define hot
176 /// Print an edge's probability.
178 /// Retrieves an edge'
328 using Edge = std::pair<const BasicBlock *, unsigned>; global() variable
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h15 /// edge to a node in SCC S2, then it visits S1 *after* S2.
135 /// still contain a cycle if the node has an edge back to itself.
242 /// Sort the nodes of a directed SCC in the decreasing order of the edge
243 /// weights. The instantiating GraphT type should have weighted edge type
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()
280 // If the edge forms a cycle, do not add it to MST in unionGroups()
331 for (auto &Edge : Node->Edges) { in scc_member_iterator()
332 if (NodeInfoMap.count(Edge in scc_member_iterator()
351 for (const auto *Edge : MSTEdges) scc_member_iterator() local
[all...]
H A DDirectedGraph.h26 /// Represent an edge in the directed graph.
27 /// The edge contains the target node it connects to.
31 /// Create an edge pointing to the given node \p N.
47 /// Retrieve the target node this edge connects to.
54 /// Set the target node this edge connects to.
67 // The target node this edge connects to.
79 /// Create a node with a single outgoing edge \p E.
114 /// Return true if at least one edge was found, and false otherwise.
115 /// Note that this implementation allows more than one edge to connect
125 /// Add the given edge \p E to this node, if it doesn't exist already. Returns
[all …]
/freebsd-src/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()
93 // of the "suspend" edge to max, and in handleCoroSuspendEdge()
94 // 2. we mark the edge as "Removed" to guarantee it is not considered in handleCoroSuspendEdge()
114 LLVM_DEBUG(dbgs() << "Build Edge on " << F.getName() << "\n"); in buildEdges()
122 Edge *EntryIncoming = nullptr, *EntryOutgoing = nullptr, in buildEdges()
126 // Add a fake edge to the entry. 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()
[all …]
/freebsd-src/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()
89 // edge. Even if the function's definition is subject to replacement by in populateSlow()
97 // safety of optimizing a direct call edge. in populateSlow()
106 LazyCallGraph::Edge::Call); in populateSlow()
120 LazyCallGraph::Edge in populateSlow()
[all...]
H A DDomTreeUpdater.cpp257 auto Edge = std::make_pair(U.getFrom(), U.getTo()); applyUpdatesPermissive() local
/freebsd-src/contrib/ldns/
H A Dradix.c212 prefix->array[0].edge = add; in ldns_radix_insert()
268 prefix->array[byte].edge = add; in ldns_radix_insert()
269 } else if (prefix->array[byte-prefix->offset].edge == NULL) { in ldns_radix_insert()
291 prefix->array[byte].edge = add; in ldns_radix_insert()
368 node = node->array[byte].edge; in ldns_radix_search()
417 if (!node->array[byte].edge) { in ldns_radix_find_less_equal()
436 node->array[byte].edge); in ldns_radix_find_less_equal()
439 *result = ldns_radix_last_in_subtree_incl_self(node->array[byte].edge); in ldns_radix_find_less_equal()
441 *result = ldns_radix_prev(node->array[byte].edge); in ldns_radix_find_less_equal()
450 node->array[byte].edge); in ldns_radix_find_less_equal()
[all …]
/freebsd-src/sys/contrib/device-tree/Bindings/net/
H A Dmscc-phy-vsc8531.txt7 with the 'edge-slowdown' property.
9 - vsc8531,edge-slowdown : % the edge should be slowed down relative to
10 the fastest possible edge time.
11 Edge rate sets the drive strength of the MAC
13 drive strength will affect the edge rate of
17 and in effect slow down the edge rate if
19 To adjust the edge-slowdown, the 'vddmac'
21 supported edge-slowdown values for a given
24 Ref: Table:1 - Edge rate change (below).
38 Table: 1 - Edge rate change
[all …]
/freebsd-src/sys/contrib/device-tree/Bindings/remoteproc/
H A Dqcom,smd-edge.yaml4 $id: http://devicetree.org/schemas/remoteproc/qcom,smd-edge.yaml#
7 title: Qualcomm SMD Edge communication channel nodes
14 some sort - or in SMD language an "edge". The name of the edges are not
18 that "edge". The names of the devices are not important. The properties of
24 const: smd-edge
45 Name of the edge, used for debugging and identification purposes. The
66 qcom,smd-edge:
94 - qcom,smd-edge
112 smd-edge {
116 qcom,smd-edge
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMemProfContextDisambiguation.cpp286 // Compute the context ids for this node from the union of its edge context in getOrigNode()
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());
303 // Compute the allocation type for this node from the OR of its edge
312 for (auto &Edge : *Edges) { in isRemoved()
313 AllocType |= Edge->AllocTypes;
321 // The context ids set for this node is empty if its edge contex in operator <<()
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 DImmutableGraph.h16 /// implemented as a bit vector, wherein each bit corresponds to one edge in
17 /// the edge array. This implies a lower bound of 64x spatial improvement
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()
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileLoaderBaseImpl.h207 using Edge = std::pair<const BasicBlockT *, const BasicBlockT *>;
208 using EdgeWeightMap = DenseMap<Edge, uint64_t>;
238 void printEdgeWeight(raw_ostream &OS, Edge E);
250 uint64_t visitEdge(Edge E, unsigned *NumUnknownEdges, Edge *UnknownEdge);
273 /// Edge weights are computed by propagating basic block weights in
281 SmallSet<Edge, 32> VisitedEdges;
354 /// Print the weight of edge \p E on stream \p OS.
357 /// \param E Edge to print.
359 void SampleProfileLoaderBaseImpl<BT>::printEdgeWeight(raw_ostream &OS, Edge
[all...]
/freebsd-src/sys/contrib/device-tree/Bindings/soc/fsl/cpm_qe/
H A Dfsl,cpm1-tsa.yaml96 fsl,clock-falling-edge:
99 Data is sent on falling edge of the clock (and received on the rising
100 edge). If 'clock-falling-edge' is not present, data is sent on the
101 rising edge (and received on the falling edge).
103 fsl,fsync-rising-edge:
106 Frame sync pulses are sampled with the rising edge of the channel
107 clock. If 'fsync-rising-edge' is not present, pulses are sampled with
108 the falling edge.
193 fsl,fsync-rising-edge;
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h40 // same caller. Edge weights are not considered either because for the same
41 // callee only the edge with the largest weight is added to the edge set.
49 using edge = ProfiledCallGraphEdge; member
50 using edges = std::set<edge, ProfiledCallGraphEdgeComparer>;
107 // Fetch edge weight from the profile.
156 ProfiledCallGraphEdge Edge(ProfiledFunctions[CallerName],
159 auto EdgeIt = Edges.find(Edge);
161 Edges.insert(Edge);
163 // Accumulate weight to the existing edge.
164 Edge.Weight += EdgeIt->Weight;
[all …]

12345678910>>...53