Lines Matching defs:top
282 if (graph->top == MEDIA_ENTITY_ENUM_MAX_DEPTH - 1) {
286 graph->top++;
287 graph->stack[graph->top].link = entity->links.next;
288 graph->stack[graph->top].entity = entity;
295 entity = graph->stack[graph->top].entity;
296 graph->top--;
301 #define link_top(en) ((en)->stack[(en)->top].link)
302 #define stack_top(en) ((en)->stack[(en)->top].entity)
338 graph->top = 0;
339 graph->stack[graph->top].entity = NULL;
399 * top of the stack until no more entities on the level can be
420 * When a new pad is reached, an entry is pushed on the top of the stack and
448 * @stack.top: Index of the top stack entry (-1 if the stack is empty)
456 int top;
466 return &walk->stack.entries[walk->stack.top];
471 return walk->stack.top == -1;
505 if (walk->stack.top + 1 >= walk->stack.size) {
511 walk->stack.top++;
518 walk->stack.top, pad->entity->name, pad->index);
524 * Move the top entry link cursor to the next link. If all links of the entry
532 if (WARN_ON(walk->stack.top < 0))
540 walk->stack.top);
542 walk->stack.top--;
550 walk->stack.top);
593 /* Explore the next link of the entity at the top of the stack. */
714 walk.stack.top = -1;
721 * empty, explore the next link of the top entry. The
724 * top.
739 WARN_ON(walk.stack.top != -1);