/netbsd-current/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.cp/ |
H A D | pass-by-ref.exp | 41 # A special function is in one of the following states: 59 # combination of special function states. 90 # Return 1 if the class whose special function states are STATES 93 proc is_copy_constructible { states } { 94 set cctor [lindex $states 0] 95 set dtor [lindex $states 1] 96 set mctor [lindex $states 2] 149 proc generate_class { classname length states } { 152 set classname "${classname}_[join $states _]" 154 for {set i 0} {$i < [llength $states]} {inc [all...] |
/netbsd-current/external/gpl3/gdb/dist/gdb/testsuite/gdb.cp/ |
H A D | pass-by-ref.exp | 41 # A special function is in one of the following states: 59 # combination of special function states. 90 # Return 1 if the class whose special function states are STATES 93 proc is_copy_constructible { states } { 94 set cctor [lindex $states 0] 95 set dtor [lindex $states 1] 96 set mctor [lindex $states 2] 149 proc generate_class { classname length states } { 152 set classname "${classname}_[join $states _]" 154 for {set i 0} {$i < [llength $states]} {inc [all...] |
/netbsd-current/usr.sbin/pf/pfs/ |
H A D | parser.h | 39 extern struct pfioc_states* states;
|
H A D | parse.y | 55 struct pfioc_states* states; 94 states 96 | state states { parse_init(); } 491 states->ps_buf = malloc(allocated * sizeof(struct pfsync_state)); 492 if (states->ps_buf == NULL) 496 if (allocated == (states->ps_len / sizeof(struct pfsync_state))) { 499 buf = realloc(states->ps_buf, allocated * sizeof(struct pfsync_state)); 501 free(states->ps_buf); 504 states->ps_buf = buf;
|
/netbsd-current/external/bsd/openldap/dist/libraries/liblunicode/ure/ |
H A D | ure.c | 152 * This is a structure used to track a list or a stack of states. 161 * Structure to track the list of unique states for a symbol 170 _ure_stlist_t states; member in struct:__anon87 187 * Structure used for keeping lists of states. 190 _ure_state_t *states; member in struct:__anon89 196 * Structure to track pairs of DFA states when equivalent states are 230 * The reduced table of unique groups of NFA states. 232 _ure_statetable_t states; member in struct:_ure_buffer_t 235 * Tracks states whe 259 _ure_dstate_t *states; member in struct:_ure_dfa_t 1318 _ure_add_state(ucs2_t nstates, ucs2_t *states, _ure_buffer_t *b) argument [all...] |
/netbsd-current/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-current/external/bsd/libarchive/dist/libarchive/ |
H A D | archive_check_magic.c | 102 write_all_states(char *buff, unsigned int states) argument 109 while ((lowbit = states & (1 + ~states)) != 0) { 110 states &= ~lowbit; /* Clear the low bit. */ 112 if (states != 0)
|
/netbsd-current/sys/external/bsd/drm2/dist/drm/ |
H A D | drm_blend.c | 438 struct drm_plane_state **states; local 446 states = kmalloc_array(total_planes, sizeof(*states), GFP_KERNEL); 447 if (!states) 451 * Normalization process might create new states for planes which 461 states[n++] = plane_state; 467 sort(states, n, sizeof(*states), drm_atomic_state_zpos_cmp, NULL); 470 plane = states[i]->plane; 472 states[ [all...] |
/netbsd-current/sbin/luactl/ |
H A D | luactl.c | 125 info.states = NULL; 130 info.states = calloc(info.num_states, 132 if (info.states == NULL) 142 printf("%-16s %-8s %s\n", info.states[n].name, 143 info.states[n].user == true ? "user" : "kernel", 144 info.states[n].desc);
|
/netbsd-current/external/gpl2/gettext/dist/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-current/external/bsd/top/dist/ |
H A D | display.h | 55 void i_cpustates(int *states); 56 void u_cpustates(int *states);
|
/netbsd-current/external/bsd/tcpdump/dist/ |
H A D | print-hsrp.c | 56 /* HSRP states and associated names. */ 57 static const struct tok states[] = { variable in typeref:struct:tok 117 tok2str(states, "Unknown (%u)", GET_U_1(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-current/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/ |
H A D | condbreak-multi-context.exp | 69 # Test the breakpoint location enabled states. STATES is a list of 70 # location states. We assume STATES to contain the state for A, Base, 74 proc check_bp_locations {bpnum states cond {msg ""}} { 77 # Map location names to location states. 78 set loc_states(A) [lindex $states 0] 79 set loc_states(Base) [lindex $states 1] 80 set loc_states(C) [lindex $states 2] 96 if {[lsearch $states N*] >= 0} {
|
/netbsd-current/sys/external/isc/atheros_hal/dist/ar5416/ |
H A D | ar5416_misc.c | 348 int states; member in struct:__anon12342 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-current/external/gpl3/binutils/dist/gprofng/src/ |
H A D | Ovw_data.cc | 91 int_max (&totals->states, item.states); 139 ovw_item.states = 0; 194 int states; local 217 states = 0; 221 states++; 238 states++; 241 ovw_item->states = states;
|
H A D | Exp_Layout.cc | 312 Vector<long long> *states = new Vector<long long>; local 313 states->store (0, prusage->pr_utime); 314 states->store (1, prusage->pr_stime); 315 states->store (2, prusage->pr_ttime); 316 states->store (3, prusage->pr_tftime); 317 states->store (4, prusage->pr_dftime); 318 states->store (5, prusage->pr_kftime); 319 states->store (6, prusage->pr_ltime); 320 states->store (7, prusage->pr_slptime); 321 states [all...] |
/netbsd-current/external/gpl2/grep/dist/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)
|
/netbsd-current/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-current/external/bsd/nvi/dist/regex/ |
H A D | regexec.c | 72 /* macros for manipulating states, small version */ 73 #define states int macro 100 #undef states macro 120 /* macros for manipulating states, large version */ 121 #define states char * macro
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Support/ |
H A D | regexec.c | 56 /* macros for manipulating states, small version */ 57 /* FIXME: 'states' is assumed as 'long' on small version. */ 59 #define states states1 macro 85 #undef states macro 105 /* macros for manipulating states, large version */ 106 #define states char * macro
|
H A D | regengine.inc | 81 states st; /* current states */ 82 states fresh; /* states for a fresh start */ 83 states tmp; /* temporary */ 84 states empty; /* empty set of states */ 95 static states step(struct re_guts *, sopno, sopno, states, int, states); [all...] |
/netbsd-current/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-current/external/apache2/llvm/dist/llvm/utils/unittest/googlemock/src/ |
H A D | gmock-spec-builders.cc | 640 StateMap& states() { return states_; } function in class:__anon3331::MockObjectRegistry 709 g_mock_object_registry.states()[mock_obj].leakable = true; 737 if (g_mock_object_registry.states().count(mock_obj) == 0) { 746 g_mock_object_registry.states()[mock_obj].function_mockers; 777 g_mock_object_registry.states()[mock_obj].function_mockers.insert(mocker); 787 MockObjectState& state = g_mock_object_registry.states()[mock_obj]; 808 g_mock_object_registry.states().begin(); 809 it != g_mock_object_registry.states().end(); ++it) { 814 g_mock_object_registry.states().erase(it); 826 if (g_mock_object_registry.states() [all...] |