Searched refs:it (Results 226 - 250 of 325) sorted by relevance

1234567891011>>

/haiku/headers/private/kernel/util/
H A DVectorMap.h183 Iterator it(*this);
185 return it;
196 Iterator it(*this);
198 return it;
275 types only the pointer is destroyed, not the object it points to.
385 one (End(), if it was the last element that has been
434 otherwise it is equal to End() and must not be dereferenced!
450 otherwise it is equal to End() and must not be dereferenced!
466 entry, i.e. it must not be dereferenced!
482 entry, i.e. it mus
[all...]
/haiku/src/add-ons/kernel/file_systems/packagefs/volume/
H A DVolume.cpp188 for (PackageFileNameHashTable::Iterator it = fPackages.GetIterator();
189 Package* package = it.Next();) {
380 // If no volume name is given, infer it from the mount type.
482 for (PackagesDirectoryList::Iterator it
484 PackagesDirectory* directory = it.Next();
517 for (PackageFileNameHashTable::Iterator it
518 = fPackages.GetIterator(); it.HasNext();
520 Package* package = it.Next();
623 for (QueryList::Iterator it = fQueries.GetIterator();
624 Query* query = it
[all...]
/haiku/src/add-ons/kernel/network/protocols/udp/
H A Dudp.cpp102 // we don't really need to protect it with the socket lock.
114 // endpoint hash (and it is bound and
415 EndpointTable::Iterator it = fActiveEndpoints.GetIterator(); local
417 while (UdpEndpoint* endpoint = it.Next()) {
439 EndpointTable::Iterator it = fActiveEndpoints.GetIterator(); local
446 while (it.HasNext()) {
447 UdpEndpoint *otherEndpoint = it.Next();
651 EndpointTable::Iterator it = fActiveEndpoints.GetIterator(); local
653 while (it.HasNext()) {
654 UdpEndpoint *endpoint = it
689 UdpDomainList::Iterator it = sUdpEndpointManager->fDomains.GetIterator(); local
[all...]
/haiku/src/kits/debugger/debug_info/
H A DGlobalTypeLookup.cpp237 for (IDTable::Iterator it = fTypesByID->GetIterator();
238 TypeEntry* typeEntry = it.Next();) {
/haiku/src/system/kernel/vm/
H A DVMPageQueue.h74 panic("%p->VMPageQueue::Append(page: %p): page thinks it is "
93 panic("%p->VMPageQueue::Prepend(page: %p): page thinks it is "
112 panic("%p->VMPageQueue::InsertAfter(page: %p): page thinks it is "
131 panic("%p->VMPageQueue::Remove(page: %p): page thinks it "
154 panic("%p->VMPageQueue::RemoveHead(): page %p thinks it is in "
171 panic("%p->VMPageQueue::Requeue(): page %p thinks it is in "
193 for (PageList::Iterator it = pages.GetIterator();
194 vm_page* page = it.Next();) {
196 panic("%p->VMPageQueue::AppendUnlocked(): page %p thinks it is "
H A DVMAnonymousCache.cpp241 for (SwapFileList::Iterator it = sSwapFileList.GetIterator();
242 swap_file* file = it.Next();) {
319 for (SwapFileList::Iterator it = sSwapFileList.GetIterator();
320 swap_file* swapFile = it.Next();) {
889 // more flexible use of it or change the interface!
898 // If the page doesn't have any swap space yet, allocate it.
1214 for (VMCachePagesTree::Iterator it = source->pages.GetIterator();
1215 vm_page* page = it.Next();) {
1221 // the page is not yet in the consumer cache - move it upwards
1236 for (VMCachePagesTree::Iterator it
[all...]
/haiku/src/system/boot/platform/riscv/
H A Dvirtio.cpp265 auto it = gVirtioDevices.GetIterator(); local
266 while (VirtioDevice* dev = it.Next()) {
/haiku/src/system/kernel/fs/
H A DEntryCache.cpp161 // remove the entry from its generation and delete it
165 // We can't free it, since another thread is about to try to move it
166 // to another generation. We mark it removed and the other thread will
167 // take care of deleting it.
191 // it by another thread.
233 for (EntryTable::Iterator it = fEntries.GetIterator();
234 EntryCacheEntry* entry = it.Next();) {
/haiku/src/apps/debugger/user_interface/gui/teams_window/
H A DTeamsWindow.cpp363 for (ListenerList::Iterator it = fListeners.GetIterator();
364 Listener* listener = it.Next();) {
/haiku/src/tests/add-ons/kernel/kernelland_emu/
H A Dmodule.cpp44 set<string>::iterator it; member in struct:module_name_list
418 // module not yet loaded, try to get it
506 list->it = list->names.begin();
518 if (list->it != list->names.end()) {
519 const string &name = *list->it;
524 list->it++;
674 // found an entry: if it is a file, try to load it
/haiku/src/apps/haikudepot/ui/
H A DMainWindow.cpp359 // the process coordination has completed then it will detect this and
896 B_TRANSLATE("Would it be acceptable to send anonymous usage data to the"
951 std::vector<DepotInfoRef>::iterator it; local
955 for (it = depots.begin(); it != depots.end(); it++) {
956 DepotInfoRef depotInfoRef = *it;
1112 // if after loading everything in, it transpires that there are no
1143 /*! Sends off a message to the Window so that it can change the status view
1231 is a package to be updated. When the thread unblocks, it wil
1342 std::vector<DepotInfoRef>::iterator it; local
[all...]
/haiku/src/tests/system/kernel/file_corruption/driver/
H A Dchecksum_device.cpp167 for (BlockList::Iterator it = fBlocks.GetIterator();
168 CheckSumBlock* block = it.Next();) {
170 // we know it -- requeue and return
171 it.Remove();
178 // flush the least recently used block and recycle it
332 // Since it collects pages for writing back without regard for
371 for (RawDeviceList::Iterator it = sDeviceList.GetIterator();
372 (nextDevice = it.Next()) != NULL;) {
901 // find the device in the list and unregister it
903 for (RawDeviceList::Iterator it
[all...]
/haiku/src/tests/kits/storage/testapps/
H A DPathMonitorTest2.cpp1326 std::set<BString>::iterator it = testNames.find(test->Name()); local
1327 if (it != testNames.end()) {
1328 testNames.erase(it);
1339 for (std::set<BString>::iterator it = testNames.begin();
1340 it != testNames.end(); ++it) {
1341 printf(" %s\n", it->String());
/haiku/src/bin/debug/profile/
H A Dprofile.cpp80 " interval might lead to better results, while it might\n"
118 for (ImageMap::iterator it = fImages.begin(); it != fImages.end(); ++it)
119 it->second->ReleaseReference();
252 // a kernel image -- add it to all teams
260 // a userland team image -- add it to that image
270 // a kernel image -- remove it from all teams
275 // a userland team image -- add it to that image
438 ImageMap::iterator it local
[all...]
/haiku/src/servers/debug/
H A DDebugServer.cpp287 TeamDebugHandlerMap::iterator it = fHandlers.find(team); local
288 if (it != fHandlers.end()) {
289 handler = it->second;
290 fHandlers.erase(it);
302 TeamDebugHandlerMap::iterator it = fHandlers.find(team); local
303 if (it != fHandlers.end())
304 handler = it->second;
344 // hand over the message to it
644 // and if it is, simply send it
[all...]
/haiku/src/add-ons/kernel/file_systems/netfs/server/
H A DClientConnection.cpp227 for (VolumeMap::Iterator it = fVolumes->GetIterator(); it.HasNext();)
228 delete it.Next().value;
345 for (VolumeMap::Iterator it = fVolumes->GetIterator(); it.HasNext();) {
346 if (ClientVolume* volume = _GetVolume(it.Next().value->GetID()))
385 for (VolumeMap::Iterator it = fVolumes->GetIterator(); it.HasNext();) {
386 if (ClientVolume* volume = _GetVolume(it.Next().value->GetID()))
428 for (VolumeMap::Iterator it
[all...]
/haiku/src/kits/interface/
H A DShelf.cpp13 /*! BShelf stores replicant views that are dropped onto it */
1082 // is not contained in BeOS R5's libbe, so we leave it empty
1238 LoadedImageMap::iterator it = loadedImages->images.find( local
1241 if (it != loadedImages->images.end()) {
1242 (*it).second.second--;
1243 if ((*it).second.second <= 0) {
1244 unload_add_on((*it).second.first);
1245 loadedImages->images.erase(it);
1336 LoadedImageMap::iterator it = loadedImages->images.find( local
1339 if (it
[all...]
/haiku/src/add-ons/kernel/file_systems/netfs/client/
H A DServerManager.cpp195 for (ServerInfoMap::Iterator it = fServerInfos->GetIterator();
196 it.HasNext();) {
197 ExtendedServerInfo* serverInfo = it.Next().value;
236 // create a new server info and add it
248 // create and execute the task -- it will do what is necessary
269 // trying to add/update it. We mark the info STATE_REMOVING, which will
314 "%ld bytes, but it should be %lu\n", bytesRead,
365 // create a new server info and add it
417 // bind it to the port
/haiku/src/servers/notification/
H A DNotificationWindow.cpp182 appfilter_t::iterator it = fAppFilters local
186 if (it == fAppFilters.end()) {
196 appUsage = it->second;
237 // it, the view has become used again, in which case we shouldn't
238 // delete it.
/haiku/src/apps/aboutsystem/
H A DAboutSystem.cpp1019 // create replicant dragger and add it as the new child 0
1287 for (PackageCreditMap::iterator it = fPackageCredits.begin();
1288 it != fPackageCredits.end(); it++) {
1290 delete it->second;
1344 // sys-info handles height because it may be a replicant
1981 .SetURL("http://www.xdp.it"));
2130 // attach it to a FILE
2205 for (PackageCreditMap::iterator it = fPackageCredits.begin();
2206 it !
[all...]
/haiku/docs/develop/kits/storage/resources/
H A DResourcesFormat.tex47 themselves is the same. We call it the resources format.
135 a size field, it has to be deduced, where the file ends. This end offset is
156 regular data), it has to be deduced by iterating through the PEF section
165 their general layout, it follow subsections discussing the major parts.
169 machines differ. Usually it should be possible, to deduce the used endianess
176 \ref{file-formats}), it may be decided to use the x86 resource file format
282 The resource index section starts with a header, it follows a table of
349 Directly, without padding, it follows a table of \code{resource\_index\_entry}
402 certain field of this type is, it may help to imagine, that before the
409 \code{index} the index of an unused field in \code{resources}, then it hold
[all...]
/haiku/src/system/libroot/posix/musl/math/x86/
H A Dexpl.s30 # it will be wrong on non-nearest rounding mode
/haiku/src/system/libroot/posix/musl/math/x86_64/
H A Dexpl.s30 # it will be wrong on non-nearest rounding mode
/haiku/src/system/boot/loader/file_systems/packagefs/
H A Dpackagefs.cpp264 for (NodeList::Iterator it = fEntries.GetIterator();
265 PackageNode* child = it.Next();) {
333 // clone a heap reader and adjust it for our use
463 // add it to the parent directory
894 for (PathBlocklist::Iterator it = pathBlocklist.GetIterator();
895 BlockedPath* path = it.Next();) {
/haiku/src/kits/package/hpkg/
H A DWriterImplBase.cpp648 for (CachedStringTable::Iterator it = cache.GetIterator();
649 CachedString* string = it.Next();) {
653 // sort it by descending usage count
805 DoublyLinkedList<PackageAttribute>::ConstIterator it local
807 while (PackageAttribute* attribute = it.Next()) {

Completed in 184 milliseconds

1234567891011>>