Removes and deletes the top of the stack, if present. * The next element becomes the new top. * @param yyscanner The scanner object. */
| 2056 | * @param yyscanner The scanner object. |
| 2057 | */ |
| 2058 | void yypop_buffer_state (yyscan_t yyscanner) |
| 2059 | { |
| 2060 | struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; |
| 2061 | if (!YY_CURRENT_BUFFER) |
| 2062 | return; |
| 2063 | |
| 2064 | yy_delete_buffer(YY_CURRENT_BUFFER , yyscanner); |
| 2065 | YY_CURRENT_BUFFER_LVALUE = NULL; |
| 2066 | if (yyg->yy_buffer_stack_top > 0) |
| 2067 | --yyg->yy_buffer_stack_top; |
| 2068 | |
| 2069 | if (YY_CURRENT_BUFFER) { |
| 2070 | yy_load_buffer_state( yyscanner ); |
| 2071 | yyg->yy_did_buffer_switch_on_eof = 1; |
| 2072 | } |
| 2073 | } |
| 2074 | |
| 2075 | /* Allocates the stack if it does not exist. |
| 2076 | * Guarantees space for at least one push. |
no test coverage detected
searching dependent graphs…