| /external/libvorbis/examples/ |
| frameview.pl | 289 my($graph)=@_;
294 my$w=$graph->{"canvas"};
304 if($graph->{"vars"}->[$i]){
306 if(!defined($graph->{"minx"})){
308 $graph->{"maxx"}=$1;
309 $graph->{"minx"}=$1;
310 $graph->{"maxy"}=$2;
311 $graph->{"miny"}=$2;
317 $rescale=1 if($1>$graph->{"maxx"});
318 $rescale=1 if($1<$graph->{"minx"})
[all...] |
| /external/chromium_org/third_party/angle/src/compiler/timing/ |
| RestrictFragmentShaderTiming.cpp | 38 void RestrictFragmentShaderTiming::enforceRestrictions(const TDependencyGraph& graph)
42 // FIXME(mvujovic): The dependency graph does not support user defined function calls right now,
44 validateUserDefinedFunctionCallUsage(graph);
46 // Starting from each sampler, traverse the dependency graph and generate an error each time we
48 for (TGraphSymbolVector::const_iterator iter = graph.beginSamplerSymbols();
49 iter != graph.endSamplerSymbols();
58 void RestrictFragmentShaderTiming::validateUserDefinedFunctionCallUsage(const TDependencyGraph& graph)
60 for (TFunctionCallVector::const_iterator iter = graph.beginUserDefinedFunctionCalls();
61 iter != graph.endUserDefinedFunctionCalls();
|
| RestrictFragmentShaderTiming.h | 20 void enforceRestrictions(const TDependencyGraph& graph);
30 void validateUserDefinedFunctionCallUsage(const TDependencyGraph& graph);
|
| /external/ceres-solver/internal/ceres/ |
| parameter_block_ordering_test.cc | 37 #include "ceres/graph.h"
48 typedef Graph<ParameterBlock*> HessianGraph;
86 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program));
88 const VertexSet& vertices = graph->vertices();
96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]);
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]);
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]);
117 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[3]);
131 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program));
132 EXPECT_EQ(graph->vertices().size(), 0)
[all...] |
| schur_ordering_test.cc | 37 #include "ceres/graph.h"
48 typedef Graph<ParameterBlock*> HessianGraph;
86 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program));
88 const VertexSet& vertices = graph->vertices();
96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]);
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]);
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]);
117 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[3]);
131 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program));
132 EXPECT_EQ(graph->vertices().size(), 0)
[all...] |
| canonical_views_clustering.h | 49 #include "ceres/graph.h"
59 // Compute a partitioning of the vertices of the graph using the
63 // interchangably. Given a weighted Graph G(V,E), the canonical views
65 // of the graph. If w_ij i s the weight connecting the vertex i to
80 // for each vertex in the graph which best explains it, while trying
103 const Graph<int>& graph,
|
| graph_algorithms.h | 40 #include "ceres/graph.h"
46 // Compare two vertices of a graph by their degrees, if the degrees
51 explicit VertexTotalOrdering(const Graph<Vertex>& graph)
52 : graph_(graph) {}
62 const Graph<Vertex>& graph_;
68 explicit VertexDegreeLessThan(const Graph<Vertex>& graph)
69 : graph_(graph) {}
76 const Graph<Vertex>& graph_
[all...] |
| /art/compiler/sea_ir/types/ |
| type_inference.h | 37 // Computes the types for the method with SEA IR representation provided by @graph.
38 void ComputeTypes(SeaGraph* graph);
52 // Finds method information about the method encoded by a SEA IR graph.
53 // @graph provides the input method SEA IR representation.
56 FunctionTypeInfo(const SeaGraph* graph, art::verifier::RegTypeCache* types);
58 // an invocation instruction in a SEA IR graph.
59 // @graph provides the input method SEA IR representation.
63 FunctionTypeInfo(const SeaGraph* graph, InstructionNode* inst,
|
| type_inference_visitor.h | 37 TypeInferenceVisitor(SeaGraph* graph, TypeData* type_data,
39 graph_(graph), type_data_(type_data), type_cache_(types), crt_type_() {
42 void Initialize(SeaGraph* graph) { }
43 void Visit(SeaGraph* graph);
|
| /external/chromium_org/third_party/angle/src/compiler/depgraph/ |
| DependencyGraphOutput.cpp | 53 void TDependencyGraphOutput::outputAllSpanningTrees(TDependencyGraph& graph)
57 for (TGraphNodeVector::const_iterator iter = graph.begin(); iter != graph.end(); ++iter)
60 mSink << "--- Dependency graph spanning tree ---\n";
|
| DependencyGraphOutput.h | 23 void outputAllSpanningTrees(TDependencyGraph& graph);
|
| /external/chromium_org/v8/src/ |
| hydrogen-bce.h | 54 explicit HBoundsCheckEliminationPhase(HGraph* graph)
55 : HPhase("H_Bounds checks elimination", graph), table_(zone()) { }
58 EliminateRedundantBoundsChecks(graph()->entry_block());
|
| hydrogen-osr.cc | 44 HGraph* graph = builder_->graph(); local
47 ASSERT(graph->osr() == NULL);
49 // remember this builder as the one OSR builder in the graph.
50 graph->set_osr(this);
52 HBasicBlock* non_osr_entry = graph->CreateBasicBlock();
53 osr_entry_ = graph->CreateBasicBlock();
54 HValue* true_value = graph->GetConstantTrue();
59 HBasicBlock* loop_predecessor = graph->CreateBasicBlock();
|
| hydrogen-range-analysis.h | 39 explicit HRangeAnalysisPhase(HGraph* graph)
40 : HPhase("H_Range analysis", graph), changed_ranges_(16, zone()) { }
|
| hydrogen-sce.cc | 39 for (int i = 0; i < graph()->blocks()->length(); i++) {
40 HBasicBlock* block = graph()->blocks()->at(i);
|
| hydrogen-bch.cc | 42 * perform the hoisting only if graph()->use_optimistic_licm() is true.
105 HGraph* graph() const { return graph_; } function in class:v8::internal::BASE_EMBEDDED
106 Counters* counters() const { return graph()->isolate()->counters(); }
120 for (int i = 0; i < graph()->blocks()->length(); i++) {
136 * The problem is that in the loop code graph there could be execution paths
200 explicit InductionVariableBlocksTable(HGraph* graph)
201 : graph_(graph), loop_header_(NULL),
202 elements_(graph->blocks()->length(), graph->zone()) {
203 for (int i = 0; i < graph->blocks()->length(); i++)
[all...] |
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| RandomScheduler.java | 33 public RandomScheduler(FilterGraph graph) {
34 super(graph);
|
| RoundRobinScheduler.java | 32 public RoundRobinScheduler(FilterGraph graph) {
33 super(graph);
|
| FilterContext.java | 105 for (FilterGraph graph : mGraphs) {
106 graph.tearDown(this);
123 final void addGraph(FilterGraph graph) {
124 mGraphs.add(graph);
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 31 Graph::Graph()
38 Graph::~Graph()
44 void Graph::insert(Node *node)
49 node->graph = this;
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
87 Graph::Node::Node(void *priv) : data(priv),
88 in(0), out(0), graph(0)
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 31 Graph::Graph()
38 Graph::~Graph()
44 void Graph::insert(Node *node)
49 node->graph = this;
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
87 Graph::Node::Node(void *priv) : data(priv),
88 in(0), out(0), graph(0)
[all...] |
| /frameworks/base/media/mca/filterfw/java/android/filterfw/ |
| GraphEnvironment.java | 35 * A GraphEnvironment provides a simple front-end to filter graph setup and execution using the
38 * 2. Perform any configuration, such as adding graph references and setting a GL environment.
39 * 3. Load a graph file using loadGraph() or add a graph using addGraph().
59 public GraphHandle(FilterGraph graph) {
60 mGraph = graph;
95 * @param reader The GraphReader to use for graph loading, or null to auto-create one.
97 * null if you will not load any graph files.
105 * Returns the used graph reader. This will create one, if a reader has not been set already.
115 * Add graph references to resolve during graph reading. The references added here are share
133 FilterGraph graph = null; local
[all...] |
| /external/opencv/cvaux/src/ |
| cvclique.cpp | 56 CvGraph* graph;
58 int N; //graph size
92 void _MarkNodes( CvGraph* graph )
95 for( int i = 0; i < graph->total; i++ )
97 CvGraphVtx* ver = cvGetGraphVtx( graph, i );
105 void _FillAdjMatrix( CvGraph* graph, int** connected, int reverse )
108 for( int i = 0; i < graph->total; i++ )
110 for( int j = 0; j < graph->total; j++ )
114 //memset( connected[i], 0, sizeof(int)*graph->total );
115 CvGraphVtx* ver = cvGetGraphVtx( graph, i )
[all...] |
| /external/chromium_org/cc/resources/ |
| worker_pool_perftest.cc | 74 TaskGraph graph; local
86 &graph,
95 graph.set(leaf_task, leaf_node.Pass());
98 graph.set(root_task, root_node.Pass());
100 SetTaskGraph(&graph);
109 TaskGraph* graph,
122 graph,
138 graph->set(task.get(), node.Pass());
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| networkLogView.css | 127 .network-log-grid.data-grid.small .network-graph-side {
256 /* Graph styles */
258 .network-graph-side {
268 .network-graph-bar-area {
274 .network-graph-bar-area,
282 .network-graph-label {
299 .network-graph-side:hover .network-graph-label {
303 .network-graph-label:empty {
307 .network-graph-label.waiting
[all...] |
