/freebsd-11-stable/sys/dev/atkbdc/ |
H A D | atkbdc.c | 73 #define availq(q) ((q)->head != (q)->tail) 75 #define emptyq(q) ((q)->tail = (q)->head = (q)->qcount = 0) 77 #define emptyq(q) ((q)->tail = (q)->head = 0) 295 sc->kbd.head = sc->kbd.tail = 0; 296 sc->aux.head = sc->aux.tail = 0; 416 if (nextq(q->tail) != q->head) { 417 q->q[q->tail] = c; 418 q->tail = nextq(q->tail); 435 if (q->tail ! [all...] |
/freebsd-11-stable/contrib/apr-util/test/ |
H A D | abts.h | 54 sub_suite *tail; member in struct:abts_suite
|
/freebsd-11-stable/contrib/gdb/gdb/gdbserver/ |
H A D | server.h | 68 struct inferior_list_entry *tail; member in struct:inferior_list
|
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/predicates/ |
H A D | tst.predcache.ksh | 42 ctids=$(ps -p $pids -o ctid | tail +2 | sort | uniq)
|
/freebsd-11-stable/contrib/nvi/common/ |
H A D | util.c | 112 * tail -- 113 * Return tail of a path. 115 * PUBLIC: char *tail(char *); 118 tail(char *path) function
|
/freebsd-11-stable/sys/net80211/ |
H A D | ieee80211_superg.h | 62 struct mbuf *tail; /* last frame in queue */ member in struct:ieee80211_stageq
|
/freebsd-11-stable/tools/boot/ |
H A D | install-boot.sh | 27 gpart show $dev | tail +2 | awk '$4 == "'$part'" { print $3; }'
|
/freebsd-11-stable/sys/dev/mlx4/mlx4_ib/ |
H A D | mlx4_ib_srq.c | 150 srq->tail = srq->msrq.max - 1; 307 next = get_wqe(srq, srq->tail); 309 srq->tail = wqe_index; 341 if (unlikely(srq->head == srq->tail)) {
|
/freebsd-11-stable/sys/dev/mlx5/mlx5_ib/ |
H A D | mlx5_ib_cq.c | 193 wc->wr_id = wq->wrid[wq->tail & (wq->wqe_cnt - 1)]; 194 ++wq->tail; 381 u16 tail, u16 head) 386 idx = tail & (qp->sq.wqe_cnt - 1); 391 tail = qp->sq.w_list[idx].next; 393 tail = qp->sq.w_list[idx].next; 394 qp->sq.last_poll = tail; 444 cur = wq->head - wq->tail; 455 wq->tail++; 473 cur = wq->head - wq->tail; 380 handle_atomics(struct mlx5_ib_qp *qp, struct mlx5_cqe64 *cqe64, u16 tail, u16 head) argument [all...] |
/freebsd-11-stable/tools/tools/netmap/ |
H A D | lb.c | 113 uint32_t tail; member in struct:overflow_queue 139 q->slots[q->tail] = *s; 141 q->tail++; 142 if (q->tail >= q->size) 143 q->tail = 0; 500 if (ring->head != ring->tail && (q == NULL || oq_empty(q))) { 791 p->last_tail = nm_ring_next(p->ring, p->ring->tail); 853 * tail moves, so we let cur=tail 855 ring->cur = pending ? ring->tail [all...] |
/freebsd-11-stable/sys/contrib/octeon-sdk/ |
H A D | cvmx-usb.c | 164 cvmx_usb_transaction_t *tail; /**< The last pending transaction */ member in struct:cvmx_usb_pipe 185 cvmx_usb_pipe_t *tail; /**< Tail if the list, or NULL if empty */ member in struct:__anon8788 197 int tail; member in struct:__anon8789 211 cvmx_usb_transaction_t *free_transaction_tail; /**< List of free transactions tail */ 540 * Add a pipe to the tail of a list 547 pipe->prev = list->tail; 548 if (list->tail) 549 list->tail->next = pipe; 552 list->tail = pipe; 571 list->tail [all...] |
/freebsd-11-stable/contrib/elftoolchain/common/ |
H A D | uthash.h | 148 (head)->hh.tbl->tail = &((head)->hh); \ 175 (head)->hh.tbl->tail->next = (add); \ 176 (add)->hh.prev = ELMT_FROM_HH((head)->hh.tbl, (head)->hh.tbl->tail); \ 177 (head)->hh.tbl->tail = &((add)->hh); \ 218 if ((delptr) == ELMT_FROM_HH((head)->hh.tbl,(head)->hh.tbl->tail)) { \ 219 (head)->hh.tbl->tail = \ 774 (head)->hh.tbl->tail = _hs_tail; \ 879 struct UT_hash_handle *tail; /* tail hh in app order, for fast append */ member in struct:UT_hash_table
|
/freebsd-11-stable/contrib/apr-util/dbd/ |
H A D | apr_dbd_sqlite3.c | 183 const char *tail = NULL; local 192 ret = sqlite3_prepare(sql->conn, query, strlen(query), &stmt, &tail); 364 const char *tail = NULL; local 375 ret = sqlite3_prepare(sql->conn, query, length, &stmt, &tail); 384 length -= (tail - query); 385 query = tail; 417 const char *tail = NULL; local 422 ret = sqlite3_prepare(sql->conn, query, strlen(query), &stmt, &tail);
|
/freebsd-11-stable/contrib/apr-util/misc/ |
H A D | apr_thread_pool.c | 783 struct apr_thread_list_elt *head, *tail, *elt; local 805 tail = APR_RING_LAST(thds); 807 APR_RING_UNSPLICE(head, tail, link); 812 for (elt = head; elt != tail; elt = APR_RING_NEXT(elt, link)) { 824 APR_RING_NEXT(tail, link) = NULL; 831 struct apr_thread_list_elt *elt, *head, *tail; local 843 tail = elt; 849 APR_RING_SPLICE_TAIL(me->recycled_thds, head, tail,
|
/freebsd-11-stable/contrib/libucl/uthash/ |
H A D | uthash.h | 148 (head)->hh.tbl->tail = &((head)->hh); \ 185 (head)->hh.tbl->tail->next = (add); \ 186 (add)->hh.prev = ELMT_FROM_HH((head)->hh.tbl, (head)->hh.tbl->tail); \ 187 (head)->hh.tbl->tail = &((add)->hh); \ 228 if ((delptr) == ELMT_FROM_HH((head)->hh.tbl,(head)->hh.tbl->tail)) { \ 229 (head)->hh.tbl->tail = \ 569 (head)->hh.tbl->tail = _hs_tail; \ 680 struct UT_hash_handle *tail; /* tail hh in app order, for fast append */ member in struct:UT_hash_table
|
/freebsd-11-stable/sys/dev/drm/ |
H A D | mach64_state.c | 449 u32 head, tail, ofs; local 456 tail = ring->tail; 463 if (head == tail) { 475 (head < tail && (ofs < head || ofs >= tail)) || 476 (head > tail && (ofs < head && ofs >= tail))) {
|
/freebsd-11-stable/release/picobsd/bridge/ |
H A D | crunch.conf | 97 progs cat tail tee
|
/freebsd-11-stable/release/picobsd/floppy.tree/sbin/ |
H A D | dhclient-script | 215 if [ -f /etc/resolv.conf.tail ]; then 216 cat /etc/resolv.conf.tail >>$tmpres
|
/freebsd-11-stable/release/picobsd/qemu/ |
H A D | crunch.conf | 97 progs cat tail tee
|
/freebsd-11-stable/sbin/dhclient/ |
H A D | dhclient-script | 217 if [ -f /etc/resolv.conf.tail ]; then 218 cat /etc/resolv.conf.tail >>$tmpres
|
/freebsd-11-stable/contrib/ofed/libibnetdisc/ |
H A D | query_smp.c | 62 ibnd_smp_t *tail = engine->smp_queue_tail; local 65 if (tail == head)
|
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/sys/ |
H A D | dsl_dir.h | 128 dsl_dir_t **, const char **tail); 130 const char *tail, void *tag, dsl_dir_t **);
|
/freebsd-11-stable/sys/net/ |
H A D | netmap.h | 68 / | head,cur,tail | 246 * At the software level the important fields are: head, cur, tail. 252 * when 'tail' moves past 'cur' 253 * tail (readonly) first slot reserved to the kernel 255 * [head .. tail-1] can be used for new packets to send; 265 * when 'tail' moves past 'cur' 266 * tail (readonly) first slot reserved to the kernel 268 * [head .. tail-1] contain received packets; 276 * [head .. tail-1] are owned by the user program; 296 uint32_t tail; /* ( member in struct:netmap_ring [all...] |
/freebsd-11-stable/contrib/libpcap/ |
H A D | pcap-dos.c | 1334 struct rx_elem *tail, *head; local 1339 tail = pktq_out_elem (&active_dev->queue); 1343 if (head != tail) 1345 PCAP_ASSERT (tail->size < active_dev->queue.elem_size-4-2); 1347 *buf = &tail->data[0]; 1348 return (tail->size); 1360 struct rx_elem *tail = pktq_out_elem (&active_dev->queue); local 1362 PCAP_ASSERT (&tail->data[0] == buf); 1467 * Increment the queue 'out_index' (tail). 1500 * Return the queue's tail [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | ImmutableList.h | 34 ImmutableListImpl(ElemT &&head, const ImmutableListImpl *tail = nullptr) 35 : Head(std::forward<ElemT>(head)), Tail(tail) {} 137 /// getTail - Returns the tail of the list, which is another (possibly empty)
|