226  * Graph traversal
266 static void stack_push(struct media_graph *graph,  in stack_push()  argument
269 	if (graph->top == MEDIA_ENTITY_ENUM_MAX_DEPTH - 1) {  in stack_push()
273 	graph->top++;  in stack_push()
274 	graph->stack[graph->top].link = entity->links.next;  in stack_push()
275 	graph->stack[graph->top].entity = entity;  in stack_push()
278 static struct media_entity *stack_pop(struct media_graph *graph)  in stack_pop()  argument
282 	entity = graph->stack[graph->top].entity;  in stack_pop()
283 	graph->top--;  in stack_pop()
292  * media_graph_walk_init - Allocate resources for graph walk
293  * @graph: Media graph structure that will be used to walk the graph
296  * Reserve resources for graph walk in media device's current
303 	struct media_graph *graph, struct media_device *mdev)  in media_graph_walk_init()  argument
305 	return media_entity_enum_init(&graph->ent_enum, mdev);  in media_graph_walk_init()
310  * media_graph_walk_cleanup - Release resources related to graph walking
311  * @graph: Media graph structure that was used to walk the graph
313 void media_graph_walk_cleanup(struct media_graph *graph)  in media_graph_walk_cleanup()  argument
315 	media_entity_enum_cleanup(&graph->ent_enum);  in media_graph_walk_cleanup()
319 void media_graph_walk_start(struct media_graph *graph,  in media_graph_walk_start()  argument
322 	media_entity_enum_zero(&graph->ent_enum);  in media_graph_walk_start()
323 	media_entity_enum_set(&graph->ent_enum, entity);  in media_graph_walk_start()
325 	graph->top = 0;  in media_graph_walk_start()
326 	graph->stack[graph->top].entity = NULL;  in media_graph_walk_start()
327 	stack_push(graph, entity);  in media_graph_walk_start()
329 		"begin graph walk at '%s'\n", entity->name);  in media_graph_walk_start()
333 static void media_graph_walk_iter(struct media_graph *graph)  in media_graph_walk_iter()  argument
335 	struct media_entity *entity = stack_top(graph);  in media_graph_walk_iter()
339 	link = list_entry(link_top(graph), typeof(*link), list);  in media_graph_walk_iter()
343 		link_top(graph) = link_top(graph)->next;  in media_graph_walk_iter()
349 		link_top(graph) = link_top(graph)->next;  in media_graph_walk_iter()
361 	if (media_entity_enum_test_and_set(&graph->ent_enum, next)) {  in media_graph_walk_iter()
362 		link_top(graph) = link_top(graph)->next;  in media_graph_walk_iter()
370 	link_top(graph) = link_top(graph)->next;  in media_graph_walk_iter()
371 	stack_push(graph, next);  in media_graph_walk_iter()
377 struct media_entity *media_graph_walk_next(struct media_graph *graph)  in media_graph_walk_next()  argument
381 	if (stack_top(graph) == NULL)  in media_graph_walk_next()
389 	while (link_top(graph) != &stack_top(graph)->links)  in media_graph_walk_next()
390 		media_graph_walk_iter(graph);  in media_graph_walk_next()
392 	entity = stack_pop(graph);  in media_graph_walk_next()
405  * The pipeline traversal stack stores pads that are reached during graph
411  * internal pad dependencies in the entity, and then links in the graph. It
658 	 * Populate the media pipeline by walking the media graph, starting  in media_pipeline_populate()
731 	 * with media_pipeline_pad instances for each pad found during graph  in __media_pipeline_start()
834 	 * Link validation on graph failed. We revert what we did and  in __media_pipeline_start()
1037 	/* Initialize graph object embedded at the new link */  in media_create_pad_link()
1041 	/* Create the backlink. Backlinks are used to help graph traversal and  in media_create_pad_link()
1055 	/* Initialize graph object embedded at the new link */  in media_create_pad_link()
1460 	/* Initialize graph object embedded at the new link */  in media_create_intf_link()
1528 	/* Initialize graph object embedded in the new link */  in media_create_ancillary_link()