/haiku-fatelf/src/kits/storage/ |
H A D | PathMonitor.cpp | 258 DirectorySet::iterator i = fDirectories.begin(); 266 FileSet::iterator j = fFiles.begin(); 589 DirectorySet::const_iterator iterator = fDirectories.find(directory); local 590 if (iterator == fDirectories.end()) 594 *_contained = iterator->contained; 633 DirectorySet::const_iterator iterator = fDirectories.find(directory); local 634 if (iterator != fDirectories.end()) { 758 DirectorySet::iterator iterator = fDirectories.find(directory); local 759 if (iterator 816 FileSet::const_iterator iterator = fFiles.find(setEntry); local 886 FileSet::iterator iterator = fFiles.find(setEntry); local 1036 WatcherMap::iterator iterator = sWatchers.find(target); local 1075 WatcherMap::iterator iterator = sWatchers.find(target); local 1107 WatcherMap::iterator iterator = sWatchers.find(target); local [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/packagefs/ |
H A D | Directory.h | 50 DirectoryIterator* iterator); 52 DirectoryIterator* iterator);
|
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/ |
H A D | Attribute.h | 46 // iterator management 47 void AttachAttributeIterator(AttributeIterator *iterator); 48 void DetachAttributeIterator(AttributeIterator *iterator); 62 // iterator management
|
H A D | Entry.h | 41 // entry iterator management 42 void AttachEntryIterator(EntryIterator *iterator); 43 void DetachEntryIterator(EntryIterator *iterator); 55 // iterator management
|
/haiku-fatelf/src/servers/media/ |
H A D | BufferManager.cpp | 148 BufferInfoMap::Iterator iterator = fBufferInfoMap.GetIterator(); local 149 while (iterator.HasNext()) { 150 BufferInfoMap::Entry entry = iterator.Next(); 158 iterator.Remove(); 172 BufferInfoMap::Iterator iterator = fBufferInfoMap.GetIterator(); local 173 while (iterator.HasNext()) { 174 buffer_info& info = *iterator.NextValue(); 179 std::set<team_id>::iterator teamIterator = info.teams.begin();
|
/haiku-fatelf/src/servers/registrar/ |
H A D | RecentEntries.cpp | 114 std::list<recent_entry*>::iterator item; 170 std::list<recent_entry*>::iterator item; 199 for (std::list<recent_entry*>::iterator dupItem = duplicateList.begin(); 231 std::list<recent_entry*>::iterator i; 245 std::list<recent_entry*>::iterator item; 279 for (std::list<recent_entry*>::iterator item = fEntryList.begin(); 295 for (std::map<entry_ref, std::list<recent_entry*> >::iterator mapItem = map.begin(); 308 for (std::list<recent_entry*>::iterator item = list.begin();
|
/haiku-fatelf/src/system/boot/platform/u-boot/ |
H A D | devices.cpp | 53 NodeIterator iterator = list->GetIterator(); local 55 while ((partition = (boot::Partition *)iterator.Next()) != NULL) {
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/client/ |
H A D | VirtualDir.h | 78 void AddDirIterator(VirtualDirIterator* iterator); 79 void RemoveDirIterator(VirtualDirIterator* iterator);
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/ |
H A D | Attribute.h | 43 // iterator management 44 void AttachAttributeIterator(AttributeIterator *iterator); 45 void DetachAttributeIterator(AttributeIterator *iterator); 59 // iterator management
|
H A D | Entry.h | 42 // entry iterator management 43 void AttachEntryIterator(EntryIterator *iterator); 44 void DetachEntryIterator(EntryIterator *iterator); 56 // iterator management
|
/haiku-fatelf/src/tools/cppunit/ |
H A D | BTestSuite.cpp | 26 for ( map<string, CppUnit::Test*>::iterator it = fTests.begin(); 38 for ( map<string, CppUnit::Test*>::iterator it = fTests.begin();
|
/haiku-fatelf/src/tools/cppunit/cppunit/ |
H A D | TestSuite.cpp | 24 for ( vector<Test *>::iterator it = m_tests.begin(); 36 for ( vector<Test *>::iterator it = m_tests.begin();
|
/haiku-fatelf/headers/private/kernel/util/ |
H A D | Vector.h | 72 status_t Insert(const Value &value, const Iterator &iterator); 76 Iterator Erase(const Iterator &iterator); 109 inline int32 _IteratorIndex(const Iterator &iterator) const; 110 inline int32 _IteratorIndex(const ConstIterator &iterator) const; 345 \param iterator An iterator specifying the position at which to insert 349 - \c B_BAD_VALUE: \a iterator is is invalid. 354 _VECTOR_CLASS_NAME::Insert(const Value &value, const Iterator &iterator) argument 356 int32 index = _IteratorIndex(iterator); 384 \return An iterator referrin 411 Erase(const Iterator &iterator) argument [all...] |
/haiku-fatelf/headers/private/userlandfs/shared/ |
H A D | Vector.h | 68 status_t Insert(const Value &value, const Iterator &iterator); 72 Iterator Erase(const Iterator &iterator); 105 inline int32 _IteratorIndex(const Iterator &iterator) const; 106 inline int32 _IteratorIndex(const ConstIterator &iterator) const; 341 \param iterator An iterator specifying the position at which to insert 345 - \c B_BAD_VALUE: \a iterator is is invalid. 350 _VECTOR_CLASS_NAME::Insert(const Value &value, const Iterator &iterator) argument 352 int32 index = _IteratorIndex(iterator); 380 \return An iterator referrin 407 Erase(const Iterator &iterator) argument [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/headers/shared/ |
H A D | Vector.h | 68 status_t Insert(const Value &value, const Iterator &iterator); 72 Iterator Erase(const Iterator &iterator); 105 inline int32 _IteratorIndex(const Iterator &iterator) const; 106 inline int32 _IteratorIndex(const ConstIterator &iterator) const; 341 \param iterator An iterator specifying the position at which to insert 345 - \c B_BAD_VALUE: \a iterator is is invalid. 350 _VECTOR_CLASS_NAME::Insert(const Value &value, const Iterator &iterator) argument 352 int32 index = _IteratorIndex(iterator); 380 \return An iterator referrin 407 Erase(const Iterator &iterator) argument [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/udf/r5/ |
H A D | Icb.cpp | 122 Icb::GetDirectoryIterator(DirectoryIterator **iterator) argument 124 status_t error = iterator ? B_OK : B_BAD_VALUE; 127 *iterator = new(nothrow) DirectoryIterator(this); 128 if (*iterator) { 129 error = fIteratorList.PushBack(*iterator);
|
/haiku-fatelf/headers/cpp/ |
H A D | stl_tree.h | 156 iterator; typedef in struct:_Rb_tree_iterator 165 _Rb_tree_iterator(const iterator& __it) { _M_node = __it._M_node; } 621 typedef _Rb_tree_iterator<value_type, reference, pointer> iterator; typedef in class:_Rb_tree 627 typedef reverse_iterator<iterator> reverse_iterator; 629 typedef reverse_bidirectional_iterator<iterator, value_type, reference, 638 iterator _M_insert(_Base_ptr __x, _Base_ptr __y, const value_type& __v); 677 // __root, in iterator.operator++ 686 iterator begin() { return _M_leftmost(); } 688 iterator end() { return _M_header; } 710 pair<iterator,boo [all...] |
H A D | stl_rope.h | 79 // Buffer should really be an arbitrary output iterator. 81 // This is thoroughly impossible, since iterator types don't 746 // Dereferencing a nonconst iterator has to return something 848 // When we run out of cache, we have to reconstruct the iterator 1000 // Perhaps we should instead copy the iterator 1270 typedef _Rope_iterator<_CharT,_Alloc> iterator; typedef in class:rope 1386 // Should really take an arbitrary iterator. 1518 // should take an arbitrary iterator 1624 // Should perhaps be templatized with respect to the iterator type 1638 rope(const iterator [all...] |
/haiku-fatelf/src/system/kernel/cache/ |
H A D | block_cache.cpp | 214 hash_iterator* iterator = NULL); 216 hash_iterator* iterator, 219 status_t Write(hash_iterator* iterator = NULL, 232 hash_iterator* iterator); 788 DoublyLinkedList<block_cache>::Iterator iterator = sCaches.GetIterator(); local 789 while (iterator.HasNext()) { 790 block_cache* cache = iterator.Next(); 872 ListenerList::Iterator iterator = transaction->listeners.GetIterator(); local 873 while (iterator.HasNext()) { 874 cache_listener* listener = iterator 895 ListenerList::Iterator iterator = transaction->listeners.GetIterator(); local 909 ListenerList::Iterator iterator = transaction->listeners.GetIterator(); local 1075 Add(cached_block* block, hash_iterator* iterator) argument 1121 Add(cache_transaction* transaction, hash_iterator* iterator, bool& hasLeftOvers) argument 1156 Write(hash_iterator* iterator, bool canUnlock) argument 1248 _BlockDone(cached_block* block, hash_iterator* iterator) argument 2206 NotificationList::Iterator iterator local 2221 hash_iterator iterator; local 2244 hash_iterator iterator; local 2312 ListenerList::Iterator iterator = transaction->listeners.GetIterator(); local 2421 TraceEntryIterator iterator; local 2537 hash_iterator iterator; local 2549 hash_iterator iterator; local 2609 DoublyLinkedList<block_cache>::Iterator iterator = sCaches.GetIterator(); local 2756 hash_iterator iterator; local 3380 hash_iterator iterator; local [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/btrfs/ |
H A D | kernel_interface.cpp | 507 DirectoryIterator* iterator = new(std::nothrow) DirectoryIterator(inode); 508 if (iterator == NULL || iterator->InitCheck() != B_OK) { 509 delete iterator; 513 *_cookie = iterator; 522 DirectoryIterator* iterator = (DirectoryIterator*)_cookie; local 526 status_t status = iterator->GetNext(dirent->d_name, &length, &id); 546 DirectoryIterator* iterator = (DirectoryIterator*)_cookie; local 548 return iterator->Rewind(); 577 AttributeIterator* iterator 611 AttributeIterator* iterator = (AttributeIterator*)_cookie; local 633 AttributeIterator* iterator = (AttributeIterator*)_cookie; local [all...] |
H A D | BPlusTree.cpp | 35 mutex_init(&fIteratorLock, "btrfs b+tree iterator"); 45 mutex_init(&fIteratorLock, "btrfs b+tree iterator"); 56 SinglyLinkedList<TreeIterator>::Iterator iterator local 58 while (iterator.HasNext()) 59 iterator.Next()->Stop(); 209 BPlusTree::_AddIterator(TreeIterator* iterator) argument 212 fIterators.Add(iterator); 217 BPlusTree::_RemoveIterator(TreeIterator* iterator) argument 220 fIterators.Remove(iterator); 265 /*! just sets the current key in the iterator [all...] |
/haiku-fatelf/src/kits/media/ |
H A D | DormantNodeManager.cpp | 84 AddOnMap::iterator iterator = fAddOnMap.begin(); local 85 for (; iterator != fAddOnMap.end(); iterator++) { 86 loaded_add_on_info& info = iterator->second; 161 AddOnMap::iterator found = fAddOnMap.find(id); 272 AddOnMap::iterator found = fAddOnMap.find(id);
|
/haiku-fatelf/src/system/kernel/ |
H A D | low_resource_manager.cpp | 296 HandlerList::Iterator iterator = sLowResourceHandlers.GetIterator(); local 299 while (iterator.HasNext()) { 300 low_resource_handler *handler = iterator.Next(); 414 HandlerList::Iterator iterator = sLowResourceHandlers.GetIterator(); local 416 while (iterator.HasNext()) { 417 low_resource_handler* handler = iterator.Next(); 454 HandlerList::ReverseIterator iterator local 457 while (iterator.HasNext()) { 458 low_resource_handler *handler = iterator.Next();
|
/haiku-fatelf/headers/private/debug/ |
H A D | debug_support.h | 82 void debug_delete_symbol_iterator(debug_symbol_iterator* iterator); 84 status_t debug_next_image_symbol(debug_symbol_iterator* iterator, 87 status_t debug_get_symbol_iterator_image_info(debug_symbol_iterator* iterator,
|
/haiku-fatelf/src/add-ons/kernel/bluetooth/btCoreData/ |
H A D | FrameInterface.cpp | 16 DoublyLinkedList<L2capFrame>::Iterator iterator local 19 while (iterator.HasNext()) { 21 frame = iterator.Next();
|