/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
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));
|
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...] |
/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/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/kernel/file_systems/websearchfs/ |
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);
|
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);
|
/haiku/src/apps/bootmanager/ |
H A D | bootman.S | 60 ; dh - head (0 - 15) 70 ; dh - max head
|
/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/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/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/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/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/src/libs/compat/freebsd_wlan/net80211/ |
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_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_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...] |
/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/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/system/boot/platform/efi/arch/arm/ |
H A D | crt0-efi-arm.S | 19 .section .text.head
|
/haiku/src/system/boot/platform/efi/arch/arm64/ |
H A D | crt0-efi-arm64.S | 19 .section .text.head
|
/haiku/src/system/boot/platform/efi/arch/riscv64/ |
H A D | crt0-efi-riscv64.S | 30 .section .text.head
|
/haiku/src/system/boot/platform/riscv/ |
H A D | crt0.S | 16 .section .text.head
|
/haiku/src/system/kernel/ |
H A D | elf.cpp | 1513 image_t* imageAddress = imageQueue.head;
|
/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...] |