| /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/chromium_org/v8/src/compiler/ |
| simplified-operator-reducer-unittest.cc | 5 #include "src/compiler/graph-unittest.h"
6 #include "src/compiler/js-graph.h"
27 JSGraph jsgraph(graph(), common(), &javascript, &typer, &machine);
165 graph()->NewNode((simplified()->*unop.constructor)(), Parameter(0)));
182 graph()->NewNode(simplified()->BooleanNot(),
183 graph()->NewNode(simplified()->BooleanNot(), param0)));
191 Reduce(graph()->NewNode(simplified()->BooleanNot(), FalseConstant()));
199 Reduce(graph()->NewNode(simplified()->BooleanNot(), TrueConstant()));
211 Reduction reduction = Reduce(graph()->NewNode(
213 graph()->NewNode(simplified()->ChangeBoolToBit(), param0)))
[all...] |
| graph-reducer-unittest.cc | 5 #include "src/compiler/graph.h"
6 #include "src/compiler/graph-reducer.h"
50 GraphReducer reducer(graph());
56 GraphReducer reducer(graph());
63 GraphReducer reducer(graph());
70 Graph* graph() { return &graph_; } function in class:v8::internal::compiler::GraphReducerTest
73 Graph graph_;
79 Node* node0 = graph()->NewNode(&OP0);
80 Node* node1 = graph()->NewNode(&OP1, node0)
[all...] |
| graph-reducer.h | 15 class Graph;
19 // Represents the result of trying to reduce a node in the graph.
33 // inputs. This class functions as an extension point for the graph reducer for
35 // folding of low-level operators) can be integrated into the graph reduction
55 // Performs an iterative reduction of a node graph.
58 explicit GraphReducer(Graph* graph);
60 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::FINAL
66 // Reduce the whole graph
[all...] |
| js-builtin-reducer.h | 8 #include "src/compiler/graph-reducer.h"
9 #include "src/compiler/js-graph.h"
28 Graph* graph() const { return jsgraph_->graph(); } function in class:v8::internal::compiler::FINAL
|
| graph-reducer.cc | 5 #include "src/compiler/graph-reducer.h"
9 #include "src/compiler/graph-inl.h"
15 GraphReducer::GraphReducer(Graph* graph)
16 : graph_(graph), reducers_(graph->zone()) {}
90 graph()->VisitNodeInputsFromEnd(&visitor);
94 // TODO(titzer): partial graph reductions.
|
| machine-operator-reducer-unittest.cc | 6 #include "src/compiler/graph-unittest.h"
7 #include "src/compiler/js-graph.h"
24 JSGraph jsgraph(graph(), common(), &javascript, &typer, &machine_);
235 Reduce(graph()->NewNode((machine()->*unop.constructor)(), Parameter(0)));
251 Reduction reduction = Reduce(graph()->NewNode(
266 Reduction reduction = Reduce(graph()->NewNode(
268 graph()->NewNode(machine()->ChangeInt32ToFloat64(), value)));
276 Reduction reduction = Reduce(graph()->NewNode(
291 Reduction reduction = Reduce(graph()->NewNode(
293 graph()->NewNode(machine()->ChangeUint32ToFloat64(), value)))
[all...] |
| scheduler.h | 18 // Computes a schedule from a graph, placing nodes into basic blocks and
23 // Create a new schedule and place all nodes from the graph into it.
24 static Schedule* ComputeSchedule(Graph* graph);
30 // Build and connect the CFG for a node graph, but don't schedule nodes.
31 static void ComputeCFG(Graph* graph, Schedule* schedule);
48 Graph* graph_;
55 Scheduler(Zone* zone, Graph* graph, Schedule* schedule)
[all...] |
| change-lowering-unittest.cc | 7 #include "src/compiler/graph-unittest.h"
8 #include "src/compiler/js-graph.h"
72 return graph()->NewNode(common()->Parameter(index), graph()->start());
79 JSGraph jsgraph(graph(), common(), &javascript, &typer, &machine);
127 Node* node = graph()->NewNode(simplified()->ChangeBitToBool(), val);
137 IsBranch(val, graph()->start()))),
144 Node* node = graph()->NewNode(simplified()->ChangeBoolToBit(), val);
154 Node* node = graph()->NewNode(simplified()->ChangeFloat64ToTagged(), val);
164 IsAllocateHeapNumber(IsValueEffect(val), graph()->start()))
[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/ |
| raster_worker_pool.cc | 134 TaskGraph* graph) {
137 for (TaskGraph::Node::Vector::iterator it = graph->nodes.begin();
138 it != graph->nodes.end();
152 void RasterWorkerPool::InsertNodeForTask(TaskGraph* graph,
156 DCHECK(std::find_if(graph->nodes.begin(),
157 graph->nodes.end(),
159 graph->nodes.end());
160 graph->nodes.push_back(TaskGraph::Node(task, priority, dependencies));
165 TaskGraph* graph,
183 // Add decode task if it doesn't already exists in graph
[all...] |
| task_graph_runner.cc | 19 DependentIterator(TaskGraph* graph, const Task* task)
20 : graph_(graph),
73 explicit DependencyMismatchComparator(const TaskGraph* graph)
74 : graph_(graph) {}
165 void TaskGraphRunner::ScheduleTasks(NamespaceToken token, TaskGraph* graph) {
169 graph->nodes.size(),
171 graph->edges.size());
174 DCHECK(std::find_if(graph->nodes.begin(),
175 graph->nodes.end(),
176 DependencyMismatchComparator(graph)) =
[all...] |
| /external/ceres-solver/internal/ceres/ |
| 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...] |
| /prebuilts/eclipse/maven/apache-maven-3.2.1/lib/ |
| aether-util-0.9.0.M2.jar | |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| networkLogView.css | 108 .network-log-grid.data-grid.small .network-graph-side {
257 /* Graph styles */
259 .network-graph-side {
269 .network-graph-bar-area {
275 .network-graph-bar-area,
283 .network-graph-label {
299 .network-graph-side:hover .network-graph-label {
303 .network-graph-label:empty {
307 .network-graph-label.waiting
[all...] |
| /external/chromium_org/v8/src/ |
| hydrogen-bch.cc | 19 * perform the hoisting only if graph()->use_optimistic_licm() is true.
82 HGraph* graph() const { return graph_; } function in class:v8::internal::BASE_EMBEDDED
83 Counters* counters() const { return graph()->isolate()->counters(); }
97 for (int i = 0; i < graph()->blocks()->length(); i++) {
113 * The problem is that in the loop code graph there could be execution paths
177 explicit InductionVariableBlocksTable(HGraph* graph)
178 : graph_(graph), loop_header_(NULL),
179 elements_(graph->blocks()->length(), graph->zone()) {
180 for (int i = 0; i < graph->blocks()->length(); i++)
[all...] |
| hydrogen-check-elimination.h | 18 explicit HCheckEliminationPhase(HGraph* graph)
19 : HPhase("H_Check Elimination", graph), aliasing_(),
24 graph->isolate()->factory()->name##_map()), zone());
|
| hydrogen-escape-analysis.h | 17 explicit HEscapeAnalysisPhase(HGraph* graph)
18 : HPhase("H_Escape analysis", graph),
23 block_states_(graph->blocks()->length(), zone()) { }
|
| /art/compiler/optimizing/ |
| ssa_test.cc | 33 explicit SsaPrettyPrinter(HGraph* graph) : HPrettyPrinter(graph), str_("") {}
65 static void ReNumberInstructions(HGraph* graph) {
67 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) {
68 HBasicBlock* block = graph->GetBlocks().Get(i);
83 HGraph* graph = builder.BuildGraph(*item); local
84 ASSERT_NE(graph, nullptr);
86 graph->BuildDominatorTree();
87 graph->TransformToSSA();
88 ReNumberInstructions(graph);
[all...] |
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| 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/angle/src/compiler/translator/depgraph/ |
| DependencyGraphOutput.h | 23 void outputAllSpanningTrees(TDependencyGraph& graph);
|
| /art/compiler/sea_ir/ir/ |
| visitor.h | 45 virtual void Initialize(SeaGraph* graph) = 0;
46 virtual void Visit(SeaGraph* graph) = 0;
65 virtual void Traverse(SeaGraph* graph);
|
| /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/ |
| GraphRunner.java | 27 * A GraphRunner schedules and executes the filter nodes of a graph.
197 public void enterSubGraph(FilterGraph graph, SubListener listener) {
199 onOpenGraph(graph);
289 private void onPrepare(FilterGraph graph) {
293 onOpenGraph(graph);
297 private void onOpenGraph(FilterGraph graph) {
298 loadFilters(graph);
299 mOpenedGraphs.add(graph);
380 for (FilterGraph graph : mOpenedGraphs) {
381 graph.flushFrames()
[all...] |
