Home
last modified time | relevance | path

Searched +full:- +full:edge (Results 1 – 25 of 1041) sorted by relevance

12345678910>>...42

/freebsd/contrib/bmake/unit-tests/
H A Dsuff.exp9 Global: .ALLTARGETS = step1 edge-case.to everything ${.PREFIX}${.ARCHIVE}.additional
10 Global: .ALLTARGETS = step1 edge-case.to everything ${.PREFIX}${.ARCHIVE}.additional edge-case.from
11 Global: .ALLTARGETS = step1 edge-case.to everything ${.PREFIX}${.ARCHIVE}.additional edge-case.fro…
12 Global: .ALLTARGETS = step1 edge-case.to everything ${.PREFIX}${.ARCHIVE}.additional edge-case.fro…
21 Global: MFLAGS = -r -k -d sv
38 Global: .ALLTARGETS = step1 edge-case.to everything ${.PREFIX}${.ARCHIVE}.additional edge-case.fro…
46 Wildcard expanding "edge-case.to"...suffix is ".to"...
47 edge-case.to: @ = edge-case.to
48 edge-case.to: @ = edge-case.to
49 edge-case.to: * = edge-case.to
[all …]
/freebsd/contrib/unbound/edns-subnet/
H A Daddrtree.c2 * edns-subnet/addrtree.c -- radix tree for edns subnet cache.
36 * addrtree -- radix tree for edns subnet cache.
46 * 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()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h1 //===- Graph.h - PBQP Graph -------------------------------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
31 /// Returns a value representing an invalid (non-existent) node.
36 /// Returns a value representing an invalid (non-existent) edge.
81 // Swap-and-pop for fast removal. in removeAdjEdgeId()
82 // 1) Update the adj index of the edge currently at back(). in removeAdjEdgeId()
83 // 2) Move last Edge down to Idx. in removeAdjEdgeId()
85 // If Idx == size() - 1 then the setAdjEdgeIdx and swap are in removeAdjEdgeId()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp1 //===- SampleProfileInference.cpp - Adjust sample profiles in the IR ------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 // and edge counts that satisfy flow conservation rules, while minimally modify
14 //===----------------------------------------------------------------------===//
26 #define DEBUG_TYPE "sample-profile-inference"
31 "sample-profile-even-flow-distribution", cl::init(true), cl::Hidden,
36 "sample-profile-rebalance-unknown", cl::init(true), cl::Hidden,
37 cl::desc("Evenly re-distribute flow among unknown subgraphs."));
40 "sample-profile-join-islands", cl::init(true), cl::Hidden,
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DEHFrameSupport.h1 //===--------- EHFrameSupport.h - JITLink eh-frame utils --------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
24 /// Inspect an eh-frame CFI record.
32 /// 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,
36 /// second to PC-begin, third (if present) to LSDA.
47 /// If this is a CIE record, returns the Edge pointing at the personality
50 Edge *getPersonalityEdge() const { in getPersonalityEdge()
[all …]
H A Dx86_64.h1 //===-- x86_64.h - Generic JITLink x86-64 edge kinds, utilities -*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
9 // Generic utilities for graphs representing x86-64 objects.
11 //===----------------------------------------------------------------------===//
23 /// Represents x86-64 fixups and other x86-64-specific edge kinds.
24 enum EdgeKind_x86_64 : Edge::Kind {
26 /// A plain 64-bit pointer value relocation.
29 /// Fixup <- Target + Addend : uint64
31 Pointer64 = Edge::FirstRelocation,
[all …]
H A Di386.h1 //=== i386.h - Generic JITLink i386 edge kinds, utilities -*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
21 enum EdgeKind_i386 : Edge::Kind {
24 None = Edge::FirstRelocation,
26 /// A plain 32-bit pointer value relocation.
29 /// Fixup <- Target + Addend : uint32
32 /// - The target must reside in the low 32-bits of the address space,
33 /// otherwise an out-of-range error will be returned.
[all …]
H A Daarch32.h1 //===------ aarch32.h - Generic JITLink arm/thumb utilities ---
[all...]
H A Dppc64.h1 //===--- ppc64.h - Generic JITLink ppc64 edge kinds, utilities --*- C++ -*-
[all...]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h1 //===- LazyCallGraph.h - Analysis of a Module's call graph ------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
27 /// potential-call-edge graph.
32 //===----------------------------------------------------------------------===//
67 /// attempting to maintain is that function-local optimization, CGSCC-local
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
71 /// that functions already visited in a bottom-up order of the SCC DAG are no
73 /// a bottom-up order of the SCC DAG are not required to have already been
[all …]
H A DGenericDomTreeUpdaterImpl.h1 //===- GenericDomTreeUpdaterImpl.h ------------------------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 // - llvm/lib/Analysis/DomTreeUpdater.cpp
13 // - llvm/lib/CodeGen/MachineDomTreeUpdater.cpp
15 //===----------------------------------------------------------------------===//
31 DT->recalculate(F); in recalculate()
33 PDT->recalculate(F); in recalculate()
43 // Because all trees are going to be up-to-date after recalculation, in recalculate()
47 DT->recalculate(F); in recalculate()
[all …]
H A DBranchProbabilityInfo.h1 //===- BranchProbabilityInfo.h - Branch Probability Analysis ----*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
45 /// 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.
97 /// P(BB1->BB2) = COLD_WEIGHT/(COLD_WEIGHT + DEFAULT_WEIGHT) =
99 /// P(BB1->BB3) = DEFAULT_WEIGHT_WEIGHT/(COLD_WEIGHT + DEFAULT_WEIGHT) =
101 /// P(BB2->ColdBB) = COLD_WEIGHT/(COLD_WEIGHT + UNREACHABLE_WEIGHT) = 1(100%)
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DEHFrameSupportImpl.h1 //===------- EHFrameSupportImpl.h - JITLink eh-frame utils -
[all...]
H A DEHFrameSupport.cpp1 //===-------- JITLink_EHFrameSupport.cpp - JITLink eh-fram
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp1 //===- LazyCallGraph.cpp - Analysis of a Module's call graph --------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
41 Edge::Kind EK) { in insertEdgeInternal()
46 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()
47 Edges[EdgeIndexMap.find(&TargetN)->second].setKind(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()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h1 //===- ADT/SCCIterator.h - Strongly Connected Comp. Iter. -------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
15 /// edge to a node in SCC S2, then it visits S1 *after* S2.
20 //===----------------------------------------------------------------------===//
45 /// iterator and thus you cannot backtrack or re-visit nodes.
74 /// nodeVisitNumbers are per-node visit numbers, also used as DFS flags.
88 /// A single "visit" within the non-recursive DFS traversal.
91 /// The stack-based DFS traversal; defined below.
135 /// still contain a cycle if the node has an edge back to itself.
[all …]
H A DDirectedGraph.h1 //===- llvm/ADT/DirectedGraph.h - Directed Graph ----------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
13 //===----------------------------------------------------------------------===//
26 /// 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.
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMemProfContextDisambiguation.cpp1 //==-- MemProfContextDisambiguation.cpp - Disambiguate contexts -------------=//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
21 //===----------------------------------------------------------------------===//
54 #define DEBUG_TYPE "memprof-context-disambiguation"
94 "memprof-dot-file-path-prefix", cl::init(""), cl::Hidden,
98 static cl::opt<bool> ExportToDot("memprof-export-to-dot", cl::init(false),
103 DumpCCG("memprof-dump-ccg", cl::init(false), cl::Hidden,
107 VerifyCCG("memprof-verify-ccg", cl::init(false), cl::Hidden,
111 VerifyNodes("memprof-verify-nodes", cl::init(false), cl::Hidden,
[all …]
/freebsd/contrib/ldns/
H A Dradix.c2 * radix.c -- generic radix tree
96 node->data = data; in ldns_radix_new_node()
97 node->key = key; in ldns_radix_new_node()
98 node->klen = len; in ldns_radix_new_node()
99 node->parent = NULL; in ldns_radix_new_node()
100 node->parent_index = 0; in ldns_radix_new_node()
101 node->len = 0; in ldns_radix_new_node()
102 node->offset = 0; in ldns_radix_new_node()
103 node->capacity = 0; in ldns_radix_new_node()
104 node->array = NULL; in ldns_radix_new_node()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Instrumentation/
H A DCFGMST.h1 //===-- CFGMST.h - Minimum Spanning Tree for CFG -------
[all...]
/freebsd/sys/contrib/device-tree/Bindings/net/
H A Dmscc-phy-vsc8531.txt1 * Microsemi - vsc8531 Giga bit ethernet phy
4 - vsc8531,vddmac : The vddmac in mV. Allowed values is listed
7 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
[all …]
/freebsd/sys/contrib/device-tree/Bindings/remoteproc/
H A Dqcom,smd-edge.yaml1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
4 $id: http://devicetree.org/schemas/remoteproc/qcom,smd-edge.yaml#
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
7 title: Qualcomm SMD Edge communication channel nodes
10 - Bjorn Andersson <bjorn.andersson@linaro.org>
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
29 - qcom,smd-channels
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h1 //==========-- ImmutableGraph.h - A fast DAG implementation ---------=========//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 /// The advantages to this implementation are two-fold:
16 /// 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
23 //===----------------------------------------------------------------------===//
47 class Edge {
62 const Edge *Edges;
68 const Edge *edges_begin() const { return Edges; } in edges_begin()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileLoaderBaseImpl.h1 ////===- SampleProfileLoadBaseImpl.h - Profile loader base impl --*- C++-*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
13 //===----------------------------------------------------------------------===//
56 #define DEBUG_TYPE "sample-profile-impl"
77 return &F->getEntryBlock();
95 for (const auto *Operand : FuncInfo->operands()) {
97 auto GUID = mdconst::dyn_extract<ConstantInt>(MD->getOperand(0))
98 ->getZExtValue();
99 auto Hash = mdconst::dyn_extract<ConstantInt>(MD->getOperand(1))
[all …]
/freebsd/sys/contrib/device-tree/Bindings/iio/adc/
H A Dst,stm32-dfsdm-adc.yaml1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
4 $id: http://devicetree.org/schemas/iio/adc/st,stm32-dfsdm-adc.yaml#
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Fabrice Gasnier <fabrice.gasnier@foss.st.com>
11 - Olivier Moysan <olivier.moysan@foss.st.com>
14 STM32 DFSDM ADC is a sigma delta analog-to-digital converter dedicated to
17 - Sigma delta modulators (motor control, metering...)
18 - PDM microphones (audio digital microphone)
28 - st,stm32h7-dfsdm
[all …]

12345678910>>...42