/haiku-fatelf/src/servers/media/ |
H A D | AppManager.cpp | 128 AppMap::iterator found = fMap.find(team); 145 AppMap::iterator iterator = fMap.begin(); local 146 for (; iterator != fMap.end(); iterator++) { 148 be_roster->GetRunningAppInfo(iterator->first, &info); 149 printf(" team %ld \"%s\", messenger %svalid\n", iterator->first, 150 info.ref.name, iterator->second.IsValid() ? "" : "NOT "); 201 AppMap::iterator iterator local [all...] |
H A D | NodeManager.cpp | 186 NodeMap::iterator found = fNodeMap.find(id); 226 NodeMap::iterator found = fNodeMap.find(id); 234 TeamCountMap::iterator teamRef = node.team_ref_count.find(team); 291 NodeMap::iterator found = fNodeMap.find(id); 322 NodeMap::iterator found = fNodeMap.find(id); 355 NodeMap::iterator found = fNodeMap.find(id); 433 NodeMap::iterator found = fNodeMap.find(node.node); 460 NodeMap::iterator found = fNodeMap.find(node.node); 486 NodeMap::iterator iterator local 598 NodeMap::iterator iterator = fNodeMap.begin(); local 634 NodeMap::iterator iterator = fNodeMap.begin(); local 710 NodeMap::iterator iterator = fNodeMap.begin(); local [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/packagefs/ |
H A D | Directory.cpp | 99 DirectoryIterator* iterator = it.Next();) { 100 if (iterator->node == node) 101 iterator->node = nextNode; 114 Directory::AddDirectoryIterator(DirectoryIterator* iterator) argument 116 fIterators.Add(iterator); 121 Directory::RemoveDirectoryIterator(DirectoryIterator* iterator) argument 123 fIterators.Remove(iterator);
|
H A D | NameIndex.cpp | 189 Iterator* iterator = new(std::nothrow) Iterator; local 190 if (iterator != NULL) { 191 if (!iterator->SetTo(this, NULL, true)) { 192 delete iterator; 193 iterator = NULL; 196 return iterator; 220 Iterator* iterator = new(std::nothrow) Iterator; local 221 if (iterator != NULL) { 222 if (!iterator->SetTo(this, (const char*)key)) { 223 delete iterator; [all...] |
H A D | Index.cpp | 53 Index::GetIterator(IndexIterator& iterator) argument 56 iterator.SetIterator(actualIterator); 63 Index::Find(const void* key, size_t length, IndexIterator& iterator) argument 67 iterator.SetIterator(actualIterator); 141 IndexIterator::SetIterator(AbstractIndexIterator* iterator) argument 144 fIterator = iterator;
|
H A D | LastModifiedIndex.cpp | 220 Iterator* iterator = it.Next();) { 221 iterator->NodeChangeBegin(node); 235 Iterator* iterator = it.Next();) { 236 iterator->NodeChangeEnd(node); 249 Iterator* iterator = new(std::nothrow) Iterator; local 250 if (iterator != NULL) { 251 if (!iterator->SetTo(this, 0, true)) { 252 delete iterator; 253 iterator = NULL; 256 return iterator; 277 _AddIteratorToUpdate(Iterator* iterator) argument [all...] |
H A D | SizeIndex.cpp | 218 Iterator* iterator = it.Next();) { 219 iterator->NodeChangeBegin(node); 233 Iterator* iterator = it.Next();) { 234 iterator->NodeChangeEnd(node); 247 Iterator* iterator = new(std::nothrow) Iterator; local 248 if (iterator != NULL) { 249 if (!iterator->SetTo(this, 0, true)) { 250 delete iterator; 251 iterator = NULL; 254 return iterator; 275 _AddIteratorToUpdate(Iterator* iterator) argument [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/ |
H A D | SLList.h | 117 bool Insert(const Value &value, Iterator *iterator = NULL); 119 void Remove(Iterator &iterator); 122 bool Find(const Value &value, Iterator *iterator = NULL) const; 123 void GetIterator(Iterator *iterator) const; 207 SL_LIST_CLASS_NAME::Insert(const Value &value, Iterator *iterator) argument 213 if (iterator) 214 iterator->_SetTo(this, NULL, node); 224 Iterator iterator; local 225 bool result = Find(value, &iterator); 227 iterator 234 Remove(Iterator &iterator) argument [all...] |
H A D | Index.cpp | 41 Index::GetIterator(IndexEntryIterator *iterator) argument 44 if (iterator) { 47 iterator->SetIterator(actualIterator); 56 Index::Find(const uint8 *key, size_t length, IndexEntryIterator *iterator) argument 59 if (key && iterator) { 63 iterator->SetIterator(actualIterator); 161 IndexEntryIterator::SetIterator(AbstractIndexEntryIterator *iterator) argument 165 fIterator = iterator;
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/ |
H A D | SLList.h | 117 bool Insert(const Value &value, Iterator *iterator = NULL); 119 void Remove(Iterator &iterator); 122 bool Find(const Value &value, Iterator *iterator = NULL) const; 123 void GetIterator(Iterator *iterator) const; 207 SL_LIST_CLASS_NAME::Insert(const Value &value, Iterator *iterator) argument 213 if (iterator) 214 iterator->_SetTo(this, NULL, node); 224 Iterator iterator; local 225 bool result = Find(value, &iterator); 227 iterator 234 Remove(Iterator &iterator) argument [all...] |
H A D | TwoKeyAVLTree.h | 159 Value *FindFirst(const PrimaryKey &key, Iterator *iterator = NULL); 160 Value *FindLast(const PrimaryKey &key, Iterator *iterator = NULL); 163 Iterator *iterator = NULL); 165 inline void GetIterator(Iterator *iterator, bool reverse = false); 167 inline status_t Insert(const Value &value, Iterator *iterator = NULL); 170 inline void Remove(Iterator &iterator); 213 Iterator *iterator) 224 if (iterator) 225 _InitIterator(iterator, node); 240 Iterator *iterator) 212 FindFirst(const PrimaryKey &key, Iterator *iterator) argument 239 FindLast(const PrimaryKey &key, Iterator *iterator) argument 266 Find(const PrimaryKey &primaryKey, const SecondaryKey &secondaryKey, Iterator *iterator) argument 276 GetIterator(Iterator *iterator, bool reverse) argument 284 Insert(const Value &value, Iterator *iterator) argument 301 Remove(Iterator &iterator) argument [all...] |
H A D | Index.cpp | 41 Index::GetIterator(IndexEntryIterator *iterator) argument 44 if (iterator) { 47 iterator->SetIterator(actualIterator); 56 Index::Find(const uint8 *key, size_t length, IndexEntryIterator *iterator) argument 59 if (key && iterator) { 63 iterator->SetIterator(actualIterator); 159 IndexEntryIterator::SetIterator(AbstractIndexEntryIterator *iterator) argument 163 fIterator = iterator;
|
/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/client/ |
H A D | ServerVolume.cpp | 66 // init a directory iterator 67 VirtualDirIterator iterator; local 68 iterator.SetDirectory(fRootNode, true); 73 while (iterator.GetCurrentEntry(&name, &node)) { 74 iterator.NextEntry(); 90 // uninit the directory iterator 91 iterator.SetDirectory(NULL); 175 // init a directory iterator 177 VirtualDirIterator iterator; local 178 iterator 232 ServerQueryIterator* iterator = new(std::nothrow) ServerQueryIterator(this); local 270 ServerQueryIterator* iterator local 307 ServerQueryIterator* iterator local [all...] |
H A D | VirtualDir.cpp | 243 for (VirtualDirIterator* iterator = fIterators.First(); 244 iterator; 245 iterator = fIterators.GetNext(iterator)) { 246 if (iterator->GetCurrentEntry() == entry) 247 iterator->NextEntry(); 298 VirtualDir::AddDirIterator(VirtualDirIterator* iterator) argument 300 if (!iterator) 303 fIterators.Insert(iterator); 308 VirtualDir::RemoveDirIterator(VirtualDirIterator* iterator) argument [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/client/ |
H A D | ServerVolume.cpp | 65 // init a directory iterator 66 VirtualDirIterator iterator; local 67 iterator.SetDirectory(fRootNode, true); 72 while (iterator.GetCurrentEntry(&name, &node)) { 73 iterator.NextEntry(); 89 // uninit the directory iterator 90 iterator.SetDirectory(NULL); 173 // init a directory iterator 175 VirtualDirIterator iterator; local 176 iterator 230 ServerQueryIterator* iterator = new(nothrow) ServerQueryIterator(this); local 268 ServerQueryIterator* iterator local 305 ServerQueryIterator* iterator local [all...] |
H A D | VirtualDir.cpp | 240 for (VirtualDirIterator* iterator = fIterators.GetFirst(); 241 iterator; 242 iterator = fIterators.GetNext(iterator)) { 243 if (iterator->GetCurrentEntry() == entry) 244 iterator->NextEntry(); 295 VirtualDir::AddDirIterator(VirtualDirIterator* iterator) argument 297 if (!iterator) 300 fIterators.Insert(iterator); 305 VirtualDir::RemoveDirIterator(VirtualDirIterator* iterator) argument [all...] |
/haiku-fatelf/src/tests/system/kernel/util/ |
H A D | SinglyLinkedListTest.cpp | 69 typename List::Iterator iterator; local 70 for (iterator = list.Begin(); iterator != list.End(); --preIndex) { 72 // printf("(%p, %ld) %s (%p, %ld)\n", iterator->next, iterator->data, ((*iterator == values[preIndex]) ? "==" : "!="), values[preIndex].next, values[preIndex].data); 73 CHK(*iterator == values[preIndex]); 74 typename List::Iterator copy = iterator; 75 CHK(copy == iterator); 76 CHK(copy != ++iterator); [all...] |
H A D | DoublyLinkedListTest.cpp | 109 DoublyLinked::Iterator<Item> iterator = list.Iterator(); local 110 while (iterator.Next() != NULL) 117 iterator = list.Iterator(); 121 while ((item = iterator.Next()) != NULL) { 135 iterator = list.Iterator(); 137 while ((item = iterator.Next()) != NULL) { 152 iterator = list.Iterator(); 153 while (iterator.Next() != NULL)
|
/haiku-fatelf/src/system/kernel/ |
H A D | module.cpp | 833 iterator_pop_path_from_stack(module_iterator* iterator, uint32* _baseLength) argument 835 if (iterator->stack_current <= 0) 839 *_baseLength = iterator->stack[iterator->stack_current - 1].base_length; 841 return iterator->stack[--iterator->stack_current].name; 846 iterator_push_path_on_stack(module_iterator* iterator, const char* path, argument 849 if (iterator->stack_current + 1 > iterator->stack_size) { 851 module_path* stack = (module_path*)realloc(iterator 867 match_iterator_suffix(module_iterator* iterator, const char* name) argument 882 iterator_get_next_module(module_iterator* iterator, char* buffer, size_t* _bufferSize) argument 1166 hash_iterator iterator; local 1630 ModuleListenerList::Iterator iterator = fListeners.GetIterator(); local 1664 NotificationList::Iterator iterator = fNotifications.GetIterator(); local 1849 hash_iterator iterator; local 1979 module_iterator* iterator = (module_iterator*)malloc( local 2067 module_iterator* iterator = (module_iterator*)cookie; local 2105 module_iterator* iterator = (module_iterator*)cookie; local 2153 hash_iterator iterator; local [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | Directory.cpp | 230 while (DirIterator* iterator = fIterators.First()) 231 iterator->SetDirectory(NULL); 262 for (DirIterator* iterator = fIterators.First(); 263 iterator; 264 iterator = fIterators.GetNext(iterator)) { 265 if (iterator->GetCurrentEntry() == entry) 266 iterator->NextEntry(); 307 // create the iterator 308 DirIterator* iterator; 344 RemoveDirIterator(DirIterator* iterator) argument [all...] |
/haiku-fatelf/src/kits/media/ |
H A D | request_data.cpp | 49 PortSet::iterator iterator = fPool.begin(); local 51 for (; iterator != fPool.end(); iterator++) 52 delete_port(*iterator);
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/server/ |
H A D | Directory.cpp | 229 while (DirIterator* iterator = fIterators.GetFirst()) 230 iterator->SetDirectory(NULL); 261 for (DirIterator* iterator = fIterators.GetFirst(); 262 iterator; 263 iterator = fIterators.GetNext(iterator)) { 264 if (iterator->GetCurrentEntry() == entry) 265 iterator->NextEntry(); 306 // create the iterator 307 DirIterator* iterator; 343 RemoveDirIterator(DirIterator* iterator) argument [all...] |
/haiku-fatelf/headers/cpp/ |
H A D | stl_set.h | 65 typedef typename _Rep_type::const_iterator iterator; typedef in class:set 122 iterator begin() const { return _M_t.begin(); } 123 iterator end() const { return _M_t.end(); } 132 pair<iterator,bool> insert(const value_type& __x) { 133 pair<typename _Rep_type::iterator, bool> __p = _M_t.insert_unique(__x); 134 return pair<iterator, bool>(__p.first, __p.second); 136 iterator insert(iterator __position, const value_type& __x) { 137 typedef typename _Rep_type::iterator _Rep_iterator; 153 void erase(iterator __positio [all...] |
H A D | stl_list.h | 51 typedef _List_iterator<_Tp,_Tp&,_Tp*> iterator; typedef in struct:_List_iterator 67 _List_iterator(const iterator& __x) : _M_node(__x._M_node) {} 266 typedef _List_iterator<_Tp,_Tp&,_Tp*> iterator; typedef in class:list 271 typedef reverse_iterator<iterator> reverse_iterator; 276 typedef reverse_bidirectional_iterator<iterator,value_type,reference, 312 iterator begin() { return (_Node*)(_M_node->_M_next); } 315 iterator end() { return _M_node; } 343 iterator insert(iterator __position, const _Tp& __x) { 351 iterator inser [all...] |
/haiku-fatelf/src/servers/registrar/mime/ |
H A D | RegistrarThreadManager.h | 39 std::list<RegistrarThread*>::iterator& RemoveThread(std::list<RegistrarThread*>::iterator &i);
|