/haiku/src/apps/bootmanager/ |
H A D | bootman.S | 427 ; ================== Wait for a key and do something with it ================== 513 xor bl, BRIGHT_COLOR_MASK ; Highlight it
|
/haiku/src/system/kernel/arch/ppc/paging/classic/ |
H A D | PPCVMTranslationMapClassic.cpp | 71 shared by all teams. We need to synchronize access to it. Probably via a 200 // we found it 306 // didn't find it, try the secondary hash value 432 // put it in the pgdir 438 // update any other page directories, if it maps kernel space 854 // TODO: As in UnmapPage() we can lose page dirty flags here. ATM it's not 892 for (VMAreaMappings::Iterator it = mappings.GetIterator(); 893 vm_page_mapping* mapping = it.Next();) { 1314 // page hasn't been accessed -- unmap it
|
/haiku/src/system/kernel/arch/ppc/paging/460/ |
H A D | PPCVMTranslationMap460.cpp | 71 shared by all teams. We need to synchronize access to it. Probably via a 200 // we found it 306 // didn't find it, try the secondary hash value 432 // put it in the pgdir 438 // update any other page directories, if it maps kernel space 854 // TODO: As in UnmapPage() we can lose page dirty flags here. ATM it's not 892 for (VMAreaMappings::Iterator it = mappings.GetIterator(); 893 vm_page_mapping* mapping = it.Next();) { 1314 // page hasn't been accessed -- unmap it
|
/haiku/src/system/kernel/arch/m68k/paging/040/ |
H A D | M68KVMTranslationMap040.cpp | 188 // offset the range so it has the worst possible alignment 259 // update any other page roots, if it maps kernel space 629 // TODO: As in UnmapPage() we can lose page dirty flags here. ATM it's not 664 for (VMAreaMappings::Iterator it = mappings.GetIterator(); 665 vm_page_mapping* mapping = it.Next();) { 1047 // page hasn't been accessed -- unmap it
|
H A D | M68KPagingMethod040.cpp | 48 //XXX: make it a class member 53 //XXX: stuff it in the class 97 // XXX: is it ?? (long desc?) 105 #warning M68K: is it correct ? 114 // XXX: is it ?? (long desc?) 439 // insert the indirect descriptor in the tree so we can map the page we want from it. 565 // put it in the pgdir 569 // zero it out in it's new mapping 615 | DT_DIR; // it' [all...] |
/haiku/src/system/kernel/arch/x86/paging/pae/ |
H A D | X86VMTranslationMapPAE.cpp | 307 // lot, since it allows us to just use the upper two page directories 368 // offset the range so it has the worst possible alignment 401 // put it in the page dir 738 // TODO: As in UnmapPage() we can lose page dirty flags here. ATM it's not 771 for (VMAreaMappings::Iterator it = mappings.GetIterator(); 772 vm_page_mapping* mapping = it.Next();) { 1154 // page hasn't been accessed -- unmap it
|
/haiku/src/system/kernel/ |
H A D | team.cpp | 148 // the team_id -> Team hash table and the lock protecting it 152 // the pid_t -> ProcessGroup hash table and the lock protecting it 198 // get the next team -- if there is one, get reference for it 619 // lock it 622 // only return the team, when it isn't already dying 635 it won't be deleted. 641 locked, if it is not the kernel team. 691 it won't be deleted. 700 // If we have a parent, try to lock it. 803 // (for SIGCHLD it' [all...] |
H A D | sem.cpp | 186 ThreadQueue::Iterator it = sem->queue.GetIterator(); local 187 while (queued_thread* entry = it.Next()) 319 spinlock held. Note that it will unlock the spinlock itself. 320 Since it cannot free() the semaphore's name with interrupts turned off, it 465 should not be made public - if possible, we should remove it 502 // remove it from the free list 623 // it. Otherwise we can't unblock any other thread. 631 // acquiration failed and we can just remove it. 758 // TODO: the B_CHECK_PERMISSION flag should be made private, as it [all...] |
H A D | elf.cpp | 417 // if the argument looks like a hex number, treat it as such 554 // if the argument looks like a hex number, treat it as such 666 // base version, if it is public and we're not looking for 672 // FreeBSD implements it, but glibc doesn't handle it 700 // If not hidden, remember the version -- we'll return it, if 701 // it is the only one. 825 // succeed. Weird, but that's how glibc does it. Not unlikely we'll fail 1038 // If we found a symbol -- take it in case we didn't have a symbol 1360 for (VMAddressSpace::AreaIterator it [all...] |
/haiku/src/system/kernel/arch/riscv64/ |
H A D | RISCV64VMTranslationMap.cpp | 277 // we're about to release it for the last time 524 // TODO: As in UnmapPage() we can lose page dirty flags here. ATM it's not 563 for (VMAreaMappings::Iterator it = mappings.GetIterator(); 564 vm_page_mapping* mapping = it.Next();) {
|
/haiku/src/add-ons/kernel/bus_managers/pci/ |
H A D | pci.cpp | 591 for (VirtualBusMap::Iterator it = fVirtualBusMap.Begin(); 592 it != fVirtualBusMap.End(); ++it) { 593 if (it->Value() == value) { 594 *virtualBus = it->Key(); 1751 // when it's non zero
|
/haiku/src/kits/storage/ |
H A D | PathMonitor.cpp | 771 // Normalize the path a bit. We can't use BPath, as it may really normalize 970 // The watch flags for the path (if it exists). Recursively implies 1043 // necessary to keep it up-to-date. E.g. consider the following case: 1047 // If we get the notification after 1. and before 2., we pass it on to the 1048 // client, which may get it after 2. and before 3., thus seeing the file. 1057 // acceptable. Either the client hasn't seen the entry either -- then it 1058 // doesn't matter -- or it likely has ignored a not matching entry anyway. 1255 // it is either a move into/within/out of the path and B_WATCH_DIRECTORY 1293 // let _EntryRemoved() and _EntryCreated() handle it. 1560 // We don't know whether this was a directory, but it [all...] |
/haiku/src/add-ons/kernel/network/protocols/ipv6/ |
H A D | ipv6.cpp | 362 // report an error (in which case we're not responsible for freeing it) 420 // We couldn't merge the fragments, so we need to add it as is 533 \return B_OK if everything went well; if it could reassemble the packet, 534 \a _buffer will point to its buffer, otherwise, it will be \c NULL. 623 // ext. headers like AuthHeader and DestOptions should go after it. 707 // we don't own the last buffer, so we don't have to free it 730 MulticastState::ValueIterator it = sMulticastState->Lookup(std::make_pair( local 733 while (it.HasNext()) { 734 IPv6GroupInterface* state = it.Next(); 994 it mean [all...] |
/haiku/src/add-ons/kernel/network/protocols/ipv4/ |
H A D | ipv4.cpp | 323 // report an error (in which case we're not responsible for freeing it) 381 // We couldn't merge the fragments, so we need to add it as is 534 \return B_OK if everything went well; if it could reassemble the packet, \a _buffer 535 will point to its buffer, otherwise, it will be \c NULL. 673 // we don't own the last buffer, so we don't have to free it 710 MulticastState::ValueIterator it = sMulticastState->Lookup(std::make_pair( local 715 while (it.HasNext()) { 716 IPv4GroupInterface* state = it.Next(); 762 // buffer still has the IP header, and it won't in the 1095 it mean [all...] |
/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/src/kits/debugger/dwarf/ |
H A D | DwarfFile.cpp | 261 // read the augmentation data block -- it is preceeded by an 325 // read the augmentation data block -- it is preceeded by an LEB128 612 // info files properly, therefore always use it off the main 661 for (TypeUnitTable::Iterator it = fTypeUnits.GetIterator(); 662 TypeUnitTableEntry* entry = it.Next();) { 817 // evaluate it 890 // attribute and evaluate it, if present. 1145 // TODO: it should theoretically never happen that we get a duplicate, 1146 // but it wouldn't hurt to check since that situation would potentially 1191 // If the length is 0, it mean [all...] |
/haiku/src/system/kernel/debug/ |
H A D | system_profiler.cpp | 303 // Wake up the user thread, if it is waiting, and mark profiling 531 for (IOSchedulerList::ConstIterator it 533 IOScheduler* scheduler = it.Next();) { 766 // if it had been waiting on a condition variable, since then we'd likely 767 // deadlock in ConditionVariable::NotifyOne(), as it acquires a static 909 // initial scan, but were still in the process of dying. ATM it is not 991 // initial scan, but were still in the process of dying. ATM it is not 1214 // If found, remove it and add it to the free list. This might sound weird, 1215 // but it make [all...] |
/haiku/src/system/kernel/cache/ |
H A D | file_cache.cpp | 48 // TODO: it would probably be enough to only store the least 313 for (VMCachePagesTree::Iterator it = cache->pages.GetIterator(); 314 (page = it.Next()) != NULL && left > 0;) { 370 sure that it matches that criterion. 372 operation it will unlock the cache, though. 491 To preserve data consistency, it might also read pages into the cache, 563 // need to fetch the last page before we can update it 814 // it busy for the time. 851 // If it is cached only, requeue the page, so the respective queue 1045 // get the vnode for the object, this also grabs a ref to it [all...] |
/haiku/src/system/libroot/posix/glibc/libio/ |
H A D | genops.c | 4 The GNU C Library is free software; you can redistribute it and/or 5 modify it under the terms of the GNU Lesser General Public 9 The GNU C Library is distributed in the hope that it will be useful, 931 /* Iff stream is un-orientated, it wasn't used. */ 950 So it is possible that other static destructors might want to 997 it now, or wait until the next underflow?
|
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | Query.cpp | 12 it shares no code. 29 // The parser has a very static design, but it will do what is required. 111 The type/size of the value, the score, and if it has an index or not. 112 So you could run more than one query on the same volume, but it might return 113 wrong values when it runs concurrently on another volume. 366 Returns MATCH_OK if it matches, NO_MATCH if not, < 0 if something went 456 // prepare own value for use, if it is possible to convert it 494 // Special case for OP_UNEQUAL - it will always operate through the whole 529 // At this point, fIsPattern is only true if it' [all...] |
/haiku/src/system/kernel/arch/m68k/ |
H A D | arch_vm_translation_map_impl.cpp | 178 // XXX: is it ?? (long desc?) 186 #warning M68K: is it correct ? 195 // XXX: is it ?? (long desc?) 217 // this is used before the vm is fully up, it uses the 271 in case it's the first locking recursion. 299 // we're about to release it for the last time 319 // remove it from the tmap list 400 // put it in the pgdir 410 // we intend to port it to a platform that does not support this. 423 // put it i [all...] |
/haiku/src/add-ons/kernel/file_systems/userlandfs/kernel_add_on/ |
H A D | Volume.cpp | 45 // is sending a request, this is the time after which it shall time out 444 // The node is not yet known -- create it. 466 // The node was known, i.e. it had been made known via new_vnode() 480 // has 1 from new_vnode() and this publish_vnode() didn't increment it. 483 // New node: increment its use count and add it to the map. 811 // fetch the root node, so that we can serve Walk() requests on it, 816 // problem -- not only because we don't have it, but also because 1147 // At any rate remove the vnode from our map and delete it. We don't do that 1360 // about it. 1371 // If the buffer shall indeed specify a buffer, check it [all...] |
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/fuse/ |
H A D | FUSEVolume.cpp | 838 FUSENodeTable::Iterator it = fNodes.GetIterator(); local 839 while (FUSENode* node = it.Next()) { 843 // node is dirty -- we have to sync it 1661 // TODO do we really need it? 1745 // FIXME store this in the FileCookie for lowlevel streams, we'll need it in read, write... 1813 // but a subsequent `open` on the same node indicates that it is 1901 // no need to lock the cookie here, as no-one else uses it anymore 2260 // The request filler may or may not be used. If the filesystem decides that it has 2261 // already cached the directory, it can reply with an already filled buffer from a 2444 // attributes listing changed -- reread it [all...] |
/haiku/src/kits/tracker/ |
H A D | PoseView.cpp | 767 // because it gets saved on the boot disk but the above checks 911 std::set<thread_id>::iterator it; local 912 for (it = addPosesThreads.begin(); it != addPosesThreads.end(); it++) { 914 wait_for_thread(*it, NULL); 1268 // the entries that it adds 1306 // Also, this class represents the entire BMessenger, not just it's 1712 // want it on the desktop or in the disks window. 1854 // the viewBounds top, it mean [all...] |
/haiku/src/build/libgnuregex/ |
H A D | regex.c | 8 This program is free software; you can redistribute it and/or modify 9 it under the terms of the GNU General Public License as published by 13 This program is distributed in the hope that it will be useful, 176 function it is called in. */ 273 start_memory only because we need it in the on_failure_jump 277 /* Stop remembering the text that is matched and store it in a 326 already matched, then we change it to a pop_failure_jump. 332 is made to use it for a failure. A `+' construct makes this 454 it is doing (if the variable `debug' is nonzero). If linked with the 514 the START pointer into it an [all...] |