1 /**************************************************************************
2 * tilecache.c -- routines to handle scenery tile caching
4 * Written by Curtis Olson, started January 1998.
6 * Copyright (C) 1997 Curtis L. Olson - curt@infoplane.com
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License as
10 * published by the Free Software Foundation; either version 2 of the
11 * License, or (at your option) any later version.
13 * This program is distributed in the hope that it will be useful, but
14 * WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
23 * (Log is kept at end of this file)
24 **************************************************************************/
34 #include <Include/general.h>
35 #include <Main/fg_debug.h>
36 #include <Main/views.h>
37 #include <Scenery/bucketutils.h>
38 #include <Scenery/obj.h>
39 #include <Scenery/tilecache.h>
43 struct fgTILE tile_cache[FG_TILE_CACHE_SIZE];
46 /* Initialize the tile cache subsystem */
47 void fgTileCacheInit( void ) {
50 fgPrintf(FG_TERRAIN, FG_INFO, "Initializing the tile cache.\n");
52 for ( i = 0; i < FG_TILE_CACHE_SIZE; i++ ) {
53 tile_cache[i].used = 0;
58 /* Search for the specified "bucket" in the cache */
59 int fgTileCacheExists( struct fgBUCKET *p ) {
62 for ( i = 0; i < FG_TILE_CACHE_SIZE; i++ ) {
63 if ( tile_cache[i].tile_bucket.lon == p->lon ) {
64 if ( tile_cache[i].tile_bucket.lat == p->lat ) {
65 if ( tile_cache[i].tile_bucket.x == p->x ) {
66 if ( tile_cache[i].tile_bucket.y == p->y ) {
67 printf("TILE EXISTS in cache ... index = %d\n", i);
79 /* Fill in a tile cache entry with real data for the specified bucket */
80 void fgTileCacheEntryFillIn( int index, struct fgBUCKET *p ) {
87 /* Mark this cache entry as used */
88 tile_cache[index].used = 1;
90 /* Update the bucket */
91 tile_cache[index].tile_bucket.lon = p->lon;
92 tile_cache[index].tile_bucket.lat = p->lat;
93 tile_cache[index].tile_bucket.x = p->x;
94 tile_cache[index].tile_bucket.y = p->y;
96 /* Load the appropriate area and get the display list pointer */
97 fgBucketGenBasePath(p, base_path);
98 sprintf(file_name, "%s/Scenery/%s/%ld.obj", g->root_dir,
99 base_path, fgBucketGenIndex(p));
100 tile_cache[index].display_list =
101 fgObjLoad(file_name, &tile_cache[index].local_ref);
105 /* Free a tile cache entry */
106 void fgTileCacheEntryFree( int index ) {
107 /* Mark this cache entry as un-used */
108 tile_cache[index].used = 0;
110 /* Update the bucket */
111 printf( "FREEING TILE = (%d %d %d %d)\n",
112 tile_cache[index].tile_bucket.lon,
113 tile_cache[index].tile_bucket.lat, tile_cache[index].tile_bucket.x,
114 tile_cache[index].tile_bucket.y );
116 /* Load the appropriate area and get the display list pointer */
117 xglDeleteLists( tile_cache[index].display_list, 1 );
121 /* Return info for a tile cache entry */
122 void fgTileCacheEntryInfo( int index, GLint *display_list,
123 struct fgCartesianPoint *local_ref ) {
124 *display_list = tile_cache[index].display_list;
125 /* fgPrintf(FG_TERRAIN, FG_DEBUG, "Display list = %d\n", *display_list); */
127 local_ref->x = tile_cache[index].local_ref.x;
128 local_ref->y = tile_cache[index].local_ref.y;
129 local_ref->z = tile_cache[index].local_ref.z;
133 /* Return index of next available slot in tile cache */
134 int fgTileCacheNextAvail( void ) {
137 float dx, dy, dz, max, med, min, tmp;
138 float dist, max_dist;
146 for ( i = 0; i < FG_TILE_CACHE_SIZE; i++ ) {
147 if ( tile_cache[i].used == 0 ) {
150 /* calculate approximate distance from view point */
151 printf( "DIST Abs view pos = %.4f, %.4f, %.4f\n",
152 v->abs_view_pos.x, v->abs_view_pos.y, v->abs_view_pos.z);
153 printf( " ref point = %.4f, %.4f, %.4f\n",
154 tile_cache[i].local_ref.x, tile_cache[i].local_ref.y,
155 tile_cache[i].local_ref.z);
157 dx = fabs(tile_cache[i].local_ref.x - v->abs_view_pos.x);
158 dy = fabs(tile_cache[i].local_ref.y - v->abs_view_pos.y);
159 dz = fabs(tile_cache[i].local_ref.z - v->abs_view_pos.z);
161 max = dx; med = dy; min = dz;
163 tmp = max; max = med; med = tmp;
166 tmp = max; max = min; min = tmp;
168 dist = max + (med + min) / 4;
170 printf(" distance = %.2f\n", dist);
172 if ( dist > max_dist ) {
179 /* If we made it this far, then there were no open cache entries.
180 * We will instead free the furthest cache entry and return it's
183 fgTileCacheEntryFree( max_index );
189 /* Revision 1.5 1998/01/29 00:51:39 curt
190 /* First pass at tile cache, dynamic tile loading and tile unloading now works.
192 * Revision 1.4 1998/01/27 03:26:43 curt
193 * Playing with new fgPrintf command.
195 * Revision 1.3 1998/01/27 00:48:03 curt
196 * Incorporated Paul Bleisch's <bleisch@chromatic.com> new debug message
197 * system and commandline/config file processing code.
199 * Revision 1.2 1998/01/26 15:55:24 curt
200 * Progressing on building dynamic scenery system.
202 * Revision 1.1 1998/01/24 00:03:29 curt