parse.c File Reference

#include "c.h"
#include <err.h>
#include <stdio.h>
#include "indent_globs.h"
#include "indent_codes.h"
#include "indent.h"

Include dependency graph for parse.c:

Go to the source code of this file.

Functions
static void	reduce (void)
void	parse (int tk)

Function Documentation

parse()

void parse

(

int

tk

)

Definition at line 49 of file parse.c.

{
    int         i;
 
#ifdef debug
    printf("%2d - %s\n", tk, token);
#endif
 
    while (ps.p_stack[ps.tos] == ifhead && tk != elselit) {
    /* true if we have an if without an else */
    ps.p_stack[ps.tos] = stmt;  /* apply the if(..) stmt ::= stmt
                     * reduction */
    reduce();       /* see if this allows any reduction */
    }
 
 
    switch (tk) {       /* go on and figure out what to do with the
                 * input */
 
    case decl:          /* scanned a declaration word */
    ps.search_brace = btype_2;
    /* indicate that following brace should be on same line */
    if (ps.p_stack[ps.tos] != decl) {   /* only put one declaration
                         * onto stack */
        break_comma = true; /* while in declaration, newline should be
                 * forced after comma */
        ps.p_stack[++ps.tos] = decl;
        ps.il[ps.tos] = ps.i_l_follow;
 
        if (ps.ljust_decl) {/* only do if we want left justified
                 * declarations */
        ps.ind_level = 0;
        for (i = ps.tos - 1; i > 0; --i)
            if (ps.p_stack[i] == decl)
            ++ps.ind_level; /* indentation is number of
                     * declaration levels deep we are */
        ps.i_l_follow = ps.ind_level;
        }
    }
    break;
 
    case ifstmt:        /* scanned if (...) */
    if (ps.p_stack[ps.tos] == elsehead && ps.else_if)   /* "else if ..." */
        /*
         * Note that the stack pointer here is decremented, effectively
         * reducing "else if" to "if". This saves a lot of stack space
         * in case of a long "if-else-if ... else-if" sequence.
         */
        ps.i_l_follow = ps.il[ps.tos--];
    /* the rest is the same as for dolit and forstmt */
    /* FALLTHROUGH */
    case dolit:     /* 'do' */
    case forstmt:       /* for (...) */
    ps.p_stack[++ps.tos] = tk;
    ps.il[ps.tos] = ps.ind_level = ps.i_l_follow;
    ++ps.i_l_follow;    /* subsequent statements should be indented 1 */
    ps.search_brace = btype_2;
    break;
 
    case lbrace:        /* scanned { */
    break_comma = false;    /* don't break comma in an initial list */
    if (ps.p_stack[ps.tos] == stmt || ps.p_stack[ps.tos] == decl
        || ps.p_stack[ps.tos] == stmtl)
        ++ps.i_l_follow;    /* it is a random, isolated stmt group or a
                 * declaration */
    else {
        if (s_code == e_code) {
        /*
         * only do this if there is nothing on the line
         */
        --ps.ind_level;
        /*
         * it is a group as part of a while, for, etc.
         */
        if (ps.p_stack[ps.tos] == swstmt && ps.case_indent >= 1)
            --ps.ind_level;
        /*
         * for a switch, brace should be two levels out from the code
         */
        }
    }
 
    ps.p_stack[++ps.tos] = lbrace;
    ps.il[ps.tos] = ps.ind_level;
    ps.p_stack[++ps.tos] = stmt;
    /* allow null stmt between braces */
    ps.il[ps.tos] = ps.i_l_follow;
    break;
 
    case whilestmt:     /* scanned while (...) */
    if (ps.p_stack[ps.tos] == dohead) {
        /* it is matched with do stmt */
        ps.ind_level = ps.i_l_follow = ps.il[ps.tos];
        ps.p_stack[++ps.tos] = whilestmt;
        ps.il[ps.tos] = ps.ind_level = ps.i_l_follow;
    }
    else {          /* it is a while loop */
        ps.p_stack[++ps.tos] = whilestmt;
        ps.il[ps.tos] = ps.i_l_follow;
        ++ps.i_l_follow;
        ps.search_brace = btype_2;
    }
 
    break;
 
    case elselit:       /* scanned an else */
 
    if (ps.p_stack[ps.tos] != ifhead)
        diag2(1, "Unmatched 'else'");
    else {
        ps.ind_level = ps.il[ps.tos];   /* indentation for else should
                         * be same as for if */
        ps.i_l_follow = ps.ind_level + 1;   /* everything following should
                         * be in 1 level */
        ps.p_stack[ps.tos] = elsehead;
        /* remember if with else */
        ps.search_brace = btype_2 | ps.else_if;
    }
    break;
 
    case rbrace:        /* scanned a } */
    /* stack should have <lbrace> <stmt> or <lbrace> <stmtl> */
    if (ps.tos > 0 && ps.p_stack[ps.tos - 1] == lbrace) {
        ps.ind_level = ps.i_l_follow = ps.il[--ps.tos];
        ps.p_stack[ps.tos] = stmt;
    }
    else
        diag2(1, "Statement nesting error");
    break;
 
    case swstmt:        /* had switch (...) */
    ps.p_stack[++ps.tos] = swstmt;
    ps.cstk[ps.tos] = case_ind;
    /* save current case indent level */
    ps.il[ps.tos] = ps.i_l_follow;
    case_ind = ps.i_l_follow + ps.case_indent;  /* cases should be one
                             * level down from
                             * switch */
    ps.i_l_follow += ps.case_indent + 1;    /* statements should be two
                         * levels in */
    ps.search_brace = btype_2;
    break;
 
    case semicolon:     /* this indicates a simple stmt */
    break_comma = false;    /* turn off flag to break after commas in a
                 * declaration */
    ps.p_stack[++ps.tos] = stmt;
    ps.il[ps.tos] = ps.ind_level;
    break;
 
    default:            /* this is an error */
    diag2(1, "Unknown code to parser");
    return;
 
 
    }               /* end of switch */
 
    if (ps.tos >= nitems(ps.p_stack) - 1)
    errx(1, "Parser stack overflow");
 
    reduce();           /* see if any reduction can be done */
 
#ifdef debug
    for (i = 1; i <= ps.tos; ++i)
    printf("(%d %d)", ps.p_stack[i], ps.il[i]);
    printf("\n");
#endif
 
    return;
}

