Searched refs:state (Results 1 – 8 of 8) sorted by relevance
1028 state->in_search = 1-state->in_search; in do_match()1029 bzero(state->pattern, sizeof(state->pattern)); in do_match()1032 } else if (!state->in_search) in do_match()1036 state->pattern[strlen(state->pattern)] = c; in do_match()1037 state->pattern[strlen(state->pattern)] = '\0'; in do_match()1040 state->match_direction); in do_match()1044 state->match_direction); in do_match()1048 state->match_direction); in do_match()1050 state->pattern[strlen(state->pattern)-1] = '\0'; in do_match()1056 state->in_search = 0; in do_match()[all …]
157 my $state = "NONE";203 $state = "NEW";213 $state = "DEP";217 } elsif ($state eq "NEW" && /^\s*depends\s+on\s+(.*)$/) {218 $state = "DEP";220 } elsif ($state eq "DEP" && /^\s*depends\s+on\s+(.*)$/) {224 } elsif ($state ne "NONE" && /^\s*select\s+(\S+)/) {233 } elsif ($state ne "NONE" && /^\s*tristate\s\S/) {254 $state = "NONE";
153 #define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)165 /* The state buf must be large enough to hold one state per character in the main buffer.277 * "scanner state".793 YY_BUFFER_STATE state;1012 (yy_start) = 1; /* first start state */1812 * @return the allocated buffer state.1898 * a jam in that state.1912 /** Pushes the new state onto the stack. The new state becomes1915 * @param new_buffer The new state.2360 current_buf->state = YY_CURRENT_BUFFER;[all …]
414 /* YYFINAL -- State number of the termination state. */618 /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state692 /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If766 symbol of state STATE-NUM. */1410 /* The state stack. */1457 so that they stay on the same level as the state stack.1465 | yynewstate -- Push a new state, which is found in yystate. |1536 YYDPRINTF ((stderr, "Entering state %d\n", yystate));1548 /* Do appropriate processing given the current state. Read a1608 | yydefault -- do the default action for the current state. |[all …]
31 YY_BUFFER_STATE state; member
149 enables the third modular state for all config symbols.164 expressions uses one more state than normal boolean logic to express the165 module state. Dependency expressions have the following syntax:
242 static void state(Ifstate);548 static void Strue (void) { drop(); ignoreoff(); state(IS_TRUE_PREFIX); } in Strue()549 static void Sfalse(void) { drop(); ignoreoff(); state(IS_FALSE_PREFIX); } in Sfalse()550 static void Selse (void) { drop(); state(IS_TRUE_ELSE); } in Selse()552 static void Pelif (void) { print(); ignoreoff(); state(IS_PASS_MIDDLE); } in Pelif()553 static void Pelse (void) { print(); state(IS_PASS_ELSE); } in Pelse()557 static void Delif (void) { drop(); ignoreoff(); state(IS_FALSE_MIDDLE); } in Delif()558 static void Delse (void) { drop(); state(IS_FALSE_ELSE); } in Delse()575 static void Mtrue (void) { keywordedit("else"); state(IS_TRUE_MIDDLE); } in Mtrue()577 static void Melse (void) { keywordedit("endif"); state(IS_FALSE_ELSE); } in Melse()[all …]
1470 These make it difficult to infer internal state of prng from unbroken
Completed in 19 milliseconds