Searched refs:it (Results 51 - 75 of 325) sorted by relevance

1234567891011>>

/haiku/src/tests/kits/storage/
H A DBasicTest.cpp21 for (set<int>::iterator it = fds.begin(); it != fds.end(); it++)
22 close(*it);
/haiku/src/apps/cortex/NodeManager/
H A DNodeRef.cpp344 vector<Connection>::iterator it = outputConnections.begin();
345 it != outputConnections.end(); ++it) {
347 bigtime_t bufferDur = buffer_duration((*it).format().u.raw_audio);
373 NodeManager::con_map::iterator it, itEnd; local
374 it = m_manager->m_conDestinationMap.lower_bound(m_info.node.node);
377 for(; it != itEnd; ++it) {
379 (*it).second->format().type == filterType) {
381 ioConnections.push_back(*((*it)
394 NodeManager::con_map::iterator it, itEnd; local
418 NodeManager::con_map::iterator it, itEnd; local
444 NodeManager::con_map::iterator it, itEnd; local
737 vector<media_input>::const_iterator it; local
778 vector<media_output>::const_iterator it; local
883 vector<media_input>::const_iterator it; local
910 vector<media_input>::const_iterator it; local
936 vector<media_output>::const_iterator it; local
962 vector<media_output>::const_iterator it; local
[all...]
H A DNodeGroup.cpp65 // free the group, including all nodes within it
196 // add it
256 // the manager lock applies to it
275 // remove it
441 // +++++ if a previously-set start position was deferred, it won't be
457 // it must take effect retroactively (if it's before the current
505 // for(node_set::iterator it = m_cycleNodes.begin();
506 // it != m_cycleNodes.end(); ++it) {
1537 node_set::iterator it; local
1556 node_set::iterator it = find( local
[all...]
/haiku/src/add-ons/kernel/file_systems/netfs/server/
H A DVolume.cpp24 // NOTE: This class doesn't make a copy of the name string it is constructed
103 for (EntryMap::Iterator it = fEntries->GetIterator(); it.HasNext();) {
104 Entry* entry = it.Next().value;
112 // remove the root dir -- we delete it separately
117 for (NodeMap::Iterator it = fNodes->GetIterator(); it.HasNext();) {
118 Node* node = it.Next().value;
241 NodeMap::Iterator it = fNodes->GetIterator(); local
242 if (it
282 EntryMap::Iterator it = fEntries->GetIterator(); local
[all...]
H A DAttributeDirectory.cpp216 for (SLList<Attribute>::Iterator it = fAttributes.GetIterator();
217 it.HasNext();) {
218 Attribute* attribute = it.Next();
220 it.Remove();
268 for (SLList<Attribute>::Iterator it = fAttributes.GetIterator();
269 it.HasNext();) {
270 Attribute* attribute = it.Next();
272 it.Remove();
325 for (SLList<Attribute>::ConstIterator it = fAttributes.GetIterator();
326 it
[all...]
H A DSecurityContext.cpp204 // if a path is not given, retrieve it
470 for (UserMap::Iterator it = fUsers->GetIterator(); it.HasNext();) {
471 User* user = it.Next().value;
476 for (ShareMap::Iterator it = fShares->GetIterator(); it.HasNext();) {
477 Share* share = it.Next().value;
499 for (UserMap::Iterator it = fUsers->GetIterator(); it.HasNext();) {
500 User* user = it
[all...]
H A DStatisticsManager.cpp62 for (UserCountMap::Iterator it = fUsers.GetIterator(); it.HasNext();) {
63 HashString user(it.Next().key);
94 for (ShareStatisticsMap::Iterator it = fShareStatistics->GetIterator();
95 it.HasNext();) {
96 ShareStatistics* statistics = it.Next().value;
/haiku/src/add-ons/print/drivers/gutenprint/
H A DGPCapabilities.cpp118 DriverSpecificCapabilitiesType::const_iterator it = local
120 if (it == fDriverSpecificCapabilities.end())
122 return &it->second;
/haiku/src/apps/cortex/Persistence/
H A DImportContext.cpp67 list<BString>::const_reverse_iterator it = m_elementStack.rbegin();
68 ++it;
69 return (*it).String();
/haiku/src/system/kernel/
H A Dboot_item.cpp53 for (ItemList::Iterator it = sItemList.GetIterator(); it.HasNext();) {
54 boot_item *item = it.Next();
73 // so we have to do it here, manually
/haiku/src/system/kernel/fs/
H A DVnode.cpp41 // The lock holder dropped it in the meantime and no-one else was faster
42 // than us, so it's ours now. Just mark the node locked and clear the
72 for (LockWaiterList::Iterator it = bucket.waiters.GetIterator();
73 LockWaiter* someWaiter = it.Next();) {
80 it.Remove();
90 // and wake it up
/haiku/src/servers/package/
H A DJobQueue.cpp110 for (JobList::Iterator it = fJobs.GetIterator(); Job* job = it.Next();) {
112 it.Remove();
H A DCommitTransactionHandler.cpp168 for (PackageSet::const_iterator it = packagesAlreadyAdded.begin();
169 it != packagesAlreadyAdded.end(); ++it) {
170 Package* package = fVolumeState->FindPackage((*it)->FileName());
174 for (PackageSet::const_iterator it = packagesAlreadyRemoved.begin();
175 it != packagesAlreadyRemoved.end(); ++it) {
176 Package* package = fVolumeState->FindPackage((*it)->FileName());
226 // processing, since it's usually an internal to package_daemon
227 // operation and there is no external client to clean it u
[all...]
/haiku/src/kits/network/libnetservices/
H A DHttpForm.cpp292 for (FormStorage::const_iterator it = fFields.begin();
293 it != fFields.end(); it++) {
294 const BHttpFormData* currentField = &it->second;
325 for (FormStorage::const_iterator it = fFields.begin();
326 it != fFields.end(); it++) {
327 const BHttpFormData* currentField = &it->second;
447 FormStorage::iterator it = fFields.find(fieldName); local
449 if (it
468 FormStorage::iterator it = fFields.find(fieldName); local
506 FormStorage::const_iterator it = fFields.find(fieldName); local
[all...]
/haiku/src/apps/haikudepot/textview/
H A DParagraph.cpp237 // See if anything from the TextSpan at offset remained, keep it as empty
238 // span if it is the last remaining span.
277 std::vector<TextSpan>::const_iterator it; local
278 for (it = fTextSpans.begin(); it != fTextSpans.end(); it++) {
279 const TextSpan& span = *it;
310 std::vector<TextSpan>::const_iterator it; local
311 for (it = fTextSpans.begin(); it !
338 std::vector<TextSpan>::const_iterator it; local
[all...]
/haiku/src/servers/power/
H A Dpower_daemon.cpp109 for (std::set<int>::iterator it = fds.begin(); it != fds.end(); ++it) {
110 info[index].object = *it;
113 descriptorMap[*it] = fPowerMonitors[i];
/haiku/src/system/boot/platform/efi/arch/riscv64/
H A Darch_dtb.cpp87 for (uint32 *it = prop; (uint8_t*)it - (uint8_t*)prop < propSize; it += 2) {
88 uint32 phandle = fdt32_to_cpu(*it);
89 uint32 interrupt = fdt32_to_cpu(*(it + 1));
/haiku/src/tests/system/kernel/util/
H A DVectorTest.cpp241 typename vector<Value>::iterator it = fReferenceVector.begin(); local
243 ++it;
244 fReferenceVector.insert(it, value);
267 for (ReferenceIterator it = fReferenceVector.begin();
268 it != fReferenceVector.end();) {
269 if (*it == value)
270 it = fReferenceVector.erase(it);
272 ++it;
287 ReferenceIterator it local
378 ReferenceIterator it = fReferenceVector.begin(); local
392 ReferenceIterator it = fReferenceVector.begin(); local
417 ReferenceConstIterator it = fReferenceVector.begin(); local
891 typename TestVector<Value>::Iterator it = v.Find(value); local
930 typename TestVector<Value>::Iterator it = v.Begin(); local
[all...]
/haiku/src/servers/registrar/
H A DClipboardHandler.cpp49 for (ClipboardMap::iterator it = fClipboards->begin();
50 it != fClipboards->end();
51 ++it)
52 delete it->second;
196 /*! \brief Gets the clipboard with the specified name, or adds it, if not yet
209 ClipboardMap::iterator it = fClipboards->find(name); local
210 if (it != fClipboards->end()) {
211 clipboard = it->second;
H A DAuthenticationManager.cpp420 for (StringSet::const_iterator it = fMembers.begin();
421 it != fMembers.end(); ++it) {
422 members[count++] = store.AppendString(it->c_str());
445 for (StringSet::const_iterator it = fMembers.begin();
446 it != fMembers.end(); ++it) {
447 if ((error = message.AddString("members", it->c_str())) != B_OK)
458 for (StringSet::const_iterator it = fMembers.begin();
459 it !
504 map<uid_t, User*>::const_iterator it = fUsersByID.find(uid); local
510 map<string, User*>::const_iterator it = fUsersByName.find(name); local
633 map<gid_t, Group*>::const_iterator it = fGroupsByID.find(gid); local
639 map<string, Group*>::const_iterator it = fGroupsByName.find(name); local
[all...]
/haiku/src/add-ons/kernel/busses/pci/ecam/
H A DECAMPCIControllerFDT.cpp40 for (uint32_t *it = (uint32_t*)prop; (uint8_t*)it - (uint8_t*)prop < propLen; it += 7) {
42 uint32_t type = B_BENDIAN_TO_HOST_INT32(*(it + 0));
43 uint64_t childAdr = B_BENDIAN_TO_HOST_INT64(*(uint64_t*)(it + 1));
44 uint64_t parentAdr = B_BENDIAN_TO_HOST_INT64(*(uint64_t*)(it + 3));
45 uint64_t len = B_BENDIAN_TO_HOST_INT64(*(uint64_t*)(it + 5));
/haiku/src/add-ons/kernel/bus_managers/fdt/
H A Dfdt_module.cpp228 // gFDT is stored in kernel_args and will be freed, so copy it to kernel heap.
618 uint32_t *it = (uint32_t*)intMapAddr; local
619 while ((uint8_t*)it - (uint8_t*)intMapAddr < intMapLen) {
622 irqEntry.childAddr = B_BENDIAN_TO_HOST_INT32(*it);
623 it += addressCells;
625 irqEntry.childIrq = B_BENDIAN_TO_HOST_INT32(*it);
626 it += interruptCells;
628 irqEntry.parentIrqCtrl = B_BENDIAN_TO_HOST_INT32(*it);
629 it += phandleCells;
645 it
[all...]
/haiku/src/add-ons/print/transports/ipp/
H A DHttpURLConnection.cpp175 for (Fields::iterator it = __response->begin(); it != __response->end(); it++) {
176 if ((*it).key == s) {
177 return (*it).value.c_str();
219 for (Fields::iterator it = __request->begin(); it != __request->end(); it++) {
220 os << (*it).key << ": " << (*it)
[all...]
/haiku/src/add-ons/kernel/file_systems/packagefs/volume/
H A DPackageFSRoot.cpp119 // stat it
248 for (ResolvableList::ConstIterator it
250 Resolvable* resolvable = it.Next();) {
274 for (DependencyList::ConstIterator it
276 Dependency* dependency = it.Next();) {
313 for (DependencyList::ConstIterator it
315 Dependency* dependency = it.Next();) {
335 for (ResolvableList::ConstIterator it
337 Resolvable* resolvable = it.Next();) {
366 for (ResolvableDependencyList::Iterator it
[all...]
/haiku/src/system/boot/platform/efi/
H A Ddtb.cpp160 for (uint64_t *it = (uint64_t*)property->data; (uint8_t*)it - (uint8_t*)property->data < fdt32_to_cpu(property->len); it += 2) {
161 if (it != (uint64_t*)property->data)
164 fdt64_to_cpu(*it), fdt64_to_cpu(*(it + 1)));
189 for (uint32_t *it = (uint32_t*)property->data; (uint8_t*)it - (uint8_t*)property->data < fdt32_to_cpu(property->len); it += 2) {
190 if (it !
221 uint32_t *it = (uint32_t*)property->data; local
252 uint32_t *it = (uint32_t*)property->data; local
[all...]

Completed in 412 milliseconds

1234567891011>>