transformTable.cxx 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254
  1. /**
  2. * PANDA 3D SOFTWARE
  3. * Copyright (c) Carnegie Mellon University. All rights reserved.
  4. *
  5. * All use of this software is subject to the terms of the revised BSD
  6. * license. You should have received a copy of this license along
  7. * with this source code in a file named "LICENSE."
  8. *
  9. * @file transformTable.cxx
  10. * @author drose
  11. * @date 2005-03-23
  12. */
  13. #include "transformTable.h"
  14. #include "bamReader.h"
  15. #include "bamWriter.h"
  16. TypeHandle TransformTable::_type_handle;
  17. /**
  18. *
  19. */
  20. TransformTable::
  21. TransformTable() :
  22. _is_registered(false)
  23. {
  24. }
  25. /**
  26. *
  27. */
  28. TransformTable::
  29. TransformTable(const TransformTable &copy) :
  30. _is_registered(false),
  31. _transforms(copy._transforms)
  32. {
  33. }
  34. /**
  35. *
  36. */
  37. void TransformTable::
  38. operator = (const TransformTable &copy) {
  39. nassertv(!_is_registered);
  40. _transforms = copy._transforms;
  41. }
  42. /**
  43. *
  44. */
  45. TransformTable::
  46. ~TransformTable() {
  47. if (_is_registered) {
  48. do_unregister();
  49. }
  50. }
  51. /**
  52. * Replaces the nth transform. Only valid for unregistered tables.
  53. */
  54. void TransformTable::
  55. set_transform(size_t n, const VertexTransform *transform) {
  56. nassertv(!_is_registered);
  57. nassertv(n < _transforms.size());
  58. _transforms[n] = transform;
  59. }
  60. /**
  61. * Inserts a new transform to the table at the given index position. If the
  62. * index is beyond the end of the table, appends it to the end. Only valid
  63. * for unregistered tables.
  64. *
  65. * This does not automatically uniquify the pointer; if the transform is
  66. * already present in the table, it will be added twice.
  67. */
  68. void TransformTable::
  69. insert_transform(size_t n, const VertexTransform *transform) {
  70. nassertv(!_is_registered);
  71. if (n > _transforms.size()) {
  72. n = _transforms.size();
  73. }
  74. _transforms.insert(_transforms.begin() + n, transform);
  75. }
  76. /**
  77. * Removes the nth transform. Only valid for unregistered tables.
  78. */
  79. void TransformTable::
  80. remove_transform(size_t n) {
  81. nassertv(!_is_registered);
  82. nassertv(n < _transforms.size());
  83. _transforms.erase(_transforms.begin() + n);
  84. }
  85. /**
  86. * Adds a new transform to the table and returns the index number of the new
  87. * transform. Only valid for unregistered tables.
  88. *
  89. * This does not automatically uniquify the pointer; if the transform is
  90. * already present in the table, it will be added twice.
  91. */
  92. size_t TransformTable::
  93. add_transform(const VertexTransform *transform) {
  94. nassertr(!_is_registered, -1);
  95. size_t new_index = _transforms.size();
  96. _transforms.push_back(transform);
  97. return new_index;
  98. }
  99. /**
  100. *
  101. */
  102. void TransformTable::
  103. write(std::ostream &out) const {
  104. for (size_t i = 0; i < _transforms.size(); ++i) {
  105. out << i << ". " << *_transforms[i] << "\n";
  106. }
  107. }
  108. /**
  109. * Called internally when the table is registered.
  110. */
  111. void TransformTable::
  112. do_register() {
  113. nassertv(!_is_registered);
  114. Transforms::iterator ti;
  115. for (ti = _transforms.begin(); ti != _transforms.end(); ++ti) {
  116. VertexTransform *transform = (VertexTransform *)(*ti).p();
  117. bool inserted = transform->_tables.insert(this).second;
  118. nassertv(inserted);
  119. }
  120. _is_registered = true;
  121. }
  122. /**
  123. * Called internally when the table is unregistered (i.e. right before
  124. * destruction).
  125. */
  126. void TransformTable::
  127. do_unregister() {
  128. nassertv(_is_registered);
  129. Transforms::iterator ti;
  130. for (ti = _transforms.begin(); ti != _transforms.end(); ++ti) {
  131. VertexTransform *transform = (VertexTransform *)(*ti).p();
  132. transform->_tables.erase(this);
  133. }
  134. _is_registered = false;
  135. }
  136. /**
  137. * Tells the BamReader how to create objects of type TransformTable.
  138. */
  139. void TransformTable::
  140. register_with_read_factory() {
  141. BamReader::get_factory()->register_factory(get_class_type(), make_from_bam);
  142. }
  143. /**
  144. * Writes the contents of this object to the datagram for shipping out to a
  145. * Bam file.
  146. */
  147. void TransformTable::
  148. write_datagram(BamWriter *manager, Datagram &dg) {
  149. TypedWritableReferenceCount::write_datagram(manager, dg);
  150. dg.add_uint16(_transforms.size());
  151. for (Transforms::const_iterator ti = _transforms.begin();
  152. ti != _transforms.end();
  153. ++ti) {
  154. manager->write_pointer(dg, *ti);
  155. }
  156. manager->write_cdata(dg, _cycler);
  157. }
  158. /**
  159. * Receives an array of pointers, one for each time manager->read_pointer()
  160. * was called in fillin(). Returns the number of pointers processed.
  161. */
  162. int TransformTable::
  163. complete_pointers(TypedWritable **p_list, BamReader *manager) {
  164. int pi = TypedWritableReferenceCount::complete_pointers(p_list, manager);
  165. for (Transforms::iterator ti = _transforms.begin();
  166. ti != _transforms.end();
  167. ++ti) {
  168. (*ti) = DCAST(VertexTransform, p_list[pi++]);
  169. }
  170. return pi;
  171. }
  172. /**
  173. * This function is called by the BamReader's factory when a new object of
  174. * type TransformTable is encountered in the Bam file. It should create the
  175. * TransformTable and extract its information from the file.
  176. */
  177. TypedWritable *TransformTable::
  178. make_from_bam(const FactoryParams &params) {
  179. TransformTable *object = new TransformTable;
  180. DatagramIterator scan;
  181. BamReader *manager;
  182. parse_params(params, scan, manager);
  183. object->fillin(scan, manager);
  184. return object;
  185. }
  186. /**
  187. * This internal function is called by make_from_bam to read in all of the
  188. * relevant data from the BamFile for the new TransformTable.
  189. */
  190. void TransformTable::
  191. fillin(DatagramIterator &scan, BamReader *manager) {
  192. TypedWritableReferenceCount::fillin(scan, manager);
  193. size_t num_transforms = scan.get_uint16();
  194. _transforms.reserve(num_transforms);
  195. for (size_t i = 0; i < num_transforms; ++i) {
  196. manager->read_pointer(scan);
  197. _transforms.push_back(nullptr);
  198. }
  199. manager->read_cdata(scan, _cycler);
  200. }
  201. /**
  202. *
  203. */
  204. CycleData *TransformTable::CData::
  205. make_copy() const {
  206. return new CData(*this);
  207. }
  208. /**
  209. * Writes the contents of this object to the datagram for shipping out to a
  210. * Bam file.
  211. */
  212. void TransformTable::CData::
  213. write_datagram(BamWriter *manager, Datagram &dg) const {
  214. }
  215. /**
  216. * This internal function is called by make_from_bam to read in all of the
  217. * relevant data from the BamFile for the new TransformTable.
  218. */
  219. void TransformTable::CData::
  220. fillin(DatagramIterator &scan, BamReader *manager) {
  221. Thread *current_thread = Thread::get_current_thread();
  222. _modified = VertexTransform::get_next_modified(current_thread);
  223. }