References break_comma, btype_2, case_ind, parser_state::case_indent, parser_state::cstk, decl, diag2(), dohead, dolit, e_code, parser_state::else_if, elsehead, elselit, errx(), fb(), forstmt, i, parser_state::i_l_follow, ifhead, ifstmt, parser_state::il, parser_state::ind_level, lbrace, parser_state::ljust_decl, nitems, parser_state::p_stack, parse(), printf, ps, rbrace, reduce(), s_code, parser_state::search_brace, semicolon, stmt, stmtl, swstmt, parser_state::tos, and whilestmt.

Referenced by add_foreign_final_paths(), add_foreign_grouping_paths(), add_foreign_ordered_paths(), add_paths_to_grouping_rel(), build_minmax_path(), build_mvdependencies(), build_mvndistinct(), can_partial_agg(), check_sql_stmt_retval(), consider_groupingsets_paths(), convert_ANY_sublink_to_join(), convert_EXISTS_sublink_to_join(), create_degenerate_grouping_paths(), create_final_distinct_paths(), create_grouping_paths(), create_limit_plan(), create_partial_distinct_paths(), create_partial_grouping_paths(), delay_execution_planner(), dependencies_array_element_start(), dependencies_array_end(), dependencies_array_start(), dependencies_object_end(), dependencies_object_field_start(), dependencies_object_start(), dependencies_scalar(), distribute_row_identity_vars(), expand_single_inheritance_child(), expand_virtual_generated_columns(), flatten_simple_union_all(), get_nullingrels(), get_number_of_groups(), get_sql_fn_result_tlist(), get_useful_group_keys_orderings(), grouping_planner(), is_degenerate_grouping(), json_manifest_array_end(), json_manifest_array_start(), json_manifest_finalize_file(), json_manifest_finalize_system_identifier(), json_manifest_finalize_version(), json_manifest_finalize_wal_range(), json_manifest_object_end(), json_manifest_object_field_start(), json_manifest_object_start(), json_manifest_scalar(), json_parse_manifest(), json_parse_manifest_incremental_chunk(), json_parse_manifest_incremental_init(), limit_needed(), main(), make_group_input_target(), make_sort_input_target(), max_parallel_hazard(), ndistinct_array_element_start(), ndistinct_array_end(), ndistinct_array_start(), ndistinct_object_end(), ndistinct_object_field_start(), ndistinct_object_start(), ndistinct_scalar(), parse(), perform_pullup_replace_vars(), pgss_planner(), plan_set_operations(), planner(), preprocess_groupclause(), preprocess_grouping_sets(), preprocess_limit(), preprocess_minmax_aggregates(), preprocess_relation_rtes(), preprocess_rowmarks(), preprocess_targetlist(), pull_up_constant_function(), pull_up_simple_subquery(), pull_up_simple_values(), query_planner(), remove_useless_groupby_columns(), replace_empty_jointree(), resolve_unique_index_expr(), set_subquery_pathlist(), standard_planner(), standard_qp_callback(), subquery_planner(), transform_MERGE_to_join(), and verify_manifest_checksum().

