| /external/chromium_org/cc/resources/ |
| image_raster_worker_pool.cc | 85 TaskGraph graph; local
94 &graph);
101 &graph);
119 &graph);
146 &graph);
149 SetTaskGraph(&graph);
220 TaskGraph* graph) {
224 graph);
|
| image_raster_worker_pool.h | 50 TaskGraph* graph);
|
| raster_worker_pool_perftest.cc | 76 TaskGraph graph; local
85 &graph);
92 &graph);
107 &graph);
|
| /external/chromium_org/tools/win/split_link/ |
| graph_dependencies.py | 37 # Break into pairs to uniq to make graph less of a mess.
46 graph = 'strict digraph {\n' + '\n'.join(sorted(deduplicated)) + '\n}'
54 f.write(graph)
69 <script type="text/vnd.graphviz" id="graph">
80 Viz(document.getElementById("graph").innerHTML, "svg");
|
| /external/chromium_org/v8/src/ |
| hydrogen-canonicalize.cc | 35 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
63 HRedundantPhiEliminationPhase redundant_phi_eliminator(graph());
|
| hydrogen-environment-liveness.cc | 37 HGraph* graph)
38 : HPhase("H_Environment liveness analysis", graph),
39 block_count_(graph->blocks()->length()),
40 maximum_environment_size_(graph->maximum_environment_size()),
63 simulate->AddAssignedValue(index, graph()->GetConstantUndefined());
65 simulate->SetOperandAt(operand_index, graph()->GetConstantUndefined());
201 HBasicBlock* block = graph()->blocks()->at(block_id);
233 HBasicBlock* block = graph()->blocks()->at(block_id);
|
| hydrogen-mark-deoptimize.cc | 34 const ZoneList<HPhi*>* phi_list = graph()->phi_list();
68 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
|
| hydrogen-removable-simulates.cc | 35 for (int i = 0; i < graph()->blocks()->length(); ++i) {
36 HBasicBlock* block = graph()->blocks()->at(i);
|
| hydrogen-escape-analysis.cc | 65 int block_count = graph()->blocks()->length();
67 HBasicBlock* block = graph()->blocks()->at(i);
87 Zone* zone = graph()->zone();
98 HConstant* undefined = graph()->GetConstantUndefined();
140 Zone* zone = graph()->zone();
153 Zone* zone = graph()->zone();
170 block_states_.AddBlock(NULL, graph()->blocks()->length(), zone());
175 for (int i = start; i < graph()->blocks()->length(); i++) {
176 HBasicBlock* block = graph()->blocks()->at(i);
322 if (graph()->has_osr()) return
[all...] |
| lithium.cc | 249 LChunk::LChunk(CompilationInfo* info, HGraph* graph)
252 graph_(graph),
253 instructions_(32, graph->zone()),
254 pointer_maps_(8, graph->zone()),
255 inlined_closures_(1, graph->zone()) {
283 for (int i = 0; i < graph()->blocks()->length(); ++i) {
284 HBasicBlock* block = graph()->blocks()->at(i);
394 LChunk* LChunk::NewChunk(HGraph* graph) {
397 graph->DisallowAddingNewValues();
398 int values = graph->GetMaximumValueID()
[all...] |
| hydrogen-range-analysis.cc | 59 HBasicBlock* block(graph()->entry_block());
60 ZoneList<Pending> stack(graph()->blocks()->length(), zone());
138 new_range = range->Copy(graph()->zone());
140 new_range = range->CopyClearLower(graph()->zone());
145 new_range = range->CopyClearUpper(graph()->zone());
160 value->ComputeInitialRange(graph()->zone());
182 value->AddNewRange(range, graph()->zone());
|
| hydrogen-mark-unreachable.cc | 35 // If there is unreachable code in the graph, propagate the unreachable marks
38 const ZoneList<HBasicBlock*>* blocks = graph()->blocks();
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| OneShotScheduler.java | 40 public OneShotScheduler(FilterGraph graph) {
41 super(graph);
75 if (mLogVerbose) Log.v(TAG, "One pass through graph completed.");
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.ctype/facet.ctype.special/facet.ctype.char.members/ |
| is_1.pass.cpp | 56 assert(f.is(F::graph, '.'));
57 assert(!f.is(F::graph, '\x07'));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.ctype/locale.ctype.byname/ |
| is_many.pass.cpp | 49 assert( (m[0] & F::graph));
63 assert(!(m[1] & F::graph));
77 assert( (m[2] & F::graph));
91 assert(!(m[3] & F::graph));
105 assert( (m[4] & F::graph));
119 assert( (m[5] & F::graph));
133 assert( (m[6] & F::graph));
158 assert(!(m[0] & F::graph));
172 assert(!(m[1] & F::graph));
186 assert( (m[2] & F::graph));
[all...] |
| /external/ceres-solver/internal/ceres/ |
| canonical_views_clustering.cc | 37 #include "ceres/graph.h"
53 // graph. centers will contain the vertices that are the identified
60 void ComputeClustering(const Graph<int>& graph,
74 const Graph<int>* graph_;
84 const Graph<int>& graph,
90 cv.ComputeClustering(graph, options, centers, membership);
97 const Graph<int>& graph,
[all...] |
| /external/svox/pico/lib/ |
| picoklex.c | 52 - one lex entry has POS GRAPH PHON, all mandatory, but
55 - (POS,GRAPH) is a uniq key (only one entry allowed)
56 - (GRAPH) is almost a uniq key (2-4 entries with the same GRAPH, and
58 - for one graph we can have two or three solutions from the lex
60 - in this case GRAPH, POS, and PHON all must be available in lex
66 - 3 bytes for graph-prefix
270 /* convert graph-prefix to number with 'lexicographic' ordering */
359 const picoos_uint8 *graph,
368 PICODBG_TRACE(("%d|%d graph|lex: %c|%c", graphlen, lexlen
[all...] |
| /external/chromium_org/third_party/lcov/bin/ |
| geninfo | 84 "graph" => $ERROR_GRAPH,
582 --ignore-errors ERROR Continue after ERROR (gcov, source, graph)
655 # graph file. Relative filenames are prefixed with the directory in which the
656 # graph file is found. Note also that symbolic links to the graph file will be
674 $type = "graph";
842 my $bb_filename; # Name of respective graph file
843 my $bb_basename; # Basename of the original graph file
844 my $graph; # Contents of graph fil
[all...] |
| /external/valgrind/main/massif/ |
| ms_print.in | 47 # Graph x and y dimensions.
71 --x=<4..1000> graph width, in columns [72]
72 --y=<4..1000> graph height, in rows [20]
341 # - the graph
477 # Setup for graph.
479 # The ASCII graph.
482 # The rest ([1][1]..[graph_x][graph_y]) is the usable graph area.
483 my @graph;
492 # Setup graph[][].
493 $graph[0][0] = '+'; # axes join poin
[all...] |
| /external/chromium_org/tools/deep_memory_profiler/visualizer/static/ |
| graph-view.js | 6 * This is a view class showing flot graph.
12 this.placeholder_ = '#graph-div';
13 // Update graph view and menu view when profiler model changed.
101 * Update graph view when model updated.
110 var $graph = $(this.placeholder_);
111 this.graph_ = $.plot($graph, data, {
125 // checked y range by accumulated y values because this is a stack graph.
126 $graph.bind('plotclick', function(event, pos, item) {
127 // Get newest lines data from graph.
|
| graph-view_unittest.js | 24 test('graph-view:generateLines_', function() {
35 inspect(lines, 'lines generated by graph view:\n');
|
| /external/chromium_org/content/browser/resources/media/ |
| stats_graph_helper.js | 7 // Each graph represents a series of stats report for a PeerConnection,
8 // e.g. 1234-0-ssrc-abcd123-bytesSent is the graph for the series of bytesSent
16 var STATS_GRAPH_CONTAINER_HEADING_CLASS = 'stats-graph-container-heading';
18 // Specifies which stats should be drawn on the 'bweCompound' graph and how.
82 // The object contains the stats names that should not be added to the graph,
102 // Adds the stats report |report| to the timeline graph for the given
134 // Convert to another value to draw on graph, using the original
150 // Updates the graph.
164 // both the simple and compound graph cases.
196 report.type + '-' + report.id + '-graph-container'
[all...] |
| /external/chromium_org/ppapi/proxy/ |
| raw_var_data.h | 33 // Contains the data associated with a graph of connected PP_Vars. Useful for
34 // serializing/deserializing a graph of PP_Vars. First we compute the transitive
38 // idx | size | (number of vars in the graph)
60 // Construct a new PP_Var from the graph. All of the PP_Vars referenced by
62 // ref-count equal to the number of references it has in the graph of vars.
66 // Write the graph to a message using the given HandleWriter.
83 // A list of the nodes in the graph.
106 // along with the graph it is a part of to be initialized.
108 const std::vector<PP_Var>& graph) = 0;
139 const std::vector<PP_Var>& graph) OVERRIDE
[all...] |
| /external/chromium_org/third_party/angle/src/compiler/depgraph/ |
| DependencyGraphBuilder.h | 13 // Creates a dependency graph of symbols, function calls, conditions etc. by traversing a
18 static void build(TIntermNode* node, TDependencyGraph* graph);
34 // This data structure is stack of sets. Each set contains dependency graph parent nodes.
157 TDependencyGraphBuilder(TDependencyGraph* graph)
161 , mGraph(graph) {}
|
| /external/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 21 #include "llvm/CodeGen/PBQP/Graph.h"
44 PBQP::Graph& getGraph() { return graph; }
46 const PBQP::Graph& getGraph() const { return graph; }
55 void recordVReg(unsigned vreg, PBQP::Graph::NodeItr node,
67 unsigned getVRegForNode(PBQP::Graph::ConstNodeItr node) const;
70 PBQP::Graph::NodeItr getNodeForVReg(unsigned vreg) const;
95 typedef std::map<PBQP::Graph::ConstNodeItr, unsigned,
97 typedef DenseMap<unsigned, PBQP::Graph::NodeItr> VReg2Node
100 PBQP::Graph graph; member in class:llvm::PBQPRAProblem
[all...] |
