ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/map.C
(Generate patch)

Comparing deliantra/server/common/map.C (file contents):
Revision 1.204 by root, Wed May 4 07:36:40 2011 UTC vs.
Revision 1.215 by root, Sun May 8 12:40:41 2011 UTC

361} 361}
362 362
363void 363void
364maptile::activate () 364maptile::activate ()
365{ 365{
366 if (in_memory != MAP_INACTIVE) 366 if (state != MAP_INACTIVE)
367 return; 367 return;
368 368
369 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 369 for (mapspace *ms = spaces + size (); ms-- > spaces; )
370 for (object *op = ms->bot; op; op = op->above) 370 for (object *op = ms->bot; op; op = op->above)
371 op->activate_recursive (); 371 op->activate_recursive ();
372 372
373 in_memory = MAP_ACTIVE; 373 state = MAP_ACTIVE;
374
375 activate_physics ();
374} 376}
375 377
376void 378void
377maptile::deactivate () 379maptile::deactivate ()
378{ 380{
379 if (in_memory != MAP_ACTIVE) 381 if (state != MAP_ACTIVE)
380 return; 382 return;
381 383
382 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 384 for (mapspace *ms = spaces + size (); ms-- > spaces; )
383 for (object *op = ms->bot; op; op = op->above) 385 for (object *op = ms->bot; op; op = op->above)
384 op->deactivate_recursive (); 386 op->deactivate_recursive ();
385 387
386 in_memory = MAP_INACTIVE; 388 state = MAP_INACTIVE;
387} 389}
388 390
389bool 391bool
390maptile::_save_objects (object_freezer &f, int flags) 392maptile::_save_objects (object_freezer &f, int flags)
391{ 393{
435} 437}
436 438
437void 439void
438maptile::init () 440maptile::init ()
439{ 441{
440 in_memory = MAP_SWAPPED; 442 state = MAP_SWAPPED;
441 443
442 /* The maps used to pick up default x and y values from the 444 /* The maps used to pick up default x and y values from the
443 * map archetype. Mimic that behaviour. 445 * map archetype. Mimic that behaviour.
444 */ 446 */
445 width = 16; 447 width = 16;
669 case KW_value: case KW_swap_time: thawer.get (timeout); break; 671 case KW_value: case KW_swap_time: thawer.get (timeout); break;
670 case KW_level: case KW_difficulty: thawer.get (difficulty); difficulty = clamp (difficulty, 1, settings.max_level); break; 672 case KW_level: case KW_difficulty: thawer.get (difficulty); difficulty = clamp (difficulty, 1, settings.max_level); break;
671 case KW_invisible: case KW_darkness: thawer.get (darkness); break; 673 case KW_invisible: case KW_darkness: thawer.get (darkness); break;
672 case KW_stand_still: case KW_fixed_resettime: thawer.get (fixed_resettime); break; 674 case KW_stand_still: case KW_fixed_resettime: thawer.get (fixed_resettime); break;
673 675
674 case KW_tile_path_1: thawer.get (tile_path [0]); break; 676 case KW_tile_path_1: thawer.get (tile_path [TILE_NORTH]); break;
675 case KW_tile_path_2: thawer.get (tile_path [1]); break; 677 case KW_tile_path_2: thawer.get (tile_path [TILE_EAST ]); break;
676 case KW_tile_path_3: thawer.get (tile_path [2]); break; 678 case KW_tile_path_3: thawer.get (tile_path [TILE_SOUTH]); break;
677 case KW_tile_path_4: thawer.get (tile_path [3]); break; 679 case KW_tile_path_4: thawer.get (tile_path [TILE_WEST ]); break;
678 case KW_tile_path_5: thawer.get (tile_path [4]); break; 680 case KW_tile_path_5: thawer.get (tile_path [TILE_UP ]); break;
679 case KW_tile_path_6: thawer.get (tile_path [5]); break; 681 case KW_tile_path_6: thawer.get (tile_path [TILE_DOWN ]); break;
680 682
681 case KW_ERROR: 683 case KW_ERROR:
682 set_key_text (thawer.kw_str, thawer.value); 684 set_key_text (thawer.kw_str, thawer.value);
683 break; 685 break;
684 686
763 if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore); 765 if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
764 766
765 MAP_OUT (per_player); 767 MAP_OUT (per_player);
766 MAP_OUT (per_party); 768 MAP_OUT (per_party);
767 769
768 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); 770 if (tile_path [TILE_NORTH]) MAP_OUT2 (tile_path_1, tile_path [TILE_NORTH]);
769 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); 771 if (tile_path [TILE_EAST ]) MAP_OUT2 (tile_path_2, tile_path [TILE_EAST ]);
770 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); 772 if (tile_path [TILE_SOUTH]) MAP_OUT2 (tile_path_3, tile_path [TILE_SOUTH]);
771 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); 773 if (tile_path [TILE_WEST ]) MAP_OUT2 (tile_path_4, tile_path [TILE_WEST ]);
772 if (tile_path [4]) MAP_OUT2 (tile_path_5, tile_path [4]); 774 if (tile_path [TILE_UP ]) MAP_OUT2 (tile_path_5, tile_path [TILE_UP ]);
773 if (tile_path [5]) MAP_OUT2 (tile_path_6, tile_path [5]); 775 if (tile_path [TILE_DOWN ]) MAP_OUT2 (tile_path_6, tile_path [TILE_DOWN ]);
774 776
775 freezer.put (this); 777 freezer.put (this);
776 freezer.put (KW(end)); 778 freezer.put (KW(end));
777 779
778 return true; 780 return true;
835 msg = 0; 837 msg = 0;
836 maplore = 0; 838 maplore = 0;
837 shoprace = 0; 839 shoprace = 0;
838 delete [] shopitems, shopitems = 0; 840 delete [] shopitems, shopitems = 0;
839 841
840 for (int i = 0; i < TILE_NUM; i++) 842 for (int i = 0; i < array_length (tile_path); i++)
841 tile_path [i] = 0; 843 tile_path [i] = 0;
842} 844}
843 845
844maptile::~maptile () 846maptile::~maptile ()
845{ 847{
852 /* We need to look through all the maps and see if any maps 854 /* We need to look through all the maps and see if any maps
853 * are pointing at this one for tiling information. Since 855 * are pointing at this one for tiling information. Since
854 * tiling can be asymetric, we just can not look to see which 856 * tiling can be asymetric, we just can not look to see which
855 * maps this map tiles with and clears those. 857 * maps this map tiles with and clears those.
856 */ 858 */
857 for (int i = 0; i < 4; i++) 859 for (int i = 0; i < array_length (tile_path); i++)
858 if (tile_map[i] == m) 860 if (tile_map[i] == m)
859 tile_map[i] = 0; 861 tile_map[i] = 0;
860} 862}
861 863
862void 864void
1193 middle = 0; 1195 middle = 0;
1194 1196
1195 if (top == middle) 1197 if (top == middle)
1196 middle = 0; 1198 middle = 0;
1197 1199
1200 // set lower map transparent floor flag if applicable
1201 if (floor && floor->flag [FLAG_IS_TRANSPARENT_FLOOR] && !middle && !top)
1202 {
1203 floor->set_anim_frame (0);
1204
1205 if (maptile *m = floor->map->tile_map [TILE_DOWN])
1206 {
1207 mapspace &ms = m->at (floor->x, floor->y);
1208 ms.update ();
1209
1210 if (object *floor2 = ms.faces_obj [2])
1211 if (!floor2->flag [FLAG_IS_TRANSPARENT_FLOOR])
1212 {
1213 floor->set_anim_frame (1);
1214 top = floor;
1215 middle = ms.faces_obj [0];
1216 floor = floor2;
1217 }
1218
1219 ms.pflags |= PF_VIS_UP;
1220 }
1221 }
1222
1198#if 0 1223#if 0
1199 faces_obj [0] = top; 1224 faces_obj [0] = top;
1200 faces_obj [1] = middle; 1225 faces_obj [1] = middle;
1201 faces_obj [2] = floor; 1226 faces_obj [2] = floor;
1202#endif 1227#endif
1203} 1228}
1204 1229
1230void
1231mapspace::update_up ()
1232{
1233 // invalidate up
1234 if (!(pflags & PF_VIS_UP))
1235 return;
1236
1237 pflags &= ~PF_VIS_UP;
1238
1239 if (bot)
1240 if (maptile *m = bot->map->tile_map [TILE_UP])
1241 m->at (bot->x, bot->y).invalidate ();
1242}
1243
1205maptile * 1244maptile *
1206maptile::tile_available (int dir, bool load) 1245maptile::tile_available (int dir, bool load)
1207{ 1246{
1208 if (tile_path[dir])
1209 {
1210 // map is there and we don't need to load it OR it's loaded => return what we have 1247 // map is there and we don't need to load it OR it's loaded => return what we have
1211 if (tile_map[dir] && (!load || tile_map[dir]->linkable ())) 1248 if (tile_map [dir] && (!load || tile_map [dir]->linkable ()))
1212 return tile_map[dir]; 1249 return tile_map [dir];
1213 1250
1251 if (tile_path [dir])
1252 {
1214 // well, try to locate it then, if possible - maybe it's there already 1253 // well, try to locate it then, if possible - maybe it's there already
1254 // this is the ONLY place in the server that links maps with each other,
1255 // so any kind of inter-map stuff has to be initiated here.
1215 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1256 if (maptile *m = find_async (tile_path [dir], this, load))
1257 {
1258 bool mismatch = false;
1259
1260 if (dir == TILE_NORTH || dir == TILE_SOUTH || dir == TILE_UP || dir == TILE_DOWN)
1261 if (width != m->width)
1262 mismatch = true;
1263
1264 if (dir == TILE_EAST || dir == TILE_WEST || dir == TILE_UP || dir == TILE_DOWN)
1265 if (height != m->height)
1266 mismatch = true;
1267
1268 if (mismatch)
1269 {
1270 LOG (llevError, "tile dimension mismatch for direction %d from %s to %s\n",
1271 dir, &path, &m->path);
1272 m = 0;
1273 }
1274
1275 // as an optimisation, link us against the other map if the other map
1276 // has us as neighbour, which is very common, but not guaranteed.
1277 int dir2 = REVERSE_TILE_DIR (dir);
1278
1279 if (m->tile_path [dir2] == path)
1280 m->tile_map [dir2] = this;
1281
1216 return tile_map[dir]; 1282 return tile_map [dir] = m;
1283 }
1217 } 1284 }
1218 1285
1219 return 0; 1286 return 0;
1220} 1287}
1221 1288
1237 if (!m) 1304 if (!m)
1238 return 0; 1305 return 0;
1239 1306
1240 if (x < 0) 1307 if (x < 0)
1241 { 1308 {
1242 if (!m->tile_available (3)) 1309 if (!m->tile_available (TILE_WEST))
1243 return 1; 1310 return 1;
1244 1311
1245 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1312 return out_of_map (m->tile_map [TILE_WEST], x + m->tile_map [TILE_WEST]->width, y);
1246 } 1313 }
1247 1314
1248 if (x >= m->width) 1315 if (x >= m->width)
1249 { 1316 {
1250 if (!m->tile_available (1)) 1317 if (!m->tile_available (TILE_EAST))
1251 return 1; 1318 return 1;
1252 1319
1253 return out_of_map (m->tile_map[1], x - m->width, y); 1320 return out_of_map (m->tile_map [TILE_EAST], x - m->width, y);
1254 } 1321 }
1255 1322
1256 if (y < 0) 1323 if (y < 0)
1257 { 1324 {
1258 if (!m->tile_available (0)) 1325 if (!m->tile_available (TILE_NORTH))
1259 return 1; 1326 return 1;
1260 1327
1261 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1328 return out_of_map (m->tile_map [TILE_NORTH], x, y + m->tile_map [TILE_NORTH]->height);
1262 } 1329 }
1263 1330
1264 if (y >= m->height) 1331 if (y >= m->height)
1265 { 1332 {
1266 if (!m->tile_available (2)) 1333 if (!m->tile_available (TILE_SOUTH))
1267 return 1; 1334 return 1;
1268 1335
1269 return out_of_map (m->tile_map[2], x, y - m->height); 1336 return out_of_map (m->tile_map [TILE_SOUTH], x, y - m->height);
1270 } 1337 }
1271 1338
1272 /* Simple case - coordinates are within this local 1339 /* Simple case - coordinates are within this local
1273 * map. 1340 * map.
1274 */ 1341 */
1286maptile * 1353maptile *
1287maptile::xy_find (sint16 &x, sint16 &y) 1354maptile::xy_find (sint16 &x, sint16 &y)
1288{ 1355{
1289 if (x < 0) 1356 if (x < 0)
1290 { 1357 {
1291 if (!tile_available (3)) 1358 if (!tile_available (TILE_WEST))
1292 return 0; 1359 return 0;
1293 1360
1294 x += tile_map[3]->width; 1361 x += tile_map [TILE_WEST]->width;
1295 return tile_map[3]->xy_find (x, y); 1362 return tile_map [TILE_WEST]->xy_find (x, y);
1296 } 1363 }
1297 1364
1298 if (x >= width) 1365 if (x >= width)
1299 { 1366 {
1300 if (!tile_available (1)) 1367 if (!tile_available (TILE_EAST))
1301 return 0; 1368 return 0;
1302 1369
1303 x -= width; 1370 x -= width;
1304 return tile_map[1]->xy_find (x, y); 1371 return tile_map [TILE_EAST]->xy_find (x, y);
1305 } 1372 }
1306 1373
1307 if (y < 0) 1374 if (y < 0)
1308 { 1375 {
1309 if (!tile_available (0)) 1376 if (!tile_available (TILE_NORTH))
1310 return 0; 1377 return 0;
1311 1378
1312 y += tile_map[0]->height; 1379 y += tile_map [TILE_NORTH]->height;
1313 return tile_map[0]->xy_find (x, y); 1380 return tile_map [TILE_NORTH]->xy_find (x, y);
1314 } 1381 }
1315 1382
1316 if (y >= height) 1383 if (y >= height)
1317 { 1384 {
1318 if (!tile_available (2)) 1385 if (!tile_available (TILE_SOUTH))
1319 return 0; 1386 return 0;
1320 1387
1321 y -= height; 1388 y -= height;
1322 return tile_map[2]->xy_find (x, y); 1389 return tile_map [TILE_SOUTH]->xy_find (x, y);
1323 } 1390 }
1324 1391
1325 /* Simple case - coordinates are within this local 1392 /* Simple case - coordinates are within this local
1326 * map. 1393 * map.
1327 */ 1394 */

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines