/haiku/src/system/kernel/posix/ |
H A D | realtime_sem.cpp | 385 SemTable::Iterator it = fSemaphores.GetIterator(); local 386 while (TeamSemInfo* sem = it.Next()) { 415 SemTable::Iterator it = fSemaphores.GetIterator(); local 416 while (TeamSemInfo* sem = it.Next()) {
|
/haiku/src/system/kernel/ |
H A D | system_info.cpp | 318 for (ListenerList::List::Iterator it 320 Listener* listener = it.Next();) { 324 // array is full -- need to flush it first 349 // send it 361 for (ListenerList::List::Iterator it 363 Listener* listener = it.Next();) {
|
H A D | thread.cpp | 239 // when it exited, but that might still exist, if the thread was never run. 302 // look it up and acquire a reference 311 // lock and check, if it is still in the hash table 419 /*! Adds the given user timer to the thread and, if user-defined, assigns it an 424 \param timer The timer to be added. If it doesn't have an ID yet, it is 506 // get the next team -- if there is one, get reference for it 548 use afterwards (or until it is reinitialized). 900 // If a thread object is given, acquire a reference to it, otherwise create 997 // lock the team and see, if it i [all...] |
H A D | signal.cpp | 6 * Copyright 2002, Angelo Mottola, a.mottola@libero.it. 183 BReferenceable's reference count is used, it is assumed that the owning 283 when it fails. 408 for (SignalList::Iterator it = fQueuedSignals.GetIterator(); 409 (otherSignal = it.Next()) != NULL;) { 435 for (SignalList::Iterator it = fQueuedSignals.GetIterator(); 436 Signal* signal = it.Next();) { 439 it.Remove(); 470 // if it is a queued signal, dequeue it [all...] |
H A D | image.cpp | 103 // Add the app image to the head of the list. Some code relies on it being 326 ImageTable::Iterator it = sImageTable->GetIterator(); local 328 while ((image = it.Next()) != NULL) {
|
/haiku/headers/private/netservices2/ |
H A D | HttpFields.h | 57 void RemoveField(ConstIterator it) noexcept;
|
/haiku/src/kits/package/ |
H A D | PackageRoster.cpp | 267 BRepositoryCache::Iterator it = packageInfos.GetIterator(); 268 while (const BPackageInfo* packageInfo = it.Next()) { 297 // send it 330 // send it
|
/haiku/src/tools/fs_shell/ |
H A D | fssh.cpp | 236 CommandMap::const_iterator it = fCommands.find(name); local 237 if (it == fCommands.end()) 240 return it->second; 247 for (CommandMap::const_iterator it = fCommands.begin(); 248 it != fCommands.end(); ++it) { 249 const char* name = it->first.c_str(); 250 Command* command = it->second; 487 // try to create it. 960 // if it i [all...] |
/haiku/src/kits/package/solver/libsolv/ |
H A D | LibsolvSolver.cpp | 813 SolvableMap::const_iterator it = fSolvablePackages.find(solvableId); local 814 return it != fSolvablePackages.end() ? it->second : NULL; 821 PackageMap::const_iterator it = fPackageSolvables.find(package); local 822 return it != fPackageSolvables.end() ? it->second : 0; 1234 // a composite -- analyze it
|
/haiku/src/system/kernel/vm/ |
H A D | VMKernelAddressSpace.cpp | 258 // TODO: If there is free space after a reserved range (or vice versa), it 281 // a free range is following -- just enlarge it 288 // insert it 303 // it could be used as well. 309 // The next range is completely covered -- remove and delete it. 313 // The next range is only partially covered -- shrink it. 352 // the previous range is free -- just enlarge it 360 // insert it 487 for (RangeList::ConstIterator it = fRangeList.GetIterator(); 488 Range* range = it [all...] |
H A D | vm.cpp | 600 // It also makes sense to move it from the inactive to the active, since 601 // otherwise the page daemon wouldn't come to keep track of it (in idle 602 // mode) -- if the page isn't touched, it will be deactivated after a 664 area, it is deleted. If it covers the beginning or the end, the area is 666 area, it is split in two; in this case the second area is returned via 700 // If no one else uses the area's cache and it's an anonymous cache, we can 701 // resize or split it, too. 856 // Don't unlock the cache yet because we might have to resize it 891 // Now we can unlock it 3714 VMAreasTree::Iterator it = VMAreas::GetIterator(); local 3751 VMAreasTree::Iterator it = VMAreas::GetIterator(); local [all...] |
/haiku/src/apps/icon-o-matic/import_export/svg/ |
H A D | nanosvg.h | 9 * including commercial applications, and to alter it and redistribute it 308 // Store value and find the end of it. 564 double it = 1.0-t; local 565 return it*it*it*p0 + 3.0*it*it*t*p1 + 3.0*it* 1145 nsvg__parseNumber(const char* s, char* it, const int size) argument 1188 nsvg__getNextPathItem(const char* s, char* it) argument 1486 char it[64]; local 1671 nsvg__getNextDashItem(const char* s, char* it) argument [all...] |
/haiku/src/tests/kits/storage/ |
H A D | ResourcesTest.cpp | 131 for (ResInfoSet::iterator it = fResources.begin(); 132 it != fResources.end(); 133 it++) { 134 const ResourceInfo *info = *it; 136 fResources.erase(it); 158 for (ResInfoSet::const_iterator it = fResources.begin(); 159 result == NULL && it != fResources.end(); 160 it++) { 161 const ResourceInfo *info = *it; 792 // Hard to test: just preload all and check, if it stil [all...] |
/haiku/src/libs/print/libprint/ |
H A D | GraphicsDriver.cpp | 450 for (PageDataList::iterator it = pages->begin(); it != pages->end(); 451 it++) { 469 if ((*it)->startEnum()) { 473 more = (*it)->enumObject(&picture_data);
|
/haiku/src/servers/input/ |
H A D | AddOnManager.cpp | 667 // We send a message to the target shelf, asking it for the Name of the 696 // We send a message to the target shelf, asking it for the Name of the 819 std::set<BMessenger>::iterator it = fWatcherMessengerList.begin(); local 820 while (it != fWatcherMessengerList.end()) { 821 const BMessenger& currentMessenger = *it; 826 fWatcherMessengerList.erase(it++); 828 it++;
|
/haiku/src/add-ons/translators/rtf/ |
H A D | convert.cpp | 322 // This is not nice, but it's the only we can provide all features on command 405 // or throw it away 427 // replace the current one, we don't need it anymore 496 // For now, it only differentiates fixed fonts from proportional ones 745 std::set<BString>::iterator it; local 749 for (it = fontTable.begin(); it != fontTable.end(); it++) { 750 rtfFile << "{\\f" << count << " " << *it << ";}"; local
|
/haiku/src/kits/network/libnetservices/ |
H A D | HttpRequest.cpp | 241 // allow setting it before sending the request. 251 // allow setting it before sending the request. 523 // If this request handles HTTP redirections, it will 693 // still try to decompress it, if a server ever sends a deflate 694 // stream despite it not being in our Accept-Encoding list. 725 // chunk in buffer before handling it 977 // of what it means (the RFC and Microsoft products), and we don't 1112 for (BHttpForm::Iterator it = fOptPostFields->GetIterator(); 1113 const BHttpFormData* currentField = it.Next(); 1116 it [all...] |
/haiku/src/add-ons/kernel/file_systems/netfs/client/ |
H A D | ShareVolume.cpp | 55 // NOTE: This class doesn't make a copy of the name string it is constructed 196 for (NodeMap::Iterator it = fNodes->GetIterator(); it.HasNext();) 197 delete it.Next().value; 208 for (EntryMap::Iterator it = fEntries->GetIterator(); it.HasNext();) 209 delete it.Next().value; 341 for (EntryMap::Iterator it = fEntries->GetIterator(); it.HasNext();) { 342 ShareDirEntry* entry = it [all...] |
/haiku/src/kits/debugger/controllers/ |
H A D | ThreadHandler.cpp | 317 // When stepping we need a stack trace. Save it before unsetting the state. 358 // have one yet, get it. Start with the CPU state. 382 // When the thread is in a syscall, do the same for all step kinds: Stop it 383 // when it returns by means of a breakpoint. 908 for (UserBreakpointInstanceList::ConstIterator it 909 = breakpoints.GetIterator(); it.HasNext();) { 910 UserBreakpoint* userBreakpoint = it.Next()->GetUserBreakpoint();
|
/haiku/src/build/libroot/ |
H A D | fs.cpp | 321 // path contains no slash, so it is a path relative to the current dir 364 DirPathMap::iterator it = sDirPathMap.find(*ref); local 365 if (it == sDirPathMap.end()) 368 path = it->second; 370 // stat the path to check, if it is still valid 373 sDirPathMap.erase(it); 379 sDirPathMap.erase(it); 385 sDirPathMap.erase(it); 390 // if there's a name, append it 469 // copy it bac [all...] |
/haiku/src/system/boot/loader/ |
H A D | menu.cpp | 87 * clue like a checkmark that distinguishes it from others. 166 Note, unlike the label, the string is not copied, it's 681 // Get the node name and duplicate it, so we can use it as a label. 1201 for (PackageVolumeStateList::ConstIterator it 1203 PackageVolumeState* state = it.Next();) { 1545 for (PathBlocklist::Iterator it = sPathBlocklist->GetIterator(); 1546 BlockedPath* path = it.Next();) { 1553 // Append the option a second time using the legacy name, so it also works 1559 for (PathBlocklist::Iterator it [all...] |
/haiku/src/apps/debugger/user_interface/gui/expression_eval_window/ |
H A D | ExpressionEvaluationWindow.cpp | 471 for (ThreadList::ConstIterator it = threads.GetIterator(); 472 ::Thread* thread = it.Next();) {
|
/haiku/src/add-ons/kernel/file_systems/packagefs/package/ |
H A D | CachedDataReader.cpp | 184 VMCachePagesTree::Iterator it = fCache->pages.GetIterator(pageOffset, true, local 187 vm_page* page = it.Next();
|
/haiku/src/add-ons/kernel/drivers/wmi/ |
H A D | WMIACPI.cpp | 104 for (WMIInfoList::Iterator it = fList.GetIterator(); 105 (wmiInfo = it.Next()) != NULL; index++) { 389 // check whether it's really a device 397 // check whether it's an acpi wmi device
|
/haiku/src/add-ons/kernel/generic/tty/ |
H A D | tty.cpp | 52 won't drop to zero. A tty and the tty connected to it (master and slave) 285 for (RequestList::Iterator it = fRequests.GetIterator(); it.HasNext();) { 286 Request* request = it.Next(); 297 for (RequestList::Iterator it = fRequests.GetIterator(); it.HasNext();) { 298 Request* request = it.Next(); 308 RequestList::Iterator it = fRequests.GetIterator(); local 309 while (Request* request = it.Next()) 505 // the writer queue of the target, it i [all...] |