Lines Matching refs:state
75 * For each "current state", set bit offsets for valid "next states".
77 * Since there are complicated ways to arrive at state transitions like proxying
78 * and asynchronous destruction etc, so we monitor the state transitions we are
79 * giving the ss user code to ensure we never deliver illegal state transitions
85 /* if we was last in this state... we can legally go to these states */
306 * we can't judge user or transient states, leave the old state
312 /* we don't recognize this state as usable */
313 lwsl_err("%s: %s: bad new state %u\n", __func__, lc->gutag, cs);
319 /* existing state is broken */
320 lwsl_err("%s: %s: bad existing state %u\n", __func__,
332 /* this is explicitly allowed, update old state to new */
355 * we can't judge user or transient states, leave the old state
361 /* we don't recognize this state as usable */
362 lwsl_ss_err(ss, "bad new state %u", cs);
368 /* existing state is broken */
369 lwsl_ss_err(ss, "bad existing state %u",
381 /* this is explicitly allowed, update old state to new */
397 lws_ss_state_name(int state)
399 if (state >= LWSSSCS_USER_BASE)
400 return "user state";
402 if (state >= (int)LWS_ARRAY_SIZE(state_names))
405 return state_names[state];
427 * informed of state changes on the ss connection
434 if (h->info.state) {
436 r = h->info.state(ss_to_userobj(h), NULL, cs,
1789 lws_ss_state_return_t (*state)(void *userobj, void *h_src /* ss handle type */,
1790 lws_ss_constate_t state,
1797 if (state)
1798 h->info.state = state;