//
// Written by Curtis Olson, started December 2000.
//
-// Copyright (C) 2000 Curtis L. Olson - curt@flightgear.org
+// Copyright (C) 2000 Curtis L. Olson - http://www.flightgear.org/~curt
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
# include <config.h>
#endif
-#ifdef HAVE_WINDOWS_H
-# include <windows.h>
-#endif
-
-#include <GL/glut.h>
-
#include <map>
#include <simgear/bucket/newbucket.hxx>
SG_USING_STD(map);
-
-typedef map < long, FGTileEntry * > tile_map;
-typedef tile_map::iterator tile_map_iterator;
-typedef tile_map::const_iterator const_tile_map_iterator;
-
-
// A class to store and manage a pile of tiles
class FGNewCache {
+ typedef map < long, FGTileEntry * > tile_map;
+ typedef tile_map::iterator tile_map_iterator;
+ typedef tile_map::const_iterator const_tile_map_iterator;
+
// cache storage space
tile_map tile_cache;
void init( void );
// Check if the specified "bucket" exists in the cache
- bool exists( const SGBucket& b );
+ bool exists( const SGBucket& b ) const;
+#if 0
// Ensure at least one entry is free in the cache
- void make_space();
+ bool make_space();
+#endif
+
+ // Return the index of the oldest tile in the cache, return -1 if
+ // nothing available to be removed.
+ long get_oldest_tile();
+
+ // Clear the inner ring flag for all tiles in the cache so that
+ // the external tile scheduler can flag the inner ring correctly.
+ void clear_inner_ring_flags();
+
+ // Clear a cache entry, note that the cache only holds pointers
+ // and this does not free the object which is pointed to.
+ void clear_entry( long cache_entry );
- // Fill in a tile cache entry with real data for the specified bucket
- void fill_in( const SGBucket& b );
+ // Clear all completely loaded tiles (ignores partially loaded tiles)
+ void clear_cache();
// Return a pointer to the specified tile cache entry
- inline FGTileEntry *get_tile( const long tile_index ) {
- tile_map_iterator it = tile_cache.find( tile_index );
+ inline FGTileEntry *get_tile( const long tile_index ) const {
+ const_tile_map_iterator it = tile_cache.find( tile_index );
if ( it != tile_cache.end() ) {
+ it->second->set_timestamp(globals->get_sim_time_sec());
return it->second;
} else {
return NULL;
}
// Return a pointer to the specified tile cache entry
- inline FGTileEntry *get_tile( const SGBucket& b ) {
+ inline FGTileEntry *get_tile( const SGBucket& b ) const {
return get_tile( b.gen_index() );
}
// External linear traversal of cache
inline void reset_traversal() { current = tile_cache.begin(); }
inline bool at_end() { return current == tile_cache.end(); }
- inline FGTileEntry *get_current() {
+ inline FGTileEntry *get_current() const {
// cout << "index = " << current->first << endl;
return current->second;
}
inline int get_max_cache_size() const { return max_cache_size; }
inline void set_max_cache_size( int m ) { max_cache_size = m; }
-};
-
-// the tile cache
-extern FGNewCache global_tile_cache;
+ /**
+ * Create a new tile and enqueue it for loading.
+ * @param b
+ * @return success/failure
+ */
+ bool insert_tile( FGTileEntry* e );
+};
#endif // _NEWCACHE_HXX