Searched refs:tail (Results 1 - 25 of 49) sorted by last modified time

12

/haiku/src/add-ons/kernel/drivers/network/wlan/idualwifi7260/dev/pci/
H A Dif_iwm.c1435 ring->tail = 0;
1538 ring->tail = 0;
2468 ring->tail = idx;
5713 while (ring->tail != idx) {
5714 txd = &ring->data[ring->tail];
5716 iwm_reset_sched(sc, ring->qid, ring->tail, IWM_STATION_ID);
5720 ring->tail = (ring->tail + 1) % IWM_TX_RING_COUNT;
8002 struct iwm_scan_req_umac_tail_v2 *tail; local
8085 tail
[all...]
H A Dif_iwmvar.h281 int tail; member in struct:iwm_tx_ring
/haiku/src/add-ons/kernel/drivers/network/wlan/iaxwifi200/dev/pci/
H A Dif_iwx.c2046 ring->tail = 0;
2165 ring->tail = 0;
5345 txd = &ring->data[ring->tail];
5347 iwx_clear_tx_desc(sc, ring, ring->tail);
5348 iwx_tx_update_byte_tbl(sc, ring, ring->tail, 0, 0);
5352 ring->tail = (ring->tail + 1) % IWX_TX_RING_COUNT;
11280 * some dummy TR/CR tail pointers - which shouldn't be
H A Dif_iwxvar.h251 int tail; member in struct:iwx_tx_ring
/haiku/src/add-ons/kernel/busses/usb/
H A Dohci.cpp1025 // the current tail will become the first descriptor
1081 // the current tail will become the first descriptor
1221 // are canceled by setting the head pointer to the tail pointer
1666 // fill in the information of the first descriptor into the current tail
1667 ohci_general_td *tail = (ohci_general_td *)endpoint->tail_logical_descriptor; local
1668 tail->flags = first->flags;
1669 tail->buffer_physical = first->buffer_physical;
1670 tail->next_physical_descriptor = first->next_physical_descriptor;
1671 tail->last_physical_byte_address = first->last_physical_byte_address;
1672 tail
1707 ohci_isochronous_td *tail local
1913 ohci_isochronous_td *tail = _CreateIsochronousDescriptor(0); local
1919 ohci_general_td *tail = _CreateGeneralDescriptor(0); local
[all...]
/haiku/src/libs/compat/freebsd_iflib/
H A Diflib.c443 #define IDXDIFF(head, tail, wrap) \
444 ((head) >= (tail) ? (head) - (tail) : (wrap) - (tail) + (head))
916 * (fl->ifl_pidx - 1) % N (included), to avoid the NIC tail/prod
/haiku/src/system/libroot/posix/musl/string/
H A Dstpncpy.c19 if (!n || !*s) goto tail;
27 tail:
/haiku/src/system/kernel/vm/
H A Dvm_page.cpp1054 kprintf("queue = %p, queue->head = %p, queue->tail = %p, queue->count = %"
4048 /*! Moves a page to either the tail of the head of its current queue,
4049 depending on \a tail.
4053 vm_page_requeue(struct vm_page *page, bool tail) argument
4093 queue->RequeueUnlocked(page, tail);
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DDirectoryIterator.cpp914 ext2_htree_tail* tail = _HTreeEntryTail(block, offset); local
915 tail->reserved = 0x0;
916 tail->checksum = _HTreeRootChecksum(block, offset, count);
H A DInode.cpp1005 ext2_dir_entry_tail* tail = _DirEntryTail(block); local
1006 tail->twelve = 12;
1007 tail->hexade = 0xde;
1008 tail->checksum = _DirEntryChecksum(block, id, gen);
1048 struct ext2_extent_tail *tail = (struct ext2_extent_tail *) local
1050 tail->checksum = checksum;
1060 struct ext2_extent_tail *tail = (struct ext2_extent_tail *) local
1062 return tail->checksum == checksum;
/haiku/src/system/libnetwork/netresolv/include/isc/
H A Dlist.h24 #define LIST(type) struct { type *head, *tail; }
26 do { (list).head = NULL; (list).tail = NULL; } while (/*CONSTCOND*/0)
40 #define TAIL(list) ((list).tail)
49 (list).tail = (elt); \
58 if ((list).tail != NULL) \
59 (list).tail->link.next = (elt); \
62 (elt)->link.prev = (list).tail; \
64 (list).tail = (elt); \
73 INSIST((list).tail == (elt)); \
74 (list).tail
[all...]
/haiku/headers/private/kernel/util/
H A DDoublyLinkedList.h657 Element* tail = Head(); local
658 while (tail != NULL) {
659 Element* leastElement = tail;
660 Element* element = tail;
666 if (leastElement != tail) {
668 InsertBefore(tail, leastElement);
670 tail = GetNext(tail);
/haiku/src/libs/bsd/
H A Dfts.c671 FTSENT *cur, *tail; local
795 for (head = tail = NULL, nitems = 0;
875 head = tail = p;
877 tail->fts_link = p;
878 tail = p;
/haiku/src/system/kernel/arch/riscv64/
H A Darch_asm.S146 tail SVecURet
/haiku/src/add-ons/kernel/file_systems/xfs/
H A DExtent.h168 ExtentLeafEntry* BlockFirstLeaf(ExtentBlockTail* tail);
H A DExtent.cpp117 Extent::BlockFirstLeaf(ExtentBlockTail* tail) argument
119 return (ExtentLeafEntry*)tail - B_BENDIAN_TO_HOST_INT32(tail->count);
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Drunlist.c254 /* Move the tail of @dst out of the way, then copy in @src. */
341 /* Move the tail of @dst out of the way, then copy in @src. */
391 int tail; /* Start of tail of @dst */ local
428 * tail - Offset of the tail of @dst
429 * Nominally: @tail = @loc + 1 (location, skipping the replaced run)
432 tail = loc + right + 1;
441 /* Move the tail of @dst out of the way, then copy in @src. */
442 ntfs_rl_mm(dst, marker, tail, dsiz
[all...]
/haiku/src/add-ons/kernel/file_systems/websearchfs/
H A Dattr2c8 /bin/catattr "$1" "$2" | tail +2 | cut -c 10-57 | sed 's/,/, 0x/g;s/ / 0x/;s/ *//;s/$/,/'
10 #catattr "$1" "$2" | tail +2 | cut -c 10-57 | sed 's/,/, 0x/g;s/ / 0x/;s/ *//;s/$/,/'
/haiku/src/add-ons/accelerants/intel_extreme/
H A Dengine.cpp50 // benaphore does), but it must happen before writing the new tail...
253 uint32 head, tail; local
257 tail = read32(ring.register_base + RING_BUFFER_TAIL)
260 if (head == tail)
/haiku/src/system/runtime_loader/
H A Dimages.cpp78 image->prev = queue->tail;
79 if (queue->tail)
80 queue->tail->next = image;
82 queue->tail = image;
94 queue->tail = image->prev;
/haiku/src/system/libroot/posix/arch/riscv64/
H A Dsigsetjmp.S29 tail __setjmp_save_sigs
37 tail sigsetjmp
H A Dsiglongjmp.S31 tail __longjmp_return
/haiku/src/libs/compat/freebsd_wlan/net80211/
H A Dieee80211_superg.c665 sq->tail = NULL;
682 if (sq->tail != NULL) {
683 sq->tail->m_nextpkt = m;
694 sq->tail = m;
712 if (sq->tail == m)
713 sq->tail = mprev;
H A Dieee80211_power.c143 qhead->tail = NULL;
195 qhead->tail = NULL;
248 qhead->tail = NULL;
368 if (qhead->tail == NULL) {
391 qhead->tail->m_nextpkt = m;
397 qhead->tail = m;
437 qhead->head = qhead->tail = NULL;
446 qhead->head = qhead->tail = NULL;
/haiku/headers/private/runtime_loader/
H A Druntime_loader.h165 image_t *tail; member in struct:image_queue_t

Completed in 290 milliseconds

12