| /system/update_engine/payload_generator/ |
| D | graph_utils_unittest.cc | 36 Graph graph(2); in TEST() local
38 graph[0].out_edges.insert(make_pair(1, EdgeProperties())); in TEST()
40 vector<Extent>& extents = graph[0].out_edges[1].extents; in TEST()
56 EXPECT_EQ(4U, graph_utils::EdgeWeight(graph, make_pair(0, 1))); in TEST()
60 Graph graph(3); in TEST() local
62 graph_utils::AddReadBeforeDep(&graph[0], 1, 3); in TEST()
63 EXPECT_EQ(1U, graph[0].out_edges.size()); in TEST()
65 Extent& extent = graph[0].out_edges[1].extents[0]; in TEST()
69 graph_utils::AddReadBeforeDep(&graph[0], 1, 4); in TEST()
70 EXPECT_EQ(1U, graph[0].out_edges.size()); in TEST()
[all …]
|
| D | cycle_breaker_unittest.cc | 39 void SetOpForNodes(Graph* graph) { in SetOpForNodes() argument
40 for (Vertex& vertex : *graph) { in SetOpForNodes()
60 Graph graph(kNodeCount); in TEST() local
61 SetOpForNodes(&graph); in TEST()
63 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
64 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
65 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST()
66 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
67 graph[n_d].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
68 graph[n_d].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
[all …]
|
| D | inplace_generator_unittest.cc | 186 Graph graph; in TEST_F() local
191 graph.resize(graph.size() + 1); in TEST_F()
192 graph.back().aop.op.set_type(InstallOperation::MOVE); in TEST_F()
198 StoreExtents(extents, graph.back().aop.op.mutable_src_extents()); in TEST_F()
199 blocks[3].reader = graph.size() - 1; in TEST_F()
200 blocks[5].reader = graph.size() - 1; in TEST_F()
201 blocks[7].reader = graph.size() - 1; in TEST_F()
208 StoreExtents(extents, graph.back().aop.op.mutable_dst_extents()); in TEST_F()
209 blocks[1].writer = graph.size() - 1; in TEST_F()
210 blocks[2].writer = graph.size() - 1; in TEST_F()
[all …]
|
| D | tarjan.cc | 34 Graph* graph, in Execute() argument
39 for (Graph::iterator it = graph->begin(); it != graph->end(); ++it) in Execute()
43 Tarjan(vertex, graph); in Execute()
48 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) { in Tarjan() argument
49 CHECK_EQ((*graph)[vertex].index, kInvalidIndex); in Tarjan()
50 (*graph)[vertex].index = index_; in Tarjan()
51 (*graph)[vertex].lowlink = index_; in Tarjan()
54 for (Vertex::EdgeMap::iterator it = (*graph)[vertex].out_edges.begin(); in Tarjan()
55 it != (*graph)[vertex].out_edges.end(); in Tarjan()
58 if ((*graph)[vertex_next].index == kInvalidIndex) { in Tarjan()
[all …]
|
| D | inplace_generator.cc | 88 explicit IndexedInstallOperationsDstComparator(Graph* graph) in IndexedInstallOperationsDstComparator() argument
89 : graph_(graph) {} in IndexedInstallOperationsDstComparator()
103 void InplaceGenerator::CheckGraph(const Graph& graph) { in CheckGraph() argument
104 for (const Vertex& v : graph) { in CheckGraph()
139 bool InplaceGenerator::CutEdges(Graph* graph, in CutEdges() argument
150 (*graph)[edge.first].out_edges[edge.second].extents; in CutEdges()
152 scratch_blocks_used += graph_utils::EdgeWeight(*graph, edge); in CutEdges()
154 scratch_allocator.Allocate(graph_utils::EdgeWeight(*graph, edge)); in CutEdges()
156 cuts.back().new_vertex = graph->size(); in CutEdges()
157 graph->emplace_back(); in CutEdges()
[all …]
|
| D | topological_sort_unittest.cc | 66 Graph graph(kNodeCount); in TEST() local
68 graph[n_i].out_edges.insert(make_pair(n_j, EdgeProperties())); in TEST()
69 graph[n_i].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST()
70 graph[n_i].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
71 graph[n_i].out_edges.insert(make_pair(n_h, EdgeProperties())); in TEST()
72 graph[n_c].out_edges.insert(make_pair(n_b, EdgeProperties())); in TEST()
73 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST()
74 graph[n_e].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
75 graph[n_e].out_edges.insert(make_pair(n_g, EdgeProperties())); in TEST()
76 graph[n_g].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
[all …]
|
| D | tarjan_unittest.cc | 47 Graph graph(kNodeCount); in TEST() local
49 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
50 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
51 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST()
52 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
53 graph[n_d].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
54 graph[n_d].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
55 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties())); in TEST()
56 graph[n_e].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST()
57 graph[n_e].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
[all …]
|
| D | topological_sort.cc | 30 void TopologicalSortVisit(const Graph& graph, in TopologicalSortVisit() argument
39 for (Vertex::EdgeMap::const_iterator it = graph[node].out_edges.begin(); in TopologicalSortVisit()
40 it != graph[node].out_edges.end(); in TopologicalSortVisit()
42 TopologicalSortVisit(graph, visited_nodes, nodes, it->first); in TopologicalSortVisit()
49 void TopologicalSort(const Graph& graph, vector<Vertex::Index>* out) { in TopologicalSort() argument
52 for (Vertex::Index i = 0; i < graph.size(); i++) { in TopologicalSort()
53 TopologicalSortVisit(graph, &visited_nodes, out, i); in TopologicalSort()
|
| D | graph_utils.cc | 38 uint64_t EdgeWeight(const Graph& graph, const Edge& edge) { in EdgeWeight() argument
41 graph[edge.first].out_edges.find(edge.second)->second.extents; in EdgeWeight()
95 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index) { in DropIncomingEdgesTo() argument
98 for (Graph::iterator it = graph->begin(), e = graph->end(); it != e; ++it) { in DropIncomingEdgesTo()
126 void DumpGraph(const Graph& graph) { in DumpGraph() argument
127 LOG(INFO) << "Graph length: " << graph.size(); in DumpGraph()
128 for (Graph::size_type i = 0, e = graph.size(); i != e; ++i) { in DumpGraph()
129 LOG(INFO) << i << (graph[i].valid ? "" : "-INV") << ": " in DumpGraph()
130 << graph[i].aop.name << ": " in DumpGraph()
131 << InstallOperationTypeName(graph[i].aop.op.type()); in DumpGraph()
[all …]
|
| D | inplace_generator.h | 72 static void CheckGraph(const Graph& graph);
93 static bool CutEdges(Graph* graph,
100 static void CreateEdges(Graph* graph, const std::vector<Block>& blocks);
117 static void MoveAndSortFullOpsToBack(Graph* graph,
122 static bool NoTempBlocksRemain(const Graph& graph);
132 Graph* graph,
146 static bool ConvertCutToFullOp(Graph* graph,
160 static bool ConvertGraphToDag(Graph* graph,
182 const Graph& graph,
191 static bool AddInstallOpToGraph(Graph* graph,
|
| D | graph_utils.h | 34 uint64_t EdgeWeight(const Graph& graph, const Edge& edge);
46 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index);
48 void DumpGraph(const Graph& graph);
|
| D | tarjan.h | 39 Graph* graph,
43 void Tarjan(Vertex::Index vertex, Graph* graph);
|
| D | topological_sort.h | 38 void TopologicalSort(const Graph& graph, std::vector<Vertex::Index>* out);
|
| D | cycle_breaker.cc | 40 void CycleBreaker::BreakCycles(const Graph& graph, set<Edge>* out_cut_edges) { in BreakCycles() argument
46 subgraph_ = graph; in BreakCycles()
59 InstallOperation::Type op_type = graph[i].aop.op.type(); in BreakCycles()
|
| D | cycle_breaker.h | 46 void BreakCycles(const Graph& graph, std::set<Edge>* out_cut_edges);
|
| /system/core/libmemunreachable/ |
| D | Tarjan.h | 72 void Execute(Graph<T>& graph, SCCList<T>& out);
76 void Tarjan(Node<T>* vertex, Graph<T>& graph);
84 void TarjanAlgorithm<T>::Execute(Graph<T>& graph, SCCList<T>& out) { in Execute() argument
88 for (auto& it : graph) { in Execute()
93 for (auto& it : graph) { in Execute()
95 Tarjan(it, graph); in Execute()
102 void TarjanAlgorithm<T>::Tarjan(Node<T>* vertex, Graph<T>& graph) { in Tarjan() argument
111 Tarjan(vertex_next, graph); in Tarjan()
131 void Tarjan(Graph<T>& graph, SCCList<T>& out) { in Tarjan() argument
132 TarjanAlgorithm<T> tarjan{graph.get_allocator()}; in Tarjan()
[all …]
|
| /system/iorap/docs/binder/ |
| D | TaskResult.dot | 18 * Convert with `graph-easy --as=boxart` to get textual rendering.
26 // graph-easy does not support multiple state syntax {}, write one-by-one
|
| D | ActivityHint.dot | 18 * Convert with `graph-easy --as=boxart` to get textual rendering.
|
| /system/extras/simpleperf/doc/ |
| D | README.md | 18 - [Record and report call graph](#record-and-report-call-graph)
20 - [Show flame graph](#show-flame-graph)
79 a. When recording dwarf based call graph, simpleperf unwinds the stack before writing a sample
307 ### Record and report call graph
316 # Record stack frame based call graphs: add "--call-graph fp" in the -r option.
318 -r "-e task-clock:u -f 1000 --duration 10 --call-graph fp" \
345 ### Show flame graph
374 dwarf-based-call-graph
421 # Record surfaceflinger process for 10 seconds with dwarf based call graph. More examples are in
435 $ python app_profiler.py -np surfaceflinger -r "--call-graph fp --duration 10"
[all …]
|
| D | inferno.md | 14 Notice there is no concept of time in a flame graph since all callstack are
72 #### Messy flame graph
73 A healthy flame graph features a single call site at its base (see [here](./report.html)).
|
| /system/update_engine/ |
| D | pylintrc | 422 # Create a graph of every (i.e. internal and external) dependencies in the
424 import-graph=
426 # Create a graph of external dependencies in the given file (report RP0402 must
428 ext-import-graph=
430 # Create a graph of internal dependencies in the given file (report RP0402 must
432 int-import-graph=
|
| /system/chre/pal/doc/ |
| D | Doxyfile | 2131 # http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
2172 # If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
2181 # graph for each documented class showing the direct and indirect implementation
2189 # If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
2205 # class node. If there are many fields or methods and many nodes the graph may
2226 # YES then doxygen will generate a graph for each documented file showing the
2235 # set to YES then doxygen will generate a graph for each documented file showing
2244 # dependency graph for every global function or class method.
2248 # functions only using the \callgraph command. Disabling a call graph can be
2256 # dependency graph for every global function or class method.
[all …]
|
| /system/chre/chre_api/doc/ |
| D | Doxyfile | 2131 # http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
2172 # If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
2181 # graph for each documented class showing the direct and indirect implementation
2189 # If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
2205 # class node. If there are many fields or methods and many nodes the graph may
2226 # YES then doxygen will generate a graph for each documented file showing the
2235 # set to YES then doxygen will generate a graph for each documented file showing
2244 # dependency graph for every global function or class method.
2248 # functions only using the \callgraph command. Disabling a call graph can be
2256 # dependency graph for every global function or class method.
[all …]
|
| /system/media/audio_utils/ |
| D | Doxyfile | 2047 # http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
2088 # If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
2097 # graph for each documented class showing the direct and indirect implementation
2105 # If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
2121 # class node. If there are many fields or methods and many nodes the graph may
2142 # YES then doxygen will generate a graph for each documented file showing the
2151 # set to YES then doxygen will generate a graph for each documented file showing
2160 # dependency graph for every global function or class method.
2171 # dependency graph for every global function or class method.
2246 # that will be shown in the graph. If the number of nodes in a graph becomes
[all …]
|
| D | Doxyfile.orig | 2047 # http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
2088 # If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
2097 # graph for each documented class showing the direct and indirect implementation
2105 # If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
2121 # class node. If there are many fields or methods and many nodes the graph may
2142 # YES then doxygen will generate a graph for each documented file showing the
2151 # set to YES then doxygen will generate a graph for each documented file showing
2160 # dependency graph for every global function or class method.
2171 # dependency graph for every global function or class method.
2246 # that will be shown in the graph. If the number of nodes in a graph becomes
[all …]
|