/haiku/src/bin/pkgman/ |
H A D | command_resolve_dependencies.cpp | 219 for (BPackagePathMap::const_iterator it = specifiedPackagePaths.begin(); 220 it != specifiedPackagePaths.end(); ++it) { 221 if (!packagesToInstall.AppendSpecifier(it->first)) 248 BPackagePathMap::const_iterator it = packagePaths.find(package); local 249 if (it == packagePaths.end()) { 255 printf("%s\n", it->second.String());
|
/haiku/src/kits/debugger/settings/ |
H A D | TeamSettings.cpp | 62 for (UserBreakpointList::ConstIterator it 64 UserBreakpoint* breakpoint = it.Next();) { 89 for (SignalDispositionMappings::const_iterator it = mappings.begin(); 90 it != mappings.end(); ++it) { 92 it->first, it->second);
|
/haiku/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | VolumeManager.cpp | 228 for (EntryCreatedEventMap::Iterator it = fEntryCreatedEvents->GetIterator(); 229 it.HasNext();) { 230 it.Next().value->ReleaseReference(); 235 for (EntryRemovedEventMap::Iterator it = fEntryRemovedEvents->GetIterator(); 236 it.HasNext();) { 237 it.Next().value->ReleaseReference(); 242 for (EntryMovedEventMap::Iterator it = fEntryMovedEvents->GetIterator(); 243 it.HasNext();) { 244 it.Next().value->ReleaseReference(); 249 for (NodeStatChangedEventMap::Iterator it [all...] |
/haiku/src/apps/haikudepot/util/ |
H A D | StorageUtils.cpp | 222 std::vector<PathWithLastAccessTimestamp>::iterator it; local 225 for (it = pathAndTimestampses.begin(); it != pathAndTimestampses.end(); it++) { 226 PathWithLastAccessTimestamp pathAndTimestamp = *it; 231 for (it = pathAndTimestampses.begin(); it != pathAndTimestampses.end() - countLatestRetained; it++) { 232 PathWithLastAccessTimestamp pathAndTimestamp = *it; 288 /*! This method will check that it i [all...] |
/haiku/src/add-ons/kernel/file_systems/packagefs/util/ |
H A D | StringPool.cpp | 74 // The object was fully dereferenced and will be deleted. Remove it 75 // from the hash table, so it isn't in the way. 131 for (StringDataHash::Iterator it = sStrings->GetIterator(); it.HasNext();) { 132 StringData* data = it.Next();
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/kernel_add_on/ |
H A D | KernelDebug.cpp | 25 for (KDebugFSMap::Iterator it = fileSystems.GetIterator(); 26 it.HasNext();) { 27 KDebugFSMap::Entry entry = it.Next();
|
/haiku/src/system/boot/loader/ |
H A D | PathBlocklist.cpp | 173 for (PathList::Iterator it = fPaths.GetIterator(); it.HasNext();) { 174 BlockedPath* blockedPath = it.Next();
|
/haiku/src/servers/package/ |
H A D | Volume.cpp | 332 // create the admin directory, if it doesn't exist yet 355 // empty transaction directory and then never have it cleaned up when 358 for (PackageNodeRefHashTable::Iterator it = 359 fActiveState->ByNodeRefIterator(); it.HasNext();) { 360 Package* package = it.Next(); 379 for (PackageNodeRefHashTable::Iterator it = 380 fActiveState->ByNodeRefIterator(); it.HasNext();) { 381 Package* package = it.Next(); 412 for (PackageFileNameHashTable::Iterator it 413 = fLatestState->ByFileNameIterator(); it 932 PackageSet::iterator it = fPackagesToBeDeactivated.find(package); local 977 PackageSet::iterator it = fPackagesToBeActivated.find(package); local [all...] |
/haiku/src/tools/cppunit/cppunit/ |
H A D | CompilerOutputter.cpp | 165 for ( Lines::iterator it = lines.begin(); it != lines.end(); ++it ) 167 string line( *it );
|
/haiku/src/tools/fs_shell/ |
H A D | partition_support.cpp | 53 for (FileRestrictionList::iterator it = sFileRestrictions.begin(); 54 it != sFileRestrictions.end(); ++it) { 55 FileRestriction* restriction = *it;
|
/haiku/src/system/libroot/posix/glibc/arch/sparc/ |
H A D | add_n.S | 8 The GNU MP Library is free software; you can redistribute it and/or modify 9 it under the terms of the GNU Lesser General Public License as published by 13 The GNU MP Library is distributed in the hope that it will be useful, but 47 movcc %xcc,0,%o4 ! if carry-out, o4 was 1; clear it 52 movcs %xcc,1,%o4 ! if s1 add gave carry, record it
|
H A D | sub_n.S | 8 The GNU MP Library is free software; you can redistribute it and/or modify 9 it under the terms of the GNU Lesser General Public License as published by 13 The GNU MP Library is distributed in the hope that it will be useful, but 44 movcc %xcc,0,%o4 ! if carry-out, o4 was 1; clear it 49 movcs %xcc,1,%o4 ! if s1 subtract gave carry, record it
|
/haiku/src/system/kernel/ |
H A D | UserTimer.cpp | 139 Cancels the timer, if it is already scheduled, and optionally schedules it 146 periodically every \a interval microseconds. Otherwise it will fire 147 only once at \a nextTime. If \a nextTime is \c B_INFINITE_TIMEOUT, it 154 next before the call. If it wasn't scheduled, the variable is set to 162 /*! Cancels the timer, if it is scheduled. 179 call. If it wasn't scheduled, the variable is set to 185 the timer went off, but its event couldn't be delivered, since it's 225 // Since we don't use periodic kernel timers, it isn't scheduled anymore. 226 // If the timer is periodic, the derived class' version will schedule it [all...] |
/haiku/src/system/kernel/arch/x86/ |
H A D | arch_vm.cpp | 170 for (MemoryTypeRangeList::Iterator it = sMemoryTypeRanges.GetIterator(); 171 memory_type_range* range = it.Next();) { 186 MemoryTypeRangeList::Iterator it = ranges.GetIterator(); local 187 memory_type_range* range = it.Next(); 192 range = it.Next(); 198 MemoryTypeRangeList::Iterator nextIt = it; 215 // range, we can extend the range without making it more complicated. 245 it.Remove(); 251 while ((range = it.Next()) != NULL) { 264 it [all...] |
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | Volume.cpp | 5 // This program is free software; you can redistribute it and/or modify 6 // it under the terms of the GNU General Public License as published by 10 // This program is distributed in the hope that it will be useful, 384 NodeListenerTree::Iterator it; local 385 if (fNodeListeners->FindFirst(node, &it)) { 386 for (NodeListenerValue *value = it.GetCurrent(); 388 value = it.GetNext()) { 415 NodeListenerTree::Iterator it; local 416 if (fNodeListeners->FindFirst(node, &it)) { 417 for (NodeListenerValue *value = it 504 EntryListenerTree::Iterator it; local 535 EntryListenerTree::Iterator it; local [all...] |
/haiku/src/kits/network/libnetservices2/ |
H A D | HttpSession.cpp | 249 // Get it on the list for deletion in the data queue 395 // object_wait_info list so that we can handle it below. 399 for (auto it = data->connectionMap.cbegin(); it != data->connectionMap.cend(); 400 it++) { 402 if (it->second.Id() == id) { 510 for (auto it = data->connectionMap.cbegin(); it != data->connectionMap.cend(); it++) { 511 data->objectList[i].object = it [all...] |
/haiku/src/bin/debug/profile/ |
H A D | SummaryProfileResult.cpp | 107 // nope, create it 140 for (ImageTable::Iterator it = fImages.GetIterator(); 141 SummaryImage* image = it.Next();) {
|
/haiku/src/system/kernel/arch/m68k/paging/040/ |
H A D | M68KPagingStructures040.cpp | 132 PagingStructuresList::Iterator it = sPagingStructuresList.GetIterator(); local 133 while (M68KPagingStructures040* info = it.Next())
|
/haiku/src/add-ons/kernel/file_systems/packagefs/nodes/ |
H A D | Directory.cpp | 98 for (DirectoryIteratorList::Iterator it = fIterators.GetIterator(); 99 DirectoryIterator* iterator = it.Next();) {
|
/haiku/src/build/libroot/ |
H A D | fs_descriptors.cpp | 380 // copy the data and write all of it 489 DescriptorMap::iterator it = sDescriptors->find(fd); 490 if (it == sDescriptors->end()) 492 return it->second; 523 DescriptorMap::iterator it = sDescriptors->find(fd); local 524 if (it == sDescriptors->end()) 527 status_t error = it->second->Close(); 528 delete it->second; 529 sDescriptors->erase(it);
|
/haiku/src/kits/support/ |
H A D | ArchivingManagers.cpp | 108 TokenMap::iterator it = fTokenMap.find(archivable); local 110 if (it == fTokenMap.end()) 113 _token = it->second.token; 171 for(TokenMap::iterator it = fTokenMap.begin(), end = fTokenMap.end(); 172 it != end; it++) { 173 ArchiveInfo& info = it->second; 175 pairs[info.token].second = it->first;
|
/haiku/src/kits/debugger/model/ |
H A D | ExpressionInfo.cpp | 65 // it as a primitive, so the consumer of the expression 66 // can use it as-is if desired. 167 for (ListenerList::Iterator it = fListeners.GetIterator(); 168 Listener* listener = it.Next();) {
|
/haiku/src/add-ons/kernel/file_systems/packagefs/package/ |
H A D | PackageNode.cpp | 100 for (PackageNodeAttributeList::ConstIterator it = fAttributes.GetIterator(); 101 PackageNodeAttribute* attribute = it.Next();) {
|
/haiku/src/kits/debugger/dwarf/ |
H A D | DwarfManager.cpp | 93 for (FileList::Iterator it = fFiles.GetIterator(); 94 DwarfFile* file = it.Next();) {
|
/haiku/src/servers/registrar/ |
H A D | MessagingService.cpp | 125 // remove it from the area 214 registrar, it is possible to use the MessageDeliverer which retries sending 219 adds messages to it, the registrar removes them. If the area is full, the 220 kernel creates a new one and adds it to the area list. 225 only implemented command type is to send a message, but it is very easy 328 // init it 367 CommandHandlerMap::iterator it = fCommandHandlers->find(command); local 368 if (it != fCommandHandlers->end()) 369 fCommandHandlers->erase(it); 379 CommandHandlerMap::iterator it local [all...] |