1999-06-12 21:15:27 +00:00
|
|
|
// tile.cxx -- routines to handle a scenery tile
|
|
|
|
//
|
|
|
|
// Written by Curtis Olson, started May 1998.
|
|
|
|
//
|
|
|
|
// Copyright (C) 1998, 1999 Curtis L. Olson - curt@flightgear.org
|
|
|
|
//
|
|
|
|
// This program is free software; you can redistribute it and/or
|
|
|
|
// modify it under the terms of the GNU General Public License as
|
|
|
|
// published by the Free Software Foundation; either version 2 of the
|
|
|
|
// License, or (at your option) any later version.
|
|
|
|
//
|
|
|
|
// This program is distributed in the hope that it will be useful, but
|
|
|
|
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
// General Public License for more details.
|
|
|
|
//
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
|
|
// along with this program; if not, write to the Free Software
|
|
|
|
// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
//
|
|
|
|
// $Id$
|
|
|
|
|
|
|
|
|
|
|
|
#include <Include/compiler.h>
|
|
|
|
|
|
|
|
#ifdef FG_MATH_EXCEPTION_CLASH
|
|
|
|
# include <math.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include STL_FUNCTIONAL
|
|
|
|
#include STL_ALGORITHM
|
|
|
|
|
|
|
|
#include <Debug/logstream.hxx>
|
|
|
|
#include <Bucket/newbucket.hxx>
|
|
|
|
|
|
|
|
#include "tileentry.hxx"
|
|
|
|
|
|
|
|
FG_USING_STD(for_each);
|
|
|
|
FG_USING_STD(mem_fun_ref);
|
|
|
|
|
|
|
|
|
|
|
|
// Constructor
|
|
|
|
FGTileEntry::FGTileEntry ( void )
|
|
|
|
: ncount(0),
|
1999-06-13 05:58:02 +00:00
|
|
|
state(Unused)
|
1999-06-12 21:15:27 +00:00
|
|
|
{
|
|
|
|
nodes.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Destructor
|
|
|
|
FGTileEntry::~FGTileEntry ( void ) {
|
|
|
|
// cout << "nodes = " << nodes.size() << endl;;
|
|
|
|
// delete[] nodes;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-06-29 14:57:00 +00:00
|
|
|
// Step through the fragment list, deleting the display list, then the
|
|
|
|
// fragment, until the list is empty. Also delete the arrays used by
|
|
|
|
// ssg as well as the whole ssg branch
|
1999-06-12 21:15:27 +00:00
|
|
|
void
|
1999-06-29 14:57:00 +00:00
|
|
|
FGTileEntry::free_tile()
|
1999-06-12 21:15:27 +00:00
|
|
|
{
|
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG,
|
|
|
|
"FREEING TILE = (" << tile_bucket << ")" );
|
1999-06-29 14:57:00 +00:00
|
|
|
|
|
|
|
// mark tile unused
|
|
|
|
mark_unused();
|
|
|
|
|
|
|
|
// delete fragment list
|
1999-06-12 21:15:27 +00:00
|
|
|
for_each( begin(), end(),
|
|
|
|
mem_fun_ref( &fgFRAGMENT::deleteDisplayList ));
|
|
|
|
fragment_list.erase( begin(), end() );
|
1999-06-29 14:57:00 +00:00
|
|
|
|
|
|
|
// delete the ssg used structures
|
|
|
|
delete vtlist;
|
|
|
|
delete vnlist;
|
|
|
|
delete tclist;
|
|
|
|
|
|
|
|
// delete the ssg branch
|
|
|
|
|
|
|
|
// make sure we have a sane number of parents
|
|
|
|
int pcount = branch_ptr->getNumParents();
|
|
|
|
if ( pcount > 0 ) {
|
|
|
|
// find the first parent (should only be one)
|
|
|
|
ssgBranch *parent = branch_ptr->getParent( 0 ) ;
|
|
|
|
// find the number of kids this parent has
|
|
|
|
int kcount = parent->getNumKids();
|
|
|
|
// find the kid that matches our original branch_ptr
|
|
|
|
bool found_kid = false;
|
|
|
|
for ( int i = 0; i < kcount; ++i ) {
|
|
|
|
ssgEntity *kid = parent->getKid( i );
|
|
|
|
if ( kid == branch_ptr ) {
|
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO,
|
|
|
|
"Found a kid to delete " << kid);
|
|
|
|
found_kid = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if ( ! found_kid ) {
|
|
|
|
FG_LOG( FG_TERRAIN, FG_ALERT,
|
|
|
|
"Couldn't find the kid to delete! Dying" );
|
|
|
|
exit(-1);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
FG_LOG( FG_TERRAIN, FG_ALERT,
|
|
|
|
"Parent count is zero for an ssg tile! Dying" );
|
|
|
|
exit(-1);
|
|
|
|
}
|
1999-06-12 21:15:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|