kernel/vm/VMCache.cpp

707 		// remove it
859 /*!	Moves the given page from its current cache inserts it into this cache
892 /*!	Moves the given page from its current cache inserts it into this cache.
926 	for (VMCachePagesTree::Iterator it = pages.GetIterator();
927 			vm_page* page = it.Next();) {
942 		otherwise it won't be locked.
1122 VMCache::_FreePageRange(VMCachePagesTree::Iterator it,
1125 	for (vm_page* page = it.Next();
1127 		page = it.Next()) {
1143 		// remove the page and put it into the free queue
1149 			// unmap it!
1162 	If needed, it will free up all pages that don't belong to the cache anymore.
1163 	The cache lock must be held when you call it.
1167 	Note, this function may temporarily release the cache lock in case it
1200 	If needed, it will free up all pages that don't belong to the cache anymore.
1201 	The cache lock must be held when you call it.
1205 	Note, this function may temporarily release the cache lock in case it
1245 	VMCachePagesTree::Iterator it = source->pages.GetIterator(startPage, true,
1247 	for (vm_page* page = it.Next();
1249 				page = it.Next()) {
1283 		for (VMCachePagesTree::Iterator it = pages.GetIterator();
1284 				vm_page* page = it.Next();) {
1290 				it = pages.GetIterator();
1326 	Basically it returns whether a Read() at \a offset would at least read a
1394 	for (VMCachePagesTree::Iterator it = source->pages.GetIterator();
1395 			vm_page* page = it.Next();) {
1401 			// the page is not yet in the consumer cache - move it upwards
1473 	for (ConsumerList::ConstIterator it = consumers.GetIterator();
1474 		 	VMCache* consumer = it.Next();) {
1480 		for (VMCachePagesTree::ConstIterator it = pages.GetIterator();
1481 				vm_page* page = it.Next();) {
1505 	PageEventWaiter** it = &fPageEventWaiters;
1506 	while (PageEventWaiter* waiter = *it) {
1509 			*it = waiter->next;
1512 			it = &waiter->next;