Lines Matching defs:state
47 #define SINVALID 255 /* invalid state */
56 * Structure to keep track of the lexing state and the various pieces of info
57 * needed for each particular state.
61 /* point to the next state block */
63 /* marks start of state output in output string */
78 /* type of this state */
158 state = statep->type = (s); \
165 state = statep->type; \
194 * hence the state stack. Note "$(...)" are now parsed recursively.
202 int c, c2, state;
221 state = SWORD;
225 state = SLETPAREN;
229 state = (cf & HEREDELIM) ? SHEREDELIM : SBASE;
250 /* Initial state: one of SWORD SLETPAREN SHEREDELIM SBASE */
251 statep->type = state;
256 ((state == SBASE || state == SHEREDELIM) && ctype(c, C_LEX1)))) {
257 if (state == SBASE &&
263 switch (state) {
511 if (state == SDQUOTE ||
512 state == SQBRACE)
624 state == SQBRACE)
680 /* reuse existing state machine */
880 state = statep->type = SHEREDELIM;
907 if (state == SHEREDELIM)
908 state = SBASE;
911 if (state == SBASE && (
964 if (wp == dp && state == SBASE) {
1018 if (state == SWORD || state == SLETPAREN
1591 } state = PS_INITIAL;
1596 switch (state) {
1621 state = PS_SAW_PERCENT;
1624 state = PS_SAW_HASH;
1627 state = PS_SAW_BANG;
1634 state = PS_IDENT;
1636 state = PS_NUMBER;
1638 state = PS_VAR1;