reduce()

static void reduce ( void  )

static

Definition at line 260 of file parse.c.

{
    int i;
 
    for (;;) {          /* keep looping until there is nothing left to
                 * reduce */
 
    switch (ps.p_stack[ps.tos]) {
 
    case stmt:
        switch (ps.p_stack[ps.tos - 1]) {
 
        case stmt:
        case stmtl:
        /* stmtl stmt or stmt stmt */
        ps.p_stack[--ps.tos] = stmtl;
        break;
 
        case dolit: /* <do> <stmt> */
        ps.p_stack[--ps.tos] = dohead;
        ps.i_l_follow = ps.il[ps.tos];
        break;
 
        case ifstmt:
        /* <if> <stmt> */
        ps.p_stack[--ps.tos] = ifhead;
        for (i = ps.tos - 1;
            (
             ps.p_stack[i] != stmt
             &&
             ps.p_stack[i] != stmtl
             &&
             ps.p_stack[i] != lbrace
             );
            --i);
        ps.i_l_follow = ps.il[i];
        /*
         * for the time being, we will assume that there is no else on
         * this if, and set the indentation level accordingly. If an
         * else is scanned, it will be fixed up later
         */
        break;
 
        case swstmt:
        /* <switch> <stmt> */
        case_ind = ps.cstk[ps.tos - 1];
        /* FALLTHROUGH */
        case decl:      /* finish of a declaration */
        case elsehead:
        /* <<if> <stmt> else> <stmt> */
        case forstmt:
        /* <for> <stmt> */
        case whilestmt:
        /* <while> <stmt> */
        ps.p_stack[--ps.tos] = stmt;
        ps.i_l_follow = ps.il[ps.tos];
        break;
 
        default:        /* <anything else> <stmt> */
        return;
 
        }           /* end of section for <stmt> on top of stack */
        break;
 
    case whilestmt: /* while (...) on top */
        if (ps.p_stack[ps.tos - 1] == dohead) {
        /* it is termination of a do while */
        ps.tos -= 2;
        break;
        }
        else
        return;
 
    default:        /* anything else on top */
        return;
 
    }
    }
}

References case_ind, parser_state::cstk, decl, dohead, dolit, elsehead, forstmt, i, parser_state::i_l_follow, ifhead, ifstmt, parser_state::il, lbrace, parser_state::p_stack, ps, stmt, stmtl, swstmt, parser_state::tos, and whilestmt.

Referenced by parse(), and startScan().