/linux-master/include/linux/ |
H A D | circ_buf.h | 12 int tail; member in struct:circ_buf 16 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1)) 19 as a completely full buffer has head == tail, which is the same as 21 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size)) 24 accessing head and tail more than once, so they can change 26 #define CIRC_CNT_TO_END(head,tail,size) \ 27 ({int end = (size) - (tail); \ 32 #define CIRC_SPACE_TO_END(head,tail,siz [all...] |
H A D | osq_lock.h | 12 * Stores an encoded value of the CPU # of the tail node in the queue. 15 atomic_t tail; member in struct:optimistic_spin_queue 25 atomic_set(&lock->tail, OSQ_UNLOCKED_VAL); 33 return atomic_read(&lock->tail) != OSQ_UNLOCKED_VAL;
|
H A D | objpool.h | 36 * @tail: tail sequence of the local ring array (to append at) 48 * head and tail, typed as uint32_t: [0, 2^32), so only lower bits (mask) 49 * of head and tail are used as the actual position in the ring array. In 55 uint32_t tail; member in struct:objpool_slot 195 uint32_t head, tail; local 197 /* loading tail and head as a local snapshot, tail first */ 198 tail = READ_ONCE(slot->tail); [all...] |
/linux-master/drivers/staging/media/atomisp/pci/hive_isp_css_common/host/ |
H A D | debug_private.h | 30 return (debug_data_ptr->head == debug_data_ptr->tail); 56 if (remote_tail > debug_data_ptr->tail) { 57 size_t delta = remote_tail - debug_data_ptr->tail; 60 debug_data_ptr->tail * sizeof(uint32_t), 61 (void *)&debug_data_ptr->buf[debug_data_ptr->tail], delta * sizeof(uint32_t)); 62 } else if (remote_tail < debug_data_ptr->tail) { 63 size_t delta = DEBUG_BUF_SIZE - debug_data_ptr->tail; 66 debug_data_ptr->tail * sizeof(uint32_t), 67 (void *)&debug_data_ptr->buf[debug_data_ptr->tail], delta * sizeof(uint32_t)); 72 debug_data_ptr->tail [all...] |
H A D | debug.c | 41 debug_data.tail = 0; 49 u32 tail = 0; local 57 &tail, sizeof(uint32_t)); 63 debug_data.tail = 0;
|
/linux-master/tools/lib/ |
H A D | list_sort.c | 18 struct list_head *head, **tail = &head; local 23 *tail = a; 24 tail = &a->next; 27 *tail = b; 31 *tail = b; 32 tail = &b->next; 35 *tail = a; 54 struct list_head *tail = head; local 60 tail->next = a; 61 a->prev = tail; 215 struct list_head **tail = &pending; local [all...] |
/linux-master/arch/arm/kernel/ |
H A D | perf_callchain.c | 31 * next frame tail. 34 user_backtrace(struct frame_tail __user *tail, argument 40 if (!access_ok(tail, sizeof(buftail))) 44 err = __copy_from_user_inatomic(&buftail, tail, sizeof(buftail)); 56 if (tail + 1 >= buftail.fp) 65 struct frame_tail __user *tail; local 72 tail = (struct frame_tail __user *)regs->ARM_fp - 1; 75 tail && !((unsigned long)tail & 0x3)) 76 tail [all...] |
/linux-master/lib/ |
H A D | list_sort.c | 19 struct list_head *head, **tail = &head; local 24 *tail = a; 25 tail = &a->next; 28 *tail = b; 32 *tail = b; 33 tail = &b->next; 36 *tail = a; 55 struct list_head *tail = head; local 61 tail->next = a; 62 a->prev = tail; 216 struct list_head **tail = &pending; local [all...] |
/linux-master/drivers/md/dm-vdo/ |
H A D | murmurhash3.c | 75 /* tail */ 78 const u8 *tail = (const u8 *)(data + nblocks * 16); local 85 k2 ^= ((u64)tail[14]) << 48; 88 k2 ^= ((u64)tail[13]) << 40; 91 k2 ^= ((u64)tail[12]) << 32; 94 k2 ^= ((u64)tail[11]) << 24; 97 k2 ^= ((u64)tail[10]) << 16; 100 k2 ^= ((u64)tail[9]) << 8; 103 k2 ^= ((u64)tail[8]) << 0; 111 k1 ^= ((u64)tail[ [all...] |
/linux-master/include/drm/ |
H A D | spsc_queue.h | 43 atomic_long_t tail; member in struct:spsc_queue 51 atomic_long_set(&queue->tail, (long)&queue->head); 67 struct spsc_node **tail; local 73 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next); 74 WRITE_ONCE(*tail, node); 85 return tail == &queue->head; 107 if (atomic_long_cmpxchg(&queue->tail, 109 /* Updating tail failed wait for new next to appear */
|
/linux-master/drivers/net/wireguard/ |
H A D | queueing.c | 56 queue->head = queue->tail = STUB(queue); 82 struct sk_buff *tail = queue->tail, *next = smp_load_acquire(&NEXT(tail)); local 84 if (tail == STUB(queue)) { 87 queue->tail = next; 88 tail = next; 92 queue->tail = next; 94 return tail; 96 if (tail ! [all...] |
/linux-master/drivers/infiniband/hw/vmw_pvrdma/ |
H A D | pvrdma_ring.h | 54 atomic_t prod_tail; /* Producer tail. */ 89 const __u32 tail = atomic_read(&r->prod_tail); local 92 if (pvrdma_idx_valid(tail, max_elems) && 94 *out_tail = tail & (max_elems - 1); 95 return tail != (head ^ max_elems); 103 const __u32 tail = atomic_read(&r->prod_tail); local 106 if (pvrdma_idx_valid(tail, max_elems) && 109 return tail != head;
|
/linux-master/drivers/gpu/drm/i915/gt/ |
H A D | intel_ring.h | 26 void intel_ring_reset(struct intel_ring *ring, u32 tail); 91 assert_ring_tail_valid(const struct intel_ring *ring, unsigned int tail) argument 95 GEM_BUG_ON(!intel_ring_offset_valid(ring, tail)); 112 GEM_BUG_ON(cacheline(tail) == cacheline(head) && tail < head); 117 intel_ring_set_tail(struct intel_ring *ring, unsigned int tail) 119 /* Whilst writes to the tail are strictly order, there is no 120 * serialisation between readers and the writers. The tail may be 125 assert_ring_tail_valid(ring, tail); 126 ring->tail 131 __intel_ring_space(unsigned int head, unsigned int tail, unsigned int size) argument [all...] |
/linux-master/tools/include/linux/ |
H A D | ring_buffer.h | 32 * READ from the tail WRITE. 69 u64 tail) 71 smp_store_release(&base->data_tail, tail); 68 ring_buffer_write_tail(struct perf_event_mmap_page *base, u64 tail) argument
|
/linux-master/include/net/ |
H A D | esp.h | 15 static inline void esp_output_fill_trailer(u8 *tail, int tfclen, int plen, __u8 proto) argument 19 memset(tail, 0, tfclen); 20 tail += tfclen; 25 tail[i] = i + 1; 27 tail[plen - 2] = plen - 2; 28 tail[plen - 1] = proto;
|
/linux-master/drivers/infiniband/sw/rdmavt/ |
H A D | cq.c | 34 u32 tail; local 42 tail = RDMA_READ_UAPI_ATOMIC(u_wc->tail); 47 tail = k_wc->tail; 61 if (unlikely(next == tail || cq->cq_full)) { 183 * Allocate the completion queue entries and head/tail pointers. 319 RDMA_READ_UAPI_ATOMIC(cq->queue->tail)) 322 if (cq->kqueue->head != cq->kqueue->tail) 341 u32 head, tail, local 482 u32 tail; local [all...] |
H A D | rc.c | 66 u32 tail; local 73 tail = RDMA_READ_UAPI_ATOMIC(qp->r_rq.wq->tail); 76 tail = READ_ONCE(qp->r_rq.kwq->tail); 80 if (tail >= qp->r_rq.size) 81 tail = 0; 88 credits = rvt_get_rq_count(&qp->r_rq, head, tail);
|
/linux-master/tools/testing/selftests/bpf/benchs/ |
H A D | run_common.sh | 62 summary=$(echo $2 | tail -n1) 69 summary=$(echo $2 | tail -n1) 76 summary=$(echo $2 | tail -n1) 83 summary=$(echo $2 | tail -n1) 90 summary=$(echo $2 | tail -n1)
|
/linux-master/include/uapi/rdma/ |
H A D | rvt-abi.h | 24 * This structure is used to contain the head pointer, tail pointer, 32 RDMA_ATOMIC_UAPI(__u32, tail); 51 * This structure is used to contain the head pointer, tail pointer, 63 RDMA_ATOMIC_UAPI(__u32, tail);
|
/linux-master/drivers/rpmsg/ |
H A D | qcom_glink_smem.c | 53 __le32 *tail; member in struct:glink_smem_pipe 70 u32 tail; local 86 tail = le32_to_cpu(*pipe->tail); 88 if (head < tail) 89 return pipe->native.length - tail + head; 91 return head - tail; 99 u32 tail; local 101 tail = le32_to_cpu(*pipe->tail); 118 u32 tail; local 133 u32 tail; local [all...] |
H A D | qcom_glink_rpm.c | 51 void __iomem *tail; member in struct:glink_rpm_pipe 73 unsigned int tail; local 76 tail = readl(pipe->tail); 78 if (head < tail) 79 return pipe->native.length - tail + head; 81 return head - tail; 88 unsigned int tail; local 91 tail = readl(pipe->tail); 112 unsigned int tail; local 127 unsigned int tail; local [all...] |
/linux-master/drivers/net/ethernet/intel/fm10k/ |
H A D | fm10k_mbx.c | 17 fifo->tail = 0; 28 return fifo->tail - fifo->head; 39 return fifo->size + fifo->head - fifo->tail; 50 return fifo->head == fifo->tail; 66 * fm10k_fifo_tail_offset - returns indices of tail with given offset 68 * @offset: offset to add to tail 70 * This function returns the indices into the FIFO based on tail + offset 74 return (fifo->tail + offset) & (fifo->size - 1); 120 fifo->head = fifo->tail; 124 * fm10k_mbx_index_len - Convert a head/tail inde 132 fm10k_mbx_index_len(struct fm10k_mbx_info *mbx, u16 head, u16 tail) argument 153 u16 tail = (mbx->tail + offset + 1) & ((mbx->mbmem_len << 1) - 1); local 169 u16 tail = (mbx->tail - offset - 1) & ((mbx->mbmem_len << 1) - 1); local 216 u32 *tail = mbx->rx.buffer + fm10k_fifo_tail_offset(&mbx->rx, 0); local 240 u32 *tail = fifo->buffer + end; local 336 u16 end, len, tail, mask; local 428 u32 *tail = fifo->buffer; local 471 fm10k_mbx_push_tail(struct fm10k_hw *hw, struct fm10k_mbx_info *mbx, u16 tail) argument 952 u16 type, rsvd0, head, tail, size; local 1198 u16 head, tail; local 1775 u16 tail, head, ver; local 1878 fm10k_sm_mbx_receive(struct fm10k_hw *hw, struct fm10k_mbx_info *mbx, u16 tail) argument 2043 u16 head, tail; local [all...] |
/linux-master/include/crypto/ |
H A D | ctr.h | 40 int tail = 0; local 43 tail = walk.nbytes & (blocksize - 1); 44 nbytes -= tail; 60 err = skcipher_walk_done(&walk, tail);
|
/linux-master/drivers/crypto/hisilicon/ |
H A D | qm_common.h | 28 __le16 tail; member in struct:qm_sqc 43 __le16 tail; member in struct:qm_cqc 57 __le16 tail; member in struct:qm_eqc 67 __le16 tail; member in struct:qm_aeqc
|
/linux-master/tools/testing/selftests/drivers/net/netdevsim/ |
H A D | ethtool-fec.sh | 13 configured=$($ETHTOOL --show-fec $NSIM_NETDEV | tail -2 | head -1 | cut -d' ' -f1) 16 s=$($ETHTOOL --show-fec $NSIM_NETDEV | tail -2) 23 s=$($ETHTOOL --show-fec $NSIM_NETDEV | tail -2) 31 s=$($ETHTOOL --show-fec $NSIM_NETDEV | tail -2) 39 s=$($ETHTOOL --show-fec $NSIM_NETDEV | tail -2) 47 s=$($ETHTOOL --show-fec $NSIM_NETDEV | tail -2) 55 s=$($ETHTOOL --show-fec $NSIM_NETDEV | tail -2) 61 s=$($ETHTOOL --show-fec $NSIM_NETDEV | tail -2)
|