/haiku/src/system/runtime_loader/ |
H A D | elf.cpp | 657 image_t* callerImage = get_loaded_images().head; 766 while ((image = get_disposable_images().head) != NULL) { 1014 image_t* callerImage = get_loaded_images().head; 1033 image_t* image = get_loaded_images().head;
|
H A D | elf_symbol_lookup.cpp | 372 image_t* otherImage = get_loaded_images().head; 443 image_t* otherImage = get_loaded_images().head;
|
H A D | images.cpp | 83 if (!queue->head) 84 queue->head = image; 99 queue->head = image->next; 110 for (image_t* image = queue->head; image; image = image->next) { 445 for (image_t* image = sLoadedImages.head; image != NULL; 540 for (image_t* image = sLoadedImages.head; image; image = image->next) { 545 for (image_t* image = sDisposableImages.head; image; image = image->next) { 616 for (image_t* image = sLoadedImages.head; image; image = image->next) { 624 for (image_t* image = sDisposableImages.head; image; image = image->next) { 636 for (image_t* image = sLoadedImages.head; imag [all...] |
/haiku/src/add-ons/kernel/busses/usb/ |
H A D | ohci.cpp | 1221 // are canceled by setting the head pointer to the tail pointer 1223 // inaccessible and not accessed anymore (as setting the head 1306 // remove the transfer and make the head pointer valid again 1754 // endpoint head pointer might point somewhere into the descriptor chain 1757 // find the head to point to somewhere into the descriptor chain then 1758 // simply advancing the head pointer to the link of the last transfer 1761 // the head pointer. 1767 // This descriptor caused the halt. Advance the head pointer. This 1768 // will either move the head to the next valid transfer that can 1769 // then be restarted, or it will move the head t 1891 ohci_endpoint_descriptor *head = NULL; local [all...] |
/haiku/src/libs/compat/freebsd_iflib/ |
H A D | iflib.c | 443 #define IDXDIFF(head, tail, wrap) \ 444 ((head) >= (tail) ? (head) - (tail) : (wrap) - (tail) + (head)) 613 * XXX need to ensure that this can't accidentally cause the head to be moved backwards 917 * pointer to overrun the head/cons pointer, although this is 1024 u_int const head = kring->rhead; local 1045 * If we have packets to send (nm_i != head) 1063 if (nm_i != head) { /* we have new packets to send */ 1075 for (n = 0; nm_i != head; [all...] |
/haiku/ |
H A D | configure | 811 clangVersion=`$HAIKU_clang -v 2>&1 | head -1 | cut -d " " -f3`
|
/haiku/src/system/kernel/ |
H A D | elf.cpp | 1513 image_t* imageAddress = imageQueue.head;
|
/haiku/src/system/libnetwork/netresolv/net/ |
H A D | getaddrinfo.c | 678 * in the most efficient order. Since the head entry 682 * head entry. (Note that RFC3493 requires the head 769 get_addrselectpolicy(struct policyhead *head) argument 795 free_addrselectpolicy(head); /* make the list empty */ 799 TAILQ_INSERT_TAIL(head, new, pc_entry); 810 free_addrselectpolicy(struct policyhead *head) argument 814 for (ent = TAILQ_FIRST(head); ent; ent = nent) { 816 TAILQ_REMOVE(head, ent, pc_entry); 822 match_addrselectpolicy(struct sockaddr *addr, struct policyhead *head) argument 2024 struct addrinfo head, *t, *p; local [all...] |
/haiku/src/system/libnetwork/netresolv/include/isc/ |
H A D | list.h | 24 #define LIST(type) struct { type *head, *tail; } 26 do { (list).head = NULL; (list).tail = NULL; } while (/*CONSTCOND*/0) 39 #define HEAD(list) ((list).head) 41 #define EMPTY(list) ((list).head == NULL) 46 if ((list).head != NULL) \ 47 (list).head->link.prev = (elt); \ 51 (elt)->link.next = (list).head; \ 52 (list).head = (elt); \ 61 (list).head = (elt); \ 79 INSIST((list).head [all...] |
/haiku/src/libs/bsd/ |
H A D | fts.c | 670 FTSENT *p, *head; local 795 for (head = tail = NULL, nitems = 0; 814 fts_lfree(head); 874 if (head == NULL) 875 head = tail = p; 900 fts_padjust(sp, head); 920 fts_lfree(head); 936 head = fts_sort(sp, head, nitems); 937 return (head); 1043 fts_sort(FTS *sp, FTSENT *head, size_t nitems) argument 1119 fts_lfree(FTSENT *head) argument 1150 fts_padjust(FTS *sp, FTSENT *head) argument [all...] |
/haiku/src/system/boot/platform/bios_ia32/ |
H A D | devices.cpp | 672 // sectors start countint at 1 (unlike head and cylinder) 673 uint32 head = pos / fParameters.sectors_per_track; local 674 uint32 cylinder = head / fParameters.heads; 675 head %= fParameters.heads; 690 regs.edx = fDriveID | (head << 8);
|
/haiku/src/add-ons/kernel/file_cache/ |
H A D | rule_based_prefetcher.cpp | 57 struct head { struct 58 head(); 82 void AddHead(struct head *head); 85 struct head *FindHead(mount_id device, vnode_id node); 245 head::head() function in class:head 417 struct head *head = new ::head; local 466 struct head *head; local 479 AddHead(struct head *head) argument 499 struct head *head = NULL; local 528 struct head *head = NULL; local 544 struct head *head = NULL; local 648 struct head *head = state->rule->FindHead(device, node); local [all...] |
/haiku/src/add-ons/kernel/file_systems/websearchfs/ |
H A D | lists2.c | 12 void *sll_find(long nextoff, void *head, sll_compare_func func, void *id) argument 14 void *p = head; 16 if (head == NULL) 30 status_t sll_insert_head(long nextoff, void **head, void *item) argument 33 if (head == NULL || item == NULL) 35 if (*head) 36 next = *head; 38 *head = item; 42 status_t sll_insert_tail(long nextoff, void **head, void *item) argument 45 if (head 64 sll_dequeue_tail(long nextoff, void **head) argument 80 sll_remove(long nextoff, void **head, void *item) argument [all...] |
H A D | lists2.h | 15 extern void *sll_find(long nextoff, void *head, sll_compare_func func, void *id); 16 extern status_t sll_insert_head(long nextoff, void **head, void *item); 17 extern status_t sll_insert_tail(long nextoff, void **head, void *item); 18 extern void *sll_dequeue_tail(long nextoff, void **head); 19 extern status_t sll_remove(long nextoff, void **head, void *item);
|
H A D | lists.c | 19 struct _slist_entry *slist_find(struct _slist_entry *head, slist_compare_func func, void *id) argument 21 struct _slist_entry *p = head; 22 if (head == NULL) 32 status_t slist_insert_head(struct _slist_entry **head, struct _slist_entry *item) argument 35 if (head == NULL || item == NULL) 37 if (*head) 38 next = *head; 40 *head = item; 44 struct _slist_entry *slist_dequeue_tail(struct _slist_entry **head) argument 48 if (head 60 slist_remove(struct _slist_entry **head, struct _slist_entry *item) argument [all...] |
H A D | lists.h | 20 extern struct _slist_entry *slist_find(struct _slist_entry *head, slist_compare_func func, void *id); 21 extern status_t slist_insert_head(struct _slist_entry **head, struct _slist_entry *item); 22 extern struct _slist_entry *slist_dequeue_tail(struct _slist_entry **head); 23 extern status_t slist_remove(struct _slist_entry **head, struct _slist_entry *item);
|
/haiku/src/add-ons/kernel/file_systems/websearchfs/bin/ |
H A D | imlucky | 2 open `query -v /Web/ '((name=="*'"$*"'*")&&(BEOS:TYPE=="application/x-vnd.Be-bookmark"))' | xargs catattr META:url | head -1`
|
/haiku/src/add-ons/accelerants/nvidia/engine/ |
H A D | nv_general.c | 1549 void set_crtc_owner(bool head) argument 1553 if (!head) 1650 /* enable head 2 on connector 1 */ 1651 /* (b8 = select CRTC (head) for output, 1655 /* enable head 1 on connector 2 */ 1662 /* enable head 1 on connector 1 */ 1664 /* enable head 2 on connector 2 */ 1727 /* enable access to primary head */ 1729 /* unlock head's registers for R/W access */ 1734 /* enable access to secondary head */ [all...] |
/haiku/src/apps/mail/ |
H A D | WIndex.cpp | 174 WIndexHead head; local 177 io->Read(&head, sizeof(head)); 178 io->Seek(head.offset, SEEK_SET); 180 fEntrySize = head.entrySize; 181 fEntries = head.entries; 187 int32 size = (head.entries + 1) * head.entrySize; 203 WIndexHead head; local 205 head [all...] |
/haiku/src/libs/compat/openbsd_wlan/sys/ |
H A D | tree.h | 79 #define SPLAY_ROOT(head) (head)->sph_root 80 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) 83 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ 84 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ 85 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ 86 (head)->sph_root = tmp; \ 89 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ 90 SPLAY_RIGHT((head) [all...] |
/haiku/src/system/libroot/os/ |
H A D | thread.c | 196 callback_node **head = (callback_node **)tls_address(TLS_ON_EXIT_THREAD_SLOT); local 206 node->next = *head; 207 *head = node;
|
/haiku/src/add-ons/accelerants/intel_extreme/ |
H A D | engine.cpp | 122 uint32 head = read32(fRingBuffer.register_base + RING_BUFFER_HEAD) local 125 if (head <= fRingBuffer.position) 126 head += fRingBuffer.size; 128 fRingBuffer.space_left = head - fRingBuffer.position; 132 ERROR("engine stalled, head %" B_PRIx32 "\n", head); 253 uint32 head, tail; local 255 head = read32(ring.register_base + RING_BUFFER_HEAD) 260 if (head == tail) 265 ERROR("engine locked up, head [all...] |
/haiku/src/add-ons/kernel/drivers/network/wlan/realtekwifi/dev/rtwn/usb/ |
H A D | rtwn_usb_attach.c | 238 rtwn_datahead *head, struct ieee80211vap *vap) 246 STAILQ_FOREACH_SAFE(dp, head, next, tmp) { 260 STAILQ_REMOVE(head, dp, rtwn_data, next); 237 rtwn_usb_reset_tx_list(struct rtwn_usb_softc *uc, rtwn_datahead *head, struct ieee80211vap *vap) argument
|
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | security.c | 1447 cache->head.last = index1; 1448 cache->head.p_reads = 0; 1449 cache->head.p_hits = 0; 1450 cache->head.p_writes = 0; 1471 for (index1=0; index1<=pseccache->head.last; index1++) 1558 oldcnt = oldcache->head.last + 1; 1569 for (i=newcache->head.last+1; i<=index1; i++) 1572 newcache->head.last = index1; 1619 && (pcache->head.last >= index1) 1647 pcache->head [all...] |
H A D | compress.c | 94 s16 head[1 << HASH_SHIFT]; member in struct:COMPRESS_CONTEXT 169 cur_match = pctx->head[hash]; 171 pctx->head[hash] = i; 257 pctx->prev[i] = pctx->head[hash]; 258 pctx->head[hash] = i; 302 memset(pctx->head, 0xFF, sizeof(pctx->head));
|