Searched refs:previous (Results 1 - 25 of 119) sorted by last modified time

12345

/haiku/src/add-ons/kernel/bluetooth/btCoreData/
H A DConnectionInterface.cpp121 || conn->GetDoublyLinkedListLink()->previous != NULL
150 || conn->GetDoublyLinkedListLink()->previous != NULL
/haiku/src/system/kernel/device_manager/
H A Ddevice_manager.cpp175 device_node* previous = NULL);
177 status_t _RegisterDynamic(device_node* previous = NULL);
1826 float& bestSupport, device_node* previous)
1829 bestSupport = previous != NULL ? previous->fSupportsParent : 0.0f;
1834 if (previous != NULL && driver == previous->DriverModule()) {
1903 device_node::_RegisterDynamic(device_node* previous) argument
1924 _FindBestDriver(path.Path(), bestDriver, bestSupport, previous);
1937 if (previous !
1825 _FindBestDriver(const char* path, driver_module_info*& bestDriver, float& bestSupport, device_node* previous) argument
2003 device_node* previous = NULL; local
[all...]
/haiku/src/system/kernel/fs/
H A Dfd.cpp162 int32 previous = atomic_add(&descriptor->ref_count, -1); local
170 if (previous == 1) {
177 && previous - 1 == descriptor->open_count
/haiku/src/apps/deskbar/
H A DSwitcher.cpp119 void Update(int32 previous, int32 current,
182 void Update(int32 previous, int32 current,
868 TSwitchManager::SwitchToApp(int32 previous, int32 current, bool forward) argument
876 fWindow->Update(previous, fCurrentIndex, previousSlot, fCurrentSlot,
1016 // switch to previous app in the list so that we don't jump to
1805 TSwitcherWindow::Update(int32 previous, int32 current, argument
1809 fIconView->Update(previous, current, previousSlot, currentSlot,
1990 TIconView::Update(int32 previous, int32 current, argument
1997 TTeamGroup* previousGroup = (TTeamGroup*)groupList->ItemAt(previous);
/haiku/src/add-ons/kernel/busses/usb/
H A Dxhci.cpp1243 xhci_td *previous = NULL; local
1246 previous = td;
1251 if (previous == NULL) {
1254 previous->next = td->next;
/haiku/src/add-ons/kernel/network/protocols/ipv6/
H A Dipv6.cpp321 net_buffer* previous = NULL; local
323 while ((previous = iterator.Next()) != NULL) {
324 if (previous->fragment.start <= start) {
329 next = previous;
334 if (previous != NULL && previous->fragment.start <= start
335 && previous->fragment.end >= end) {
344 TRACE(" previous: %p, next: %p", previous, next);
348 if (previous !
[all...]
/haiku/src/add-ons/kernel/network/protocols/ipv4/
H A Dipv4.cpp282 net_buffer* previous = NULL; local
284 while ((previous = iterator.Next()) != NULL) {
285 if (previous->fragment.start <= start) {
290 next = previous;
295 if (previous != NULL && previous->fragment.start <= start
296 && previous->fragment.end >= end) {
305 TRACE(" previous: %p, next: %p", previous, next);
309 if (previous !
[all...]
/haiku/src/kits/tracker/
H A DFindPanel.cpp1808 // check to ensure previous item's name differs
1810 BMenuItem* previous = menu->ItemAt(menu->CountItems() - 1); local
1812 if (previous != NULL
1813 && strcasecmp(previous->Label(), info->ShortDescription()) == 0) {
1816 // update the previous item as well
1817 BMimeType type(previous->Message()->GetString("mimetype", NULL));
1820 previous->SetLabel(label.String());
2139 // add logic to previous attrview
2181 // remove the And/Or menu field of the previous row
/haiku/src/add-ons/kernel/network/ppp/ppp/
H A Dppp.cpp161 || device->GetDoublyLinkedListLink()->previous != NULL
/haiku/src/add-ons/kernel/network/devices/ethernet/
H A Dethernet.cpp261 || device->GetDoublyLinkedListLink()->previous != NULL
/haiku/src/servers/app/
H A DWindow.cpp64 // its previous position though if the exposed parts are not
606 return fAnchor[index].previous;
893 \param lastClickTarget The target of the previous click.
910 // If the previous click hit our decorator, get the hit region.
1382 // TODO: disabling needs to be nestable (or we might lose the previous
H A DDesktop.cpp158 // we keep our previous focus alive - this is safe even
220 // switch to previous workspace (command + `)
290 // previous click location is too far from the new one. We can
1566 // Track the region that was drawn in previous update sessions, so we can compute the newly
1856 Window* previous = window->PreviousWindow(i); local
1857 while (previous != NULL) {
1858 if (previous == backmost)
1861 previous = previous->PreviousWindow(i);
1864 if (previous
[all...]
/haiku/src/kits/interface/
H A DTextView.cpp3411 // find the caret position on the previous
3613 // offset of the next line, and go to the previous character
4171 int32 previous; local
4173 previous = _PreviousInitialByte(offset);
4174 if (_CharClassification(previous) != charType)
4176 offset = previous;
4205 // need to look at previous char
4216 int32 previous = _PreviousInitialByte(offset); local
4217 if (_CharClassification(previous) != CHAR_CLASS_DEFAULT)
4219 offset = previous;
[all...]
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DBPlusTree.cpp2477 // Test right link of the previous node
2478 const bplustree_node* previous = cached.SetTo(lastOffset, true); local
2479 if (previous == NULL)
2482 if (previous->RightLink() != childOffset) {
2485 "!\n", fStream->ID(), lastOffset, previous->RightLink(),
/haiku/src/system/kernel/vm/
H A Dvm_page.cpp960 page->queue_link.previous);
/haiku/src/apps/diskprobe/
H A DFindWindow.cpp490 FindWindow::FindWindow(BRect _rect, BMessage& previous, BMessenger& target, argument
498 if (previous.FindInt8("find_mode", &mode) != B_OK && settings != NULL)
521 fTextView->SetData(previous);
532 if (previous.FindBool("case_sensitive", &caseSensitive) != B_OK
/haiku/src/system/kernel/
H A Dsmp.cpp601 uint32 previous = atomic_get_and_set(&lock->lock, 0); local
602 if ((previous & 1u << 31) == 0) {
604 "%#" B_PRIx32 ")\n", lock, previous);
627 uint32 previous = atomic_add(&lock->lock, 1); local
628 return (previous & (1u << 31)) == 0;
666 uint32 previous = atomic_add(&lock->lock, -1); local
667 if ((previous & 1u << 31) != 0) {
669 " %#" B_PRIx32 ")\n", lock, previous);
/haiku/src/system/kernel/debug/
H A Ddebug.cpp888 // Index of the previous command line, if the command returned
910 // the previous command can be repeated
1404 // Allocate memory for the previous session's debug syslog output. In
1453 dprintf("Failed to open previous syslog file: %s\n", strerror(errno));
2235 Thread* previous = sDebuggedThread; local
2237 return previous;
/haiku/src/system/kernel/arch/x86/
H A Darch_debug.cpp34 stack_frame* previous; member in struct:stack_frame
83 *_next = (addr_t)frame.previous;
99 *_next = (addr_t)frame.previous;
750 // switch back to the previous page directory to no cause any troubles
911 // switch back to the previous page directory to not cause any troubles
1051 registers->bp = (addr_t)frame->previous;
/haiku/src/system/kernel/arch/ppc/
H A Darch_debug.cpp22 struct stack_frame *previous; member in struct:stack_frame
74 *next = (addr_t)frame.previous;
246 // switch back to the previous page directory to no cause any troubles
264 registers->r1 = (addr_t)frame->previous;
/haiku/src/system/kernel/arch/m68k/
H A Darch_debug.cpp23 struct stack_frame *previous; member in struct:stack_frame
75 *next = (addr_t)frame.previous;
239 // switch back to the previous page directory to no cause any troubles
/haiku/src/apps/icon-o-matic/shape/
H A DPathManipulator.cpp1258 BPoint previous; local
1267 fPath->GetPointAt(index - 1, previous);
1274 previousOut = scale_point(previous, previousOut, scale);
/haiku/src/system/libroot/posix/malloc_hoard2/
H A Dwrapper.cpp153 struct stack_frame* previous; member in struct:stack_frame
162 frame = frame->previous;
/haiku/headers/private/kernel/util/
H A DDoublyLinkedQueue.h183 elLink->previous = NULL;
186 sGetLink(fFirst)->previous = element;
207 link->previous = beforeLink->previous;
208 if (link->previous != NULL)
209 sGetLink(link->previous)->next = element;
210 beforeLink->previous = element;
241 sGetLink(elLink->previous)->next = elLink->next;
244 sGetLink(elLink->next)->previous = elLink->previous;
[all...]
H A DDoublyLinkedList.h30 Element* previous; member in class:DoublyLinkedListLink
406 elLink->previous = fLast;
415 elLink->previous = NULL;
418 sGetLink(fFirst)->previous = element;
447 link->previous = beforeLink->previous;
448 beforeLink->previous = element;
450 if (link->previous != NULL)
451 sGetLink(link->previous)->next = element;
476 link->previous
[all...]

Completed in 316 milliseconds

12345