Lines Matching full:graph
239 * Graph traversal
292 static void stack_push(struct media_graph *graph, in stack_push() argument
295 if (graph->top == MEDIA_ENTITY_ENUM_MAX_DEPTH - 1) { in stack_push()
299 graph->top++; in stack_push()
300 graph->stack[graph->top].link = entity->links.next; in stack_push()
301 graph->stack[graph->top].entity = entity; in stack_push()
304 static struct media_entity *stack_pop(struct media_graph *graph) in stack_pop() argument
308 entity = graph->stack[graph->top].entity; in stack_pop()
309 graph->top--; in stack_pop()
318 * media_graph_walk_init - Allocate resources for graph walk
319 * @graph: Media graph structure that will be used to walk the graph
322 * Reserve resources for graph walk in media device's current
329 struct media_graph *graph, struct media_device *mdev) in media_graph_walk_init() argument
331 return media_entity_enum_init(&graph->ent_enum, mdev); in media_graph_walk_init()
336 * media_graph_walk_cleanup - Release resources related to graph walking
337 * @graph: Media graph structure that was used to walk the graph
339 void media_graph_walk_cleanup(struct media_graph *graph) in media_graph_walk_cleanup() argument
341 media_entity_enum_cleanup(&graph->ent_enum); in media_graph_walk_cleanup()
345 void media_graph_walk_start(struct media_graph *graph, in media_graph_walk_start() argument
348 media_entity_enum_zero(&graph->ent_enum); in media_graph_walk_start()
349 media_entity_enum_set(&graph->ent_enum, entity); in media_graph_walk_start()
351 graph->top = 0; in media_graph_walk_start()
352 graph->stack[graph->top].entity = NULL; in media_graph_walk_start()
353 stack_push(graph, entity); in media_graph_walk_start()
355 "begin graph walk at '%s'\n", entity->name); in media_graph_walk_start()
359 static void media_graph_walk_iter(struct media_graph *graph) in media_graph_walk_iter() argument
361 struct media_entity *entity = stack_top(graph); in media_graph_walk_iter()
365 link = list_entry(link_top(graph), typeof(*link), list); in media_graph_walk_iter()
369 link_top(graph) = link_top(graph)->next; in media_graph_walk_iter()
375 link_top(graph) = link_top(graph)->next; in media_graph_walk_iter()
387 if (media_entity_enum_test_and_set(&graph->ent_enum, next)) { in media_graph_walk_iter()
388 link_top(graph) = link_top(graph)->next; in media_graph_walk_iter()
396 link_top(graph) = link_top(graph)->next; in media_graph_walk_iter()
397 stack_push(graph, next); in media_graph_walk_iter()
403 struct media_entity *media_graph_walk_next(struct media_graph *graph) in media_graph_walk_next() argument
407 if (stack_top(graph) == NULL) in media_graph_walk_next()
415 while (link_top(graph) != &stack_top(graph)->links) in media_graph_walk_next()
416 media_graph_walk_iter(graph); in media_graph_walk_next()
418 entity = stack_pop(graph); in media_graph_walk_next()
431 * The pipeline traversal stack stores pads that are reached during graph
437 * internal pad dependencies in the entity, and then links in the graph. It
726 * Populate the media pipeline by walking the media graph, starting in media_pipeline_populate()
799 * with media_pipeline_pad instances for each pad found during graph in __media_pipeline_start()
900 * Link validation on graph failed. We revert what we did and in __media_pipeline_start()
1160 /* Initialize graph object embedded at the new link */ in media_create_pad_link()
1164 /* Create the backlink. Backlinks are used to help graph traversal and in media_create_pad_link()
1178 /* Initialize graph object embedded at the new link */ in media_create_pad_link()
1586 /* Initialize graph object embedded at the new link */ in media_create_intf_link()
1654 /* Initialize graph object embedded in the new link */ in media_create_ancillary_link()