| /src/external/gpl3/gdb.old/dist/gdb/ |
| addrmap.h | 30 transitions in the map, where a CORE_ADDR N is mapped to one
112 /* The number of transitions in TRANSITIONS. */
115 /* An array of transitions, sorted by address. For every point in
120 struct addrmap_transition *transitions; member in struct:final
|
| /src/external/gpl3/gdb/dist/gdb/ |
| addrmap.h | 30 transitions in the map, where a CORE_ADDR N is mapped to one
109 /* The number of transitions in TRANSITIONS. */
112 /* An array of transitions, sorted by address. For every point in
117 struct addrmap_transition *transitions; member in struct:final
|
| /src/sys/dev/isa/ |
| isv.c | 176 int state, transitions; local
189 state = transitions = 0;
193 transitions++;
199 aprint_debug("%s: %d transitions\n", __func__, transitions);
201 return transitions >= 4 && transitions <= 10;
|
| /src/external/bsd/tre/dist/lib/ |
| tre-internal.h | 146 /* TNFA transition type. A TNFA state is an array of transitions,
232 tre_tnfa_transition_t *transitions; member in struct:tnfa
|
| tre-compile.c | 1574 tre_tnfa_transition_t *transitions,
1581 if (transitions != NULL)
1597 trans = transitions + offs[p1->position];
1627 trans->state = transitions + offs[p2->position];
1771 /* Compute a maximum limit for the number of transitions leaving
1786 /* Converts the syntax tree to a TNFA. All the transitions in the TNFA are
1787 labelled with one character range (there are no transitions on empty
1791 tre_ast_to_tnfa(tre_ast_node_t *node, tre_tnfa_transition_t *transitions,
1806 errcode = tre_ast_to_tnfa(uni->left, transitions, counts, offs);
1809 errcode = tre_ast_to_tnfa(uni->right, transitions, counts, offs)
1865 tre_tnfa_transition_t *transitions, *initial; local
[all...] |
| /src/external/bsd/tmux/dist/ |
| input.c | 360 const struct input_transition *transitions; member in struct:input_state
363 /* State transitions available from all states. */
964 itr = ictx->state->transitions;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| genrecog.cc | 1435 /* A simple set of transition labels. Most transitions have a singleton
1514 /* Links to other transitions for T. Always null for boolean tests. */
1653 /* Remove any optional transitions from S that turned out not to be useful. */
1748 When returning true, add all transitions like COMMON in D to WHERE.
1894 transitions it has. */
2210 /* Remove optional transitions that turned out not to be worthwhile. */
2321 transitions. TRANSITIONS[I] describes the subpattern for transition
2324 auto_vec <merge_pattern_transition *, 1> transitions;
2342 transitions.safe_grow_cleared (num_transitions, true)
2320 auto_vec <merge_pattern_transition *, 1> transitions; member in class:merge_pattern_info
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| genrecog.cc | 1435 /* A simple set of transition labels. Most transitions have a singleton
1514 /* Links to other transitions for T. Always null for boolean tests. */
1653 /* Remove any optional transitions from S that turned out not to be useful. */
1748 When returning true, add all transitions like COMMON in D to WHERE.
1894 transitions it has. */
2210 /* Remove optional transitions that turned out not to be worthwhile. */
2321 transitions. TRANSITIONS[I] describes the subpattern for transition
2324 auto_vec <merge_pattern_transition *, 1> transitions;
2342 transitions.safe_grow_cleared (num_transitions, true)
2320 auto_vec <merge_pattern_transition *, 1> transitions; member in class:merge_pattern_info
[all...] |
