elem             2876 dev/pci/pccbb.c 	struct pccbb_win_chain *chainp, *elem;
elem             2878 dev/pci/pccbb.c 	if ((elem = malloc(sizeof(struct pccbb_win_chain), M_DEVBUF,
elem             2882 dev/pci/pccbb.c 	elem->wc_start = start;
elem             2883 dev/pci/pccbb.c 	elem->wc_end = start + (size - 1);
elem             2884 dev/pci/pccbb.c 	elem->wc_handle = bsh;
elem             2885 dev/pci/pccbb.c 	elem->wc_flags = flags;
elem             2891 dev/pci/pccbb.c 		TAILQ_INSERT_AFTER(head, chainp, elem, wc_list);
elem             2895 dev/pci/pccbb.c 	TAILQ_INSERT_TAIL(head, elem, wc_list);
elem              219 dev/raidframe/rf_cvscan.c rf_CvscanEnqueue(void *q_in, RF_DiskQueueData_t *elem, int priority)
elem              222 dev/raidframe/rf_cvscan.c 	rf_RealEnqueue(hdr, elem /* req */ );
elem               67 dev/raidframe/rf_fifo.c rf_FifoEnqueue(void *q_in, RF_DiskQueueData_t *elem, int priority)
elem               74 dev/raidframe/rf_fifo.c 	elem->next = NULL;
elem               78 dev/raidframe/rf_fifo.c 			q->hq_head = q->hq_tail = elem;
elem               81 dev/raidframe/rf_fifo.c 			q->hq_tail->next = elem;
elem               82 dev/raidframe/rf_fifo.c 			q->hq_tail = elem;
elem               86 dev/raidframe/rf_fifo.c 		RF_ASSERT(elem->next == NULL);
elem               89 dev/raidframe/rf_fifo.c 			    elem->raidPtr->raidid);
elem               93 dev/raidframe/rf_fifo.c 			q->lq_head = q->lq_tail = elem;
elem               96 dev/raidframe/rf_fifo.c 			q->lq_tail->next = elem;
elem               97 dev/raidframe/rf_fifo.c 			q->lq_tail = elem;
elem              101 dev/raidframe/rf_fifo.c 	if ((q->hq_count + q->lq_count) != elem->queue->queueLength) {
elem              103 dev/raidframe/rf_fifo.c 		    q->hq_count, q->lq_count, (int) elem->queue->queueLength);
elem              105 dev/raidframe/rf_fifo.c 		    (int) elem->queue->numOutstanding,
elem              106 dev/raidframe/rf_fifo.c 		    (int) elem->queue->maxOutstanding,
elem              107 dev/raidframe/rf_fifo.c 		    (int) elem->queue->row,
elem              108 dev/raidframe/rf_fifo.c 		    (int) elem->queue->col);
elem              110 dev/raidframe/rf_fifo.c 	RF_ASSERT((q->hq_count + q->lq_count) == elem->queue->queueLength);
elem               50 dev/wscons/wskbdutil.c 	keysym_t elem[2];
elem              197 dev/wscons/wskbdutil.c 	if (i->elem[0] == j->elem[0])
elem              198 dev/wscons/wskbdutil.c 		return(i->elem[1] - j->elem[1]);
elem              200 dev/wscons/wskbdutil.c 		return(i->elem[0] - j->elem[0]);
elem              223 dev/wscons/wskbdutil.c 		if (compose_tab[j + i/2].elem[0] == compose_buf[0]) {
elem              224 dev/wscons/wskbdutil.c 			if (compose_tab[j + i/2].elem[1] == compose_buf[1])
elem              226 dev/wscons/wskbdutil.c 			r = compose_tab[j + i/2].elem[1] < compose_buf[1];
elem              228 dev/wscons/wskbdutil.c 			r = compose_tab[j + i/2].elem[0] < compose_buf[0];
elem               86 kern/kern_timeout.c #define CIRCQ_INIT(elem) do {                   \
elem               87 kern/kern_timeout.c         (elem)->next = (elem);                  \
elem               88 kern/kern_timeout.c         (elem)->prev = (elem);                  \
elem               91 kern/kern_timeout.c #define CIRCQ_INSERT(elem, list) do {           \
elem               92 kern/kern_timeout.c         (elem)->prev = (list)->prev;            \
elem               93 kern/kern_timeout.c         (elem)->next = (list);                  \
elem               94 kern/kern_timeout.c         (list)->prev->next = (elem);            \
elem               95 kern/kern_timeout.c         (list)->prev = (elem);                  \
elem              108 kern/kern_timeout.c #define CIRCQ_REMOVE(elem) do {                 \
elem              109 kern/kern_timeout.c         (elem)->next->prev = (elem)->prev;      \
elem              110 kern/kern_timeout.c         (elem)->prev->next = (elem)->next;      \
elem              111 kern/kern_timeout.c 	_Q_INVALIDATE((elem)->prev);		\
elem              112 kern/kern_timeout.c 	_Q_INVALIDATE((elem)->next);		\
elem              115 kern/kern_timeout.c #define CIRCQ_FIRST(elem) ((elem)->next)
elem              117 kern/kern_timeout.c #define CIRCQ_EMPTY(elem) (CIRCQ_FIRST(elem) == (elem))