2009-01-13 04:40:13 +05:00
|
|
|
#include <iostream>
|
|
|
|
#include <iomanip>
|
|
|
|
|
|
|
|
#include <myadt.hpp>
|
|
|
|
using namespace std;
|
|
|
|
namespace netgen
|
|
|
|
{
|
|
|
|
|
|
|
|
NgMutex mem_mutex;
|
|
|
|
|
|
|
|
size_t BaseMoveableMem::totalsize = 0; // 500000000;
|
|
|
|
size_t BaseMoveableMem::used = 0;
|
|
|
|
char * BaseMoveableMem::largeblock = 0;
|
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
BaseMoveableMem * BaseMoveableMem::first = NULL;
|
|
|
|
BaseMoveableMem * BaseMoveableMem::last = NULL;
|
2009-01-13 04:40:13 +05:00
|
|
|
|
|
|
|
|
|
|
|
BaseMoveableMem :: BaseMoveableMem (size_t s)
|
|
|
|
{
|
|
|
|
// Print ();
|
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
prev = last;
|
|
|
|
next = 0;
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
if (last) last->next = this;
|
|
|
|
last = this;
|
|
|
|
if (!first) first = this;
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
size = 0;
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
if (prev)
|
|
|
|
pos = prev->pos + prev->size;
|
|
|
|
else
|
|
|
|
pos = 0;
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
ptr = 0;
|
|
|
|
name = NULL;
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
if (s) Alloc(s);
|
|
|
|
}
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
BaseMoveableMem :: ~BaseMoveableMem () throw()
|
|
|
|
{
|
|
|
|
Free();
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
if (next) next->prev = prev;
|
|
|
|
else last = prev;
|
|
|
|
if (prev) prev->next = next;
|
|
|
|
else first = next;
|
|
|
|
|
|
|
|
if(name != NULL)
|
|
|
|
{
|
|
|
|
delete [] name;
|
|
|
|
name = NULL;
|
|
|
|
}
|
|
|
|
}
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
void BaseMoveableMem :: SetName (const char * aname)
|
|
|
|
{
|
|
|
|
if(name != NULL)
|
|
|
|
{
|
|
|
|
delete [] name;
|
|
|
|
name = NULL;
|
|
|
|
}
|
|
|
|
if (aname)
|
|
|
|
{
|
|
|
|
name = new char[strlen(aname)+1];
|
|
|
|
strcpy (name, aname);
|
|
|
|
}
|
|
|
|
}
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
|
|
|
|
void BaseMoveableMem :: Alloc (size_t s)
|
|
|
|
{
|
|
|
|
if (totalsize == 0)
|
|
|
|
{
|
|
|
|
size = s;
|
|
|
|
//ptr = (char*) malloc(s);
|
|
|
|
ptr = new char[s];
|
|
|
|
|
|
|
|
if (!ptr)
|
|
|
|
{
|
|
|
|
cerr << "BaseynamicMem, cannot allocate " << s << " bytes" << endl;
|
|
|
|
Print ();
|
|
|
|
throw ("BaseDynamicMem::Alloc: out of memory");
|
|
|
|
}
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
used += s - size;
|
|
|
|
|
|
|
|
size_t r = s % 8;
|
|
|
|
if (r) s += 8-r;
|
|
|
|
if (prev)
|
|
|
|
pos = prev->pos + prev->size;
|
|
|
|
else
|
|
|
|
pos = 0;
|
|
|
|
size = s;
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
if (next)
|
2009-01-13 04:40:13 +05:00
|
|
|
{
|
2009-01-29 02:32:30 +05:00
|
|
|
NgLock lock(mem_mutex);
|
|
|
|
lock.Lock();
|
|
|
|
try
|
|
|
|
{
|
|
|
|
next->MoveTo (pos+size);
|
|
|
|
}
|
|
|
|
catch (NgException e)
|
|
|
|
{
|
|
|
|
lock.UnLock();
|
|
|
|
throw NgException ("MoveableMem overflow");
|
|
|
|
}
|
|
|
|
lock.UnLock();
|
2009-01-13 04:40:13 +05:00
|
|
|
}
|
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
if (size)
|
|
|
|
{
|
|
|
|
if (!largeblock)
|
|
|
|
{
|
|
|
|
cout << "moveable memory: allocate large block of "
|
|
|
|
<< totalsize / 1048576 << " MB" << endl;
|
|
|
|
// largeblock = new char[totalsize];
|
|
|
|
// largeblock = (char*)malloc (totalsize);
|
|
|
|
largeblock = new char[totalsize];
|
|
|
|
}
|
|
|
|
ptr = largeblock+pos;
|
|
|
|
|
|
|
|
if (pos + size > totalsize)
|
|
|
|
throw NgException ("MoveableMem overflow");
|
|
|
|
}
|
|
|
|
else
|
|
|
|
ptr = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void BaseMoveableMem :: ReAlloc (size_t s)
|
|
|
|
{
|
|
|
|
if (totalsize == 0)
|
|
|
|
{
|
|
|
|
if (size == s) return;
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
char * old = ptr;
|
|
|
|
ptr = new char[s];
|
|
|
|
|
|
|
|
if (!ptr)
|
|
|
|
{
|
|
|
|
cerr << "BaseynamicMem, cannot Reallocate " << s << " bytes" << endl;
|
|
|
|
Print ();
|
|
|
|
throw ("BaseDynamicMem::Alloc: out of memory");
|
|
|
|
}
|
2009-01-13 04:40:13 +05:00
|
|
|
|
|
|
|
|
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
memmove (ptr, old, (s < size) ? s : size);
|
|
|
|
//free (old);
|
|
|
|
delete [] old;
|
|
|
|
size = s;
|
|
|
|
return;
|
|
|
|
}
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
Alloc (s);
|
|
|
|
}
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
void BaseMoveableMem :: MoveTo (size_t newpos)
|
|
|
|
{
|
|
|
|
// cout << "move block, oldpos = " << pos << "; newpos = " << newpos
|
|
|
|
// << ", size = " << size << endl;
|
|
|
|
static size_t move = 0;
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
if (newpos + size > totalsize)
|
|
|
|
throw NgException ("MoveableMem overflow");
|
|
|
|
if (newpos > pos)
|
|
|
|
{
|
|
|
|
if (next) next->MoveTo (newpos+size);
|
|
|
|
memmove (largeblock+newpos, largeblock+pos, size);
|
|
|
|
move += size;
|
|
|
|
}
|
|
|
|
else if (newpos < pos)
|
|
|
|
{
|
|
|
|
// cout << "move down: " << size << endl;
|
|
|
|
memmove (largeblock+newpos, largeblock+pos, size);
|
|
|
|
if (next) next->MoveTo (newpos+size);
|
|
|
|
move += size;
|
|
|
|
}
|
|
|
|
pos = newpos;
|
|
|
|
ptr = largeblock+pos;
|
|
|
|
// cout << "total move: " << move << endl;
|
|
|
|
}
|
|
|
|
|
|
|
|
void BaseMoveableMem :: Free () throw()
|
|
|
|
{
|
|
|
|
if (totalsize == 0)
|
|
|
|
{
|
|
|
|
//free (ptr);
|
|
|
|
delete [] ptr;
|
|
|
|
ptr = 0;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
cout << "free block, pos = " << pos << "size = " << size << endl;
|
|
|
|
cout << "before: " << endl;
|
|
|
|
Print();
|
|
|
|
*/
|
|
|
|
used -= size;
|
|
|
|
if (next)
|
|
|
|
{
|
|
|
|
NgLock lock(mem_mutex);
|
|
|
|
lock.Lock();
|
|
|
|
next->MoveTo (pos);
|
|
|
|
lock.UnLock();
|
|
|
|
}
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
size = 0;
|
|
|
|
ptr = 0;
|
|
|
|
// pos = 0;
|
|
|
|
}
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
void BaseMoveableMem :: Swap (BaseMoveableMem & m2) throw()
|
|
|
|
{
|
|
|
|
size_t hi;
|
|
|
|
// BaseMoveableMem * hp;
|
|
|
|
char * cp;
|
|
|
|
hi = size; size = m2.size; m2.size = hi;
|
|
|
|
hi = pos; pos = m2.pos; m2.pos = hi;
|
|
|
|
/*
|
|
|
|
hp = prev; prev = m2.prev; m2.prev = hp;
|
|
|
|
hp = next; next = m2.next; m2.next = hp;
|
|
|
|
*/
|
|
|
|
cp = ptr; ptr = m2.ptr; m2.ptr = cp;
|
|
|
|
cp = name; name = m2.name; m2.name = cp;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void BaseMoveableMem :: Print ()
|
|
|
|
{
|
|
|
|
cout << "****************** Moveable Mem Report ****************" << endl;
|
|
|
|
BaseMoveableMem * p = first;
|
|
|
|
long int mem = 0;
|
|
|
|
int cnt = 0;
|
|
|
|
while (p)
|
|
|
|
{
|
|
|
|
mem += long(p->size);
|
|
|
|
cnt++;
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
cout << setw(10) << p->size << " Bytes";
|
|
|
|
cout << ", pos = " << p->pos;
|
|
|
|
cout << ", addr = " << (void*)p->ptr;
|
|
|
|
if (p->name)
|
|
|
|
cout << " in block " << p->name;
|
|
|
|
cout << endl;
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
p = p->next;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mem > 100000000)
|
|
|
|
cout << "memory in moveable arena: " << mem/1048576 << " MB" << endl;
|
|
|
|
else if (mem > 100000)
|
|
|
|
cout << "memory in moveable arena: " << mem/1024 << " kB" << endl;
|
|
|
|
else
|
|
|
|
cout << "memory in moveable arena: " << mem << " Bytes" << endl;
|
|
|
|
cout << "number of blocks: " << cnt << endl;
|
2009-01-13 04:40:13 +05:00
|
|
|
|
2009-01-29 02:32:30 +05:00
|
|
|
cout << " used = " << used << endl;
|
|
|
|
// cout << "******************************************************" << endl;
|
|
|
|
}
|
2009-01-13 04:40:13 +05:00
|
|
|
|
|
|
|
}
|