Home
last modified time | relevance | path

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

12345678910>>...43

/freebsd-src/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-src/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...
26 // GraphTraits - This class should be specialized by different graph types...
32 // GraphTraits can be used to create a view over a graph interpreting it
33 // differently without requiring a copy of the original graph. This could
40 // typedef NodeRef - Type of Node token in the graph, which should
42 // typedef ChildIteratorType - Type used to iterate over children in graph,
46 // Return the entry node of the graph
56 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
[all …]
/freebsd-src/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,
64 /// A lazily constructed view of the call graph o
[all...]
H A DDependenceGraphBuilder.h45 : Graph(G), DI(D), BBList(BBs) {} in AbstractDependenceGraphBuilder()
48 /// The main entry to the graph construction algorithm. It starts by
85 /// in the graph nodes and create edges between them.
88 /// Create a root node and add edges such that each node in the graph is
92 /// Apply graph abstraction to groups of nodes that belong to a strongly
93 /// connected component of the graph to create larger compound nodes
96 /// the dependence graph into an acyclic graph.
99 /// Go through all the nodes in the graph and collapse any two nodes
108 /// Topologically sort the graph nodes.
112 /// 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()
105 void printGraphForFunction(Function &F, GraphT Graph, StringRef Name,
115 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in printGraphForFunction()
118 WriteGraph(File, Graph, IsSimple, in printGraphForFunction()
150 GraphT Graph in run()
106 printGraphForFunction(Function & F,GraphT Graph,StringRef Name,bool IsSimple) printGraphForFunction() argument
151 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); run() local
206 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); runOnFunction() local
245 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); runOnFunction() local
269 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); runOnModule() local
295 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); runOnModule() local
324 WriteDOTGraphToFile(Function & F,GraphT && Graph,std::string FileNamePrefix,bool IsSimple) WriteDOTGraphToFile() argument
[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 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
[all...]
H A DIntervalIterator.h
H A DDDG.h9 // This file defines the Data-Dependence Graph (DDG).
33 /// Data Dependence Graph Node
34 /// The graph can represent the following types of nodes:
39 /// strongly-connected component of the graph.
43 /// there is always a path from it to any node in the graph.
91 /// Subclass of DDGNode representing the root node of the graph.
92 /// There should only be one such node in a given graph.
164 /// of DDG nodes that are part of a strongly-connected component of the graph.
208 /// Data Dependency Graph Edge.
212 /// of the graph
[all...]
/freebsd-src/contrib/llvm-project/clang/lib/Analysis/
H A DIntervalPartition.cpp105 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-src/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp91 "For each function, emit a dot graph depicting potential LVI gadgets"),
96 cl::desc("For each function, emit a dot graph depicting potential LVI "
102 cl::desc("For each function, emit a dot graph to stdout depicting "
165 std::unique_ptr<MachineGadgetGraph> Graph) const;
167 std::unique_ptr<MachineGadgetGraph> Graph) const;
172 trimMitigatedEdges(std::unique_ptr<MachineGadgetGraph> Graph) const;
271 LLVM_DEBUG(dbgs() << "Building gadget graph...\n"); in runOnMachineFunction()
275 std::unique_ptr<MachineGadgetGraph> Graph = getGadgetGraph(MF, MLI, MDT, MDF); in runOnMachineFunction() local
276 LLVM_DEBUG(dbgs() << "Building gadget graph... Done\n"); in runOnMachineFunction()
277 if (Graph in runOnMachineFunction()
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DAggressiveInstCombineInternal.h27 // instructions and for each eligible graph, it will create a reduced bit-width
29 // old one. Eligible expression graph is such that:
33 // 4. All instructions in the graph must not have users outside the graph.
66 /// Information per each instruction in the expression graph.
75 /// An ordered map representing expression graph post-dominated by current
76 /// processed TruncInst. It maps each instruction in the graph to its Info
78 /// all other instructions in the graph that uses it.
90 /// Build expression graph dominated by the /p CurrentTruncInst and append it
93 /// \return true only if succeed to generate an eligible sub expression graph.
103 /// Build an expression graph dominated by the current processed TruncInst and
[all …]
/freebsd-src/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-src/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-src/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-src/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-src/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
37 /// The AST-based call graph.
39 /// The call graph extends itself with the given declarations by implementing
40 /// the recursive AST visitor, which constructs the graph by visiting the given
58 /// Populate the call graph with the functions in the given
66 /// Determine if a declaration should be included in the graph.
69 /// Determine if a declaration should be included in the graph for the
78 /// one into the graph.
[all …]
/freebsd-src/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-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-src/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-src/sys/contrib/device-tree/Bindings/media/
H A Drenesas,isp.yaml41 $ref: /schemas/graph.yaml#/properties/ports
45 $ref: /schemas/graph.yaml#/properties/port
51 $ref: /schemas/graph.yaml#/properties/port
56 $ref: /schemas/graph.yaml#/properties/port
61 $ref: /schemas/graph.yaml#/properties/port
66 $ref: /schemas/graph.yaml#/properties/port
71 $ref: /schemas/graph.yaml#/properties/port
76 $ref: /schemas/graph.yaml#/properties/port
81 $ref: /schemas/graph.yaml#/properties/port
86 $ref: /schemas/graph.yaml#/properties/port
H A Drenesas,vin.yaml79 $ref: /schemas/graph.yaml#/$defs/port-base
124 $ref: /schemas/graph.yaml#/properties/ports
128 $ref: /schemas/graph.yaml#/$defs/port-base
166 $ref: /schemas/graph.yaml#/properties/port
173 $ref: /schemas/graph.yaml#/properties/endpoint
177 $ref: /schemas/graph.yaml#/properties/endpoint
181 $ref: /schemas/graph.yaml#/properties/endpoint
185 $ref: /schemas/graph.yaml#/properties/endpoint
199 $ref: /schemas/graph.yaml#/properties/port
206 $ref: /schemas/graph
[all...]
/freebsd-src/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DIntervalPartition.h11 // partitioning. The concepts and implementations for the graph partitioning
44 /// flow graph of `Cfg` (derived from iteratively partitioning it into
45 /// intervals) if and only if it is reducible (its limit flow graph has one
70 // blocks or from a graph of other intervals. Each interval has one _header_
72 // either the graph's entry block or has at least one predecessor outside of the
90 // graph.
112 // Partitions `Cfg` into intervals and constructs the graph of the intervals
116 // (Further) partitions `Graph` into intervals and constructs the graph of the
119 CFGIntervalGraph partitionIntoIntervals(const CFGIntervalGraph &Graph);
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h1 //===- CallGraphUpdater.h - A (lazy) call graph update helper ---*- C++ -*-===//
10 /// This file provides interfaces used to manipulate a call graph, regardless
71 /// Remove \p Fn from the call graph. in initialize()
75 /// graph, this method can be called to update it. in initialize()
79 /// to update the call graph for the new function. Note that the old one
83 /// Replace \p OldFn in the call graph (and SCC) with \p NewFn. The uses
84 /// outside the call graph and the function \p OldFn are not modified.
85 /// Note that \p OldFn is also removed from the call graph

12345678910>>...43