/haiku/src/add-ons/kernel/generic/tty/ |
H A D | module.cpp | 70 TTYCookieList::Iterator it = tty.cookies.GetIterator(); local 71 while (tty_cookie* cookie = it.Next())
|
/haiku/src/apps/cortex/RouteApp/ |
H A D | RouteApp.cpp | 445 // read it: 455 for(list<BString>::iterator it = errors.begin(); 456 it != errors.end(); ++it) 457 fputs((*it).String(), stderr); 577 for(list<BString>::iterator it = errors.begin(); 578 it != errors.end(); ++it) 579 fputs((*it).String(), stderr);
|
H A D | RouteAppNodeManager.cpp | 117 icon_map::const_iterator it = m_iconMap.find(key); local 118 if(it != m_iconMap.end()) { 120 return (*it).second; 138 icon_map::const_iterator it = m_iconMap.find(key); local 139 if(it != m_iconMap.end()) { 141 return (*it).second; 194 // adopt node's time source if it's not the system clock (the default) 446 // and send it 533 // create an IO object for the node & write it 541 for(connection_map::const_iterator it [all...] |
/haiku/src/kits/debugger/files/ |
H A D | FileManager.cpp | 275 for (LocatableEntryList::ConstIterator it 277 LocatableEntry* entry = it.Next();) { 311 // no such file yet -- create it 389 // if already unreferenced, remove it 415 // remove trailing slash (unless it's "/" only) 758 for (LocatedFileMap::const_iterator it = fSourceLocationMappings.begin(); 759 it != fSourceLocationMappings.end(); ++it) { 760 status_t error = settings->AddSourceMapping(it->first, it 803 LocatedFileMap::const_iterator it = fSourceLocationMappings.find( local [all...] |
/haiku/src/system/kernel/disk_device_manager/ |
H A D | KDiskDeviceManager.cpp | 296 for (PartitionMap::Iterator it = fPartitions->Begin(); 297 it != fPartitions->End(); ++it) { 298 TRACE(" partition: %" B_PRId32 "\n", it->Value()->ID()); 304 for (PartitionSet::Iterator it = fObsoletePartitions->Begin(); 305 it != fObsoletePartitions->End(); ++it) { 306 TRACE(" partition: %" B_PRId32 "\n", (*it)->ID()); 358 thread-safe either, you should make sure that it's called only once. 482 // if the device is not known yet, create it an 917 DiskSystemMap::Iterator it = fDiskSystems->Find(id); local [all...] |
/haiku/src/kits/package/hpkg/ |
H A D | PackageWriterImpl.cpp | 101 for (DoublyLinkedList<Attribute>::ConstIterator it 102 = children.GetIterator(); Attribute* child = it.Next();) { 124 for (DoublyLinkedList<Attribute>::ConstIterator it 125 = children.GetIterator(); Attribute* child = it.Next();) { 140 for (DoublyLinkedList<Attribute>::ConstIterator it 141 = children.GetIterator(); Attribute* child = it.Next();) { 335 EntryList::ConstIterator it = fChildren.GetIterator(); local 336 while (Entry* child = it.Next()) { 403 // If the attribute refers to a heap value, adjust it 413 for (DoublyLinkedList<Attribute>::Iterator it 1357 DoublyLinkedList<Attribute>::Iterator it local [all...] |
/haiku/headers/tools/cppunit/ |
H A D | ThreadedTestCaller.h | 82 for (typename ThreadManagerMap::iterator it = fThreads.begin(); it != fThreads.end (); ++it) { 83 delete it->second; 155 // (this code right here), blocks on a semaphore that it 157 // If it times out, it checks the NextSubTest() queue, prints 159 // again. When it finally manages to acquire it, all the 160 // test threads have terminated, and it' [all...] |
/haiku/src/add-ons/kernel/bus_managers/firewire/ |
H A D | fwohcivar.h | 63 } arrq, arrs, atrq, atrs, it[OHCI_DMA_ITCH], ir[OHCI_DMA_IRCH]; member in struct:fwohci_softc
|
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | SLList.h | 255 for (Iterator it = GetIterator(); it.HasNext();) { 256 if (element == it.Next()) { 257 it.Remove();
|
/haiku/src/add-ons/print/drivers/gutenprint/ |
H A D | GPCapabilityExtractor.cpp | 163 // determine the resolution (x and y) for it, because 164 // libprint needs it for rasterization 311 list<DriverSpecificCap*>::iterator it = fDriverSpecificCategories.begin(); local 312 for (int index = 0; it != fDriverSpecificCategories.end(); it ++, 314 array[index] = *it;
|
/haiku/src/add-ons/print/transports/ipp/ |
H A D | IppContent.cpp | 613 for (list<IppAttribute *>::const_iterator it = attrs.begin(); it != attrs.end(); it++) { 614 delete (*it); 807 for (list<IppAttribute *>::const_iterator it = attrs.begin(); it != attrs.end(); it++) { 808 os << *(*it); 920 for (list<IppAttribute *>::const_iterator it = attrs.begin(); it ! [all...] |
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/ |
H A D | LastModifiedIndex.cpp | 219 for (IteratorList::Iterator it = iterators.GetIterator(); 220 Iterator* iterator = it.Next();) { 232 // its place, they will point to it again, otherwise to the node originally 233 // succeeding it. 234 for (IteratorList::Iterator it = iterators.GetIterator(); 235 Iterator* iterator = it.Next();) {
|
H A D | SizeIndex.cpp | 217 for (IteratorList::Iterator it = iterators.GetIterator(); 218 Iterator* iterator = it.Next();) { 230 // its place, they will point to it again, otherwise to the node originally 231 // succeeding it. 232 for (IteratorList::Iterator it = iterators.GetIterator(); 233 Iterator* iterator = it.Next();) {
|
/haiku/src/add-ons/kernel/file_systems/packagefs/package_links/ |
H A D | PackageLinkDirectory.cpp | 115 for (PackageList::Iterator it = fPackages.GetIterator(); 116 (otherPackage = it.Next()) != NULL;) { 209 for (DependencyList::ConstIterator it 211 Dependency* dependency = it.Next();) {
|
/haiku/headers/private/shared/ |
H A D | HashSet.h | 126 bool Remove(Iterator& it); 252 // does not contain the key yet: create an element and add it 284 HashSet<Key>::Remove(Iterator& it) argument 286 Element* element = it.fElement; 292 it.fElement = NULL;
|
/haiku/src/system/libroot/posix/glibc/arch/sparc/ |
H A D | addmul_1.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 59 add %i1,%i0,%i1 ! ...and add it to the mid-1 product 62 movcs %xcc,%o2,%l0 ! ...compute it and...
|
H A D | mul_1.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 61 add %i1,%i0,%i1 ! ...and add it to the mid-1 product 64 movcs %xcc,%o2,%l0 ! ...compute it and...
|
H A D | submul_1.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 58 add %i1,%i0,%i1 ! ...and add it to the mid-1 product 61 movcs %xcc,%o2,%l0 ! ...compute it and...
|
/haiku/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | NodeHandle.cpp | 450 for (DoublyLinkedList<Query>::Iterator it = fQueries.GetIterator(); 451 it.HasNext();) { 452 Query* query = it.Next(); 453 it.Remove();
|
/haiku/src/apps/debugger/user_interface/gui/team_window/ |
H A D | ImageListView.cpp | 60 ImageList::ConstIterator it = fTeam->Images().GetIterator(); local 61 Image* newImage = it.Next(); 68 newImage = it.Next(); 84 newImage = it.Next();
|
H A D | ThreadListView.cpp | 61 ThreadList::ConstIterator it = fTeam->Threads().GetIterator(); local 62 Thread* newThread = it.Next(); 71 newThread = it.Next(); 87 newThread = it.Next();
|
/haiku/src/kits/mail/ |
H A D | MailProtocol.cpp | 60 std::map<entry_ref, image_id>::iterator it = fFilterImages.begin(); local 61 for (; it != fFilterImages.end(); it++) 62 unload_add_on(it->second); 273 std::map<entry_ref, image_id>::iterator it = fFilterImages.find(ref); local 275 if (it != fFilterImages.end()) 276 image = it->second;
|
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | AttributeIndexImpl.cpp | 220 AttributeTree::Iterator it; local 221 fAttributes->GetIterator(&it); 222 for (Attribute **attribute = it.GetCurrent(); attribute; it.GetNext()) 245 AttributeTree::Iterator it; local 247 PrimaryKey(attribute, oldKey, oldLength), attribute, &it); 258 it.Remove();
|
/haiku/src/apps/debugger/user_interface/gui/team_settings_window/ |
H A D | SignalsConfigView.cpp | 151 for (SignalDispositionMappings::const_iterator it 152 = dispositions.begin(); it != dispositions.end(); ++it) { 154 = new(std::nothrow) SignalDispositionInfo(it->first, 155 it->second);
|
/haiku/src/apps/webpositive/ |
H A D | CookieWindow.cpp | 225 BPrivate::Network::BNetworkCookieJar::Iterator it = fCookieJar.GetIterator(); local 228 while ((cookie = it.NextDomain()) != NULL) { 252 // remove it and move its child one level up in the tree. 265 // We continue the loop without incrementing i to process it. 268 // The item has no cookies, but has multiple children. Mark it 269 // as disabled so it is not selectable. 356 BPrivate::Network::BNetworkCookieJar::Iterator it local 361 while ((cookie = it.Next()) != NULL) { 371 cookie = it.Next();
|