Searched refs:head (Results 76 - 82 of 82) sorted by path

1234

/haiku/src/system/libnetwork/netresolv/net/
H A Dgetaddrinfo.c678 * 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/libroot/os/
H A Dthread.c196 callback_node **head = (callback_node **)tls_address(TLS_ON_EXIT_THREAD_SLOT); local
206 node->next = *head;
207 *head = node;
/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/src/system/runtime_loader/
H A Delf.cpp657 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 Delf_symbol_lookup.cpp372 image_t* otherImage = get_loaded_images().head;
443 image_t* otherImage = get_loaded_images().head;
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/tests/system/kernel/util/
H A DBOpenHashTableTest.cpp382 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;

Completed in 110 milliseconds

1234