/haiku/src/system/kernel/ |
H A D | timer.cpp | 77 // stick it in the event list 109 timer* volatile* it = &cpuData.events; local 110 timer* firstEvent = *it; 111 while (timer* event = *it) { 112 // check whether it's an absolute real-time timer 116 it = &event->next; 120 // Yep, remove the timer from the queue and add it to the 122 *it = event->next; 275 // note: if the event is not periodic, it is ok 286 // we need to adjust it an [all...] |
/haiku/src/kits/debugger/debug_info/ |
H A D | DwarfImageDebugInfo.cpp | 431 for (DebugInfoEntryList::ConstIterator it 433 DebugInfoEntry* entry = it.Next();) { 712 for (DebugInfoEntryList::ConstIterator it 714 DebugInfoEntry* entry = it.Next();) { 1105 for (DebugInfoEntryList::ConstIterator it 1107 DIEVariable* variableEntry = dynamic_cast<DIEVariable*>(it.Next());) { 1129 for (DebugInfoEntryList::ConstIterator it = blockEntries.list.GetIterator(); 1130 DIELexicalBlock* block = dynamic_cast<DIELexicalBlock*>(it.Next());) { 1218 // depending on which image it was. 1336 for (DebugInfoEntryList::ConstIterator it [all...] |
/haiku/src/tests/system/kernel/slab/ |
H A D | Slab.h | 418 // it's very important that we cast this to BaseHashCacheStrategy 441 for (uint8_t *it = data; 442 it < (data + byteCount); it += parent->ObjectSize()) { 446 _ClearSlabRange(parent, data, it); 451 link->buffer = it; 466 for (uint8_t *it = data; it < end; it += parent->ObjectSize()) { 467 Link *link = fHashTable.Lookup(it); [all...] |
/haiku/src/kits/tracker/ |
H A D | VirtualDirectoryManager.cpp | 256 // parse it 265 BDriverParameterIterator it 267 while (it.HasNext()) { 268 BDriverParameter parameter = it.Next(); 606 NodeRefInfoMap::const_iterator it = fInfos.find(nodeRef); local 607 return it != fInfos.end() ? it->second : NULL; 626 NodeRefInfoMap::iterator it = fInfos.find(info->DefinitionFileNodeRef()); local 627 if (it != fInfos.end()) 628 fInfos.erase(it); [all...] |
/haiku/src/add-ons/kernel/file_systems/packagefs/util/ |
H A D | TwoKeyAVLTree.h | 561 TreeMapIterator it = fTreeMap.Find(Key(primaryKey, secondaryKey)); local 563 iterator->_SetTo(it); 564 return it.CurrentValuePointer(); 572 TreeMapIterator it = fTreeMap.GetIterator(); local 573 it.Next(); 575 iterator->_SetTo(it); 594 TreeMapIterator it; local 595 status_t status = fTreeMap.Insert(strategy.GetValueKey(value), value, &it); 599 iterator->_SetTo(it);
|
/haiku/src/kits/debugger/debug_managers/ |
H A D | BreakpointManager.cpp | 238 // create a breakpoint, if it doesn't exist yet 302 // if unused remove it 338 for (UserBreakpointList::ConstIterator it 340 UserBreakpoint* userBreakpoint = it.Next();) { 382 for (UserBreakpointList::ConstIterator it 384 UserBreakpoint* userBreakpoint = it.Next();) { 397 for (FunctionInstanceList::ConstIterator it 399 FunctionInstance* functionInstance = it.Next();) { 428 // TODO: Make sure it does at least hit an instruction! 499 // allow setting the breakpoint so it' [all...] |
/haiku/headers/private/shared/ |
H A D | HashMap.h | 137 Value Remove(Iterator& it); 189 Value Remove(Iterator& it) argument 194 return fMap.Remove(it); 385 // does not contain the key yet: create an element and add it 418 HashMap<Key, Value>::Remove(Iterator& it) argument 420 Element* element = it.fElement; 428 it.fElement = NULL;
|
/haiku/src/build/libroot/ |
H A D | fs_attr_untyped.cpp | 161 AttrDirMap::iterator it = sAttributeDirectories.find(fFakeDir); local 162 if (it != sAttributeDirectories.end()) 163 sAttributeDirectories.erase(it); 173 AttrDirMap::iterator it = sAttributeDirectories.find(dir); local 174 if (it == sAttributeDirectories.end()) 176 return it->second; 193 // not a system FD, we need to get a path for it. 205 // A path was given -- check, if it's a symlink. If so we need to 221 // FD was given -- dup it.
|
/haiku/src/tests/kits/net/netservices2/ |
H A D | HttpProtocolTest.cpp | 185 auto it = fields.FindField("Set-Cookie"sv); local 186 CPPUNIT_ASSERT(it != fields.end()); 187 CPPUNIT_ASSERT((*it).Name() == "Set-Cookie"sv); 188 CPPUNIT_ASSERT_EQUAL(defaultFields[2].Value(), (*it).Value()); 191 it = fields.end(); 192 it--; 193 CPPUNIT_ASSERT(it != fields.begin()); 194 CPPUNIT_ASSERT((*it).Name() == "Set-Cookie"sv); 195 CPPUNIT_ASSERT_EQUAL("vfxdrm=9lpqrsvxm; Domain=haiku-os.co.uk"sv, (*it).Value()); 198 it [all...] |
/haiku/src/kits/debugger/model/ |
H A D | ExpressionValues.cpp | 109 for (ValueTable::Iterator it = other.fValues->GetIterator(); 110 ValueEntry* entry = it.Next();) {
|
H A D | StackFrame.cpp | 203 for (ListenerList::Iterator it = fListeners.GetIterator(); 204 Listener* listener = it.Next();) {
|
/haiku/src/tools/elfsymbolpatcher/ |
H A D | ElfImage.cpp | 155 for (ElfRelocationIterator it(&fFile); it.GetNext(&relocation); ) {
|
/haiku/src/apps/haikudepot/ui/ |
H A D | FeaturedPackagesView.cpp | 165 /*! This method will send a message to the Window so that it can signal 210 for (std::vector<PackageInfoRef>::iterator it = fPackages.begin(); 211 it != fPackages.end(); it++) { 212 (*it)->RemoveListener(fPackageListener); 288 // fPackages is sorted and for this reason it is possible to find the 352 std::vector<PackageInfoRef>::const_iterator it local 356 return (it == fPackages.end() || (*it)->Name() != package->Name()) 357 ? -1 : it [all...] |
/haiku/headers/private/netservices/ |
H A D | HttpForm.h | 159 form_content_type _GetType(FormStorage::const_iterator it) const; 160 void _Erase(FormStorage::iterator it);
|
/haiku/src/system/kernel/device_manager/ |
H A D | IOSchedulerSimple.cpp | 45 for (IORequestList::ConstIterator it = requests.GetIterator(); 46 IORequest* request = it.Next();) { 52 for (IORequestList::ConstIterator it = completed_requests.GetIterator(); 53 IORequest* request = it.Next();) { 59 for (IOOperationList::ConstIterator it = operations.GetIterator(); 60 IOOperation* operation = it.Next();) { 229 // TODO: it would be nice to be able to lock the memory later, but we can't 230 // easily do it in the I/O scheduler without being able to asynchronously 308 for (RequestOwnerList::ConstIterator it 310 IORequestOwner* owner = it [all...] |
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/ |
H A D | AttributeIndex.cpp | 280 // rather sparse, it might be a good idea to rather let Volume iterate 345 for (IteratorList::Iterator it = iterators.GetIterator(); 346 Iterator* iterator = it.Next();) { 359 // its place, they will point to it again, otherwise to the node originally 360 // succeeding it. 362 for (IteratorList::Iterator it = iterators.GetIterator(); 363 Iterator* iterator = it.Next();) {
|
/haiku/src/kits/debugger/util/ |
H A D | Worker.cpp | 360 for (JobList::Iterator it = fSuspendedJobs.GetIterator(); it.Next();) { 361 if (it.Current() == job) { 362 it.Remove();
|
/haiku/3rdparty/docker/bootstrap/ |
H A D | Makefile | 23 ${ENGINE} run -it -e TARGET_ARCH=$(TARGET_ARCH) -v bootstrap_work:/work:exec ${EXTRA} docker.io/haiku/bootstrap:${VER} /bin/bash -l
|
/haiku/src/apps/debugger/user_interface/gui/team_window/ |
H A D | BreakpointListView.cpp | 131 UserBreakpointList::ConstIterator it local 134 UserBreakpoint* newBreakpoint = it.Next(); 150 newBreakpoint = it.Next(); 193 newBreakpoint = it.Next();
|
/haiku/src/add-ons/kernel/file_systems/netfs/client/ |
H A D | QueryManager.cpp | 36 for (IteratorMap::Iterator it = fIterators->GetIterator(); it.HasNext();) { 37 IteratorList* iteratorList = it.Next().value; 80 // add it to the map 197 // if the list is empty, remove it completely 263 // if the list is empty now, remove it completely
|
/haiku/src/apps/cortex/Persistence/ |
H A D | Importer.cpp | 288 XML::doc_type_map::iterator it = XML::s_docTypeMap.find( local 291 if(it != XML::s_docTypeMap.end()) 292 m_docType = (*it).second; 389 // see if it matches the topmost object 396 // matched; pop it
|
H A D | XML.cpp | 308 mapping_set::iterator it = m_mappingSet.find(&m); local 310 return (it != m_mappingSet.end()) ? 311 (*it)->create() : 0;
|
/haiku/src/system/boot/loader/net/ |
H A D | IP.cpp | 258 Iterator it(buffer); 261 while (it.HasNext()) { 262 checksum += it.Next();
|
/haiku/src/kits/package/ |
H A D | PackageInfoSet.cpp | 117 for (BPackageInfoSet::Iterator it(this); it.HasNext();) { 118 const BPackageInfo* info = it.Next(); 255 // If our map is shared, just set it to NULL. 262 // Our map is not shared -- make it empty.
|
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | SizeIndex.cpp | 150 NodeTree::Iterator it; local 152 node, &it); 163 it.Remove();
|