/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/sh/sh64/ |
H A D | relax-1.s | 1 ! Check limits of PT assembler relaxation states. Unfortunately, we can't
|
/netbsd-6-1-5-RELEASE/usr.sbin/pf/pfs/ |
H A D | parser.h | 39 struct pfioc_states* states; variable in typeref:struct:pfioc_states
|
H A D | parse.y | 89 states 91 | state states { parse_init(); } 487 states->ps_buf = malloc(allocated * sizeof(struct pfsync_state)); 488 if (states->ps_buf == NULL) 492 if (allocated == (states->ps_len / sizeof(struct pfsync_state))) { 495 buf = realloc(states->ps_buf, allocated * sizeof(struct pfsync_state)); 497 free(states->ps_buf); 500 states->ps_buf = buf; 503 idx = states->ps_len / sizeof(struct pfsync_state);
|
H A D | token.l | 121 states = s;
|
/netbsd-6-1-5-RELEASE/external/bsd/libarchive/dist/libarchive/ |
H A D | archive_check_magic.c | 91 write_all_states(unsigned int states) argument 96 while ((lowbit = states & (1 + ~states)) != 0) { 97 states &= ~lowbit; /* Clear the low bit. */ 99 if (states != 0)
|
/netbsd-6-1-5-RELEASE/external/bsd/openldap/dist/libraries/liblunicode/ure/ |
H A D | ure.c | 149 * This is a structure used to track a list or a stack of states. 158 * Structure to track the list of unique states for a symbol 167 _ure_stlist_t states; member in struct:__anon2007 184 * Structure used for keeping lists of states. 187 _ure_state_t *states; member in struct:__anon2009 193 * Structure to track pairs of DFA states when equivalent states are 227 * The reduced table of unique groups of NFA states. 229 _ure_statetable_t states; member in struct:_ure_buffer_t 232 * Tracks states whe 256 _ure_dstate_t *states; member in struct:_ure_dfa_t 1315 _ure_add_state(ucs2_t nstates, ucs2_t *states, _ure_buffer_t *b) argument [all...] |
/netbsd-6-1-5-RELEASE/external/bsd/flex/dist/examples/manual/ |
H A D | j2t.lex | 3 * of start states. 16 int states[MAX_STATES]; 207 states[statep] = EXAMPLE2; 213 BEGIN(states[statep]); 233 states[statep] = ENUM; 241 states[statep] = EXAMPLE; 253 BEGIN(states[statep]); 267 states[statep] = LITEM2; 280 BEGIN(states[statep]); 302 states[state [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/gettext/gettext-tools/libgrep/ |
H A D | dfa.h | 57 states of the DFA are those that would have 313 dfa_state *states; /* States of the dfa. */ member in struct:dfa 314 int sindex; /* Index for adding new states. */ 315 int salloc; /* Number of states currently allocated. */ 338 int **trans; /* Transition tables for states that can 357 #define ACCEPTING(s, r) ((r).states[s].constraint) 362 SUCCEEDS_IN_CONTEXT((dfa).states[state].constraint, \ 368 #define FIRST_MATCHING_REGEXP(state, dfa) (-(dfa).states[state].first_end)
|
H A D | dfa.c | 1477 if (hash != d->states[i].hash || s->nelem != d->states[i].elems.nelem 1478 || newline != d->states[i].newline || letter != d->states[i].letter) 1482 != d->states[i].elems.elems[j].constraint 1483 || s->elems[j].index != d->states[i].elems.elems[j].index) 1490 REALLOC_IF_NECESSARY(d->states, dfa_state, d->salloc, d->sindex); 1491 d->states[i].hash = hash; 1492 MALLOC(d->states[i].elems.elems, position, s->nelem); 1493 copy(s, &d->states[ [all...] |
/netbsd-6-1-5-RELEASE/external/bsd/tcpdump/dist/ |
H A D | print-hsrp.c | 60 /* HSRP states and associated names. */ 61 static struct tok states[] = { variable in typeref:struct:tok 119 printf("state=%s ", tok2str(states, "Unknown (%d)", hp->hsrp_state));
|
H A D | pf_print_state.c | 266 const char *states[] = PFUDPS_NAMES; local 268 printf(" %s:%s\n", states[src->state], states[dst->state]); 272 const char *states[] = PFOTHERS_NAMES; local 274 printf(" %s:%s\n", states[src->state], states[dst->state]);
|
/netbsd-6-1-5-RELEASE/external/bsd/top/dist/ |
H A D | display.h | 55 void i_cpustates(int *states); 56 void u_cpustates(int *states);
|
H A D | display.c | 872 /* color tags for cpu states */ 1145 * *_cpustates(states, names) - print the cpu state percentages 1160 "CPU states: " : "CPU%0*d states: "; 1180 i_cpustates(int *states) argument 1197 states[i] += states[c * num_cpustates + i]; 1199 states[i] /= ncpu; 1218 value = *states; 1236 states 1245 u_cpustates(int *states) argument [all...] |
/netbsd-6-1-5-RELEASE/sys/external/isc/atheros_hal/dist/ar5416/ |
H A D | ar5416_misc.c | 348 int states; member in struct:__anon8769 366 if (check->states & dcu_chain_state) { 380 if (check->states & dcu_complete_state) { 384 if (check->states & qcu_stitch_state) { 388 if (check->states & qcu_fetch_state) { 392 if (check->states & qcu_complete_state) { 396 return (found_states == check->states); 407 .states = dcu_chain_state 414 .states = qcu_stitch_state
|
/netbsd-6-1-5-RELEASE/gnu/dist/grep/src/ |
H A D | dfa.h | 76 states of the DFA are those that would have 332 dfa_state *states; /* States of the dfa. */ member in struct:dfa 333 int sindex; /* Index for adding new states. */ 334 int salloc; /* Number of states currently allocated. */ 357 int **trans; /* Transition tables for states that can 376 #define ACCEPTING(s, r) ((r).states[s].constraint) 381 SUCCEEDS_IN_CONTEXT((dfa).states[state].constraint, \ 387 #define FIRST_MATCHING_REGEXP(state, dfa) (-(dfa).states[state].first_end)
|
H A D | dfa.c | 1498 if (hash != d->states[i].hash || s->nelem != d->states[i].elems.nelem 1499 || newline != d->states[i].newline || letter != d->states[i].letter) 1503 != d->states[i].elems.elems[j].constraint 1504 || s->elems[j].index != d->states[i].elems.elems[j].index) 1511 REALLOC_IF_NECESSARY(d->states, dfa_state, d->salloc, d->sindex); 1512 d->states[i].hash = hash; 1513 MALLOC(d->states[i].elems.elems, position, s->nelem); 1514 copy(s, &d->states[ [all...] |
/netbsd-6-1-5-RELEASE/sys/dev/raidframe/ |
H A D | rf_desc.h | 75 int state; /* index into states telling how far along the 77 const RF_AccessState_t *states; /* array of states to be run */ member in struct:RF_RaidAccessDesc_s
|
/netbsd-6-1-5-RELEASE/dist/nvi/regex/ |
H A D | regexec.c | 68 /* macros for manipulating states, small version */ 69 #define states int macro 96 #undef states macro 116 /* macros for manipulating states, large version */ 117 #define states char * macro
|
H A D | engine.c | 83 states st; /* current states */ 84 states fresh; /* states for a fresh start */ 85 states tmp; /* temporary */ 86 states empty; /* empty set of states */ 100 static states step __P((struct re_guts *g, sopno start, sopno stop, states bef, int flag, RCHAR_T ch, states af [all...] |
/netbsd-6-1-5-RELEASE/dist/pf/sbin/pfctl/ |
H A D | pf_print_state.c | 257 const char *states[] = PFUDPS_NAMES; local 259 printf(" %s:%s\n", states[src->state], states[dst->state]); 263 const char *states[] = PFOTHERS_NAMES; local 265 printf(" %s:%s\n", states[src->state], states[dst->state]);
|
/netbsd-6-1-5-RELEASE/usr.sbin/isdn/isdntrace/ |
H A D | q932_fac.h | 157 enum states { enum
|
/netbsd-6-1-5-RELEASE/sys/netisdn/ |
H A D | i4b_q932fac.h | 157 enum states { enum
|
/netbsd-6-1-5-RELEASE/lib/libc/regex/ |
H A D | engine.c | 117 states st; /* current states */ 118 states fresh; /* states for a fresh start */ 119 states tmp; /* temporary */ 120 states empty; /* empty set of states */ 134 static states step(struct re_guts *g, sopno start, sopno stop, states bef, int ch, states af [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/config/h8300/ |
H A D | lib1funcs.asm | 779 ; 16b * 16b = 372 states (worst case) 780 ; 32b * 32b = 724 states (worst case) 784 ; 16b * 16b = 48 states 785 ; 16b * 32b = 72 states 786 ; 32b * 32b = 92 states 791 mov.w r1,r2 ; ( 2 states) b * d 792 mulxu r0,er2 ; (22 states) 794 mov.w e0,r3 ; ( 2 states) a * d 795 beq L_skip1 ; ( 4 states) 796 mulxu r1,er3 ; (22 states) [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/config/h8300/ |
H A D | lib1funcs.asm | 784 ; 16b * 16b = 372 states (worst case) 785 ; 32b * 32b = 724 states (worst case) 789 ; 16b * 16b = 48 states 790 ; 16b * 32b = 72 states 791 ; 32b * 32b = 92 states 796 mov.w r1,r2 ; ( 2 states) b * d 797 mulxu r0,er2 ; (22 states) 799 mov.w e0,r3 ; ( 2 states) a * d 800 beq L_skip1 ; ( 4 states) 801 mulxu r1,er3 ; (22 states) [all...] |