/*- * Copyright (c) 2002-2018 The UbixOS Project. * All rights reserved. * * This was developed by Christopher W. Olsen for the UbixOS Project. * * Redistribution and use in source and binary forms, with or without modification, are permitted * provided that the following conditions are met: * * 1) Redistributions of source code must retain the above copyright notice, this list of * conditions, the following disclaimer and the list of authors. * 2) Redistributions in binary form must reproduce the above copyright notice, this list of * conditions, the following disclaimer and the list of authors in the documentation and/or * other materials provided with the distribution. * 3) Neither the name of the UbixOS Project nor the names of its contributors may be used to * endorse or promote products derived from this software without specific prior written * permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, * OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include <vmm/vmm.h> #include <sys/kern_sysctl.h> #include <ubixos/spinlock.h> #include <ubixos/kpanic.h> #include <string.h> static struct spinLock cvsSpinLock = SPIN_LOCK_INITIALIZER; /************************************************************************ Function: void *vmmCopyVirtualSpace(pidType pid); Description: Creates A Copy Of A Virtual Space And Set All NON Kernel Space To COW For A Fork This Will Also Alter The Parents VM Space To Make That COW As Well Notes: 08/02/02 - Added Passing Of pidType pid So We Can Better Keep Track Of Which Task Has Which Physical Pages ************************************************************************/ void *vmm_copyVirtualSpace(pidType pid) { void *newPageDirectoryAddress = 0x0; uInt32 *parentPageDirectory = 0x0, *newPageDirectory = 0x0; uInt32 *parentPageTable = 0x0, *newPageTable = 0x0; uInt32 *parentStackPage = 0x0, *newStackPage = 0x0; uInt16 x = 0, i = 0, s = 0; spinLock(&cvsSpinLock); /* Set Address Of Parent Page Directory */ parentPageDirectory = (uInt32 *) PD_BASE_ADDR; /* Allocate A New Page For The New Page Directory */ if ((newPageDirectory = (uInt32 *) vmm_getFreeKernelPage(pid, 1)) == 0x0) kpanic("Error: newPageDirectory == NULL, File: %s, Line: %i\n", __FILE__, __LINE__); /* Set newPageDirectoryAddress To The Newly Created Page Directories Page */ newPageDirectoryAddress = (void *) vmm_getPhysicalAddr((uInt32) newPageDirectory); /* First Set Up A Flushed Page Directory */ memset(newPageDirectory, 0x0, 0x1000); /* Map The Top 1GB Region Of The VM Space */ for (x = 768; x < PD_ENTRIES; x++) newPageDirectory[x] = parentPageDirectory[x]; /* * Now For The Fun Stuff For Page Tables 1-766 We Must Map These And Set * The Permissions On Every Mapped Pages To COW This Will Conserve Memory * Because The Two VM Spaces Will Be Sharing Some Pages */ for (x = 0x1; x <= PD_INDEX(VMM_USER_END); x++) { /* If Page Table Exists Map It */ if ((parentPageDirectory[x] & PAGE_PRESENT) == PAGE_PRESENT) { /* Set Parent To Propper Page Table */ parentPageTable = (uInt32 *) (PT_BASE_ADDR + (0x1000 * x)); /* Allocate A New Page Table */ if ((newPageTable = (uInt32 *) vmm_getFreeKernelPage(pid, 1)) == 0x0) kpanic("Error: newPageTable == NULL, File: %s, Line: %i\n", __FILE__, __LINE__); /* Set Parent And New Pages To COW */ for (i = 0; i < PD_ENTRIES; i++) { /* If Page Is Mapped */ if ((parentPageTable[i] & PAGE_PRESENT) == PAGE_PRESENT) { /* Check To See If Its A Stack Page */ if (((uInt32) parentPageTable[i] & PAGE_STACK) == PAGE_STACK) { /* Alloc A New Page For This Stack Page */ if ((newStackPage = (uInt32 *) vmm_getFreeKernelPage(pid, 1)) == 0x0) kpanic("Error: newStackPage == NULL, File: %s, Line: %i\n", __FILE__, __LINE__); /* Set Pointer To Parents Stack Page */ parentStackPage = (uInt32 *) (((1024 * 4096) * x) + (4096 * i)); /* Copy The Tack Byte For Byte (I Should Find A Faster Way) */ for (s = 0x0; s < PD_ENTRIES; s++) { newStackPage[s] = parentStackPage[s]; } /* Insert New Stack Into Page Table */ newPageTable[i] = (vmm_getPhysicalAddr((uInt32) newStackPage) | PAGE_DEFAULT | PAGE_STACK); /* Unmap From Kernel Space */ vmm_unmapPage((uInt32) newStackPage, 1); } else { /* Set Page To COW In Parent And Child Space */ newPageTable[i] = (((uInt32) parentPageTable[i] & 0xFFFFF000) | (PAGE_DEFAULT | PAGE_COW)); /* Increment The COW Counter For This Page */ if (((uInt32) parentPageTable[i] & PAGE_COW) == PAGE_COW) { adjustCowCounter(((uInt32) parentPageTable[i] & 0xFFFFF000), 1); } else { adjustCowCounter(((uInt32) parentPageTable[i] & 0xFFFFF000), 2); parentPageTable[i] = newPageTable[i]; } } } else { newPageTable[i] = (uInt32) 0x0; } } /* Put New Page Table Into New Page Directory */ newPageDirectory[x] = (vmm_getPhysicalAddr((uInt32) newPageTable) | PAGE_DEFAULT); /* Unmap Page From Kernel Space But Keep It Marked As Not Avail */ vmm_unmapPage((uInt32) newPageTable, 1); } else { newPageDirectory[x] = (uInt32) 0x0; } } /* * Allocate A New Page For The The First Page Table Where We Will Map The * Lower Region */ if ((newPageTable = (uInt32 *) vmm_getFreeKernelPage(pid, 1)) == 0x0) kpanic("Error: newPageTable == NULL, File: %s, Line: %i\n", __FILE__, __LINE__); /* Flush The Page From Garbage In Memory */ memset(newPageTable, 0x0, 0x1000); /* Map This Into The Page Directory */ newPageDirectory[0] = (vmm_getPhysicalAddr((uInt32) newPageTable) | PAGE_DEFAULT); /* Set Address Of Parents Page Table */ parentPageTable = (uInt32 *) PT_BASE_ADDR; /* Map The First 1MB Worth Of Pages */ for (x = 0; x < (PD_ENTRIES / 4); x++) { newPageTable[x] = parentPageTable[x]; } /* Map The Next 3MB Worth Of Pages But Make Them COW */ for (x = (PD_ENTRIES / 4) + 1; x < PD_ENTRIES; x++) { /* If Page Is Avaiable Map It */ if ((parentPageTable[x] & 0xFFFFF000) != 0x0) { /* Set Pages To COW */ newPageTable[x] = (((uInt32) parentPageTable[x] & 0xFFFFF000) | (PAGE_DEFAULT | PAGE_COW)); /* Increment The COW Counter For This Page */ if (((uInt32) parentPageTable[x] & PAGE_COW) == PAGE_COW) { adjustCowCounter(((uInt32) parentPageTable[x] & 0xFFFFF000), 1); } else { adjustCowCounter(((uInt32) parentPageTable[x] & 0xFFFFF000), 2); parentPageTable[x] = newPageTable[x]; } } else { newPageTable[x] = (uInt32) 0x0; } } /* * * Map Page Directory Into VM Space * First Page After Page Tables * This must be mapped into the page directory before we map all 1024 page directories into the memory space */ newPageTable = (uInt32 *) vmm_getFreePage(pid); newPageDirectory[PD_INDEX(PD_BASE_ADDR)] = (uint32_t) (vmm_getPhysicalAddr((uInt32) newPageTable) | PAGE_DEFAULT); newPageTable[0] = (uint32_t) ((uint32_t) (newPageDirectoryAddress) | PAGE_DEFAULT); //MrOlsen (2017-12-15) - kprintf( "PD3: %i - 0x%X - 0x%X\n", PD_INDEX( PD_BASE_ADDR ), newPageDirectoryAddress, newPageTable[0] ); vmm_unmapPage((uInt32) newPageTable, 1); /* * * Map Page Tables Into VM Space * The First Page Table (4MB) Maps To All Page Directories * */ newPageTable = (uInt32 *) vmm_getFreePage(pid); newPageDirectory[PD_INDEX(PT_BASE_ADDR)] = (uint32_t) (vmm_getPhysicalAddr((uInt32) newPageTable) | PAGE_DEFAULT); /* Flush The Page From Garbage In Memory */ for (x = 0; x < PD_ENTRIES; x++) newPageTable[x] = (uInt32) 0x0; for (x = 0; x < PD_ENTRIES; x++) newPageTable[x] = newPageDirectory[x]; /* Unmap Page From Virtual Space */ vmm_unmapPage((uInt32) newPageTable, 1); /* Now We Are Done With The Page Directory So Lets Unmap That Too */ vmm_unmapPage((uInt32) newPageDirectory, 1); spinUnlock(&cvsSpinLock); /* Return Physical Address Of Page Directory */ return (newPageDirectoryAddress); }