HomeSort by relevance Sort by last modified time
    Searched refs:graph (Results 151 - 175 of 377) sorted by null

1 2 3 4 5 67 8 91011>>

  /art/compiler/sea_ir/code_gen/
code_gen.cc 39 void CodeGenPassVisitor::Initialize(SeaGraph* graph) {
42 for (std::vector<Region*>::const_iterator cit = graph->GetRegions()->begin();
43 cit != graph->GetRegions()->end(); cit++ ) {
59 void CodeGenPostpassVisitor::Visit(SeaGraph* graph) { }
60 void CodeGenVisitor::Visit(SeaGraph* graph) { }
61 void CodeGenPrepassVisitor::Visit(SeaGraph* graph) {
62 std::vector<SignatureNode*>* parameters = graph->GetParameterNodes();
69 const Type* param_type = graph->ti_->type_data_.FindTypeOf((*param_iterator)->Id());
70 DCHECK(param_type->Equals(graph->ti_->type_cache_->Integer()))
76 const Type* return_type = graph->ti_->type_data_.FindTypeOf(-1)
    [all...]
code_gen.h 89 virtual void Initialize(SeaGraph* graph);
106 void Visit(SeaGraph* graph);
130 void Visit(SeaGraph* graph);
151 void Visit(SeaGraph* graph);
  /art/compiler/sea_ir/debug/
dot_gen.cc 23 void DotGenerationVisitor::Initialize(SeaGraph* graph) {
24 graph_ = graph;
27 for (std::vector<Region*>::const_iterator cit = graph->GetRegions()->begin();
28 cit != graph->GetRegions()->end(); cit++ ) {
117 // builds a complete dot graph (without prolog and epilog though).
  /build/core/tasks/
product-graph.mk 37 this_makefile := build/core/tasks/product-graph.mk
73 @echo Product graph DOT: $@ for $(PRIVATE_PRODUCTS_FILTER)
75 $(hide) echo 'graph [ ratio=.5 ];' >> $@.in
80 $(hide) ./build/tools/filter-product-graph.py $(PRIVATE_PRODUCTS_FILTER) < $@.in > $@
139 @echo Product graph PDF: $@
143 @echo Product graph SVG: $@
146 product-graph: $(products_pdf) $(products_svg)
  /external/chromium_org/chrome/browser/resources/net_internals/
timeline_view.css 83 #timeline-view-graph-div {
87 #timeline-view-graph-canvas {
  /external/chromium_org/media/video/capture/win/
filter_base_win.h 44 STDMETHOD(JoinFilterGraph)(IFilterGraph* graph, LPCWSTR name);
filter_base_win.cc 110 STDMETHODIMP FilterBase::JoinFilterGraph(IFilterGraph* graph, LPCWSTR name) {
111 owning_graph_ = graph;
  /external/chromium_org/v8/src/
hydrogen-dehoist.cc 67 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
hydrogen-infer-types.cc 35 HBasicBlock* block = graph()->blocks()->at(i);
lithium-codegen.h 56 HGraph* graph() const;
hydrogen-gvn.cc 366 HGlobalValueNumberingPhase::HGlobalValueNumberingPhase(HGraph* graph)
367 : HPhase("H_Global value numbering", graph),
369 block_side_effects_(graph->blocks()->length(), zone()),
370 loop_side_effects_(graph->blocks()->length(), zone()),
371 visited_on_paths_(graph->blocks()->length(), zone()) {
373 block_side_effects_.AddBlock(GVNFlagSet(), graph->blocks()->length(),
375 loop_side_effects_.AddBlock(GVNFlagSet(), graph->blocks()->length(),
396 for (int i = graph()->blocks()->length() - 1; i >= 0; --i) {
398 HBasicBlock* block = graph()->blocks()->at(i);
516 graph()->use_optimistic_licm() ? "yes" : "no")
    [all...]
hydrogen-uint32-analysis.cc 214 if (!graph()->has_uint32_instructions()) return;
216 ZoneList<HInstruction*>* uint32_instructions = graph()->uint32_instructions();
  /external/sonivox/jet_tools/JetCreator/
JetPreview.py 44 self.graph = None
46 def SetGraphCtrl(self, graph, parentWin):
47 """ Sets the graph control for the player """
48 self.graph = graph
52 """ Sets the callback function for the graph control to update """
  /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/
MffContext.java 95 /** The set of graph runners within this context */
319 void addGraph(FilterGraph graph) {
321 mGraphs.add(graph);
430 for (FilterGraph graph : mGraphs) {
431 graph.tearDown();
FilterGraph.java 37 * A graph of Filter nodes.
40 * ports. Every filter belongs to exactly one graph and cannot be moved to another graph.
42 * FilterGraphs may contain sub-graphs that are dependent on the parent graph. These are typically
43 * used when inserting sub-graphs into MetaFilters. When a parent graph is torn down so are its
44 * sub-graphs. The same applies to flushing frames of a graph.
50 /** The context that this graph lives in */
59 /** The GraphRunner currently attached to this graph */
62 /** The set of sub-graphs of this graph */
65 /** The parent graph of this graph, or null it this graph is a root graph. *
272 FilterGraph graph = new FilterGraph(mContext, parent); local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/
radeon_pair_regalloc.c 547 struct ra_graph * graph; local
634 graph = ra_alloc_interference_graph(regs, node_count + s->NumInputs);
636 /* Build the interference graph */
642 ra_set_node_class(graph, node_index, node_classes[node_index]);
651 ra_add_node_interference(graph,
661 /* Add input registers to the interference graph */
666 ra_set_node_class(graph, node_count + input_node,
673 ra_add_node_interference(graph, node_index,
678 ra_set_node_reg(graph, node_count + input_node, get_reg_id(
683 if (!ra_allocate_no_spills(graph)) {
    [all...]
  /external/mesa3d/src/gallium/drivers/r300/compiler/
radeon_pair_regalloc.c 547 struct ra_graph * graph; local
634 graph = ra_alloc_interference_graph(regs, node_count + s->NumInputs);
636 /* Build the interference graph */
642 ra_set_node_class(graph, node_index, node_classes[node_index]);
651 ra_add_node_interference(graph,
661 /* Add input registers to the interference graph */
666 ra_set_node_class(graph, node_count + input_node,
673 ra_add_node_interference(graph, node_index,
678 ra_set_node_reg(graph, node_count + input_node, get_reg_id(
683 if (!ra_allocate_no_spills(graph)) {
    [all...]
  /external/v8/src/
hydrogen.cc 55 HBasicBlock::HBasicBlock(HGraph* graph)
56 : block_id_(graph->GetNextBlockID()),
57 graph_(graph),
437 // Checks reachability of the blocks in this graph and stores a bit in
439 // from the start block of the graph. If "dont_visit" is non-null, the given
440 // block is treated as if it would not be part of the graph. "visited_count()"
536 // Check that the graph is fully connected.
982 explicit HRangeAnalysis(HGraph* graph) :
983 graph_(graph), zone_(graph->isolate()->zone()), changed_ranges_(16) {
1441 HGraph* graph() { return graph_; } function in class:v8::internal::BASE_EMBEDDED
    [all...]
  /external/dropbear/libtommath/
booker.pl 15 $graph = "";
17 $graph = ".ps";
254 print OUT "\\begin{center}\n\\begin{figure}[here]\n\\includegraphics{pics/$m[1]$graph}\n";
  /external/opencv/cxcore/include/
cxcore.h 1198 CVAPI(void) cvClearGraph( CvGraph* graph ); variable
1245 CvGraph* graph; \/* the graph *\/ member in struct:CvGraphScanner
    [all...]
  /external/chromium_org/chrome/test/perf/
shutdown_test.cc 69 void RunShutdownTest(const char* graph, const char* trace,
119 graph, std::string(), trace, times, "ms", important);
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_graph.h 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
34 // A connected graph.
35 class Graph
72 friend class Graph;
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
99 Graph::Edge *e;
100 Graph::Edge *t;
129 Graph *getGraph() const { return graph;
136 Graph *graph; member in class:nv50_ir::Graph::Node
    [all...]
  /external/chromium_org/tools/code_coverage/
croc.css 58 td.graph {
  /external/chromium_org/tools/deep_memory_profiler/visualizer/static/
index.css 33 #graph-div {
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/performance/ui/
ScenarioData.java 98 TimeLineGraph graph = new TimeLineGraph(scenarioName + ": " + dim.getName(), dim); local
121 graph.addItem("main", label, dim.getDisplayValue(value), value, color, true, Utils.getDateFromBuildID(buildID), true);
125 graph.addItem("main", label, dim.getDisplayValue(value), value, black, false, Utils.getDateFromBuildID(buildID, false), true);
130 graph.addItem("main", buildID, dim.getDisplayValue(value), value, yellow, false, Utils.getDateFromBuildID(buildID), false);
136 graph.addItem("main", buildID, dim.getDisplayValue(value), value, black, false, Utils.getDateFromBuildID(buildID), false);
142 graph.addItem("reference", label, dim.getDisplayValue(value), value, magenta, true, Utils.getDateFromBuildID(buildID, true), true, drawBaseline);
147 graph.addItem("reference", label, dim.getDisplayValue(value), value, magenta, false, Utils.getDateFromBuildID(buildID, true), false);
152 return graph;
270 stream.print("<b>Click measurement name to view line graph of measured values over builds.</b><br><br>\n");
425 stream.print("<a href=\"../"+scenarioFileName+".html\">VIEW GRAPH</a><br><br>\n"); //$NON-NLS-1
    [all...]

Completed in 1356 milliseconds

1 2 3 4 5 67 8 91011>>