Home
last modified time | relevance | path

Searched full:graph (Results 1 – 25 of 1308) sorted by relevance

12345678910>>...53

/freebsd/share/doc/psd/18.gprof/
H A Dpostp.me34 Having gathered the arcs of the call graph and timing information
38 We build a dynamic call graph with arcs from caller to callee,
40 by topologically sorting the call graph.
42 call graph toward the roots, according to the order
45 all edges in the graph go from higher numbered nodes to lower
51 after a single traversal of each arc in the call graph.
83 This relation is easily available from the call graph.
86 the call graph has cycles that
89 components in the call graph,
91 and then sort the resulting graph.
[all …]
H A Dprofiling.me82 This accounting is done by assembling a \fIcall graph\fP with nodes that
86 The \fIcomplete call graph\fP incorporates all routines and all
90 This graph contains the other two graphs as subgraphs.
91 The \fIstatic call graph\fP includes all routines and all possible arcs
93 The \fIdynamic call graph\fP includes only those routines and
95 This graph need not include all routines, nor need it include all
98 variables that the static call graph may omit.
99 The static call graph can be determined from the (static) program text.
100 The dynamic call graph is determined only by profiling an
102 The complete call graph for a monolithic program could be determined
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h1 //===- LazyCallGraph.h - Analysis of a Module's call graph ------*- C++ -*-===//
10 /// Implements a lazy call graph analysis and related passes for the new pass
13 /// NB: This is *not* a traditional call graph! It is a graph which models both
15 /// edges in this call graph that do not correspond to a 'call' or 'invoke'
18 /// The primary use cases of this graph analysis is to facilitate iterating
24 /// purposes. The use graph of functions or some other conservative analysis of
27 /// potential-call-edge graph.
29 /// To understand the specific rules and nature of this call graph analysis,
63 /// A lazily constructed view of the call graph of a module.
65 /// With the edges of this graph, the motivating constraint that we are
[all …]
H A DDependenceGraphBuilder.h46 : Graph(G), DI(D), BBList(BBs) {} in AbstractDependenceGraphBuilder()
49 /// The main entry to the graph construction algorithm. It starts by
86 /// in the graph nodes and create edges between them.
89 /// Create a root node and add edges such that each node in the graph is
93 /// Apply graph abstraction to groups of nodes that belong to a strongly
94 /// connected component of the graph to create larger compound nodes
97 /// the dependence graph into an acyclic graph.
100 /// Go through all the nodes in the graph and collapse any two nodes
109 /// Topologically sort the graph nodes.
113 /// Create the root node of the graph.
[all …]
H A DDOTGraphTraitsPass.h25 /// Default traits class for extracting a graph from an analysis pass.
34 void viewGraphForFunction(Function &F, GraphT Graph, StringRef Name, in viewGraphForFunction() argument
36 std::string GraphName = DOTGraphTraits<GraphT *>::getGraphName(&Graph); in viewGraphForFunction()
38 ViewGraph(Graph, Name, IsSimple, in viewGraphForFunction()
67 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run() local
68 viewGraphForFunction(F, Graph, Name, IsSimple); in run()
102 void printGraphForFunction(Function &F, GraphT Graph, StringRef Name, in printGraphForFunction() argument
112 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in printGraphForFunction()
115 WriteGraph(File, Graph, IsSimple, in printGraphForFunction()
147 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run() local
[all …]
H A DCGSCCPassManager.h1 //===- CGSCCPassManager.h - Call graph pass management ----------*- C++ -*-===//
11 /// graph. These passes form an important component of LLVM's interprocedural
12 /// optimizations. Because they operate on the SCCs of the call graph, and they
13 /// traverse the graph in post-order, they can effectively do pair-wise
25 /// across common large module graph shapes which tend to be very wide and have
30 /// graph proper, and a reference graph. The reference graph is super set of
31 /// the call graph and is a conservative approximation of what could through
32 /// scalar or CGSCC transforms *become* the call graph. Using this allows us to
34 /// graph by devirtualization or other technique, and thus ensures that
37 /// reachability used by the reference graph is a conservative approximation
[all …]
H A DCallGraph.h1 //===- CallGraph.h - Build a Module's call graph ----------------*- C++ -*-===//
10 /// This file provides interfaces used to build and manipulate a call graph,
13 /// Every function in a module is represented as a node in the call graph. The
17 /// A call graph may contain nodes where the function that they correspond to
67 /// The basic data container for the call graph of a \c Module of IR.
69 /// This class exposes both the interface to the call graph for a module of IR.
71 /// The core call graph itself can also be updated to reflect changes to the IR.
100 /// Returns the module the call graph corresponds to.
111 /// Returns the call graph node for the provided function.
118 /// Returns the call graph node for the provided function.
[all …]
H A DDDG.h9 // This file defines the Data-Dependence Graph (DDG).
34 /// Data Dependence Graph Node
35 /// The graph can represent the following types of nodes:
40 /// strongly-connected component of the graph.
44 /// there is always a path from it to any node in the graph.
92 /// Subclass of DDGNode representing the root node of the graph.
93 /// There should only be one such node in a given graph.
165 /// of DDG nodes that are part of a strongly-connected component of the graph.
209 /// Data Dependency Graph Edge.
213 /// of the graph.
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
11 /// specialized by classes that want to be iteratable by generic graph
15 /// graphs in a graph defined, inverse ordering...
27 // GraphTraits - This class should be specialized by different graph types...
33 // GraphTraits can be used to create a view over a graph interpreting it
34 // differently without requiring a copy of the original graph. This could
41 // typedef NodeRef - Type of Node token in the graph, which should
43 // typedef ChildIteratorType - Type used to iterate over children in graph,
47 // Return the entry node of the graph
57 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
[all …]
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DIntervalPartition.cpp105 static void fillIntervalNode(CFGIntervalGraph &Graph, in fillIntervalNode() argument
113 CFGIntervalNode &Interval = Graph.emplace_back(Graph.size()); in fillIntervalNode()
116 // graph (specifically, `Result.Nodes`) to identifiers of nodes in the output in fillIntervalNode()
117 // graph. In this case, the new interval has identifier `ID` so all of its in fillIntervalNode()
144 CFGIntervalGraph Graph; in partitionIntoIntervalsImpl() local
145 // `Index` maps all of the nodes of the input graph to the interval to which in partitionIntoIntervalsImpl()
146 // they are assigned in the output graph. The values (interval pointers) are in partitionIntoIntervalsImpl()
150 // Lists header nodes (from the input graph) and their associated in partitionIntoIntervalsImpl()
158 fillIntervalNode(Graph, Index, Successors, Partitioned, EntryBlock); in partitionIntoIntervalsImpl()
159 Intervals.emplace_back(EntryBlock, &Graph.back()); in partitionIntoIntervalsImpl()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp90 "For each function, emit a dot graph depicting potential LVI gadgets"),
95 cl::desc("For each function, emit a dot graph depicting potential LVI "
101 cl::desc("For each function, emit a dot graph to stdout depicting "
164 std::unique_ptr<MachineGadgetGraph> Graph) const;
166 std::unique_ptr<MachineGadgetGraph> Graph) const;
171 trimMitigatedEdges(std::unique_ptr<MachineGadgetGraph> Graph) const;
270 LLVM_DEBUG(dbgs() << "Building gadget graph...\n"); in runOnMachineFunction()
274 std::unique_ptr<MachineGadgetGraph> Graph = getGadgetGraph(MF, MLI, MDT, MDF); in runOnMachineFunction() local
275 LLVM_DEBUG(dbgs() << "Building gadget graph... Done\n"); in runOnMachineFunction()
276 if (Graph == nullptr) in runOnMachineFunction()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/XRay/
H A DGraph.h1 //===-- Graph.h - XRay Graph Class ------------------------------*- C++ -*-===//
9 // A Graph Datatype for XRay.
29 /// A Graph object represents a Directed Graph and is used in XRay to compute
32 /// The graph takes in four template parameters, these are:
45 /// Graph is CopyConstructible, CopyAssignable, MoveConstructible and
48 /// Usage Example Graph with weighted edges and vertices:
49 /// Graph<int, int, int> G;
56 /// // Do something with the vertices in the graph;
59 /// // Do something with the edges in the graph;
63 /// Graph<int, double, StrRef> StrG;
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h1 //===- Graph.h - PBQP Graph -------------------------------------*- C++ -*-===//
9 // PBQP Graph class.
42 /// PBQP Graph class.
46 class Graph : public GraphBase {
80 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId()
111 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { in connectToN()
118 void connect(Graph &G, EdgeId ThisEdgeId) { in connect()
132 void disconnectFromN(Graph &G, unsigned NIdx) { in disconnectFromN()
140 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
176 Graph(const Graph &Other) {} in Graph() function
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DAggressiveInstCombineInternal.h25 // instructions and for each eligible graph, it will create a reduced bit-width
27 // old one. Eligible expression graph is such that:
31 // 4. All instructions in the graph must not have users outside the graph.
64 /// Information per each instruction in the expression graph.
73 /// An ordered map representing expression graph post-dominated by current
74 /// processed TruncInst. It maps each instruction in the graph to its Info
76 /// all other instructions in the graph that uses it.
88 /// Build expression graph dominated by the /p CurrentTruncInst and append it
91 /// \return true only if succeed to generate an eligible sub expression graph.
101 /// Build an expression graph dominated by the current processed TruncInst and
[all …]
/freebsd/usr.bin/gprof/
H A Dgprof.133 .Nd display call graph profile data
49 The profile data is taken from the call graph profile file
75 and the call graph profile.
76 The default graph profile file name is the name
88 Next, these times are propagated along the edges of the call graph.
93 including the time of their call graph descendants.
94 Below each function entry is shown its (direct) call graph children,
97 time of its descendants is propagated to its (direct) call graph parents.
143 Suppress the printing of the graph profile entry for routine
156 Suppress the printing of the graph profile entry for routine
[all …]
/freebsd/sys/arm64/coresight/
H A Dcoresight_acpi.c63 cs_acpi_validate_dsd_graph(const union acpi_object *graph) in cs_acpi_validate_dsd_graph() argument
69 if (graph->Package.Count < 2) in cs_acpi_validate_dsd_graph()
72 rev = &graph->Package.Elements[0]; in cs_acpi_validate_dsd_graph()
73 nr_graphs = &graph->Package.Elements[1]; in cs_acpi_validate_dsd_graph()
83 /* We are looking for a single graph. */ in cs_acpi_validate_dsd_graph()
89 if (graph->Package.Count != (n + 2)) in cs_acpi_validate_dsd_graph()
93 obj = &graph->Package.Elements[i]; in cs_acpi_validate_dsd_graph()
225 const union acpi_object *graph_list, *graph; in cs_get_coresight_graph() local
230 printf("failed to get graph list\n"); in cs_get_coresight_graph()
236 graph = &graph_list->Package.Elements[i]; in cs_get_coresight_graph()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h1 //===- CallGraph.h - AST-based Call graph -----------------------*- C++ -*-===//
11 // A call graph for functions whose definitions/bodies are available in the
12 // current translation unit. The graph has a "virtual" root node that contains
38 /// The AST-based call graph.
40 /// The call graph extends itself with the given declarations by implementing
41 /// the recursive AST visitor, which constructs the graph by visiting the given
59 /// Populate the call graph with the functions in the given
67 /// Determine if a declaration should be included in the graph.
70 /// Determine if a declaration should be included in the graph for the
79 /// one into the graph.
[all …]
/freebsd/sys/contrib/device-tree/Bindings/usb/
H A Dusb-switch-ports.yaml7 title: USB Orientation and Mode Switches Ports Graph Properties
13 Ports Graph properties for devices handling USB mode and orientation switching.
17 $ref: /schemas/graph.yaml#/$defs/port-base
24 $ref: /schemas/graph.yaml#/$defs/endpoint-base
36 $ref: /schemas/graph.yaml#/properties/ports
39 $ref: /schemas/graph.yaml#/properties/port
44 $ref: /schemas/graph.yaml#/$defs/port-base
51 $ref: /schemas/graph.yaml#/$defs/endpoint-base
/freebsd/usr.bin/tsort/
H A Dtsort.c74 NODE *n_next; /* next node in graph */
89 static NODE *graph, **cycle_buf, **longest_cycle; variable
144 /* parse input and build the graph */ in main()
188 * add an arc from node s1 to node s2 in the graph. If s1 or s2 are not in
189 * the graph, then add them.
225 /* Find a node in the graph (insert if not found) and return a pointer to it. */
261 if ((n->n_next = graph) != NULL) in get_node()
262 graph->n_prevp = &n->n_next; in get_node()
263 n->n_prevp = &graph; in get_node()
264 graph = n; in get_node()
[all …]
/freebsd/sys/contrib/device-tree/Bindings/sound/
H A Daudio-graph-card.txt1 Audio Graph Card:
3 Audio Graph Card specifies audio DAI connections of SoC <-> codec.
5 see ${LINUX}/Documentation/devicetree/bindings/graph.txt
7 Basically, Audio Graph Card property is same as Simple Card.
29 - compatible : "audio-graph-card";
40 compatible = "audio-graph-card";
71 compatible = "audio-graph-card";
143 compatible = "audio-graph-card";
180 compatible = "audio-graph-card";
193 audio-graph-card,prefix = "codec";
[all …]
H A Daudio-graph-card2.yaml4 $id: http://devicetree.org/schemas/sound/audio-graph-card2.yaml#
7 title: Audio Graph Card2
15 - audio-graph-card2
21 $ref: audio-graph.yaml#/properties/routing
37 $ref: audio-graph.yaml#/properties/hp-det-gpios
39 $ref: audio-graph.yaml#/properties/mic-det-gpios
41 $ref: audio-graph.yaml#/properties/widgets
H A Daudio-graph-card.yaml4 $id: http://devicetree.org/schemas/sound/audio-graph-card.yaml#
7 title: Audio Graph Card
13 - $ref: /schemas/sound/audio-graph.yaml#
18 - audio-graph-card
19 - audio-graph-scu-card
29 compatible = "audio-graph-card";
/freebsd/sys/contrib/device-tree/Bindings/media/
H A Drenesas,isp.yaml79 $ref: /schemas/graph.yaml#/properties/ports
83 $ref: /schemas/graph.yaml#/properties/port
89 $ref: /schemas/graph.yaml#/properties/port
94 $ref: /schemas/graph.yaml#/properties/port
99 $ref: /schemas/graph.yaml#/properties/port
104 $ref: /schemas/graph.yaml#/properties/port
109 $ref: /schemas/graph.yaml#/properties/port
114 $ref: /schemas/graph.yaml#/properties/port
119 $ref: /schemas/graph.yaml#/properties/port
124 $ref: /schemas/graph.yaml#/properties/port
/freebsd/contrib/pkgconf/doc/
H A Dlibpkgconf-pkg.rst105 :param pkgconf_dependency_t* pkgdep: The dependency graph node to solve.
112 Verify the graph dependency nodes are satisfiable by walking the tree using
116 …:param pkgconf_pkg_t* root: The root entry in the package dependency graph which should contain th…
123 Walk and resolve the dependency graph up to `maxdepth` levels.
126 :param pkgconf_pkg_t* root: The root of the dependency graph.
127 …_traverse_func_t func: A traversal function to call for each resolved node in the dependency graph.
129 …:param int maxdepth: The maximum depth to walk the dependency graph for. -1 means infinite recurs…
136 Walks a dependency graph and extracts relevant ``CFLAGS`` fragments.
139 :param pkgconf_pkg_t* root: The root of the dependency graph.
147 Walks a dependency graph and extracts relevant ``LIBS`` fragments.
[all …]
/freebsd/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-graph.h1 //===-- xray-graph.h - XRay Function Call Graph Renderer --------*- C++ -*-===//
9 // Generate a DOT file to represent the function call graph encountered in
27 #include "llvm/XRay/Graph.h"
56 /// An inner struct for storing edge attributes for our graph. Here the
83 class GraphT : public Graph<FunctionStats, CallStats, int32_t> {
94 /// graph.
110 /// Graph
114 /// Graph
132 /// Process an Xray record and expand the graph.
154 /// Output the Embedded graph in DOT format on \p OS, labeling the edges by
[all …]

12345678910>>...53