Home
last modified time | relevance | path

Searched refs:graph (Results 26 - 50 of 319) sorted by relevance

12345678910>>...13

/third_party/node/deps/v8/src/maglev/
H A Dmaglev-graph-processor.h10 #include "src/maglev/maglev-graph.h"
27 // // A function that processes the graph before the nodes are walked.
28 // void PreProcessGraph(MaglevCompilationUnit*, Graph* graph);
30 // // A function that processes the graph after the nodes are walked.
31 // void PostProcessGraph(MaglevCompilationUnit*, Graph* graph);
82 void ProcessGraph(Graph* graph) { in ProcessGraph() argument
83 graph_ = graph; in ProcessGraph()
85 node_processor_.PreProcessGraph(compilation_unit_, graph); in ProcessGraph()
87 for (block_it_ = graph->begin(); block_it_ != graph in ProcessGraph()
152 PreProcessGraph(MaglevCompilationUnit*, Graph* graph) PreProcessGraph() argument
153 PostProcessGraph(MaglevCompilationUnit*, Graph* graph) PostProcessGraph() argument
169 PreProcessGraph(MaglevCompilationUnit* unit, Graph* graph) PreProcessGraph() argument
173 PostProcessGraph(MaglevCompilationUnit* unit, Graph* graph) PostProcessGraph() argument
[all...]
H A Dmaglev-compiler.cc30 #include "src/maglev/maglev-graph-builder.h"
31 #include "src/maglev/maglev-graph-labeller.h"
32 #include "src/maglev/maglev-graph-printer.h"
33 #include "src/maglev/maglev-graph-processor.h"
34 #include "src/maglev/maglev-graph-verifier.h"
35 #include "src/maglev/maglev-graph.h"
50 void PreProcessGraph(MaglevCompilationUnit*, Graph* graph) { node_id_ = 1; } in PreProcessGraph() argument
51 void PostProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PostProcessGraph() argument
64 void PreProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PreProcessGraph() argument
65 void PostProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PostProcessGraph() argument
212 Graph* const graph = toplevel_compilation_unit->info()->graph(); GenerateCode() local
[all...]
/kernel/linux/linux-5.10/lib/
H A Dobjagg.c710 static int objagg_tmp_graph_edge_index(struct objagg_tmp_graph *graph, in objagg_tmp_graph_edge_index() argument
713 return index * graph->nodes_count + parent_index; in objagg_tmp_graph_edge_index()
716 static void objagg_tmp_graph_edge_set(struct objagg_tmp_graph *graph, in objagg_tmp_graph_edge_set() argument
719 int edge_index = objagg_tmp_graph_edge_index(graph, index, in objagg_tmp_graph_edge_set()
722 __set_bit(edge_index, graph->edges); in objagg_tmp_graph_edge_set()
725 static bool objagg_tmp_graph_is_edge(struct objagg_tmp_graph *graph, in objagg_tmp_graph_is_edge() argument
728 int edge_index = objagg_tmp_graph_edge_index(graph, index, in objagg_tmp_graph_is_edge()
731 return test_bit(edge_index, graph->edges); in objagg_tmp_graph_is_edge()
734 static unsigned int objagg_tmp_graph_node_weight(struct objagg_tmp_graph *graph, in objagg_tmp_graph_node_weight() argument
737 struct objagg_tmp_node *node = &graph in objagg_tmp_graph_node_weight()
756 objagg_tmp_graph_node_max_weight(struct objagg_tmp_graph *graph) objagg_tmp_graph_node_max_weight() argument
780 struct objagg_tmp_graph *graph; objagg_tmp_graph_create() local
834 objagg_tmp_graph_destroy(struct objagg_tmp_graph *graph) objagg_tmp_graph_destroy() argument
846 struct objagg_tmp_graph *graph; objagg_opt_simple_greedy_fillup_hints() local
[all...]
/kernel/linux/linux-6.6/lib/
H A Dobjagg.c710 static int objagg_tmp_graph_edge_index(struct objagg_tmp_graph *graph, in objagg_tmp_graph_edge_index() argument
713 return index * graph->nodes_count + parent_index; in objagg_tmp_graph_edge_index()
716 static void objagg_tmp_graph_edge_set(struct objagg_tmp_graph *graph, in objagg_tmp_graph_edge_set() argument
719 int edge_index = objagg_tmp_graph_edge_index(graph, index, in objagg_tmp_graph_edge_set()
722 __set_bit(edge_index, graph->edges); in objagg_tmp_graph_edge_set()
725 static bool objagg_tmp_graph_is_edge(struct objagg_tmp_graph *graph, in objagg_tmp_graph_is_edge() argument
728 int edge_index = objagg_tmp_graph_edge_index(graph, index, in objagg_tmp_graph_is_edge()
731 return test_bit(edge_index, graph->edges); in objagg_tmp_graph_is_edge()
734 static unsigned int objagg_tmp_graph_node_weight(struct objagg_tmp_graph *graph, in objagg_tmp_graph_node_weight() argument
737 struct objagg_tmp_node *node = &graph in objagg_tmp_graph_node_weight()
756 objagg_tmp_graph_node_max_weight(struct objagg_tmp_graph *graph) objagg_tmp_graph_node_max_weight() argument
780 struct objagg_tmp_graph *graph; objagg_tmp_graph_create() local
831 objagg_tmp_graph_destroy(struct objagg_tmp_graph *graph) objagg_tmp_graph_destroy() argument
843 struct objagg_tmp_graph *graph; objagg_opt_simple_greedy_fillup_hints() local
[all...]
/kernel/linux/linux-6.6/sound/soc/generic/
H A DMakefile4 snd-soc-audio-graph-card-objs := audio-graph-card.o
5 snd-soc-audio-graph-card2-objs := audio-graph-card2.o
6 snd-soc-audio-graph-card2-custom-sample-objs := audio-graph-card2-custom-sample.o
11 obj-$(CONFIG_SND_AUDIO_GRAPH_CARD) += snd-soc-audio-graph-card.o
12 obj-$(CONFIG_SND_AUDIO_GRAPH_CARD2) += snd-soc-audio-graph-card2.o
13 obj-$(CONFIG_SND_AUDIO_GRAPH_CARD2_CUSTOM_SAMPLE) += snd-soc-audio-graph-card2-custom-sample.o
/third_party/node/deps/v8/src/compiler/
H A Djs-native-context-specialization.cc17 #include "src/compiler/js-graph.h"
171 Replace(graph()->NewNode(common()->DelayedStringConstant(base))); in ReduceJSToString()
227 graph()->NewNode(javascript()->CreatePromise(), context, effect); in ReduceJSAsyncFunctionEnter()
244 graph()->NewNode(javascript()->CreateAsyncFunctionObject(register_count), in ReduceJSAsyncFunctionEnter()
263 Node* promise = effect = graph()->NewNode( in ReduceJSAsyncFunctionReject()
280 effect = graph()->NewNode(javascript()->RejectPromise(), promise, reason, in ReduceJSAsyncFunctionReject()
299 Node* promise = effect = graph()->NewNode( in ReduceJSAsyncFunctionResolve()
313 effect = graph()->NewNode(javascript()->ResolvePromise(), promise, value, in ReduceJSAsyncFunctionResolve()
348 Node* reduced = graph()->NewNode(common()->DelayedStringConstant(cons)); in ReduceJSAdd()
486 node->EnsureInputCount(graph() in ReduceJSInstanceOf()
3447 Graph* JSNativeContextSpecialization::graph() const { graph() function in v8::internal::compiler::JSNativeContextSpecialization
[all...]
H A Dwasm-compiler.cc30 #include "src/compiler/graph-assembler.h"
31 #include "src/compiler/graph-visualizer.h"
32 #include "src/compiler/graph.h"
54 #include "src/wasm/graph-builder-interface.h"
105 ? graph()->NewNode(mcgraph()->common()->HeapConstant( \
204 NodeProperties::MergeControlToEnd(graph(), mcgraph()->common(), node); in MergeControlToEnd()
229 graph()->NewNode(mcgraph()->common()->Branch(hint), cond, control()); in Branch()
230 *true_node = graph()->NewNode(mcgraph()->common()->IfTrue(), branch); in Branch()
231 *false_node = graph()->NewNode(mcgraph()->common()->IfFalse(), branch); in Branch()
236 return graph() in NumberConstant()
4348 Graph* WasmGraphBuilder::graph() { return mcgraph()->graph(); } graph() function in v8::internal::compiler::WasmGraphBuilder
[all...]
H A Ddiamond.h9 #include "src/compiler/graph.h"
18 Graph* graph; member
27 graph = g; in Diamond()
29 branch = graph->NewNode(common->Branch(hint), cond, graph->start()); in Diamond()
30 if_true = graph->NewNode(common->IfTrue(), branch); in Diamond()
31 if_false = graph->NewNode(common->IfFalse(), branch); in Diamond()
32 merge = graph->NewNode(common->Merge(2), if_true, if_false); in Diamond()
53 return graph->NewNode(common->Phi(rep, 2), tv, fv, merge); in Phi()
57 return graph in EffectPhi()
[all...]
H A Djs-inlining.cc13 #include "src/compiler/bytecode-graph-builder.h"
16 #include "src/compiler/graph-reducer.h"
174 Node* on_success = graph()->NewNode(common()->IfSuccess(), subcall); in InlineCall()
178 graph()->NewNode(common()->IfException(), subcall, subcall); in InlineCall()
185 graph()->NewNode(common()->Merge(subcall_count), subcall_count, in InlineCall()
190 Node* value_output = graph()->NewNode( in InlineCall()
194 graph()->NewNode(common()->EffectPhi(subcall_count), in InlineCall()
217 NodeProperties::MergeControlToEnd(graph(), common(), input); in InlineCall()
218 Revisit(graph()->end()); in InlineCall()
231 Node* control_output = graph() in InlineCall()
732 Graph* JSInliner::graph() const { return jsgraph()->graph(); } graph() function in v8::internal::compiler::JSInliner
[all...]
H A Dproperty-access-builder.cc11 #include "src/compiler/js-graph.h"
25 Graph* PropertyAccessBuilder::graph() const { return jsgraph()->graph(); } in graph() function in v8::internal::compiler::PropertyAccessBuilder
63 graph()->NewNode(simplified()->CheckString(FeedbackSource()), *receiver, in TryBuildStringCheck()
77 graph()->NewNode(simplified()->CheckNumber(FeedbackSource()), *receiver, in TryBuildNumberCheck()
102 map_set.insert(map.object(), graph()->zone()); in BuildCheckMaps()
107 *effect = graph()->NewNode(simplified()->CheckMaps(flags, map_set), object, in BuildCheckMaps()
118 graph()->NewNode(simplified()->ReferenceEqual(), receiver, expected); in BuildCheckValue()
120 graph()->NewNode(simplified()->CheckIf(DeoptimizeReason::kWrongValue), in BuildCheckValue()
225 storage = *effect = graph() in BuildLoadDataField()
[all...]
H A Dmachine-graph.cc5 #include "src/compiler/machine-graph.h"
17 *loc = graph()->NewNode(common()->Int32Constant(value)); in Int32Constant()
25 *loc = graph()->NewNode(common()->Int64Constant(value)); in Int64Constant()
44 *loc = graph()->NewNode(common()->TaggedIndexConstant(value32)); in TaggedIndexConstant()
54 *loc = graph()->NewNode(common()->RelocatableInt32Constant(value, rmode)); in RelocatableInt32Constant()
64 *loc = graph()->NewNode(common()->RelocatableInt64Constant(value, rmode)); in RelocatableInt64Constant()
79 *loc = graph()->NewNode(common()->Float32Constant(value)); in Float32Constant()
87 *loc = graph()->NewNode(common()->Float64Constant(value)); in Float64Constant()
95 *loc = graph()->NewNode(common()->PointerConstant(value)); in PointerConstant()
103 *loc = graph() in ExternalConstant()
[all...]
H A Dwasm-inlining.cc12 #include "src/wasm/graph-builder-interface.h"
160 // We could build the candidate's graph first and consider its node count, in Finalize()
196 size_t subgraph_min_node_id = graph()->NodeCount(); in Finalize()
205 Graph::SubgraphScope scope(graph()); in Finalize()
215 inlinee_start = graph()->start(); in Finalize()
216 inlinee_end = graph()->end(); in Finalize()
232 size_t additional_nodes = graph()->NodeCount() - subgraph_min_node_id; in Finalize()
274 // They should point to the graph's start. in RewireFunctionEntry()
276 ? graph()->start() in RewireFunctionEntry()
293 // inlined graph t in InlineTailCall()
[all...]
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...]
/third_party/ffmpeg/libavfilter/
H A Dgraphparser.c2 * filter graph parser
168 * corresponding filter instance which is added to graph with
182 static int parse_filter(AVFilterContext **filt_ctx, const char **buf, AVFilterGraph *graph, in parse_filter() argument
201 ret = create_filter(filt_ctx, graph, index, name, opts, log_ctx); in parse_filter()
395 static int parse_sws_flags(const char **buf, AVFilterGraph *graph) in parse_sws_flags() argument
403 av_log(graph, AV_LOG_ERROR, "sws_flags not terminated with ';'.\n"); in parse_sws_flags()
409 av_freep(&graph->scale_sws_opts); in parse_sws_flags()
410 if (!(graph->scale_sws_opts = av_mallocz(p - *buf + 1))) in parse_sws_flags()
412 av_strlcpy(graph->scale_sws_opts, *buf, p - *buf + 1); in parse_sws_flags()
418 int avfilter_graph_parse2(AVFilterGraph *graph, cons argument
486 avfilter_graph_parse(AVFilterGraph *graph, const char *filters, AVFilterInOut *open_inputs, AVFilterInOut *open_outputs, void *log_ctx) avfilter_graph_parse() argument
549 avfilter_graph_parse_ptr(AVFilterGraph *graph, const char *filters, AVFilterInOut **open_inputs_ptr, AVFilterInOut **open_outputs_ptr, void *log_ctx) avfilter_graph_parse_ptr() argument
[all...]
H A Davfilter.h425 struct AVFilterGraph *graph; ///< filtergraph this filter belongs to member
469 * Overrides global number of threads set per filter graph.
491 * This field must be set before the graph containing this filter is
603 struct AVFilterGraph *graph; member
879 * Type of multithreading allowed for filters in this graph. A combination
885 * When a filter in this graph is initialized, this field is combined using
893 * Maximum number of threads used by filters in this graph. May be set by
913 * graph and before adding any filters to it, to provide a custom
941 * Allocate a filter graph.
943 * @return the allocated filter graph o
[all...]
/third_party/mesa3d/src/nouveau/codegen/
H A Dnv50_ir_graph.cpp49 node->graph = this; in insert()
87 in(0), out(0), graph(0), in Node()
119 assert(graph || node->graph); in attach()
120 if (!node->graph) in attach()
121 graph->insert(node); in attach()
122 if (!graph) in attach()
123 node->graph->insert(this); in attach()
126 graph->classifyEdges(); in attach()
143 // Cut a node from the graph, deletin
199 DFSIterator(Graph *graph, const bool preorder) DFSIterator() argument
257 CFGIterator(Graph *graph) CFGIterator() argument
[all...]
/kernel/linux/linux-6.6/sound/soc/qcom/qdsp6/
H A Dq6apm-lpass-dais.c21 struct q6apm_graph *graph[APM_PORT_MAX]; member
145 rc = q6apm_graph_stop(dai_data->graph[dai->id]); in q6apm_lpass_dai_shutdown()
149 q6apm_graph_close(dai_data->graph[dai->id]); in q6apm_lpass_dai_shutdown()
157 struct q6apm_graph *graph; in q6apm_lpass_dai_prepare() local
162 q6apm_graph_stop(dai_data->graph[dai->id]); in q6apm_lpass_dai_prepare()
166 q6apm_graph_close(dai_data->graph[dai->id]); in q6apm_lpass_dai_prepare()
170 * It is recommend to load DSP with source graph first and then sink in q6apm_lpass_dai_prepare()
171 * graph, so sequence for playback and capture will be different in q6apm_lpass_dai_prepare()
174 graph = q6apm_graph_open(dai->dev, NULL, dai->dev, graph_id); in q6apm_lpass_dai_prepare()
175 if (IS_ERR(graph)) { in q6apm_lpass_dai_prepare()
210 struct q6apm_graph *graph; q6apm_lpass_dai_startup() local
[all...]
H A Dq6apm-dai.c77 struct q6apm_graph *graph; member
142 q6apm_write_async(prtd->graph, prtd->pcm_count, 0, 0, 0); in event_handler()
151 q6apm_read(prtd->graph); in event_handler()
206 q6apm_write_async(prtd->graph, in event_handler_compr()
212 audioreach_shared_memory_send_eos(prtd->graph); in event_handler_compr()
236 if (!prtd || !prtd->graph) { in q6apm_dai_prepare()
249 q6apm_graph_stop(prtd->graph); in q6apm_dai_prepare()
250 q6apm_unmap_memory_regions(prtd->graph, substream->stream); in q6apm_dai_prepare()
256 ret = q6apm_graph_media_format_shmem(prtd->graph, &cfg); in q6apm_dai_prepare()
262 ret = q6apm_graph_media_format_pcm(prtd->graph, in q6apm_dai_prepare()
[all...]
H A Daudioreach.c45 /* Container graph Position */
582 int audioreach_graph_send_cmd_sync(struct q6apm_graph *graph, struct gpr_pkt *pkt, in audioreach_graph_send_cmd_sync() argument
586 return audioreach_send_cmd_sync(graph->dev, NULL, &graph->result, &graph->lock, in audioreach_graph_send_cmd_sync()
587 graph->port, &graph->cmd_wait, pkt, rsp_opcode); in audioreach_graph_send_cmd_sync()
591 static int audioreach_display_port_set_media_format(struct q6apm_graph *graph, in audioreach_display_port_set_media_format() argument
650 rc = q6apm_send_cmd_sync(graph->apm, pkt, 0); in audioreach_display_port_set_media_format()
658 static int audioreach_codec_dma_set_media_format(struct q6apm_graph *graph, in audioreach_codec_dma_set_media_format() argument
735 audioreach_send_u32_param(struct q6apm_graph *graph, struct audioreach_module *module, uint32_t param_id, uint32_t param_val) audioreach_send_u32_param() argument
770 audioreach_sal_limiter_enable(struct q6apm_graph *graph, struct audioreach_module *module, bool enable) audioreach_sal_limiter_enable() argument
776 audioreach_sal_set_media_format(struct q6apm_graph *graph, struct audioreach_module *module, struct audioreach_module_config *cfg) audioreach_sal_set_media_format() argument
783 audioreach_module_enable(struct q6apm_graph *graph, struct audioreach_module *module, bool enable) audioreach_module_enable() argument
790 audioreach_gapless_set_media_format(struct q6apm_graph *graph, struct audioreach_module *module, struct audioreach_module_config *cfg) audioreach_gapless_set_media_format() argument
798 audioreach_mfc_set_media_format(struct q6apm_graph *graph, struct audioreach_module *module, struct audioreach_module_config *cfg) audioreach_mfc_set_media_format() argument
907 audioreach_compr_set_param(struct q6apm_graph *graph, struct audioreach_module_config *mcfg) audioreach_compr_set_param() argument
938 audioreach_i2s_set_media_format(struct q6apm_graph *graph, struct audioreach_module *module, struct audioreach_module_config *cfg) audioreach_i2s_set_media_format() argument
1014 audioreach_logging_set_media_format(struct q6apm_graph *graph, struct audioreach_module *module) audioreach_logging_set_media_format() argument
1049 audioreach_pcm_set_media_format(struct q6apm_graph *graph, struct audioreach_module *module, struct audioreach_module_config *mcfg) audioreach_pcm_set_media_format() argument
1107 audioreach_shmem_set_media_format(struct q6apm_graph *graph, struct audioreach_module *module, struct audioreach_module_config *mcfg) audioreach_shmem_set_media_format() argument
1209 audioreach_gain_set(struct q6apm_graph *graph, struct audioreach_module *module) audioreach_gain_set() argument
1238 audioreach_set_media_format(struct q6apm_graph *graph, struct audioreach_module *module, struct audioreach_module_config *cfg) audioreach_set_media_format() argument
1292 audioreach_graph_free_buf(struct q6apm_graph *graph) audioreach_graph_free_buf() argument
1310 audioreach_map_memory_regions(struct q6apm_graph *graph, unsigned int dir, size_t period_sz, unsigned int periods, bool is_contiguous) audioreach_map_memory_regions() argument
1374 audioreach_shared_memory_send_eos(struct q6apm_graph *graph) audioreach_shared_memory_send_eos() argument
[all...]
/third_party/node/test/async-hooks/
H A Dverify-graph.js7 function findInGraph(graph, type, n) {
9 for (let i = 0; i < graph.length; i++) {
10 const node = graph[i];
59 module.exports = function verifyGraph(hooks, graph) {
62 // Map actual ids to standin ids defined in the graph
75 const node = findInGraph(graph, x.type, typeSeen[x.type]);
104 for (let i = 0; i < graph.length; i++) {
105 if (expTypes[graph[i].type] == null) expTypes[graph[i].type] = 0;
106 expTypes[graph[
[all...]
/third_party/node/tools/gyp/pylib/gyp/
H A Dcommon_test.py16 """Test that sorting works on a valid graph with one possible order."""
17 graph = {
25 return tuple(graph[node])
28 gyp.common.TopologicallySorted(graph.keys(), GetEdge), ["a", "c", "d", "b"]
32 """Test that an exception is thrown on a cyclic graph."""
33 graph = {
41 return tuple(graph[node])
44 gyp.common.CycleError, gyp.common.TopologicallySorted, graph.keys(), GetEdge
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/
H A Dcommon_test.py16 """Test that sorting works on a valid graph with one possible order."""
17 graph = {
25 return tuple(graph[node])
28 gyp.common.TopologicallySorted(graph.keys(), GetEdge), ["a", "c", "d", "b"]
32 """Test that an exception is thrown on a cyclic graph."""
33 graph = {
41 return tuple(graph[node])
44 gyp.common.CycleError, gyp.common.TopologicallySorted, graph.keys(), GetEdge
/third_party/ffmpeg/fftools/
H A Dffmpeg_filter.c98 avfilter_graph_set_auto_convert(ofilter->graph->graph, in choose_pix_fmts()
188 ofilter->graph = fg; in init_simple_filtergraph()
195 ifilter->graph = fg; in init_simple_filtergraph()
302 ifilter->graph = fg; in init_input_filter()
318 AVFilterGraph *graph; in init_complex_filtergraph() local
321 /* this graph is only used for determining the kinds of inputs in init_complex_filtergraph()
323 graph = avfilter_graph_alloc(); in init_complex_filtergraph()
324 if (!graph) in init_complex_filtergraph()
326 graph in init_complex_filtergraph()
357 AVFilterGraph *graph = (*last_filter)->graph; insert_trim() local
407 AVFilterGraph *graph = (*last_filter)->graph; insert_filter() local
976 graph_is_meta(AVFilterGraph *graph) graph_is_meta() argument
[all...]
/third_party/ffmpeg/tools/
H A Dgraph2dot.c39 printf("Convert a libavfilter graph to a dot file.\n"); in usage()
53 static void print_digraph(FILE *outfile, AVFilterGraph *graph) in print_digraph() argument
61 for (i = 0; i < graph->nb_filters; i++) { in print_digraph()
63 const AVFilterContext *filter_ctx = graph->filters[i]; in print_digraph()
115 AVFilterGraph *graph = NULL; in main() local
191 graph = avfilter_graph_alloc(); in main()
192 if (!graph) { in main()
197 if (avfilter_graph_parse(graph, graph_string, NULL, NULL, NULL) < 0) { in main()
198 fprintf(stderr, "Failed to parse the graph description\n"); in main()
202 if (avfilter_graph_config(graph, NUL in main()
[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...]

Completed in 24 milliseconds

12345678910>>...13