Lines Matching defs:stack
7074 * and the parsing stack, so must be called whenever either is updated. */
7160 * like CHECKDELIM, which could call some callbacks and pop the stack. */
7413 /* Pushes a frame onto the decoder stack. */
7444 /* Pops a frame from the decoder stack. */
7594 /* Callers know that the stack is more than one deep because the opcodes that
7597 UPB_ASSERT(d->top != d->stack);
7727 UPB_ASSERT(d->top > d->stack);
7855 d->stack->end_ofs = end;
7891 d->top = d->stack;
7911 d->stack = upb_arena_malloc(a, stacksize(d, default_max_nesting));
7912 if (!d->stack || !d->callstack) {
7917 d->limit = d->stack + default_max_nesting - 1;
7953 UPB_ASSERT(d->top >= d->stack);
7955 if (max < (size_t)(d->top - d->stack)) {
7961 /* Need to reallocate stack and callstack to accommodate. */
7964 void *p = upb_arena_realloc(d->arena, d->stack, old_size, new_size);
7968 d->stack = p;
7981 d->limit = d->stack + max - 1;
8097 /* The stack of enclosing submessages. Each entry in the stack points to the
8099 int *stack, *top, *stacklimit;
8200 * stack. */
8204 /* TODO(haberman): grow stack? */
8227 e->top = e->stack;
8246 if (e->top == e->stack) {
8526 e->stack = upb_arena_malloc(arena, stack_size * sizeof(*e->stack));
8528 if (!e->buf || !e->segbuf || !e->stack) {
8534 e->stacklimit = e->stack + stack_size;
8977 ** - properly check and report errors for unknown fields, stack overflow,
9199 upb_jsonparser_frame stack[UPB_JSON_MAX_DEPTH];
9205 /* Ragel's internal parsing stack for the parsing state machine. */
10973 UPB_ASSERT(p->top > p->stack);
11178 UPB_ASSERT(p->top > p->stack);
11462 return p->top == p->stack && p->top->f == NULL && !p->top->is_unknown_field;
11802 int *stack = parser->parser_stack;
11893 { p--; {cs = stack[--top]; goto _again;} }
11897 { p--; {stack[top++] = cs; cs = 23;goto _again;} }
11925 { p--; {cs = stack[--top]; goto _again;} }
11985 { p--; {cs = stack[--top]; goto _again;} }
12009 { p--; {cs = stack[--top]; goto _again;} }
12029 { p--; {cs = stack[--top]; goto _again;} }
12035 {stack[top++] = cs; cs = 47;goto _again;}
12037 {stack[top++] = cs; cs = 40;goto _again;}
12039 {stack[top++] = cs; cs = 75;goto _again;}
12041 {stack[top++] = cs; cs = 32;goto _again;}
12047 { p--; {stack[top++] = cs; cs = 78;goto _again;} }
12139 { p--; {cs = stack[--top]; goto _again;} }
12159 { p--; {cs = stack[--top]; if ( p == pe )
12229 p->top = p->stack;
12306 p->limit = p->stack + UPB_JSON_MAX_DEPTH;