| /prebuilts/tools/common/m2/repository/org/eclipse/aether/aether-util/0.9.0.M3/ |
| aether-util-0.9.0.M3.jar | |
| /external/ceres-solver/internal/ceres/ |
| visibility.cc | 46 #include "ceres/graph.h"
79 Graph<int>* CreateSchurComplementGraph(const vector<set<int> >& visibility) {
125 Graph<int>* graph = new Graph<int>(); local
132 graph->AddVertex(i);
133 graph->AddEdge(i, i, kSelfEdgeWeight);
149 graph->AddEdge(camera1, camera2, weight);
152 VLOG(2) << "Schur complement graph time: " << (time(NULL) - start_time);
153 return graph;
[all...] |
| visibility_test.cc | 42 #include "ceres/graph.h"
111 scoped_ptr<Graph<int> > graph(CreateSchurComplementGraph(visibility));
112 EXPECT_EQ(graph->vertices().size(), visibility.size());
114 EXPECT_EQ(graph->VertexWeight(i), 1.0);
124 EXPECT_EQ(graph->EdgeWeight(i, j), edge_weight)
126 << " weight: " << graph->EdgeWeight(i, j)
187 scoped_ptr<Graph<int> > graph(CreateSchurComplementGraph(visibility));
188 EXPECT_EQ(graph->vertices().size(), visibility.size())
[all...] |
| /external/chromium_org/v8/src/ |
| hydrogen-dce.cc | 50 for (int i = 0; i < graph()->blocks()->length(); ++i) {
51 HBasicBlock* block = graph()->blocks()->at(i);
67 ZoneList<HPhi*> worklist(graph()->blocks()->length(), zone());
70 for (int i = 0; i < graph()->blocks()->length(); ++i) {
71 HBasicBlock* block = graph()->blocks()->at(i);
78 // Clear the liveness flag to leave the graph clean for the next DCE.
|
| /art/compiler/optimizing/ |
| code_generator.h | 71 // Compiles the graph to executable instructions. Returns whether the compilation
76 HGraph* graph,
143 CodeGenerator(HGraph* graph, size_t number_of_registers)
145 graph_(graph),
146 block_labels_(graph->GetArena(), 0),
147 pc_infos_(graph->GetArena(), 32),
148 slow_paths_(graph->GetArena(), 8),
149 blocked_registers_(graph->GetArena()->AllocArray<bool>(number_of_registers)),
|
| dominator_test.cc | 32 HGraph* graph = builder.BuildGraph(*item); local
33 ASSERT_NE(graph, nullptr);
34 graph->BuildDominatorTree();
35 ASSERT_EQ(graph->GetBlocks().Size(), blocks_length);
38 ASSERT_EQ(nullptr, graph->GetBlocks().Get(i)->GetDominator());
40 ASSERT_NE(nullptr, graph->GetBlocks().Get(i)->GetDominator());
41 ASSERT_EQ(blocks[i], graph->GetBlocks().Get(i)->GetDominator()->GetBlockId());
|
| pretty_printer.h | 27 explicit HPrettyPrinter(HGraph* graph) : HGraphVisitor(graph) { }
106 explicit StringPrettyPrinter(HGraph* graph)
107 : HPrettyPrinter(graph), str_(""), current_block_(nullptr) { }
|
| /external/chromium_org/v8/test/cctest/compiler/ |
| test-changes-lowering.cc | 10 #include "src/compiler/js-graph.h"
22 #include "test/cctest/compiler/graph-builder-tester.h"
35 jsgraph(this->graph(), this->common(), &javascript, &typer,
44 Node* start() { return this->graph()->start(); }
68 pipeline.GenerateCodeForMachineGraph(&linkage, this->graph());
104 // We build a graph by hand here, because the raw machine assembler
107 Node* change = this->graph()->NewNode(op, p0);
108 Node* ret = this->graph()->NewNode(this->common()->Return(), change,
110 Node* end = this->graph()->NewNode(this->common()->End(), ret);
111 this->graph()->SetEnd(end)
[all...] |
| graph-builder-tester.h | 12 #include "src/compiler/graph-builder.h"
16 #include "test/cctest/compiler/simplified-graph-builder.h"
22 // A class that just passes node creation on to the Graph.
25 explicit DirectGraphBuilder(Graph* graph) : GraphBuilder(graph) {}
31 return graph()->NewNode(op, value_input_count, value_inputs);
53 // TODO(dcarney): shouldn't need graph stored.
54 Graph* graph_;
62 : main_graph_(new (zone) Graph(zone))
[all...] |
| /external/chromium_org/v8/src/compiler/ |
| js-inlining.cc | 6 #include "src/compiler/ast-graph-builder.h"
9 #include "src/compiler/graph-inl.h"
10 #include "src/compiler/graph-visualizer.h"
50 jsgraph_->graph()->VisitNodeInputsFromEnd(&visitor);
64 // A facade on a JSFunction's graph to facilitate inlining. It assumes the
65 // that the function graph has only one return statement, and provides
66 // {UnifyReturn} to convert a function graph to that end.
75 // Return the effect output of the graph,
80 // Return the value output of the graph,
85 // Return the unique return statement of the graph
115 Graph* graph = jsgraph->graph(); local
[all...] |
| raw-machine-assembler.cc | 14 RawMachineAssembler::RawMachineAssembler(Graph* graph,
17 : GraphBuilder(graph),
23 Linkage::GetSimplifiedCDescriptor(graph->zone(), machine_sig)),
28 Node* s = graph->NewNode(common_.Start(param_count));
29 graph->SetStart(s);
34 NewNode(common()->Parameter(static_cast<int>(i)), graph->start());
91 Node* call = graph()->NewNode(common()->Call(desc), stub_code, function,
101 Node* call = graph()->NewNode(common()->Call(descriptor), function, receiver,
119 Node* call = graph()->NewNode(common()->Call(descriptor), centry, arg0, ref
[all...] |
| graph-builder.cc | 5 #include "src/compiler/graph-builder.h"
8 #include "src/compiler/generic-graph.h"
11 #include "src/compiler/graph-visualizer.h"
22 StructuredGraphBuilder::StructuredGraphBuilder(Graph* graph,
24 : GraphBuilder(graph),
46 result = graph()->NewNode(op, value_input_count, value_inputs);
71 result = graph()->NewNode(op, input_count_with_deps, buffer);
127 control_dependency_ = graph()->NewNode(common()->Merge(1), other_control);
169 return graph()->NewNode(phi_op, count + 1, buffer)
[all...] |
| js-builtin-reducer-unittest.cc | 5 #include "src/compiler/graph-unittest.h"
7 #include "src/compiler/js-graph.h"
26 JSGraph jsgraph(graph(), common(), javascript(), &typer, &machine);
32 Node* n = graph()->NewNode(common()->Parameter(index), graph()->start());
72 Node* call = graph()->NewNode(javascript()->Call(3, NO_CALL_FUNCTION_FLAGS),
90 Node* call = graph()->NewNode(javascript()->Call(2, NO_CALL_FUNCTION_FLAGS),
105 Node* call = graph()->NewNode(javascript()->Call(3, NO_CALL_FUNCTION_FLAGS),
124 graph()->NewNode(javascript()->Call(4, NO_CALL_FUNCTION_FLAGS), fun,
137 graph()->start()))))))
[all...] |
| js-builtin-reducer.cc | 5 #include "src/compiler/graph-inl.h"
103 Node* value = graph()->NewNode(machine()->Float64Sqrt(), r.left());
126 Node* control = graph()->start();
127 Node* tag = graph()->NewNode(simplified()->NumberLessThan(), value, p);
129 Node* branch = graph()->NewNode(common()->Branch(), tag, control);
130 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
131 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
132 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
134 value = graph()->NewNode(common()->Phi(kMachNone, 2), p, value, merge);
147 Node* value = graph()->NewNode(machine()->Int32Mul(), r.left(), r.right())
[all...] |
| js-graph.h | 10 #include "src/compiler/graph.h"
21 // Implements a facade on a Graph, enhancing the graph with JS-specific
26 JSGraph(Graph* graph, CommonOperatorBuilder* common,
29 : graph_(graph),
86 Graph* graph() { return graph_; } function in class:v8::internal::compiler::JSGraph
87 Zone* zone() { return graph()->zone(); }
91 Graph* graph_
[all...] |
| js-inlining.h | 8 #include "src/compiler/js-graph.h"
34 static void UnifyReturn(Graph* graph);
|
| /art/compiler/sea_ir/types/ |
| type_inference.cc | 39 FunctionTypeInfo::FunctionTypeInfo(const SeaGraph* graph, art::verifier::RegTypeCache* types)
40 : dex_file_(graph->GetDexFile()), dex_method_idx_(graph->method_idx_), type_cache_(types),
41 method_access_flags_(graph->method_access_flags_) {
47 FunctionTypeInfo::FunctionTypeInfo(const SeaGraph* graph, InstructionNode* inst,
48 art::verifier::RegTypeCache* types): dex_file_(graph->GetDexFile()),
143 void TypeInference::ComputeTypes(SeaGraph* graph) SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) {
144 std::vector<Region*>* regions = graph->GetRegions();
154 TypeInferenceVisitor tiv(graph, &type_data_, type_cache_);
156 graph->Accept(&tiv)
[all...] |
| /external/fio/ |
| graph.c | 33 #include "graph.h"
69 struct graph *parent;
77 struct graph { struct
105 void graph_set_size(struct graph *g, unsigned int xdim, unsigned int ydim)
111 void graph_set_position(struct graph *g, double xoffset, double yoffset)
117 struct graph *graph_new(unsigned int xdim, unsigned int ydim, const char *font)
119 struct graph *g;
131 void graph_set_font(struct graph *g, const char *font)
136 void graph_x_axis_unit_change_notify(struct graph *g, graph_axis_unit_change_callback f)
141 void graph_y_axis_unit_change_notify(struct graph *g, graph_axis_unit_change_callback f
[all...] |
| /art/compiler/sea_ir/debug/ |
| dot_gen.h | 44 virtual void Initialize(SeaGraph* graph);
48 void Visit(SeaGraph* graph) {
55 // builds a complete dot graph (without prolog and epilog though).
97 // Stores options for turning a SEA IR graph to a .dot file.
101 // Saves to @filename the .dot representation of @graph with the options @options.
102 void DumpSea(SeaGraph* graph, std::string filename,
106 graph->Accept(&dgv);
|
| /external/chromium_org/tools/ |
| gyp-explain.py | 23 def GetPath(graph, fro, to):
24 """Given a graph in (node -> list of successor nodes) dictionary format,
32 for d in graph[t]:
36 def MatchNode(graph, substring):
40 for target in graph:
|
| /external/svox/pico/lib/ |
| picoklex.h | 102 /** lookup lex by graph; result(s) are in lexres, ie. the phones are
110 const picoos_uint8 *graph,
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/x86_64-linux/32/bits/ |
| ctype_base.h | 57 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/x86_64-linux/bits/ |
| ctype_base.h | 57 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/32/bits/ |
| ctype_base.h | 56 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/bits/ |
| ctype_base.h | 56 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
