| /haiku/src/system/kernel/ |
| H A D | heap.cpp | 1132 heap_area *previous = heap->all_areas; local
1133 while (previous) {
1134 if (previous->all_next == area) {
1135 previous->all_next = area->all_next;
1139 previous = previous->all_next;
1142 if (previous == NULL)
|
| /haiku/src/bin/unzip/ |
| H A D | unzip.c | 77 struct _sign_info *previous; member in struct:_sign_info
1001 oldsighandlers = thissigsav->previous;
1044 savsig->previous = *p_savedhandler_chain;
|
| /haiku/src/system/kernel/device_manager/ |
| H A D | IORequest.cpp | 1169 IORequest::NextSubRequest(IORequest* previous) argument
1171 if (previous == NULL)
1173 return dynamic_cast<IORequest*>(fChildren.GetNext(previous));
|
| /haiku/src/apps/icon-o-matic/shape/ |
| H A D | PathManipulator.cpp | 1258 BPoint previous; local
1267 fPath->GetPointAt(index - 1, previous);
1274 previousOut = scale_point(previous, previousOut, scale);
|
| /haiku/src/add-ons/kernel/network/devices/ethernet/ |
| H A D | ethernet.cpp | 261 || device->GetDoublyLinkedListLink()->previous != NULL
|
| /haiku/src/system/kernel/cache/ |
| H A D | block_cache.cpp | 107 // There can only be one previous transaction, so when the active
108 // transaction ends, the changes of the previous transaction have to
109 // be written back before that transaction becomes the next previous
385 " (previous id %" B_PRId32 ")\n", fCache, _Action(), fBlockNumber,
1060 part of a previous transacton.
1180 // This block was already part of a previous transaction within this
1269 // We first need to write back changes from previous transactions
1318 cache_transaction* previous = block->previous_transaction; local
1319 if (previous != NULL) {
1320 previous
[all...] |
| /haiku/headers/cpp/ |
| H A D | stl_slist.h | 449 iterator previous(const_iterator __pos) { function in class:slist
452 const_iterator previous(const_iterator __pos) const { function in class:slist
|
| /haiku/src/add-ons/kernel/file_systems/nfs/ |
| H A D | nfs_add_on.c | 789 fs_node *previous; local
794 previous = NULL;
797 previous = current;
802 if (previous)
803 previous->next = current->next;
|
| /haiku/src/kits/tracker/ |
| H A D | FindPanel.cpp | 1808 // 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/kits/interface/ |
| H A D | TextView.cpp | 3411 // 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/tests/system/kernel/slab/ |
| H A D | Slab.h | 488 Magazine *loaded, *previous; member in struct:BaseDepot::CPUStore
|
| /haiku/src/add-ons/kernel/file_systems/bfs/ |
| H A D | BPlusTree.cpp | 2477 // 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/apps/diskprobe/ |
| H A D | DataView.cpp | 936 bool previous = IsFocus(); local
939 if (focus == previous)
|
| /haiku/src/servers/app/ |
| H A D | Desktop.cpp | 158 // 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...] |
| H A D | Window.cpp | 64 // 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
|
| /haiku/src/add-ons/kernel/network/stack/ |
| H A D | net_buffer.cpp | 1597 data_node* previous = node; local
1601 list_insert_item_before(&buffer->buffers, previous, node);
|
| /haiku/src/system/kernel/debug/ |
| H A D | debug.cpp | 888 // 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/add-ons/kernel/busses/usb/ |
| H A D | xhci.cpp | 1243 xhci_td *previous = NULL; local
1246 previous = td;
1251 if (previous == NULL) {
1254 previous->next = td->next;
|
| /haiku/src/system/kernel/vm/ |
| H A D | vm_page.cpp | 960 page->queue_link.previous);
|