/haiku/src/system/kernel/device_manager/ |
H A D | device_manager.cpp | 1478 device_node* before = NULL; local 1482 before = child; 1487 fChildren.InsertBefore(before, node);
|
/haiku/src/system/runtime_loader/ |
H A D | elf.cpp | 351 init_term_function before; local 354 (void**)&before) == B_OK) { 355 before(image->id); 385 init_term_function before; local 388 (void**)&before) == B_OK) { 389 before(image->id);
|
/haiku/src/kits/interface/ |
H A D | ListView.cpp | 1680 // take the item before the wanted one, 1888 BListView::_CalcLastSelected(int32 before) argument 1890 if (before < 0) 1893 before = std::min(CountItems() - 1, before); 1895 for (int32 i = before; i >= 0; i--) { 1928 // remember frames of items before anything happens, 1986 // remember item frames before doing anything
|
H A D | Window.cpp | 520 printf("ERROR - you must Lock a looper before calling Quit(), " 542 BWindow::AddChild(BView* child, BView* before) argument 546 fTopView->AddChild(child, before); 2727 debugger("You need a valid BApplication object before interacting with " 3417 This method is supposed to give a message the last grinding before 3612 /*! Handles keyboard input before it gets forwarded to the target handler. 3713 // check key before doing expensive dynamic_cast 3724 // which is why we have to call it here, before trying to find
|
H A D | View.cpp | 1548 // before we can delete the bitmap 4180 debugger("BeginLineArray must be called before using AddLine"); 4202 debugger("Can't call EndLineArray before BeginLineArray"); 4591 BView::AddChild(BView* child, BView* before) argument 4593 STRACE(("BView(%s)::AddChild(child '%s', before '%s')\n", 4596 before != NULL && before->Name() ? before->Name() : "NULL")); 4598 if (!_AddChild(child, before)) 4616 BView::_AddChild(BView* child, BView* before) argument 6031 _AddChildToList(BView* child, BView* before) argument [all...] |
/haiku/headers/os/interface/ |
H A D | ListView.h | 182 int32 _CalcLastSelected(int32 before);
|
H A D | View.h | 173 void AddChild(BView* child, BView* before = NULL); 748 BView* before = NULL); 751 bool _AddChild(BView *child, BView *before);
|
H A D | Window.h | 112 void AddChild(BView* child, BView* before = NULL);
|
/haiku/src/tests/kits/game/chart/ |
H A D | ChartWindow.cpp | 1338 /* the level is lower than before, we need to erase some bars. */ 2290 bigtime_t before = system_time(); local 2295 w->fSecondThreadDelay = max_c(after-before, 1); 2754 state (before calling the embedded C-engine in ChartRender.c */ 2820 bigtime_t before = system_time(); local 2833 (float)max_c(after - before, 1)) 2860 /* If there was no offscreen before, or if it was too small
|
/haiku/src/system/libnetwork/netresolv/include/isc/ |
H A D | list.h | 90 #define INSERT_BEFORE(list, before, elt, link) \ 93 if ((before)->link.prev == NULL) \ 96 (elt)->link.prev = (before)->link.prev; \ 97 (before)->link.prev = (elt); \ 99 (elt)->link.next = (before); \
|
/haiku/headers/private/kernel/util/ |
H A D | DoublyLinkedQueue.h | 142 inline void InsertBefore(Element *before, Element *element); 194 DOUBLY_LINKED_QUEUE_CLASS_NAME::InsertBefore(Element *before, Element *element) argument 196 if (before == NULL) { 203 Link *beforeLink = sGetLink(before); 206 link->next = before; 212 if (fFirst == before)
|
H A D | DoublyLinkedList.h | 379 inline void Insert(Element* before, Element* element); 429 DOUBLY_LINKED_LIST_CLASS_NAME::InsertBefore(Element* before, Element* element) argument 433 if (before == NULL) { 443 Link* beforeLink = sGetLink(before); 446 link->next = before; 489 DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element* before, Element* element) argument 491 InsertBefore(before, element);
|
/haiku/src/add-ons/kernel/bus_managers/scsi/ |
H A D | queuing.cpp | 56 scsi_ccb *first, *last, *before, *next; local 98 // - if position of first queued request is before current position 99 // and position of new req is before first queued request, add it 117 for( before = last; !before->ordered; ) { 118 before = before->prev; 119 if( before == last ) 123 if( !before->ordered ) { 142 for( before [all...] |
/haiku/src/add-ons/kernel/network/stack/ |
H A D | routes.cpp | 497 net_route_private* before = NULL; local 499 while ((before = iterator.Next()) != NULL) { 500 // if the before mask is less specific than the one of the route, 501 // we can insert it before that route. 502 if (domain->address_module->first_mask_bit(before->mask) 507 && (before->flags & RTF_DEFAULT) != 0) { 510 if (before->interface_address->interface->device->link_speed 516 domain->routes.InsertBefore(before, route);
|
H A D | net_buffer.cpp | 1377 with, after ? "after" : "before")); 1390 data_node* before = NULL; local 1404 if (before == NULL) 1405 before = node; 1440 list_insert_item_before(&buffer->buffers, before, node);
|
/haiku/headers/private/fs_shell/ |
H A D | DoublyLinkedList.h | 366 inline void Insert(Element* before, Element* element); 412 DOUBLY_LINKED_LIST_CLASS_NAME::InsertBefore(Element* before, Element* element) argument 414 if (before == NULL) { 421 Link *beforeLink = sGetLink(before); 424 link->next = before; 430 if (fFirst == before) 462 DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element* before, Element* element) argument 464 InsertBefore(before, element);
|
/haiku/src/system/kernel/util/ |
H A D | list.cpp | 184 /** Inserts an item before another item in the list. 185 * If you pass NULL as \a before item, the item is added at the end of 190 list_insert_item_before(struct list *list, void *before, void *item) argument 195 if (before == NULL) { 200 beforeLink = GET_LINK(list, before); 246 * The target list will be emptied before the items are moved;
|
/haiku/src/add-ons/kernel/file_systems/xfs/ |
H A D | Node.h | 93 uint32 before; member in struct:NodeEntry
|
H A D | Node.cpp | 217 *rightMapOffset = B_BENDIAN_TO_HOST_INT32(entry[i].before);
|
H A D | NodeAttribute.cpp | 279 uint32 logicalBlock = B_BENDIAN_TO_HOST_INT32(nodeEntry->before); 352 uint32 logicalBlock = B_BENDIAN_TO_HOST_INT32(nodeEntry[left].before);
|
H A D | BPlusTree.cpp | 641 return B_BENDIAN_TO_HOST_INT32(entry[i].before);
|
/haiku/src/tools/checkstyle/ |
H A D | utils.py | 94 # splits the string in three parts before, between and after the highlight 109 (before, between, after) = splitByHighlight( \ 111 splittedString.append(before) 115 offset += len(before + between)
|
/haiku/src/add-ons/accelerants/intel_extreme/ |
H A D | mode.cpp | 389 // clear frame buffer before using it 398 // skip, did detection already, might need that before that though 401 // wait for warmup (Can be done anytime before enabling port) 406 // before enabling CPU pipe or port) 414 // 4. If enabling port on PCH: (Must be done before enabling CPU pipe 429 // (Can be done anytime before enabling CPU pipe) 435 // (Can be done anytime before enabling CPU pipe) 457 c. Configure and enable PCH DPLL, wait for PCH DPLL warmup (Can be done anytime before enabling
|
/haiku/src/apps/activitymonitor/ |
H A D | ActivityView.cpp | 781 DataSource* before = fSources.ItemAt(i); local 782 if (DataSource::IndexOf(before) > insert) {
|
/haiku/src/add-ons/kernel/file_systems/nfs4/ |
H A D | ReplyInterpreter.cpp | 191 ReplyInterpreter::Create(uint64* before, uint64* after, bool& atomic) argument 200 *before = fReply->Stream().GetUHyper(); 262 ReplyInterpreter::Link(uint64* before, uint64* after, bool& atomic) argument 271 *before = fReply->Stream().GetUHyper(); 351 uint64 before = fReply->Stream().GetUHyper(); local 355 changeInfo->fBefore = before; 530 ReplyInterpreter::Remove(uint64* before, uint64* after, bool& atomic) argument 539 *before = fReply->Stream().GetUHyper();
|