/*****************************************************************************************
Copyright (c) 2002 The UbixOS Project
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are
permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this list of
conditions, the following disclaimer and the list of authors. 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. 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 COPYRIGHT HOLDERS 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.
$Log$
Revision 1.1.1.1 2004/04/15 12:06:52 reddawg
UbixOS v1.0
Revision 1.27 2004/04/13 16:36:34 reddawg
Changed our copyright, it is all now under a BSD-Style license
$Id$
*****************************************************************************************/
#include <vmm/vmm.h>
#include <sys/io.h>
#include <ubixos/kpanic.h>
#include <lib/kprintf.h>
#include <lib/kmalloc.h>
#include <ubixos/vitals.h>
mMap *vmmMemoryMap = (mMap *) 0x101000;
int numPages = 0x0;
uInt32 freePages = 0;
/************************************************************************
Function: void vmmMemMapInit();
Description: This Function Initializes The Memory Map For the System
Notes:
02/20/2004 - Made It Report Real And Available Memory
************************************************************************/
int
vmmMemMapInit()
{
int i = 0x0, memStart = 0x0;
/* Count System Memory */
numPages = countMemory();
/* Set Memory Map To Point To First Physical Page That We Will Use */
vmmMemoryMap = (mMap *) 0x101000;
/* Initialize Map Make All Pages Not Available */
for (i = 0x0; i < numPages; i++) {
vmmMemoryMap[i].cowCounter = 0x0;
vmmMemoryMap[i].status = memNotavail;
vmmMemoryMap[i].pid = vmmID;
vmmMemoryMap[i].pageAddr = i * 4096;
}
/* Calculate Start Of Free Memory */
memStart = (0x101000 / 0x1000);
memStart += (((sizeof(mMap) * numPages) + (sizeof(mMap) - 1)) / 0x1000);
/* Initialize All Free Pages To Available */
vmmMemoryMap[(0x100000 / 0x1000)].status = memAvail;
freePages++;
for (i = memStart; i < numPages; i++) {
vmmMemoryMap[i].status = memAvail;
freePages++;
}
/* Print Out Amount Of Memory */
kprintf("Real Memory: %iKB\n", numPages * 4);
kprintf("Available Memory: %iKB\n", freePages * 4);
/* Return */
return (0);
}
/************************************************************************
Function: int countMemory();
Description: This Function Counts The Systems Physical Memory
Notes:
02/20/2004 - Inspect For Quality And Approved
************************************************************************/
int
countMemory()
{
register uInt32 *mem = 0x0;
unsigned long memCount = -1, tempMemory = 0x0;
unsigned short memKb = 0;
unsigned char irq1State, irq2State;
unsigned long cr0 = 0x0;
/*
* Save The States Of Both IRQ 1 And 2 So We Can Turn Them Off And Restore
* Them Later
*/
irq1State = inportByte(0x21);
irq2State = inportByte(0xA1);
/* Turn Off IRQ 1 And 2 To Prevent Chances Of Faults While Examining Memory */
outportByte(0x21, 0xFF);
outportByte(0xA1, 0xFF);
/* Save The State Of Register CR0 */
asm volatile (
"movl %%cr0, %%ebx\n"
: "=a" (cr0)
:
: "ebx"
);
asm volatile ("wbinvd");
asm volatile (
"movl %%ebx, %%cr0\n"
:
: "a" (cr0 | 0x00000001 | 0x40000000 | 0x20000000)
: "ebx"
);
while (memKb < 4096 && memCount != 0) {
memKb++;
if (memCount == -1)
memCount = 0;
memCount += 1024 * 1024;
mem = (unsigned long *)memCount;
tempMemory = *mem;
*mem = 0x55AA55AA;
asm("": : :"memory");
if (*mem != 0x55AA55AA) {
memCount = 0;
} else {
*mem = 0xAA55AA55;
asm("": : :"memory");
if (*mem != 0xAA55AA55) {
memCount = 0;
}
}
asm("": : :"memory");
*mem = tempMemory;
}
asm volatile (
"movl %%ebx, %%cr0\n"
:
: "a" (cr0)
: "ebx"
);
/* Restore States For Both IRQ 1 And 2 */
outportByte(0x21, irq1State);
outportByte(0xA1, irq2State);
/* Return Amount Of Memory In Pages */
return ((memKb * 1024 * 1024) / 4096);
}
/************************************************************************
Function: uInt32 vmmFindFreePage(pid_t pid);
Description: This Returns A Free Physical Page Address Then Marks It
Not Available As Well As Setting The PID To The Proccess
Allocating This Page
Notes:
************************************************************************/
uInt32
vmmFindFreePage(pidType pid)
{
int i = 0x0;
/* Lets Look For A Free Page */
if (pid < sysID) {
kpanic("Error: invalid PID\n");
}
for (i = 0; i <= numPages; i++) {
/*
* If We Found A Free Page Set It To Not Available After That Set Its Own
* And Return The Address
*/
if ((vmmMemoryMap[i].status == memAvail) && (vmmMemoryMap[i].cowCounter == 0)) {
vmmMemoryMap[i].status = memNotavail;
vmmMemoryMap[i].pid = pid;
freePages--;
systemVitals->freePages = freePages;
return (vmmMemoryMap[i].pageAddr);
}
}
/* If No Free Memory Is Found Return NULL */
kpanic("Out Of Memory!!!!");
return (0x0);
}
/************************************************************************
Function: int freePage(uInt32 pageAddr);
Description: This Function Marks The Page As Free
Notes:
************************************************************************/
int
freePage(uInt32 pageAddr)
{
int pageIndex = 0x0;
/* Find The Page Index To The Memory Map */
pageIndex = (pageAddr / 4096);
/* Check If Page COW Is Greater Then 0 If It Is Dec It If Not Free It */
if (vmmMemoryMap[pageIndex].cowCounter == 0) {
/* Set Page As Avail So It Can Be Used Again */
vmmMemoryMap[pageIndex].status = memAvail;
vmmMemoryMap[pageIndex].cowCounter = 0x0;
vmmMemoryMap[pageIndex].pid = -2;
freePages++;
} else {
/* Adjust The COW Counter */
adjustCowCounter(((uInt32) vmmMemoryMap[pageIndex].pageAddr), -1);
}
/* Return */
return (0);
}
/************************************************************************
Function: int adjustCowCounter(uInt32 baseAddr,int adjustment);
Description: This Adjust The COW Counter For Page At baseAddr It Will
Error If The Count Goes Below 0
Notes:
08/01/02 - I Think If Counter Gets To 0 I Should Free The Page
************************************************************************/
int
adjustCowCounter(uInt32 baseAddr, int adjustment)
{
int vmmMemoryMapIndex = (baseAddr / 4096);
/* Adjust COW Counter */
vmmMemoryMap[vmmMemoryMapIndex].cowCounter += adjustment;
/*
* kprintf("(%i[%i]%x)\n",vmmMemoryMapIndex,vmmMemoryMap[vmmMemoryMapIndex].cowCounte
* r,baseAddr);
*/
if (vmmMemoryMap[vmmMemoryMapIndex].cowCounter == 0) {
vmmMemoryMap[vmmMemoryMapIndex].status = memAvail;
vmmMemoryMap[vmmMemoryMapIndex].cowCounter = 0x0;
vmmMemoryMap[vmmMemoryMapIndex].pid = vmmID;
freePages++;
}
/* Return */
return (0);
}
/************************************************************************
Function: void freeProcessPages(pid_t pid);
Description: This Function Will Free Up Memory For The Exiting Process
Notes:
08/04/02 - Added Checking For COW Pages First
************************************************************************/
void vmmFreeProcessPages(pidType pid) {
int i=0,x=0;
uInt32 *tmpPageTable = 0x0;
uInt32 *tmpPageDir = (uInt32 *)parentPageDirAddr;
//Check Page Directory For An Avail Page Table
for (i=0;i<=0x300;i++) {
if (tmpPageDir[i] != 0) {
//Set Up Page Table Pointer
tmpPageTable = (uInt32 *)(tablesBaseAddress + (i * 0x1000));
//Check The Page Table For COW Pages
for (x=0;x<pageEntries;x++) {
//If The Page Is COW Adjust COW Counter
if (((uInt32)tmpPageTable[x] & pageCow) == pageCow) {
adjustCowCounter(((uInt32)tmpPageTable[x] & 0xFFFFF000),-1);
}
}
}
}
//Loop Through Pages To Find Pages Owned By Process
for (i=0;i<numPages;i++) {
if (vmmMemoryMap[i].pid == pid) {
//Check To See If The cowCounter Is Zero If So We Can Ree It
if (vmmMemoryMap[i].cowCounter == 0) {
vmmMemoryMap[i].status = memAvail;
vmmMemoryMap[i].cowCounter = 0x0;
vmmMemoryMap[i].pid = -3;
freePages++;
systemVitals->freePages = freePages;
}
}
}
//Return
}
/***
END
***/
