/haiku/3rdparty/os_probe/ |
H A D | 83haiku | 7 # https://bazaar.launchpad.net/~idefix/ubuntu/trusty/os-prober/HaikuPM/files/head:/os-probes/mounted/x86 23 if head -c 512 "$partition" | grep -qs "haiku_loader"; then
|
/haiku/src/add-ons/kernel/drivers/disk/nvme/libnvme/ |
H A D | nvme_internal.h | 52 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ 53 for ((var) = LIST_FIRST((head)); \ 60 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ 61 for ((var) = TAILQ_FIRST((head)); \
|
/haiku/src/system/boot/platform/efi/arch/arm64/ |
H A D | crt0-efi-arm64.S | 19 .section .text.head
|
/haiku/src/add-ons/kernel/drivers/network/wlan/iprowifi4965/dev/iwn/ |
H A D | if_iwn.c | 3037 caddr_t head; local 3063 head = (caddr_t)(mpdu + 1); 3066 head = (caddr_t)(stat + 1) + stat->cfg_phy_len; 3070 flags = le32toh(*(uint32_t *)(head + len)); 3131 m->m_data = head;
|
/haiku/src/libs/compat/freebsd_wlan/net80211/ |
H A D | ieee80211_superg.c | 613 ff_flush(struct mbuf *head, struct mbuf *last) argument 619 for (m = head; m != last; m = next) { 641 struct mbuf *m, *head; local 650 KASSERT(sq->head != NULL, ("stageq empty")); 652 head = sq->head; 653 while ((m = sq->head) != NULL && M_AGE_GET(m) < quanta) { 661 sq->head = m->m_nextpkt; 671 ff_flush(head, m); 684 age -= M_AGE_GET(sq->head); 935 struct mbuf *m, *next_m, *head; local [all...] |
H A D | ieee80211_power.c | 141 if ((m = qhead->head) != NULL) { 142 if ((qhead->head = m->m_nextpkt) == NULL) 191 while ((m = qhead->head) != NULL) { 192 qhead->head = m->m_nextpkt; 222 * so we can check and/or adjust only the head of the list. 243 while ((m = qhead->head) != NULL && 247 if ((qhead->head = m->m_nextpkt) == NULL) 371 qhead->head = m; 379 mh = psq->psq_head[0].head; 383 mh = psq->psq_head[1].head; [all...] |
H A D | ieee80211_ageq.c | 158 * deltas (in seconds) relative to the head so we can check 159 * and/or adjust only the head of the list. If a frame's age 166 struct mbuf *head, **phead; local 169 phead = &head; 186 return head; 199 struct mbuf *head, **phead; local 204 phead = &head; 235 if (head == ohead && aq->aq_head != NULL) /* correct age */ 236 M_AGE_SET(aq->aq_head, M_AGE_GET(head)); 240 return head; [all...] |
H A D | ieee80211_superg.h | 63 struct mbuf *head; /* frames linked w/ m_nextpkt */ member in struct:ieee80211_stageq 65 int depth; /* # items on head */
|
H A D | ieee80211_power.h | 58 struct mbuf *head; member in struct:ieee80211_psq::ieee80211_psq_head
|
/haiku/src/system/boot/platform/riscv/ |
H A D | crt0.S | 16 .section .text.head
|
/haiku/headers/private/runtime_loader/ |
H A D | runtime_loader.h | 164 image_t *head; member in struct:image_queue_t
|
/haiku/src/system/boot/platform/efi/arch/riscv64/ |
H A D | crt0-efi-riscv64.S | 30 .section .text.head
|
/haiku/src/apps/bootmanager/ |
H A D | bootman.S | 60 ; dh - head (0 - 15) 70 ; dh - max head
|
/haiku/src/add-ons/kernel/file_systems/packagefs/nodes/ |
H A D | UnpackingLeafNode.cpp | 129 // add after the head 159 // re-add the newest node to the head 179 PackageLeafNode* head = fPackageNodes.Head(); local 180 return node == head && fPackageNodes.GetNext(head) == NULL; 225 // We keep the old head as fFinalPackageNode, which will make us to behave
|
/haiku/src/system/boot/platform/efi/arch/arm/ |
H A D | crt0-efi-arm.S | 19 .section .text.head
|
/haiku/src/tests/system/kernel/util/ |
H A D | BOpenHashTableTest.cpp | 382 Entry* head = table.Clear(true); local 383 CPPUNIT_ASSERT(head != NULL); 390 while (head != NULL) { 391 Entry* next = head->Next(); 392 delete head; 393 head = next;
|
/haiku/src/kits/debug/ |
H A D | SymbolLookup.cpp | 435 for (const image_t *image = &Read(*Read(fDebugArea->loaded_images->head)); 456 for (const image_t *image = &Read(*Read(fDebugArea->loaded_images->head));
|
/haiku/src/system/libroot/posix/malloc_hoard2/ |
H A D | heap.cpp | 202 superblock *&head = _superblocks[fullness][sizeclass]; local 203 sb->insertBefore(head); 204 head = sb; 205 assert(head->isValid()); 218 superblock *head = NULL; local 222 head = reuse(sizeclass); 223 if (head) { 227 head->getNumBlocks() - head->getNumAvailable(), 228 head 368 superblock *&head = _superblocks[newFullness][sizeclass]; local [all...] |
/haiku/src/kits/mail/ |
H A D | mail_util.cpp | 379 char *head, *tail; local 400 for (head = tail = string; 517 string = *bufp + (string-head); 518 tail = *bufp + (tail-head); 519 charset = *bufp + (charset-head); 520 encoding = *bufp + (encoding-head); 521 end = *bufp + (end-head); 522 src = *bufp + (src-head); 523 head = *bufp; 530 memmove(string+dstLen, end, strLen - (end-head) [all...] |
/haiku/headers/compatibility/bsd/sys/ |
H A D | queue.h | 50 * added to the list after an existing element or at the head of the list. 51 * Elements being removed from the head of the list should use the explicit 58 * head of the list and the other to the tail of the list. The elements are 61 * to the list after an existing element, at the head of the list, or at the 62 * end of the list. Elements being removed from the head of the tail queue 72 * or after an existing element or at the head of the list. A list 75 * A tail queue is headed by a pair of pointers, one to the head of the 79 * after an existing element, at the head of the list, or at the end of 109 /* Store the last 2 places the queue element or head was altered */ 120 #define QMD_TRACE_HEAD(head) d 596 *head = (struct quehead *)b; local [all...] |
/haiku/src/system/kernel/slab/ |
H A D | slab_private.h | 29 _pop(Type*& head) argument 31 Type* oldHead = head; 32 head = head->next; 39 _push(Type*& head, Type* object) argument 41 object->next = head; 42 head = object;
|
/haiku/src/libs/compat/freebsd_network/compat/sys/ |
H A D | queue.h | 45 * added to the list after an existing element or at the head of the list. 46 * Elements being removed from the head of the list should use the explicit 53 * head of the list and the other to the tail of the list. The elements are 56 * to the list after an existing element, at the head of the list, or at the 57 * end of the list. Elements being removed from the head of the tail queue 67 * or after an existing element or at the head of the list. A list 70 * A tail queue is headed by a pair of pointers, one to the head of the 74 * after an existing element, at the head of the list, or at the end of 116 /* Store the last 2 places the queue element or head was altered */ 129 #define QMD_TRACE_HEAD(head) d [all...] |
/haiku/src/libs/compat/freebsd_iflib/ |
H A D | nvpair_impl.h | 51 void nvpair_insert(struct nvl_head *head, nvpair_t *nvp, nvlist_t *nvl); 52 void nvpair_remove(struct nvl_head *head, nvpair_t *nvp, const nvlist_t *nvl);
|
/haiku/src/add-ons/kernel/drivers/network/wlan/iprowifi3945/dev/wpi/ |
H A D | if_wpi.c | 1912 struct wpi_rx_head *head; local 1930 head = (struct wpi_rx_head *)((caddr_t)(stat + 1) + stat->len); 1931 len = le16toh(head->len); 1932 tail = (struct wpi_rx_tail *)((caddr_t)(head + 1) + len); 1938 head->plcp, head->chan, (uintmax_t)le64toh(tail->tstamp)); 1990 m->m_data = (caddr_t)(head + 1); 2018 if (head->flags & htole16(WPI_STAT_FLAG_SHPREAMBLE)) 2023 tap->wr_antenna = (le16toh(head->flags) >> 4) & 0xf; 2024 tap->wr_rate = plcp2rate(head [all...] |
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ |
H A D | if_ath_descdma.h | 35 struct ath_descdma *dd, ath_bufhead *head, const char *name, 38 ath_bufhead *head, const char *name, int ds_size, int nbuf, 41 struct ath_descdma *dd, ath_bufhead *head, const char *name, 44 struct ath_descdma *dd, ath_bufhead *head);
|