/haiku/3rdparty/mmu_man/onlinedemo/ |
H A D | haiku.php | 24 // you must *copy* (apache doesn't seem to like symlinks) it there. 35 // else you can get it from http://www.tightvnc.com/download-old.php : 743 echo "make sure you have a JVM and it's enabled!<br />\n";
|
/haiku/docs/develop/kits/storage/resources/ |
H A D | ResourcesFormat.tex | 47 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/headers/private/firewire/ |
H A D | firewirereg.h | 173 *arq, *atq, *ars, *ats, *it[FW_MAX_DMACH],*ir[FW_MAX_DMACH]; member in struct:firewire_comm
|
/haiku/headers/private/kernel/ |
H A D | listeners.h | 46 SchedulerListenerList::Iterator it = gSchedulerListeners.GetIterator(); local 47 while (SchedulerListener* listener = it.Next()) 60 SchedulerListenerList::Iterator it = gSchedulerListeners.GetIterator(); local 61 while (SchedulerListener* listener = it.Next()) 93 WaitObjectListenerList::Iterator it local 95 while (WaitObjectListener* listener = it.Next()) 109 WaitObjectListenerList::Iterator it local 111 while (WaitObjectListener* listener = it.Next())
|
/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;
|
H A D | HashSet.h | 126 bool Remove(Iterator& it); 252 // does not contain the key yet: create an element and add it 284 HashSet<Key>::Remove(Iterator& it) argument 286 Element* element = it.fElement; 292 it.fElement = NULL;
|
/haiku/headers/private/storage/ |
H A D | AddOnMonitorHandler.h | 36 // from or renamed in a directory and it has previously shadowed another 39 // it can cause another add-on to become disabled, if it has the same name. 91 EntryList::iterator& it) const; 94 EntryList::iterator& it) const; 102 DirectoryList::iterator& it) const; 105 DirectoryList::iterator& it) const; 107 DirectoryList::iterator& it, 112 DirectoryList::iterator& it,
|
/haiku/headers/tools/cppunit/ |
H A D | ThreadedTestCaller.h | 82 for (typename ThreadManagerMap::iterator it = fThreads.begin(); it != fThreads.end (); ++it) { 83 delete it->second; 155 // (this code right here), blocks on a semaphore that it 157 // If it times out, it checks the NextSubTest() queue, prints 159 // again. When it finally manages to acquire it, all the 160 // test threads have terminated, and it' [all...] |
/haiku/src/add-ons/kernel/bus_managers/firewire/ |
H A D | fwohcivar.h | 63 } arrq, arrs, atrq, atrs, it[OHCI_DMA_ITCH], ir[OHCI_DMA_IRCH]; member in struct:fwohci_softc
|
/haiku/src/add-ons/kernel/busses/scsi/usb/ |
H A D | TODO | 17 #10) Make reservation of devices more flexible (can switch it off). 34 27)(???) Looks like system ignores our CHECK_CONDITION (for example on handling 1e, 1b, 2a). Is it our problem? 38 31) Work with NewFS Tracker and it's derivatives. There are lot of problems with that mad software. 39 #32) deactivate automatic READ(10)->READ(6) switching. Looks like it's makes more problems than solves. 50 #-INVALID!-43) What with sense data? should it be reorganized as MODE_SENSE/MODE_SELECT one? 59 #-INVALID-52)Some kind of reset required for FREECOM. Test it until this MODE_SELECT is not working! 66 57) Write a ReadMe.html for FREECOM module and make distribution support for it.
|
/haiku/src/add-ons/kernel/drivers/bus/firewire/ |
H A D | fw_raw.c | 85 struct fw_xferq *it; member in struct:fw_drv1 264 if (d->it != NULL) { 265 struct fw_xferq *it = d->it; local 267 if ((it->flag & FWXFERQ_OPEN) == 0) 269 if (it->flag & FWXFERQ_RUNNING) { 270 it->flag &= ~FWXFERQ_RUNNING; 271 fc->itx_disable(fc, it->dmach); 274 fwdev_freebuf(it); 275 it 548 struct fw_xferq *it; local 663 struct fw_xferq *ir, *it; local [all...] |
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/contrib/ath_hal/ar9300/ |
H A D | ar9300_eeprom.c | 170 int it; local 210 for (it = ar9300_eeprom_struct_default_many() - 1; it >= 0; it--) { 211 dptr = ar9300_eeprom_struct_default(it); 421 /* need it to let art save in to flash ????? */ 438 /* need it to let art save in to flash ????? */ 669 /* only low is good, use it */ 673 /* only high is good, use it */ 1969 * If it' 3612 int it; local 3728 int it; local 3853 int it; local 3888 int it; local 3925 int it; local 4365 int it; local [all...] |
/haiku/src/add-ons/kernel/file_systems/netfs/authentication_server/ |
H A D | AuthenticationServer.cpp | 119 for (AuthenticationMap::Iterator it = fAuthentications.GetIterator(); 120 it.HasNext();) { 121 delete it.Next().value; 148 // check, if an entry already exists for the share -- if it does, 149 // just set it 281 for (ServerEntryMap::Iterator it = fServerEntries->GetIterator(); 282 it.HasNext();) { 283 delete it.Next().value; 348 // we need to ask the user: create a task that does it
|
/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
|
H A D | ServerManager.cpp | 195 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
|
H A D | ShareAttrDir.cpp | 262 // oldAttr is obsolete: move all iterators pointing to it to the 360 for (SLList<Attribute>::Iterator it = fAttributes.GetIterator(); 361 it.HasNext();) { 362 Attribute* attribute = it.Next(); 364 it.Remove(); 391 for (SLList<Attribute>::ConstIterator it = fAttributes.GetIterator(); 392 it.HasNext();) { 393 Attribute* attribute = it.Next();
|
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/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | SLList.h | 255 for (Iterator it = GetIterator(); it.HasNext();) { 256 if (element == it.Next()) { 257 it.Remove();
|
/haiku/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | AttributeDirectory.cpp | 216 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 D | SecurityContext.cpp | 204 // 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 D | StatisticsManager.cpp | 62 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;
|
H A D | Volume.cpp | 24 // 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...] |
/haiku/src/add-ons/kernel/file_systems/netfs/shared/ |
H A D | AbstractConnection.cpp | 30 for (ChannelVector::Iterator it = fDownStreamChannels.Begin(); 31 it != fDownStreamChannels.End(); 32 it++) { 33 delete *it; 37 for (ChannelVector::Iterator it = fUpStreamChannels.Begin(); 38 it != fUpStreamChannels.End(); 39 it++) { 40 delete *it; 62 for (ChannelVector::Iterator it = fDownStreamChannels.Begin(); 63 it ! [all...] |
/haiku/src/add-ons/kernel/file_systems/nfs4/ |
H A D | MetadataCache.cpp | 94 AVLTreeMap<uid_t, AccessEntry>::Iterator it = fAccessCache.Find(uid); local 95 if (!it.HasCurrent()) 99 it.CurrentValuePointer()->fForceValid = false; 101 if (!it.Current().fForceValid && it.Current().fExpire < time(NULL)) { 102 it.Remove(); 106 *allowed = it.Current().fAllowed; 116 AVLTreeMap<uid_t, AccessEntry>::Iterator it = fAccessCache.Find(uid); local 117 if (it.HasCurrent()) 118 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();) {
|