| /external/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/ |
| 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));
|
| /external/chromium_org/v8/src/ |
| hydrogen-representation-changes.cc | 31 Maybe<HConstant*> res = constant->CopyToTruncatedInt32(graph()->zone());
34 new_value = constant->CopyToRepresentation(to, graph()->zone());
39 new_value = new(graph()->zone()) HChange(
45 !graph()->info()->IsOptimizing());
116 const ZoneList<HPhi*>* phi_list(graph()->phi_list());
185 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
|
| hydrogen-flow-engine.h | 52 // over a graph of basic blocks, either one block at a time (local analysis)
53 // or over the entire graph (global analysis). The flow engine is parameterized
55 // graph.
60 // are necessary to correctly handle loops in the control flow graph without
70 HFlowEngine(HGraph* graph, Zone* zone)
71 : graph_(graph),
74 pred_counts_(graph->blocks()->length(), zone),
76 block_states_(graph->blocks()->length(), zone),
77 loop_effects_(graph->blocks()->length(), zone) {
175 if (root->block_id() == 0) return false; // Visit the whole graph
[all...] |
| hydrogen-infer-representation.cc | 22 const ZoneList<HPhi*>* phi_list = graph()->phi_list();
116 for (int i = 0; i < graph()->blocks()->length(); ++i) {
117 HBasicBlock* block = graph()->blocks()->at(i);
138 for (int i = 0; i < graph()->blocks()->length(); ++i) {
139 HBasicBlock* block = graph()->blocks()->at(i);
|
| lithium-codegen.cc | 38 HGraph* LCodeGenBase::graph() const { function in class:v8::internal::LCodeGenBase
39 return chunk()->graph();
95 chunk()->graph()->SourcePositionToScriptPosition(value->position()));
160 for (int i = current_block_ + 1; i < graph()->blocks()->length(); ++i) {
161 if (!graph()->blocks()->at(i)->IsReachable()) continue;
|
| hydrogen-gvn.cc | 485 HGlobalValueNumberingPhase::HGlobalValueNumberingPhase(HGraph* graph)
486 : HPhase("H_Global value numbering", graph),
488 block_side_effects_(graph->blocks()->length(), zone()),
489 loop_side_effects_(graph->blocks()->length(), zone()),
490 visited_on_paths_(graph->blocks()->length(), zone()) {
493 SideEffects(), graph->blocks()->length(), zone());
495 SideEffects(), graph->blocks()->length(), zone());
516 DCHECK_EQ(block_side_effects_.length(), graph()->blocks()->length());
517 DCHECK_EQ(loop_side_effects_.length(), graph()->blocks()->length());
518 for (int i = 0; i < graph()->blocks()->length(); ++i)
[all...] |
| hydrogen-store-elimination.cc | 30 for (int i = 0; i < graph()->blocks()->length(); i++) {
32 HBasicBlock* block = graph()->blocks()->at(i);
|
| /external/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));
|
| /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/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';
23 // Specifies which stats should be drawn on the 'bweCompound' graph and how.
87 // The object contains the stats names that should not be added to the graph,
107 // Adds the stats report |report| to the timeline graph for the given
149 // Convert to another value to draw on graph, using the original
165 // Updates the graph.
179 // both the simple and compound graph cases.
245 // Update the graph
[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/opencv/cxcore/src/ |
| cxdatastructs.cpp | 2880 CvGraph *graph = 0; local
[all...] |
| /external/chromium_org/v8/test/cctest/compiler/ |
| test-machine-operator-reducer.cc | 8 #include "src/compiler/graph-inl.h"
9 #include "src/compiler/js-graph.h"
57 graph(main_zone()),
60 jsgraph(&graph, &common, &javascript, &typer, &machine),
62 Node* s = graph.NewNode(common.Start(num_parameters));
63 graph.SetStart(s);
71 Graph graph; member in class:ReducerTester
79 return graph.NewNode(NewConstantOperator<T>(&common, value));
99 Node* n = graph.NewNode(binop, a, b)
[all...] |
| instruction-selector-tester.h | 40 new (main_zone()) Graph(main_zone()),
61 CHECK_NE(0, graph()->NodeCount());
64 InstructionSequence sequence(&linkage, graph(), schedule);
65 SourcePositionTable source_positions(graph());
|
| /art/compiler/optimizing/ |
| codegen_test.cc | 74 HGraph* graph = builder.BuildGraph(*item); local
75 ASSERT_NE(graph, nullptr);
78 CodeGenerator* codegen = CodeGenerator::Create(&arena, graph, kX86);
86 codegen = CodeGenerator::Create(&arena, graph, kArm);
92 codegen = CodeGenerator::Create(&arena, graph, kX86_64);
|
| /external/chromium_org/v8/src/compiler/ |
| graph-visualizer.cc | 5 #include "src/compiler/graph-visualizer.h"
10 #include "src/compiler/graph.h"
11 #include "src/compiler/graph-inl.h"
27 GraphVisualizer(OStream& os, Zone* zone, const Graph* graph); // NOLINT
43 const Graph* const graph_;
238 const_cast<Graph*>(graph_)->VisitNodeInputsFromEnd(this);
239 white_nodes_.insert(const_cast<Graph*>(graph_)->start());
244 const_cast<Graph*>(graph_), zone_, white_nodes_.begin(),
266 const Graph* graph) // NOLIN
[all...] |
| code-generator.h | 30 Graph* graph() const { return code()->graph(); } function in class:v8::internal::compiler::FINAL
|
| /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/angle/src/compiler/translator/ |
| Compiler.cpp | 444 TDependencyGraph graph(root);
447 bool success = enforceFragmentShaderTimingRestrictions(graph);
449 // Then, output the dependency graph.
453 output.outputAllSpanningTrees(graph);
475 TDependencyGraph graph(root);
477 for (TFunctionCallVector::const_iterator iter = graph.beginUserDefinedFunctionCalls();
478 iter != graph.endUserDefinedFunctionCalls();
489 bool TCompiler::enforceFragmentShaderTimingRestrictions(const TDependencyGraph& graph)
492 restrictor.enforceRestrictions(graph);
|
| /external/chromium_org/third_party/re2/benchlog/ |
| mktable | 34 sub graph() { subroutine
119 "graph" => \&graph,
|
| /external/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...] |
