Searched refs:tail (Results 1 - 25 of 372) sorted by relevance

1234567891011>>

/drivers/staging/unisys/channels/
H A Dchannel.c50 unsigned int head, tail, nof; local
57 /* capture current head and tail */
59 tail = readl(&pqhdr->Tail);
61 /* queue is full if (head + 1) % n equals tail */
62 if (((head + 1) % readl(&pqhdr->MaxSignalSlots)) == tail) {
108 unsigned int head, tail; local
113 /* capture current head and tail */
115 tail = readl(&pqhdr->Tail);
117 /* queue is empty if the head index equals the tail index */
118 if (head == tail) {
163 unsigned int head, tail, signalCount = 0; local
[all...]
/drivers/staging/android/fiq_debugger/
H A Dfiq_debugger_ringbuf.h24 int tail; member in struct:fiq_debugger_ringbuf
39 rbuf->tail = 0;
52 int level = rbuf->head - rbuf->tail;
68 return rbuf->buf[(rbuf->tail + i) % rbuf->len];
76 rbuf->tail = (rbuf->tail + count) % rbuf->len;
H A Dfiq_debugger_arm.c179 struct frame_tail *tail)
184 if (!access_ok(VERIFY_READ, tail, sizeof(buftail))) {
186 tail);
189 if (__copy_from_user_inatomic(buftail, tail, sizeof(buftail))) {
191 " failed to copy frame pointer %p\n", tail);
199 if (tail >= buftail[0].fp)
208 struct frame_tail *tail; local
237 tail = ((struct frame_tail *) regs->ARM_fp) - 1;
238 while (depth-- && tail && !((unsigned long) tail
178 user_backtrace(struct fiq_debugger_output *output, struct frame_tail *tail) argument
[all...]
/drivers/staging/unisys/visorutil/
H A Dcharqueue.c26 #define IS_EMPTY(charqueue) (charqueue->head == charqueue->tail)
34 int head, tail; member in struct:CHARQUEUE_Tag
52 cq->head = cq->tail = 0;
66 if (charqueue->head == charqueue->tail)
68 charqueue->tail = (charqueue->tail+1) % alloc_slots;
95 charqueue->tail = (charqueue->tail+1) % alloc_slots;
96 return charqueue->buf[charqueue->tail];
/drivers/net/ethernet/intel/fm10k/
H A Dfm10k_mbx.c34 fifo->tail = 0;
45 return fifo->tail - fifo->head;
56 return fifo->size + fifo->head - fifo->tail;
67 return fifo->head == fifo->tail;
83 * fm10k_fifo_tail_offset - returns indices of tail with given offset
85 * @offset: offset to add to tail
87 * This function returns the indicies into the fifo based on tail + offset
91 return (fifo->tail + offset) & (fifo->size - 1);
129 * fm10k_mbx_index_len - Convert a head/tail index into a length value
132 * @tail
137 fm10k_mbx_index_len(struct fm10k_mbx_info *mbx, u16 head, u16 tail) argument
158 u16 tail = (mbx->tail + offset + 1) & ((mbx->mbmem_len << 1) - 1); local
174 u16 tail = (mbx->tail - offset - 1) & ((mbx->mbmem_len << 1) - 1); local
221 u32 *tail = mbx->rx.buffer + fm10k_fifo_tail_offset(&mbx->rx, 0); local
245 u32 *tail = fifo->buffer + end; local
340 u16 end, len, tail, mask; local
430 u32 *tail = fifo->buffer; local
471 fm10k_mbx_push_tail(struct fm10k_hw *hw, struct fm10k_mbx_info *mbx, u16 tail) argument
932 u16 type, rsvd0, head, tail, size; local
1155 u16 head, tail; local
1197 u16 head, tail; local
1734 u16 tail, head, ver; local
1836 fm10k_sm_mbx_receive(struct fm10k_hw *hw, struct fm10k_mbx_info *mbx, u16 tail) argument
1993 u16 head, tail; local
[all...]
/drivers/infiniband/hw/ipath/
H A Dipath_cq.c68 if (unlikely(next == wc->tail)) {
135 u32 tail; local
146 tail = wc->tail;
147 if (tail > (u32) cq->ibcq.cqe)
148 tail = (u32) cq->ibcq.cqe;
150 if (tail == wc->head)
153 *entry = wc->kqueue[tail];
154 if (tail >= cq->ibcq.cqe)
155 tail
376 u32 head, tail, n; local
[all...]
H A Dipath_srq.c72 if (next == wq->tail) {
176 srq->rq.wq->tail = 0;
226 u32 sz, size, n, head, tail; local
271 tail = owq->tail;
272 if (tail >= srq->rq.size)
273 tail = 0;
275 if (n < tail)
276 n += srq->rq.size - tail;
278 n -= tail;
[all...]
/drivers/infiniband/hw/qib/
H A Dqib_cq.c71 if (unlikely(next == wc->tail)) {
142 u32 tail; local
153 tail = wc->tail;
154 if (tail > (u32) cq->ibcq.cqe)
155 tail = (u32) cq->ibcq.cqe;
157 if (tail == wc->head)
160 *entry = wc->kqueue[tail];
161 if (tail >= cq->ibcq.cqe)
162 tail
392 u32 head, tail, n; local
[all...]
H A Dqib_srq.c72 if (next == wq->tail) {
172 srq->rq.wq->tail = 0;
222 u32 sz, size, n, head, tail; local
260 * validate head and tail pointer values and compute
265 tail = owq->tail;
266 if (head >= srq->rq.size || tail >= srq->rq.size) {
271 if (n < tail)
272 n += srq->rq.size - tail;
274 n -= tail;
[all...]
/drivers/gpu/drm/i915/
H A Dintel_lrc.h42 * intel_logical_ring_advance() - advance the ringbuffer tail
45 * The tail is only updated in our logical ringbuffer struct.
49 ringbuf->tail &= ringbuf->size - 1;
59 iowrite32(data, ringbuf->virtual_start + ringbuf->tail);
60 ringbuf->tail += 4;
86 * @tail: how far in the context's ringbuffer this request goes to.
91 * The ELSP only accepts two elements at a time, so we queue context/tail
104 u32 tail; member in struct:intel_ctx_submit_request
/drivers/input/joystick/iforce/
H A Diforce-serio.c44 if (iforce->xmit.head == iforce->xmit.tail) {
54 serio_write(iforce->serio, iforce->xmit.buf[iforce->xmit.tail]);
55 cs ^= iforce->xmit.buf[iforce->xmit.tail];
56 XMIT_INC(iforce->xmit.tail, 1);
58 for (i=iforce->xmit.buf[iforce->xmit.tail]; i >= 0; --i) {
59 serio_write(iforce->serio, iforce->xmit.buf[iforce->xmit.tail]);
60 cs ^= iforce->xmit.buf[iforce->xmit.tail];
61 XMIT_INC(iforce->xmit.tail, 1);
H A Diforce-usb.c37 if (iforce->xmit.head == iforce->xmit.tail) {
43 ((char *)iforce->out->transfer_buffer)[0] = iforce->xmit.buf[iforce->xmit.tail];
44 XMIT_INC(iforce->xmit.tail, 1);
45 n = iforce->xmit.buf[iforce->xmit.tail];
46 XMIT_INC(iforce->xmit.tail, 1);
52 c = CIRC_CNT_TO_END(iforce->xmit.head, iforce->xmit.tail, XMIT_SIZE);
56 &iforce->xmit.buf[iforce->xmit.tail],
63 XMIT_INC(iforce->xmit.tail, n);
/drivers/staging/rtl8188eu/include/
H A Drtw_event.h102 int tail; member in struct:c2hevent_queue
111 int tail; member in struct:network_queue
/drivers/staging/rtl8712/
H A Drtl871x_event.h99 /*volatile*/ int tail; member in struct:c2hevent_queue
108 /*volatile*/ int tail; member in struct:network_queue
/drivers/scsi/bfa/
H A Dbfa_cs.h67 u32 tail; member in struct:bfa_trc_mod_s
100 trcm->head = trcm->tail = trcm->stopped = 0;
113 int tail = trcm->tail; local
114 struct bfa_trc_s *trc = &trcm->trc[tail];
124 trcm->tail = (trcm->tail + 1) & (BFA_TRC_MAX - 1);
125 if (trcm->tail == trcm->head)
133 int tail = trcm->tail; local
[all...]
/drivers/crypto/caam/
H A Djr.c165 int hw_idx, sw_idx, i, head, tail; local
178 sw_idx = tail = jrp->tail;
181 for (i = 0; CIRC_CNT(head, tail + i, JOBR_DEPTH) >= 1; i++) {
182 sw_idx = (tail + i) & (JOBR_DEPTH - 1);
191 BUG_ON(CIRC_CNT(head, tail + i, JOBR_DEPTH) <= 0);
215 * the tail. Otherwise, increment tail by 1 plus the
218 if (sw_idx == tail) {
220 tail
326 int head, tail, desc_size; local
[all...]
/drivers/of/
H A Dpdt.c140 struct property *head, *tail; local
142 head = tail = of_pdt_build_one_prop(node, NULL,
145 tail->next = of_pdt_build_one_prop(node, NULL, NULL, NULL, 0);
146 tail = tail->next;
147 while(tail) {
148 tail->next = of_pdt_build_one_prop(node, tail->name,
150 tail = tail
[all...]
/drivers/tty/
H A Dbfin_jtag_comm.c58 #define circ_empty(circ) ((circ)->head == (circ)->tail)
59 #define circ_free(circ) CIRC_SPACE((circ)->head, (circ)->tail, CIRC_SIZE)
60 #define circ_cnt(circ) CIRC_CNT((circ)->head, (circ)->tail, CIRC_SIZE)
86 inbound_len, bfin_jc_write_buf.tail, bfin_jc_write_buf.head);
117 int tail = bfin_jc_write_buf.tail; local
121 circ_byte(&bfin_jc_write_buf, tail + 0),
122 circ_byte(&bfin_jc_write_buf, tail + 1),
123 circ_byte(&bfin_jc_write_buf, tail + 2),
124 circ_byte(&bfin_jc_write_buf, tail
[all...]
H A Dn_tty.c658 size_t tail; local
663 tail = ldata->echo_tail;
664 while (ldata->echo_commit != tail) {
665 c = echo_buf(ldata, tail);
675 op = echo_buf(ldata, tail + 1);
681 num_chars = echo_buf(ldata, tail + 2);
707 tail += 3;
712 tail += 2;
718 tail += 2;
730 tail
1069 size_t tail = ldata->read_head; local
1333 size_t tail = ldata->canon_head; local
1939 size_t tail = ldata->read_tail & (N_TTY_BUF_SIZE - 1); local
1990 size_t tail; local
2444 size_t nr, head, tail; local
[all...]
/drivers/s390/block/
H A Ddasd_eer.c91 int tail; member in struct:eerbuffer
105 if (eerb->head < eerb->tail)
106 return eerb->tail - eerb->head - 1;
107 return eerb->buffersize - eerb->head + eerb->tail -1;
117 if (eerb->head >= eerb->tail)
118 return eerb->head - eerb->tail;
119 return eerb->buffersize - eerb->tail + eerb->head;
166 tailindex = eerb->tail / PAGE_SIZE;
167 localtail = eerb->tail % PAGE_SIZE;
172 eerb->tail
[all...]
/drivers/ptp/
H A Dptp_private.h37 int tail; member in struct:timestamp_event_queue
63 * that a writer might concurrently increment the tail does not
68 int cnt = q->tail - q->head;
/drivers/staging/lustre/lustre/obdclass/
H A Dllog_swab.c131 struct llog_rec_tail *tail = NULL; local
146 tail = &lsc->lsc_tail;
156 tail = &lur->lur_tail;
166 tail = &lur->lur_tail;
187 tail = &ext->cr_tail;
189 tail = &cr->cr_tail;
200 tail = &cur->cur_tail;
231 tail = &lsr->lsr_tail;
247 tail = &llh->llh_tail;
255 tail
[all...]
/drivers/gpu/drm/mga/
H A Dmga_dma.c84 primary->tail = 0;
106 u32 head, tail; local
120 if (primary->tail == primary->last_flush) {
125 tail = primary->tail + dev_priv->primary->offset;
139 primary->last_flush = primary->tail;
143 if (head <= tail)
144 primary->space = primary->size - primary->tail;
146 primary->space = head - tail;
149 DRM_DEBUG(" tail
161 u32 head, tail; local
327 drm_mga_freelist_t *tail = dev_priv->tail; local
[all...]
/drivers/tty/serial/jsm/
H A Djsm_tty.c521 u16 tail; local
551 tail = ch->ch_r_tail & rmask;
553 data_len = (head - tail) & rmask;
571 ch->ch_r_head = tail;
586 "Port %d throttled, not reading any data. head: %x tail: %x\n",
587 ch->ch_portnum, head, tail);
602 s = ((head >= tail) ? head : RQUEUESIZE) - tail;
621 if (*(ch->ch_equeue +tail +i) & UART_LSR_BI)
622 tty_insert_flip_char(port, *(ch->ch_rqueue +tail
[all...]
/drivers/tty/serial/
H A Dsn_console.c530 int xmit_count, tail, head, loops, ii; local
558 tail = xmit->tail;
559 start = &xmit->buf[tail];
561 /* twice around gets the tail to the end of the buffer and
563 loops = (head < tail) ? 2 : 1;
566 xmit_count = (head < tail) ?
567 (UART_XMIT_SIZE - tail) : (head - tail);
584 tail
[all...]

Completed in 2476 milliseconds

1234567891011>>