typedef struct StackNode
{
	ENTITY* StoredEnt;
	struct StackNode* prev;
} StackNode;

StackNode* StackFirst = NULL;//needed pointer to start of list
StackNode* StackLast = NULL;//needed pointer to end of list
int StackCount=0;//counter of items in list

void StackAdd(ENTITY* myent)
{
	StackNode* StackNew;//new pointer
	StackNew = malloc(sizeof(StackNode));//reserve memory
	StackNew.StoredEnt = myent;//assign values
	
	if(StackCount==0)//if the list is empty
	{
		StackFirst=StackNew;
		StackNew.prev=NULL;
	}
	else
	{
		StackNew.prev=StackLast;
	}
	StackLast=StackNew;
	
	StackCount++;
}

void StackPop()
{
	StackNode* StackCurrent;
	
	StackCurrent=StackLast;
	if(StackCurrent!=NULL)//if the list is NOT empty
	{
		StackLast=StackCurrent.prev;
		free(StackCurrent);
		StackCount--;
	}
}

ENTITY* Ent_Create2(STRING model, VECTOR pos, ANGLE angle)
{
   ENTITY* myent;
	if(StackLast!=NULL)//if there are availabe entities to recycle in our list
	{
	   myent=StackLast.StoredEnt;
		ent_morph(myent,model);
		vec_set(myent.x,pos);
		vec_set(myent.pan,angle);
		reset(myent, PASSABLE| INVISIBLE);
		c_setminmax(myent);
		StackPop();
		return(myent);
	}
	else
	{
	   myent=ent_create(model,pos,NULL);
	   vec_set(myent.pan,angle);
	   c_setminmax(myent);
	   return(myent);
	}
}

void Ent_Remove2(ENTITY* myent)
{
   set(myent, PASSABLE| INVISIBLE);
   vec_set(myent.x,vector(0,0,-1000000));
   ent_morph(myent,"DummyEnt.mdl");
   StackAdd(myent);
}