Open Source Tomb Raider Engine
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

World.cpp 6.0KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253
  1. /*!
  2. * \file src/World.cpp
  3. * \brief The game world (model)
  4. *
  5. * \author Mongoose
  6. */
  7. #include <cstdio>
  8. #include <math.h>
  9. #include "global.h"
  10. #include "World.h"
  11. World::~World() {
  12. destroy();
  13. }
  14. // Temp methods for rendering use until more refactoring is done
  15. model_mesh_t *World::getMesh(int index)
  16. {
  17. return mMeshes[index];
  18. }
  19. void World::addMesh(model_mesh_t *mesh)
  20. {
  21. if (mesh)
  22. mMeshes.push_back(mesh);
  23. }
  24. void World::addRoom(Room &room) {
  25. mRooms.push_back(&room);
  26. }
  27. unsigned int World::sizeRoom() {
  28. return mRooms.size();
  29. }
  30. Room &World::getRoom(unsigned int index) {
  31. assert(index < mRooms.size());
  32. return *mRooms.at(index);
  33. }
  34. void World::addSprite(SpriteSequence &sprite) {
  35. mSprites.push_back(&sprite);
  36. }
  37. unsigned int World::sizeSprite() {
  38. return mSprites.size();
  39. }
  40. SpriteSequence &World::getSprite(unsigned int index) {
  41. assert(index < mSprites.size());
  42. return *mSprites.at(index);
  43. }
  44. void World::addEntity(Entity &entity) {
  45. mEntities.push_back(&entity);
  46. }
  47. unsigned int World::sizeEntity() {
  48. return mEntities.size();
  49. }
  50. Entity &World::getEntity(unsigned int index) {
  51. assert(index < mEntities.size());
  52. return *mEntities.at(index);
  53. }
  54. void World::addSkeletalModel(SkeletalModel &model) {
  55. mModels.push_back(&model);
  56. }
  57. unsigned int World::sizeSkeletalModel() {
  58. return mModels.size();
  59. }
  60. SkeletalModel &World::getSkeletalModel(unsigned int index) {
  61. assert(index < mModels.size());
  62. return *mModels.at(index);
  63. }
  64. int World::getRoomByLocation(int index, float x, float y, float z)
  65. {
  66. assert(index >= 0);
  67. assert(index < (int)mRooms.size());
  68. Room &room = *mRooms.at(index);
  69. if (room.getBoundingBox().inBox(x, y, z))
  70. return index;
  71. else
  72. return getRoomByLocation(x, y, z);
  73. }
  74. int World::getRoomByLocation(float x, float y, float z) {
  75. int hop = -1;
  76. for (unsigned int i = 0; i < mRooms.size(); i++) {
  77. if (mRooms.at(i)->getBoundingBox().inBoxPlane(x, z)) {
  78. if (mRooms.at(i)->getBoundingBox().inBox(x, y, z))
  79. return i;
  80. else
  81. hop = i; // This room is above or below current position
  82. }
  83. }
  84. return hop;
  85. }
  86. int World::getAdjoiningRoom(int index,
  87. float x, float y, float z,
  88. float x2, float y2, float z2) {
  89. assert(index >= 0);
  90. assert(index < (int)mRooms.size());
  91. Room &room = *mRooms.at(index);
  92. vec3_t intersect, p1, p2;
  93. vec3_t vertices[4];
  94. p1[0] = x; p1[1] = y; p1[2] = z;
  95. p2[0] = x2; p2[1] = y2; p2[2] = z2;
  96. for (unsigned int i = 0; i < room.sizePortals(); i++) {
  97. room.getPortal(i).getVertices(vertices);
  98. if (intersectionLinePolygon(intersect, p1, p2, //4,
  99. vertices))
  100. return room.getPortal(i).getAdjoiningRoom();
  101. }
  102. return -1;
  103. }
  104. int World::getSector(int room, float x, float z, float *floor, float *ceiling) {
  105. assert(room >= 0);
  106. assert(room < (int)mRooms.size());
  107. assert(floor != NULL);
  108. assert(ceiling != NULL);
  109. int sector = getSector(room, x, z);
  110. if ((sector >= 0) && (sector < (int)mRooms.at(room)->sizeSectors())) {
  111. *floor = mRooms.at(room)->getSector(sector).getFloor();
  112. *ceiling = mRooms.at(room)->getSector(sector).getCeiling();
  113. }
  114. return sector;
  115. }
  116. int World::getSector(int room, float x, float z) {
  117. assert(room >= 0);
  118. assert(room < (int)mRooms.size());
  119. vec3_t pos;
  120. mRooms.at(room)->getPos(pos);
  121. int sector = (((((int)x - (int)pos[0]) / 1024) *
  122. mRooms.at(room)->getNumZSectors()) + (((int)z - (int)pos[2]) / 1024));
  123. if (sector < 0)
  124. return -1;
  125. return sector;
  126. }
  127. unsigned int World::getRoomInfo(int room) {
  128. assert(room >= 0);
  129. assert(room < (int)mRooms.size());
  130. return mRooms.at(room)->getFlags();
  131. }
  132. bool World::isWall(int room, int sector) {
  133. assert(room >= 0);
  134. assert(room < (int)mRooms.size());
  135. assert(sector >= 0);
  136. assert(sector < (int)mRooms.at(room)->sizeSectors());
  137. //! \fixme is (sector > 0) correct??
  138. return ((sector > 0) && mRooms.at(room)->getSector(sector).isWall());
  139. }
  140. void World::getHeightAtPosition(int index, float x, float *y, float z) {
  141. assert(index >= 0);
  142. assert(index < (int)mRooms.size());
  143. int sector = getSector(index, x, z);
  144. if ((sector >= 0) && (sector < (int)mRooms.at(index)->sizeSectors()))
  145. *y = mRooms.at(index)->getSector(sector).getFloor();
  146. }
  147. void World::destroy() {
  148. for (unsigned int i = 0; i != mRooms.size(); i++)
  149. delete mRooms[i];
  150. mRooms.clear();
  151. for (unsigned int i = 0; i != mSprites.size(); i++)
  152. delete mSprites[i];
  153. mSprites.clear();
  154. for (unsigned int i = 0; i != mEntities.size(); i++)
  155. delete mEntities[i];
  156. mEntities.clear();
  157. for (unsigned int i = 0; i != mModels.size(); i++)
  158. delete mModels[i];
  159. mModels.clear();
  160. for (std::vector<int>::size_type i = 0; i != mMeshes.size(); i++) {
  161. model_mesh_t *mesh = mMeshes[i];
  162. if (!mesh)
  163. continue;
  164. for (std::vector<int>::size_type j = 0; j != mesh->texturedTriangles.size(); j++) {
  165. if (mesh->texturedTriangles[j])
  166. delete mesh->texturedTriangles[j];
  167. }
  168. for (std::vector<int>::size_type j = 0; j != mesh->coloredTriangles.size(); j++) {
  169. if (mesh->coloredTriangles[j])
  170. delete mesh->coloredTriangles[j];
  171. }
  172. for (std::vector<int>::size_type j = 0; j != mesh->texturedRectangles.size(); j++) {
  173. if (mesh->texturedRectangles[j])
  174. delete mesh->texturedRectangles[j];
  175. }
  176. for (std::vector<int>::size_type j = 0; j != mesh->coloredRectangles.size(); j++) {
  177. if (mesh->coloredRectangles[j])
  178. delete mesh->coloredRectangles[j];
  179. }
  180. if (mesh->vertices)
  181. delete [] mesh->vertices;
  182. if (mesh->colors)
  183. delete [] mesh->colors;
  184. if (mesh->normals)
  185. delete [] mesh->normals;
  186. delete mesh;
  187. }
  188. mMeshes.clear();
  189. }