Searched refs:it (Results 276 - 300 of 325) sorted by relevance

<<111213

/haiku/src/kits/debugger/debugger_interface/local/
H A DLocalDebuggerInterface.cpp131 for (DebugContextList::Iterator it = fFreeContexts.GetIterator();
132 DebugContext* context = it.Next();) {
136 for (DebugContextList::Iterator it = fUsedContexts.GetIterator();
137 DebugContext* context = it.Next();) {
/haiku/src/add-ons/kernel/file_systems/netfs/server/
H A DNetFSServer.cpp234 // interrupt the thread in case it is currently snoozing
719 // send it
809 for (DriverParameterIterator it = settings.GetParameterIterator("user");
810 it.GetNext(&parameter);) {
825 for (DriverParameterIterator it = settings.GetParameterIterator("share");
826 it.GetNext(&parameter);) {
969 // set it
992 // add it to the settings archive
1071 // bind it to the port
1221 // snooze the rest blocking on our semaphore (if it exist
[all...]
/haiku/src/kits/debugger/controllers/
H A DDebugReportGenerator.cpp329 for (ImageList::ConstIterator it = fTeam->Images().GetIterator();
330 Image* image = it.Next();) {
458 for (ThreadList::ConstIterator it = fTeam->Threads().GetIterator();
459 (thread = it.Next());) {
H A DTeamDebugger.cpp1683 // stop it for debugging, then that request will interrupt
1920 for (ImageList::ConstIterator it = images.GetIterator();
1921 Image* image = it.Next();) {
1927 for (UserBreakpointList::ConstIterator it = breakpoints.GetIterator();
1928 UserBreakpoint* breakpoint = it.Next();) {
2118 for (FunctionInstanceList::ConstIterator it
2120 FunctionInstance* instance = it.Next();) {
2474 // install it
/haiku/src/system/kernel/fs/
H A Dfifo.cpp757 for (ReadRequestList::ConstIterator it = fReadRequests.GetIterator();
758 ReadRequest* request = it.Next();) {
766 for (WriteRequestList::ConstIterator it = fWriteRequests.GetIterator();
767 WriteRequest* request = it.Next();) {
1213 // super node's hook, if it has got one.
/haiku/src/kits/package/manager/
H A DPackageManager.cpp270 // NOTE: In theory, after verifying a more specific location, it would
277 // been any reason to remove it from the more specific location in the
710 // Copy the package. Ideally we would just hard-link it, but BFS doesn't
842 // it refers to.
960 PackagePathMap::const_iterator it = fPackagePaths.find(package); local
961 if (it == fPackagePaths.end()) {
966 status_t error = _path.SetTo(it->second.c_str());
968 DIE(error, "Failed to init package path %s", it->second.c_str());
/haiku/src/apps/debuganalyzer/model_loader/
H A DModelLoader.cpp112 for (IOOperationList::ConstReverseIterator it
114 IOOperation* operation = it.Next();) {
132 for (IOOperationList::ConstIterator it = operations.GetIterator();
133 IOOperation* operation = it.Next();) {
537 // it's a BPositionIO -- this makes things easier, since we know how
989 // thread starts waiting (it hadn't been added to the run
1094 // Not really correct, but the case is rare and we keep it
/haiku/src/add-ons/kernel/drivers/disk/virtual/ram_disk/
H A Dram_disk.cpp299 for (RawDeviceList::Iterator it = sDeviceList.GetIterator();
300 (nextDevice = it.Next()) != NULL;) {
419 VMCachePagesTree::Iterator it local
422 while ((firstModified = it.Next()) != NULL
443 while (vm_page* page = it.Next()) {
677 // TODO: This method is duplicated in ramfs' DataContainer. Perhaps it
730 // TODO: This method is duplicated in ramfs' DataContainer. Perhaps it
993 for (RawDeviceList::Iterator it = sDeviceList.GetIterator();
994 RawDevice* device = it.Next();) {
1050 // find the device in the list and unregister it
[all...]
/haiku/src/add-ons/kernel/busses/usb/
H A Duhci.cpp1038 // wait for any transfers that might have made it before canceling
1042 // notify the finisher so it can clean up the canceled transfers
1186 transfer_data *it = fFirstTransfer; local
1187 while (it) {
1188 if (it->transfer && it->transfer->TransferPipe() == transfer->TransferPipe()
1189 && it->transfer->IsFragmented()) {
1197 it = it->link;
1380 // TODO: We don't consider bInterval, and assume it'
[all...]
H A Dohci.cpp460 // according to the OHCI spec, but without it some controllers don't start.
515 // otherwise it will occasionally report 0 ports.
699 // this endpoint, wait for it to finish
754 // wait for any transfers that might have made it before canceling
758 // notify the finisher so it can clean up the canceled transfers
981 // Disable the interrupt as it will otherwise be retriggered until the
983 // TODO: renable it once we use status changes instead of polling
1188 // to know, as when it was halted by another td this
1236 // it doesn't get canceled while we still process it
1578 transfer_data *it = fFirstTransfer; local
[all...]
H A Dehci.cpp1255 TRACE("isochronous created itd, filling it with phy %" B_PRIxPHYSADDR
1543 // then reset it
1673 transfer_data *it = fFirstTransfer; local
1674 while (it) {
1675 if (it->transfer && it->transfer->TransferPipe() == transfer->TransferPipe()
1676 && it->transfer->IsFragmented()) {
1684 it = it->link;
1794 // wait for any transfers that might have made it befor
[all...]
/haiku/src/add-ons/kernel/bus_managers/firewire/
H A Dfirewire.cpp506 * Dettach it.
603 fw_xferq_drain(fc->it[i]);
788 * does not change it's Bus Info Block or
835 fc->it[i]->queued = 0;
838 fc->it[i]->start = NULL;
841 fc->it[i]->buf = NULL;
844 fc->it[i]->flag = FWXFERQ_STREAM;
847 STAILQ_INIT(&fc->it[i]->q);
850 snprintf(tempname, sizeof(tempname), "it%d ready sem", i);
851 fc->it[
[all...]
/haiku/src/kits/tracker/
H A DIconCache.cpp35 // Icon cache is used for drawing node icons; it caches icons
84 // than needed - enable it, open a window with a bunch of poses, force
85 // it to redraw, shouldn't recache
414 // metamime defines an icon and we have it cached
426 // try getting it from the preferred app of this type
595 // reach the cache it is in
611 // check if it's a network share and give it a special icon
639 // if the volume doesnt have a device it gets the generic icon
819 // node has its own icon, use it
1496 EntryHashTable::Iterator it = fHashTable.GetIterator(); local
1784 EntryHashTable::Iterator it = fHashTable.GetIterator(); local
[all...]
/haiku/src/system/kernel/arch/x86/paging/32bit/
H A DX86VMTranslationMap32Bit.cpp130 // offset the range so it has the worst possible alignment
171 // put it in the pgdir
177 // update any other page directories, if it maps kernel space
491 // TODO: As in UnmapPage() we can lose page dirty flags here. ATM it's not
526 for (VMAreaMappings::Iterator it = mappings.GetIterator();
527 vm_page_mapping* mapping = it.Next();) {
844 // page hasn't been accessed -- unmap it
/haiku/src/system/kernel/arch/x86/paging/64bit/
H A DX86VMTranslationMap64Bit.cpp493 // TODO: As in UnmapPage() we can lose page dirty flags here. ATM it's not
529 for (VMAreaMappings::Iterator it = mappings.GetIterator();
530 vm_page_mapping* mapping = it.Next();) {
805 // page hasn't been accessed -- unmap it
/haiku/src/system/kernel/device_manager/
H A DIOCache.cpp286 VMCachePagesTree::Iterator it = fCache->pages.GetIterator(pageOffset, true, local
289 vm_page* page = it.Next();
340 // anyway and this way we can sort it, possibly improving the physical
734 If successful, it must be balanced by a call to _UnmapPages().
/haiku/src/system/kernel/arch/arm/paging/32bit/
H A DARMVMTranslationMap32Bit.cpp147 // offset the range so it has the worst possible alignment
188 // put it in the pgdir
192 // update any other page directories, if it maps kernel space
508 // TODO: As in UnmapPage() we can lose page dirty flags here. ATM it's not
543 for (VMAreaMappings::Iterator it = mappings.GetIterator();
544 vm_page_mapping* mapping = it.Next();) {
868 // page hasn't been accessed -- unmap it
/haiku/src/add-ons/kernel/network/protocols/unix/
H A DUnixFifo.cpp273 AncillaryDataList::Iterator it = fAncillaryData.GetIterator(); local
274 while (AncillaryDataEntry* entry = it.Next())
/haiku/headers/private/firewire/
H A Dfirewirereg.h173 *arq, *atq, *ars, *ats, *it[FW_MAX_DMACH],*ir[FW_MAX_DMACH]; member in struct:firewire_comm
/haiku/headers/private/kernel/vm/
H A DVMCache.h220 bool _FreePageRange(VMCachePagesTree::Iterator it,
/haiku/src/system/libroot/os/
H A Dimage.cpp357 // check whether it is a file
469 into it. The buffer starts with a char* array which contains pointers to
473 If executablePath is non-NULL, it should refer to the executable to be
553 // We don't need it, because our loader already does the job, right?
/haiku/src/servers/registrar/
H A DShutdownProcess.cpp73 // the shutdown window before closing it automatically.
468 // We do not delete the present fCurrentIconBitmap as the BAlert owns it.
715 // send a reply to the request and delete it
1039 for (AppInfoList::Iterator it = infos.It(); it.IsValid(); ++it) {
1040 RosterAppInfo* info = *it;
1258 // if the event is an obsolete timeout event, we drop it right here
1332 // finding it again, since registrar does not have an entry in the
1360 // make the shutdown window ready and show it
[all...]
/haiku/src/tests/kits/storage/
H A DEntryTest.cpp2450 for (list<TestEntry*>::iterator it = allTestEntries.begin();
2451 it != allTestEntries.end(); it++) {
2452 (*it)->initPath();
2456 for (list<TestEntry*>::iterator it = allTestEntries.begin();
2457 it != allTestEntries.end(); it++) {
2458 (*it)->completeInit();
2462 for (list<TestEntry*>::iterator it = allTestEntries.begin();
2463 it !
[all...]
/haiku/src/system/kernel/vm/
H A Dvm_page.cpp853 VMPageQueue::Iterator it = pageQueueInfos[i].queue->GetIterator(); local
854 while (vm_page* p = it.Next()) {
1165 for (PageReservationWaiterList::Iterator it
1167 PageReservationWaiter* waiter = it.Next();) {
1789 Given enough time, it will clear out all pages from the free queue - we
1790 could probably slow it down after having reached a certain threshold.
2026 // We have a modified page -- however, while we're writing it back,
2028 // page, we mark it clean before actually writing it back; if
2029 // writing the page fails for some reason, we'll just keep it i
3157 VMCachePagesTree::Iterator it local
[all...]
/haiku/src/system/kernel/
H A Dport.cpp51 // GCC >= 3.1 doesn't need it anymore
79 // get_locked_port() consider this port as deleted and ignore it. Secondly,
86 // * Ports are reference-counted so it's not a problem when someone still
520 for (PortHashTable::Iterator it = sPorts.GetIterator();
521 Port* port = it.Next();) {
583 // if the argument looks like a number, treat it as such
597 for (PortHashTable::Iterator it = sPorts.GetIterator();
598 Port* port = it.Next();) {
713 // miss it.
812 * structures in which it i
[all...]

Completed in 189 milliseconds

<<111213