/haiku/src/apps/mail/ |
H A D | MailWindow.cpp | 793 TMailWindow::GetTrackerWindowFile(entry_ref* ref, bool next) const 796 if (next && fNextTrackerPositionSaved) { 800 if (!next && fPrevTrackerPositionSaved) { 808 // Ask the tracker what the next/prev file in the window is. 809 // Continue asking for the next reference until a valid 816 if (next) 1245 // Find the next message that should be displayed 1286 // If the next file was found, open it. If it was not, 1418 // Try next volume, if any
|
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ |
H A D | if_ath.c | 1460 * address and use the next six bits as an index. 1503 * to go out before the next beacon is scheduled. 2441 * frame config alone) until the next beacon, so we can resync 2442 * against the next beacon. 3285 struct mbuf *next; local 3435 * Calculate the "next fragment" length field in ath_buf 3437 * what to next write to the hardware. 3446 * the next size to the following buffer. 3476 next = m->m_nextpkt; 3507 if (next ! [all...] |
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | BPlusTree.cpp | 1531 // of the next node (which can also be the new key to insert). 1756 // rebuild next time... 1945 // Move the duplicate link to the next node 1962 // If the next node is the last node, we need to free that node 2143 // to the next node after the current - if there aren't any 2146 off_t next = node->RightLink() == BPLUSTREE_NULL 2149 ? next : BPLUSTREE_NULL, nodeAndKey.keyIndex, 0 , -1); 2604 // get the next node offset depending on the direction (and if there 2677 // If the node is out of duplicates, we go directly to the next
|
/haiku/src/add-ons/media/media-add-ons/radeon/ |
H A D | TheatreReg.h | 1350 struct rt200_microc_seg* next; member in struct:rt200_microc_seg
|
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ |
H A D | ah.h | 333 * is done after a successful transmission, the next fragment 337 * access procedure is done before the next transmit (i.e. 693 uint8_t controlRate; /* index of next lower basic 829 uint32_t bs_nexttbtt; /* next beacon in TU */ 830 uint32_t bs_nextdtim; /* next DTIM in TU */ 845 uint32_t bs_cfpnext; /* next CFP in TU */ 858 uint32_t bt_nexttbtt; /* next beacon in TU */ 859 uint32_t bt_nextatim; /* next ATIM in TU */ 860 uint32_t bt_nextdba; /* next DBA in 1/8th TU */ 861 uint32_t bt_nextswba; /* next SWB [all...] |
/haiku/src/add-ons/translators/jpeg/ |
H A D | JPEGTranslator.cpp | 1082 marker = marker->next;
|
/haiku/src/tests/system/network/tcp_shell/ |
H A D | tcp_shell.cpp | 308 socket->first_protocol->next = domainProtocol;
|
/haiku/src/add-ons/kernel/network/stack/ |
H A D | net_socket.cpp | 192 for (int i = 0; current != NULL; current = current->next, i++) 1359 // retrieve next iovec buffer from header 1379 // proceed with next buffer, if any
|
/haiku/src/libs/compat/freebsd_wlan/net80211/ |
H A D | ieee80211_output.c | 935 /* XXX next hop */ 1943 struct mbuf *next; local 1949 next = m->m_nextpkt; 1952 } while ((m = next) != NULL);
|
/haiku/src/add-ons/kernel/drivers/network/wlan/broadcom43xx/dev/bwi/ |
H A D | if_bwi.c | 2614 goto next; 2632 goto next; 2668 next:
|
/haiku/src/system/kernel/vm/ |
H A D | vm_page.cpp | 799 mapping = mapping->page_link.next; 961 kprintf("queue_next,prev: %p, %p\n", page->queue_link.next, 988 mapping = mapping->page_link.next; 2566 // Get the next page of the current queue 2669 // Get the next page. Note that we don't bother to lock here. We go with 2765 // get the next page 2894 // get the next page 3452 "the information, so the next command invocation will only show the\n"
|
H A D | vm.cpp | 2627 // so that a copy will be created on next write access. If there are wired 4247 // see if the page after the next allocated paddr run can be allocated 4250 // see if the next page will collide with the next allocated range 4254 // see if the next physical page fits in the memory block 4269 // see if the next page will collide with the next allocated range 4274 // see if the next physical page fits in the memory block 4399 for (image = args->preloaded_images; image != NULL; image = image->next) 5895 // get the next are [all...] |
/haiku/src/add-ons/kernel/drivers/network/wlan/iprowifi4965/dev/iwn/ |
H A D | if_iwn.c | 1629 uint16_t prev, base, next; local 1665 error = iwn_read_prom_data(sc, base, &next, 2); 1668 if (next == 0) /* End of linked-list. */ 1671 base = le16toh(next); 1675 /* Skip "next" word. */ 3537 * Save the relevant statistic counters for the next calibration 3545 /* Save counters values for next call. */ 3923 * next time. 4220 /* Force a complete recalibration on next init. */ 5433 * the next entr [all...] |
/haiku/src/bin/unzip/ |
H A D | unzpriv.h | 1504 struct dirtime *next; /* until can be sorted and set at end */ member in struct:dirtime 1665 the next table, which codes (e & 31) bits, and lastly e == 99 indicates 1674 struct huft *t; /* pointer to next level of table */
|
/haiku/src/add-ons/kernel/file_systems/udf/ |
H A D | UdfStructures.h | 415 EXTENT_TYPE_CONTINUATION, //!< Specifies next extent of descriptors 857 extent_address next; member in struct:descriptor_pointer
|
/haiku/src/servers/app/ |
H A D | Window.cpp | 599 return fAnchor[index].next; 756 // the message to initiate the next update round.
|
/haiku/src/apps/poorman/libhttpd/ |
H A D | libhttpd.c | 1149 /* And cache this user's info for next time. */ 2622 goto next; 2628 next: ;
|
/haiku/src/libs/compat/openbsd_wlan/net80211/ |
H A D | ieee80211_node.c | 205 struct ieee80211_ess *ess, *next; local 207 TAILQ_FOREACH_SAFE(ess, &ic->ic_ess, ess_next, next) { 876 /* Scan the next channel. */ 881 * Switch to the next channel marked for scanning. 1504 * Reset the list of channels to scan and scan the next mode
|
/haiku/src/system/kernel/fs/ |
H A D | vfs.cpp | 161 struct fs_mount* next; member in struct:fs_mount 295 return value->next; 323 return value->next; 992 // ever drop to 0. Deleting the file cache now, will cause the next to last 2155 // walk to find the next path component ("path" will point to a single 2263 // balance the next recursion - we will decrement the 2360 /*! Returns the vnode in the next to last segment of the path, and returns 4411 // goto the next directory
|
/haiku/src/system/boot/platform/amiga_m68k/ |
H A D | rom_calls.h | 1000 struct MemHead *next; member in struct:MemHead
|
/haiku/src/kits/debugger/dwarf/ |
H A D | DwarfFile.cpp | 545 TypeUnitTableEntry* nextEntry = entry->next; 3225 // needed to reach the next 32-bit address boundary, followed
|