1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
/*
* This code is based on original Hugo Trilogy source code
*
* Copyright (c) 1989-1995 David P. Gray
*
*/
#include "common/debug.h"
#include "common/system.h"
#include "common/random.h"
#include "hugo/hugo.h"
#include "hugo/game.h"
#include "hugo/object.h"
#include "hugo/display.h"
#include "hugo/file.h"
#include "hugo/route.h"
#include "hugo/util.h"
#include "hugo/parser.h"
#include "hugo/schedule.h"
namespace Hugo {
ObjectHandler_v1w::ObjectHandler_v1w(HugoEngine *vm) : ObjectHandler_v3d(vm) {
}
ObjectHandler_v1w::~ObjectHandler_v1w() {
}
/**
* Draw all objects on screen as follows:
* 1. Sort 'FLOATING' objects in order of y2 (base of object)
* 2. Display new object frames/positions in dib
* Finally, cycle any animating objects to next frame
*/
void ObjectHandler_v1w::updateImages() {
debugC(5, kDebugObject, "updateImages");
// Initialize the index array to visible objects in current screen
int objNumb = 0;
byte objindex[kMaxObjNumb]; // Array of indeces to objects
for (int i = 0; i < _numObj; i++) {
Object *obj = &_objects[i];
if ((obj->_screenIndex == *_vm->_screenPtr) && (obj->_cycling >= kCycleAlmostInvisible))
objindex[objNumb++] = i;
}
// Sort the objects into increasing y+y2 (painter's algorithm)
qsort(objindex, objNumb, sizeof(objindex[0]), y2comp);
// Add each visible object to display list
for (int i = 0; i < objNumb; i++) {
Object *obj = &_objects[objindex[i]];
// Count down inter-frame timer
if (obj->_frameTimer)
obj->_frameTimer--;
if (obj->_cycling > kCycleAlmostInvisible) { // Only if visible
switch (obj->_cycling) {
case kCycleNotCycling:
_vm->_screen->displayFrame(obj->_x, obj->_y, obj->_currImagePtr, obj->_priority == kPriorityOverOverlay);
break;
case kCycleForward:
if (obj->_frameTimer) // Not time to see next frame yet
_vm->_screen->displayFrame(obj->_x, obj->_y, obj->_currImagePtr, obj->_priority == kPriorityOverOverlay);
else
_vm->_screen->displayFrame(obj->_x, obj->_y, obj->_currImagePtr->_nextSeqPtr, obj->_priority == kPriorityOverOverlay);
break;
case kCycleBackward: {
Seq *seqPtr = obj->_currImagePtr;
if (!obj->_frameTimer) { // Show next frame
while (seqPtr->_nextSeqPtr != obj->_currImagePtr)
seqPtr = seqPtr->_nextSeqPtr;
}
_vm->_screen->displayFrame(obj->_x, obj->_y, seqPtr, obj->_priority == kPriorityOverOverlay);
break;
}
default:
break;
}
}
}
// Cycle any animating objects
for (int i = 0; i < objNumb; i++) {
Object *obj = &_objects[objindex[i]];
if (obj->_cycling != kCycleInvisible) {
// Only if it's visible
if (obj->_cycling == kCycleAlmostInvisible)
obj->_cycling = kCycleInvisible;
// Now Rotate to next picture in sequence
switch (obj->_cycling) {
case kCycleNotCycling:
break;
case kCycleForward:
if (!obj->_frameTimer) {
// Time to step to next frame
obj->_currImagePtr = obj->_currImagePtr->_nextSeqPtr;
// Find out if this is last frame of sequence
// If so, reset frame_timer and decrement n_cycle
if (obj->_frameInterval || obj->_cycleNumb) {
obj->_frameTimer = obj->_frameInterval;
for (int j = 0; j < obj->_seqNumb; j++) {
if (obj->_currImagePtr->_nextSeqPtr == obj->_seqList[j]._seqPtr) {
if (obj->_cycleNumb) { // Decr cycleNumb if Non-continous
if (!--obj->_cycleNumb)
obj->_cycling = kCycleNotCycling;
}
}
}
}
}
break;
case kCycleBackward: {
if (!obj->_frameTimer) {
// Time to step to prev frame
Seq *seqPtr = obj->_currImagePtr;
while (obj->_currImagePtr->_nextSeqPtr != seqPtr)
obj->_currImagePtr = obj->_currImagePtr->_nextSeqPtr;
// Find out if this is first frame of sequence
// If so, reset frame_timer and decrement n_cycle
if (obj->_frameInterval || obj->_cycleNumb) {
obj->_frameTimer = obj->_frameInterval;
for (int j = 0; j < obj->_seqNumb; j++) {
if (obj->_currImagePtr == obj->_seqList[j]._seqPtr) {
if (obj->_cycleNumb){ // Decr cycleNumb if Non-continous
if (!--obj->_cycleNumb)
obj->_cycling = kCycleNotCycling;
}
}
}
}
}
break;
}
default:
break;
}
obj->_oldx = obj->_x;
obj->_oldy = obj->_y;
}
}
}
/**
* Update all object positions. Process object 'local' events
* including boundary events and collisions
*/
void ObjectHandler_v1w::moveObjects() {
debugC(4, kDebugObject, "moveObjects");
// Do special route processing
_vm->_route->processRoute();
// Perform any adjustments to velocity based on special path types
// and store all (visible) object baselines into the boundary file.
// Don't store foreground or background objects
for (int i = 0; i < _numObj; i++) {
Object *obj = &_objects[i]; // Get pointer to object
Seq *currImage = obj->_currImagePtr; // Get ptr to current image
if (obj->_screenIndex == *_vm->_screenPtr) {
switch (obj->_pathType) {
case kPathChase:
case kPathChase2: {
int8 radius = obj->_radius; // Default to object's radius
if (radius < 0) // If radius infinity, use closer value
radius = kStepDx;
// Allowable motion wrt boundary
int dx = _vm->_hero->_x + _vm->_hero->_currImagePtr->_x1 - obj->_x - currImage->_x1;
int dy = _vm->_hero->_y + _vm->_hero->_currImagePtr->_y2 - obj->_y - currImage->_y2 - 1;
if (abs(dx) <= radius)
obj->_vx = 0;
else
obj->_vx = (dx > 0) ? MIN(dx, obj->_vxPath) : MAX(dx, -obj->_vxPath);
if (abs(dy) <= radius)
obj->_vy = 0;
else
obj->_vy = (dy > 0) ? MIN(dy, obj->_vyPath) : MAX(dy, -obj->_vyPath);
// Set first image in sequence (if multi-seq object)
switch (obj->_seqNumb) {
case 4:
if (!obj->_vx) { // Got 4 directions
if (obj->_vx != obj->_oldvx) { // vx just stopped
if (dy >= 0)
obj->_currImagePtr = obj->_seqList[SEQ_DOWN]._seqPtr;
else
obj->_currImagePtr = obj->_seqList[SEQ_UP]._seqPtr;
}
} else if (obj->_vx != obj->_oldvx) {
if (dx > 0)
obj->_currImagePtr = obj->_seqList[SEQ_RIGHT]._seqPtr;
else
obj->_currImagePtr = obj->_seqList[SEQ_LEFT]._seqPtr;
}
break;
case 3:
case 2:
if (obj->_vx != obj->_oldvx) { // vx just stopped
if (dx > 0) // Left & right only
obj->_currImagePtr = obj->_seqList[SEQ_RIGHT]._seqPtr;
else
obj->_currImagePtr = obj->_seqList[SEQ_LEFT]._seqPtr;
}
break;
}
if (obj->_vx || obj->_vy) {
obj->_cycling = kCycleForward;
} else {
obj->_cycling = kCycleNotCycling;
boundaryCollision(obj); // Must have got hero!
}
obj->_oldvx = obj->_vx;
obj->_oldvy = obj->_vy;
currImage = obj->_currImagePtr; // Get (new) ptr to current image
break;
}
case kPathWander2:
case kPathWander:
if (!_vm->_rnd->getRandomNumber(3 * _vm->_normalTPS)) { // Kick on random interval
obj->_vx = _vm->_rnd->getRandomNumber(obj->_vxPath << 1) - obj->_vxPath;
obj->_vy = _vm->_rnd->getRandomNumber(obj->_vyPath << 1) - obj->_vyPath;
// Set first image in sequence (if multi-seq object)
if (obj->_seqNumb > 1) {
if (!obj->_vx && (obj->_seqNumb >= 4)) {
if (obj->_vx != obj->_oldvx) { // vx just stopped
if (obj->_vy > 0)
obj->_currImagePtr = obj->_seqList[SEQ_DOWN]._seqPtr;
else
obj->_currImagePtr = obj->_seqList[SEQ_UP]._seqPtr;
}
} else if (obj->_vx != obj->_oldvx) {
if (obj->_vx > 0)
obj->_currImagePtr = obj->_seqList[SEQ_RIGHT]._seqPtr;
else
obj->_currImagePtr = obj->_seqList[SEQ_LEFT]._seqPtr;
}
}
obj->_oldvx = obj->_vx;
obj->_oldvy = obj->_vy;
currImage = obj->_currImagePtr; // Get (new) ptr to current image
}
if (obj->_vx || obj->_vy)
obj->_cycling = kCycleForward;
break;
default:
; // Really, nothing
}
// Store boundaries
if ((obj->_cycling > kCycleAlmostInvisible) && (obj->_priority == kPriorityFloating))
storeBoundary(obj->_x + currImage->_x1, obj->_x + currImage->_x2, obj->_y + currImage->_y2);
}
}
// Move objects, allowing for boundaries
for (int i = 0; i < _numObj; i++) {
Object *obj = &_objects[i]; // Get pointer to object
if ((obj->_screenIndex == *_vm->_screenPtr) && (obj->_vx || obj->_vy)) {
// Only process if it's moving
// Do object movement. Delta_x,y return allowed movement in x,y
// to move as close to a boundary as possible without crossing it.
Seq *currImage = obj->_currImagePtr; // Get ptr to current image
// object coordinates
int x1 = obj->_x + currImage->_x1; // Left edge of object
int x2 = obj->_x + currImage->_x2; // Right edge
int y1 = obj->_y + currImage->_y1; // Top edge
int y2 = obj->_y + currImage->_y2; // Bottom edge
if ((obj->_cycling > kCycleAlmostInvisible) && (obj->_priority == kPriorityFloating))
clearBoundary(x1, x2, y2); // Clear our own boundary
// Allowable motion wrt boundary
int dx = deltaX(x1, x2, obj->_vx, y2);
if (dx != obj->_vx) {
// An object boundary collision!
boundaryCollision(obj);
obj->_vx = 0;
}
int dy = deltaY(x1, x2, obj->_vy, y2);
if (dy != obj->_vy) {
// An object boundary collision!
boundaryCollision(obj);
obj->_vy = 0;
}
if ((obj->_cycling > kCycleAlmostInvisible) && (obj->_priority == kPriorityFloating))
storeBoundary(x1, x2, y2); // Re-store our own boundary
obj->_x += dx; // Update object position
obj->_y += dy;
// Don't let object go outside screen
if (x1 < kEdge)
obj->_x = kEdge2;
if (x2 > (kXPix - kEdge))
obj->_x = kXPix - kEdge2 - (x2 - x1);
if (y1 < kEdge)
obj->_y = kEdge2;
if (y2 > (kYPix - kEdge))
obj->_y = kYPix - kEdge2 - (y2 - y1);
if ((obj->_vx == 0) && (obj->_vy == 0) && (obj->_pathType != kPathWander2) && (obj->_pathType != kPathChase2))
obj->_cycling = kCycleNotCycling;
}
}
// Clear all object baselines from the boundary file.
for (int i = 0; i < _numObj; i++) {
Object *obj = &_objects[i]; // Get pointer to object
Seq *currImage = obj->_currImagePtr; // Get ptr to current image
if ((obj->_screenIndex == *_vm->_screenPtr) && (obj->_cycling > kCycleAlmostInvisible) && (obj->_priority == kPriorityFloating))
clearBoundary(obj->_oldx + currImage->_x1, obj->_oldx + currImage->_x2, obj->_oldy + currImage->_y2);
}
// If maze mode is enabled, do special maze processing
if (_vm->_maze._enabledFl) {
Seq *currImage = _vm->_hero->_currImagePtr; // Get ptr to current image
// hero coordinates
int x1 = _vm->_hero->_x + currImage->_x1; // Left edge of object
int x2 = _vm->_hero->_x + currImage->_x2; // Right edge
int y1 = _vm->_hero->_y + currImage->_y1; // Top edge
int y2 = _vm->_hero->_y + currImage->_y2; // Bottom edge
_vm->_scheduler->processMaze(x1, x2, y1, y2);
}
}
/**
* Swap all the images of one object with another. Set hero_image (we make
* the assumption for now that the first obj is always the HERO) to the object
* number of the swapped image
*/
void ObjectHandler_v1w::swapImages(int objIndex1, int objIndex2) {
debugC(1, kDebugObject, "swapImages(%d, %d)", objIndex1, objIndex2);
saveSeq(&_objects[objIndex1]);
SeqList tmpSeqList[kMaxSeqNumb];
int seqListSize = sizeof(SeqList) * kMaxSeqNumb;
memmove(tmpSeqList, _objects[objIndex1]._seqList, seqListSize);
memmove(_objects[objIndex1]._seqList, _objects[objIndex2]._seqList, seqListSize);
memmove(_objects[objIndex2]._seqList, tmpSeqList, seqListSize);
restoreSeq(&_objects[objIndex1]);
_objects[objIndex2]._currImagePtr = _objects[objIndex2]._seqList[0]._seqPtr;
_vm->_heroImage = (_vm->_heroImage == kHeroIndex) ? objIndex2 : kHeroIndex;
// Make sure baseline stays constant
_objects[objIndex1]._y += _objects[objIndex2]._currImagePtr->_y2 - _objects[objIndex1]._currImagePtr->_y2;
}
} // End of namespace Hugo
|