300 	graph->stack[graph->top].link = entity->links.next;  in stack_push()
301 	graph->stack[graph->top].entity = entity;  in stack_push()
308 	entity = graph->stack[graph->top].entity;  in stack_pop()
314 #define link_top(en)	((en)->stack[(en)->top].link)
315 #define stack_top(en)	((en)->stack[(en)->top].entity)
352 	graph->stack[graph->top].entity = NULL;  in media_graph_walk_start()
471 	} stack;  member
479 	return &walk->stack.entries[walk->stack.top];  in media_pipeline_walk_top()
484 	return walk->stack.top == -1;  in media_pipeline_walk_empty()
494 	if (walk->stack.size >= 256)  in media_pipeline_walk_resize()
497 	new_size = walk->stack.size + MEDIA_PIPELINE_STACK_GROW_STEP;  in media_pipeline_walk_resize()
499 	entries = krealloc(walk->stack.entries,  in media_pipeline_walk_resize()
500 			   new_size * sizeof(*walk->stack.entries),  in media_pipeline_walk_resize()
505 	walk->stack.entries = entries;  in media_pipeline_walk_resize()
506 	walk->stack.size = new_size;  in media_pipeline_walk_resize()
518 	if (walk->stack.top + 1 >= walk->stack.size) {  in media_pipeline_walk_push()
524 	walk->stack.top++;  in media_pipeline_walk_push()
531 		walk->stack.top, pad->entity->name, pad->index);  in media_pipeline_walk_push()
545 	if (WARN_ON(walk->stack.top < 0))  in media_pipeline_walk_pop()
553 			walk->stack.top);  in media_pipeline_walk_pop()
555 		walk->stack.top--;  in media_pipeline_walk_pop()
563 		walk->stack.top);  in media_pipeline_walk_pop()
571 	kfree(walk->stack.entries);  in media_pipeline_walk_destroy()
733 	walk.stack.top = -1;  in media_pipeline_populate()
758 	WARN_ON(walk.stack.top != -1);  in media_pipeline_populate()