| /prebuilts/tools/common/m2/repository/org/sonatype/aether/aether-util/1.7/ |
| aether-util-1.7.jar | |
| /external/chromium_org/v8/test/cctest/compiler/ |
| test-phi-reducer.cc | 9 #include "src/compiler/graph-inl.h"
20 graph(main_zone()),
21 self(graph.NewNode(common.Start(num_parameters))),
22 dead(graph.NewNode(common.Dead())) {
23 graph.SetStart(self);
28 Graph graph; member in class:PhiReducerTester
44 return graph.NewNode(common.Int32Constant(val));
48 return graph.NewNode(common.Float64Constant(val));
52 return graph.NewNode(common.Parameter(index), graph.start())
[all...] |
| test-codegen-deopt.cc | 10 #include "src/compiler/graph.h"
55 graph = new (scope_->main_zone()) Graph(scope_->main_zone());
68 code = new v8::internal::compiler::InstructionSequence(linkage, graph,
70 SourcePositionTable source_positions(graph);
105 Graph* graph; member in class:DeoptCodegenTester
116 GenerateCodeFromSchedule(BuildGraphAndSchedule(graph));
119 Schedule* BuildGraphAndSchedule(Graph* graph) {
[all...] |
| /external/opencv/cvaux/src/ |
| enmin.cpp | 73 // struct Vertex is used for storing vertices of graph
81 // struct Edge is used for storing edges of graph
167 // function makeGraph creates initial graph to find maximum flow in it
202 CvGraph* graph = *graphPtr;
210 cvGraphAddVtx( graph, NULL, &newVtxPtr );
214 cvGraphAddVtx( graph, NULL, &newVtxPtr );
217 cvGraphAddVtx( graph, NULL, &newVtxPtr );
221 int alphaVtx = graph -> total - 2;
222 int betaVtx = graph -> total - 1;
225 if( graph -> total > 2
[all...] |
| /art/compiler/optimizing/ |
| liveness_test.cc | 47 HGraph* graph = builder.BuildGraph(*item); local
48 ASSERT_NE(graph, nullptr);
49 graph->BuildDominatorTree();
50 graph->TransformToSSA();
51 graph->FindNaturalLoops();
52 CodeGenerator* codegen = CodeGenerator::Create(&allocator, graph, InstructionSet::kX86);
53 SsaLivenessAnalysis liveness(*graph, codegen);
57 for (HInsertionOrderIterator it(*graph); !it.Done(); it.Advance()) {
|
| /external/chromium_org/content/browser/resources/media/ |
| webrtc_internals.css | 22 .stats-graph-container {
27 .stats-graph-sub-container {
32 .stats-graph-sub-container > div {
36 .stats-graph-sub-container > div:first-child {
|
| /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/compiler/ |
| graph-builder.h | 12 #include "src/compiler/graph.h"
21 // A common base class for anything that creates nodes in a graph.
24 explicit GraphBuilder(Graph* graph) : graph_(graph) {}
65 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::GraphBuilder
73 Graph* graph_;
77 // The StructuredGraphBuilder produces a high-level IR graph. It is used as the
82 StructuredGraphBuilder(Graph* graph, CommonOperatorBuilder* common)
212 Graph* graph() const { return builder_->graph(); } function in class:v8::internal::compiler::StructuredGraphBuilder::Environment
[all...] |
| graph-replay.cc | 5 #include "src/compiler/graph-replay.h"
8 #include "src/compiler/graph.h"
9 #include "src/compiler/graph-inl.h"
20 void GraphReplayPrinter::PrintReplay(Graph* graph) {
22 PrintF(" Node* nil = graph.NewNode(common_builder.Dead());\n");
23 graph->VisitNodeInputsFromEnd(&replay);
29 PrintF(" Node* n%d = graph.NewNode(op", node->id());
|
| js-typed-lowering.h | 8 #include "src/compiler/graph-reducer.h"
9 #include "src/compiler/js-graph.h"
28 Graph* graph() { return jsgraph_->graph(); } function in class:v8::internal::compiler::FINAL
|
| simplified-lowering.h | 8 #include "src/compiler/js-graph.h"
48 Graph* graph() { return jsgraph()->graph(); } function in class:v8::internal::compiler::SimplifiedLowering
|
| generic-algorithm.h | 10 #include "src/compiler/generic-graph.h"
22 // dependencies and uses, it also can be used to visit any graph-like network
40 static void Visit(GenericGraphBase* graph, Zone* zone,
48 BoolVector visited(Traits::max_id(graph), false, zone);
54 DCHECK(id < Traits::max_id(graph)); // Must be a valid id.
96 static void Visit(GenericGraphBase* graph, Zone* zone,
99 Visit<Visitor, Traits>(graph, zone, &array[0], &array[1], visitor);
|
| /external/chromium_org/v8/src/ |
| hydrogen-canonicalize.cc | 12 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
40 HRedundantPhiEliminationPhase redundant_phi_eliminator(graph());
|
| hydrogen-environment-liveness.cc | 14 HGraph* graph)
15 : HPhase("H_Environment liveness analysis", graph),
16 block_count_(graph->blocks()->length()),
17 maximum_environment_size_(graph->maximum_environment_size()),
40 simulate->AddAssignedValue(index, graph()->GetConstantUndefined());
42 simulate->SetOperandAt(operand_index, graph()->GetConstantUndefined());
178 HBasicBlock* block = graph()->blocks()->at(block_id);
210 HBasicBlock* block = graph()->blocks()->at(block_id);
|
| hydrogen-mark-deoptimize.cc | 11 const ZoneList<HPhi*>* phi_list = graph()->phi_list();
45 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
|
| /external/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'));
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| OneShotScheduler.java | 39 public OneShotScheduler(FilterGraph graph) {
40 super(graph);
74 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'));
|
| /external/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...] |
| /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 | 40 #include "ceres/graph.h"
56 // graph. centers will contain the vertices that are the identified
64 const Graph<int>& graph,
77 const Graph<int>* graph_;
88 const Graph<int>& graph,
93 cv.ComputeClustering(options, graph, centers, membership);
101 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 | 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...] |
| 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...] |
