| /external/clang/test/PCH/Inputs/ |
| typo.hpp | 4 namespace graph { namespace in namespace:boost
|
| /external/regex-re2/benchlog/ |
| mktable | 34 sub graph() { subroutine
119 "graph" => \&graph,
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| InjectorGrapher.java | 26 * Guice injector grapher. Renders the guice dependency graph for an injector. It can render the
27 * whole dependency graph or just transitive dependencies of a given set of nodes.
35 * Graphs the guice dependency graph for the given injector using default starting keys.
37 void graph(Injector injector) throws IOException; method in interface:InjectorGrapher
40 * Graphs the guice dependency graph for the given injector using the given starting keys and
43 void graph(Injector injector, Set<Key<?>> root) throws IOException; method in interface:InjectorGrapher
|
| /external/testng/src/main/java/org/testng/internal/thread/graph/ |
| IThreadWorkerFactory.java | 1 package org.testng.internal.thread.graph;
|
| IWorker.java | 1 package org.testng.internal.thread.graph;
|
| SuiteWorkerFactory.java | 1 package org.testng.internal.thread.graph;
|
| /tools/tradefederation/core/tests/src/com/android/tradefed/util/ |
| DirectedGraphTest.java | 26 DirectedGraph<Integer> graph = new DirectedGraph<Integer>(); local
27 graph.addEdge(0, 1);
28 graph.addEdge(1, 2);
29 graph.addEdge(2, 3);
30 assertTrue(graph.contains(0));
31 assertTrue(graph.contains(1));
32 assertTrue(graph.contains(2));
33 assertTrue(graph.contains(3));
35 assertTrue(graph.isDag());
39 DirectedGraph<Integer> graph = new DirectedGraph<Integer>() local
55 DirectedGraph<Integer> graph = new DirectedGraph<Integer>(); local
[all...] |
| /art/compiler/optimizing/ |
| linearize_test.cc | 41 HGraph* graph = CreateCFG(&allocator, data); local
44 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions());
45 SsaLivenessAnalysis liveness(graph, &codegen);
48 ASSERT_EQ(graph->GetLinearOrder().size(), number_of_blocks);
50 ASSERT_EQ(graph->GetLinearOrder()[i]->GetBlockId(), expected_order[i]);
55 // Structure of this graph (+ are back edges)
80 // Structure of this graph (+ are back edges)
105 // Structure of this graph (+ are back edges)
132 /* Structure of this graph (+ are back edges)
162 /* Structure of this graph (+ are back edges
[all...] |
| suspend_check_test.cc | 34 HGraph* graph = CreateCFG(&allocator, data); local
35 HBasicBlock* first_block = graph->GetEntryBlock()->GetSingleSuccessor();
|
| dead_code_elimination_test.cc | 36 HGraph* graph = CreateCFG(&allocator, data); local
37 ASSERT_NE(graph, nullptr);
39 StringPrettyPrinter printer_before(graph);
46 x86::CodeGeneratorX86 codegenX86(graph, *features_x86.get(), CompilerOptions());
47 HDeadCodeElimination(graph, nullptr /* stats */, "dead_code_elimination").Run();
48 GraphChecker graph_checker(graph);
52 StringPrettyPrinter printer_after(graph);
|
| dominator_test.cc | 32 HGraph* graph = CreateCFG(&allocator, data); local
33 ASSERT_EQ(graph->GetBlocks().size(), blocks_length);
36 if (graph->GetBlocks()[i] == nullptr) {
40 ASSERT_EQ(nullptr, graph->GetBlocks()[i]->GetDominator());
41 ASSERT_TRUE(graph->GetBlocks()[i]->IsEntryBlock());
44 ASSERT_NE(nullptr, graph->GetBlocks()[i]->GetDominator());
45 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId());
|
| find_loops_test.cc | 40 HGraph* graph = CreateCFG(&allocator, data); local
41 for (HBasicBlock* block : graph->GetBlocks()) {
53 HGraph* graph = CreateCFG(&allocator, data); local
54 for (HBasicBlock* block : graph->GetBlocks()) {
69 HGraph* graph = CreateCFG(&allocator, data); local
70 for (HBasicBlock* block : graph->GetBlocks()) {
86 HGraph* graph = CreateCFG(&allocator, data); local
87 for (HBasicBlock* block : graph->GetBlocks()) {
101 HGraph* graph = CreateCFG(&allocator, data); local
102 for (HBasicBlock* block : graph->GetBlocks())
147 HGraph* graph = CreateCFG(&allocator, data); local
175 HGraph* graph = CreateCFG(&allocator, data); local
200 HGraph* graph = CreateCFG(&allocator, data); local
226 HGraph* graph = CreateCFG(&allocator, data); local
252 HGraph* graph = CreateCFG(&allocator, data); local
277 HGraph* graph = CreateCFG(&allocator, data); local
308 HGraph* graph = CreateCFG(&allocator, data); local
338 HGraph* graph = CreateCFG(&allocator, data); local
354 HGraph* graph = CreateCFG(&allocator, data); local
[all...] |
| graph_checker_test.cc | 23 * Create a simple control-flow graph composed of two blocks:
31 HGraph* graph = CreateGraph(allocator); local
32 HBasicBlock* entry_block = new (allocator) HBasicBlock(graph);
34 graph->AddBlock(entry_block);
35 graph->SetEntryBlock(entry_block);
36 HBasicBlock* exit_block = new (allocator) HBasicBlock(graph);
38 graph->AddBlock(exit_block);
39 graph->SetExitBlock(exit_block);
41 graph->BuildDominatorTree();
42 return graph;
48 HGraph* graph = CreateCFG(&allocator, data); local
99 HGraph* graph = CreateSimpleCFG(&allocator); local
117 HGraph* graph = CreateSimpleCFG(&allocator); local
[all...] |
| live_ranges_test.cc | 35 HGraph* graph = CreateCFG(allocator, data); local
38 RemoveSuspendChecks(graph);
40 PrepareForRegisterAllocation(graph).Run();
41 return graph;
49 * Which becomes the following graph (numbered by lifetime position):
63 HGraph* graph = BuildGraph(data, &allocator); local
67 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions());
68 SsaLivenessAnalysis liveness(graph, &codegen);
76 HBasicBlock* block = graph->GetBlocks()[1];
91 * Which becomes the following graph (numbered by lifetime position)
112 HGraph* graph = BuildGraph(data, &allocator); local
163 HGraph* graph = BuildGraph(data, &allocator); local
241 HGraph* graph = BuildGraph(data, &allocator); local
321 HGraph* graph = BuildGraph(data, &allocator); local
399 HGraph* graph = BuildGraph(data, &allocator); local
[all...] |
| liveness_test.cc | 49 HGraph* graph = CreateCFG(&allocator, data); local
51 PrepareForRegisterAllocation(graph).Run();
54 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions());
55 SsaLivenessAnalysis liveness(graph, &codegen);
59 for (HBasicBlock* block : graph->GetBlocks()) {
|
| pc_relative_fixups_mips.cc | 29 PCRelativeHandlerVisitor(HGraph* graph, CodeGenerator* codegen)
30 : HGraphVisitor(graph),
101 HGraph* graph = GetGraph(); variable
103 HMipsPackedSwitch* mips_switch = new (graph->GetArena()) HMipsPackedSwitch(
|
| pretty_printer_test.cc | 32 HGraph* graph = CreateCFG(&allocator, data); local
33 StringPrettyPrinter printer(graph);
|
| ssa_test.cc | 36 explicit SsaPrettyPrinter(HGraph* graph) : HPrettyPrinter(graph), str_("") {}
68 static void ReNumberInstructions(HGraph* graph) {
70 for (HBasicBlock* block : graph->GetBlocks()) {
83 HGraph* graph = CreateCFG(&allocator, data); local
86 RemoveSuspendChecks(graph);
87 ReNumberInstructions(graph);
90 for (HBasicBlock* block : graph->GetBlocks()) {
96 SsaPrettyPrinter printer(graph);
|
| /external/dagger2/compiler/src/main/java/dagger/internal/codegen/ |
| MissingBindingSuggestions.java | 23 * Utility code that looks for bindings matching a key in all subcomponents in a binding graph so
30 * Searches the entire binding graph from the top-level graph for a binding matching
39 BindingGraph graph = graphsToTry.removeLast(); local
40 ResolvedBindings bindings = graph.resolvedBindings().get(key);
42 graphsToTry.addAll(graph.subgraphs().values());
45 + graph.componentDescriptor().componentDefinitionType().getQualifiedName());
|
| /external/v8/src/compiler/ |
| select-lowering.h | 8 #include "src/compiler/graph-reducer.h"
16 class Graph;
22 SelectLowering(Graph* graph, CommonOperatorBuilder* common);
29 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
32 Graph* graph_;
|
| tail-call-optimization.h | 8 #include "src/compiler/graph-reducer.h"
17 class Graph;
24 TailCallOptimization(CommonOperatorBuilder* common, Graph* graph)
25 : common_(common), graph_(graph) {}
31 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
34 Graph* const graph_;
|
| common-operator-reducer.h | 9 #include "src/compiler/graph-reducer.h"
18 class Graph;
27 CommonOperatorReducer(Editor* editor, Graph* graph,
46 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
51 Graph* const graph_;
|
| control-flow-optimizer.h | 18 class Graph;
24 ControlFlowOptimizer(Graph* graph, CommonOperatorBuilder* common,
37 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
42 Graph* const graph_;
|
| /external/ImageMagick/coders/ |
| dot.c | 109 *graph;
142 graph=agread(GetBlobFileHandle(image));
144 graph=agread(GetBlobFileHandle(image),(Agdisc_t *) NULL);
146 if (graph == (graph_t *) NULL)
153 gvLayout(graphic_context,graph,(char *) "dot");
155 gvLayout(graphic_context,graph,(char *) option);
156 gvRenderFilename(graphic_context,graph,(char *) "svg",read_info->filename);
157 gvFreeLayout(graphic_context,graph);
158 agclose(graph);
160 Read SVG graph
107 *graph; local
[all...] |
| /external/skia/tests/ |
| TopoSortTest.cpp | 14 typedef void (*CreateGraphPF)(SkTDArray<sk_tool_utils::TopoTestNode*>* graph);
23 static void create_graph0(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) {
24 sk_tool_utils::TopoTestNode::AllocNodes(graph, 4);
26 (*graph)[0]->dependsOn((*graph)[1]);
27 (*graph)[0]->dependsOn((*graph)[2]);
28 (*graph)[1]->dependsOn((*graph)[3]);
29 (*graph)[2]->dependsOn((*graph)[3])
123 SkTDArray<sk_tool_utils::TopoTestNode*> graph; local
[all...] |
