| /external/chromium_org/v8/src/ |
| lithium-codegen.cc | 52 HGraph* LCodeGenBase::graph() const { function in class:v8::internal::LCodeGenBase
53 return chunk()->graph();
108 ASSERT(!graph()->info()->IsOptimizing() ||
143 for (int i = current_block_ + 1; i < graph()->blocks()->length(); ++i) {
|
| hydrogen-representation-changes.cc | 54 Maybe<HConstant*> res = constant->CopyToTruncatedInt32(graph()->zone());
57 new_value = constant->CopyToRepresentation(to, graph()->zone());
62 new_value = new(graph()->zone()) HChange(
67 ASSERT(!FLAG_emit_opt_code_positions || !graph()->info()->IsOptimizing());
110 const ZoneList<HPhi*>* phi_list(graph()->phi_list());
179 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
|
| code-stubs-hydrogen.cc | 38 static LChunk* OptimizeGraph(HGraph* graph) {
43 ASSERT(graph != NULL);
45 if (!graph->Optimize(&bailout_reason)) {
48 LChunk* chunk = LChunk::NewChunk(graph);
50 FATAL(GetBailoutReason(graph->info()->bailout_reason()));
147 HEnvironment* start_environment = graph()->start_environment();
171 stack_parameter_count = graph()->GetConstantMinus1();
172 arguments_length_ = graph()->GetConstant0();
190 HInstruction* constant_one = graph()->GetConstant1();
232 HValue* undefined = graph()->GetConstantUndefined()
[all...] |
| hydrogen-flow-engine.h | 75 // over a graph of basic blocks, either one block at a time (local analysis)
76 // or over the entire graph (global analysis). The flow engine is parameterized
78 // graph.
83 // are necessary to correctly handle loops in the control flow graph without
93 HFlowEngine(HGraph* graph, Zone* zone)
94 : graph_(graph),
97 pred_counts_(graph->blocks()->length(), zone),
99 block_states_(graph->blocks()->length(), zone),
100 loop_effects_(graph->blocks()->length(), zone) {
198 if (root->block_id() == 0) return false; // Visit the whole graph
[all...] |
| hydrogen-infer-representation.cc | 45 const ZoneList<HPhi*>* phi_list = graph()->phi_list();
139 for (int i = 0; i < graph()->blocks()->length(); ++i) {
140 HBasicBlock* block = graph()->blocks()->at(i);
161 for (int i = 0; i < graph()->blocks()->length(); ++i) {
162 HBasicBlock* block = graph()->blocks()->at(i);
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| SyncRunner.java | 45 public SyncRunner(FilterContext context, FilterGraph graph, Class schedulerClass) {
56 mScheduler = (Scheduler)schedulerConstructor.newInstance(graph);
72 // Associate this runner and the graph with the context
74 mFilterContext.addGraph(graph);
80 // Setup graph filters
81 graph.setupFilters();
92 throw new RuntimeException("Trying to process graph that is not open!");
104 if (mLogVerbose) Log.v(TAG, "Closing graph.");
150 throw new RuntimeException("SyncRunner does not support stopping a graph!");
224 throw new RuntimeException("Calling step on scheduler with no graph in place!")
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.ctype/locale.ctype.byname/ |
| is_1.pass.cpp | 60 assert(f.is(F::graph, L'.'));
61 assert(!f.is(F::graph, L'\x07'));
103 assert(f.is(F::graph, L'.'));
104 assert(!f.is(F::graph, L'\x07'));
|
| /external/chromium_org/tools/code_coverage/ |
| croc_html.py | 208 graph = sec_hdr.E('th', e_class='section')
209 graph.E('span', style='color:#00FF00').Text('exe')
210 graph.Text(' / ')
211 graph.E('span', style='color:#FFFF00').Text('inst')
212 graph.Text(' / ')
213 graph.E('span', style='color:#FF0000').Text('miss')
222 """Adds a bar graph to the element. This is a series of <td> elements.
252 # Add percent and graph; only fill in if there's something in there
253 graph = row.E('td', e_class='graph', width=100
[all...] |
| /external/chromium_org/native_client_sdk/src/examples/demo/earth/ |
| example.js | 47 var graph = document.createElement('canvas');
48 graph.width = img.width;
49 graph.height = img.height;
50 var context = graph.getContext('2d');
|
| /external/chromium_org/third_party/angle/src/compiler/ |
| Compiler.cpp | 339 TDependencyGraph graph(root);
342 bool success = enforceFragmentShaderTimingRestrictions(graph);
344 // Then, output the dependency graph.
347 output.outputAllSpanningTrees(graph);
361 TDependencyGraph graph(root);
363 for (TFunctionCallVector::const_iterator iter = graph.beginUserDefinedFunctionCalls();
364 iter != graph.endUserDefinedFunctionCalls();
379 bool TCompiler::enforceFragmentShaderTimingRestrictions(const TDependencyGraph& graph)
382 restrictor.enforceRestrictions(graph);
|
| /external/chromium_org/tools/deep_memory_profiler/visualizer/ |
| template.py | 26 <script src="../visualizer/static/graph-view.js"></script>
43 <div id="graph-div"></div>
63 html_handle, html_path = tempfile.mkstemp('.html', 'graph', html_dir)
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.ctype/ |
| ctype_base.pass.cpp | 33 // static const mask graph = alnum | punct;
64 assert(std::ctype_base::graph == (std::ctype_base::alnum | std::ctype_base::punct));
77 test(std::ctype_base::graph);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.ctype/locale.ctype/locale.ctype.members/ |
| is_1.pass.cpp | 56 assert(f.is(F::graph, L'.'));
57 assert(!f.is(F::graph, L'\x07'));
|
| is_many.pass.cpp | 46 assert(!(m[0] & F::graph));
60 assert( (m[1] & F::graph));
74 assert(!(m[2] & F::graph));
88 assert( (m[3] & F::graph));
102 assert( (m[4] & F::graph));
116 assert( (m[5] & F::graph));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.ctype/facet.ctype.special/facet.ctype.char.members/ |
| is_many.pass.cpp | 46 assert(!(m[0] & F::graph));
60 assert( (m[1] & F::graph));
74 assert(!(m[2] & F::graph));
88 assert( (m[3] & F::graph));
102 assert( (m[4] & F::graph));
116 assert( (m[5] & F::graph));
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| timelinePanel.css | 36 #timeline-overview-panel .timeline-graph-bar {
122 .timeline-graph-side.hovered {
298 .timeline-graph-side {
308 .timeline-graph-side.selected {
312 .timeline-graph-bar-area {
321 .timeline-graph-bar {
334 .timeline-graph-bar.with-children {
339 .timeline-graph-bar.cpu {
343 .timeline-graph-side.background .timeline-graph-bar
[all...] |
| /external/chromium_org/ppapi/proxy/ |
| raw_var_data.cc | 76 // This function uses a stack-based DFS search to traverse the var graph. Each
88 scoped_ptr<RawVarDataGraph> graph(new RawVarDataGraph);
95 &graph->data_)));
99 RawVarData* current_var_data = graph->data_[stack.top().data_index];
132 &graph->data_);
134 if (!graph->data_[child_id]->initialized())
151 &graph->data_);
154 if (!graph->data_[child_id]->initialized())
159 return graph.Pass();
163 // Create and initialize each node in the graph
164 std::vector<PP_Var> graph; local
171 ScopedPPVar(ScopedPPVar::PassRef(), graph[i]); local
[all...] |
| /external/chromium_org/cc/resources/ |
| worker_pool.cc | 89 // Schedule running of tasks in |graph|. Tasks previously scheduled but
95 void SetTaskGraph(TaskGraph* graph);
210 void WorkerPool::Inner::SetTaskGraph(TaskGraph* graph) {
211 // It is OK to call SetTaskGraph() after shutdown if |graph| is empty.
212 DCHECK(graph->empty() || !shutdown_);
218 new_pending_tasks.swap(*graph);
253 // TODO(reveman): Create this queue when building the task graph instead.
424 void WorkerPool::SetTaskGraph(TaskGraph* graph) {
426 "num_tasks", graph->size());
430 inner_->SetTaskGraph(graph);
[all...] |
| raster_worker_pool.cc | 551 TaskGraph* graph) {
553 DCHECK(graph->find(task) == graph->end());
554 graph->set(task, make_scoped_ptr(node));
563 TaskGraph* graph) {
567 raster_task, priority, graph);
580 // Check if decode task already exists in graph.
581 GraphNodeMap::iterator decode_it = graph->find(decode_task);
582 if (decode_it != graph->end()) {
589 decode_task, priority, graph);
[all...] |
| /external/opencv/cxcore/src/ |
| cxdatastructs.cpp | 2880 CvGraph *graph = 0; local
[all...] |
| /external/chromium_org/chrome/test/perf/ |
| startup_test.cc | 148 void RunPerfTestWithManyTabs(const char* graph, const char* trace,
152 void RunStartupTest(const char* graph, const char* trace,
262 graph, std::string(), trace, times, "ms", important);
273 graph, std::string(), name.c_str(), times, "ms", important);
280 graph, std::string(), name.c_str(), times, "ms", important);
289 graph, std::string(), name.c_str(), times, "ms", important);
299 graph, std::string(), name.c_str(), times, "ms", important);
337 void StartupTest::RunPerfTestWithManyTabs(const char* graph, const char* trace,
369 RunStartupTest(graph, trace, WARM, NOT_IMPORTANT,
|
| /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/ |
| GraphExporter.java | 36 * Exports the graph as DOT (see http://en.wikipedia.org/wiki/DOT_language).
37 * Using the exported file, the graph can be visualized e.g. with the command line tool dot.
44 * 2. adb pull /data/data/<application name>/files/<graph filename>.gv graph.gv
45 * 3. dot -Tpng graph.gv -o graph.png
46 * 4. eog graph.png
48 static public void exportAsDot(FilterGraph graph, String filename,
52 Context myAppContext = graph.getContext().getApplicationContext();
53 Filter[] filters = graph.getAllFilters()
[all...] |
| /external/chromium_org/third_party/re2/benchlog/ |
| mktable | 34 sub graph() { subroutine
119 "graph" => \&graph,
|
| /external/regex-re2/benchlog/ |
| mktable | 34 sub graph() { subroutine
119 "graph" => \&graph,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.traits/ |
| lookup_classname.pass.cpp | 83 test("graph", std::ctype_base::graph);
84 test("GRAPH", std::ctype_base::graph);
85 test("graph", std::ctype_base::graph, true);
86 test("Graph", std::ctype_base::graph, true);
171 test(L"graph", std::ctype_base::graph);
[all...] |
