Home
last modified time | relevance | path

Searched refs:graph (Results 51 - 75 of 346) sorted by relevance

12345678910>>...14

/third_party/node/deps/v8/src/compiler/
H A Dgraph-trimmer.cc5 #include "src/compiler/graph-trimmer.h"
7 #include "src/compiler/graph.h"
13 GraphTrimmer::GraphTrimmer(Zone* zone, Graph* graph) in GraphTrimmer() argument
14 : graph_(graph), is_live_(graph, 2), live_(zone) { in GraphTrimmer()
15 live_.reserve(graph->NodeCount()); in GraphTrimmer()
24 MarkAsLive(graph()->end()); in TrimGraph()
H A Djs-intrinsic-lowering.cc11 #include "src/compiler/js-graph.h"
103 graph()->zone(), callable.descriptor(), input_count - 1, flags, in ReduceCopyDataPropertiesWithExcludedPropertiesOnStack()
105 node->InsertInput(graph()->zone(), 0, in ReduceCopyDataPropertiesWithExcludedPropertiesOnStack()
107 node->InsertInput(graph()->zone(), 2, in ReduceCopyDataPropertiesWithExcludedPropertiesOnStack()
128 Node* deoptimize = graph()->NewNode( in ReduceDeoptimizeNow()
131 NodeProperties::MergeControlToEnd(graph(), common(), deoptimize); in ReduceDeoptimizeNow()
132 Revisit(graph()->end()); in ReduceDeoptimizeNow()
147 graph()->NewNode(op, closure, receiver, context, effect, control); in ReduceCreateJSGeneratorObject()
247 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), value); in ReduceIsInstanceType()
248 Node* branch = graph() in ReduceIsInstanceType()
409 Graph* JSIntrinsicLowering::graph() const { return jsgraph()->graph(); } graph() function in v8::internal::compiler::JSIntrinsicLowering
[all...]
H A Dwasm-loop-peeling.cc17 void PeelWasmLoop(Node* loop_node, ZoneUnorderedSet<Node*>* loop, Graph* graph, in PeelWasmLoop() argument
30 NodeCopier copier(graph, copied_size, &copied_nodes, 1); in PeelWasmLoop()
32 copier.CopyNodes(graph, tmp_zone, graph->NewNode(common->Dead()), in PeelWasmLoop()
39 // The terminator nodes in the copies need to get connected to the graph's end in PeelWasmLoop()
44 NodeProperties::MergeControlToEnd(graph, common, node); in PeelWasmLoop()
60 graph->NewNode(common->Merge(2), node, copier.map(node)->InputAt(0)); in PeelWasmLoop()
74 Node* phi = graph->NewNode(phi_operator, use, in PeelWasmLoop()
H A Draw-machine-assembler.cc19 Isolate* isolate, Graph* graph, CallDescriptor* call_descriptor, in RawMachineAssembler()
23 graph_(graph), in RawMachineAssembler()
25 source_positions_(zone()->New<SourcePositionTable>(graph)), in RawMachineAssembler()
35 graph->SetStart(graph->NewNode(common_.Start(param_count + 1))); in RawMachineAssembler()
38 common()->Parameter(Linkage::kJSCallClosureParamIndex), graph->start()); in RawMachineAssembler()
42 AddNode(common()->Parameter(static_cast<int>(i)), graph->start()); in RawMachineAssembler()
44 graph->SetEnd(graph->NewNode(common_.End(0))); in RawMachineAssembler()
119 OptimizeControlFlow(schedule_, graph(), commo in ExportForOptimization()
18 RawMachineAssembler( Isolate* isolate, Graph* graph, CallDescriptor* call_descriptor, MachineRepresentation word, MachineOperatorBuilder::Flags flags, MachineOperatorBuilder::AlignmentRequirements alignment_requirements) RawMachineAssembler() argument
131 OptimizeControlFlow(Schedule* schedule, Graph* graph, CommonOperatorBuilder* common) OptimizeControlFlow() argument
[all...]
H A Dbranch-elimination.cc9 #include "src/compiler/js-graph.h"
23 node_conditions_(js_graph->graph()->NodeCount(), zone), in BranchElimination()
24 reduced_(js_graph->graph()->NodeCount(), zone), in BranchElimination()
65 // is known from previous branches. For example, in the graph below, the in SimplifyBranchCondition()
99 Graph* graph = jsgraph()->graph(); in SimplifyBranchCondition() local
118 ? graph->NewNode(jsgraph()->common()->Int32Constant(1)) in SimplifyBranchCondition()
119 : graph->NewNode(jsgraph()->common()->Int32Constant(0))); in SimplifyBranchCondition()
123 Node* new_phi = graph->NewNode( in SimplifyBranchCondition()
210 Node* trap_clone = graph() in TryPullTrapIntoMerge()
526 Graph* BranchElimination::graph() const { return jsgraph()->graph(); } graph() function in v8::internal::compiler::BranchElimination
[all...]
H A Dsimplified-lowering.cc19 #include "src/compiler/graph-visualizer.h"
58 // 1.) PROPAGATE: Traverse the graph from the end, pushing usage information
229 JSONGraphWriterWithVerifierTypes(std::ostream& os, const Graph* graph, in JSONGraphWriterWithVerifierTypes() argument
233 : JSONGraphWriter(os, graph, positions, origins), verifier_(verifier) {} in JSONGraphWriterWithVerifierTypes()
341 count_(jsgraph->graph()->NodeCount()), in RepresentationSelector()
584 count_ = graph()->NodeCount(); in GenerateTraversal()
589 stack.push({graph()->end(), 0}); in GenerateTraversal()
590 GetInfo(graph()->end())->set_pushed(); in GenerateTraversal()
764 // Print graph. in RunVerifyPhase()
771 json_of, graph(), source_positions in RunVerifyPhase()
1532 Graph* graph() const { return jsgraph_->graph(); } graph() function in v8::internal::compiler::RepresentationSelector
[all...]
H A Dloop-unrolling.cc18 Graph* graph, CommonOperatorBuilder* common, Zone* tmp_zone, in UnrollLoop()
36 NodeCopier copier(graph, copied_size, &copies, unrolling_count); in UnrollLoop()
38 copier.CopyNodes(graph, tmp_zone, graph->NewNode(common->Dead()), in UnrollLoop()
43 // The terminator nodes in the copies need to get connected to the graph's end in UnrollLoop()
48 NodeProperties::MergeControlToEnd(graph, common, node); in UnrollLoop()
66 graph->NewNode(common->Int32Constant(1))); in UnrollLoop()
109 Node* merge_node = graph->NewNode(common->Merge(iteration_count), in UnrollLoop()
134 graph->NewNode(phi_operator, iteration_count + 1, phi_inputs); in UnrollLoop()
17 UnrollLoop(Node* loop_node, ZoneUnorderedSet<Node*>* loop, uint32_t depth, Graph* graph, CommonOperatorBuilder* common, Zone* tmp_zone, SourcePositionTable* source_positions, NodeOriginTable* node_origins) UnrollLoop() argument
H A Drepresentation-change.cc272 return jsgraph()->graph()->NewNode( in GetTaggedSignedRepresentationFor()
417 return jsgraph()->graph()->NewNode( in GetTaggedPointerRepresentationFor()
429 return jsgraph()->graph()->NewNode( in GetTaggedPointerRepresentationFor()
458 node = jsgraph()->graph()->NewNode(op, node); in GetTaggedPointerRepresentationFor()
535 return jsgraph()->graph()->NewNode( in GetTaggedRepresentationFor()
625 return jsgraph()->graph()->NewNode(op, node); in GetTaggedRepresentationFor()
647 return jsgraph()->graph()->NewNode( in GetFloat32RepresentationFor()
653 node = jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor()
662 node = jsgraph()->graph()->NewNode(op, node); in GetFloat32RepresentationFor()
673 node = jsgraph()->graph() in GetFloat32RepresentationFor()
[all...]
H A Dpipeline.cc33 #include "src/compiler/bytecode-graph-builder.h"
47 #include "src/compiler/graph-trimmer.h"
48 #include "src/compiler/graph-visualizer.h"
63 #include "src/compiler/machine-graph-verifier.h"
114 static constexpr char kGraphZoneName[] = "graph-zone";
117 "machine-graph-verifier-zone";
210 graph_(mcgraph->graph()), in PipelineData()
231 // For CodeStubAssembler and machine graph testing entry point.
233 Isolate* isolate, AccountingAllocator* allocator, Graph* graph, in PipelineData()
251 graph_(graph), in PipelineData()
232 PipelineData(ZoneStats* zone_stats, OptimizedCompilationInfo* info, Isolate* isolate, AccountingAllocator* allocator, Graph* graph, JSGraph* jsgraph, Schedule* schedule, SourcePositionTable* source_positions, NodeOriginTable* node_origins, JumpOptimizationInfo* jump_opt, const AssemblerOptions& assembler_options, const ProfileDataFromFile* profile_data) PipelineData() argument
342 Graph* graph() const { return graph_; } graph() function in v8::internal::compiler::PipelineData
2433 Graph* graph = data->graph(); Run() local
2502 WasmHeapStubCompilationJob(Isolate* isolate, CallDescriptor* call_descriptor, std::unique_ptr<Zone> zone, Graph* graph, CodeKind kind, std::unique_ptr<char[]> debug_name, const AssemblerOptions& options, SourcePositionTable* source_positions) WasmHeapStubCompilationJob() argument
2544 NewWasmHeapStubCompilationJob( Isolate* isolate, CallDescriptor* call_descriptor, std::unique_ptr<Zone> zone, Graph* graph, CodeKind kind, std::unique_ptr<char[]> debug_name, const AssemblerOptions& options, SourcePositionTable* source_positions) NewWasmHeapStubCompilationJob() argument
2827 HashGraphForPGO(Graph* graph) HashGraphForPGO() argument
2886 GenerateCodeForCodeStub( Isolate* isolate, CallDescriptor* call_descriptor, Graph* graph, JSGraph* jsgraph, SourcePositionTable* source_positions, CodeKind kind, const char* debug_name, Builtin builtin, const AssemblerOptions& options, const ProfileDataFromFile* profile_data) GenerateCodeForCodeStub() argument
3018 Graph* graph = mcgraph->graph(); GenerateCodeForWasmNativeStub() local
3300 GenerateCodeForTesting( OptimizedCompilationInfo* info, Isolate* isolate, CallDescriptor* call_descriptor, Graph* graph, const AssemblerOptions& options, Schedule* schedule) GenerateCodeForTesting() argument
[all...]
H A Dnode-marker.cc7 #include "src/compiler/graph.h"
13 NodeMarkerBase::NodeMarkerBase(Graph* graph, uint32_t num_states) in NodeMarkerBase() argument
14 : mark_min_(graph->mark_max_), mark_max_(graph->mark_max_ += num_states) { in NodeMarkerBase()
H A Djs-inlining-heuristic.cc360 copy = graph()->CloneNode(state_values); in DuplicateStateValuesAndRename()
398 copy = graph()->CloneNode(frame_state); in DuplicateFrameStateAndRename()
406 copy = graph()->CloneNode(frame_state); in DuplicateFrameStateAndRename()
469 // the graph. in TryReuseDispatch()
620 effect_phi_effect = graph()->NewNode( in TryReuseDispatch()
633 graph()->NewNode(node->op(), input_count, inputs); in TryReuseDispatch()
672 graph()->NewNode(simplified()->ReferenceEqual(), callee, target); in CreateOrReuseDispatch()
674 graph()->NewNode(common()->Branch(), check, fallthrough_control); in CreateOrReuseDispatch()
675 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch); in CreateOrReuseDispatch()
676 if_successes[i] = graph() in CreateOrReuseDispatch()
841 Graph* JSInliningHeuristic::graph() const { return jsgraph()->graph(); } graph() function in v8::internal::compiler::JSInliningHeuristic
[all...]
/kernel/linux/linux-6.6/drivers/media/mc/
H A Dmc-entity.c279 static void stack_push(struct media_graph *graph, in stack_push() argument
282 if (graph->top == MEDIA_ENTITY_ENUM_MAX_DEPTH - 1) { in stack_push()
286 graph->top++; in stack_push()
287 graph->stack[graph->top].link = entity->links.next; in stack_push()
288 graph->stack[graph->top].entity = entity; in stack_push()
291 static struct media_entity *stack_pop(struct media_graph *graph) in stack_pop() argument
295 entity = graph->stack[graph in stack_pop()
315 media_graph_walk_init( struct media_graph *graph, struct media_device *mdev) media_graph_walk_init() argument
326 media_graph_walk_cleanup(struct media_graph *graph) media_graph_walk_cleanup() argument
332 media_graph_walk_start(struct media_graph *graph, struct media_entity *entity) media_graph_walk_start() argument
346 media_graph_walk_iter(struct media_graph *graph) media_graph_walk_iter() argument
390 media_graph_walk_next(struct media_graph *graph) media_graph_walk_next() argument
[all...]
/third_party/python/Tools/peg_generator/pegen/
H A Dsccutils.py9 """Compute Strongly Connected Components of a directed graph.
101 graph: Dict[str, AbstractSet[str]], scc: AbstractSet[str], start: str
113 assert scc <= graph.keys(), scc - graph.keys()
115 # Reduce the graph to nodes in the SCC.
116 graph = {src: {dst for dst in dsts if dst in scc} for src, dsts in graph.items() if src in scc}
117 assert start in graph
125 for child in graph[node]:
/kernel/linux/linux-5.10/drivers/hwtracing/coresight/
H A Dcoresight-platform.c95 * if the device doesn't have any graph connections in of_coresight_get_ports_legacy()
408 * acpi_validate_dsd_graph - Make sure the given _DSD graph conforms
422 * GraphID - Integer, identifying a graph the device belongs to.
424 * this graph. (e.g, see is_acpi_coresight_graph())
425 * NumberOfLinks - Number "N" of connections on this node of the graph.
475 static inline bool acpi_validate_dsd_graph(const union acpi_object *graph) in acpi_validate_dsd_graph() argument
480 /* The graph must contain at least the Revision and Number of Graphs */ in acpi_validate_dsd_graph()
481 if (graph->package.count < 2) in acpi_validate_dsd_graph()
484 rev = &graph->package.elements[0]; in acpi_validate_dsd_graph()
485 nr_graphs = &graph in acpi_validate_dsd_graph()
586 const union acpi_object *graph_list, *graph; acpi_get_coresight_graph() local
690 const union acpi_object *graph; acpi_coresight_parse_graph() local
[all...]
/kernel/linux/linux-5.10/drivers/media/v4l2-core/
H A Dv4l2-mc.c435 struct media_graph *graph) in pipeline_pm_use_count()
439 media_graph_walk_start(graph, entity); in pipeline_pm_use_count()
441 while ((entity = media_graph_walk_next(graph))) { in pipeline_pm_use_count()
494 struct media_graph *graph) in pipeline_pm_power()
502 media_graph_walk_start(graph, entity); in pipeline_pm_power()
504 while (!ret && (entity = media_graph_walk_next(graph))) in pipeline_pm_power()
511 media_graph_walk_start(graph, first); in pipeline_pm_power()
513 while ((first = media_graph_walk_next(graph)) in pipeline_pm_power()
559 struct media_graph *graph = &link->graph_obj.mdev->pm_count_walk; in v4l2_pipeline_link_notify() local
566 source_use = pipeline_pm_use_count(source, graph); in v4l2_pipeline_link_notify()
434 pipeline_pm_use_count(struct media_entity *entity, struct media_graph *graph) pipeline_pm_use_count() argument
493 pipeline_pm_power(struct media_entity *entity, int change, struct media_graph *graph) pipeline_pm_power() argument
[all...]
/kernel/linux/linux-6.6/drivers/media/v4l2-core/
H A Dv4l2-mc.c443 struct media_graph *graph) in pipeline_pm_use_count()
447 media_graph_walk_start(graph, entity); in pipeline_pm_use_count()
449 while ((entity = media_graph_walk_next(graph))) { in pipeline_pm_use_count()
502 struct media_graph *graph) in pipeline_pm_power()
510 media_graph_walk_start(graph, entity); in pipeline_pm_power()
512 while (!ret && (entity = media_graph_walk_next(graph))) in pipeline_pm_power()
519 media_graph_walk_start(graph, first); in pipeline_pm_power()
521 while ((first = media_graph_walk_next(graph)) in pipeline_pm_power()
567 struct media_graph *graph = &link->graph_obj.mdev->pm_count_walk; in v4l2_pipeline_link_notify() local
574 source_use = pipeline_pm_use_count(source, graph); in v4l2_pipeline_link_notify()
442 pipeline_pm_use_count(struct media_entity *entity, struct media_graph *graph) pipeline_pm_use_count() argument
501 pipeline_pm_power(struct media_entity *entity, int change, struct media_graph *graph) pipeline_pm_power() argument
[all...]
/kernel/linux/linux-6.6/drivers/hwtracing/coresight/
H A Dcoresight-platform.c279 * if the device doesn't have any graph connections in of_get_coresight_platform_data()
382 * acpi_validate_dsd_graph - Make sure the given _DSD graph conforms
396 * GraphID - Integer, identifying a graph the device belongs to.
398 * this graph. (e.g, see is_acpi_coresight_graph())
399 * NumberOfLinks - Number "N" of connections on this node of the graph.
449 static inline bool acpi_validate_dsd_graph(const union acpi_object *graph) in acpi_validate_dsd_graph() argument
454 /* The graph must contain at least the Revision and Number of Graphs */ in acpi_validate_dsd_graph()
455 if (graph->package.count < 2) in acpi_validate_dsd_graph()
458 rev = &graph->package.elements[0]; in acpi_validate_dsd_graph()
459 nr_graphs = &graph in acpi_validate_dsd_graph()
559 const union acpi_object *graph_list, *graph; acpi_get_coresight_graph() local
665 const union acpi_object *graph; acpi_coresight_parse_graph() local
[all...]
/kernel/linux/linux-6.6/tools/power/pm-graph/
H A Dinstall_latest_from_github.sh4 # Script which clones and installs the latest pm-graph
5 # from http://github.com/intel/pm-graph.git
16 rm -rf pm-graph
22 git clone http://github.com/intel/pm-graph.git $OUT/pm-graph
23 if [ ! -e "$OUT/pm-graph/sleepgraph.py" ]; then
24 echo "ERROR: pm-graph github repo failed to clone"
29 cd $OUT/pm-graph
/kernel/linux/linux-5.10/arch/sh/kernel/
H A Ddumpstack.c57 struct thread_info *tinfo, int *graph) in print_ftrace_graph_addr()
69 ret_stack = ftrace_graph_get_ret_stack(task, *graph); in print_ftrace_graph_addr()
77 (*graph)++; in print_ftrace_graph_addr()
83 struct thread_info *tinfo, int *graph) in print_ftrace_graph_addr()
93 int graph = 0; in stack_reader_dump() local
105 context, &graph); in stack_reader_dump()
55 print_ftrace_graph_addr(unsigned long addr, void *data, const struct stacktrace_ops *ops, struct thread_info *tinfo, int *graph) print_ftrace_graph_addr() argument
81 print_ftrace_graph_addr(unsigned long addr, void *data, const struct stacktrace_ops *ops, struct thread_info *tinfo, int *graph) print_ftrace_graph_addr() argument
/kernel/linux/linux-6.6/arch/sh/kernel/
H A Ddumpstack.c57 struct thread_info *tinfo, int *graph) in print_ftrace_graph_addr()
69 ret_stack = ftrace_graph_get_ret_stack(task, *graph); in print_ftrace_graph_addr()
77 (*graph)++; in print_ftrace_graph_addr()
83 struct thread_info *tinfo, int *graph) in print_ftrace_graph_addr()
93 int graph = 0; in stack_reader_dump() local
105 context, &graph); in stack_reader_dump()
55 print_ftrace_graph_addr(unsigned long addr, void *data, const struct stacktrace_ops *ops, struct thread_info *tinfo, int *graph) print_ftrace_graph_addr() argument
81 print_ftrace_graph_addr(unsigned long addr, void *data, const struct stacktrace_ops *ops, struct thread_info *tinfo, int *graph) print_ftrace_graph_addr() argument
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DTrailingPathOptimizerTest.java23 import com.google.common.graph.ValueGraph;
36 ValueGraph<Node, SimpleEdge> actual = TrailingPathOptimizer.optimize(nfa.graph()); in testSimple()
55 ValueGraph<Node, SimpleEdge> actual = TrailingPathOptimizer.optimize(nfa.graph()); in testTrailingOptionalGroup()
77 ValueGraph<Node, SimpleEdge> actual = TrailingPathOptimizer.optimize(nfa.graph()); in testDoubleRecursion()
112 ValueGraph<Node, SimpleEdge> actual = TrailingPathOptimizer.optimize(nfa.graph()); in testNoChangeIfNoCommonFactor()
117 // This is a somewhat cheeky way to test graph isomorphism and relies on the fact that graph in assertEquivalent()
120 assertThat(NfaFlattener.flatten(actual)).isEqualTo(NfaFlattener.flatten(expected.graph())); in assertEquivalent()
/third_party/ffmpeg/libavfilter/dnn/
H A Ddnn_backend_tf.c57 TF_Graph *graph; member
289 tf_output.oper = TF_GraphOperationByName(tf_model->graph, input_name); in get_input_tf()
300 TF_GraphGetTensorShape(tf_model->graph, tf_output, dims, 4, status); in get_input_tf()
430 av_log(ctx, AV_LOG_ERROR, "Failed to read model \"%s\" graph\n", model_filename); in load_tf_model()
434 tf_model->graph = TF_NewGraph(); in load_tf_model()
437 TF_GraphImportGraphDef(tf_model->graph, graph_def, graph_opts, tf_model->status); in load_tf_model()
441 TF_DeleteGraph(tf_model->graph); in load_tf_model()
443 av_log(ctx, AV_LOG_ERROR, "Failed to import serialized graph to model graph\n"); in load_tf_model()
448 init_op = TF_GraphOperationByName(tf_model->graph, "ini in load_tf_model()
[all...]
/third_party/skia/tools/
H A DToolUtils.h205 static void AllocNodes(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph, int num) { in AllocNodes() argument
206 graph->reserve_back(num); in AllocNodes()
209 graph->push_back(sk_sp<TopoTestNode>(new TopoTestNode(i))); in AllocNodes()
214 static void Print(const SkTArray<TopoTestNode*>& graph) { in Print() argument
215 for (int i = 0; i < graph.count(); ++i) { in Print()
216 SkDebugf("%d, ", graph[i]->id()); in Print()
223 static void Shuffle(SkTArray<sk_sp<TopoTestNode>>* graph, SkRandom* rand) { in Shuffle() argument
224 for (int i = graph->count() - 1; i > 0; --i) { in Shuffle()
227 (*graph)[i].swap((*graph)[swa in Shuffle()
[all...]
/third_party/gn/tools/
H A Dfind_unreachable.py25 def find_reachable_targets(known, graph):
33 to_visit += graph[next]['deps']
37 def find_source_targets_from(targets, graph):
40 source_targets -= set(graph[target]['deps'])
/third_party/ffmpeg/libavfilter/
H A Dvf_curves.c66 uint16_t *graph[NB_COMP + 1]; member
300 /* compute the graph with x=[x0..xN] */ in interpolate()
411 static int dump_curves(const char *fname, uint16_t *graph[NB_COMP + 1], in dump_curves()
451 av_bprintf(&buf, "%f %f\n", x * scale, graph[i][x] * scale); in dump_curves()
538 dstp[x + r] = curves->graph[R][srcp[x + r]]; in filter_slice_packed()
539 dstp[x + g] = curves->graph[G][srcp[x + g]]; in filter_slice_packed()
540 dstp[x + b] = curves->graph[B][srcp[x + b]]; in filter_slice_packed()
551 dst[x + r] = curves->graph[R][src[x + r]]; in filter_slice_packed()
552 dst[x + g] = curves->graph[G][src[x + g]]; in filter_slice_packed()
553 dst[x + b] = curves->graph[ in filter_slice_packed()
[all...]

Completed in 22 milliseconds

12345678910>>...14