/haiku/headers/private/file_systems/ |
H A D | QueryParser.h | 426 // first character of the equation symbol 453 // lets change "start" to point to the first character after the symbol 481 // at this point, "start" will point to the first character of the value, 482 // "end" will point to its last character, and "start" to the first non- 719 // first, check if we are matching for a live query and use that value 1027 Term<QueryPolicy>* first; 1030 first = fLeft; 1033 first = fRight; 1037 status_t status = first->Match(entry, node, attribute, type, key,
|
/haiku/src/add-ons/mail_daemon/inbound_protocols/imap/ |
H A D | IMAPFolder.cpp | 251 // TODO: copy it to the trash directory first! 305 // Synchronize all pending flags first 308 SyncMessageFlags(pendingIterator->first, pendingIterator->second); 318 uint32 uid = iterator->first;
|
/haiku/src/add-ons/kernel/file_systems/xfs/ |
H A D | Inode.cpp | 190 // verify version 3 inodes first 364 uint64 first = B_BENDIAN_TO_HOST_INT64(wrappedExtent[0]); local 366 entry->br_state = first >> 63; 367 entry->br_startoff = (first & MASK(63)) >> 9; 368 entry->br_startblock = ((first & MASK(9)) << 43) | (second >> 21); 464 // Go down the tree by taking the leftmost pointer to the first leaf 480 // Get's the first pointer. This points to next node.
|
/haiku/src/apps/showimage/ |
H A D | ShowImageWindow.cpp | 659 bool first = fImageView->Bitmap() == NULL; local 662 if (!first && ref != fNavigator.CurrentRef()) { 671 if (!first && page != fNavigator.CurrentPage()) { 686 if (first) 695 if (first) { 1501 // first/lastPage is unused for now
|
/haiku/src/tools/fs_shell/ |
H A D | fssh.cpp | 249 const char* name = it->first.c_str(); 467 // if we shall create all parents, do that first
|
/haiku/src/system/kernel/arch/riscv64/ |
H A D | arch_int.cpp | 50 bool first = true; local 54 if (first) first = false; else dprintf(", "); 114 bool first = true; local 118 if (first) first = false; else dprintf(", "); 265 // the signal. Otherwise we notify the user debugger first. 361 bool first = true; 366 if (first) { 368 first [all...] |
/haiku/src/apps/powerstatus/ |
H A D | PowerStatusView.cpp | 570 bool first = true; local 580 if (first) { 582 first = false;
|
/haiku/src/add-ons/kernel/network/protocols/tcp/ |
H A D | EndpointManager.cpp | 148 key.first).HashPair(key.second); 163 return endpoint->LocalAddress().EqualTo(key.first, true) 200 EndpointHashDefinition::CompareValues(TCPEndpoint* first, argument 203 return first->LocalAddress().Port() == second->LocalAddress().Port(); 310 // if the socket is unbound first bind it to ephemeral
|
H A D | EndpointManager.h | 63 bool CompareValues(TCPEndpoint* first,
|
/haiku/src/add-ons/kernel/busses/usb/ |
H A D | uhci.h | 183 void LinkDescriptors(uhci_td *first, 225 // keeps track of the first and last isochronous transfer descriptor
|
H A D | uhci.cpp | 414 // the list is empty, make this the first element 630 TRACE_ERROR("faild to allocate memory for first isochronous descriptor\n"); 1326 // Find the entry where to start inserting the first Isochronous descriptor 1329 // find the first available frame with enough bandwidth. 1339 // 3. There is enough bandwidth in the first entry 1343 // otherwise find the first next available frame with enough bandwidth 1347 // Find the first entry with enough bandwidth 1431 // Insert the transfer descriptor in the first position 1500 TRACE("finishing transfers (first transfer: 0x%08lx; last" 1585 // remove the transfer from the list first s 2268 LinkDescriptors(uhci_td *first, uhci_td *second) argument [all...] |
H A D | ohci.cpp | 411 // setup the empty slot in the list and linking of all -> first 420 // Now link the first endpoint to the isochronous endpoint 1025 // the current tail will become the first descriptor 1028 // the data and first descriptors might be the same 1034 // even the last and the first descriptor might be the same 1081 // the current tail will become the first descriptor 1084 // the data and first descriptors are the same 1087 // the last and the first descriptor might be the same 1134 TRACE("finishing transfers (first transfer: %p; last" 1235 // remove the transfer from the list first s 1663 _SwitchEndpointTail(ohci_endpoint_descriptor *endpoint, ohci_general_td *first, ohci_general_td *last) argument 1703 _SwitchIsochronousEndpointTail(ohci_endpoint_descriptor *endpoint, ohci_isochronous_td *first, ohci_isochronous_td *last) argument 2530 _LinkDescriptors(ohci_general_td *first, ohci_general_td *second) argument 2538 _LinkIsochronousDescriptors(ohci_isochronous_td *first, ohci_isochronous_td *second, ohci_isochronous_td *nextDone) argument [all...] |
H A D | ohci.h | 94 ohci_general_td *first, 98 ohci_isochronous_td *first, 157 void _LinkDescriptors(ohci_general_td *first, 160 ohci_isochronous_td *first,
|
H A D | ehci.h | 176 void LinkDescriptors(ehci_qtd *first,
|
H A D | ehci.cpp | 723 // setup the empty slot in the list and linking of all -> first 732 // terminate the first entry 1203 // Find the entry where to start inserting the first Isochronous descriptor 1213 // find the first available frame with enough bandwidth. 1225 // 3. There is enough bandwidth in the first entry 1229 // otherwise find the first next available frame with enough bandwidth 1539 // halt the controller first 1981 // remove the transfer from the list first so we are sure 2724 EHCI::LinkDescriptors(ehci_qtd *first, ehci_qtd *last, ehci_qtd *alt) argument 2726 first [all...] |
/haiku/src/add-ons/control_look/BeControlLook/ |
H A D | BeControlLook.cpp | 1132 // first bevel 1611 int32 first, int32 last) 1616 bool isFirst = index == first; 1637 // only draw if first tab is unselected 1681 // only draw if first tab is unselected 1726 // only draw if first tab is unselected 1770 // only draw if first tab is unselected 1608 DrawInactiveTab(BView* view, BRect& rect, const BRect& updateRect, const rgb_color& base, uint32 flags, uint32 borders, uint32 side, int32 index, int32 selected, int32 first, int32 last) argument
|
/haiku/src/kits/tracker/ |
H A D | PoseView.cpp | 1834 // the extent into the view for the first time: 2015 // if this is the first item then we set extent here 3841 // and returns either the index of the first pose at a given y location or 3858 // compare turned out equal, find first pose 3993 BPose* first = fSelectionList->FirstItem(); local 3995 if (first != NULL && fMultipleSelection 4000 int32 firstIndex = poseList->IndexOf(first); 5489 // couldn't find pose, first check if the node might be 5495 // first one will get caught by the first FindPos 6691 BPose* first = FirstVisiblePose(&index); local [all...] |
/haiku/src/bin/network/traceroute/ |
H A D | traceroute.c | 175 * the first release, I've learned that had I attended the right 178 * the idea first. I envy the originators' perspicacity and I'm 417 /* List of supported protocols. The first one is the default. The last 533 * Do the setuid-required stuff first, then lose privileges ASAP. 622 first_ttl = str2val(optarg, "first ttl", 1, 255); 720 "%s: first ttl (%d) may not be greater than max ttl (%d)\n", 922 * Otherwise, use the first address (and warn if 1887 static int first = 1; local 1890 if (first && !nflag) { 1891 first [all...] |
/haiku/src/add-ons/kernel/network/protocols/ipv6/ |
H A D | ipv6.cpp | 173 && value->Address() == *key.first; } 505 result = jenkins_hashword((const uint32*)key.first, 582 // Remove header unless this is the first fragment 1329 // first make sure the existing checksum is zero
|
/haiku/src/add-ons/kernel/network/protocols/ipv4/ |
H A D | ipv4.cpp | 150 { return key.first->s_addr ^ key.second; } 156 && value->Address().s_addr == key.first->s_addr; } 576 // Remove header unless this is the first fragment 1760 // Find first interface with a matching family
|
/haiku/src/add-ons/control_look/FlatControlLook/ |
H A D | FlatControlLook.h | 141 int32 first = 0, int32 last = 0);
|
/haiku/src/servers/registrar/ |
H A D | RecentEntries.cpp | 70 \brief The list of entries and their corresponding app sigs, most recent first 145 /*! \brief Returns the first \a maxCount recent apps in the \c BMessage 148 The message is cleared first, and \c entry_refs for the the apps are 310 status_t outputError = path.SetTo(&mapItem->first); 327 mapItem->first.device, mapItem->first.directory, 328 mapItem->first.name)); 336 mapItem->first.device, mapItem->first.directory, 337 mapItem->first [all...] |
/haiku/src/kits/interface/ |
H A D | OutlineListView.cpp | 1077 BOutlineListView::_SwapItems(int32 first, int32 second) argument 1080 if (first == second) 1083 // fail, first item out of bounds 1084 if ((first < 0) || (first >= CountItems())) 1091 int32 firstIndex = min_c(first, second); 1092 int32 secondIndex = max_c(first, second);
|
/haiku/src/add-ons/kernel/generic/tty/ |
H A D | tty.cpp | 275 if (Request* first = First()) 276 first->Notify(bytesAvailable); 568 // check, if we're first in queue, and if there is space to write 575 // We are not the first in queue or currently there's no space to write: 580 // set the number of bytes we need and notify, just in case we're first in 678 // check, if we're first in queue, and if there is something to read 692 // We are not the first in queue or currently there's nothing to read: 1101 // Make sure we are first in the writer queue(s) and AvailableBytes() is 1203 // Make sure we are first in the writer queue(s) and AvailableBytes() is 1489 // We do this by first notifyin [all...] |
/haiku/headers/os/interface/ |
H A D | OutlineListView.h | 87 const BListItem* first, 91 const BListItem* first, 134 bool _SwapItems(int32 first, int32 second);
|