2004-08-06 08:46:59 +00:00
|
|
|
/* AMX Assembler
|
|
|
|
* Copyright (C)2004 David "BAILOPAN" Anderson
|
|
|
|
*
|
|
|
|
* This software is provided 'as-is', without any express or implied
|
|
|
|
* warranty. In no event will the authors be held liable for any damages
|
|
|
|
* arising from the use of this software.
|
|
|
|
*
|
|
|
|
* Permission is granted to anyone to use this software for any purpose,
|
|
|
|
* including commercial applications, and to alter it and redistribute it
|
|
|
|
* freely, subject to the following restrictions:
|
|
|
|
*
|
|
|
|
* 1. The origin of this software must not be misrepresented; you must not
|
|
|
|
* claim that you wrote the original software. If you use this software
|
|
|
|
* in a product, an acknowledgment in the product documentation would be
|
|
|
|
* appreciated but is not required.
|
|
|
|
* 2. Altered source versions must be plainly marked as such, and must not be
|
|
|
|
* misrepresented as being the original software.
|
|
|
|
* 3. This notice may not be removed or altered from any source distribution.
|
|
|
|
*
|
2014-02-07 07:06:54 +00:00
|
|
|
* Version: $Id: amx_data.cpp 828 2004-08-11 14:31:26Z dvander $
|
2004-08-06 08:46:59 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "amxasm.h"
|
|
|
|
|
|
|
|
DataMngr::~DataMngr()
|
2004-08-08 10:15:08 +00:00
|
|
|
{
|
|
|
|
Clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
void DataMngr::Clear()
|
2004-08-06 08:46:59 +00:00
|
|
|
{
|
|
|
|
std::vector<DataMngr::Datum *>::iterator i;
|
|
|
|
|
|
|
|
for (i=List.begin(); i!=List.end(); i++)
|
|
|
|
{
|
|
|
|
if ( (*i) )
|
|
|
|
delete (*i);
|
|
|
|
}
|
|
|
|
|
|
|
|
List.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
DataMngr::Datum::Datum()
|
|
|
|
{
|
|
|
|
db = false;
|
|
|
|
offset = -1;
|
2004-08-09 05:23:32 +00:00
|
|
|
fill = 0;
|
2004-08-11 14:31:26 +00:00
|
|
|
zeroed = false;
|
2004-08-06 08:46:59 +00:00
|
|
|
}
|
|
|
|
|
2004-08-11 08:14:54 +00:00
|
|
|
void DataMngr::Add(std::string &s, CExpr &expr, bool db, int fill)
|
2004-08-06 08:46:59 +00:00
|
|
|
{
|
|
|
|
DataMngr::Datum *D = new DataMngr::Datum();
|
|
|
|
|
|
|
|
D->symbol.assign(s);
|
|
|
|
D->e = expr;
|
2004-08-09 05:23:32 +00:00
|
|
|
D->fill = fill;
|
2004-08-09 08:43:27 +00:00
|
|
|
D->db = db;
|
2004-08-06 08:46:59 +00:00
|
|
|
|
2004-08-09 05:23:32 +00:00
|
|
|
int size = 0;
|
|
|
|
|
|
|
|
if (db)
|
|
|
|
{
|
|
|
|
size = ((D->e.GetType() == Val_Number) ?
|
|
|
|
cellsize : D->e.Size() * cellsize);
|
|
|
|
} else {
|
2004-08-11 08:14:54 +00:00
|
|
|
size = (D->e.GetNumber() * cellsize);
|
2004-08-09 05:23:32 +00:00
|
|
|
}
|
2004-08-08 10:15:08 +00:00
|
|
|
|
2004-08-06 08:46:59 +00:00
|
|
|
if (List.size() == 0)
|
|
|
|
{
|
|
|
|
D->offset = 0;
|
|
|
|
} else {
|
|
|
|
DataMngr::Datum *p = List[List.size()-1];
|
2004-08-09 05:23:32 +00:00
|
|
|
if (p->db)
|
|
|
|
{
|
|
|
|
D->offset = p->offset +
|
|
|
|
((p->e.GetType() == Val_Number) ?
|
|
|
|
cellsize : p->e.Size() * cellsize);
|
|
|
|
} else {
|
2004-08-11 08:14:54 +00:00
|
|
|
D->offset = p->offset + (p->e.GetNumber() * cellsize);
|
2004-08-09 05:23:32 +00:00
|
|
|
}
|
2004-08-06 08:46:59 +00:00
|
|
|
}
|
2004-08-07 17:07:50 +00:00
|
|
|
|
2004-08-08 10:15:08 +00:00
|
|
|
cursize += size;
|
|
|
|
|
2004-08-07 17:07:50 +00:00
|
|
|
List.push_back(D);
|
2004-08-06 08:46:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
DataMngr::Datum *DataMngr::FindData(std::string &sym)
|
|
|
|
{
|
|
|
|
std::vector<DataMngr::Datum *>::iterator i;
|
|
|
|
|
|
|
|
for (i=List.begin(); i!=List.end(); i++)
|
|
|
|
{
|
|
|
|
if ((*i)->symbol.compare(sym) == 0)
|
|
|
|
{
|
|
|
|
return (*i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
int DataMngr::GetOffset(std::string &sym)
|
|
|
|
{
|
|
|
|
DataMngr::Datum *D = NULL;
|
|
|
|
|
|
|
|
D = FindData(sym);
|
|
|
|
|
|
|
|
if (D == NULL)
|
|
|
|
return DataMngr::nof;
|
|
|
|
|
|
|
|
return D->offset;
|
2004-08-08 10:15:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int DataMngr::GetSize()
|
|
|
|
{
|
|
|
|
return cursize;
|
|
|
|
}
|
|
|
|
|
|
|
|
void DataMngr::GetData(std::vector<DataMngr::Datum *> &dList)
|
|
|
|
{
|
|
|
|
std::vector<DataMngr::Datum *>::iterator i;
|
|
|
|
|
|
|
|
for (i=List.begin(); i!=List.end(); i++)
|
|
|
|
{
|
|
|
|
dList.push_back( (*i) );
|
|
|
|
}
|
2004-08-11 10:01:56 +00:00
|
|
|
}
|
|
|
|
|
2004-08-11 14:31:26 +00:00
|
|
|
void DataMngr::PrintTable()
|
|
|
|
{
|
|
|
|
std::vector<DataMngr::Datum *>::iterator i;
|
|
|
|
DataMngr::Datum *p = 0;
|
|
|
|
|
|
|
|
printf("Symbol\tSize\n");
|
|
|
|
for (i=List.begin(); i!=List.end(); i++)
|
|
|
|
{
|
|
|
|
p = (*i);
|
|
|
|
printf("%s\t%d\n", p->symbol.c_str(), p->offset);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//Rewrite the DAT section so empties are at the end
|
|
|
|
void DataMngr::Optimize()
|
|
|
|
{
|
|
|
|
std::vector<DataMngr::Datum *> DbList;
|
|
|
|
std::vector<DataMngr::Datum *> MtList;
|
|
|
|
std::vector<DataMngr::Datum *>::iterator i;
|
|
|
|
|
|
|
|
for (i=List.begin(); i!=List.end(); i++)
|
|
|
|
{
|
|
|
|
if ( (*i)->db )
|
|
|
|
{
|
|
|
|
DbList.push_back( (*i) );
|
|
|
|
} else if ( (*i)->fill == 0 ) {
|
|
|
|
MtList.push_back( (*i) );
|
|
|
|
} else {
|
|
|
|
DbList.push_back( (*i) );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
List.clear();
|
|
|
|
|
|
|
|
lastOffset = 0;
|
|
|
|
cursize = 0;
|
|
|
|
int size = 0;
|
|
|
|
|
|
|
|
for (i=DbList.begin(); i!=DbList.end(); i++)
|
|
|
|
{
|
|
|
|
size = (( (*i)->e.GetType() == Val_Number
|
|
|
|
|| (*i)->e.GetType() == Val_Float ) ?
|
|
|
|
cellsize : (*i)->e.Size() * cellsize);
|
|
|
|
(*i)->offset = lastOffset;
|
|
|
|
lastOffset += size;
|
|
|
|
(*i)->zeroed = false;
|
|
|
|
List.push_back( (*i) );
|
|
|
|
}
|
|
|
|
|
|
|
|
cursize = lastOffset;
|
|
|
|
DbList.clear();
|
|
|
|
|
|
|
|
for (i=MtList.begin(); i!=MtList.end(); i++)
|
|
|
|
{
|
|
|
|
size = ( (*i)->e.GetNumber() * cellsize );
|
|
|
|
(*i)->offset = lastOffset;
|
|
|
|
lastOffset += size;
|
|
|
|
(*i)->zeroed = true;
|
|
|
|
List.push_back( (*i) );
|
|
|
|
}
|
|
|
|
|
|
|
|
MtList.clear();
|
|
|
|
|
|
|
|
optimized = true;
|
|
|
|
}
|