tsMesh.cpp 115 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474
  1. //-----------------------------------------------------------------------------
  2. // Copyright (c) 2012 GarageGames, LLC
  3. //
  4. // Permission is hereby granted, free of charge, to any person obtaining a copy
  5. // of this software and associated documentation files (the "Software"), to
  6. // deal in the Software without restriction, including without limitation the
  7. // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
  8. // sell copies of the Software, and to permit persons to whom the Software is
  9. // furnished to do so, subject to the following conditions:
  10. //
  11. // The above copyright notice and this permission notice shall be included in
  12. // all copies or substantial portions of the Software.
  13. //
  14. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  19. // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  20. // IN THE SOFTWARE.
  21. //-----------------------------------------------------------------------------
  22. #include "platform/platform.h"
  23. #include "ts/tsMesh.h"
  24. #include "ts/tsMeshIntrinsics.h"
  25. #include "ts/tsDecal.h"
  26. #include "ts/tsSortedMesh.h"
  27. #include "ts/tsShape.h"
  28. #include "ts/tsShapeInstance.h"
  29. #include "ts/tsRenderState.h"
  30. #include "ts/tsMaterialList.h"
  31. #include "ts/instancingMatHook.h"
  32. #include "math/mMath.h"
  33. #include "math/mathIO.h"
  34. #include "math/mathUtils.h"
  35. #include "console/console.h"
  36. #include "scene/sceneObject.h"
  37. #include "core/bitRender.h"
  38. #include "collision/convex.h"
  39. #include "collision/optimizedPolyList.h"
  40. #include "core/frameAllocator.h"
  41. #include "platform/profiler.h"
  42. #include "materials/sceneData.h"
  43. #include "materials/materialManager.h"
  44. #include "scene/sceneManager.h"
  45. #include "scene/sceneRenderState.h"
  46. #include "materials/matInstance.h"
  47. #include "materials/materialFeatureTypes.h"
  48. #include "renderInstance/renderPassManager.h"
  49. #include "materials/customMaterialDefinition.h"
  50. #include "gfx/util/triListOpt.h"
  51. #include "util/triRayCheck.h"
  52. #include "opcode/Opcode.h"
  53. GFXPrimitiveType drawTypes[] = { GFXTriangleList, GFXTriangleStrip };
  54. #define getDrawType(a) (drawTypes[a])
  55. // structures used to share data between detail levels...
  56. // used (and valid) during load only
  57. Vector<Point3F*> TSMesh::smVertsList;
  58. Vector<Point3F*> TSMesh::smNormsList;
  59. Vector<U8*> TSMesh::smEncodedNormsList;
  60. Vector<Point2F*> TSMesh::smTVertsList;
  61. Vector<Point2F*> TSMesh::smTVerts2List;
  62. Vector<ColorI*> TSMesh::smColorsList;
  63. Vector<bool> TSMesh::smDataCopied;
  64. Vector<MatrixF*> TSSkinMesh::smInitTransformList;
  65. Vector<S32*> TSSkinMesh::smVertexIndexList;
  66. Vector<S32*> TSSkinMesh::smBoneIndexList;
  67. Vector<F32*> TSSkinMesh::smWeightList;
  68. Vector<S32*> TSSkinMesh::smNodeIndexList;
  69. bool TSSkinMesh::smDebugSkinVerts = false;
  70. Vector<Point3F> gNormalStore;
  71. bool TSMesh::smUseTriangles = false; // convert all primitives to triangle lists on load
  72. bool TSMesh::smUseOneStrip = true; // join triangle strips into one long strip on load
  73. S32 TSMesh::smMinStripSize = 1; // smallest number of _faces_ allowed per strip (all else put in tri list)
  74. bool TSMesh::smUseEncodedNormals = false;
  75. const F32 TSMesh::VISIBILITY_EPSILON = 0.0001f;
  76. S32 TSMesh::smMaxInstancingVerts = 200;
  77. MatrixF TSMesh::smDummyNodeTransform(1);
  78. // quick function to force object to face camera -- currently throws out roll :(
  79. void tsForceFaceCamera( MatrixF *mat, const Point3F *objScale )
  80. {
  81. Point4F p;
  82. mat->getColumn( 3, &p );
  83. mat->identity();
  84. mat->setColumn( 3, p );
  85. if ( objScale )
  86. {
  87. MatrixF scale( true );
  88. scale.scale( *objScale );
  89. mat->mul( scale );
  90. }
  91. }
  92. //-----------------------------------------------------
  93. // TSMesh render methods
  94. //-----------------------------------------------------
  95. void TSMesh::render( TSVertexBufferHandle &instanceVB )
  96. {
  97. innerRender(instanceVB, mPB);
  98. }
  99. void TSMesh::innerRender( TSVertexBufferHandle &vb, GFXPrimitiveBufferHandle &pb )
  100. {
  101. if ( !vb.isValid() || !pb.isValid() )
  102. return;
  103. GFX->setVertexBuffer( vb );
  104. GFX->setPrimitiveBuffer( pb );
  105. for( U32 p = 0; p < mPrimitives.size(); p++ )
  106. GFX->drawPrimitive( p );
  107. }
  108. void TSMesh::render( TSMaterialList *materials,
  109. const TSRenderState &rdata,
  110. bool isSkinDirty,
  111. const Vector<MatrixF> &transforms,
  112. TSVertexBufferHandle &vertexBuffer,
  113. const char *meshName)
  114. {
  115. // These are only used by TSSkinMesh.
  116. TORQUE_UNUSED( isSkinDirty );
  117. TORQUE_UNUSED( transforms );
  118. // Pass our shared VB.
  119. innerRender(materials, rdata, vertexBuffer, mPB, meshName);
  120. }
  121. void TSMesh::innerRender( TSMaterialList *materials, const TSRenderState &rdata, TSVertexBufferHandle &vb, GFXPrimitiveBufferHandle &pb, const char *meshName )
  122. {
  123. PROFILE_SCOPE( TSMesh_InnerRender );
  124. if( vertsPerFrame <= 0 )
  125. return;
  126. F32 meshVisibility = rdata.getFadeOverride() * mVisibility;
  127. if ( meshVisibility < VISIBILITY_EPSILON )
  128. return;
  129. const SceneRenderState *state = rdata.getSceneState();
  130. RenderPassManager *renderPass = state->getRenderPass();
  131. MeshRenderInst *coreRI = renderPass->allocInst<MeshRenderInst>();
  132. coreRI->type = RenderPassManager::RIT_Mesh;
  133. #ifdef TORQUE_ENABLE_GFXDEBUGEVENTS
  134. coreRI->meshName = meshName;
  135. #endif
  136. // Pass accumulation texture along.
  137. coreRI->accuTex = rdata.getAccuTex();
  138. const MatrixF &objToWorld = GFX->getWorldMatrix();
  139. // Sort by the center point or the bounds.
  140. if ( rdata.useOriginSort() )
  141. coreRI->sortDistSq = ( objToWorld.getPosition() - state->getCameraPosition() ).lenSquared();
  142. else
  143. {
  144. Box3F rBox = mBounds;
  145. objToWorld.mul( rBox );
  146. coreRI->sortDistSq = rBox.getSqDistanceToPoint( state->getCameraPosition() );
  147. }
  148. if (getFlags(Billboard))
  149. {
  150. Point3F camPos = state->getDiffuseCameraPosition();
  151. Point3F objPos;
  152. objToWorld.getColumn(3, &objPos);
  153. Point3F targetVector = camPos - objPos;
  154. if(getFlags(BillboardZAxis))
  155. targetVector.z = 0.0f;
  156. targetVector.normalize();
  157. MatrixF orient = MathUtils::createOrientFromDir(targetVector);
  158. orient.setPosition(objPos);
  159. orient.scale(objToWorld.getScale());
  160. coreRI->objectToWorld = renderPass->allocUniqueXform( orient );
  161. }
  162. else
  163. coreRI->objectToWorld = renderPass->allocUniqueXform( objToWorld );
  164. coreRI->worldToCamera = renderPass->allocSharedXform(RenderPassManager::View);
  165. coreRI->projection = renderPass->allocSharedXform(RenderPassManager::Projection);
  166. AssertFatal( vb.isValid(), "TSMesh::innerRender() - Got invalid vertex buffer!" );
  167. AssertFatal( pb.isValid(), "TSMesh::innerRender() - Got invalid primitive buffer!" );
  168. coreRI->vertBuff = &vb;
  169. coreRI->primBuff = &pb;
  170. coreRI->defaultKey2 = (uintptr_t) coreRI->vertBuff;
  171. coreRI->materialHint = rdata.getMaterialHint();
  172. coreRI->visibility = meshVisibility;
  173. coreRI->cubemap = rdata.getCubemap();
  174. if ( getMeshType() == TSMesh::SkinMeshType )
  175. {
  176. rdata.getNodeTransforms(&coreRI->mNodeTransforms, &coreRI->mNodeTransformCount);
  177. }
  178. else
  179. {
  180. coreRI->mNodeTransforms = &TSMesh::smDummyNodeTransform;
  181. coreRI->mNodeTransformCount = 1;
  182. }
  183. // NOTICE: SFXBB is removed and refraction is disabled!
  184. //coreRI->backBuffTex = GFX->getSfxBackBuffer();
  185. for ( S32 i = 0; i < mPrimitives.size(); i++ )
  186. {
  187. const TSDrawPrimitive &draw = mPrimitives[i];
  188. // We need to have a material.
  189. if ( draw.matIndex & TSDrawPrimitive::NoMaterial )
  190. continue;
  191. #ifdef TORQUE_DEBUG_BREAK_INSPECT
  192. // for inspection if you happen to be running in a debugger and can't do bit
  193. // operations in your head.
  194. S32 triangles = draw.matIndex & TSDrawPrimitive::Triangles;
  195. S32 strip = draw.matIndex & TSDrawPrimitive::Strip;
  196. S32 fan = draw.matIndex & TSDrawPrimitive::Fan;
  197. S32 indexed = draw.matIndex & TSDrawPrimitive::Indexed;
  198. S32 type = draw.matIndex & TSDrawPrimitive::TypeMask;
  199. TORQUE_UNUSED(triangles);
  200. TORQUE_UNUSED(strip);
  201. TORQUE_UNUSED(fan);
  202. TORQUE_UNUSED(indexed);
  203. TORQUE_UNUSED(type);
  204. //define TORQUE_DEBUG_BREAK_INSPECT, and insert debug break here to inspect the above elements at runtime
  205. #endif
  206. const U32 matIndex = draw.matIndex & TSDrawPrimitive::MaterialMask;
  207. BaseMatInstance *matInst = materials->getMaterialInst( matIndex );
  208. #ifndef TORQUE_OS_MAC
  209. // Get the instancing material if this mesh qualifies.
  210. if (mMeshType != SkinMeshType && pb->mPrimitiveArray[i].numVertices < smMaxInstancingVerts )
  211. if (matInst && !matInst->getFeatures().hasFeature(MFT_HardwareSkinning))
  212. matInst = InstancingMaterialHook::getInstancingMat( matInst );
  213. #endif
  214. // If we don't have a material instance after the overload then
  215. // there is nothing to render... skip this primitive.
  216. matInst = state->getOverrideMaterial( matInst );
  217. if ( !matInst || !matInst->isValid())
  218. continue;
  219. // If the material needs lights then gather them
  220. // here once and set them on the core render inst.
  221. if ( matInst->isForwardLit() && !coreRI->lights[0] && rdata.getLightQuery() )
  222. rdata.getLightQuery()->getLights( coreRI->lights, 8 );
  223. MeshRenderInst *ri = renderPass->allocInst<MeshRenderInst>();
  224. *ri = *coreRI;
  225. ri->matInst = matInst;
  226. ri->defaultKey = matInst->getStateHint();
  227. ri->primBuffIndex = mPrimBufferOffset + i;
  228. // Translucent materials need the translucent type.
  229. if ( matInst->getMaterial()->isTranslucent() )
  230. {
  231. ri->type = RenderPassManager::RIT_Translucent;
  232. ri->translucentSort = true;
  233. }
  234. renderPass->addInst( ri );
  235. }
  236. }
  237. const Point3F * TSMesh::getNormals( S32 firstVert )
  238. {
  239. if ( getFlags( UseEncodedNormals ) )
  240. {
  241. gNormalStore.setSize( vertsPerFrame );
  242. for ( S32 i = 0; i < mEncodedNorms.size(); i++ )
  243. gNormalStore[i] = decodeNormal(mEncodedNorms[ i + firstVert ] );
  244. return gNormalStore.address();
  245. }
  246. return &mNorms[firstVert];
  247. }
  248. //-----------------------------------------------------
  249. // TSMesh collision methods
  250. //-----------------------------------------------------
  251. bool TSMesh::buildPolyList( S32 frame, AbstractPolyList *polyList, U32 &surfaceKey, TSMaterialList *materials )
  252. {
  253. S32 firstVert = vertsPerFrame * frame, i, base = 0;
  254. bool hasTVert2 = getHasTVert2();
  255. // add the verts...
  256. if ( vertsPerFrame )
  257. {
  258. if ( mVertexData.isReady() )
  259. {
  260. OptimizedPolyList* opList = dynamic_cast<OptimizedPolyList*>(polyList);
  261. if ( opList )
  262. {
  263. base = opList->mVertexList.size();
  264. for ( i = 0; i < vertsPerFrame; i++ )
  265. {
  266. // Don't use vertex() method as we want to retain the original indices
  267. OptimizedPolyList::VertIndex vert;
  268. vert.vertIdx = opList->insertPoint( mVertexData.getBase( i + firstVert ).vert() );
  269. vert.normalIdx = opList->insertNormal( mVertexData.getBase( i + firstVert ).normal() );
  270. vert.uv0Idx = opList->insertUV0( mVertexData.getBase( i + firstVert ).tvert() );
  271. if ( hasTVert2 )
  272. vert.uv1Idx = opList->insertUV1( mVertexData.getColor( i + firstVert ).tvert2() );
  273. opList->mVertexList.push_back( vert );
  274. }
  275. }
  276. else
  277. {
  278. base = polyList->addPointAndNormal( mVertexData.getBase( firstVert ).vert(), mVertexData.getBase( firstVert ).normal() );
  279. for ( i = 1; i < vertsPerFrame; i++ )
  280. {
  281. polyList->addPointAndNormal( mVertexData.getBase( i + firstVert ).vert(), mVertexData.getBase( i + firstVert ).normal() );
  282. }
  283. }
  284. }
  285. else
  286. {
  287. OptimizedPolyList* opList = dynamic_cast<OptimizedPolyList*>(polyList);
  288. if ( opList )
  289. {
  290. base = opList->mVertexList.size();
  291. for ( i = 0; i < vertsPerFrame; i++ )
  292. {
  293. // Don't use vertex() method as we want to retain the original indices
  294. OptimizedPolyList::VertIndex vert;
  295. vert.vertIdx = opList->insertPoint( mVerts[ i + firstVert ] );
  296. vert.normalIdx = opList->insertNormal( mNorms[ i + firstVert ] );
  297. vert.uv0Idx = opList->insertUV0( mTverts[ i + firstVert ] );
  298. if ( hasTVert2 )
  299. vert.uv1Idx = opList->insertUV1(mTverts[ i + firstVert ] );
  300. opList->mVertexList.push_back( vert );
  301. }
  302. }
  303. else
  304. {
  305. base = polyList->addPointAndNormal( mVerts[firstVert], mNorms[firstVert] );
  306. for ( i = 1; i < vertsPerFrame; i++ )
  307. polyList->addPointAndNormal(mVerts[ i + firstVert ], mNorms[ i + firstVert ] );
  308. }
  309. }
  310. }
  311. // add the polys...
  312. for ( i = 0; i < mPrimitives.size(); i++ )
  313. {
  314. TSDrawPrimitive & draw = mPrimitives[i];
  315. U32 start = draw.start;
  316. AssertFatal( draw.matIndex & TSDrawPrimitive::Indexed,"TSMesh::buildPolyList (1)" );
  317. U32 matIndex = draw.matIndex & TSDrawPrimitive::MaterialMask;
  318. BaseMatInstance* material = ( materials ? materials->getMaterialInst( matIndex ) : 0 );
  319. // gonna depend on what kind of primitive it is...
  320. if ( (draw.matIndex & TSDrawPrimitive::TypeMask) == TSDrawPrimitive::Triangles )
  321. {
  322. for ( S32 j = 0; j < draw.numElements; )
  323. {
  324. U32 idx0 = base + mIndices[start + j + 0];
  325. U32 idx1 = base + mIndices[start + j + 1];
  326. U32 idx2 = base + mIndices[start + j + 2];
  327. polyList->begin(material,surfaceKey++);
  328. polyList->vertex( idx0 );
  329. polyList->vertex( idx1 );
  330. polyList->vertex( idx2 );
  331. polyList->plane( idx0, idx1, idx2 );
  332. polyList->end();
  333. j += 3;
  334. }
  335. }
  336. else
  337. {
  338. AssertFatal( (draw.matIndex & TSDrawPrimitive::TypeMask) == TSDrawPrimitive::Strip,"TSMesh::buildPolyList (2)" );
  339. U32 idx0 = base + mIndices[start + 0];
  340. U32 idx1;
  341. U32 idx2 = base + mIndices[start + 1];
  342. U32 * nextIdx = &idx1;
  343. for ( S32 j = 2; j < draw.numElements; j++ )
  344. {
  345. *nextIdx = idx2;
  346. // nextIdx = (j%2)==0 ? &idx0 : &idx1;
  347. nextIdx = (U32*) ( (dsize_t)nextIdx ^ (dsize_t)&idx0 ^ (dsize_t)&idx1);
  348. idx2 = base + mIndices[start + j];
  349. if ( idx0 == idx1 || idx0 == idx2 || idx1 == idx2 )
  350. continue;
  351. polyList->begin( material, surfaceKey++ );
  352. polyList->vertex( idx0 );
  353. polyList->vertex( idx1 );
  354. polyList->vertex( idx2 );
  355. polyList->plane( idx0, idx1, idx2 );
  356. polyList->end();
  357. }
  358. }
  359. }
  360. return true;
  361. }
  362. bool TSMesh::getFeatures( S32 frame, const MatrixF& mat, const VectorF&, ConvexFeature* cf, U32& )
  363. {
  364. S32 firstVert = vertsPerFrame * frame;
  365. S32 i;
  366. S32 base = cf->mVertexList.size();
  367. for ( i = 0; i < vertsPerFrame; i++ )
  368. {
  369. cf->mVertexList.increment();
  370. mat.mulP( mVertexData.getBase(firstVert + i).vert(), &cf->mVertexList.last() );
  371. }
  372. // add the polys...
  373. for ( i = 0; i < mPrimitives.size(); i++ )
  374. {
  375. TSDrawPrimitive & draw = mPrimitives[i];
  376. U32 start = draw.start;
  377. AssertFatal( draw.matIndex & TSDrawPrimitive::Indexed,"TSMesh::buildPolyList (1)" );
  378. // gonna depend on what kind of primitive it is...
  379. if ( (draw.matIndex & TSDrawPrimitive::TypeMask) == TSDrawPrimitive::Triangles)
  380. {
  381. for ( S32 j = 0; j < draw.numElements; j += 3 )
  382. {
  383. PlaneF plane( cf->mVertexList[base + mIndices[start + j + 0]],
  384. cf->mVertexList[base + mIndices[start + j + 1]],
  385. cf->mVertexList[base + mIndices[start + j + 2]]);
  386. cf->mFaceList.increment();
  387. ConvexFeature::Face& lastFace = cf->mFaceList.last();
  388. lastFace.normal = plane;
  389. lastFace.vertex[0] = base + mIndices[start + j + 0];
  390. lastFace.vertex[1] = base + mIndices[start + j + 1];
  391. lastFace.vertex[2] = base + mIndices[start + j + 2];
  392. for ( U32 l = 0; l < 3; l++ )
  393. {
  394. U32 newEdge0, newEdge1;
  395. U32 zero = base + mIndices[start + j + l];
  396. U32 one = base + mIndices[start + j + ((l+1)%3)];
  397. newEdge0 = getMin( zero, one );
  398. newEdge1 = getMax( zero, one );
  399. bool found = false;
  400. for ( S32 k = 0; k < cf->mEdgeList.size(); k++ )
  401. {
  402. if ( cf->mEdgeList[k].vertex[0] == newEdge0 &&
  403. cf->mEdgeList[k].vertex[1] == newEdge1)
  404. {
  405. found = true;
  406. break;
  407. }
  408. }
  409. if ( !found )
  410. {
  411. cf->mEdgeList.increment();
  412. cf->mEdgeList.last().vertex[0] = newEdge0;
  413. cf->mEdgeList.last().vertex[1] = newEdge1;
  414. }
  415. }
  416. }
  417. }
  418. else
  419. {
  420. AssertFatal( (draw.matIndex & TSDrawPrimitive::TypeMask) == TSDrawPrimitive::Strip,"TSMesh::buildPolyList (2)" );
  421. U32 idx0 = base + mIndices[start + 0];
  422. U32 idx1;
  423. U32 idx2 = base + mIndices[start + 1];
  424. U32 * nextIdx = &idx1;
  425. for ( S32 j = 2; j < draw.numElements; j++ )
  426. {
  427. *nextIdx = idx2;
  428. nextIdx = (U32*) ( (dsize_t)nextIdx ^ (dsize_t)&idx0 ^ (dsize_t)&idx1);
  429. idx2 = base + mIndices[start + j];
  430. if ( idx0 == idx1 || idx0 == idx2 || idx1 == idx2 )
  431. continue;
  432. PlaneF plane( cf->mVertexList[idx0],
  433. cf->mVertexList[idx1],
  434. cf->mVertexList[idx2] );
  435. cf->mFaceList.increment();
  436. cf->mFaceList.last().normal = plane;
  437. cf->mFaceList.last().vertex[0] = idx0;
  438. cf->mFaceList.last().vertex[1] = idx1;
  439. cf->mFaceList.last().vertex[2] = idx2;
  440. U32 newEdge0, newEdge1;
  441. newEdge0 = getMin( idx0, idx1 );
  442. newEdge1 = getMax( idx0, idx1 );
  443. bool found = false;
  444. S32 k;
  445. for ( k = 0; k < cf->mEdgeList.size(); k++ )
  446. {
  447. ConvexFeature::Edge currentEdge = cf->mEdgeList[k];
  448. if (currentEdge.vertex[0] == newEdge0 &&
  449. currentEdge.vertex[1] == newEdge1)
  450. {
  451. found = true;
  452. break;
  453. }
  454. }
  455. if ( !found )
  456. {
  457. cf->mEdgeList.increment();
  458. cf->mEdgeList.last().vertex[0] = newEdge0;
  459. cf->mEdgeList.last().vertex[1] = newEdge1;
  460. }
  461. newEdge0 = getMin( idx1, idx2 );
  462. newEdge1 = getMax( idx1, idx2 );
  463. found = false;
  464. for ( k = 0; k < cf->mEdgeList.size(); k++ )
  465. {
  466. if ( cf->mEdgeList[k].vertex[0] == newEdge0 &&
  467. cf->mEdgeList[k].vertex[1] == newEdge1 )
  468. {
  469. found = true;
  470. break;
  471. }
  472. }
  473. if ( !found )
  474. {
  475. cf->mEdgeList.increment();
  476. cf->mEdgeList.last().vertex[0] = newEdge0;
  477. cf->mEdgeList.last().vertex[1] = newEdge1;
  478. }
  479. newEdge0 = getMin(idx0, idx2);
  480. newEdge1 = getMax(idx0, idx2);
  481. found = false;
  482. for ( k = 0; k < cf->mEdgeList.size(); k++ )
  483. {
  484. if ( cf->mEdgeList[k].vertex[0] == newEdge0 &&
  485. cf->mEdgeList[k].vertex[1] == newEdge1 )
  486. {
  487. found = true;
  488. break;
  489. }
  490. }
  491. if ( !found )
  492. {
  493. cf->mEdgeList.increment();
  494. cf->mEdgeList.last().vertex[0] = newEdge0;
  495. cf->mEdgeList.last().vertex[1] = newEdge1;
  496. }
  497. }
  498. }
  499. }
  500. return false;
  501. }
  502. void TSMesh::support( S32 frame, const Point3F &v, F32 *currMaxDP, Point3F *currSupport )
  503. {
  504. if ( vertsPerFrame == 0 )
  505. return;
  506. U32 waterMark = FrameAllocator::getWaterMark();
  507. F32* pDots = (F32*)FrameAllocator::alloc( sizeof(F32) * vertsPerFrame );
  508. S32 firstVert = vertsPerFrame * frame;
  509. m_point3F_bulk_dot( &v.x,
  510. &mVertexData.getBase(firstVert).vert().x,
  511. vertsPerFrame,
  512. mVertexData.vertSize(),
  513. pDots );
  514. F32 localdp = *currMaxDP;
  515. S32 index = -1;
  516. for ( S32 i = 0; i < vertsPerFrame; i++ )
  517. {
  518. if ( pDots[i] > localdp )
  519. {
  520. localdp = pDots[i];
  521. index = i;
  522. }
  523. }
  524. FrameAllocator::setWaterMark(waterMark);
  525. if ( index != -1 )
  526. {
  527. *currMaxDP = localdp;
  528. *currSupport = mVertexData.getBase(index + firstVert).vert();
  529. }
  530. }
  531. bool TSMesh::castRay( S32 frame, const Point3F & start, const Point3F & end, RayInfo * rayInfo, TSMaterialList* materials )
  532. {
  533. if ( mPlaneNormals.empty() )
  534. buildConvexHull(); // if haven't done it yet...
  535. // Keep track of startTime and endTime. They start out at just under 0 and just over 1, respectively.
  536. // As we check against each plane, prune start and end times back to represent current intersection of
  537. // line with all the planes (or rather with all the half-spaces defined by the planes).
  538. // But, instead of explicitly keeping track of startTime and endTime, keep track as numerator and denominator
  539. // so that we can avoid as many divisions as possible.
  540. // F32 startTime = -0.01f;
  541. F32 startNum = -0.01f;
  542. F32 startDen = 1.00f;
  543. // F32 endTime = 1.01f;
  544. F32 endNum = 1.01f;
  545. F32 endDen = 1.00f;
  546. S32 curPlane = 0;
  547. U32 curMaterial = 0;
  548. bool found = false;
  549. // the following block of code is an optimization...
  550. // it isn't necessary if the longer version of the main loop is used
  551. bool tmpFound;
  552. S32 tmpPlane;
  553. F32 sgn = -1.0f;
  554. F32 * pnum = &startNum;
  555. F32 * pden = &startDen;
  556. S32 * pplane = &curPlane;
  557. bool * pfound = &found;
  558. S32 startPlane = frame * mPlanesPerFrame;
  559. for ( S32 i = startPlane; i < startPlane + mPlanesPerFrame; i++ )
  560. {
  561. // if start & end outside, no collision
  562. // if start & end inside, continue
  563. // if start outside, end inside, or visa versa, find intersection of line with plane
  564. // then update intersection of line with hull (using startTime and endTime)
  565. F32 dot1 = mDot(mPlaneNormals[i], start ) - mPlaneConstants[i];
  566. F32 dot2 = mDot(mPlaneNormals[i], end) - mPlaneConstants[i];
  567. if ( dot1 * dot2 > 0.0f )
  568. {
  569. // same side of the plane...which side -- dot==0 considered inside
  570. if ( dot1 > 0.0f )
  571. return false; // start and end outside of this plane, no collision
  572. // start and end inside plane, continue
  573. continue;
  574. }
  575. //AssertFatal( dot1 / ( dot1 - dot2 ) >= 0.0f && dot1 / ( dot1 - dot2 ) <= 1.0f,"TSMesh::castRay (1)" );
  576. // find intersection (time) with this plane...
  577. // F32 time = dot1 / (dot1-dot2);
  578. F32 num = mFabs( dot1 );
  579. F32 den = mFabs( dot1 - dot2 );
  580. // the following block of code is an optimized version...
  581. // this can be commented out and the following block of code used instead
  582. // if debugging a problem in this code, that should probably be done
  583. // if you want to see how this works, look at the following block of code,
  584. // not this one...
  585. // Note that this does not get optimized appropriately...it is included this way
  586. // as an idea for future optimization.
  587. if ( sgn * dot1 >= 0 )
  588. {
  589. sgn *= -1.0f;
  590. pnum = (F32*) ((dsize_t)pnum ^ (dsize_t)&endNum ^ (dsize_t)&startNum);
  591. pden = (F32*) ((dsize_t)pden ^ (dsize_t)&endDen ^ (dsize_t)&startDen);
  592. pplane = (S32*) ((dsize_t)pplane ^ (dsize_t)&tmpPlane ^ (dsize_t)&curPlane);
  593. pfound = (bool*) ((dsize_t)pfound ^ (dsize_t)&tmpFound ^ (dsize_t)&found);
  594. }
  595. bool noCollision = num * endDen * sgn < endNum * den * sgn && num * startDen * sgn < startNum * den * sgn;
  596. if (num * *pden * sgn < *pnum * den * sgn && !noCollision)
  597. {
  598. *pnum = num;
  599. *pden = den;
  600. *pplane = i;
  601. *pfound = true;
  602. }
  603. else if ( noCollision )
  604. return false;
  605. // if (dot1<=0.0f)
  606. // {
  607. // // start is inside plane, end is outside...chop off end
  608. // if (num*endDen<endNum*den) // if (time<endTime)
  609. // {
  610. // if (num*startDen<startNum*den) //if (time<startTime)
  611. // // no intersection of line and hull
  612. // return false;
  613. // // endTime = time;
  614. // endNum = num;
  615. // endDen = den;
  616. // }
  617. // // else, no need to do anything, just continue (we've been more inside than this)
  618. // }
  619. // else // dot2<=0.0f
  620. // {
  621. // // end is inside poly, start is outside...chop off start
  622. // AssertFatal(dot2<=0.0f,"TSMesh::castRay (2)");
  623. // if (num*startDen>startNum*den) // if (time>startTime)
  624. // {
  625. // if (num*endDen>endNum*den) //if (time>endTime)
  626. // // no intersection of line and hull
  627. // return false;
  628. // // startTime = time;
  629. // startNum = num;
  630. // startDen = den;
  631. // curPlane = i;
  632. // curMaterial = planeMaterials[i-startPlane];
  633. // found = true;
  634. // }
  635. // // else, no need to do anything, just continue (we've been more inside than this)
  636. // }
  637. }
  638. // setup rayInfo
  639. if ( found && rayInfo )
  640. {
  641. curMaterial = mPlaneMaterials[ curPlane - startPlane ];
  642. rayInfo->t = (F32)startNum/(F32)startDen; // finally divide...
  643. rayInfo->normal = mPlaneNormals[curPlane];
  644. if (materials && materials->size() > 0)
  645. rayInfo->material = materials->getMaterialInst( curMaterial );
  646. else
  647. rayInfo->material = NULL;
  648. rayInfo->setContactPoint( start, end );
  649. return true;
  650. }
  651. else if ( found )
  652. return true;
  653. // only way to get here is if start is inside hull...
  654. // we could return null and just plug in garbage for the material and normal...
  655. return false;
  656. }
  657. bool TSMesh::castRayRendered( S32 frame, const Point3F & start, const Point3F & end, RayInfo * rayInfo, TSMaterialList* materials )
  658. {
  659. if( vertsPerFrame <= 0 )
  660. return false;
  661. if( mNumVerts == 0 )
  662. return false;
  663. S32 firstVert = vertsPerFrame * frame;
  664. bool found = false;
  665. F32 best_t = F32_MAX;
  666. U32 bestIdx0 = 0, bestIdx1 = 0, bestIdx2 = 0;
  667. BaseMatInstance* bestMaterial = NULL;
  668. Point3F dir = end - start;
  669. for ( S32 i = 0; i < mPrimitives.size(); i++ )
  670. {
  671. TSDrawPrimitive & draw = mPrimitives[i];
  672. U32 drawStart = draw.start;
  673. AssertFatal( draw.matIndex & TSDrawPrimitive::Indexed,"TSMesh::castRayRendered (1)" );
  674. U32 matIndex = draw.matIndex & TSDrawPrimitive::MaterialMask;
  675. BaseMatInstance* material = ( materials ? materials->getMaterialInst( matIndex ) : 0 );
  676. U32 idx0, idx1, idx2;
  677. // gonna depend on what kind of primitive it is...
  678. if ( (draw.matIndex & TSDrawPrimitive::TypeMask) == TSDrawPrimitive::Triangles )
  679. {
  680. for ( S32 j = 0; j < draw.numElements-2; j += 3 )
  681. {
  682. idx0 = mIndices[drawStart + j + 0];
  683. idx1 = mIndices[drawStart + j + 1];
  684. idx2 = mIndices[drawStart + j + 2];
  685. F32 cur_t = 0;
  686. Point2F b;
  687. if(castRayTriangle(start, dir, mVertexData.getBase(firstVert + idx0).vert(),
  688. mVertexData.getBase(firstVert + idx1).vert(), mVertexData.getBase(firstVert + idx2).vert(), cur_t, b))
  689. {
  690. if(cur_t < best_t)
  691. {
  692. best_t = cur_t;
  693. bestIdx0 = idx0;
  694. bestIdx1 = idx1;
  695. bestIdx2 = idx2;
  696. bestMaterial = material;
  697. found = true;
  698. }
  699. }
  700. }
  701. }
  702. else
  703. {
  704. AssertFatal( (draw.matIndex & TSDrawPrimitive::TypeMask) == TSDrawPrimitive::Strip,"TSMesh::castRayRendered (2)" );
  705. idx0 = mIndices[drawStart + 0];
  706. idx2 = mIndices[drawStart + 1];
  707. U32 * nextIdx = &idx1;
  708. for ( S32 j = 2; j < draw.numElements; j++ )
  709. {
  710. *nextIdx = idx2;
  711. // nextIdx = (j%2)==0 ? &idx0 : &idx1;
  712. nextIdx = (U32*) ( (dsize_t)nextIdx ^ (dsize_t)&idx0 ^ (dsize_t)&idx1);
  713. idx2 = mIndices[drawStart + j];
  714. if ( idx0 == idx1 || idx0 == idx2 || idx1 == idx2 )
  715. continue;
  716. F32 cur_t = 0;
  717. Point2F b;
  718. if(castRayTriangle(start, dir, mVertexData.getBase(firstVert + idx0).vert(),
  719. mVertexData.getBase(firstVert + idx1).vert(), mVertexData.getBase(firstVert + idx2).vert(), cur_t, b))
  720. {
  721. if(cur_t < best_t)
  722. {
  723. best_t = cur_t;
  724. bestIdx0 = firstVert + idx0;
  725. bestIdx1 = firstVert + idx1;
  726. bestIdx2 = firstVert + idx2;
  727. bestMaterial = material;
  728. found = true;
  729. }
  730. }
  731. }
  732. }
  733. }
  734. // setup rayInfo
  735. if ( found && rayInfo )
  736. {
  737. rayInfo->t = best_t;
  738. Point3F normal;
  739. mCross(mVertexData.getBase(bestIdx2).vert()-mVertexData.getBase(bestIdx0).vert(),mVertexData.getBase(bestIdx1).vert()-mVertexData.getBase(bestIdx0).vert(),&normal);
  740. if ( mDot( normal, normal ) < 0.001f )
  741. {
  742. mCross( mVertexData.getBase(bestIdx0).vert() - mVertexData.getBase(bestIdx1).vert(), mVertexData.getBase(bestIdx2).vert() - mVertexData.getBase(bestIdx1).vert(), &normal );
  743. if ( mDot( normal, normal ) < 0.001f )
  744. {
  745. mCross( mVertexData.getBase(bestIdx1).vert() - mVertexData.getBase(bestIdx2).vert(), mVertexData.getBase(bestIdx0).vert() - mVertexData.getBase(bestIdx2).vert(), &normal );
  746. }
  747. }
  748. normal.normalize();
  749. rayInfo->normal = normal;
  750. rayInfo->material = bestMaterial;
  751. rayInfo->setContactPoint( start, end );
  752. return true;
  753. }
  754. else if ( found )
  755. return true;
  756. return false;
  757. }
  758. bool TSMesh::addToHull( U32 idx0, U32 idx1, U32 idx2 )
  759. {
  760. // calculate the normal of this triangle... remember, we lose precision
  761. // when we subtract two large numbers that are very close to each other,
  762. // so depending on how we calculate the normal, we could get a
  763. // different result. so, we will calculate the normal three different
  764. // ways and take the one that gives us the largest vector before we
  765. // normalize.
  766. Point3F normal1, normal2, normal3;
  767. const Point3F& vertex0Data = mVertexData.getBase(idx0).vert();
  768. const Point3F& vertex1Data = mVertexData.getBase(idx1).vert();
  769. const Point3F& vertex2Data = mVertexData.getBase(idx2).vert();
  770. mCross(vertex2Data-vertex0Data,vertex1Data-vertex0Data,&normal1);
  771. mCross(vertex0Data-vertex1Data,vertex2Data-vertex1Data,&normal2);
  772. mCross(vertex1Data-vertex2Data,vertex0Data-vertex2Data,&normal3);
  773. Point3F normal = normal1;
  774. F32 greatestMagSquared = mDot(normal1, normal1);
  775. F32 magSquared = mDot(normal2, normal2);
  776. if (magSquared > greatestMagSquared)
  777. {
  778. normal = normal2;
  779. greatestMagSquared = magSquared;
  780. }
  781. magSquared = mDot(normal3, normal3);
  782. if (magSquared > greatestMagSquared)
  783. {
  784. normal = normal3;
  785. greatestMagSquared = magSquared;
  786. }
  787. if (mDot(normal, normal) < 0.00000001f)
  788. return false;
  789. normal.normalize();
  790. F32 k = mDot( normal, mVertexData.getBase(idx0).vert() );
  791. for ( S32 i = 0; i < mPlaneNormals.size(); i++ )
  792. {
  793. if ( mDot(mPlaneNormals[i], normal ) > 0.99f && mFabs( k- mPlaneConstants[i] ) < 0.01f )
  794. return false; // this is a repeat...
  795. }
  796. // new plane, add it to the list...
  797. mPlaneNormals.push_back( normal );
  798. mPlaneConstants.push_back( k );
  799. return true;
  800. }
  801. bool TSMesh::buildConvexHull()
  802. {
  803. // already done, return without error
  804. if (mPlaneNormals.size() )
  805. return true;
  806. bool error = false;
  807. // should probably only have 1 frame, but just in case...
  808. mPlanesPerFrame = 0;
  809. S32 frame, i, j;
  810. for ( frame = 0; frame < numFrames; frame++ )
  811. {
  812. S32 firstVert = vertsPerFrame * frame;
  813. S32 firstPlane = mPlaneNormals.size();
  814. for ( i = 0; i < mPrimitives.size(); i++ )
  815. {
  816. TSDrawPrimitive & draw = mPrimitives[i];
  817. U32 start = draw.start;
  818. AssertFatal( draw.matIndex & TSDrawPrimitive::Indexed,"TSMesh::buildConvexHull (1)" );
  819. // gonna depend on what kind of primitive it is...
  820. if ( (draw.matIndex & TSDrawPrimitive::TypeMask) == TSDrawPrimitive::Triangles )
  821. {
  822. for ( j = 0; j < draw.numElements; j += 3 )
  823. if ( addToHull( mIndices[start + j + 0] + firstVert,
  824. mIndices[start + j + 1] + firstVert,
  825. mIndices[start + j + 2] + firstVert ) && frame == 0 )
  826. mPlaneMaterials.push_back( draw.matIndex & TSDrawPrimitive::MaterialMask );
  827. }
  828. else
  829. {
  830. AssertFatal( (draw.matIndex&TSDrawPrimitive::Strip) == TSDrawPrimitive::Strip,"TSMesh::buildConvexHull (2)" );
  831. U32 idx0 = mIndices[start + 0] + firstVert;
  832. U32 idx1;
  833. U32 idx2 = mIndices[start + 1] + firstVert;
  834. U32 * nextIdx = &idx1;
  835. for ( j = 2; j < draw.numElements; j++ )
  836. {
  837. *nextIdx = idx2;
  838. // nextIdx = (j%2)==0 ? &idx0 : &idx1;
  839. nextIdx = (U32*) ( (dsize_t)nextIdx ^ (dsize_t)&idx0 ^ (dsize_t)&idx1 );
  840. idx2 = mIndices[start + j] + firstVert;
  841. if ( addToHull( idx0, idx1, idx2 ) && frame == 0 )
  842. mPlaneMaterials.push_back( draw.matIndex & TSDrawPrimitive::MaterialMask );
  843. }
  844. }
  845. }
  846. // make sure all the verts on this frame are inside all the planes
  847. for ( i = 0; i < vertsPerFrame; i++ )
  848. for ( j = firstPlane; j < mPlaneNormals.size(); j++ )
  849. if ( mDot( mVertexData.getBase(firstVert + i).vert(), mPlaneNormals[j] ) - mPlaneConstants[j] < 0.01 ) // .01 == a little slack
  850. error = true;
  851. if ( frame == 0 )
  852. mPlanesPerFrame = mPlaneNormals.size();
  853. if ( (frame + 1) * mPlanesPerFrame != mPlaneNormals.size() )
  854. {
  855. // eek, not all frames have same number of planes...
  856. while ( (frame + 1) * mPlanesPerFrame > mPlaneNormals.size() )
  857. {
  858. // we're short, duplicate last plane till we match
  859. U32 sz = mPlaneNormals.size();
  860. mPlaneNormals.increment();
  861. mPlaneNormals.last() = mPlaneNormals[sz-1];
  862. mPlaneConstants.increment();
  863. mPlaneConstants.last() = mPlaneConstants[sz-1];
  864. }
  865. while ( (frame + 1) * mPlanesPerFrame < mPlaneNormals.size() )
  866. {
  867. // harsh -- last frame has more than other frames
  868. // duplicate last plane in each frame
  869. for ( S32 k = frame - 1; k >= 0; k-- )
  870. {
  871. mPlaneNormals.insert( k * mPlanesPerFrame + mPlanesPerFrame );
  872. mPlaneNormals[k * mPlanesPerFrame + mPlanesPerFrame] = mPlaneNormals[k * mPlanesPerFrame + mPlanesPerFrame - 1];
  873. mPlaneConstants.insert( k * mPlanesPerFrame + mPlanesPerFrame );
  874. mPlaneConstants[k * mPlanesPerFrame + mPlanesPerFrame] = mPlaneConstants[k * mPlanesPerFrame + mPlanesPerFrame - 1];
  875. if ( k == 0 )
  876. {
  877. mPlaneMaterials.increment();
  878. mPlaneMaterials.last() = mPlaneMaterials[mPlaneMaterials.size() - 2];
  879. }
  880. }
  881. mPlanesPerFrame++;
  882. }
  883. }
  884. AssertFatal( (frame + 1) * mPlanesPerFrame == mPlaneNormals.size(),"TSMesh::buildConvexHull (3)" );
  885. }
  886. return !error;
  887. }
  888. //-----------------------------------------------------
  889. // TSMesh bounds methods
  890. //-----------------------------------------------------
  891. void TSMesh::computeBounds()
  892. {
  893. MatrixF mat(true);
  894. computeBounds( mat, mBounds, -1, &mCenter, &mRadius );
  895. }
  896. void TSMesh::computeBounds( const MatrixF &transform, Box3F &bounds, S32 frame, Point3F *center, F32 *radius )
  897. {
  898. const Point3F *baseVert = NULL;
  899. S32 stride = 0;
  900. S32 numVerts = 0;
  901. AssertFatal(!mVertexData.isReady() || (mVertexData.isReady() && mNumVerts == mVertexData.size() && mNumVerts == vertsPerFrame), "vertex number mismatch");
  902. if(mVerts.size() == 0 && mVertexData.isReady() && mVertexData.size() > 0)
  903. {
  904. baseVert = &mVertexData.getBase(0).vert();
  905. stride = mVertexData.vertSize();
  906. if ( frame < 0 )
  907. numVerts = mNumVerts;
  908. else
  909. {
  910. baseVert = &mVertexData.getBase(frame * vertsPerFrame).vert();
  911. numVerts = vertsPerFrame;
  912. }
  913. }
  914. else
  915. {
  916. baseVert = mVerts.address();
  917. stride = sizeof(Point3F);
  918. if ( frame < 0 )
  919. numVerts = mVerts.size();
  920. else
  921. {
  922. baseVert += frame * vertsPerFrame;
  923. numVerts = vertsPerFrame;
  924. }
  925. }
  926. computeBounds( baseVert, numVerts, stride, transform, bounds, center, radius );
  927. }
  928. void TSMesh::computeBounds( const Point3F *v, S32 numVerts, S32 stride, const MatrixF &transform, Box3F &bounds, Point3F *center, F32 *radius )
  929. {
  930. const U8 *_vb = reinterpret_cast<const U8 *>(v);
  931. if ( !numVerts )
  932. {
  933. bounds.minExtents = Point3F::Zero;
  934. bounds.maxExtents = Point3F::Zero;
  935. if ( center )
  936. *center = Point3F::Zero;
  937. if ( radius )
  938. *radius = 0;
  939. return;
  940. }
  941. S32 i;
  942. Point3F p;
  943. transform.mulP( *v, &bounds.minExtents );
  944. bounds.maxExtents = bounds.minExtents;
  945. for ( i = 0; i < numVerts; i++ )
  946. {
  947. const Point3F &curVert = *reinterpret_cast<const Point3F *>(_vb + i * stride);
  948. transform.mulP( curVert, &p );
  949. bounds.maxExtents.setMax( p );
  950. bounds.minExtents.setMin( p );
  951. }
  952. Point3F c;
  953. if ( !center )
  954. center = &c;
  955. center->x = 0.5f * (bounds.minExtents.x + bounds.maxExtents.x);
  956. center->y = 0.5f * (bounds.minExtents.y + bounds.maxExtents.y);
  957. center->z = 0.5f * (bounds.minExtents.z + bounds.maxExtents.z);
  958. if ( radius )
  959. {
  960. *radius = 0.0f;
  961. for ( i = 0; i < numVerts; i++ )
  962. {
  963. const Point3F &curVert = *reinterpret_cast<const Point3F *>(_vb + i * stride);
  964. transform.mulP( curVert, &p );
  965. p -= *center;
  966. *radius = getMax( *radius, mDot( p, p ) );
  967. }
  968. *radius = mSqrt( *radius );
  969. }
  970. }
  971. //-----------------------------------------------------
  972. S32 TSMesh::getNumPolys() const
  973. {
  974. S32 count = 0;
  975. for ( S32 i = 0; i < mPrimitives.size(); i++ )
  976. {
  977. switch (mPrimitives[i].matIndex & TSDrawPrimitive::TypeMask)
  978. {
  979. case TSDrawPrimitive::Triangles:
  980. count += mPrimitives[i].numElements / 3;
  981. break;
  982. case TSDrawPrimitive::Fan:
  983. count += mPrimitives[i].numElements - 2;
  984. break;
  985. case TSDrawPrimitive::Strip:
  986. // Don't count degenerate triangles
  987. for ( S32 j = mPrimitives[i].start;
  988. j < mPrimitives[i].start+ mPrimitives[i].numElements-2;
  989. j++ )
  990. {
  991. if ((mIndices[j] != mIndices[j+1]) &&
  992. (mIndices[j] != mIndices[j+2]) &&
  993. (mIndices[j+1] != mIndices[j+2]))
  994. count++;
  995. }
  996. break;
  997. }
  998. }
  999. return count;
  1000. }
  1001. //-----------------------------------------------------
  1002. TSMesh::TSMesh() : mMeshType( StandardMeshType )
  1003. {
  1004. VECTOR_SET_ASSOCIATION(mPlaneNormals );
  1005. VECTOR_SET_ASSOCIATION(mPlaneConstants );
  1006. VECTOR_SET_ASSOCIATION(mPlaneMaterials );
  1007. mParentMesh = -1;
  1008. mOptTree = NULL;
  1009. mOpMeshInterface = NULL;
  1010. mOpTris = NULL;
  1011. mOpPoints = NULL;
  1012. mVisibility = 1.0f;
  1013. mNumVerts = 0;
  1014. mVertSize = 0;
  1015. mVertOffset = 0;
  1016. mParentMeshObject = NULL;
  1017. }
  1018. //-----------------------------------------------------
  1019. // TSMesh destructor
  1020. //-----------------------------------------------------
  1021. TSMesh::~TSMesh()
  1022. {
  1023. SAFE_DELETE( mOptTree );
  1024. SAFE_DELETE( mOpMeshInterface );
  1025. SAFE_DELETE_ARRAY( mOpTris );
  1026. SAFE_DELETE_ARRAY( mOpPoints );
  1027. mNumVerts = 0;
  1028. }
  1029. //-----------------------------------------------------
  1030. // TSSkinMesh methods
  1031. //-----------------------------------------------------
  1032. void TSSkinMesh::updateSkinBuffer( const Vector<MatrixF> &transforms, U8* buffer )
  1033. {
  1034. PROFILE_SCOPE(TSSkinMesh_UpdateSkinBuffer);
  1035. AssertFatal(batchData.initialized, "Batch data not initialized. Call createSkinBatchData() before any skin update is called.");
  1036. if (TSShape::smUseHardwareSkinning || mNumVerts == 0)
  1037. return;
  1038. const MatrixF *matrices = NULL;
  1039. static Vector<MatrixF> sBoneTransforms;
  1040. sBoneTransforms.setSize(batchData.nodeIndex.size());
  1041. // set up bone transforms
  1042. PROFILE_START(TSSkinMesh_UpdateTransforms);
  1043. for (S32 i = 0; i < batchData.nodeIndex.size(); i++)
  1044. {
  1045. S32 node = batchData.nodeIndex[i];
  1046. sBoneTransforms[i].mul(transforms[node], batchData.initialTransforms[i]);
  1047. }
  1048. matrices = &sBoneTransforms[0];
  1049. PROFILE_END();
  1050. const Point3F *inVerts = batchData.initialVerts.address();
  1051. const Point3F *inNorms = batchData.initialNorms.address();
  1052. AssertFatal(inVerts, "Something went wrong, verts should be valid");
  1053. U8 *dest = buffer + mVertOffset;
  1054. if (!dest)
  1055. return;
  1056. Point3F srcVtx, srcNrm;
  1057. AssertFatal(batchData.vertexBatchOperations.size() == batchData.initialVerts.size(), "Assumption failed!");
  1058. Point3F skinnedVert;
  1059. Point3F skinnedNorm;
  1060. for (Vector<BatchData::BatchedVertex>::const_iterator itr = batchData.vertexBatchOperations.begin();
  1061. itr != batchData.vertexBatchOperations.end(); itr++)
  1062. {
  1063. const BatchData::BatchedVertex &curVert = *itr;
  1064. skinnedVert.zero();
  1065. skinnedNorm.zero();
  1066. for (S32 tOp = 0; tOp < curVert.transformCount; tOp++)
  1067. {
  1068. const BatchData::TransformOp &transformOp = curVert.transform[tOp];
  1069. const MatrixF& deltaTransform = matrices[transformOp.transformIndex];
  1070. deltaTransform.mulP(inVerts[curVert.vertexIndex], &srcVtx);
  1071. skinnedVert += (srcVtx * transformOp.weight);
  1072. deltaTransform.mulV(inNorms[curVert.vertexIndex], &srcNrm);
  1073. skinnedNorm += srcNrm * transformOp.weight;
  1074. }
  1075. // Assign results
  1076. __TSMeshVertexBase *dvert = (__TSMeshVertexBase*)(dest + (mVertSize * curVert.vertexIndex));
  1077. dvert->vert(skinnedVert);
  1078. dvert->normal(skinnedNorm);
  1079. }
  1080. }
  1081. void TSSkinMesh::updateSkinBones( const Vector<MatrixF> &transforms, Vector<MatrixF>& destTransforms )
  1082. {
  1083. // Update transforms for current mesh
  1084. destTransforms.setSize(batchData.nodeIndex.size());
  1085. for (int i = 0; i<batchData.nodeIndex.size(); i++)
  1086. {
  1087. S32 node = batchData.nodeIndex[i];
  1088. if (node >= transforms.size())
  1089. continue; // jamesu - ignore obviously invalid data
  1090. destTransforms[i].mul(transforms[node], batchData.initialTransforms[i]);
  1091. }
  1092. }
  1093. void TSSkinMesh::createSkinBatchData()
  1094. {
  1095. if(batchData.initialized)
  1096. return;
  1097. batchData.initialized = true;
  1098. S32 * curVtx = vertexIndex.begin();
  1099. S32 * curBone = boneIndex.begin();
  1100. F32 * curWeight = weight.begin();
  1101. const S32 * endVtx = vertexIndex.end();
  1102. AssertFatal(batchData.nodeIndex.size() <= TSShape::smMaxSkinBones, "Too many bones are here!!!");
  1103. // Temp vector to build batch operations
  1104. Vector<BatchData::BatchedVertex> batchOperations;
  1105. bool issuedWeightWarning = false;
  1106. if (mVertexData.isReady())
  1107. {
  1108. batchData.initialVerts.setSize(mNumVerts);
  1109. batchData.initialNorms.setSize(mNumVerts);
  1110. // Fill arrays
  1111. for (U32 i = 0; i < mNumVerts; i++)
  1112. {
  1113. const __TSMeshVertexBase &cv = mVertexData.getBase(i);
  1114. batchData.initialVerts[i] = cv.vert();
  1115. batchData.initialNorms[i] = cv.normal();
  1116. }
  1117. addWeightsFromVertexBuffer();
  1118. curVtx = vertexIndex.begin();
  1119. curBone = boneIndex.begin();
  1120. curWeight = weight.begin();
  1121. endVtx = vertexIndex.end();
  1122. }
  1123. else
  1124. {
  1125. batchData.initialNorms = mNorms;
  1126. batchData.initialVerts = mVerts;
  1127. }
  1128. // Build the batch operations
  1129. while( curVtx != endVtx )
  1130. {
  1131. const S32 vidx = *curVtx;
  1132. ++curVtx;
  1133. const S32 midx = *curBone;
  1134. ++curBone;
  1135. const F32 w = *curWeight;
  1136. ++curWeight;
  1137. // Ignore empty weights
  1138. if ( vidx < 0 || midx < 0 || w == 0 )
  1139. continue;
  1140. if( !batchOperations.empty() &&
  1141. batchOperations.last().vertexIndex == vidx )
  1142. {
  1143. AssertFatal( batchOperations.last().transformCount > 0, "Not sure how this happened!" );
  1144. S32 opIdx = batchOperations.last().transformCount++;
  1145. // Limit the number of weights per bone (keep the N largest influences)
  1146. if ( opIdx >= TSSkinMesh::BatchData::maxBonePerVert )
  1147. {
  1148. if ( !issuedWeightWarning )
  1149. {
  1150. issuedWeightWarning = true;
  1151. Con::warnf( "At least one vertex has too many bone weights - limiting "
  1152. "to the largest %d influences (see maxBonePerVert in tsMesh.h).",
  1153. TSSkinMesh::BatchData::maxBonePerVert );
  1154. }
  1155. // Too many weights => find and replace the smallest one
  1156. S32 minIndex = 0;
  1157. F32 minWeight = batchOperations.last().transform[0].weight;
  1158. for ( S32 i = 1; i < batchOperations.last().transformCount; i++ )
  1159. {
  1160. if ( batchOperations.last().transform[i].weight < minWeight )
  1161. {
  1162. minWeight = batchOperations.last().transform[i].weight;
  1163. minIndex = i;
  1164. }
  1165. }
  1166. opIdx = minIndex;
  1167. batchOperations.last().transformCount = TSSkinMesh::BatchData::maxBonePerVert;
  1168. }
  1169. batchOperations.last().transform[opIdx].transformIndex = midx;
  1170. batchOperations.last().transform[opIdx].weight = w;
  1171. }
  1172. else
  1173. {
  1174. batchOperations.increment();
  1175. batchOperations.last().vertexIndex = vidx;
  1176. batchOperations.last().transformCount = 1;
  1177. batchOperations.last().transform[0].transformIndex = midx;
  1178. batchOperations.last().transform[0].weight = w;
  1179. }
  1180. //Con::printf( "[%d] transform idx %d, weight %1.5f", vidx, midx, w );
  1181. }
  1182. //Con::printf("End skin update");
  1183. // Normalize vertex weights (force weights for each vert to sum to 1)
  1184. if ( issuedWeightWarning )
  1185. {
  1186. for ( S32 i = 0; i < batchOperations.size(); i++ )
  1187. {
  1188. BatchData::BatchedVertex& batchOp = batchOperations[i];
  1189. // Sum weights for this vertex
  1190. F32 invTotalWeight = 0;
  1191. for ( S32 j = 0; j < batchOp.transformCount; j++ )
  1192. invTotalWeight += batchOp.transform[j].weight;
  1193. // Then normalize the vertex weights
  1194. invTotalWeight = 1.0f / invTotalWeight;
  1195. for ( S32 j = 0; j < batchOp.transformCount; j++ )
  1196. batchOp.transform[j].weight *= invTotalWeight;
  1197. }
  1198. }
  1199. batchData.vertexBatchOperations.set(batchOperations.address(), batchOperations.size());
  1200. U32 maxValue = 0;
  1201. for (U32 i = 0; i<batchData.vertexBatchOperations.size(); i++)
  1202. {
  1203. maxValue = batchData.vertexBatchOperations[i].transformCount > maxValue ? batchData.vertexBatchOperations[i].transformCount : maxValue;
  1204. }
  1205. maxBones = maxValue;
  1206. }
  1207. void TSSkinMesh::setupVertexTransforms()
  1208. {
  1209. AssertFatal(mVertexData.vertSize() == mVertSize, "vert size mismatch");
  1210. // Generate the bone transforms for the verts
  1211. for( Vector<BatchData::BatchedVertex>::const_iterator itr = batchData.vertexBatchOperations.begin();
  1212. itr != batchData.vertexBatchOperations.end(); itr++ )
  1213. {
  1214. const BatchData::BatchedVertex &curTransform = *itr;
  1215. S32 i=0;
  1216. S32 j=0;
  1217. S32 transformsLeft = curTransform.transformCount;
  1218. // Set weights and indices in batches of 4
  1219. for( i = 0, j = 0; i < curTransform.transformCount; i += 4, j += 1 )
  1220. {
  1221. __TSMeshVertex_BoneData &v = mVertexData.getBone(curTransform.vertexIndex, j);
  1222. S32 vertsSet = transformsLeft > 4 ? 4 : transformsLeft;
  1223. __TSMeshIndex_List indices;
  1224. Point4F weights;
  1225. dMemset(&indices, '\0', sizeof(indices));
  1226. dMemset(&weights, '\0', sizeof(weights));
  1227. switch (vertsSet)
  1228. {
  1229. case 1:
  1230. indices.x = curTransform.transform[i+0].transformIndex;
  1231. weights.x = curTransform.transform[i+0].weight;
  1232. break;
  1233. case 2:
  1234. indices.x = curTransform.transform[i+0].transformIndex;
  1235. weights.x = curTransform.transform[i+0].weight;
  1236. indices.y = curTransform.transform[i+1].transformIndex;
  1237. weights.y = curTransform.transform[i+1].weight;
  1238. break;
  1239. case 3:
  1240. indices.x = curTransform.transform[i+0].transformIndex;
  1241. weights.x = curTransform.transform[i+0].weight;
  1242. indices.y = curTransform.transform[i+1].transformIndex;
  1243. weights.y = curTransform.transform[i+1].weight;
  1244. indices.z = curTransform.transform[i+2].transformIndex;
  1245. weights.z = curTransform.transform[i+2].weight;
  1246. break;
  1247. case 4:
  1248. indices.x = curTransform.transform[i+0].transformIndex;
  1249. weights.x = curTransform.transform[i+0].weight;
  1250. indices.y = curTransform.transform[i+1].transformIndex;
  1251. weights.y = curTransform.transform[i+1].weight;
  1252. indices.z = curTransform.transform[i+2].transformIndex;
  1253. weights.z = curTransform.transform[i+2].weight;
  1254. indices.w = curTransform.transform[i+3].transformIndex;
  1255. weights.w = curTransform.transform[i+3].weight;
  1256. break;
  1257. case 0:
  1258. default:
  1259. break;
  1260. }
  1261. v.index(indices);
  1262. v.weight(weights);
  1263. transformsLeft -= 4;
  1264. }
  1265. }
  1266. }
  1267. U32 TSSkinMesh::getMaxBonesPerVert()
  1268. {
  1269. return maxBones >= 0 ? maxBones : 0;
  1270. }
  1271. void TSSkinMesh::render( TSVertexBufferHandle &instanceVB )
  1272. {
  1273. innerRender(instanceVB, mPB);
  1274. }
  1275. void TSSkinMesh::render( TSMaterialList *materials,
  1276. const TSRenderState &rdata,
  1277. bool isSkinDirty,
  1278. const Vector<MatrixF> &transforms,
  1279. TSVertexBufferHandle &vertexBuffer,
  1280. const char *meshName )
  1281. {
  1282. PROFILE_SCOPE(TSSkinMesh_render);
  1283. if (mNumVerts == 0)
  1284. return;
  1285. // verify stuff first
  1286. AssertFatal(mVertexData.size() == mNumVerts, "Vert # mismatch");
  1287. AssertFatal((TSShape::smUseHardwareSkinning && vertexBuffer == mVB) || (!TSShape::smUseHardwareSkinning), "Vertex buffer mismatch");
  1288. // render...
  1289. innerRender(materials, rdata, vertexBuffer, mPB, meshName);
  1290. }
  1291. bool TSSkinMesh::buildPolyList( S32 frame, AbstractPolyList *polyList, U32 &surfaceKey, TSMaterialList *materials )
  1292. {
  1293. return false;
  1294. }
  1295. bool TSSkinMesh::castRay( S32 frame, const Point3F &start, const Point3F &end, RayInfo *rayInfo, TSMaterialList *materials )
  1296. {
  1297. TORQUE_UNUSED(frame);
  1298. TORQUE_UNUSED(start);
  1299. TORQUE_UNUSED(end);
  1300. TORQUE_UNUSED(rayInfo);
  1301. TORQUE_UNUSED(materials);
  1302. return false;
  1303. }
  1304. bool TSSkinMesh::buildConvexHull()
  1305. {
  1306. return false; // no error, but we don't do anything either...
  1307. }
  1308. void TSSkinMesh::computeBounds( const MatrixF &transform, Box3F &bounds, S32 frame, Point3F *center, F32 *radius )
  1309. {
  1310. TORQUE_UNUSED(frame);
  1311. if (mVerts.size() != 0)
  1312. {
  1313. // Use unskinned verts
  1314. TSMesh::computeBounds(mVerts.address(), mVerts.size(), sizeof(Point3F), transform, bounds, center, radius );
  1315. }
  1316. else if (frame <= 0 && batchData.initialVerts.size() > 0)
  1317. {
  1318. // Use unskinned verts
  1319. TSMesh::computeBounds(batchData.initialVerts.address(), batchData.initialVerts.size(), sizeof(Point3F), transform, bounds, center, radius);
  1320. }
  1321. else
  1322. {
  1323. Point3F *vertStart = reinterpret_cast<Point3F *>(mVertexData.address());
  1324. TSMesh::computeBounds( vertStart, mVertexData.size(), mVertexData.vertSize(), transform, bounds, center, radius );
  1325. }
  1326. }
  1327. //-----------------------------------------------------
  1328. // encoded normals
  1329. //-----------------------------------------------------
  1330. const Point3F TSMesh::smU8ToNormalTable[] =
  1331. {
  1332. Point3F( 0.565061f, -0.270644f, -0.779396f ),
  1333. Point3F( -0.309804f, -0.731114f, 0.607860f ),
  1334. Point3F( -0.867412f, 0.472957f, 0.154619f ),
  1335. Point3F( -0.757488f, 0.498188f, -0.421925f ),
  1336. Point3F( 0.306834f, -0.915340f, 0.260778f ),
  1337. Point3F( 0.098754f, 0.639153f, -0.762713f ),
  1338. Point3F( 0.713706f, -0.558862f, -0.422252f ),
  1339. Point3F( -0.890431f, -0.407603f, -0.202466f ),
  1340. Point3F( 0.848050f, -0.487612f, -0.207475f ),
  1341. Point3F( -0.232226f, 0.776855f, 0.585293f ),
  1342. Point3F( -0.940195f, 0.304490f, -0.152706f ),
  1343. Point3F( 0.602019f, -0.491878f, -0.628991f ),
  1344. Point3F( -0.096835f, -0.494354f, -0.863850f ),
  1345. Point3F( 0.026630f, -0.323659f, -0.945799f ),
  1346. Point3F( 0.019208f, 0.909386f, 0.415510f ),
  1347. Point3F( 0.854440f, 0.491730f, 0.167731f ),
  1348. Point3F( -0.418835f, 0.866521f, -0.271512f ),
  1349. Point3F( 0.465024f, 0.409667f, 0.784809f ),
  1350. Point3F( -0.674391f, -0.691087f, -0.259992f ),
  1351. Point3F( 0.303858f, -0.869270f, -0.389922f ),
  1352. Point3F( 0.991333f, 0.090061f, -0.095640f ),
  1353. Point3F( -0.275924f, -0.369550f, 0.887298f ),
  1354. Point3F( 0.426545f, -0.465962f, 0.775202f ),
  1355. Point3F( -0.482741f, -0.873278f, -0.065920f ),
  1356. Point3F( 0.063616f, 0.932012f, -0.356800f ),
  1357. Point3F( 0.624786f, -0.061315f, 0.778385f ),
  1358. Point3F( -0.530300f, 0.416850f, 0.738253f ),
  1359. Point3F( 0.312144f, -0.757028f, -0.573999f ),
  1360. Point3F( 0.399288f, -0.587091f, -0.704197f ),
  1361. Point3F( -0.132698f, 0.482877f, 0.865576f ),
  1362. Point3F( 0.950966f, 0.306530f, 0.041268f ),
  1363. Point3F( -0.015923f, -0.144300f, 0.989406f ),
  1364. Point3F( -0.407522f, -0.854193f, 0.322925f ),
  1365. Point3F( -0.932398f, 0.220464f, 0.286408f ),
  1366. Point3F( 0.477509f, 0.876580f, 0.059936f ),
  1367. Point3F( 0.337133f, 0.932606f, -0.128796f ),
  1368. Point3F( -0.638117f, 0.199338f, 0.743687f ),
  1369. Point3F( -0.677454f, 0.445349f, 0.585423f ),
  1370. Point3F( -0.446715f, 0.889059f, -0.100099f ),
  1371. Point3F( -0.410024f, 0.909168f, 0.072759f ),
  1372. Point3F( 0.708462f, 0.702103f, -0.071641f ),
  1373. Point3F( -0.048801f, -0.903683f, -0.425411f ),
  1374. Point3F( -0.513681f, -0.646901f, 0.563606f ),
  1375. Point3F( -0.080022f, 0.000676f, -0.996793f ),
  1376. Point3F( 0.066966f, -0.991150f, -0.114615f ),
  1377. Point3F( -0.245220f, 0.639318f, -0.728793f ),
  1378. Point3F( 0.250978f, 0.855979f, 0.452006f ),
  1379. Point3F( -0.123547f, 0.982443f, -0.139791f ),
  1380. Point3F( -0.794825f, 0.030254f, -0.606084f ),
  1381. Point3F( -0.772905f, 0.547941f, 0.319967f ),
  1382. Point3F( 0.916347f, 0.369614f, -0.153928f ),
  1383. Point3F( -0.388203f, 0.105395f, 0.915527f ),
  1384. Point3F( -0.700468f, -0.709334f, 0.078677f ),
  1385. Point3F( -0.816193f, 0.390455f, 0.425880f ),
  1386. Point3F( -0.043007f, 0.769222f, -0.637533f ),
  1387. Point3F( 0.911444f, 0.113150f, 0.395560f ),
  1388. Point3F( 0.845801f, 0.156091f, -0.510153f ),
  1389. Point3F( 0.829801f, -0.029340f, 0.557287f ),
  1390. Point3F( 0.259529f, 0.416263f, 0.871418f ),
  1391. Point3F( 0.231128f, -0.845982f, 0.480515f ),
  1392. Point3F( -0.626203f, -0.646168f, 0.436277f ),
  1393. Point3F( -0.197047f, -0.065791f, 0.978184f ),
  1394. Point3F( -0.255692f, -0.637488f, -0.726794f ),
  1395. Point3F( 0.530662f, -0.844385f, -0.073567f ),
  1396. Point3F( -0.779887f, 0.617067f, -0.104899f ),
  1397. Point3F( 0.739908f, 0.113984f, 0.662982f ),
  1398. Point3F( -0.218801f, 0.930194f, -0.294729f ),
  1399. Point3F( -0.374231f, 0.818666f, 0.435589f ),
  1400. Point3F( -0.720250f, -0.028285f, 0.693137f ),
  1401. Point3F( 0.075389f, 0.415049f, 0.906670f ),
  1402. Point3F( -0.539724f, -0.106620f, 0.835063f ),
  1403. Point3F( -0.452612f, -0.754669f, -0.474991f ),
  1404. Point3F( 0.682822f, 0.581234f, -0.442629f ),
  1405. Point3F( 0.002435f, -0.618462f, -0.785811f ),
  1406. Point3F( -0.397631f, 0.110766f, -0.910835f ),
  1407. Point3F( 0.133935f, -0.985438f, 0.104754f ),
  1408. Point3F( 0.759098f, -0.608004f, 0.232595f ),
  1409. Point3F( -0.825239f, -0.256087f, 0.503388f ),
  1410. Point3F( 0.101693f, -0.565568f, 0.818408f ),
  1411. Point3F( 0.386377f, 0.793546f, -0.470104f ),
  1412. Point3F( -0.520516f, -0.840690f, 0.149346f ),
  1413. Point3F( -0.784549f, -0.479672f, 0.392935f ),
  1414. Point3F( -0.325322f, -0.927581f, -0.183735f ),
  1415. Point3F( -0.069294f, -0.428541f, 0.900861f ),
  1416. Point3F( 0.993354f, -0.115023f, -0.004288f ),
  1417. Point3F( -0.123896f, -0.700568f, 0.702747f ),
  1418. Point3F( -0.438031f, -0.120880f, -0.890795f ),
  1419. Point3F( 0.063314f, 0.813233f, 0.578484f ),
  1420. Point3F( 0.322045f, 0.889086f, -0.325289f ),
  1421. Point3F( -0.133521f, 0.875063f, -0.465228f ),
  1422. Point3F( 0.637155f, 0.564814f, 0.524422f ),
  1423. Point3F( 0.260092f, -0.669353f, 0.695930f ),
  1424. Point3F( 0.953195f, 0.040485f, -0.299634f ),
  1425. Point3F( -0.840665f, -0.076509f, 0.536124f ),
  1426. Point3F( -0.971350f, 0.202093f, 0.125047f ),
  1427. Point3F( -0.804307f, -0.396312f, -0.442749f ),
  1428. Point3F( -0.936746f, 0.069572f, 0.343027f ),
  1429. Point3F( 0.426545f, -0.465962f, 0.775202f ),
  1430. Point3F( 0.794542f, -0.227450f, 0.563000f ),
  1431. Point3F( -0.892172f, 0.091169f, -0.442399f ),
  1432. Point3F( -0.312654f, 0.541264f, 0.780564f ),
  1433. Point3F( 0.590603f, -0.735618f, -0.331743f ),
  1434. Point3F( -0.098040f, -0.986713f, 0.129558f ),
  1435. Point3F( 0.569646f, 0.283078f, -0.771603f ),
  1436. Point3F( 0.431051f, -0.407385f, -0.805129f ),
  1437. Point3F( -0.162087f, -0.938749f, -0.304104f ),
  1438. Point3F( 0.241533f, -0.359509f, 0.901341f ),
  1439. Point3F( -0.576191f, 0.614939f, 0.538380f ),
  1440. Point3F( -0.025110f, 0.085740f, 0.996001f ),
  1441. Point3F( -0.352693f, -0.198168f, 0.914515f ),
  1442. Point3F( -0.604577f, 0.700711f, 0.378802f ),
  1443. Point3F( 0.465024f, 0.409667f, 0.784809f ),
  1444. Point3F( -0.254684f, -0.030474f, -0.966544f ),
  1445. Point3F( -0.604789f, 0.791809f, 0.085259f ),
  1446. Point3F( -0.705147f, -0.399298f, 0.585943f ),
  1447. Point3F( 0.185691f, 0.017236f, -0.982457f ),
  1448. Point3F( 0.044588f, 0.973094f, 0.226052f ),
  1449. Point3F( -0.405463f, 0.642367f, 0.650357f ),
  1450. Point3F( -0.563959f, 0.599136f, -0.568319f ),
  1451. Point3F( 0.367162f, -0.072253f, -0.927347f ),
  1452. Point3F( 0.960429f, -0.213570f, -0.178783f ),
  1453. Point3F( -0.192629f, 0.906005f, 0.376893f ),
  1454. Point3F( -0.199718f, -0.359865f, -0.911378f ),
  1455. Point3F( 0.485072f, 0.121233f, -0.866030f ),
  1456. Point3F( 0.467163f, -0.874294f, 0.131792f ),
  1457. Point3F( -0.638953f, -0.716603f, 0.279677f ),
  1458. Point3F( -0.622710f, 0.047813f, -0.780990f ),
  1459. Point3F( 0.828724f, -0.054433f, -0.557004f ),
  1460. Point3F( 0.130241f, 0.991080f, 0.028245f ),
  1461. Point3F( 0.310995f, -0.950076f, -0.025242f ),
  1462. Point3F( 0.818118f, 0.275336f, 0.504850f ),
  1463. Point3F( 0.676328f, 0.387023f, 0.626733f ),
  1464. Point3F( -0.100433f, 0.495114f, -0.863004f ),
  1465. Point3F( -0.949609f, -0.240681f, -0.200786f ),
  1466. Point3F( -0.102610f, 0.261831f, -0.959644f ),
  1467. Point3F( -0.845732f, -0.493136f, 0.203850f ),
  1468. Point3F( 0.672617f, -0.738838f, 0.041290f ),
  1469. Point3F( 0.380465f, 0.875938f, 0.296613f ),
  1470. Point3F( -0.811223f, 0.262027f, -0.522742f ),
  1471. Point3F( -0.074423f, -0.775670f, -0.626736f ),
  1472. Point3F( -0.286499f, 0.755850f, -0.588735f ),
  1473. Point3F( 0.291182f, -0.276189f, -0.915933f ),
  1474. Point3F( -0.638117f, 0.199338f, 0.743687f ),
  1475. Point3F( 0.439922f, -0.864433f, -0.243359f ),
  1476. Point3F( 0.177649f, 0.206919f, 0.962094f ),
  1477. Point3F( 0.277107f, 0.948521f, 0.153361f ),
  1478. Point3F( 0.507629f, 0.661918f, -0.551523f ),
  1479. Point3F( -0.503110f, -0.579308f, -0.641313f ),
  1480. Point3F( 0.600522f, 0.736495f, -0.311364f ),
  1481. Point3F( -0.691096f, -0.715301f, -0.103592f ),
  1482. Point3F( -0.041083f, -0.858497f, 0.511171f ),
  1483. Point3F( 0.207773f, -0.480062f, -0.852274f ),
  1484. Point3F( 0.795719f, 0.464614f, 0.388543f ),
  1485. Point3F( -0.100433f, 0.495114f, -0.863004f ),
  1486. Point3F( 0.703249f, 0.065157f, -0.707951f ),
  1487. Point3F( -0.324171f, -0.941112f, 0.096024f ),
  1488. Point3F( -0.134933f, -0.940212f, 0.312722f ),
  1489. Point3F( -0.438240f, 0.752088f, -0.492249f ),
  1490. Point3F( 0.964762f, -0.198855f, 0.172311f ),
  1491. Point3F( -0.831799f, 0.196807f, 0.519015f ),
  1492. Point3F( -0.508008f, 0.819902f, 0.263986f ),
  1493. Point3F( 0.471075f, -0.001146f, 0.882092f ),
  1494. Point3F( 0.919512f, 0.246162f, -0.306435f ),
  1495. Point3F( -0.960050f, 0.279828f, -0.001187f ),
  1496. Point3F( 0.110232f, -0.847535f, -0.519165f ),
  1497. Point3F( 0.208229f, 0.697360f, 0.685806f ),
  1498. Point3F( -0.199680f, -0.560621f, 0.803637f ),
  1499. Point3F( 0.170135f, -0.679985f, -0.713214f ),
  1500. Point3F( 0.758371f, -0.494907f, 0.424195f ),
  1501. Point3F( 0.077734f, -0.755978f, 0.649965f ),
  1502. Point3F( 0.612831f, -0.672475f, 0.414987f ),
  1503. Point3F( 0.142776f, 0.836698f, -0.528726f ),
  1504. Point3F( -0.765185f, 0.635778f, 0.101382f ),
  1505. Point3F( 0.669873f, -0.419737f, 0.612447f ),
  1506. Point3F( 0.593549f, 0.194879f, 0.780847f ),
  1507. Point3F( 0.646930f, 0.752173f, 0.125368f ),
  1508. Point3F( 0.837721f, 0.545266f, -0.030127f ),
  1509. Point3F( 0.541505f, 0.768070f, 0.341820f ),
  1510. Point3F( 0.760679f, -0.365715f, -0.536301f ),
  1511. Point3F( 0.381516f, 0.640377f, 0.666605f ),
  1512. Point3F( 0.565794f, -0.072415f, -0.821361f ),
  1513. Point3F( -0.466072f, -0.401588f, 0.788356f ),
  1514. Point3F( 0.987146f, 0.096290f, 0.127560f ),
  1515. Point3F( 0.509709f, -0.688886f, -0.515396f ),
  1516. Point3F( -0.135132f, -0.988046f, -0.074192f ),
  1517. Point3F( 0.600499f, 0.476471f, -0.642166f ),
  1518. Point3F( -0.732326f, -0.275320f, -0.622815f ),
  1519. Point3F( -0.881141f, -0.470404f, 0.048078f ),
  1520. Point3F( 0.051548f, 0.601042f, 0.797553f ),
  1521. Point3F( 0.402027f, -0.763183f, 0.505891f ),
  1522. Point3F( 0.404233f, -0.208288f, 0.890624f ),
  1523. Point3F( -0.311793f, 0.343843f, 0.885752f ),
  1524. Point3F( 0.098132f, -0.937014f, 0.335223f ),
  1525. Point3F( 0.537158f, 0.830585f, -0.146936f ),
  1526. Point3F( 0.725277f, 0.298172f, -0.620538f ),
  1527. Point3F( -0.882025f, 0.342976f, -0.323110f ),
  1528. Point3F( -0.668829f, 0.424296f, -0.610443f ),
  1529. Point3F( -0.408835f, -0.476442f, -0.778368f ),
  1530. Point3F( 0.809472f, 0.397249f, -0.432375f ),
  1531. Point3F( -0.909184f, -0.205938f, -0.361903f ),
  1532. Point3F( 0.866930f, -0.347934f, -0.356895f ),
  1533. Point3F( 0.911660f, -0.141281f, -0.385897f ),
  1534. Point3F( -0.431404f, -0.844074f, -0.318480f ),
  1535. Point3F( -0.950593f, -0.073496f, 0.301614f ),
  1536. Point3F( -0.719716f, 0.626915f, -0.298305f ),
  1537. Point3F( -0.779887f, 0.617067f, -0.104899f ),
  1538. Point3F( -0.475899f, -0.542630f, 0.692151f ),
  1539. Point3F( 0.081952f, -0.157248f, -0.984153f ),
  1540. Point3F( 0.923990f, -0.381662f, -0.024025f ),
  1541. Point3F( -0.957998f, 0.120979f, -0.260008f ),
  1542. Point3F( 0.306601f, 0.227975f, -0.924134f ),
  1543. Point3F( -0.141244f, 0.989182f, 0.039601f ),
  1544. Point3F( 0.077097f, 0.186288f, -0.979466f ),
  1545. Point3F( -0.630407f, -0.259801f, 0.731499f ),
  1546. Point3F( 0.718150f, 0.637408f, 0.279233f ),
  1547. Point3F( 0.340946f, 0.110494f, 0.933567f ),
  1548. Point3F( -0.396671f, 0.503020f, -0.767869f ),
  1549. Point3F( 0.636943f, -0.245005f, 0.730942f ),
  1550. Point3F( -0.849605f, -0.518660f, -0.095724f ),
  1551. Point3F( -0.388203f, 0.105395f, 0.915527f ),
  1552. Point3F( -0.280671f, -0.776541f, -0.564099f ),
  1553. Point3F( -0.601680f, 0.215451f, -0.769131f ),
  1554. Point3F( -0.660112f, -0.632371f, -0.405412f ),
  1555. Point3F( 0.921096f, 0.284072f, 0.266242f ),
  1556. Point3F( 0.074850f, -0.300846f, 0.950731f ),
  1557. Point3F( 0.943952f, -0.067062f, 0.323198f ),
  1558. Point3F( -0.917838f, -0.254589f, 0.304561f ),
  1559. Point3F( 0.889843f, -0.409008f, 0.202219f ),
  1560. Point3F( -0.565849f, 0.753721f, -0.334246f ),
  1561. Point3F( 0.791460f, 0.555918f, -0.254060f ),
  1562. Point3F( 0.261936f, 0.703590f, -0.660568f ),
  1563. Point3F( -0.234406f, 0.952084f, 0.196444f ),
  1564. Point3F( 0.111205f, 0.979492f, -0.168014f ),
  1565. Point3F( -0.869844f, -0.109095f, -0.481113f ),
  1566. Point3F( -0.337728f, -0.269701f, -0.901777f ),
  1567. Point3F( 0.366793f, 0.408875f, -0.835634f ),
  1568. Point3F( -0.098749f, 0.261316f, 0.960189f ),
  1569. Point3F( -0.272379f, -0.847100f, 0.456324f ),
  1570. Point3F( -0.319506f, 0.287444f, -0.902935f ),
  1571. Point3F( 0.873383f, -0.294109f, 0.388203f ),
  1572. Point3F( -0.088950f, 0.710450f, 0.698104f ),
  1573. Point3F( 0.551238f, -0.786552f, 0.278340f ),
  1574. Point3F( 0.724436f, -0.663575f, -0.186712f ),
  1575. Point3F( 0.529741f, -0.606539f, 0.592861f ),
  1576. Point3F( -0.949743f, -0.282514f, 0.134809f ),
  1577. Point3F( 0.155047f, 0.419442f, -0.894443f ),
  1578. Point3F( -0.562653f, -0.329139f, -0.758346f ),
  1579. Point3F( 0.816407f, -0.576953f, 0.024576f ),
  1580. Point3F( 0.178550f, -0.950242f, -0.255266f ),
  1581. Point3F( 0.479571f, 0.706691f, 0.520192f ),
  1582. Point3F( 0.391687f, 0.559884f, -0.730145f ),
  1583. Point3F( 0.724872f, -0.205570f, -0.657496f ),
  1584. Point3F( -0.663196f, -0.517587f, -0.540624f ),
  1585. Point3F( -0.660054f, -0.122486f, -0.741165f ),
  1586. Point3F( -0.531989f, 0.374711f, -0.759328f ),
  1587. Point3F( 0.194979f, -0.059120f, 0.979024f )
  1588. };
  1589. U8 TSMesh::encodeNormal( const Point3F &normal )
  1590. {
  1591. U8 bestIndex = 0;
  1592. F32 bestDot = -10E30f;
  1593. for ( U32 i = 0; i < 256; i++ )
  1594. {
  1595. F32 dot = mDot( normal, smU8ToNormalTable[i] );
  1596. if ( dot > bestDot )
  1597. {
  1598. bestIndex = i;
  1599. bestDot = dot;
  1600. }
  1601. }
  1602. return bestIndex;
  1603. }
  1604. //-----------------------------------------------------
  1605. // TSMesh assemble from/ dissemble to memory buffer
  1606. //-----------------------------------------------------
  1607. #define tsalloc TSShape::smTSAlloc
  1608. TSMesh* TSMesh::assembleMesh( U32 meshType, bool skip )
  1609. {
  1610. static TSMesh tempStandardMesh;
  1611. static TSSkinMesh tempSkinMesh;
  1612. static TSDecalMesh tempDecalMesh;
  1613. static TSSortedMesh tempSortedMesh;
  1614. bool justSize = skip || !tsalloc.allocShape32(0); // if this returns NULL, we're just sizing memory block
  1615. // a little funny business because we pretend decals are derived from meshes
  1616. S32 * ret = NULL;
  1617. TSMesh * mesh = NULL;
  1618. TSDecalMesh * decal = NULL;
  1619. if ( justSize )
  1620. {
  1621. switch ( meshType )
  1622. {
  1623. case StandardMeshType :
  1624. {
  1625. ret = (S32*)&tempStandardMesh;
  1626. mesh = &tempStandardMesh;
  1627. tsalloc.allocShape32( sizeof(TSMesh) >> 2 );
  1628. break;
  1629. }
  1630. case SkinMeshType :
  1631. {
  1632. ret = (S32*)&tempSkinMesh;
  1633. mesh = &tempSkinMesh;
  1634. tsalloc.allocShape32( sizeof(TSSkinMesh) >> 2 );
  1635. break;
  1636. }
  1637. case DecalMeshType :
  1638. {
  1639. ret = (S32*)&tempDecalMesh;
  1640. decal = &tempDecalMesh;
  1641. tsalloc.allocShape32( sizeof(TSDecalMesh) >> 2 );
  1642. break;
  1643. }
  1644. case SortedMeshType :
  1645. {
  1646. ret = (S32*)&tempSortedMesh;
  1647. mesh = &tempSortedMesh;
  1648. tsalloc.allocShape32( sizeof(TSSortedMesh) >> 2 );
  1649. break;
  1650. }
  1651. }
  1652. }
  1653. else
  1654. {
  1655. switch ( meshType )
  1656. {
  1657. case StandardMeshType :
  1658. {
  1659. ret = tsalloc.allocShape32( sizeof(TSMesh) >> 2 );
  1660. constructInPlace( (TSMesh*)ret );
  1661. mesh = (TSMesh*)ret;
  1662. break;
  1663. }
  1664. case SkinMeshType :
  1665. {
  1666. ret = tsalloc.allocShape32( sizeof(TSSkinMesh) >> 2 );
  1667. constructInPlace( (TSSkinMesh*)ret );
  1668. mesh = (TSSkinMesh*)ret;
  1669. break;
  1670. }
  1671. case DecalMeshType :
  1672. {
  1673. ret = tsalloc.allocShape32( sizeof(TSDecalMesh) >> 2 );
  1674. constructInPlace((TSDecalMesh*)ret);
  1675. decal = (TSDecalMesh*)ret;
  1676. break;
  1677. }
  1678. case SortedMeshType :
  1679. {
  1680. ret = tsalloc.allocShape32( sizeof(TSSortedMesh) >> 2 );
  1681. constructInPlace( (TSSortedMesh*)ret );
  1682. mesh = (TSSortedMesh*)ret;
  1683. break;
  1684. }
  1685. }
  1686. }
  1687. tsalloc.setSkipMode( skip );
  1688. if ( mesh )
  1689. mesh->assemble( skip );
  1690. if ( decal )
  1691. decal->assemble( skip );
  1692. tsalloc.setSkipMode( false );
  1693. return (TSMesh*)ret;
  1694. }
  1695. void TSMesh::convertToTris( const TSDrawPrimitive *primitivesIn,
  1696. const S32 *indicesIn,
  1697. S32 numPrimIn,
  1698. S32 &numPrimOut,
  1699. S32 &numIndicesOut,
  1700. TSDrawPrimitive *primitivesOut,
  1701. S32 *indicesOut ) const
  1702. {
  1703. S32 prevMaterial = -99999;
  1704. TSDrawPrimitive * newDraw = NULL;
  1705. numPrimOut = 0;
  1706. numIndicesOut = 0;
  1707. for ( S32 i = 0; i < numPrimIn; i++ )
  1708. {
  1709. S32 newMat = primitivesIn[i].matIndex;
  1710. newMat &= ~TSDrawPrimitive::TypeMask;
  1711. U32 start = primitivesIn[i].start;
  1712. U32 prevStart = (i > 0) ? primitivesIn[i-1].start : start;
  1713. U32 numElements = primitivesIn[i].numElements;
  1714. // Add a new primitive if changing materials, or if this primitive
  1715. // indexes vertices in a different 16-bit range
  1716. if ( ( newMat != prevMaterial ) ||
  1717. ((indicesIn[prevStart] ^ indicesIn[start]) & 0xFFFF0000) )
  1718. {
  1719. if ( primitivesOut )
  1720. {
  1721. newDraw = &primitivesOut[numPrimOut];
  1722. newDraw->start = numIndicesOut;
  1723. newDraw->numElements = 0;
  1724. newDraw->matIndex = newMat | TSDrawPrimitive::Triangles;
  1725. }
  1726. numPrimOut++;
  1727. prevMaterial = newMat;
  1728. }
  1729. // gonna depend on what kind of primitive it is...
  1730. if ( (primitivesIn[i].matIndex & TSDrawPrimitive::TypeMask) == TSDrawPrimitive::Triangles)
  1731. {
  1732. for ( S32 j = 0; j < numElements; j += 3 )
  1733. {
  1734. if ( indicesOut )
  1735. {
  1736. indicesOut[numIndicesOut + 0] = indicesIn[start + j + 0];
  1737. indicesOut[numIndicesOut + 1] = indicesIn[start + j + 1];
  1738. indicesOut[numIndicesOut + 2] = indicesIn[start + j + 2];
  1739. }
  1740. if ( newDraw )
  1741. newDraw->numElements += 3;
  1742. numIndicesOut += 3;
  1743. }
  1744. }
  1745. else
  1746. {
  1747. U32 idx0 = indicesIn[start + 0];
  1748. U32 idx1;
  1749. U32 idx2 = indicesIn[start + 1];
  1750. U32 * nextIdx = &idx1;
  1751. for ( S32 j = 2; j < numElements; j++ )
  1752. {
  1753. *nextIdx = idx2;
  1754. nextIdx = (U32*) ( (dsize_t)nextIdx ^ (dsize_t)&idx0 ^ (dsize_t)&idx1);
  1755. idx2 = indicesIn[start + j];
  1756. if ( idx0 == idx1 || idx1 == idx2 || idx2 == idx0 )
  1757. continue;
  1758. if ( indicesOut )
  1759. {
  1760. indicesOut[numIndicesOut+0] = idx0;
  1761. indicesOut[numIndicesOut+1] = idx1;
  1762. indicesOut[numIndicesOut+2] = idx2;
  1763. }
  1764. if ( newDraw )
  1765. newDraw->numElements += 3;
  1766. numIndicesOut += 3;
  1767. }
  1768. }
  1769. }
  1770. }
  1771. void unwindStrip( const S32 * indices, S32 numElements, Vector<S32> &triIndices )
  1772. {
  1773. U32 idx0 = indices[0];
  1774. U32 idx1;
  1775. U32 idx2 = indices[1];
  1776. U32 * nextIdx = &idx1;
  1777. for ( S32 j = 2; j < numElements; j++ )
  1778. {
  1779. *nextIdx = idx2;
  1780. nextIdx = (U32*) ( (dsize_t)nextIdx ^ (dsize_t)&idx0 ^ (dsize_t)&idx1);
  1781. idx2 = indices[j];
  1782. if ( idx0 == idx1 || idx1 == idx2 || idx2 == idx0 )
  1783. continue;
  1784. triIndices.push_back( idx0 );
  1785. triIndices.push_back( idx1 );
  1786. triIndices.push_back( idx2 );
  1787. }
  1788. }
  1789. void TSMesh::convertToSingleStrip( const TSDrawPrimitive *primitivesIn,
  1790. const S32 *indicesIn,
  1791. S32 numPrimIn,
  1792. S32 &numPrimOut,
  1793. S32 &numIndicesOut,
  1794. TSDrawPrimitive *primitivesOut,
  1795. S32 *indicesOut ) const
  1796. {
  1797. S32 prevMaterial = -99999;
  1798. TSDrawPrimitive * newDraw = NULL;
  1799. TSDrawPrimitive * newTris = NULL;
  1800. Vector<S32> triIndices;
  1801. S32 curDrawOut = 0;
  1802. numPrimOut = 0;
  1803. numIndicesOut = 0;
  1804. for ( S32 i = 0; i < numPrimIn; i++ )
  1805. {
  1806. S32 newMat = primitivesIn[i].matIndex;
  1807. U32 start = primitivesIn[i].start;
  1808. U32 prevStart = (i > 0) ? primitivesIn[i-1].start : start;
  1809. U32 numElements = primitivesIn[i].numElements;
  1810. // Add a new primitive if changing materials, or if this primitive
  1811. // indexes vertices in a different 16-bit range
  1812. if ( ( newMat != prevMaterial ) ||
  1813. ((indicesIn[prevStart] ^ indicesIn[start]) & 0xFFFF0000) )
  1814. {
  1815. // before adding the new primitive, transfer triangle indices
  1816. if ( triIndices.size() )
  1817. {
  1818. if ( newTris && indicesOut )
  1819. {
  1820. newTris->start = numIndicesOut;
  1821. newTris->numElements = triIndices.size();
  1822. dMemcpy(&indicesOut[numIndicesOut],triIndices.address(),triIndices.size()*sizeof(U32));
  1823. }
  1824. numIndicesOut += triIndices.size();
  1825. triIndices.clear();
  1826. newTris = NULL;
  1827. }
  1828. if ( primitivesOut )
  1829. {
  1830. newDraw = &primitivesOut[numPrimOut];
  1831. newDraw->start = numIndicesOut;
  1832. newDraw->numElements = 0;
  1833. newDraw->matIndex = newMat;
  1834. }
  1835. numPrimOut++;
  1836. curDrawOut = 0;
  1837. prevMaterial = newMat;
  1838. }
  1839. // gonna depend on what kind of primitive it is...
  1840. // from above we know it's the same kind as the one we're building...
  1841. if ( (primitivesIn[i].matIndex & TSDrawPrimitive::TypeMask) == TSDrawPrimitive::Triangles)
  1842. {
  1843. // triangles primitive...add to it
  1844. for ( S32 j = 0; j < numElements; j += 3 )
  1845. {
  1846. if ( indicesOut )
  1847. {
  1848. indicesOut[numIndicesOut + 0] = indicesIn[start + j + 0];
  1849. indicesOut[numIndicesOut + 1] = indicesIn[start + j + 1];
  1850. indicesOut[numIndicesOut + 2] = indicesIn[start + j + 2];
  1851. }
  1852. if ( newDraw )
  1853. newDraw->numElements += 3;
  1854. numIndicesOut += 3;
  1855. }
  1856. }
  1857. else
  1858. {
  1859. // strip primitive...
  1860. // if numElements less than smSmallestStripSize, add to triangles...
  1861. if ( numElements < smMinStripSize + 2 )
  1862. {
  1863. // put triangle indices aside until material changes...
  1864. if ( triIndices.empty() )
  1865. {
  1866. // set up for new triangle primitive and add it if we are copying data right now
  1867. if ( primitivesOut )
  1868. {
  1869. newTris = &primitivesOut[numPrimOut];
  1870. newTris->matIndex = newMat;
  1871. newTris->matIndex &= ~(TSDrawPrimitive::Triangles|TSDrawPrimitive::Strip);
  1872. newTris->matIndex |= TSDrawPrimitive::Triangles;
  1873. }
  1874. numPrimOut++;
  1875. }
  1876. unwindStrip( indicesIn + start, numElements, triIndices );
  1877. }
  1878. else
  1879. {
  1880. // strip primitive...add to it
  1881. if ( indicesOut )
  1882. {
  1883. if ( curDrawOut & 1 )
  1884. {
  1885. indicesOut[numIndicesOut + 0] = indicesOut[numIndicesOut - 1];
  1886. indicesOut[numIndicesOut + 1] = indicesOut[numIndicesOut - 1];
  1887. indicesOut[numIndicesOut + 2] = indicesIn[start];
  1888. dMemcpy(indicesOut+numIndicesOut+3,indicesIn+start,numElements*sizeof(U32));
  1889. }
  1890. else if ( curDrawOut )
  1891. {
  1892. indicesOut[numIndicesOut + 0] = indicesOut[numIndicesOut - 1];
  1893. indicesOut[numIndicesOut + 1] = indicesIn[start];
  1894. dMemcpy(indicesOut+numIndicesOut+2,indicesIn+start,numElements*sizeof(U32));
  1895. }
  1896. else
  1897. dMemcpy(indicesOut+numIndicesOut,indicesIn+start,numElements*sizeof(U32));
  1898. }
  1899. S32 added = numElements;
  1900. added += curDrawOut ? (curDrawOut&1 ? 3 : 2) : 0;
  1901. if ( newDraw )
  1902. newDraw->numElements += added;
  1903. numIndicesOut += added;
  1904. curDrawOut += added;
  1905. }
  1906. }
  1907. }
  1908. // spit out tris before leaving
  1909. // before adding the new primitive, transfer triangle indices
  1910. if ( triIndices.size() )
  1911. {
  1912. if ( newTris && indicesOut )
  1913. {
  1914. newTris->start = numIndicesOut;
  1915. newTris->numElements = triIndices.size();
  1916. dMemcpy(&indicesOut[numIndicesOut],triIndices.address(),triIndices.size()*sizeof(U32));
  1917. }
  1918. numIndicesOut += triIndices.size();
  1919. triIndices.clear();
  1920. newTris = NULL;
  1921. }
  1922. }
  1923. // this method does none of the converting that the above methods do, except that small strips are converted
  1924. // to triangle lists...
  1925. void TSMesh::leaveAsMultipleStrips( const TSDrawPrimitive *primitivesIn,
  1926. const S32 *indicesIn,
  1927. S32 numPrimIn,
  1928. S32 &numPrimOut,
  1929. S32 &numIndicesOut,
  1930. TSDrawPrimitive *primitivesOut,
  1931. S32 *indicesOut ) const
  1932. {
  1933. S32 prevMaterial = -99999;
  1934. TSDrawPrimitive * newDraw = NULL;
  1935. Vector<S32> triIndices;
  1936. numPrimOut = 0;
  1937. numIndicesOut = 0;
  1938. for ( S32 i = 0; i < numPrimIn; i++ )
  1939. {
  1940. S32 newMat = primitivesIn[i].matIndex;
  1941. U32 start = primitivesIn[i].start;
  1942. U32 prevStart = (i > 0) ? primitivesIn[i-1].start : start;
  1943. U32 numElements = primitivesIn[i].numElements;
  1944. // Add a new primitive if changing materials, or if this primitive
  1945. // indexes vertices in a different 16-bit range
  1946. if ( triIndices.size() &&
  1947. (( newMat != prevMaterial ) ||
  1948. ((indicesIn[prevStart] ^ indicesIn[start]) & 0xFFFF0000) ))
  1949. {
  1950. // material just changed and we have triangles lying around
  1951. // add primitive and indices for triangles and clear triIndices
  1952. if ( indicesOut )
  1953. {
  1954. TSDrawPrimitive * newTris = &primitivesOut[numPrimOut];
  1955. newTris->matIndex = prevMaterial;
  1956. newTris->matIndex &= ~(TSDrawPrimitive::Triangles|TSDrawPrimitive::Strip);
  1957. newTris->matIndex |= TSDrawPrimitive::Triangles;
  1958. newTris->start = numIndicesOut;
  1959. newTris->numElements = triIndices.size();
  1960. dMemcpy(&indicesOut[numIndicesOut],triIndices.address(),triIndices.size()*sizeof(U32));
  1961. }
  1962. numPrimOut++;
  1963. numIndicesOut += triIndices.size();
  1964. triIndices.clear();
  1965. }
  1966. // this is a little convoluted because this code was adapted from convertToSingleStrip
  1967. // but we will need a new primitive only if it is a triangle primitive coming in
  1968. // or we have more elements than the min strip size...
  1969. if ( (primitivesIn[i].matIndex & TSDrawPrimitive::TypeMask) == TSDrawPrimitive::Triangles || numElements>=smMinStripSize+2)
  1970. {
  1971. if ( primitivesOut )
  1972. {
  1973. newDraw = &primitivesOut[numPrimOut];
  1974. newDraw->start = numIndicesOut;
  1975. newDraw->numElements = 0;
  1976. newDraw->matIndex = newMat;
  1977. }
  1978. numPrimOut++;
  1979. }
  1980. prevMaterial = newMat;
  1981. // gonna depend on what kind of primitive it is...
  1982. // from above we know it's the same kind as the one we're building...
  1983. if ( (primitivesIn[i].matIndex & TSDrawPrimitive::TypeMask) == TSDrawPrimitive::Triangles)
  1984. {
  1985. // triangles primitive...add to it
  1986. for ( S32 j = 0; j < numElements; j += 3 )
  1987. {
  1988. if ( indicesOut )
  1989. {
  1990. indicesOut[numIndicesOut + 0] = indicesIn[start + j + 0];
  1991. indicesOut[numIndicesOut + 1] = indicesIn[start + j + 1];
  1992. indicesOut[numIndicesOut + 2] = indicesIn[start + j + 2];
  1993. }
  1994. if ( newDraw )
  1995. newDraw->numElements += 3;
  1996. numIndicesOut += 3;
  1997. }
  1998. }
  1999. else
  2000. {
  2001. // strip primitive...
  2002. // if numElements less than smSmallestStripSize, add to triangles...
  2003. if ( numElements < smMinStripSize + 2 )
  2004. // put triangle indices aside until material changes...
  2005. unwindStrip( indicesIn + start, numElements, triIndices );
  2006. else
  2007. {
  2008. // strip primitive...add to it
  2009. if ( indicesOut )
  2010. dMemcpy(indicesOut+numIndicesOut,indicesIn+start,numElements*sizeof(U32));
  2011. if ( newDraw )
  2012. newDraw->numElements = numElements;
  2013. numIndicesOut += numElements;
  2014. }
  2015. }
  2016. }
  2017. // spit out tris before leaving
  2018. if ( triIndices.size() )
  2019. {
  2020. // material just changed and we have triangles lying around
  2021. // add primitive and indices for triangles and clear triIndices
  2022. if ( indicesOut )
  2023. {
  2024. TSDrawPrimitive *newTris = &primitivesOut[numPrimOut];
  2025. newTris->matIndex = prevMaterial;
  2026. newTris->matIndex &= ~(TSDrawPrimitive::Triangles|TSDrawPrimitive::Strip);
  2027. newTris->matIndex |= TSDrawPrimitive::Triangles;
  2028. newTris->start = numIndicesOut;
  2029. newTris->numElements = triIndices.size();
  2030. dMemcpy(&indicesOut[numIndicesOut],triIndices.address(),triIndices.size()*sizeof(U32));
  2031. }
  2032. numPrimOut++;
  2033. numIndicesOut += triIndices.size();
  2034. triIndices.clear();
  2035. }
  2036. }
  2037. // This method retrieves data that is shared (or possibly shared) between different meshes.
  2038. // This adds an extra step to the copying of data from the memory buffer to the shape data buffer.
  2039. // If we have no parentMesh, then we either return a pointer to the data in the memory buffer
  2040. // (in the case that we skip this mesh) or copy the data into the shape data buffer and return
  2041. // that pointer (in the case that we don't skip this mesh).
  2042. // If we do have a parent mesh, then we return a pointer to the data in the shape buffer,
  2043. // copying the data in there ourselves if our parent didn't already do it (i.e., if it was skipped).
  2044. S32 * TSMesh::getSharedData32( S32 parentMesh, S32 size, S32 **source, bool skip )
  2045. {
  2046. S32 * ptr;
  2047. if( parentMesh < 0 )
  2048. ptr = skip ? tsalloc.getPointer32( size ) : tsalloc.copyToShape32( size );
  2049. else
  2050. {
  2051. ptr = source[parentMesh];
  2052. // if we skipped the previous mesh (and we're not skipping this one) then
  2053. // we still need to copy points into the shape...
  2054. if ( !smDataCopied[parentMesh] && !skip )
  2055. {
  2056. S32 * tmp = ptr;
  2057. ptr = tsalloc.allocShape32( size );
  2058. if ( ptr && tmp )
  2059. dMemcpy(ptr, tmp, size * sizeof(S32) );
  2060. }
  2061. }
  2062. return ptr;
  2063. }
  2064. S8 * TSMesh::getSharedData8( S32 parentMesh, S32 size, S8 **source, bool skip )
  2065. {
  2066. S8 * ptr;
  2067. if( parentMesh < 0 )
  2068. ptr = skip ? tsalloc.getPointer8( size ) : tsalloc.copyToShape8( size );
  2069. else
  2070. {
  2071. ptr = source[parentMesh];
  2072. // if we skipped the previous mesh (and we're not skipping this one) then
  2073. // we still need to copy points into the shape...
  2074. if ( !smDataCopied[parentMesh] && !skip )
  2075. {
  2076. S8 * tmp = ptr;
  2077. ptr = tsalloc.allocShape8( size );
  2078. if ( ptr && tmp )
  2079. dMemcpy( ptr, tmp, size * sizeof(S32) );
  2080. }
  2081. }
  2082. return ptr;
  2083. }
  2084. void TSMesh::dumpPrimitives(U32 startVertex, U32 startIndex, GFXPrimitive *piArray, U16* ibIndices)
  2085. {
  2086. // go through and create PrimitiveInfo array
  2087. GFXPrimitive pInfo;
  2088. U32 primitivesSize = mPrimitives.size();
  2089. for (U32 i = 0; i < primitivesSize; i++)
  2090. {
  2091. const TSDrawPrimitive & draw = mPrimitives[i];
  2092. GFXPrimitiveType drawType = getDrawType(draw.matIndex >> 30);
  2093. switch (drawType)
  2094. {
  2095. case GFXTriangleList:
  2096. pInfo.type = drawType;
  2097. pInfo.numPrimitives = draw.numElements / 3;
  2098. pInfo.startIndex = startIndex + draw.start;
  2099. // Use the first index to determine which 16-bit address space we are operating in
  2100. pInfo.startVertex = (mIndices[draw.start] & 0xFFFF0000); // TODO: figure out a good solution for this
  2101. pInfo.minIndex = 0; // minIndex are zero based index relative to startVertex. See @GFXDevice
  2102. pInfo.numVertices = getMin((U32)0x10000, mNumVerts - pInfo.startVertex);
  2103. pInfo.startVertex += startVertex;
  2104. break;
  2105. case GFXTriangleStrip:
  2106. pInfo.type = drawType;
  2107. pInfo.numPrimitives = draw.numElements - 2;
  2108. pInfo.startIndex = startIndex + draw.start;
  2109. // Use the first index to determine which 16-bit address space we are operating in
  2110. pInfo.startVertex = (mIndices[draw.start] & 0xFFFF0000); // TODO: figure out a good solution for this
  2111. pInfo.minIndex = 0; // minIndex are zero based index relative to startVertex. See @GFXDevice
  2112. pInfo.numVertices = getMin((U32)0x10000, mNumVerts - pInfo.startVertex);
  2113. pInfo.startVertex += startVertex;
  2114. break;
  2115. default:
  2116. AssertFatal(false, "WTF?!");
  2117. }
  2118. *piArray++ = pInfo;
  2119. }
  2120. dCopyArray(ibIndices, mIndices.address(), mIndices.size());
  2121. }
  2122. void TSMesh::assemble( bool skip )
  2123. {
  2124. tsalloc.checkGuard();
  2125. numFrames = tsalloc.get32();
  2126. numMatFrames = tsalloc.get32();
  2127. mParentMesh = tsalloc.get32();
  2128. tsalloc.get32( (S32*)&mBounds, 6 );
  2129. tsalloc.get32( (S32*)&mCenter, 3 );
  2130. mRadius = (F32)tsalloc.get32();
  2131. if (TSShape::smReadVersion >= 27)
  2132. {
  2133. // Offsetted
  2134. mVertOffset = tsalloc.get32();
  2135. mNumVerts = tsalloc.get32();
  2136. mVertSize = tsalloc.get32();
  2137. }
  2138. else
  2139. {
  2140. mVertOffset = 0;
  2141. mNumVerts = 0;
  2142. mVertSize = 0;
  2143. }
  2144. S32 numVerts = tsalloc.get32();
  2145. S32 *ptr32 = getSharedData32(mParentMesh, 3 * numVerts, (S32**)smVertsList.address(), skip );
  2146. mVerts.set( (Point3F*)ptr32, numVerts );
  2147. S32 numTVerts = tsalloc.get32();
  2148. ptr32 = getSharedData32(mParentMesh, 2 * numTVerts, (S32**)smTVertsList.address(), skip );
  2149. mTverts.set( (Point2F*)ptr32, numTVerts );
  2150. if ( TSShape::smReadVersion > 25 )
  2151. {
  2152. numTVerts = tsalloc.get32();
  2153. ptr32 = getSharedData32(mParentMesh, 2 * numTVerts, (S32**)smTVerts2List.address(), skip );
  2154. mTverts2.set( (Point2F*)ptr32, numTVerts );
  2155. S32 numVColors = tsalloc.get32();
  2156. ptr32 = getSharedData32(mParentMesh, numVColors, (S32**)smColorsList.address(), skip );
  2157. mColors.set( (ColorI*)ptr32, numVColors );
  2158. }
  2159. S8 *ptr8;
  2160. if ( TSShape::smReadVersion > 21 && TSMesh::smUseEncodedNormals)
  2161. {
  2162. // we have encoded normals and we want to use them...
  2163. if (mParentMesh < 0 )
  2164. tsalloc.getPointer32( numVerts * 3 ); // adva nce past norms, don't use
  2165. mNorms.set( NULL, 0 );
  2166. ptr8 = getSharedData8(mParentMesh, numVerts, (S8**)smEncodedNormsList.address(), skip );
  2167. mEncodedNorms.set( ptr8, numVerts );
  2168. }
  2169. else if ( TSShape::smReadVersion > 21 )
  2170. {
  2171. // we have encoded normals but we don't want to use them...
  2172. ptr32 = getSharedData32(mParentMesh, 3 * numVerts, (S32**)smNormsList.address(), skip );
  2173. mNorms.set( (Point3F*)ptr32, numVerts );
  2174. if (mParentMesh < 0 )
  2175. tsalloc.getPointer8( numVerts ); // advance past encoded normls, don't use
  2176. mEncodedNorms.set( NULL, 0 );
  2177. }
  2178. else
  2179. {
  2180. // no encoded normals...
  2181. ptr32 = getSharedData32(mParentMesh, 3 * numVerts, (S32**)smNormsList.address(), skip );
  2182. mNorms.set( (Point3F*)ptr32, numVerts );
  2183. mEncodedNorms.set( NULL, 0 );
  2184. }
  2185. // copy the primitives and indices...how we do this depends on what
  2186. // form we want them in when copied...just get pointers to data for now
  2187. S32 szPrimIn, szIndIn;
  2188. TSDrawPrimitive *primIn;
  2189. S32 *indIn;
  2190. bool deleteInputArrays = false;
  2191. if (TSShape::smReadVersion > 25)
  2192. {
  2193. // mesh primitives (start, numElements) and indices are stored as 32 bit values
  2194. szPrimIn = tsalloc.get32();
  2195. primIn = (TSDrawPrimitive*)tsalloc.getPointer32(szPrimIn*3);
  2196. szIndIn = tsalloc.get32();
  2197. indIn = tsalloc.getPointer32(szIndIn);
  2198. }
  2199. else
  2200. {
  2201. // mesh primitives (start, numElements) indices are stored as 16 bit values
  2202. szPrimIn = tsalloc.get32();
  2203. S16 *prim16 = tsalloc.getPointer16(szPrimIn*2); // primitive: start, numElements
  2204. S32 *prim32 = tsalloc.getPointer32(szPrimIn); // primitive: matIndex
  2205. szIndIn = tsalloc.get32();
  2206. // warn about non-addressable indices
  2207. if ( !skip && szIndIn >= 0x10000 )
  2208. {
  2209. Con::warnf("Mesh contains non-addressable indices, and may not render "
  2210. "correctly. Either split this mesh into pieces of no more than 65k "
  2211. "unique verts prior to export, or use COLLADA.");
  2212. }
  2213. S16 *ind16 = tsalloc.getPointer16(szIndIn);
  2214. // need to copy to temporary arrays
  2215. deleteInputArrays = true;
  2216. primIn = new TSDrawPrimitive[szPrimIn];
  2217. for (S32 i = 0; i < szPrimIn; i++)
  2218. {
  2219. primIn[i].start = prim16[i*2];
  2220. primIn[i].numElements = prim16[i*2+1];
  2221. primIn[i].matIndex = prim32[i];
  2222. }
  2223. indIn = new S32[szIndIn];
  2224. dCopyArray(indIn, ind16, szIndIn);
  2225. }
  2226. // count the number of output primitives and indices
  2227. S32 szPrimOut = szPrimIn, szIndOut = szIndIn;
  2228. if (smUseTriangles)
  2229. convertToTris(primIn, indIn, szPrimIn, szPrimOut, szIndOut, NULL, NULL);
  2230. else if (smUseOneStrip)
  2231. convertToSingleStrip(primIn, indIn, szPrimIn, szPrimOut, szIndOut, NULL, NULL);
  2232. else
  2233. leaveAsMultipleStrips(primIn, indIn, szPrimIn, szPrimOut, szIndOut, NULL, NULL);
  2234. // allocate enough space for the new primitives and indices (all 32 bits)
  2235. TSDrawPrimitive *primOut = (TSDrawPrimitive*)tsalloc.allocShape32(3*szPrimOut);
  2236. S32 *indOut = tsalloc.allocShape32(szIndOut);
  2237. // copy output primitives and indices
  2238. S32 chkPrim = szPrimOut, chkInd = szIndOut;
  2239. if (smUseTriangles)
  2240. convertToTris(primIn, indIn, szPrimIn, chkPrim, chkInd, primOut, indOut);
  2241. else if (smUseOneStrip)
  2242. convertToSingleStrip(primIn, indIn, szPrimIn, chkPrim, chkInd, primOut, indOut);
  2243. else
  2244. leaveAsMultipleStrips(primIn, indIn, szPrimIn, chkPrim, chkInd, primOut, indOut);
  2245. AssertFatal(chkPrim==szPrimOut && chkInd==szIndOut,"TSMesh::primitive conversion");
  2246. // store output
  2247. mPrimitives.set(primOut, szPrimOut);
  2248. mIndices.set(indOut, szIndOut);
  2249. // delete temporary arrays if necessary
  2250. if (deleteInputArrays)
  2251. {
  2252. delete [] primIn;
  2253. delete [] indIn;
  2254. }
  2255. S32 sz = tsalloc.get32();
  2256. tsalloc.getPointer16( sz ); // skip deprecated merge indices
  2257. tsalloc.align32();
  2258. vertsPerFrame = tsalloc.get32();
  2259. U32 flags = (U32)tsalloc.get32();
  2260. if ( mEncodedNorms.size() )
  2261. flags |= UseEncodedNormals;
  2262. setFlags( flags );
  2263. // Set color & tvert2 flags if we have an old version
  2264. if (TSShape::smReadVersion < 27)
  2265. {
  2266. if (mColors.size() > 0) setFlags(HasColor);
  2267. if (mTverts2.size() > 0) setFlags(HasTVert2);
  2268. mNumVerts = mVerts.size();
  2269. }
  2270. tsalloc.checkGuard();
  2271. if ( tsalloc.allocShape32( 0 ) && TSShape::smReadVersion < 19 )
  2272. computeBounds(); // only do this if we copied the data...
  2273. createTangents(mVerts, mNorms);
  2274. }
  2275. void TSMesh::disassemble()
  2276. {
  2277. tsalloc.setGuard();
  2278. tsalloc.set32( numFrames );
  2279. tsalloc.set32( numMatFrames );
  2280. tsalloc.set32(mParentMesh);
  2281. tsalloc.copyToBuffer32( (S32*)&mBounds, 6 );
  2282. tsalloc.copyToBuffer32( (S32*)&mCenter, 3 );
  2283. tsalloc.set32( (S32)mRadius );
  2284. bool shouldMakeEditable = TSShape::smVersion < 27 || mVertSize == 0;
  2285. // Re-create the vectors
  2286. if (shouldMakeEditable)
  2287. {
  2288. makeEditable();
  2289. // No Offset
  2290. if (TSShape::smVersion >= 27)
  2291. {
  2292. tsalloc.set32(0);
  2293. tsalloc.set32(0);
  2294. tsalloc.set32(0);
  2295. }
  2296. }
  2297. else
  2298. {
  2299. // Offsetted
  2300. tsalloc.set32(mVertOffset);
  2301. tsalloc.set32(mNumVerts);
  2302. tsalloc.set32(mVertSize);
  2303. AssertFatal(mNumVerts >= vertsPerFrame, "invalid mNumVerts");
  2304. }
  2305. if (TSShape::smVersion >= 27 && mVertexData.isReady())
  2306. {
  2307. // If not editable all arrays are effectively 0.
  2308. tsalloc.set32(0); // verts
  2309. tsalloc.set32(0); // tverts
  2310. tsalloc.set32(0); // tverts2
  2311. tsalloc.set32(0); // colors
  2312. }
  2313. else
  2314. {
  2315. // verts...
  2316. tsalloc.set32(mVerts.size());
  2317. if (mParentMesh < 0)
  2318. tsalloc.copyToBuffer32((S32*)mVerts.address(), 3 * mVerts.size()); // if no parent mesh, then save off our verts
  2319. // tverts...
  2320. tsalloc.set32(mTverts.size());
  2321. if (mParentMesh < 0)
  2322. tsalloc.copyToBuffer32((S32*)mTverts.address(), 2 * mTverts.size()); // if no parent mesh, then save off our tverts
  2323. if (TSShape::smVersion > 25)
  2324. {
  2325. // tverts2...
  2326. tsalloc.set32(mTverts2.size());
  2327. if (mParentMesh < 0)
  2328. tsalloc.copyToBuffer32((S32*)mTverts2.address(), 2 * mTverts2.size()); // if no parent mesh, then save off our tverts
  2329. // colors
  2330. tsalloc.set32(mColors.size());
  2331. if (mParentMesh < 0)
  2332. tsalloc.copyToBuffer32((S32*)mColors.address(), mColors.size()); // if no parent mesh, then save off our tverts
  2333. }
  2334. // norms...
  2335. if (mParentMesh < 0) // if no parent mesh, then save off our norms
  2336. tsalloc.copyToBuffer32((S32*)mNorms.address(), 3 * mNorms.size()); // norms.size()==verts.size() or error...
  2337. // encoded norms...
  2338. if (mParentMesh < 0)
  2339. {
  2340. // if no parent mesh, compute encoded normals and copy over
  2341. for (S32 i = 0; i < mNorms.size(); i++)
  2342. {
  2343. U8 normIdx = mEncodedNorms.size() ? mEncodedNorms[i] : encodeNormal(mNorms[i]);
  2344. tsalloc.copyToBuffer8((S8*)&normIdx, 1);
  2345. }
  2346. }
  2347. }
  2348. // optimize triangle draw order during disassemble
  2349. {
  2350. FrameTemp<TriListOpt::IndexType> tmpIdxs(mIndices.size());
  2351. for ( S32 i = 0; i < mPrimitives.size(); i++ )
  2352. {
  2353. const TSDrawPrimitive& prim = mPrimitives[i];
  2354. // only optimize triangle lists (strips and fans are assumed to be already optimized)
  2355. if ( (prim.matIndex & TSDrawPrimitive::TypeMask) == TSDrawPrimitive::Triangles )
  2356. {
  2357. TriListOpt::OptimizeTriangleOrdering(mVerts.size(), prim.numElements,
  2358. mIndices.address() + prim.start, tmpIdxs.address());
  2359. dCopyArray(mIndices.address() + prim.start, tmpIdxs.address(),
  2360. prim.numElements);
  2361. }
  2362. }
  2363. }
  2364. if (TSShape::smVersion > 25)
  2365. {
  2366. // primitives...
  2367. tsalloc.set32(mPrimitives.size() );
  2368. tsalloc.copyToBuffer32((S32*)mPrimitives.address(),3* mPrimitives.size());
  2369. // indices...
  2370. tsalloc.set32(mIndices.size());
  2371. tsalloc.copyToBuffer32((S32*)mIndices.address(),mIndices.size());
  2372. }
  2373. else
  2374. {
  2375. // primitives
  2376. tsalloc.set32(mPrimitives.size() );
  2377. for (S32 i=0; i<mPrimitives.size(); i++)
  2378. {
  2379. S16 start = (S16)mPrimitives[i].start;
  2380. S16 numElements = (S16)mPrimitives[i].numElements;
  2381. tsalloc.copyToBuffer16(&start, 1);
  2382. tsalloc.copyToBuffer16(&numElements, 1);
  2383. tsalloc.copyToBuffer32(&(mPrimitives[i].matIndex), 1);
  2384. }
  2385. // indices
  2386. tsalloc.set32(mIndices.size());
  2387. Vector<S16> s16_indices(mIndices.size());
  2388. for (S32 i=0; i<mIndices.size(); i++)
  2389. s16_indices.push_back((S16)mIndices[i]);
  2390. tsalloc.copyToBuffer16(s16_indices.address(), s16_indices.size());
  2391. }
  2392. // merge indices...DEPRECATED
  2393. tsalloc.set32( 0 );
  2394. // small stuff...
  2395. tsalloc.set32( vertsPerFrame );
  2396. tsalloc.set32( getFlags() );
  2397. tsalloc.setGuard();
  2398. }
  2399. //-----------------------------------------------------------------------------
  2400. // TSSkinMesh assemble from/ dissemble to memory buffer
  2401. //-----------------------------------------------------------------------------
  2402. void TSSkinMesh::assemble( bool skip )
  2403. {
  2404. // avoid a crash on computeBounds...
  2405. batchData.initialVerts.set( NULL, 0 );
  2406. TSMesh::assemble( skip );
  2407. if (TSShape::smReadVersion >= 27)
  2408. {
  2409. maxBones = tsalloc.get32();
  2410. }
  2411. else
  2412. {
  2413. maxBones = -1;
  2414. }
  2415. S32 sz;
  2416. S32 * ptr32;
  2417. if (TSShape::smReadVersion < 27)
  2418. {
  2419. sz = tsalloc.get32();
  2420. S32 numVerts = sz;
  2421. ptr32 = getSharedData32(mParentMesh, 3 * numVerts, (S32**)smVertsList.address(), skip);
  2422. batchData.initialVerts.set((Point3F*)ptr32, sz);
  2423. S8 * ptr8;
  2424. if (TSShape::smReadVersion > 21 && TSMesh::smUseEncodedNormals)
  2425. {
  2426. // we have encoded normals and we want to use them...
  2427. if (mParentMesh < 0)
  2428. tsalloc.getPointer32(numVerts * 3); // advance past norms, don't use
  2429. batchData.initialNorms.set(NULL, 0);
  2430. ptr8 = getSharedData8(mParentMesh, numVerts, (S8**)smEncodedNormsList.address(), skip);
  2431. mEncodedNorms.set(ptr8, numVerts);
  2432. // Note: we don't set the encoded normals flag because we handle them in updateSkin and
  2433. // hide the fact that we are using them from base class (TSMesh)
  2434. }
  2435. else if (TSShape::smReadVersion > 21)
  2436. {
  2437. // we have encoded normals but we don't want to use them...
  2438. ptr32 = getSharedData32(mParentMesh, 3 * numVerts, (S32**)smNormsList.address(), skip);
  2439. batchData.initialNorms.set((Point3F*)ptr32, numVerts);
  2440. if (mParentMesh < 0)
  2441. tsalloc.getPointer8(numVerts); // advance past encoded normls, don't use
  2442. mEncodedNorms.set(NULL, 0);
  2443. }
  2444. else
  2445. {
  2446. // no encoded normals...
  2447. ptr32 = getSharedData32(mParentMesh, 3 * numVerts, (S32**)smNormsList.address(), skip);
  2448. batchData.initialNorms.set((Point3F*)ptr32, numVerts);
  2449. mEncodedNorms.set(NULL, 0);
  2450. }
  2451. // Sometimes we'll have a mesh with 0 verts but initialVerts is set,
  2452. // so set these accordingly
  2453. if (mVerts.size() == 0)
  2454. {
  2455. mVerts = batchData.initialVerts;
  2456. }
  2457. if (mNorms.size() == 0)
  2458. {
  2459. mNorms = batchData.initialNorms;
  2460. }
  2461. }
  2462. else
  2463. {
  2464. // Set from the mesh data
  2465. batchData.initialVerts = mVerts;
  2466. batchData.initialNorms = mNorms;
  2467. }
  2468. sz = tsalloc.get32();
  2469. ptr32 = getSharedData32(mParentMesh, 16 * sz, (S32**)smInitTransformList.address(), skip );
  2470. batchData.initialTransforms.set( ptr32, sz );
  2471. sz = tsalloc.get32();
  2472. ptr32 = getSharedData32(mParentMesh, sz, (S32**)smVertexIndexList.address(), skip );
  2473. vertexIndex.set( ptr32, sz );
  2474. ptr32 = getSharedData32(mParentMesh, sz, (S32**)smBoneIndexList.address(), skip );
  2475. boneIndex.set( ptr32, sz );
  2476. ptr32 = getSharedData32(mParentMesh, sz, (S32**)smWeightList.address(), skip );
  2477. weight.set( (F32*)ptr32, sz );
  2478. sz = tsalloc.get32();
  2479. ptr32 = getSharedData32(mParentMesh, sz, (S32**)smNodeIndexList.address(), skip );
  2480. batchData.nodeIndex.set( ptr32, sz );
  2481. tsalloc.checkGuard();
  2482. if (smDebugSkinVerts && ptr32 != NULL)
  2483. {
  2484. Con::printf("Loaded skin verts...");
  2485. for (U32 i = 0; i < vertexIndex.size(); i++)
  2486. {
  2487. Con::printf("vi[%i] == %i", i, vertexIndex[i]);
  2488. }
  2489. for (U32 i = 0; i < boneIndex.size(); i++)
  2490. {
  2491. Con::printf("bi[%i] == %i", i, boneIndex[i]);
  2492. }
  2493. for (U32 i = 0; i < batchData.nodeIndex.size(); i++)
  2494. {
  2495. Con::printf("ni[%i] == %i", i, batchData.nodeIndex[i]);
  2496. }
  2497. for (U32 i = 0; i < boneIndex.size(); i++)
  2498. {
  2499. Con::printf("we[%i] == %f", i, weight[i]);
  2500. }
  2501. if (mNumVerts != 0)
  2502. {
  2503. AssertFatal(batchData.initialVerts.size() == mNumVerts, "err WTF");
  2504. }
  2505. Con::printf("---");
  2506. }
  2507. if ( tsalloc.allocShape32( 0 ) && TSShape::smReadVersion < 19 )
  2508. TSMesh::computeBounds(); // only do this if we copied the data...c
  2509. }
  2510. //-----------------------------------------------------------------------------
  2511. // disassemble
  2512. //-----------------------------------------------------------------------------
  2513. void TSSkinMesh::disassemble()
  2514. {
  2515. TSMesh::disassemble();
  2516. if (TSShape::smVersion >= 27)
  2517. {
  2518. AssertFatal(maxBones != 0, "Skin mesh with no bones? No way!");
  2519. tsalloc.set32(maxBones);
  2520. }
  2521. if (TSShape::smVersion < 27)
  2522. {
  2523. tsalloc.set32(batchData.initialVerts.size());
  2524. // if we have no parent mesh, then save off our verts & norms
  2525. if (mParentMesh < 0)
  2526. {
  2527. tsalloc.copyToBuffer32((S32*)mVerts.address(), 3 * mVerts.size());
  2528. // no longer do this here...let tsmesh handle this
  2529. tsalloc.copyToBuffer32((S32*)mNorms.address(), 3 * mNorms.size());
  2530. // if no parent mesh, compute encoded normals and copy over
  2531. for (S32 i = 0; i < mNorms.size(); i++)
  2532. {
  2533. U8 normIdx = mEncodedNorms.size() ? mEncodedNorms[i] : encodeNormal(mNorms[i]);
  2534. tsalloc.copyToBuffer8((S8*)&normIdx, 1);
  2535. }
  2536. }
  2537. }
  2538. tsalloc.set32( batchData.initialTransforms.size() );
  2539. if (mParentMesh < 0 )
  2540. tsalloc.copyToBuffer32( (S32*)batchData.initialTransforms.address(), batchData.initialTransforms.size() * 16 );
  2541. if (!mVertexData.isReady())
  2542. {
  2543. tsalloc.set32(vertexIndex.size());
  2544. tsalloc.copyToBuffer32((S32*)vertexIndex.address(), vertexIndex.size());
  2545. tsalloc.copyToBuffer32((S32*)boneIndex.address(), boneIndex.size());
  2546. tsalloc.copyToBuffer32((S32*)weight.address(), weight.size());
  2547. }
  2548. else
  2549. {
  2550. tsalloc.set32(0);
  2551. }
  2552. if (TSShape::smVersion < 27)
  2553. {
  2554. if (mParentMesh < 0)
  2555. {
  2556. tsalloc.copyToBuffer32((S32*)vertexIndex.address(), vertexIndex.size());
  2557. tsalloc.copyToBuffer32((S32*)boneIndex.address(), boneIndex.size());
  2558. tsalloc.copyToBuffer32((S32*)weight.address(), weight.size());
  2559. }
  2560. }
  2561. tsalloc.set32( batchData.nodeIndex.size() );
  2562. if (mParentMesh < 0 )
  2563. tsalloc.copyToBuffer32( (S32*)batchData.nodeIndex.address(), batchData.nodeIndex.size() );
  2564. tsalloc.setGuard();
  2565. }
  2566. TSSkinMesh::TSSkinMesh()
  2567. {
  2568. mMeshType = SkinMeshType;
  2569. batchData.initialized = false;
  2570. maxBones = -1;
  2571. }
  2572. //-----------------------------------------------------------------------------
  2573. // find tangent vector
  2574. //-----------------------------------------------------------------------------
  2575. inline void TSMesh::findTangent( U32 index1,
  2576. U32 index2,
  2577. U32 index3,
  2578. Point3F *tan0,
  2579. Point3F *tan1,
  2580. const Vector<Point3F> &_verts)
  2581. {
  2582. const Point3F &v1 = _verts[index1];
  2583. const Point3F &v2 = _verts[index2];
  2584. const Point3F &v3 = _verts[index3];
  2585. const Point2F &w1 = mTverts[index1];
  2586. const Point2F &w2 = mTverts[index2];
  2587. const Point2F &w3 = mTverts[index3];
  2588. F32 x1 = v2.x - v1.x;
  2589. F32 x2 = v3.x - v1.x;
  2590. F32 y1 = v2.y - v1.y;
  2591. F32 y2 = v3.y - v1.y;
  2592. F32 z1 = v2.z - v1.z;
  2593. F32 z2 = v3.z - v1.z;
  2594. F32 s1 = w2.x - w1.x;
  2595. F32 s2 = w3.x - w1.x;
  2596. F32 t1 = w2.y - w1.y;
  2597. F32 t2 = w3.y - w1.y;
  2598. F32 denom = (s1 * t2 - s2 * t1);
  2599. if( mFabs( denom ) < 0.0001f )
  2600. {
  2601. // handle degenerate triangles from strips
  2602. if (denom<0) denom = -0.0001f;
  2603. else denom = 0.0001f;
  2604. }
  2605. F32 r = 1.0f / denom;
  2606. Point3F sdir( (t2 * x1 - t1 * x2) * r,
  2607. (t2 * y1 - t1 * y2) * r,
  2608. (t2 * z1 - t1 * z2) * r );
  2609. Point3F tdir( (s1 * x2 - s2 * x1) * r,
  2610. (s1 * y2 - s2 * y1) * r,
  2611. (s1 * z2 - s2 * z1) * r );
  2612. tan0[index1] += sdir;
  2613. tan1[index1] += tdir;
  2614. tan0[index2] += sdir;
  2615. tan1[index2] += tdir;
  2616. tan0[index3] += sdir;
  2617. tan1[index3] += tdir;
  2618. }
  2619. //-----------------------------------------------------------------------------
  2620. // create array of tangent vectors
  2621. //-----------------------------------------------------------------------------
  2622. void TSMesh::createTangents(const Vector<Point3F> &_verts, const Vector<Point3F> &_norms)
  2623. {
  2624. if (_verts.size() == 0) // can only be done in editable mode
  2625. return;
  2626. U32 numVerts = _verts.size();
  2627. U32 numNorms = _norms.size();
  2628. if ( numVerts <= 0 || numNorms <= 0 )
  2629. return;
  2630. if( numVerts != numNorms)
  2631. return;
  2632. Vector<Point3F> tan0;
  2633. tan0.setSize( numVerts * 2 );
  2634. Point3F *tan1 = tan0.address() + numVerts;
  2635. dMemset( tan0.address(), 0, sizeof(Point3F) * 2 * numVerts );
  2636. U32 numPrimatives = mPrimitives.size();
  2637. for (S32 i = 0; i < numPrimatives; i++ )
  2638. {
  2639. const TSDrawPrimitive & draw = mPrimitives[i];
  2640. GFXPrimitiveType drawType = getDrawType( draw.matIndex >> 30 );
  2641. U32 p1Index = 0;
  2642. U32 p2Index = 0;
  2643. U32 *baseIdx = &mIndices[draw.start];
  2644. const U32 numElements = (U32)draw.numElements;
  2645. switch( drawType )
  2646. {
  2647. case GFXTriangleList:
  2648. {
  2649. for( U32 j = 0; j < numElements; j += 3 )
  2650. findTangent( baseIdx[j], baseIdx[j + 1], baseIdx[j + 2], tan0.address(), tan1, _verts );
  2651. break;
  2652. }
  2653. case GFXTriangleStrip:
  2654. {
  2655. p1Index = baseIdx[0];
  2656. p2Index = baseIdx[1];
  2657. for( U32 j = 2; j < numElements; j++ )
  2658. {
  2659. findTangent( p1Index, p2Index, baseIdx[j], tan0.address(), tan1, _verts );
  2660. p1Index = p2Index;
  2661. p2Index = baseIdx[j];
  2662. }
  2663. break;
  2664. }
  2665. default:
  2666. AssertFatal( false, "TSMesh::createTangents: unknown primitive type!" );
  2667. }
  2668. }
  2669. mTangents.setSize( numVerts );
  2670. // fill out final info from accumulated basis data
  2671. for( U32 i = 0; i < numVerts; i++ )
  2672. {
  2673. const Point3F &n = _norms[i];
  2674. const Point3F &t = tan0[i];
  2675. const Point3F &b = tan1[i];
  2676. Point3F tempPt = t - n * mDot( n, t );
  2677. tempPt.normalize();
  2678. mTangents[i] = tempPt;
  2679. Point3F cp;
  2680. mCross( n, t, &cp );
  2681. mTangents[i].w = (mDot( cp, b ) < 0.0f) ? -1.0f : 1.0f;
  2682. }
  2683. }
  2684. void TSMesh::convertToVertexData()
  2685. {
  2686. if (!mVertexData.isReady())
  2687. {
  2688. _convertToVertexData(mVertexData, mVerts, mNorms);
  2689. }
  2690. }
  2691. void TSSkinMesh::convertToVertexData()
  2692. {
  2693. if (!mVertexData.isReady())
  2694. {
  2695. // Batch data required here
  2696. createSkinBatchData();
  2697. // Dump verts to buffer
  2698. _convertToVertexData(mVertexData, batchData.initialVerts, batchData.initialNorms);
  2699. // Setup bones too
  2700. setupVertexTransforms();
  2701. }
  2702. }
  2703. void TSMesh::copySourceVertexDataFrom(const TSMesh* srcMesh)
  2704. {
  2705. mVerts = srcMesh->mVerts;
  2706. mTverts = srcMesh->mTverts;
  2707. mNorms = srcMesh->mNorms;
  2708. mColors = srcMesh->mColors;
  2709. mTverts2 = srcMesh->mTverts2;
  2710. if (mVerts.size() == 0)
  2711. {
  2712. bool hasTVert2 = srcMesh->getHasTVert2();
  2713. bool hasColor = srcMesh->getHasColor();
  2714. mVerts.setSize(srcMesh->mNumVerts);
  2715. mTverts.setSize(srcMesh->mNumVerts);
  2716. mNorms.setSize(srcMesh->mNumVerts);
  2717. if (hasColor)
  2718. mColors.setSize(mNumVerts);
  2719. if (hasTVert2)
  2720. mTverts2.setSize(mNumVerts);
  2721. // Fill arrays
  2722. for (U32 i = 0; i < mNumVerts; i++)
  2723. {
  2724. const __TSMeshVertexBase &cv = srcMesh->mVertexData.getBase(i);
  2725. const __TSMeshVertex_3xUVColor &cvc = srcMesh->mVertexData.getColor(i);
  2726. mVerts[i] = cv.vert();
  2727. mTverts[i] = cv.tvert();
  2728. mNorms[i] = cv.normal();
  2729. if (hasColor)
  2730. cvc.color().getColor(&mColors[i]);
  2731. if (hasTVert2)
  2732. mTverts2[i] = cvc.tvert2();
  2733. }
  2734. }
  2735. }
  2736. void TSSkinMesh::copySourceVertexDataFrom(const TSMesh* srcMesh)
  2737. {
  2738. TSMesh::copySourceVertexDataFrom(srcMesh);
  2739. if (srcMesh->getMeshType() == TSMesh::SkinMeshType)
  2740. {
  2741. const TSSkinMesh* srcSkinMesh = static_cast<const TSSkinMesh*>(srcMesh);
  2742. weight = srcSkinMesh->weight;
  2743. boneIndex = srcSkinMesh->boneIndex;
  2744. vertexIndex = srcSkinMesh->vertexIndex;
  2745. maxBones = srcSkinMesh->maxBones;
  2746. // Extract from vertex data
  2747. if (srcSkinMesh->vertexIndex.size() == 0)
  2748. {
  2749. mVertexData = srcMesh->mVertexData;
  2750. addWeightsFromVertexBuffer();
  2751. mVertexData.setReady(false);
  2752. }
  2753. }
  2754. }
  2755. U32 TSMesh::getNumVerts()
  2756. {
  2757. return mVertexData.isReady() ? mNumVerts : mVerts.size();
  2758. }
  2759. void TSMesh::_convertToVertexData(TSMeshVertexArray &outArray, const Vector<Point3F> &_verts, const Vector<Point3F> &_norms)
  2760. {
  2761. // Update tangents list
  2762. createTangents(mVerts, mNorms);
  2763. AssertFatal(_verts.size() == mNumVerts, "vert count mismatch");
  2764. AssertFatal(!getHasColor() || mColors.size() == _verts.size(), "Vector of color elements should be the same size as other vectors");
  2765. AssertFatal(!getHasTVert2() || mTverts2.size() == _verts.size(), "Vector of tvert2 elements should be the same size as other vectors");
  2766. AssertFatal(!outArray.isReady(), "Mesh already converted to aligned data! Re-check code!");
  2767. AssertFatal(_verts.size() == _norms.size() &&
  2768. _verts.size() == mTangents.size(),
  2769. "Vectors: verts, norms, tangents must all be the same size");
  2770. AssertFatal(mVertSize == outArray.vertSize(), "Size inconsistency");
  2771. if (mNumVerts == 0)
  2772. return;
  2773. bool needWeightSet = outArray.getBoneOffset() != 0;
  2774. bool hasColor = getHasColor();
  2775. bool hasTVert2 = getHasTVert2();
  2776. dMemset(&outArray.getBase(0), '\0', mVertSize * mNumVerts);
  2777. for (U32 i = 0; i < mNumVerts; i++)
  2778. {
  2779. __TSMeshVertexBase &v = outArray.getBase(i);
  2780. v.vert(_verts[i]);
  2781. v.normal(_norms[i]);
  2782. v.tangent(mTangents[i]);
  2783. if (i < mTverts.size())
  2784. v.tvert(mTverts[i]);
  2785. if (hasTVert2 || hasColor)
  2786. {
  2787. __TSMeshVertex_3xUVColor &vc = outArray.getColor(i);
  2788. if (hasTVert2 && i < mTverts2.size())
  2789. vc.tvert2(mTverts2[i]);
  2790. if (hasColor && i < mColors.size())
  2791. vc.color(mColors[i]);
  2792. }
  2793. // NOTE: skin verts are set later on for the skinned mesh, otherwise we'll set the default (i.e. 0) if we need one for a rigid mesh
  2794. if (needWeightSet)
  2795. {
  2796. const Point4F wt(1.0f, 0.0f, 0.0f, 0.0f);
  2797. outArray.getBone(i, 0).weight(wt);
  2798. }
  2799. }
  2800. }
  2801. void TSMesh::makeEditable()
  2802. {
  2803. bool hasVerts = mVerts.size() != 0;
  2804. if(mVertexData.isReady() && !hasVerts)
  2805. {
  2806. copySourceVertexDataFrom(this);
  2807. }
  2808. mVertexData.setReady(false);
  2809. mVertSize = 0;
  2810. mNumVerts = 0;
  2811. mVertOffset = 0;
  2812. updateMeshFlags();
  2813. }
  2814. void TSSkinMesh::addWeightsFromVertexBuffer()
  2815. {
  2816. weight.setSize(0);
  2817. boneIndex.setSize(0);
  2818. vertexIndex.setSize(0);
  2819. U32 numBoneBlocks = maxBones >= 0 ? (maxBones + 3) / 4 : 0;
  2820. for (U32 i = 0; i < mNumVerts; i++)
  2821. {
  2822. for (U32 j = 0; j < numBoneBlocks; j++)
  2823. {
  2824. const __TSMeshVertex_BoneData &cv = mVertexData.getBone(i, j);
  2825. if (cv._weights.x != 0.0f)
  2826. {
  2827. addWeightForVert(i, cv._indexes.x, cv._weights.x);
  2828. }
  2829. if (cv._weights.y != 0.0f)
  2830. {
  2831. addWeightForVert(i, cv._indexes.y, cv._weights.y);
  2832. }
  2833. if (cv._weights.z != 0.0f)
  2834. {
  2835. addWeightForVert(i, cv._indexes.z, cv._weights.z);
  2836. }
  2837. if (cv._weights.w != 0.0f)
  2838. {
  2839. addWeightForVert(i, cv._indexes.w, cv._weights.w);
  2840. }
  2841. }
  2842. }
  2843. }
  2844. void TSSkinMesh::makeEditable()
  2845. {
  2846. bool hasVerts = mVerts.size() != 0;
  2847. // Reconstruct bone mapping
  2848. if (mVertexData.isReady() && !hasVerts)
  2849. {
  2850. copySourceVertexDataFrom(this);
  2851. weight.setSize(0);
  2852. boneIndex.setSize(0);
  2853. vertexIndex.setSize(0);
  2854. addWeightsFromVertexBuffer();
  2855. }
  2856. mVertexData.setReady(false);
  2857. mVertSize = 0;
  2858. mNumVerts = 0;
  2859. updateMeshFlags();
  2860. batchData.initialized = false;
  2861. }
  2862. void TSMesh::clearEditable()
  2863. {
  2864. if (mVerts.size() == 0)
  2865. return;
  2866. if (mColors.empty())
  2867. clearFlags(HasColor);
  2868. else
  2869. setFlags(HasColor);
  2870. if (mTverts2.empty())
  2871. clearFlags(HasTVert2);
  2872. else
  2873. setFlags(HasTVert2);
  2874. mVerts.free_memory();
  2875. mNorms.free_memory();
  2876. mTangents.free_memory();
  2877. mTverts.free_memory();
  2878. mTverts2.free_memory();
  2879. mColors.free_memory();
  2880. }
  2881. void TSMesh::updateMeshFlags()
  2882. {
  2883. // Make sure flags are correct
  2884. if (mColors.empty())
  2885. clearFlags(HasColor);
  2886. else
  2887. setFlags(HasColor);
  2888. if (mTverts2.empty())
  2889. clearFlags(HasTVert2);
  2890. else
  2891. setFlags(HasTVert2);
  2892. }
  2893. void TSSkinMesh::clearEditable()
  2894. {
  2895. TSMesh::clearEditable();
  2896. weight.free_memory();
  2897. boneIndex.free_memory();
  2898. vertexIndex.free_memory();
  2899. }
  2900. TSBasicVertexFormat::TSBasicVertexFormat() :
  2901. texCoordOffset(-1),
  2902. boneOffset(-1),
  2903. colorOffset(-1),
  2904. numBones(0),
  2905. vertexSize(-1)
  2906. {
  2907. }
  2908. TSBasicVertexFormat::TSBasicVertexFormat(TSMesh *mesh)
  2909. {
  2910. texCoordOffset = -1;
  2911. boneOffset = -1;
  2912. colorOffset = -1;
  2913. numBones = 0;
  2914. vertexSize = -1;
  2915. addMeshRequirements(mesh);
  2916. }
  2917. void TSBasicVertexFormat::getFormat(GFXVertexFormat &fmt)
  2918. {
  2919. // NOTE: previously the vertex data was padded to allow for verts to be skinned via SSE.
  2920. // since we now prefer to skin on the GPU and use a basic non-SSE fallback for software
  2921. // skinning, adding in padding via GFXSemantic::PADDING or dummy fields is no longer required.
  2922. fmt.addElement(GFXSemantic::POSITION, GFXDeclType_Float3);
  2923. fmt.addElement(GFXSemantic::TANGENTW, GFXDeclType_Float, 3);
  2924. fmt.addElement(GFXSemantic::NORMAL, GFXDeclType_Float3);
  2925. fmt.addElement(GFXSemantic::TANGENT, GFXDeclType_Float3);
  2926. fmt.addElement(GFXSemantic::TEXCOORD, GFXDeclType_Float2, 0);
  2927. if (texCoordOffset >= 0 || colorOffset >= 0)
  2928. {
  2929. fmt.addElement(GFXSemantic::TEXCOORD, GFXDeclType_Float2, 1);
  2930. fmt.addElement(GFXSemantic::COLOR, GFXDeclType_Color);
  2931. }
  2932. for (U32 i=0; i<numBones; i++)
  2933. {
  2934. fmt.addElement(GFXSemantic::BLENDINDICES, GFXDeclType_UByte4, i);
  2935. fmt.addElement(GFXSemantic::BLENDWEIGHT, GFXDeclType_Float4, i);
  2936. }
  2937. }
  2938. void TSBasicVertexFormat::calculateSize()
  2939. {
  2940. GFXVertexFormat fmt;
  2941. vertexSize = 0;
  2942. getFormat(fmt);
  2943. vertexSize = fmt.getSizeInBytes();
  2944. }
  2945. void TSBasicVertexFormat::writeAlloc(TSShapeAlloc* alloc)
  2946. {
  2947. alloc->set16(texCoordOffset);
  2948. alloc->set16(boneOffset);
  2949. alloc->set16(colorOffset);
  2950. alloc->set16(numBones);
  2951. alloc->set16(vertexSize);
  2952. }
  2953. void TSBasicVertexFormat::readAlloc(TSShapeAlloc* alloc)
  2954. {
  2955. texCoordOffset = alloc->get16();
  2956. boneOffset = alloc->get16();
  2957. colorOffset = alloc->get16();
  2958. numBones = alloc->get16();
  2959. vertexSize = alloc->get16();
  2960. }
  2961. void TSBasicVertexFormat::addMeshRequirements(TSMesh *mesh)
  2962. {
  2963. bool hasColors = false;
  2964. bool hasTexcoord2 = false;
  2965. bool hasSkin = false;
  2966. hasColors = mesh->getHasColor() || (colorOffset != -1);
  2967. hasTexcoord2 = mesh->getHasTVert2() || (texCoordOffset != -1);
  2968. hasSkin = (mesh->getMeshType() == TSMesh::SkinMeshType) || (boneOffset != -1);
  2969. S32 offset = sizeof(TSMesh::__TSMeshVertexBase);
  2970. if ((hasTexcoord2 || hasColors))
  2971. {
  2972. if (texCoordOffset == -1 || colorOffset == -1)
  2973. {
  2974. texCoordOffset = offset;
  2975. colorOffset = offset + (sizeof(float) * 2);
  2976. }
  2977. offset += sizeof(TSMesh::__TSMeshVertex_3xUVColor);
  2978. }
  2979. if (hasSkin)
  2980. {
  2981. boneOffset = offset;
  2982. U32 numMeshBones = mesh->getMaxBonesPerVert();
  2983. U32 boneBlocks = numMeshBones / 4;
  2984. U32 extraBlocks = numMeshBones % 4 != 0 ? 1 : 0;
  2985. U32 neededBones = boneBlocks + extraBlocks;
  2986. numBones = MAX(neededBones, numBones);
  2987. }
  2988. }
  2989. void TSSkinMesh::printVerts()
  2990. {
  2991. for (U32 i = 0; i < mNumVerts; i++)
  2992. {
  2993. TSMesh::__TSMeshVertexBase &vb = mVertexData.getBase(i);
  2994. TSMesh::__TSMeshVertex_BoneData &bw = mVertexData.getBone(i, 0);
  2995. Point3F vert = batchData.initialVerts[i];
  2996. Con::printf("v[%i] == %f,%f,%f; iv == %f,%f,%f. bo=%i,%i,%i,%i bw=%f,%f,%f,%f",
  2997. i, vb._vert.x, vb._vert.y, vb._vert.z,
  2998. vert.x, vert.y, vert.z,
  2999. bw._indexes.x, bw._indexes.y, bw._indexes.z, bw._indexes.w,
  3000. bw._weights.x, bw._weights.y, bw._weights.z, bw._weights.w);
  3001. }
  3002. }