/external/v8/test/cctest/compiler/ |
H A D | 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 [all...] |
H A D | 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) { argument 128 RawMachineAssembler m(graph, &sig); 160 // Schedule the graph: 233 GenerateCodeFromSchedule(BuildGraphAndSchedule(graph)); 236 BuildGraphAndSchedule(Graph* graph) argument [all...] |
H A D | test-simplified-lowering.cc | 10 #include "src/compiler/graph-visualizer.h" 23 #include "test/cctest/compiler/graph-builder-tester.h" 40 jsgraph(this->graph(), this->common(), &javascript, &typer, 635 // Fills in most of the nodes of the graph in order to make tests shorter. 653 jsgraph(graph(), common(), &javascript, &typer, machine()) { 654 start = graph()->NewNode(common()->Start(2)); 655 graph()->SetStart(start); 657 graph()->NewNode(common()->Return(), jsgraph.Constant(0), start, start); 658 end = graph()->NewNode(common()->End(), ret); 659 graph() 756 Graph* graph() { return main_graph_; } function in class:TestingGraph [all...] |
/external/opencv/cvaux/src/ |
H A D | 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 [all...] |
/external/libcxx/test/std/localization/locale.categories/category.ctype/facet.ctype.special/facet.ctype.char.members/ |
H A D | is_1.pass.cpp | 56 assert(f.is(F::graph, '.')); 57 assert(!f.is(F::graph, '\x07'));
|
/external/v8/src/compiler/ |
H A D | 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) {} argument 65 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::GraphBuilder 77 // The StructuredGraphBuilder produces a high-level IR graph. It is used as the 82 StructuredGraphBuilder(Graph* graph, CommonOperatorBuilder* common); 126 Zone* zone() const { return graph()->zone(); } 137 // depends on the graph builder, but environments themselves are not virtual. 211 Zone* zone() const { return graph() 212 Graph* graph() const { return builder_->graph(); } function in class:v8::internal::compiler::StructuredGraphBuilder::Environment [all...] |
H A D | graph-reducer.h | 19 // Represents the result of trying to reduce a node in the graph. 33 // inputs. This class functions as an extension point for the graph reducer for 35 // folding of low-level operators) can be integrated into the graph reduction 55 // Performs an iterative reduction of a node graph. 58 explicit GraphReducer(Graph* graph); 60 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::FINAL 66 // Reduce the whole graph.
|
H A D | 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) { argument 22 PrintF(" Node* nil = graph.NewNode(common_builder.Dead());\n"); 23 graph->VisitNodeInputsFromEnd(&replay); 29 PrintF(" Node* n%d = graph.NewNode(op", node->id());
|
H A D | simplified-lowering.h | 8 #include "src/compiler/js-graph.h" 48 Graph* graph() { return jsgraph()->graph(); } function in class:v8::internal::compiler::SimplifiedLowering
|
H A D | 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, argument 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, argument 99 Visit<Visitor, Traits>(graph, zone, &array[0], &array[1], visitor);
|
H A D | js-typed-lowering.cc | 6 #include "src/compiler/graph-inl.h" 25 // TODO(turbofan): replace the effect input to {node} with {graph->start()}. 72 node_->ReplaceInput(1, graph()->NewNode(machine()->Word32And(), rnum, 103 Node* value = graph()->NewNode(simplified()->BooleanNot(), node_); 135 Graph* graph() { return lowering_->graph(); } function in class:v8::internal::compiler::JSBinopReduction 150 Node* n = graph()->NewNode(javascript()->ToString(), node, context(), 160 Node* n = graph()->NewNode(javascript()->ToNumber(), node, context(), 214 Node* n = graph()->NewNode(op, node); 451 graph() [all...] |
H A D | simplified-operator-reducer.h | 8 #include "src/compiler/graph-reducer.h" 39 Graph* graph() const;
|
/external/v8/src/ |
H A D | hydrogen-canonicalize.cc | 12 const ZoneList<HBasicBlock*>* blocks(graph()->blocks()); 40 HRedundantPhiEliminationPhase redundant_phi_eliminator(graph());
|
H A D | 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); 13 HEnvironmentLivenessAnalysisPhase( HGraph* graph) argument
|
H A D | hydrogen-mark-deoptimize.cc | 11 const ZoneList<HPhi*>* phi_list = graph()->phi_list(); 45 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
|
H A D | hydrogen-range-analysis.cc | 36 HBasicBlock* block(graph()->entry_block()); 37 ZoneList<Pending> stack(graph()->blocks()->length(), zone()); 111 for (int i = 0; i < graph()->blocks()->length(); ++i) { 112 HBasicBlock* block = graph()->blocks()->at(i); 153 new_range = range->Copy(graph()->zone()); 155 new_range = range->CopyClearLower(graph()->zone()); 160 new_range = range->CopyClearUpper(graph()->zone()); 175 value->ComputeInitialRange(graph()->zone()); 197 value->AddNewRange(range, graph()->zone());
|
H A D | hydrogen-environment-liveness.h | 25 explicit HEnvironmentLivenessAnalysisPhase(HGraph* graph); 41 // Largest number of local variables in any environment in the graph 51 // It is populated during the first pass over the graph, controlled by
|
H A D | hydrogen-mark-unreachable.cc | 12 // If there is unreachable code in the graph, propagate the unreachable marks 15 const ZoneList<HBasicBlock*>* blocks = graph()->blocks();
|
H A D | hydrogen-escape-analysis.cc | 42 int block_count = graph()->blocks()->length(); 44 HBasicBlock* block = graph()->blocks()->at(i); 64 Zone* zone = graph()->zone(); 75 HConstant* undefined = graph()->GetConstantUndefined(); 117 Zone* zone = graph()->zone(); 130 Zone* zone = graph()->zone(); 148 Zone* zone = graph()->zone(); 164 block_states_.AddBlock(NULL, graph()->blocks()->length(), zone()); 169 for (int i = start; i < graph()->blocks()->length(); i++) { 170 HBasicBlock* block = graph() [all...] |
/external/libcxx/test/std/localization/locale.categories/category.ctype/locale.ctype.byname/ |
H A D | is_many.pass.cpp | 51 assert( (m[0] & F::graph)); 65 assert(!(m[1] & F::graph)); 79 assert( (m[2] & F::graph)); 93 assert(!(m[3] & F::graph)); 107 assert( (m[4] & F::graph)); 121 assert( (m[5] & F::graph)); 135 assert( (m[6] & F::graph)); 160 assert(!(m[0] & F::graph)); 174 assert(!(m[1] & F::graph)); 188 assert( (m[2] & F::graph)); [all...] |
H A D | is_1.pass.cpp | 62 assert(f.is(F::graph, L'.')); 63 assert(!f.is(F::graph, L'\x07')); 105 assert(f.is(F::graph, L'.')); 106 assert(!f.is(F::graph, L'\x07'));
|
/external/ceres-solver/internal/ceres/ |
H A D | 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, 88 const Graph<int>& graph, 93 cv.ComputeClustering(options, graph, centers, membership); 101 const Graph<int>& graph, 107 graph_ = &graph; 145 // Return the set of vertices of the graph which have valid vertex 86 ComputeCanonicalViewsClustering( const CanonicalViewsClusteringOptions& options, const Graph<int>& graph, vector<int>* centers, IntMap* membership) argument 99 ComputeClustering( const CanonicalViewsClusteringOptions& options, const Graph<int>& graph, vector<int>* centers, IntMap* membership) argument
|
/external/svox/pico/lib/ |
H A D | picoklex.c | 58 - for one graph we can have two or three solutions from the 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, 369 graph[i], lexgraph[i])); 370 if (lexgraph[i] < graph[i]) { 372 } else if (lexgraph[i] > graph[i]) { 419 const picoos_uint8 *graph, 431 rv = klex_lexMatch(&(this->lexblocks[lexpos]), graph, graphle 358 klex_lexMatch(picoos_uint8 *lexentry, const picoos_uint8 *graph, const picoos_uint16 graphlen) argument 416 klex_lexblockLookup(klex_SubObj this, const picoos_uint32 lexposStart, const picoos_uint32 lexposEnd, const picoos_uint8 *graph, const picoos_uint16 graphlen, picoklex_lexl_result_t *lexres) argument 482 picoklex_lexLookup(const picoklex_Lex this, const picoos_uint8 *graph, const picoos_uint16 graphlen, picoklex_lexl_result_t *lexres) argument [all...] |
/external/valgrind/massif/ |
H A D | ms_print.in | 76 --x=<4..1000> graph width, in columns [72] 77 --y=<4..1000> graph height, in rows [20] 346 # - the graph 482 # Setup for graph. 484 # The ASCII graph. 487 # The rest ([1][1]..[graph_x][graph_y]) is the usable graph area. 488 my @graph; 497 # Setup graph[][]. 498 $graph[0][0] = '+'; # axes join point 499 for ($x = 1; $x <= $graph_x; $x++) { $graph[ [all...] |
/external/fio/ |
H A D | gfio.h | 10 #include "graph.h" 43 struct graph *iops_graph; 47 struct graph *bandwidth_graph; 128 struct graph *clat_graph; 129 struct graph *lat_bucket_graph;
|