Searched refs:head (Results 26 - 50 of 82) sorted by relevance

1234

/haiku/src/system/libroot/posix/malloc_hoard2/
H A Dheap.cpp202 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/3rdparty/mmu_man/scripts/
H A Dbebook9 $(query -a '(BEOS:APP_SIG=="application/x-vnd.STertois.BeHappy")' | head -1) &
H A Dbman9 $(query -a '(BEOS:APP_SIG=="application/x-vnd.STertois.BeHappy")' | head -1) &
/haiku/headers/libs/agg/
H A Dagg_arrowhead.h36 void head(double d1, double d2, double d3, double d4) function in class:agg::arrowhead
45 void head() { m_head_flag = true; } function in class:agg::arrowhead
/haiku/src/add-ons/kernel/generic/dpc/
H A Ddpc.c34 int head; member in struct:__anon5
56 dpc = queue->slots[queue->head];
57 queue->head = (queue->head + 1) % queue->size;
69 dpc = queue->slots[queue->head];
70 queue->head = (queue->head + 1) % queue->size;
95 queue->head = queue->tail = 0;
/haiku/src/libs/compat/freebsd_wlan/net80211/
H A Dieee80211_ageq.c158 * 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 Dieee80211_power.c141 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 Dieee80211_power.h58 struct mbuf *head; member in struct:ieee80211_psq::ieee80211_psq_head
H A Dieee80211_superg.c613 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/apps/mail/
H A DWIndex.cpp174 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/add-ons/kernel/file_systems/packagefs/resolvables/
H A DDependencyFamily.h63 Dependency* head = fDependencies.Head(); local
64 return head != NULL ? head->Name() : String();
H A DResolvableFamily.h40 Resolvable* head = fResolvables.Head(); local
41 return head != NULL ? head->Name() : String();
/haiku/src/kits/app/
H A DMessageQueue.cpp189 // remove the head of the queue, if any, and return it
191 BMessage* head = fHead;
192 if (head == NULL)
196 fHead = head->fQueueLink;
205 return head;
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/
H A Dif_ath_descdma.c146 struct ath_descdma *dd, ath_bufhead *head,
239 struct ath_descdma *dd, ath_bufhead *head,
251 error = ath_descdma_alloc_desc(sc, dd, head, name, ds_size,
272 TAILQ_INIT(head);
296 ath_descdma_cleanup(sc, dd, head);
300 TAILQ_INSERT_TAIL(head, bf, bf_list);
328 struct ath_descdma *dd, ath_bufhead *head,
361 TAILQ_INIT(head);
373 ath_descdma_cleanup(sc, dd, head);
376 TAILQ_INSERT_TAIL(head, b
145 ath_descdma_alloc_desc(struct ath_softc *sc, struct ath_descdma *dd, ath_bufhead *head, const char *name, int ds_size, int ndesc) argument
238 ath_descdma_setup(struct ath_softc *sc, struct ath_descdma *dd, ath_bufhead *head, const char *name, int ds_size, int nbuf, int ndesc) argument
327 ath_descdma_setup_rx_edma(struct ath_softc *sc, struct ath_descdma *dd, ath_bufhead *head, const char *name, int nbuf, int rx_status_len) argument
385 ath_descdma_cleanup(struct ath_softc *sc, struct ath_descdma *dd, ath_bufhead *head) argument
[all...]
/haiku/3rdparty/pulkomandy/
H A Dcatmerge.sh24 head -1 $NEW
/haiku/src/kits/support/
H A DJobQueue.cpp164 JobPriorityQueue::iterator head = fQueuedJobs->begin(); local
165 if (head != fQueuedJobs->end()) {
166 if ((*head)->IsRunnable()) {
167 *_job = *head;
168 fQueuedJobs->erase(head);
/haiku/src/add-ons/accelerants/intel_extreme/
H A Dengine.cpp122 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/tests/system/kernel/scheduler/
H A Doverride_types.h47 struct thread *head; member in struct:thread_queue
/haiku/3rdparty/kallisti5/
H A DvalidateRepoFile16 HTTP_STATUS=$(curl -s -I -L "$1" | head -n1 | awk '{ print $2 }')
/haiku/3rdparty/os_probe/
H A D83haiku7 # 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/libs/bsd/
H A Dfts.c670 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/add-ons/kernel/network/stack/
H A Dradix.c180 rn_search(void *v_arg, struct radix_node *head) argument
185 for (x = head, v = v_arg; x->rn_bit >= 0;) {
200 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg) argument
205 for (x = head; x->rn_bit >= 0;) {
272 rn_insert(void *v_arg, struct radix_node_head *head, int *dupentry, argument
276 struct radix_node *top = head->rnh_treetop;
487 rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head) argument
493 x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_offset);
498 x = rn_match(v_arg, head);
508 rn_match(void *v_arg, struct radix_node_head *head) argument
694 rn_addroute(void *v_arg, void *n_arg, struct radix_node_head *head, struct radix_node treenodes[2]) argument
846 rn_delete(void *v_arg, void *netmask_arg, struct radix_node_head *head) argument
1055 rn_inithead(void **head, int off) argument
[all...]
/haiku/src/system/runtime_loader/
H A Dimages.cpp83 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/system/boot/platform/efi/arch/arm/
H A Dcrt0-efi-arm.S19 .section .text.head
/haiku/src/system/boot/platform/efi/arch/riscv64/
H A Dcrt0-efi-riscv64.S30 .section .text.head

Completed in 208 milliseconds

1234