user_entry
TAILQ_FOREACH(span, &sc->spanq, user_entry) {
TAILQ_INSERT_TAIL(&sc->spanq, msg->state, user_entry);
TAILQ_INSERT_TAIL(&sc->spanq, msg->state, user_entry);
TAILQ_REMOVE(&sc->spanq, msg->state, user_entry);
TAILQ_FOREACH(trans, &sc->spanq, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_INSERT_TAIL(&jreclist->list, jrec, user_entry);
TAILQ_FOREACH(jrec, &jreclist->list, user_entry) {
TAILQ_REMOVE(&jreclist->list, jrec, user_entry);
TAILQ_FOREACH(jrec, &jreclist->list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_FOREACH(jrec, &jreclist.list, user_entry) {
TAILQ_ENTRY(kdmsg_state) user_entry; /* available to devices */
TAILQ_ENTRY(jrecord) user_entry;
struct user_entry *up, *aup;
(int)sizeof(((struct user_entry *)0)->user), user,
struct user_entry *lp;
struct user_entry *up;
SLIST_ENTRY(user_entry) next;
static SLIST_HEAD(, user_entry) Users = SLIST_HEAD_INITIALIZER(Users);