Searched refs:state (Results 51 - 75 of 2035) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/gcclibs/libiberty/
H A Drandom.c49 control over the state of the random number generator.
86 rand()/srand() like interface, this package also has a special state info
90 that much state information. Good sizes for the amount of state
91 information are 32, 64, 128, and 256 bytes. The state can be switched by
93 with initstate(). By default, the package runs with 128 bytes of state
95 congruential generator. If the amount of state information is less than
97 state information is treated as an array of longs; the zeroeth element of
99 of the array is the state information for the R.N.G. Thus, 32 bytes of
100 state informatio
213 static long int *state = &randtbl[1]; variable
[all...]
/freebsd-11-stable/contrib/jemalloc/include/jemalloc/internal/
H A Dprng.h38 uint64_t prng_lg_range(uint64_t *state, unsigned lg_range);
39 uint64_t prng_range(uint64_t *state, uint64_t range);
44 prng_lg_range(uint64_t *state, unsigned lg_range) argument
51 ret = (*state * PRNG_A) + PRNG_C;
52 *state = ret;
59 prng_range(uint64_t *state, uint64_t range) argument
71 ret = prng_lg_range(state, lg_range);
/freebsd-11-stable/contrib/binutils/libiberty/
H A Drandom.c49 control over the state of the random number generator.
86 rand()/srand() like interface, this package also has a special state info
90 that much state information. Good sizes for the amount of state
91 information are 32, 64, 128, and 256 bytes. The state can be switched by
93 with initstate(). By default, the package runs with 128 bytes of state
95 congruential generator. If the amount of state information is less than
97 state information is treated as an array of longs; the zeroeth element of
99 of the array is the state information for the R.N.G. Thus, 32 bytes of
100 state informatio
213 static long int *state = &randtbl[1]; variable
[all...]
/freebsd-11-stable/contrib/expat/xmlwf/
H A Dct.c38 int state = init; local
48 if (state == inAtom)
52 if (state == inAtom)
54 if (state != inString)
55 state++;
58 if (state > init)
59 --state;
60 else if (state != inString)
66 if (state == inAtom)
68 if (state
[all...]
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dzcp_synctask.c67 zcp_sync_task(lua_State *state, dsl_checkfunc_t *checkfunc, argument
71 zcp_run_info_t *ri = zcp_run_info(state);
78 return (luaL_error(state, "running functions from the zfs.sync "
88 return (luaL_error(state,
92 return (luaL_error(state,
119 zcp_synctask_destroy(lua_State *state, boolean_t sync, nvlist_t *err_details) argument
122 const char *dsname = lua_tostring(state, 1);
126 if (!issnap && !lua_isnil(state, 2)) {
127 return (luaL_error(state,
135 if (!lua_isnil(state,
170 zcp_synctask_promote(lua_State *state, boolean_t sync, nvlist_t *err_details) argument
207 zcp_synctask_rollback(lua_State *state, boolean_t sync, nvlist_t *err_details) argument
240 zcp_synctask_snapshot(lua_State *state, boolean_t sync, nvlist_t *err_details) argument
279 zcp_synctask_wrapper(lua_State *state) argument
337 zcp_load_synctask_lib(lua_State *state, boolean_t sync) argument
[all...]
/freebsd-11-stable/sys/amd64/vmm/amd/
H A Dvmcb.c52 * - guest processor state (e.g. general purpose registers)
61 struct vmcb_state *state; local
64 state = &vmcb->state;
68 seg = &state->cs;
72 seg = &state->ds;
76 seg = &state->es;
80 seg = &state->fs;
84 seg = &state->gs;
88 seg = &state
164 struct vmcb_state *state; local
254 struct vmcb_state *state; local
[all...]
/freebsd-11-stable/tools/tools/net80211/wesside/wesside/
H A Daircrack-ptw-lib.c43 // Internal state of rc4
63 // The rc4 initial state, the idendity permutation
137 static void rc4init ( uint8_t * key, int keylen, rc4state * state) { argument
141 memcpy(state->s, &rc4initial, n);
144 j = (j + state->s[i] + key[i % keylen]) % n;
145 tmp = state->s[i];
146 state->s[i] = state->s[j];
147 state->s[j] = tmp;
149 state
154 rc4update(rc4state * state) argument
188 uint8_t state[n]; local
219 correct(PTW_attackstate * state, uint8_t * key, int keylen) argument
285 doRound(PTW_tableentry sortedtable[][n], int keybyte, int fixat, uint8_t fixvalue, int * searchborders, uint8_t * key, int keylen, PTW_attackstate * state, uint8_t sum, int * strongbytes) argument
319 doComputation(PTW_attackstate * state, uint8_t * key, int keylen, PTW_tableentry table[][n], sorthelper * sh2, int * strongbytes, int keylimit) argument
363 PTW_computeKey(PTW_attackstate * state, uint8_t * keybuf, int keylen, int testlimit) argument
436 PTW_addsession(PTW_attackstate * state, uint8_t * iv, uint8_t * keystream) argument
468 PTW_attackstate * state = NULL; local
485 PTW_freeattackstate(PTW_attackstate * state) argument
[all...]
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_read_support_filter_lz4.c227 struct private_data *state; local
232 state = (struct private_data *)calloc(sizeof(*state), 1);
233 if (state == NULL) {
239 self->data = state;
240 state->stage = SELECT_STREAM;
251 struct private_data *state = (struct private_data *)self->data; local
252 size_t out_block_size = state->flags.block_maximum_size;
255 if (!state->flags.block_independence)
257 if (state
276 struct private_data *state = (struct private_data *)self->data; local
300 struct private_data *state = (struct private_data *)self->data; local
382 struct private_data *state = (struct private_data *)self->data; local
481 struct private_data *state = (struct private_data *)self->data; local
623 struct private_data *state = (struct private_data *)self->data; local
676 struct private_data *state = (struct private_data *)self->data; local
732 struct private_data *state; local
[all...]
H A Darchive_read_support_filter_xz.c481 struct private_data *state; local
484 state = (struct private_data *)calloc(sizeof(*state), 1);
486 if (state == NULL || out_block == NULL) {
490 free(state);
494 self->data = state;
495 state->out_block_size = out_block_size;
496 state->out_block = out_block;
501 state->stream.avail_in = 0;
503 state
542 struct private_data *state; local
598 struct private_data *state; local
659 struct private_data *state; local
736 struct private_data *state; local
[all...]
H A Darchive_read_support_filter_lzop.c180 struct read_lzop *state; local
185 state = (struct read_lzop *)calloc(sizeof(*state), 1);
186 if (state == NULL) {
192 self->data = state;
203 struct read_lzop *state = (struct read_lzop *)self->data; local
293 state->flags = flags;
294 state->in_stream = 1;
309 struct read_lzop *state = (struct read_lzop *)self->data; local
311 unsigned flags = state
361 struct read_lzop *state = (struct read_lzop *)self->data; local
487 struct read_lzop *state = (struct read_lzop *)self->data; local
[all...]
H A Dxxhash.c294 void* state = XXH32_init(seed);
295 XXH32_update(state, input, len);
296 return XXH32_digest(state);
345 struct XXH_state32_t * state = (struct XXH_state32_t *) state_in; local
346 state->seed = seed;
347 state->v1 = seed + PRIME32_1 + PRIME32_2;
348 state->v2 = seed + PRIME32_2;
349 state->v3 = seed + 0;
350 state->v4 = seed - PRIME32_1;
351 state
359 void* state = XXH_malloc (sizeof(struct XXH_state32_t)); local
367 struct XXH_state32_t * state = (struct XXH_state32_t *) state_in; local
445 struct XXH_state32_t * state = (struct XXH_state32_t *) state_in; local
[all...]
/freebsd-11-stable/sys/arm/arm/
H A Ddb_trace.c58 db_stack_trace_cmd(struct unwind_state *state) argument
71 finished = unwind_stack_one(state, 1);
74 sym = db_search_symbol(state->start_pc, DB_STGY_ANY, &offset);
81 db_printsym(state->start_pc, DB_STGY_PROC);
83 db_printf("\t pc = 0x%08x lr = 0x%08x (", state->start_pc,
84 state->registers[LR]);
85 db_printsym(state->registers[LR], DB_STGY_PROC);
88 state->registers[SP], state->registers[FP]);
91 upd_mask = state
156 struct unwind_state state; local
176 struct unwind_state state; local
[all...]
/freebsd-11-stable/sys/contrib/vchiq/interface/vchiq_arm/
H A Dvchiq_arm.h97 ** tracked separately with the state.
128 vchiq_platform_init(VCHIQ_STATE_T *state);
131 vchiq_platform_exit(VCHIQ_STATE_T *state);
137 vchiq_arm_vcsuspend(VCHIQ_STATE_T *state);
140 vchiq_arm_force_suspend(VCHIQ_STATE_T *state);
143 vchiq_arm_allow_resume(VCHIQ_STATE_T *state);
146 vchiq_arm_vcresume(VCHIQ_STATE_T *state);
149 vchiq_arm_init_state(VCHIQ_STATE_T *state, VCHIQ_ARM_STATE_T *arm_state);
152 vchiq_check_resume(VCHIQ_STATE_T *state);
155 vchiq_check_suspend(VCHIQ_STATE_T *state);
[all...]
/freebsd-11-stable/contrib/gcc/
H A Dmkmap-symver.awk22 state = "nm";
39 state == "nm" && /^%%/ {
40 state = "ver";
44 state == "nm" && ($1 == "U" || $2 == "U") {
48 state == "nm" && NF == 3 {
54 state == "nm" {
/freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/
H A DState.cpp14 const char *lldb_private::StateAsCString(StateType state) { argument
15 switch (state) {
68 bool lldb_private::StateIsRunningState(StateType state) { argument
69 switch (state) {
89 bool lldb_private::StateIsStoppedState(StateType state, bool must_exist) { argument
90 switch (state) {
/freebsd-11-stable/sys/net/
H A Dmp_ring.c54 uint64_t state; member in union:ring_state
87 /* Consumer is about to update the ring's state to s */
122 os.state = ns.state = r->state;
125 r->state = ns.state;
146 os.state = ns.state = r->state;
[all...]
/freebsd-11-stable/sys/contrib/ck/src/
H A Dck_barrier_centralized.c33 struct ck_barrier_centralized_state *state,
44 sense = state->sense = ~state->sense;
32 ck_barrier_centralized(struct ck_barrier_centralized *barrier, struct ck_barrier_centralized_state *state, unsigned int n_threads) argument
H A Dck_barrier_dissemination.c80 struct ck_barrier_dissemination_state *state)
83 state->parity = 0;
84 state->sense = ~0;
85 state->tid = ck_pr_faa_uint(&barrier->tid, 1);
98 struct ck_barrier_dissemination_state *state)
106 pflag = barrier[state->tid].flags[state->parity][i].pflag;
107 tflag = &barrier[state->tid].flags[state->parity][i].tflag;
110 ck_pr_store_uint(pflag, state
79 ck_barrier_dissemination_subscribe(struct ck_barrier_dissemination *barrier, struct ck_barrier_dissemination_state *state) argument
97 ck_barrier_dissemination(struct ck_barrier_dissemination *barrier, struct ck_barrier_dissemination_state *state) argument
[all...]
H A Dck_barrier_mcs.c76 ck_barrier_mcs_subscribe(struct ck_barrier_mcs *barrier, struct ck_barrier_mcs_state *state) argument
79 state->sense = ~0;
80 state->vpid = ck_pr_faa_uint(&barrier->tid, 1);
113 struct ck_barrier_mcs_state *state)
120 while (ck_barrier_mcs_check_children(barrier[state->vpid].childnotready) == false)
124 ck_barrier_mcs_reinitialize_children(&barrier[state->vpid]);
127 ck_pr_store_uint(barrier[state->vpid].parent, 0);
130 if (state->vpid != 0) {
131 while (ck_pr_load_uint(&barrier[state->vpid].parentsense) != state
112 ck_barrier_mcs(struct ck_barrier_mcs *barrier, struct ck_barrier_mcs_state *state) argument
[all...]
/freebsd-11-stable/etc/rc.d/
H A Dzvol24 while read state name; do
25 case "${state}" in
37 while read state name; do
38 case "${state}" in
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/sys/
H A Dzcp_prop.h27 int zcp_load_get_lib(lua_State *state);
/freebsd-11-stable/contrib/ldns/compat/
H A Db64_pton.c123 int tarindex, state, ch; local
126 state = 0;
146 switch (state) {
153 state = 1;
164 state = 2;
175 state = 3;
184 state = 0;
198 switch (state) {
238 if (state != 0)
/freebsd-11-stable/lib/libutil/
H A Dproperty.c78 enum { LOOK, COMMENT, NAME, VALUE, MVALUE, COMMIT, FILL, STOP } state, last_state; local
83 state = last_state = LOOK;
84 while (state != STOP) {
85 if (state != COMMIT) {
87 last_state = state;
88 state = FILL;
92 switch(state) {
99 state = STOP;
102 * Restore the state from before the fill (which will be
104 * if we were part-way through eg., a VALUE state, whe
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/
H A Dutf_validate.c284 int state = FSM_START; local
291 state = machine[state][category];
292 if (state == FSM_START)
311 int state = FSM_START; local
322 state = machine[state][category];
324 return state == FSM_START;
332 int state = FSM_START; local
338 switch (state)
[all...]
/freebsd-11-stable/contrib/ntp/lib/isc/
H A Dlfsr.c34 isc_lfsr_init(isc_lfsr_t *lfsr, isc_uint32_t state, unsigned int bits, argument
42 lfsr->state = state;
51 if (lfsr->state == 0)
52 lfsr->state = 0xffffffffU >> (32 - lfsr->bits);
56 * Return the next state of the lfsr.
63 * If the previous state is zero, we must fill it with something
66 * First, give the reseed function a crack at it. If the state is
69 if (lfsr->state == 0) {
72 if (lfsr->state
[all...]

Completed in 288 milliseconds

1234567891011>>