Lines Matching defs:stack
27 #include "tre-stack.h"
1290 tre_stack_t *stack = ctx->stack;
1291 int bottom = tre_stack_num_objects(stack);
1305 STACK_PUSH(stack, int, ctx->cflags);
1306 STACK_PUSH(stack, int, ctx->submatch_id);
1307 STACK_PUSH(stack, int, PARSE_MARK_FOR_SUBMATCH);
1310 STACK_PUSH(stack, int, 0); // bre_branch_begin
1311 STACK_PUSH(stack, int, PARSE_RE);
1317 an explicit stack instead of recursive functions mostly because of
1319 call stack, and efficiency (both in lines of code and speed). */
1320 while (tre_stack_num_objects(stack) > bottom)
1322 symbol = tre_stack_pop_int(stack);
1328 bre_branch_begin = tre_stack_pop_int(stack);
1334 STACK_PUSHX(stack, int, PARSE_UNION);
1335 STACK_PUSHX(stack, int, bre_branch_begin);
1336 STACK_PUSHX(stack, int, PARSE_BRANCH);
1342 bre_branch_begin = tre_stack_pop_int(stack);
1343 STACK_PUSHX(stack, int, PARSE_CATENATION);
1344 STACK_PUSHX(stack, int, bre_branch_begin);
1345 STACK_PUSHX(stack, int, PARSE_PIECE);
1351 bre_branch_begin = tre_stack_pop_int(stack);
1352 STACK_PUSHX(stack, int, PARSE_POSTFIX);
1353 STACK_PUSHX(stack, int, bre_branch_begin);
1354 STACK_PUSHX(stack, int, PARSE_ATOM);
1396 STACK_PUSHX(stack, int, PARSE_CATENATION);
1397 STACK_PUSHX(stack, voidptr, result);
1398 STACK_PUSHX(stack, int, PARSE_POST_CATENATION);
1399 STACK_PUSHX(stack, int, 0); // bre_branch_begin
1400 STACK_PUSHX(stack, int, PARSE_PIECE);
1406 STACK_PUSHX(stack, voidptr, result);
1407 STACK_PUSHX(stack, int, PARSE_POST_CATENATION);
1408 STACK_PUSHX(stack, int, PARSE_CATENATION);
1409 STACK_PUSHX(stack, int, 0); // bre_branch_begin
1410 STACK_PUSHX(stack, int, PARSE_PIECE);
1417 tre_ast_node_t *tree = tre_stack_pop_voidptr(stack);
1444 STACK_PUSHX(stack, int, PARSE_UNION);
1445 STACK_PUSHX(stack, voidptr, (void *)ctx->re);
1446 STACK_PUSHX(stack, voidptr, result);
1447 STACK_PUSHX(stack, int, PARSE_POST_UNION);
1450 STACK_PUSHX(stack, int, (ctx->cflags & (REG_EXTENDED | REG_ENHANCED)) == REG_ENHANCED); // bre_branch_begin
1451 STACK_PUSHX(stack, int, PARSE_BRANCH);
1469 tre_ast_node_t *tree = tre_stack_pop_voidptr(stack);
1470 const tre_char_t *pipechar = tre_stack_pop_voidptr(stack);
1609 STACK_PUSHX(stack, int, PARSE_POSTFIX);
1688 STACK_PUSHX(stack, int, PARSE_POSTFIX);
1701 /* The stack contains a boolean value, whether PARSE_ATOM is
1704 bre_branch_begin = tre_stack_pop_int(stack);
1824 STACK_PUSHX(stack, int, ctx->cflags);
1825 STACK_PUSHX(stack, int, ctx->submatch_id_invisible);
1826 STACK_PUSHX(stack, int, PARSE_MARK_FOR_SUBMATCH);
1828 STACK_PUSHX(stack, int, 0); // bre_branch_begin
1829 STACK_PUSHX(stack, int, PARSE_RE);
1832 STACK_PUSHX(stack, int, 0); // bre_branch_begin
1833 STACK_PUSHX(stack, int, PARSE_ATOM);
1848 STACK_PUSHX(stack, int, ctx->cflags);
1849 STACK_PUSHX(stack, int, ctx->submatch_id);
1850 STACK_PUSHX(stack, int, PARSE_MARK_FOR_SUBMATCH);
1853 STACK_PUSHX(stack, int, !(ctx->cflags & REG_EXTENDED));
1854 STACK_PUSHX(stack, int, PARSE_RE);
1952 STACK_PUSHX(stack, int, 0);
1953 STACK_PUSHX(stack, int, PARSE_ATOM);
2167 STACK_PUSHX(stack, int, 0);
2168 STACK_PUSHX(stack, int, PARSE_ATOM);
2295 int submatch_id = tre_stack_pop_int(stack);
2297 ctx->cflags = tre_stack_pop_int(stack); /* restore cflags */