Searched refs:iterator (Results 276 - 300 of 453) sorted by relevance

<<111213141516171819

/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/client/
H A DVolume.h151 QueryIterator** iterator);
152 virtual void FreeQueryIterator(QueryIterator* iterator);
153 virtual status_t ReadQuery(QueryIterator* iterator,
H A DVolume.cpp526 int32 token, QueryIterator** iterator)
533 Volume::FreeQueryIterator(QueryIterator* iterator) argument
539 Volume::ReadQuery(QueryIterator* iterator, struct dirent* buffer, argument
525 OpenQuery(const char* queryString, uint32 flags, port_id port, int32 token, QueryIterator** iterator) argument
/haiku-fatelf/src/tools/fs_shell/
H A Dmodule.cpp293 hash_iterator iterator; local
296 hash_rewind(sModulesHash, &iterator);
299 while ((module = (struct module *)hash_next(sModulesHash, &iterator)) != NULL) {
/haiku-fatelf/headers/private/kernel/util/
H A DVectorMap.h69 It is light-weight class, an object of which is returned when a iterator
108 Iterator Erase(const Iterator &iterator);
258 inline VectorMapIterator(Parent *parent, const EntryIterator &iterator) argument
260 fIterator(iterator)
406 \param iterator An iterator referring to the entry to be removed.
407 \return An iterator referring to the entry succeeding the removed
409 removed), or Null(), if \a iterator was an invalid iterator
414 _VECTOR_MAP_CLASS_NAME::Erase(const Iterator &iterator) argument
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/udf/
H A DIcb.cpp81 /* \brief Rewinds the iterator to point to the first entry in the directory. */
159 Icb::GetDirectoryIterator(DirectoryIterator **iterator) argument
161 status_t error = iterator ? B_OK : B_BAD_VALUE;
164 *iterator = new(std::nothrow) DirectoryIterator(this);
165 if (*iterator)
166 fIteratorList.Add(*iterator);
/haiku-fatelf/src/system/kernel/disk_device_manager/
H A DKDiskDeviceManager.cpp426 for (PartitionMap::Iterator iterator = fPartitions->Begin();
427 iterator != fPartitions->End(); ++iterator) {
428 KPartition* partition = iterator->Value();
442 PartitionMap::Iterator iterator = fPartitions->Find(id); local
443 if (iterator != fPartitions->End())
444 return iterator->Value();
1394 for (DiskSystemMap::Iterator iterator = diskSystems->Begin();
1395 iterator != diskSystems->End(); iterator
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/udf/r5/
H A Dudf.cpp734 Udf::DirectoryIterator *iterator = NULL;
735 error = dir->GetDirectoryIterator(&iterator);
737 *cookie = reinterpret_cast<void*>(iterator);
739 PRINT(("Error getting directory iterator: 0x%lx, `%s'\n", error, strerror(error)));
755 ("dir: %p, iterator: %p, bufferSize: %ld", node, cookie, bufferSize));
762 Udf::DirectoryIterator *iterator = reinterpret_cast<Udf::DirectoryIterator*>(cookie);
764 if (dir != iterator->Parent()) {
765 PRINT(("Icb does not match parent Icb of given DirectoryIterator! (iterator->Parent = %p)\n",
766 iterator->Parent()));
772 status_t error = iterator
[all...]
/haiku-fatelf/src/tests/system/kernel/util/
H A DVectorTest.cpp194 typedef vector<Value>::iterator ReferenceIterator;
241 vector<Value>::iterator it = fReferenceVector.begin();
252 void Insert(const Value &value, const Iterator &iterator) argument
255 if (iterator.fMyIterator == fMyVector.Null()) {
256 CHK(fMyVector.Insert(value, iterator.fMyIterator) == B_BAD_VALUE);
258 CHK(fMyVector.Insert(value, iterator.fMyIterator) == B_OK);
259 fReferenceVector.insert(iterator.fReferenceIterator, value);
300 Iterator Erase(const Iterator &iterator) argument
303 = (iterator.fReferenceIterator == fReferenceVector.end());
304 MyIterator myIt = fMyVector.Erase(iterator
[all...]
/haiku-fatelf/src/preferences/keymap/
H A DKeyboardLayout.cpp707 VariableMap::iterator iterator = variables.begin(); local
708 VariableMap::iterator best = variables.end();
711 for (; iterator != variables.end(); iterator++) {
712 const BString& name = iterator->first;
715 best = iterator;
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/random_file_actions/
H A Drandom_file_actions.cpp454 for (EntryVector::iterator i = files.begin(); i != files.end(); i++) {
549 EntryVector::iterator iterator = dirs.begin(); local
550 dirs.erase(iterator + index);
598 EntryVector::iterator iterator = files.begin(); local
599 files.erase(iterator + index);
/haiku-fatelf/src/system/kernel/debug/
H A Dtracing.cpp1324 static TraceEntryIterator iterator;
1456 // reset the iterator, if something changed in the meantime
1459 iterator.Reset();
1487 iterator.MoveTo(lastToCheck + 1);
1492 while (iterator.Index() > firstToCheck) {
1493 TraceEntry* entry = iterator.Previous();
1499 lastToDump = iterator.Index();
1500 firstToDump = iterator.Index();
1510 firstToCheck = iterator.Index();
1514 iterator
[all...]
/haiku-fatelf/src/system/kernel/
H A Delf.cpp178 struct hash_iterator iterator; local
186 hash_open(sImagesHash, &iterator);
190 while ((image = (elf_image_info *)hash_next(sImagesHash, &iterator))
200 hash_close(sImagesHash, &iterator, false);
250 struct hash_iterator iterator; local
254 hash_open(sImagesHash, &iterator);
256 while ((image = (elf_image_info *)hash_next(sImagesHash, &iterator))
262 hash_close(sImagesHash, &iterator, false);
366 struct hash_iterator iterator; local
371 hash_open(sImagesHash, &iterator);
418 struct hash_iterator iterator; local
554 struct hash_iterator iterator; local
1760 struct hash_iterator iterator; local
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/
H A DBlockAllocator.cpp195 TreeIterator* iterator; member in struct:check_cookie
1256 fCheckCookie->iterator = NULL;
1261 InodeList::Iterator iterator = fVolume->RemovedInodes().GetIterator();
1262 while (Inode* inode = iterator.Next()) {
1278 if (fCheckCookie->iterator != NULL) {
1279 delete fCheckCookie->iterator;
1280 fCheckCookie->iterator = NULL;
1353 if (fCheckCookie->iterator == NULL) {
1411 // get iterator for the next directory
1412 fCheckCookie->iterator
[all...]
H A DQuery.cpp142 TreeIterator** iterator, bool queryNonIndexed);
143 status_t GetNextMatching(Volume* volume, TreeIterator* iterator,
940 TreeIterator** iterator, bool queryNonIndexed)
974 *iterator = new TreeIterator(tree);
975 if (*iterator == NULL)
981 // set iterator to the exact position
989 // the iterator and adjust the key size; if not, just leave the
990 // iterator at the start and return success
1015 status = (*iterator)->Find((uint8*)&value, keySize);
1019 status = (*iterator)
939 PrepareQuery(Volume* , Index& index, TreeIterator** iterator, bool queryNonIndexed) argument
[all...]
H A DVolume.cpp566 SinglyLinkedList<Query>::Iterator iterator = fQueries.GetIterator(); local
567 while (iterator.HasNext()) {
568 Query* query = iterator.Next();
584 SinglyLinkedList<Query>::Iterator iterator = fQueries.GetIterator(); local
585 while (iterator.HasNext()) {
586 Query* query = iterator.Next();
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/r5/
H A DQuery.cpp145 status_t PrepareQuery(Volume *volume, Index &index, TreeIterator **iterator,
147 status_t GetNextMatching(Volume *volume, TreeIterator *iterator,
916 Equation::PrepareQuery(Volume */*volume*/, Index &index, TreeIterator **iterator, bool queryNonIndexed) argument
950 *iterator = new TreeIterator(tree);
951 if (*iterator == NULL)
957 // set iterator to the exact position
965 // the iterator and adjust the key size; if not, just leave the
966 // iterator at the start and return success
991 status = (*iterator)->Find((uint8 *)&value, keySize);
995 status = (*iterator)
[all...]
/haiku-fatelf/src/preferences/time/
H A DZoneView.cpp372 TranslatedRegionMap::iterator regionIter = regionMap.find(region);
405 ZoneItemMap::iterator zoneIter = zoneItemMap.find(fullZoneID);
414 ZoneItemMap::iterator countryIter
435 ZoneItemMap::iterator regionItemIter
445 ZoneItemMap::iterator zoneIter;
456 ZoneItemMap::iterator next = zoneIter;
/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/client/
H A DVolume.cpp530 int32 token, QueryIterator** iterator)
537 Volume::FreeQueryIterator(QueryIterator* iterator) argument
543 Volume::ReadQuery(QueryIterator* iterator, struct dirent* buffer, argument
529 OpenQuery(const char* queryString, uint32 flags, port_id port, int32 token, QueryIterator** iterator) argument
/haiku-fatelf/src/add-ons/kernel/network/protocols/l2cap/
H A DL2capEndpoint.cpp405 DoublyLinkedList<L2capEndpoint>::Iterator iterator local
408 while (iterator.HasNext()) {
410 endpoint = iterator.Next();
/haiku-fatelf/src/servers/registrar/mime/
H A DSnifferRules.cpp126 for (std::list<sniffer_rule>::iterator i = fRuleList.begin();
257 std::list<sniffer_rule>::iterator i;
287 for (std::list<sniffer_rule>::iterator i = fRuleList.begin();
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A Dkernel_interface.cpp1321 // no need to Resume(), iterator remains suspended
1342 // create iterator
1343 AttributeIterator *iterator = NULL; local
1345 iterator = new(nothrow) AttributeIterator(node);
1346 if (iterator)
1347 error = iterator->Suspend();
1353 *_cookie = iterator;
1355 delete iterator;
1369 AttributeIterator *iterator = (AttributeIterator*)_cookie; local
1370 iterator
1383 AttributeIterator *iterator = (AttributeIterator*)_cookie; local
1397 AttributeIterator *iterator = (AttributeIterator*)_cookie; local
1439 AttributeIterator *iterator = (AttributeIterator*)_cookie; local
[all...]
/haiku-fatelf/src/add-ons/media/plugins/matroska/libebml/
H A DEbmlMaster.cpp64 std::vector<EbmlElement *>::iterator myItr = ElementList.begin();
474 std::vector<EbmlElement *>::iterator Itr = ElementList.begin();
501 std::vector<EbmlElement *>::iterator Itr = ElementList.begin();
515 std::vector<EbmlElement *>::iterator Itr = ElementList.begin();
/haiku-fatelf/src/apps/cortex/RouteApp/
H A DNodeSetIOContext.cpp96 for(node_set::iterator it = m_nodes.begin();
/haiku-fatelf/src/bin/makeudfimage/
H A DShell.cpp76 for(std::list<std::string>::iterator i = argumentList.begin();
/haiku-fatelf/src/servers/app/drawing/Painter/
H A Dagg_scanline_p_subpix.h43 typedef span* iterator; typedef in class:agg::scanline_p8_subpix

Completed in 378 milliseconds

<<111213141516171819