Model_lwo.cpp 100 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170
  1. /*
  2. ===========================================================================
  3. Doom 3 BFG Edition GPL Source Code
  4. Copyright (C) 1993-2012 id Software LLC, a ZeniMax Media company.
  5. This file is part of the Doom 3 BFG Edition GPL Source Code ("Doom 3 BFG Edition Source Code").
  6. Doom 3 BFG Edition Source Code is free software: you can redistribute it and/or modify
  7. it under the terms of the GNU General Public License as published by
  8. the Free Software Foundation, either version 3 of the License, or
  9. (at your option) any later version.
  10. Doom 3 BFG Edition Source Code is distributed in the hope that it will be useful,
  11. but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. GNU General Public License for more details.
  14. You should have received a copy of the GNU General Public License
  15. along with Doom 3 BFG Edition Source Code. If not, see <http://www.gnu.org/licenses/>.
  16. In addition, the Doom 3 BFG Edition Source Code is also subject to certain additional terms. You should have received a copy of these additional terms immediately following the terms and conditions of the GNU General Public License which accompanied the Doom 3 BFG Edition Source Code. If not, please request a copy in writing from id Software at the address below.
  17. If you have questions concerning this license or the applicable additional terms, you may contact in writing id Software LLC, c/o ZeniMax Media Inc., Suite 120, Rockville, Maryland 20850 USA.
  18. ===========================================================================
  19. */
  20. #pragma hdrstop
  21. #include "../idlib/precompiled.h"
  22. #include "Model_lwo.h"
  23. /*
  24. ======================================================================
  25. Converted from lwobject sample prog from LW 6.5 SDK.
  26. ======================================================================
  27. */
  28. /*
  29. ======================================================================
  30. lwFreeClip()
  31. Free memory used by an lwClip.
  32. ====================================================================== */
  33. void lwFreeClip( lwClip *clip )
  34. {
  35. if ( clip ) {
  36. lwListFree( clip->ifilter, (void (__cdecl *)(void *))lwFreePlugin );
  37. lwListFree( clip->pfilter, (void (__cdecl *)(void *))lwFreePlugin );
  38. switch( clip->type ) {
  39. case ID_STIL: {
  40. if ( clip->source.still.name ) Mem_Free( clip->source.still.name );
  41. break;
  42. }
  43. case ID_ISEQ: {
  44. if ( clip->source.seq.suffix ) Mem_Free( clip->source.seq.suffix );
  45. if ( clip->source.seq.prefix ) Mem_Free( clip->source.seq.prefix );
  46. break;
  47. }
  48. case ID_ANIM: {
  49. if ( clip->source.anim.server ) Mem_Free( clip->source.anim.server );
  50. if ( clip->source.anim.name ) Mem_Free( clip->source.anim.name );
  51. break;
  52. }
  53. case ID_XREF: {
  54. if ( clip->source.xref.string ) Mem_Free( clip->source.xref.string );
  55. break;
  56. }
  57. case ID_STCC: {
  58. if ( clip->source.cycle.name ) Mem_Free( clip->source.cycle.name );
  59. break;
  60. }
  61. }
  62. Mem_Free( clip );
  63. }
  64. }
  65. /*
  66. ======================================================================
  67. lwGetClip()
  68. Read image references from a CLIP chunk in an LWO2 file.
  69. ====================================================================== */
  70. lwClip *lwGetClip( idFile *fp, int cksize )
  71. {
  72. lwClip *clip;
  73. lwPlugin *filt;
  74. unsigned int id;
  75. unsigned short sz;
  76. int pos, rlen;
  77. /* allocate the Clip structure */
  78. clip = (lwClip*)Mem_ClearedAlloc( sizeof( lwClip ), TAG_MODEL );
  79. if ( !clip ) goto Fail;
  80. clip->contrast.val = 1.0f;
  81. clip->brightness.val = 1.0f;
  82. clip->saturation.val = 1.0f;
  83. clip->gamma.val = 1.0f;
  84. /* remember where we started */
  85. set_flen( 0 );
  86. pos = fp->Tell();
  87. /* index */
  88. clip->index = getI4( fp );
  89. /* first subchunk header */
  90. clip->type = getU4( fp );
  91. sz = getU2( fp );
  92. if ( 0 > get_flen() ) goto Fail;
  93. sz += sz & 1;
  94. set_flen( 0 );
  95. switch ( clip->type ) {
  96. case ID_STIL:
  97. clip->source.still.name = getS0( fp );
  98. break;
  99. case ID_ISEQ:
  100. clip->source.seq.digits = getU1( fp );
  101. clip->source.seq.flags = getU1( fp );
  102. clip->source.seq.offset = getI2( fp );
  103. clip->source.seq.start = getI2( fp );
  104. clip->source.seq.end = getI2( fp );
  105. clip->source.seq.prefix = getS0( fp );
  106. clip->source.seq.suffix = getS0( fp );
  107. break;
  108. case ID_ANIM:
  109. clip->source.anim.name = getS0( fp );
  110. clip->source.anim.server = getS0( fp );
  111. rlen = get_flen();
  112. clip->source.anim.data = getbytes( fp, sz - rlen );
  113. break;
  114. case ID_XREF:
  115. clip->source.xref.index = getI4( fp );
  116. clip->source.xref.string = getS0( fp );
  117. break;
  118. case ID_STCC:
  119. clip->source.cycle.lo = getI2( fp );
  120. clip->source.cycle.hi = getI2( fp );
  121. clip->source.cycle.name = getS0( fp );
  122. break;
  123. default:
  124. break;
  125. }
  126. /* error while reading current subchunk? */
  127. rlen = get_flen();
  128. if ( rlen < 0 || rlen > sz ) goto Fail;
  129. /* skip unread parts of the current subchunk */
  130. if ( rlen < sz )
  131. fp->Seek( sz - rlen, FS_SEEK_CUR );
  132. /* end of the CLIP chunk? */
  133. rlen = fp->Tell() - pos;
  134. if ( cksize < rlen ) goto Fail;
  135. if ( cksize == rlen )
  136. return clip;
  137. /* process subchunks as they're encountered */
  138. id = getU4( fp );
  139. sz = getU2( fp );
  140. if ( 0 > get_flen() ) goto Fail;
  141. while ( 1 ) {
  142. sz += sz & 1;
  143. set_flen( 0 );
  144. switch ( id ) {
  145. case ID_TIME:
  146. clip->start_time = getF4( fp );
  147. clip->duration = getF4( fp );
  148. clip->frame_rate = getF4( fp );
  149. break;
  150. case ID_CONT:
  151. clip->contrast.val = getF4( fp );
  152. clip->contrast.eindex = getVX( fp );
  153. break;
  154. case ID_BRIT:
  155. clip->brightness.val = getF4( fp );
  156. clip->brightness.eindex = getVX( fp );
  157. break;
  158. case ID_SATR:
  159. clip->saturation.val = getF4( fp );
  160. clip->saturation.eindex = getVX( fp );
  161. break;
  162. case ID_HUE:
  163. clip->hue.val = getF4( fp );
  164. clip->hue.eindex = getVX( fp );
  165. break;
  166. case ID_GAMM:
  167. clip->gamma.val = getF4( fp );
  168. clip->gamma.eindex = getVX( fp );
  169. break;
  170. case ID_NEGA:
  171. clip->negative = getU2( fp );
  172. break;
  173. case ID_IFLT:
  174. case ID_PFLT:
  175. filt = (lwPlugin*)Mem_ClearedAlloc( sizeof( lwPlugin ), TAG_MODEL );
  176. if ( !filt ) goto Fail;
  177. filt->name = getS0( fp );
  178. filt->flags = getU2( fp );
  179. rlen = get_flen();
  180. filt->data = getbytes( fp, sz - rlen );
  181. if ( id == ID_IFLT ) {
  182. lwListAdd( (void**)&clip->ifilter, filt );
  183. clip->nifilters++;
  184. }
  185. else {
  186. lwListAdd( (void**)&clip->pfilter, filt );
  187. clip->npfilters++;
  188. }
  189. break;
  190. default:
  191. break;
  192. }
  193. /* error while reading current subchunk? */
  194. rlen = get_flen();
  195. if ( rlen < 0 || rlen > sz ) goto Fail;
  196. /* skip unread parts of the current subchunk */
  197. if ( rlen < sz )
  198. fp->Seek( sz - rlen, FS_SEEK_CUR );
  199. /* end of the CLIP chunk? */
  200. rlen = fp->Tell() - pos;
  201. if ( cksize < rlen ) goto Fail;
  202. if ( cksize == rlen ) break;
  203. /* get the next chunk header */
  204. set_flen( 0 );
  205. id = getU4( fp );
  206. sz = getU2( fp );
  207. if ( 6 != get_flen() ) goto Fail;
  208. }
  209. return clip;
  210. Fail:
  211. lwFreeClip( clip );
  212. return NULL;
  213. }
  214. /*
  215. ======================================================================
  216. lwFindClip()
  217. Returns an lwClip pointer, given a clip index.
  218. ====================================================================== */
  219. lwClip *lwFindClip( lwClip *list, int index )
  220. {
  221. lwClip *clip;
  222. clip = list;
  223. while ( clip ) {
  224. if ( clip->index == index ) break;
  225. clip = clip->next;
  226. }
  227. return clip;
  228. }
  229. /*
  230. ======================================================================
  231. lwFreeEnvelope()
  232. Free the memory used by an lwEnvelope.
  233. ====================================================================== */
  234. void lwFree( void *ptr ) {
  235. Mem_Free( ptr );
  236. }
  237. void lwFreeEnvelope( lwEnvelope *env )
  238. {
  239. if ( env ) {
  240. if ( env->name ) Mem_Free( env->name );
  241. lwListFree( env->key, lwFree );
  242. lwListFree( env->cfilter, (void (__cdecl *)(void *))lwFreePlugin );
  243. Mem_Free( env );
  244. }
  245. }
  246. static int compare_keys( lwKey *k1, lwKey *k2 )
  247. {
  248. return k1->time > k2->time ? 1 : k1->time < k2->time ? -1 : 0;
  249. }
  250. /*
  251. ======================================================================
  252. lwGetEnvelope()
  253. Read an ENVL chunk from an LWO2 file.
  254. ====================================================================== */
  255. lwEnvelope *lwGetEnvelope( idFile *fp, int cksize )
  256. {
  257. lwEnvelope *env = NULL;
  258. lwKey *key = NULL;
  259. lwPlugin *plug = NULL;
  260. unsigned int id;
  261. unsigned short sz;
  262. float f[ 4 ];
  263. int i, nparams, pos, rlen;
  264. /* allocate the Envelope structure */
  265. env = (lwEnvelope*)Mem_ClearedAlloc( sizeof( lwEnvelope ), TAG_MODEL );
  266. if ( !env ) goto Fail;
  267. /* remember where we started */
  268. set_flen( 0 );
  269. pos = fp->Tell();
  270. /* index */
  271. env->index = getVX( fp );
  272. /* first subchunk header */
  273. id = getU4( fp );
  274. sz = getU2( fp );
  275. if ( 0 > get_flen() ) goto Fail;
  276. /* process subchunks as they're encountered */
  277. while ( 1 ) {
  278. sz += sz & 1;
  279. set_flen( 0 );
  280. switch ( id ) {
  281. case ID_TYPE:
  282. env->type = getU2( fp );
  283. break;
  284. case ID_NAME:
  285. env->name = getS0( fp );
  286. break;
  287. case ID_PRE:
  288. env->behavior[ 0 ] = getU2( fp );
  289. break;
  290. case ID_POST:
  291. env->behavior[ 1 ] = getU2( fp );
  292. break;
  293. case ID_KEY:
  294. key = (lwKey*)Mem_ClearedAlloc( sizeof( lwKey ), TAG_MODEL );
  295. if ( !key ) goto Fail;
  296. key->time = getF4( fp );
  297. key->value = getF4( fp );
  298. lwListInsert( (void**)&env->key, key, (int (__cdecl *)(void *,void *))compare_keys );
  299. env->nkeys++;
  300. break;
  301. case ID_SPAN:
  302. if ( key == NULL ) goto Fail;
  303. key->shape = getU4( fp );
  304. nparams = ( sz - 4 ) / 4;
  305. if ( nparams > 4 ) nparams = 4;
  306. for ( i = 0; i < nparams; i++ )
  307. f[ i ] = getF4( fp );
  308. switch ( key->shape ) {
  309. case ID_TCB:
  310. key->tension = f[ 0 ];
  311. key->continuity = f[ 1 ];
  312. key->bias = f[ 2 ];
  313. break;
  314. case ID_BEZI:
  315. case ID_HERM:
  316. case ID_BEZ2:
  317. for ( i = 0; i < nparams; i++ )
  318. key->param[ i ] = f[ i ];
  319. break;
  320. }
  321. break;
  322. case ID_CHAN:
  323. plug = (lwPlugin*)Mem_ClearedAlloc( sizeof( lwPlugin ), TAG_MODEL );
  324. if ( !plug ) goto Fail;
  325. plug->name = getS0( fp );
  326. plug->flags = getU2( fp );
  327. plug->data = getbytes( fp, sz - get_flen() );
  328. lwListAdd( (void**)&env->cfilter, plug );
  329. env->ncfilters++;
  330. break;
  331. default:
  332. break;
  333. }
  334. /* error while reading current subchunk? */
  335. rlen = get_flen();
  336. if ( rlen < 0 || rlen > sz ) goto Fail;
  337. /* skip unread parts of the current subchunk */
  338. if ( rlen < sz )
  339. fp->Seek( sz - rlen, FS_SEEK_CUR );
  340. /* end of the ENVL chunk? */
  341. rlen = fp->Tell() - pos;
  342. if ( cksize < rlen ) goto Fail;
  343. if ( cksize == rlen ) break;
  344. /* get the next subchunk header */
  345. set_flen( 0 );
  346. id = getU4( fp );
  347. sz = getU2( fp );
  348. if ( 6 != get_flen() ) goto Fail;
  349. }
  350. return env;
  351. Fail:
  352. lwFreeEnvelope( env );
  353. return NULL;
  354. }
  355. /*
  356. ======================================================================
  357. lwFindEnvelope()
  358. Returns an lwEnvelope pointer, given an envelope index.
  359. ====================================================================== */
  360. lwEnvelope *lwFindEnvelope( lwEnvelope *list, int index )
  361. {
  362. lwEnvelope *env;
  363. env = list;
  364. while ( env ) {
  365. if ( env->index == index ) break;
  366. env = env->next;
  367. }
  368. return env;
  369. }
  370. /*
  371. ======================================================================
  372. range()
  373. Given the value v of a periodic function, returns the equivalent value
  374. v2 in the principal interval [lo, hi]. If i isn't NULL, it receives
  375. the number of wavelengths between v and v2.
  376. v2 = v - i * (hi - lo)
  377. For example, range( 3 pi, 0, 2 pi, i ) returns pi, with i = 1.
  378. ====================================================================== */
  379. static float range( float v, float lo, float hi, int *i )
  380. {
  381. float v2, r = hi - lo;
  382. if ( r == 0.0 ) {
  383. if ( i ) *i = 0;
  384. return lo;
  385. }
  386. v2 = lo + v - r * ( float ) floor(( double ) v / r );
  387. if ( i ) *i = -( int )(( v2 - v ) / r + ( v2 > v ? 0.5 : -0.5 ));
  388. return v2;
  389. }
  390. /*
  391. ======================================================================
  392. hermite()
  393. Calculate the Hermite coefficients.
  394. ====================================================================== */
  395. static void hermite( float t, float *h1, float *h2, float *h3, float *h4 )
  396. {
  397. float t2, t3;
  398. t2 = t * t;
  399. t3 = t * t2;
  400. *h2 = 3.0f * t2 - t3 - t3;
  401. *h1 = 1.0f - *h2;
  402. *h4 = t3 - t2;
  403. *h3 = *h4 - t2 + t;
  404. }
  405. /*
  406. ======================================================================
  407. bezier()
  408. Interpolate the value of a 1D Bezier curve.
  409. ====================================================================== */
  410. static float bezier( float x0, float x1, float x2, float x3, float t )
  411. {
  412. float a, b, c, t2, t3;
  413. t2 = t * t;
  414. t3 = t2 * t;
  415. c = 3.0f * ( x1 - x0 );
  416. b = 3.0f * ( x2 - x1 ) - c;
  417. a = x3 - x0 - c - b;
  418. return a * t3 + b * t2 + c * t + x0;
  419. }
  420. /*
  421. ======================================================================
  422. bez2_time()
  423. Find the t for which bezier() returns the input time. The handle
  424. endpoints of a BEZ2 curve represent the control points, and these have
  425. (time, value) coordinates, so time is used as both a coordinate and a
  426. parameter for this curve type.
  427. ====================================================================== */
  428. static float bez2_time( float x0, float x1, float x2, float x3, float time,
  429. float *t0, float *t1 )
  430. {
  431. float v, t;
  432. t = *t0 + ( *t1 - *t0 ) * 0.5f;
  433. v = bezier( x0, x1, x2, x3, t );
  434. if ( idMath::Fabs( time - v ) > .0001f ) {
  435. if ( v > time )
  436. *t1 = t;
  437. else
  438. *t0 = t;
  439. return bez2_time( x0, x1, x2, x3, time, t0, t1 );
  440. }
  441. else
  442. return t;
  443. }
  444. /*
  445. ======================================================================
  446. bez2()
  447. Interpolate the value of a BEZ2 curve.
  448. ====================================================================== */
  449. static float bez2( lwKey *key0, lwKey *key1, float time )
  450. {
  451. float x, y, t, t0 = 0.0f, t1 = 1.0f;
  452. if ( key0->shape == ID_BEZ2 )
  453. x = key0->time + key0->param[ 2 ];
  454. else
  455. x = key0->time + ( key1->time - key0->time ) / 3.0f;
  456. t = bez2_time( key0->time, x, key1->time + key1->param[ 0 ], key1->time,
  457. time, &t0, &t1 );
  458. if ( key0->shape == ID_BEZ2 )
  459. y = key0->value + key0->param[ 3 ];
  460. else
  461. y = key0->value + key0->param[ 1 ] / 3.0f;
  462. return bezier( key0->value, y, key1->param[ 1 ] + key1->value, key1->value, t );
  463. }
  464. /*
  465. ======================================================================
  466. outgoing()
  467. Return the outgoing tangent to the curve at key0. The value returned
  468. for the BEZ2 case is used when extrapolating a linear pre behavior and
  469. when interpolating a non-BEZ2 span.
  470. ====================================================================== */
  471. static float outgoing( lwKey *key0, lwKey *key1 )
  472. {
  473. float a, b, d, t, out;
  474. switch ( key0->shape )
  475. {
  476. case ID_TCB:
  477. a = ( 1.0f - key0->tension )
  478. * ( 1.0f + key0->continuity )
  479. * ( 1.0f + key0->bias );
  480. b = ( 1.0f - key0->tension )
  481. * ( 1.0f - key0->continuity )
  482. * ( 1.0f - key0->bias );
  483. d = key1->value - key0->value;
  484. if ( key0->prev ) {
  485. t = ( key1->time - key0->time ) / ( key1->time - key0->prev->time );
  486. out = t * ( a * ( key0->value - key0->prev->value ) + b * d );
  487. }
  488. else
  489. out = b * d;
  490. break;
  491. case ID_LINE:
  492. d = key1->value - key0->value;
  493. if ( key0->prev ) {
  494. t = ( key1->time - key0->time ) / ( key1->time - key0->prev->time );
  495. out = t * ( key0->value - key0->prev->value + d );
  496. }
  497. else
  498. out = d;
  499. break;
  500. case ID_BEZI:
  501. case ID_HERM:
  502. out = key0->param[ 1 ];
  503. if ( key0->prev )
  504. out *= ( key1->time - key0->time ) / ( key1->time - key0->prev->time );
  505. break;
  506. case ID_BEZ2:
  507. out = key0->param[ 3 ] * ( key1->time - key0->time );
  508. if ( idMath::Fabs( key0->param[ 2 ] ) > 1e-5f )
  509. out /= key0->param[ 2 ];
  510. else
  511. out *= 1e5f;
  512. break;
  513. case ID_STEP:
  514. default:
  515. out = 0.0f;
  516. break;
  517. }
  518. return out;
  519. }
  520. /*
  521. ======================================================================
  522. incoming()
  523. Return the incoming tangent to the curve at key1. The value returned
  524. for the BEZ2 case is used when extrapolating a linear post behavior.
  525. ====================================================================== */
  526. static float incoming( lwKey *key0, lwKey *key1 )
  527. {
  528. float a, b, d, t, in;
  529. switch ( key1->shape )
  530. {
  531. case ID_LINE:
  532. d = key1->value - key0->value;
  533. if ( key1->next ) {
  534. t = ( key1->time - key0->time ) / ( key1->next->time - key0->time );
  535. in = t * ( key1->next->value - key1->value + d );
  536. }
  537. else
  538. in = d;
  539. break;
  540. case ID_TCB:
  541. a = ( 1.0f - key1->tension )
  542. * ( 1.0f - key1->continuity )
  543. * ( 1.0f + key1->bias );
  544. b = ( 1.0f - key1->tension )
  545. * ( 1.0f + key1->continuity )
  546. * ( 1.0f - key1->bias );
  547. d = key1->value - key0->value;
  548. if ( key1->next ) {
  549. t = ( key1->time - key0->time ) / ( key1->next->time - key0->time );
  550. in = t * ( b * ( key1->next->value - key1->value ) + a * d );
  551. }
  552. else
  553. in = a * d;
  554. break;
  555. case ID_BEZI:
  556. case ID_HERM:
  557. in = key1->param[ 0 ];
  558. if ( key1->next )
  559. in *= ( key1->time - key0->time ) / ( key1->next->time - key0->time );
  560. break;
  561. case ID_BEZ2:
  562. in = key1->param[ 1 ] * ( key1->time - key0->time );
  563. if ( idMath::Fabs( key1->param[ 0 ] ) > 1e-5f )
  564. in /= key1->param[ 0 ];
  565. else
  566. in *= 1e5f;
  567. break;
  568. case ID_STEP:
  569. default:
  570. in = 0.0f;
  571. break;
  572. }
  573. return in;
  574. }
  575. /*
  576. ======================================================================
  577. evalEnvelope()
  578. Given a list of keys and a time, returns the interpolated value of the
  579. envelope at that time.
  580. ====================================================================== */
  581. float evalEnvelope( lwEnvelope *env, float time )
  582. {
  583. lwKey *key0, *key1, *skey, *ekey;
  584. float t, h1, h2, h3, h4, in, out, offset = 0.0f;
  585. int noff;
  586. // Start key
  587. skey = ekey = env->key;
  588. /* if there's no key, the value is 0 */
  589. if ( env->nkeys == 0 || skey == NULL ) {
  590. return 0.0f;
  591. }
  592. /* if there's only one key, the value is constant */
  593. if ( env->nkeys == 1 ) {
  594. return env->key->value;
  595. }
  596. /* find the last keys */
  597. while ( ekey->next != NULL ) {
  598. ekey = ekey->next;
  599. }
  600. /* use pre-behavior if time is before first key time */
  601. if ( time < skey->time ) {
  602. switch ( env->behavior[ 0 ] )
  603. {
  604. case BEH_RESET:
  605. return 0.0f;
  606. case BEH_CONSTANT:
  607. return skey->value;
  608. case BEH_REPEAT:
  609. time = range( time, skey->time, ekey->time, NULL );
  610. break;
  611. case BEH_OSCILLATE:
  612. time = range( time, skey->time, ekey->time, &noff );
  613. if ( noff % 2 )
  614. time = ekey->time - skey->time - time;
  615. break;
  616. case BEH_OFFSET:
  617. time = range( time, skey->time, ekey->time, &noff );
  618. offset = noff * ( ekey->value - skey->value );
  619. break;
  620. case BEH_LINEAR:
  621. if ( skey->next != NULL ) {
  622. out = outgoing( skey, skey->next )
  623. / ( skey->next->time - skey->time );
  624. return out * ( time - skey->time ) + skey->value;
  625. } else {
  626. return 0.0f;
  627. }
  628. }
  629. }
  630. /* use post-behavior if time is after last key time */
  631. else if ( time > ekey->time ) {
  632. switch ( env->behavior[ 1 ] )
  633. {
  634. case BEH_RESET:
  635. return 0.0f;
  636. case BEH_CONSTANT:
  637. return ekey->value;
  638. case BEH_REPEAT:
  639. time = range( time, skey->time, ekey->time, NULL );
  640. break;
  641. case BEH_OSCILLATE:
  642. time = range( time, skey->time, ekey->time, &noff );
  643. if ( noff % 2 )
  644. time = ekey->time - skey->time - time;
  645. break;
  646. case BEH_OFFSET:
  647. time = range( time, skey->time, ekey->time, &noff );
  648. offset = noff * ( ekey->value - skey->value );
  649. break;
  650. case BEH_LINEAR:
  651. in = incoming( ekey->prev, ekey )
  652. / ( ekey->time - ekey->prev->time );
  653. return in * ( time - ekey->time ) + ekey->value;
  654. }
  655. }
  656. /* get the endpoints of the interval being evaluated */
  657. key0 = env->key;
  658. if ( key0 == NULL || key0->next == NULL ) {
  659. return 0.0f;
  660. }
  661. while ( time > key0->next->time )
  662. key0 = key0->next;
  663. key1 = key0->next;
  664. if ( key1 == NULL ) {
  665. return 0.0f;
  666. }
  667. /* check for singularities first */
  668. if ( time == key0->time )
  669. return key0->value + offset;
  670. else if ( time == key1->time )
  671. return key1->value + offset;
  672. /* get interval length, time in [0, 1] */
  673. t = ( time - key0->time ) / ( key1->time - key0->time );
  674. /* interpolate */
  675. switch ( key1->shape )
  676. {
  677. case ID_TCB:
  678. case ID_BEZI:
  679. case ID_HERM:
  680. out = outgoing( key0, key1 );
  681. in = incoming( key0, key1 );
  682. hermite( t, &h1, &h2, &h3, &h4 );
  683. return h1 * key0->value + h2 * key1->value + h3 * out + h4 * in + offset;
  684. case ID_BEZ2:
  685. return bez2( key0, key1, time ) + offset;
  686. case ID_LINE:
  687. return key0->value + t * ( key1->value - key0->value ) + offset;
  688. case ID_STEP:
  689. return key0->value + offset;
  690. default:
  691. return offset;
  692. }
  693. }
  694. /*
  695. ======================================================================
  696. lwListFree()
  697. Free the items in a list.
  698. ====================================================================== */
  699. void lwListFree( void *list, void ( *freeNode )( void * ))
  700. {
  701. lwNode *node, *next;
  702. node = ( lwNode * ) list;
  703. while ( node ) {
  704. next = node->next;
  705. freeNode( node );
  706. node = next;
  707. }
  708. }
  709. /*
  710. ======================================================================
  711. lwListAdd()
  712. Append a node to a list.
  713. ====================================================================== */
  714. void lwListAdd( void **list, void *node )
  715. {
  716. lwNode *head = NULL, *tail = NULL;
  717. head = *(( lwNode ** ) list );
  718. if ( head == NULL ) {
  719. *list = node;
  720. return;
  721. }
  722. while ( head ) {
  723. tail = head;
  724. head = head->next;
  725. }
  726. tail->next = ( lwNode * ) node;
  727. (( lwNode * ) node )->prev = tail;
  728. }
  729. /*
  730. ======================================================================
  731. lwListInsert()
  732. Insert a node into a list in sorted order.
  733. ====================================================================== */
  734. void lwListInsert( void **vlist, void *vitem, int ( *compare )( void *, void * ))
  735. {
  736. lwNode **list, *item, *node, *prev;
  737. if ( !*vlist ) {
  738. *vlist = vitem;
  739. return;
  740. }
  741. list = ( lwNode ** ) vlist;
  742. item = ( lwNode * ) vitem;
  743. node = *list;
  744. prev = NULL;
  745. while ( node ) {
  746. if ( 0 < compare( node, item )) break;
  747. prev = node;
  748. node = node->next;
  749. }
  750. if ( !prev ) {
  751. *list = item;
  752. node->prev = item;
  753. item->next = node;
  754. }
  755. else if ( !node ) {
  756. prev->next = item;
  757. item->prev = prev;
  758. }
  759. else {
  760. item->next = node;
  761. item->prev = prev;
  762. prev->next = item;
  763. node->prev = item;
  764. }
  765. }
  766. /*
  767. ======================================================================
  768. flen
  769. This accumulates a count of the number of bytes read. Callers can set
  770. it at the beginning of a sequence of reads and then retrieve it to get
  771. the number of bytes actually read. If one of the I/O functions fails,
  772. flen is set to an error code, after which the I/O functions ignore
  773. read requests until flen is reset.
  774. ====================================================================== */
  775. #define FLEN_ERROR -9999
  776. static int flen;
  777. void set_flen( int i ) { flen = i; }
  778. int get_flen() { return flen; }
  779. void *getbytes( idFile *fp, int size )
  780. {
  781. void *data;
  782. if ( flen == FLEN_ERROR ) return NULL;
  783. if ( size < 0 ) {
  784. flen = FLEN_ERROR;
  785. return NULL;
  786. }
  787. data = Mem_ClearedAlloc( size, TAG_MODEL );
  788. if ( !data ) {
  789. flen = FLEN_ERROR;
  790. return NULL;
  791. }
  792. if ( size != fp->Read( data, size ) ) {
  793. flen = FLEN_ERROR;
  794. Mem_Free( data );
  795. return NULL;
  796. }
  797. flen += size;
  798. return data;
  799. }
  800. void skipbytes( idFile *fp, int n )
  801. {
  802. if ( flen == FLEN_ERROR ) return;
  803. if ( fp->Seek( n, FS_SEEK_CUR ))
  804. flen = FLEN_ERROR;
  805. else
  806. flen += n;
  807. }
  808. int getI1( idFile *fp )
  809. {
  810. int i, c;
  811. if ( flen == FLEN_ERROR ) return 0;
  812. c = 0;
  813. i = fp->Read(&c, 1);
  814. if ( i < 0 ) {
  815. flen = FLEN_ERROR;
  816. return 0;
  817. }
  818. if ( c > 127 ) c -= 256;
  819. flen += 1;
  820. return c;
  821. }
  822. short getI2( idFile *fp )
  823. {
  824. short i;
  825. if ( flen == FLEN_ERROR ) return 0;
  826. if ( 2 != fp->Read( &i, 2 )) {
  827. flen = FLEN_ERROR;
  828. return 0;
  829. }
  830. BigRevBytes( &i, 2, 1 );
  831. flen += 2;
  832. return i;
  833. }
  834. int getI4( idFile *fp )
  835. {
  836. int i;
  837. if ( flen == FLEN_ERROR ) return 0;
  838. if ( 4 != fp->Read( &i, 4 )) {
  839. flen = FLEN_ERROR;
  840. return 0;
  841. }
  842. BigRevBytes( &i, 4, 1 );
  843. flen += 4;
  844. return i;
  845. }
  846. unsigned char getU1( idFile *fp )
  847. {
  848. int i, c;
  849. if ( flen == FLEN_ERROR ) return 0;
  850. c = 0;
  851. i = fp->Read(&c, 1);
  852. if ( i < 0 ) {
  853. flen = FLEN_ERROR;
  854. return 0;
  855. }
  856. flen += 1;
  857. return c;
  858. }
  859. unsigned short getU2( idFile *fp )
  860. {
  861. unsigned short i;
  862. if ( flen == FLEN_ERROR ) return 0;
  863. if ( 2 != fp->Read( &i, 2 )) {
  864. flen = FLEN_ERROR;
  865. return 0;
  866. }
  867. BigRevBytes( &i, 2, 1 );
  868. flen += 2;
  869. return i;
  870. }
  871. unsigned int getU4( idFile *fp )
  872. {
  873. unsigned int i;
  874. if ( flen == FLEN_ERROR ) return 0;
  875. if ( 4 != fp->Read( &i, 4 )) {
  876. flen = FLEN_ERROR;
  877. return 0;
  878. }
  879. BigRevBytes( &i, 4, 1 );
  880. flen += 4;
  881. return i;
  882. }
  883. int getVX( idFile *fp )
  884. {
  885. byte c;
  886. int i;
  887. if ( flen == FLEN_ERROR ) return 0;
  888. c = 0;
  889. if (fp->Read(&c, 1) == -1) {
  890. return 0;
  891. }
  892. if ( c != 0xFF ) {
  893. i = c << 8;
  894. c = 0;
  895. if (fp->Read(&c, 1) == -1) {
  896. return 0;
  897. }
  898. i |= c;
  899. flen += 2;
  900. }
  901. else {
  902. c = 0;
  903. if (fp->Read(&c, 1) == -1) {
  904. return 0;
  905. }
  906. i = c << 16;
  907. c = 0;
  908. if (fp->Read(&c, 1) == -1) {
  909. return 0;
  910. }
  911. i |= c << 8;
  912. c = 0;
  913. if (fp->Read(&c, 1) == -1) {
  914. return 0;
  915. }
  916. i |= c;
  917. flen += 4;
  918. }
  919. return i;
  920. }
  921. float getF4( idFile *fp )
  922. {
  923. float f;
  924. if ( flen == FLEN_ERROR ) return 0.0f;
  925. if ( 4 != fp->Read( &f, 4 ) ) {
  926. flen = FLEN_ERROR;
  927. return 0.0f;
  928. }
  929. BigRevBytes( &f, 4, 1 );
  930. flen += 4;
  931. if ( IEEE_FLT_IS_DENORMAL( f ) ) {
  932. f = 0.0f;
  933. }
  934. return f;
  935. }
  936. char *getS0( idFile *fp )
  937. {
  938. char *s;
  939. int i, c, len, pos;
  940. if ( flen == FLEN_ERROR ) return NULL;
  941. pos = fp->Tell();
  942. for ( i = 1; ; i++ ) {
  943. c = 0;
  944. if (fp->Read(&c, 1) == -1) {
  945. flen = FLEN_ERROR;
  946. return NULL;
  947. }
  948. if ( c == 0 ) break;
  949. }
  950. if ( i == 1 ) {
  951. if ( fp->Seek( pos + 2, FS_SEEK_SET ))
  952. flen = FLEN_ERROR;
  953. else
  954. flen += 2;
  955. return NULL;
  956. }
  957. len = i + ( i & 1 );
  958. s = (char*)Mem_ClearedAlloc( len, TAG_MODEL );
  959. if ( !s ) {
  960. flen = FLEN_ERROR;
  961. return NULL;
  962. }
  963. if ( fp->Seek( pos, FS_SEEK_SET )) {
  964. flen = FLEN_ERROR;
  965. return NULL;
  966. }
  967. if ( len != fp->Read( s, len )) {
  968. flen = FLEN_ERROR;
  969. return NULL;
  970. }
  971. flen += len;
  972. return s;
  973. }
  974. int sgetI1( unsigned char **bp )
  975. {
  976. assert( bp != NULL && *bp != NULL ); // remove compiler warning
  977. int i;
  978. if ( flen == FLEN_ERROR ) return 0;
  979. i = **bp;
  980. if ( i > 127 ) i -= 256;
  981. flen += 1;
  982. (*bp)++;
  983. return i;
  984. }
  985. short sgetI2( unsigned char **bp )
  986. {
  987. assert( bp != NULL && *bp != NULL ); // remove compiler warning
  988. short i;
  989. if ( flen == FLEN_ERROR ) return 0;
  990. memcpy( &i, *bp, 2 );
  991. BigRevBytes( &i, 2, 1 );
  992. flen += 2;
  993. (*bp) += 2;
  994. return i;
  995. }
  996. int sgetI4( unsigned char **bp )
  997. {
  998. assert( bp != NULL && *bp != NULL ); // remove compiler warning
  999. short i;
  1000. if ( flen == FLEN_ERROR ) return 0;
  1001. memcpy( &i, *bp, sizeof( i ) );
  1002. BigRevBytes( &i, 4, 1 );
  1003. flen += 4;
  1004. (*bp) += 4;
  1005. return i;
  1006. }
  1007. unsigned char sgetU1( unsigned char **bp )
  1008. {
  1009. unsigned char c;
  1010. if ( flen == FLEN_ERROR ) return 0;
  1011. c = **bp;
  1012. flen += 1;
  1013. (*bp)++;
  1014. return c;
  1015. }
  1016. unsigned short sgetU2( unsigned char **bp )
  1017. {
  1018. unsigned char *buf = *bp;
  1019. unsigned short i;
  1020. if ( flen == FLEN_ERROR ) return 0;
  1021. i = ( buf[ 0 ] << 8 ) | buf[ 1 ];
  1022. flen += 2;
  1023. (*bp) += 2;
  1024. return i;
  1025. }
  1026. unsigned int sgetU4( unsigned char **bp )
  1027. {
  1028. unsigned int i;
  1029. if ( flen == FLEN_ERROR ) return 0;
  1030. memcpy( &i, *bp, 4 );
  1031. BigRevBytes( &i, 4, 1 );
  1032. flen += 4;
  1033. (*bp) += 4;
  1034. return i;
  1035. }
  1036. int sgetVX( unsigned char **bp )
  1037. {
  1038. unsigned char *buf = *bp;
  1039. int i;
  1040. if ( flen == FLEN_ERROR ) return 0;
  1041. if ( buf[ 0 ] != 0xFF ) {
  1042. i = buf[ 0 ] << 8 | buf[ 1 ];
  1043. flen += 2;
  1044. (*bp) += 2;
  1045. }
  1046. else {
  1047. i = ( buf[ 1 ] << 16 ) | ( buf[ 2 ] << 8 ) | buf[ 3 ];
  1048. flen += 4;
  1049. (*bp) += 4;
  1050. }
  1051. return i;
  1052. }
  1053. float sgetF4( unsigned char **bp )
  1054. {
  1055. float f;
  1056. if ( flen == FLEN_ERROR ) return 0.0f;
  1057. memcpy( &f, *bp, 4 );
  1058. BigRevBytes( &f, 4, 1 );
  1059. flen += 4;
  1060. (*bp) += 4;
  1061. if ( IEEE_FLT_IS_DENORMAL( f ) ) {
  1062. f = 0.0f;
  1063. }
  1064. return f;
  1065. }
  1066. char *sgetS0( unsigned char **bp )
  1067. {
  1068. char *s;
  1069. unsigned char *buf = *bp;
  1070. int len;
  1071. if ( flen == FLEN_ERROR ) return NULL;
  1072. len = strlen( (const char*)buf ) + 1;
  1073. if ( len == 1 ) {
  1074. flen += 2;
  1075. (*bp) += 2;
  1076. return NULL;
  1077. }
  1078. len += len & 1;
  1079. s = (char*)Mem_ClearedAlloc( len, TAG_MODEL );
  1080. if ( !s ) {
  1081. flen = FLEN_ERROR;
  1082. return NULL;
  1083. }
  1084. memcpy( s, buf, len );
  1085. flen += len;
  1086. (*bp) += len;
  1087. return s;
  1088. }
  1089. /*
  1090. ======================================================================
  1091. lwFreeLayer()
  1092. Free memory used by an lwLayer.
  1093. ====================================================================== */
  1094. void lwFreeLayer( lwLayer *layer )
  1095. {
  1096. if ( layer ) {
  1097. if ( layer->name ) Mem_Free( layer->name );
  1098. lwFreePoints( &layer->point );
  1099. lwFreePolygons( &layer->polygon );
  1100. lwListFree( layer->vmap, (void (__cdecl *)(void *))lwFreeVMap );
  1101. Mem_Free( layer );
  1102. }
  1103. }
  1104. /*
  1105. ======================================================================
  1106. lwFreeObject()
  1107. Free memory used by an lwObject.
  1108. ====================================================================== */
  1109. void lwFreeObject( lwObject *object )
  1110. {
  1111. if ( object ) {
  1112. lwListFree( object->layer, (void (__cdecl *)(void *))lwFreeLayer );
  1113. lwListFree( object->env, (void (__cdecl *)(void *))lwFreeEnvelope );
  1114. lwListFree( object->clip, (void (__cdecl *)(void *))lwFreeClip );
  1115. lwListFree( object->surf, (void (__cdecl *)(void *))lwFreeSurface );
  1116. lwFreeTags( &object->taglist );
  1117. Mem_Free( object );
  1118. }
  1119. }
  1120. /*
  1121. ======================================================================
  1122. lwGetObject()
  1123. Returns the contents of a LightWave object, given its filename, or
  1124. NULL if the file couldn't be loaded. On failure, failID and failpos
  1125. can be used to diagnose the cause.
  1126. 1. If the file isn't an LWO2 or an LWOB, failpos will contain 12 and
  1127. failID will be unchanged.
  1128. 2. If an error occurs while reading, failID will contain the most
  1129. recently read IFF chunk ID, and failpos will contain the value
  1130. returned by fp->Tell() at the time of the failure.
  1131. 3. If the file couldn't be opened, or an error occurs while reading
  1132. the first 12 bytes, both failID and failpos will be unchanged.
  1133. If you don't need this information, failID and failpos can be NULL.
  1134. ====================================================================== */
  1135. lwObject *lwGetObject( const char *filename, unsigned int *failID, int *failpos )
  1136. {
  1137. idFile *fp = NULL;
  1138. lwObject *object;
  1139. lwLayer *layer;
  1140. lwNode *node;
  1141. int id, formsize, type, cksize;
  1142. int i, rlen;
  1143. fp = fileSystem->OpenFileRead( filename );
  1144. if ( !fp ) {
  1145. return NULL;
  1146. }
  1147. /* read the first 12 bytes */
  1148. set_flen( 0 );
  1149. id = getU4( fp );
  1150. formsize = getU4( fp );
  1151. type = getU4( fp );
  1152. if ( 12 != get_flen() ) {
  1153. fileSystem->CloseFile( fp );
  1154. return NULL;
  1155. }
  1156. /* is this a LW object? */
  1157. if ( id != ID_FORM ) {
  1158. fileSystem->CloseFile( fp );
  1159. if ( failpos ) *failpos = 12;
  1160. return NULL;
  1161. }
  1162. if ( type != ID_LWO2 ) {
  1163. fileSystem->CloseFile( fp );
  1164. if ( type == ID_LWOB )
  1165. return lwGetObject5( filename, failID, failpos );
  1166. else {
  1167. if ( failpos ) *failpos = 12;
  1168. return NULL;
  1169. }
  1170. }
  1171. /* allocate an object and a default layer */
  1172. object = (lwObject*)Mem_ClearedAlloc( sizeof( lwObject ), TAG_MODEL );
  1173. if ( !object ) goto Fail;
  1174. layer = (lwLayer*)Mem_ClearedAlloc( sizeof( lwLayer ), TAG_MODEL );
  1175. if ( !layer ) goto Fail;
  1176. object->layer = layer;
  1177. object->timeStamp = fp->Timestamp();
  1178. /* get the first chunk header */
  1179. id = getU4( fp );
  1180. cksize = getU4( fp );
  1181. if ( 0 > get_flen() ) goto Fail;
  1182. /* process chunks as they're encountered */
  1183. while ( 1 ) {
  1184. cksize += cksize & 1;
  1185. switch ( id )
  1186. {
  1187. case ID_LAYR:
  1188. if ( object->nlayers > 0 ) {
  1189. layer = (lwLayer*)Mem_ClearedAlloc( sizeof( lwLayer ), TAG_MODEL );
  1190. if ( !layer ) goto Fail;
  1191. lwListAdd( (void**)&object->layer, layer );
  1192. }
  1193. object->nlayers++;
  1194. set_flen( 0 );
  1195. layer->index = getU2( fp );
  1196. layer->flags = getU2( fp );
  1197. layer->pivot[ 0 ] = getF4( fp );
  1198. layer->pivot[ 1 ] = getF4( fp );
  1199. layer->pivot[ 2 ] = getF4( fp );
  1200. layer->name = getS0( fp );
  1201. rlen = get_flen();
  1202. if ( rlen < 0 || rlen > cksize ) goto Fail;
  1203. if ( rlen <= cksize - 2 )
  1204. layer->parent = getU2( fp );
  1205. rlen = get_flen();
  1206. if ( rlen < cksize )
  1207. fp->Seek( cksize - rlen, FS_SEEK_CUR );
  1208. break;
  1209. case ID_PNTS:
  1210. if ( !lwGetPoints( fp, cksize, &layer->point ))
  1211. goto Fail;
  1212. break;
  1213. case ID_POLS:
  1214. if ( !lwGetPolygons( fp, cksize, &layer->polygon,
  1215. layer->point.offset ))
  1216. goto Fail;
  1217. break;
  1218. case ID_VMAP:
  1219. case ID_VMAD:
  1220. node = ( lwNode * ) lwGetVMap( fp, cksize, layer->point.offset,
  1221. layer->polygon.offset, id == ID_VMAD );
  1222. if ( !node ) goto Fail;
  1223. lwListAdd( (void**)&layer->vmap, node );
  1224. layer->nvmaps++;
  1225. break;
  1226. case ID_PTAG:
  1227. if ( !lwGetPolygonTags( fp, cksize, &object->taglist,
  1228. &layer->polygon ))
  1229. goto Fail;
  1230. break;
  1231. case ID_BBOX:
  1232. set_flen( 0 );
  1233. for ( i = 0; i < 6; i++ )
  1234. layer->bbox[ i ] = getF4( fp );
  1235. rlen = get_flen();
  1236. if ( rlen < 0 || rlen > cksize ) goto Fail;
  1237. if ( rlen < cksize )
  1238. fp->Seek( cksize - rlen, FS_SEEK_CUR );
  1239. break;
  1240. case ID_TAGS:
  1241. if ( !lwGetTags( fp, cksize, &object->taglist ))
  1242. goto Fail;
  1243. break;
  1244. case ID_ENVL:
  1245. node = ( lwNode * ) lwGetEnvelope( fp, cksize );
  1246. if ( !node ) goto Fail;
  1247. lwListAdd( (void**)&object->env, node );
  1248. object->nenvs++;
  1249. break;
  1250. case ID_CLIP:
  1251. node = ( lwNode * ) lwGetClip( fp, cksize );
  1252. if ( !node ) goto Fail;
  1253. lwListAdd( (void**)&object->clip, node );
  1254. object->nclips++;
  1255. break;
  1256. case ID_SURF:
  1257. node = ( lwNode * ) lwGetSurface( fp, cksize );
  1258. if ( !node ) goto Fail;
  1259. lwListAdd( (void**)&object->surf, node );
  1260. object->nsurfs++;
  1261. break;
  1262. case ID_DESC:
  1263. case ID_TEXT:
  1264. case ID_ICON:
  1265. default:
  1266. fp->Seek( cksize, FS_SEEK_CUR );
  1267. break;
  1268. }
  1269. /* end of the file? */
  1270. if ( formsize <= fp->Tell() - 8 ) break;
  1271. /* get the next chunk header */
  1272. set_flen( 0 );
  1273. id = getU4( fp );
  1274. cksize = getU4( fp );
  1275. if ( 8 != get_flen() ) goto Fail;
  1276. }
  1277. fileSystem->CloseFile( fp );
  1278. fp = NULL;
  1279. if ( object->nlayers == 0 )
  1280. object->nlayers = 1;
  1281. layer = object->layer;
  1282. while ( layer ) {
  1283. lwGetBoundingBox( &layer->point, layer->bbox );
  1284. lwGetPolyNormals( &layer->point, &layer->polygon );
  1285. if ( !lwGetPointPolygons( &layer->point, &layer->polygon )) goto Fail;
  1286. if ( !lwResolvePolySurfaces( &layer->polygon, &object->taglist,
  1287. &object->surf, &object->nsurfs )) goto Fail;
  1288. lwGetVertNormals( &layer->point, &layer->polygon );
  1289. if ( !lwGetPointVMaps( &layer->point, layer->vmap )) goto Fail;
  1290. if ( !lwGetPolyVMaps( &layer->polygon, layer->vmap )) goto Fail;
  1291. layer = layer->next;
  1292. }
  1293. return object;
  1294. Fail:
  1295. if ( failID ) *failID = id;
  1296. if ( fp ) {
  1297. if ( failpos ) *failpos = fp->Tell();
  1298. fileSystem->CloseFile( fp );
  1299. }
  1300. lwFreeObject( object );
  1301. return NULL;
  1302. }
  1303. /* IDs specific to LWOB */
  1304. #define ID_SRFS LWID_('S','R','F','S')
  1305. #define ID_FLAG LWID_('F','L','A','G')
  1306. #define ID_VLUM LWID_('V','L','U','M')
  1307. #define ID_VDIF LWID_('V','D','I','F')
  1308. #define ID_VSPC LWID_('V','S','P','C')
  1309. #define ID_RFLT LWID_('R','F','L','T')
  1310. #define ID_BTEX LWID_('B','T','E','X')
  1311. #define ID_CTEX LWID_('C','T','E','X')
  1312. #define ID_DTEX LWID_('D','T','E','X')
  1313. #define ID_LTEX LWID_('L','T','E','X')
  1314. #define ID_RTEX LWID_('R','T','E','X')
  1315. #define ID_STEX LWID_('S','T','E','X')
  1316. #define ID_TTEX LWID_('T','T','E','X')
  1317. #define ID_TFLG LWID_('T','F','L','G')
  1318. #define ID_TSIZ LWID_('T','S','I','Z')
  1319. #define ID_TCTR LWID_('T','C','T','R')
  1320. #define ID_TFAL LWID_('T','F','A','L')
  1321. #define ID_TVEL LWID_('T','V','E','L')
  1322. #define ID_TCLR LWID_('T','C','L','R')
  1323. #define ID_TVAL LWID_('T','V','A','L')
  1324. #define ID_TAMP LWID_('T','A','M','P')
  1325. #define ID_TIMG LWID_('T','I','M','G')
  1326. #define ID_TAAS LWID_('T','A','A','S')
  1327. #define ID_TREF LWID_('T','R','E','F')
  1328. #define ID_TOPC LWID_('T','O','P','C')
  1329. #define ID_SDAT LWID_('S','D','A','T')
  1330. #define ID_TFP0 LWID_('T','F','P','0')
  1331. #define ID_TFP1 LWID_('T','F','P','1')
  1332. /*
  1333. ======================================================================
  1334. add_clip()
  1335. Add a clip to the clip list. Used to store the contents of an RIMG or
  1336. TIMG surface subchunk.
  1337. ====================================================================== */
  1338. static int add_clip( char *s, lwClip **clist, int *nclips )
  1339. {
  1340. lwClip *clip;
  1341. char *p;
  1342. clip = (lwClip*)Mem_ClearedAlloc( sizeof( lwClip ), TAG_MODEL );
  1343. if ( clip == NULL ) return 0;
  1344. clip->contrast.val = 1.0f;
  1345. clip->brightness.val = 1.0f;
  1346. clip->saturation.val = 1.0f;
  1347. clip->gamma.val = 1.0f;
  1348. if ( ( p = strstr( s, "(sequence)" ) ) != NULL ) {
  1349. p[ -1 ] = 0;
  1350. clip->type = ID_ISEQ;
  1351. clip->source.seq.prefix = s;
  1352. clip->source.seq.digits = 3;
  1353. }
  1354. else {
  1355. clip->type = ID_STIL;
  1356. clip->source.still.name = s;
  1357. }
  1358. (*nclips)++;
  1359. clip->index = *nclips;
  1360. lwListAdd( (void**)clist, clip );
  1361. return clip->index;
  1362. }
  1363. /*
  1364. ======================================================================
  1365. add_tvel()
  1366. Add a triple of envelopes to simulate the old texture velocity
  1367. parameters.
  1368. ====================================================================== */
  1369. static int add_tvel( float pos[], float vel[], lwEnvelope **elist, int *nenvs )
  1370. {
  1371. lwEnvelope *env = NULL;
  1372. lwKey *key0 = NULL, *key1 = NULL;
  1373. int i;
  1374. for ( i = 0; i < 3; i++ ) {
  1375. env = (lwEnvelope*)Mem_ClearedAlloc( sizeof( lwEnvelope ), TAG_MODEL );
  1376. key0 = (lwKey*)Mem_ClearedAlloc( sizeof( lwKey ), TAG_MODEL );
  1377. key1 = (lwKey*)Mem_ClearedAlloc( sizeof( lwKey ), TAG_MODEL );
  1378. if ( !env || !key0 || !key1 ) return 0;
  1379. key0->next = key1;
  1380. key0->value = pos[ i ];
  1381. key0->time = 0.0f;
  1382. key1->prev = key0;
  1383. key1->value = pos[ i ] + vel[ i ] * 30.0f;
  1384. key1->time = 1.0f;
  1385. key0->shape = key1->shape = ID_LINE;
  1386. env->index = *nenvs + i + 1;
  1387. env->type = 0x0301 + i;
  1388. env->name = (char*)Mem_ClearedAlloc( 11, TAG_MODEL );
  1389. if ( env->name ) {
  1390. strcpy( env->name, "Position.X" );
  1391. env->name[ 9 ] += i;
  1392. }
  1393. env->key = key0;
  1394. env->nkeys = 2;
  1395. env->behavior[ 0 ] = BEH_LINEAR;
  1396. env->behavior[ 1 ] = BEH_LINEAR;
  1397. lwListAdd( (void**)elist, env );
  1398. }
  1399. assert( env != NULL );
  1400. *nenvs += 3;
  1401. return env->index - 2;
  1402. }
  1403. /*
  1404. ======================================================================
  1405. get_texture()
  1406. Create a new texture for BTEX, CTEX, etc. subchunks.
  1407. ====================================================================== */
  1408. static lwTexture *get_texture( char *s )
  1409. {
  1410. lwTexture *tex;
  1411. tex = (lwTexture*)Mem_ClearedAlloc( sizeof( lwTexture ), TAG_MODEL );
  1412. if ( !tex ) return NULL;
  1413. tex->tmap.size.val[ 0 ] =
  1414. tex->tmap.size.val[ 1 ] =
  1415. tex->tmap.size.val[ 2 ] = 1.0f;
  1416. tex->opacity.val = 1.0f;
  1417. tex->enabled = 1;
  1418. if ( strstr( s, "Image Map" )) {
  1419. tex->type = ID_IMAP;
  1420. if ( strstr( s, "Planar" )) tex->param.imap.projection = 0;
  1421. else if ( strstr( s, "Cylindrical" )) tex->param.imap.projection = 1;
  1422. else if ( strstr( s, "Spherical" )) tex->param.imap.projection = 2;
  1423. else if ( strstr( s, "Cubic" )) tex->param.imap.projection = 3;
  1424. else if ( strstr( s, "Front" )) tex->param.imap.projection = 4;
  1425. tex->param.imap.aa_strength = 1.0f;
  1426. tex->param.imap.amplitude.val = 1.0f;
  1427. Mem_Free( s );
  1428. }
  1429. else {
  1430. tex->type = ID_PROC;
  1431. tex->param.proc.name = s;
  1432. }
  1433. return tex;
  1434. }
  1435. /*
  1436. ======================================================================
  1437. lwGetSurface5()
  1438. Read an lwSurface from an LWOB file.
  1439. ====================================================================== */
  1440. lwSurface *lwGetSurface5( idFile *fp, int cksize, lwObject *obj )
  1441. {
  1442. lwSurface *surf = NULL;
  1443. lwTexture *tex = NULL;
  1444. lwPlugin *shdr = NULL;
  1445. char *s = NULL;
  1446. float v[ 3 ];
  1447. unsigned int id, flags;
  1448. unsigned short sz;
  1449. int pos, rlen, i = 0;
  1450. /* allocate the Surface structure */
  1451. surf = (lwSurface*)Mem_ClearedAlloc( sizeof( lwSurface ), TAG_MODEL );
  1452. if ( !surf ) goto Fail;
  1453. /* non-zero defaults */
  1454. surf->color.rgb[ 0 ] = 0.78431f;
  1455. surf->color.rgb[ 1 ] = 0.78431f;
  1456. surf->color.rgb[ 2 ] = 0.78431f;
  1457. surf->diffuse.val = 1.0f;
  1458. surf->glossiness.val = 0.4f;
  1459. surf->bump.val = 1.0f;
  1460. surf->eta.val = 1.0f;
  1461. surf->sideflags = 1;
  1462. /* remember where we started */
  1463. set_flen( 0 );
  1464. pos = fp->Tell();
  1465. /* name */
  1466. surf->name = getS0( fp );
  1467. /* first subchunk header */
  1468. id = getU4( fp );
  1469. sz = getU2( fp );
  1470. if ( 0 > get_flen() ) goto Fail;
  1471. /* process subchunks as they're encountered */
  1472. while ( 1 ) {
  1473. sz += sz & 1;
  1474. set_flen( 0 );
  1475. switch ( id ) {
  1476. case ID_COLR:
  1477. surf->color.rgb[ 0 ] = getU1( fp ) / 255.0f;
  1478. surf->color.rgb[ 1 ] = getU1( fp ) / 255.0f;
  1479. surf->color.rgb[ 2 ] = getU1( fp ) / 255.0f;
  1480. break;
  1481. case ID_FLAG:
  1482. flags = getU2( fp );
  1483. if ( flags & 4 ) surf->smooth = 1.56207f;
  1484. if ( flags & 8 ) surf->color_hilite.val = 1.0f;
  1485. if ( flags & 16 ) surf->color_filter.val = 1.0f;
  1486. if ( flags & 128 ) surf->dif_sharp.val = 0.5f;
  1487. if ( flags & 256 ) surf->sideflags = 3;
  1488. if ( flags & 512 ) surf->add_trans.val = 1.0f;
  1489. break;
  1490. case ID_LUMI:
  1491. surf->luminosity.val = getI2( fp ) / 256.0f;
  1492. break;
  1493. case ID_VLUM:
  1494. surf->luminosity.val = getF4( fp );
  1495. break;
  1496. case ID_DIFF:
  1497. surf->diffuse.val = getI2( fp ) / 256.0f;
  1498. break;
  1499. case ID_VDIF:
  1500. surf->diffuse.val = getF4( fp );
  1501. break;
  1502. case ID_SPEC:
  1503. surf->specularity.val = getI2( fp ) / 256.0f;
  1504. break;
  1505. case ID_VSPC:
  1506. surf->specularity.val = getF4( fp );
  1507. break;
  1508. case ID_GLOS:
  1509. surf->glossiness.val = ( float ) logf( ( float) getU2( fp )) / 20.7944f;
  1510. break;
  1511. case ID_SMAN:
  1512. surf->smooth = getF4( fp );
  1513. break;
  1514. case ID_REFL:
  1515. surf->reflection.val.val = getI2( fp ) / 256.0f;
  1516. break;
  1517. case ID_RFLT:
  1518. surf->reflection.options = getU2( fp );
  1519. break;
  1520. case ID_RIMG:
  1521. s = getS0( fp );
  1522. surf->reflection.cindex = add_clip( s, &obj->clip, &obj->nclips );
  1523. surf->reflection.options = 3;
  1524. break;
  1525. case ID_RSAN:
  1526. surf->reflection.seam_angle = getF4( fp );
  1527. break;
  1528. case ID_TRAN:
  1529. surf->transparency.val.val = getI2( fp ) / 256.0f;
  1530. break;
  1531. case ID_RIND:
  1532. surf->eta.val = getF4( fp );
  1533. break;
  1534. case ID_BTEX:
  1535. s = (char*)getbytes( fp, sz );
  1536. tex = get_texture( s );
  1537. lwListAdd( (void**)&surf->bump.tex, tex );
  1538. break;
  1539. case ID_CTEX:
  1540. s = (char*)getbytes( fp, sz );
  1541. tex = get_texture( s );
  1542. lwListAdd( (void**)&surf->color.tex, tex );
  1543. break;
  1544. case ID_DTEX:
  1545. s = (char*)getbytes( fp, sz );
  1546. tex = get_texture( s );
  1547. lwListAdd( (void**)&surf->diffuse.tex, tex );
  1548. break;
  1549. case ID_LTEX:
  1550. s = (char*)getbytes( fp, sz );
  1551. tex = get_texture( s );
  1552. lwListAdd( (void**)&surf->luminosity.tex, tex );
  1553. break;
  1554. case ID_RTEX:
  1555. s = (char*)getbytes( fp, sz );
  1556. tex = get_texture( s );
  1557. lwListAdd( (void**)&surf->reflection.val.tex, tex );
  1558. break;
  1559. case ID_STEX:
  1560. s = (char*)getbytes( fp, sz );
  1561. tex = get_texture( s );
  1562. lwListAdd( (void**)&surf->specularity.tex, tex );
  1563. break;
  1564. case ID_TTEX:
  1565. s = (char*)getbytes( fp, sz );
  1566. tex = get_texture( s );
  1567. lwListAdd( (void**)&surf->transparency.val.tex, tex );
  1568. break;
  1569. case ID_TFLG:
  1570. assert( tex != NULL );
  1571. flags = getU2( fp );
  1572. if ( flags & 1 ) i = 0;
  1573. if ( flags & 2 ) i = 1;
  1574. if ( flags & 4 ) i = 2;
  1575. tex->axis = i;
  1576. if ( tex->type == ID_IMAP )
  1577. tex->param.imap.axis = i;
  1578. else
  1579. tex->param.proc.axis = i;
  1580. if ( flags & 8 ) tex->tmap.coord_sys = 1;
  1581. if ( flags & 16 ) tex->negative = 1;
  1582. if ( flags & 32 ) tex->param.imap.pblend = 1;
  1583. if ( flags & 64 ) {
  1584. tex->param.imap.aa_strength = 1.0f;
  1585. tex->param.imap.aas_flags = 1;
  1586. }
  1587. break;
  1588. case ID_TSIZ:
  1589. assert( tex != NULL );
  1590. for ( i = 0; i < 3; i++ )
  1591. tex->tmap.size.val[ i ] = getF4( fp );
  1592. break;
  1593. case ID_TCTR:
  1594. assert( tex != NULL );
  1595. for ( i = 0; i < 3; i++ )
  1596. tex->tmap.center.val[ i ] = getF4( fp );
  1597. break;
  1598. case ID_TFAL:
  1599. assert( tex != NULL );
  1600. for ( i = 0; i < 3; i++ )
  1601. tex->tmap.falloff.val[ i ] = getF4( fp );
  1602. break;
  1603. case ID_TVEL:
  1604. assert( tex != NULL );
  1605. for ( i = 0; i < 3; i++ )
  1606. v[ i ] = getF4( fp );
  1607. tex->tmap.center.eindex = add_tvel( tex->tmap.center.val, v,
  1608. &obj->env, &obj->nenvs );
  1609. break;
  1610. case ID_TCLR:
  1611. assert( tex != NULL );
  1612. if ( tex->type == ID_PROC )
  1613. for ( i = 0; i < 3; i++ )
  1614. tex->param.proc.value[ i ] = getU1( fp ) / 255.0f;
  1615. break;
  1616. case ID_TVAL:
  1617. assert( tex != NULL );
  1618. tex->param.proc.value[ 0 ] = getI2( fp ) / 256.0f;
  1619. break;
  1620. case ID_TAMP:
  1621. assert( tex != NULL );
  1622. if ( tex->type == ID_IMAP )
  1623. tex->param.imap.amplitude.val = getF4( fp );
  1624. break;
  1625. case ID_TIMG:
  1626. assert( tex != NULL );
  1627. s = getS0( fp );
  1628. tex->param.imap.cindex = add_clip( s, &obj->clip, &obj->nclips );
  1629. break;
  1630. case ID_TAAS:
  1631. assert( tex != NULL );
  1632. tex->param.imap.aa_strength = getF4( fp );
  1633. tex->param.imap.aas_flags = 1;
  1634. break;
  1635. case ID_TREF:
  1636. assert( tex != NULL );
  1637. tex->tmap.ref_object = (char*)getbytes( fp, sz );
  1638. break;
  1639. case ID_TOPC:
  1640. assert( tex != NULL );
  1641. tex->opacity.val = getF4( fp );
  1642. break;
  1643. case ID_TFP0:
  1644. assert( tex != NULL );
  1645. if ( tex->type == ID_IMAP )
  1646. tex->param.imap.wrapw.val = getF4( fp );
  1647. break;
  1648. case ID_TFP1:
  1649. assert( tex != NULL );
  1650. if ( tex->type == ID_IMAP )
  1651. tex->param.imap.wraph.val = getF4( fp );
  1652. break;
  1653. case ID_SHDR:
  1654. shdr = (lwPlugin*)Mem_ClearedAlloc( sizeof( lwPlugin ), TAG_MODEL );
  1655. if ( !shdr ) goto Fail;
  1656. shdr->name = (char*)getbytes( fp, sz );
  1657. lwListAdd( (void**)&surf->shader, shdr );
  1658. surf->nshaders++;
  1659. break;
  1660. case ID_SDAT:
  1661. assert( shdr != NULL );
  1662. shdr->data = getbytes( fp, sz );
  1663. break;
  1664. default:
  1665. break;
  1666. }
  1667. /* error while reading current subchunk? */
  1668. rlen = get_flen();
  1669. if ( rlen < 0 || rlen > sz ) goto Fail;
  1670. /* skip unread parts of the current subchunk */
  1671. if ( rlen < sz )
  1672. fp->Seek( sz - rlen, FS_SEEK_CUR );
  1673. /* end of the SURF chunk? */
  1674. if ( cksize <= fp->Tell() - pos )
  1675. break;
  1676. /* get the next subchunk header */
  1677. set_flen( 0 );
  1678. id = getU4( fp );
  1679. sz = getU2( fp );
  1680. if ( 6 != get_flen() ) goto Fail;
  1681. }
  1682. return surf;
  1683. Fail:
  1684. if ( surf ) lwFreeSurface( surf );
  1685. return NULL;
  1686. }
  1687. /*
  1688. ======================================================================
  1689. lwGetPolygons5()
  1690. Read polygon records from a POLS chunk in an LWOB file. The polygons
  1691. are added to the array in the lwPolygonList.
  1692. ====================================================================== */
  1693. int lwGetPolygons5( idFile *fp, int cksize, lwPolygonList *plist, int ptoffset )
  1694. {
  1695. lwPolygon *pp;
  1696. lwPolVert *pv;
  1697. unsigned char *buf, *bp;
  1698. int i, j, nv, nverts, npols;
  1699. if ( cksize == 0 ) return 1;
  1700. /* read the whole chunk */
  1701. set_flen( 0 );
  1702. buf = (unsigned char*)getbytes( fp, cksize );
  1703. if ( !buf ) goto Fail;
  1704. /* count the polygons and vertices */
  1705. nverts = 0;
  1706. npols = 0;
  1707. bp = buf;
  1708. while ( bp < buf + cksize ) {
  1709. nv = sgetU2( &bp );
  1710. nverts += nv;
  1711. npols++;
  1712. bp += 2 * nv;
  1713. i = sgetI2( &bp );
  1714. if ( i < 0 ) bp += 2; /* detail polygons */
  1715. }
  1716. if ( !lwAllocPolygons( plist, npols, nverts ))
  1717. goto Fail;
  1718. /* fill in the new polygons */
  1719. bp = buf;
  1720. pp = plist->pol + plist->offset;
  1721. pv = plist->pol[ 0 ].v + plist->voffset;
  1722. for ( i = 0; i < npols; i++ ) {
  1723. nv = sgetU2( &bp );
  1724. pp->nverts = nv;
  1725. pp->type = ID_FACE;
  1726. if ( !pp->v ) pp->v = pv;
  1727. for ( j = 0; j < nv; j++ )
  1728. pv[ j ].index = sgetU2( &bp ) + ptoffset;
  1729. j = sgetI2( &bp );
  1730. if ( j < 0 ) {
  1731. j = -j;
  1732. bp += 2;
  1733. }
  1734. j -= 1;
  1735. pp->surf = ( lwSurface * ) j;
  1736. pp++;
  1737. pv += nv;
  1738. }
  1739. Mem_Free( buf );
  1740. return 1;
  1741. Fail:
  1742. if ( buf ) Mem_Free( buf );
  1743. lwFreePolygons( plist );
  1744. return 0;
  1745. }
  1746. /*
  1747. ======================================================================
  1748. getLWObject5()
  1749. Returns the contents of an LWOB, given its filename, or NULL if the
  1750. file couldn't be loaded. On failure, failID and failpos can be used
  1751. to diagnose the cause.
  1752. 1. If the file isn't an LWOB, failpos will contain 12 and failID will
  1753. be unchanged.
  1754. 2. If an error occurs while reading an LWOB, failID will contain the
  1755. most recently read IFF chunk ID, and failpos will contain the
  1756. value returned by fp->Tell() at the time of the failure.
  1757. 3. If the file couldn't be opened, or an error occurs while reading
  1758. the first 12 bytes, both failID and failpos will be unchanged.
  1759. If you don't need this information, failID and failpos can be NULL.
  1760. ====================================================================== */
  1761. lwObject *lwGetObject5( const char *filename, unsigned int *failID, int *failpos )
  1762. {
  1763. idFile *fp = NULL;
  1764. lwObject *object;
  1765. lwLayer *layer;
  1766. lwNode *node;
  1767. int id, formsize, type, cksize;
  1768. /* open the file */
  1769. //fp = fopen( filename, "rb" );
  1770. //if ( !fp ) return NULL;
  1771. /* read the first 12 bytes */
  1772. fp = fileSystem->OpenFileRead( filename );
  1773. if ( !fp ) {
  1774. return NULL;
  1775. }
  1776. set_flen( 0 );
  1777. id = getU4( fp );
  1778. formsize = getU4( fp );
  1779. type = getU4( fp );
  1780. if ( 12 != get_flen() ) {
  1781. fileSystem->CloseFile( fp );
  1782. return NULL;
  1783. }
  1784. /* LWOB? */
  1785. if ( id != ID_FORM || type != ID_LWOB ) {
  1786. fileSystem->CloseFile( fp );
  1787. if ( failpos ) *failpos = 12;
  1788. return NULL;
  1789. }
  1790. /* allocate an object and a default layer */
  1791. object = (lwObject*)Mem_ClearedAlloc( sizeof( lwObject ), TAG_MODEL );
  1792. if ( !object ) goto Fail2;
  1793. layer = (lwLayer*)Mem_ClearedAlloc( sizeof( lwLayer ), TAG_MODEL );
  1794. if ( !layer ) goto Fail2;
  1795. object->layer = layer;
  1796. object->nlayers = 1;
  1797. /* get the first chunk header */
  1798. id = getU4( fp );
  1799. cksize = getU4( fp );
  1800. if ( 0 > get_flen() ) goto Fail2;
  1801. /* process chunks as they're encountered */
  1802. while ( 1 ) {
  1803. cksize += cksize & 1;
  1804. switch ( id )
  1805. {
  1806. case ID_PNTS:
  1807. if ( !lwGetPoints( fp, cksize, &layer->point ))
  1808. goto Fail2;
  1809. break;
  1810. case ID_POLS:
  1811. if ( !lwGetPolygons5( fp, cksize, &layer->polygon,
  1812. layer->point.offset ))
  1813. goto Fail2;
  1814. break;
  1815. case ID_SRFS:
  1816. if ( !lwGetTags( fp, cksize, &object->taglist ))
  1817. goto Fail2;
  1818. break;
  1819. case ID_SURF:
  1820. node = ( lwNode * ) lwGetSurface5( fp, cksize, object );
  1821. if ( !node ) goto Fail2;
  1822. lwListAdd( (void**)&object->surf, node );
  1823. object->nsurfs++;
  1824. break;
  1825. default:
  1826. fp->Seek( cksize, FS_SEEK_CUR );
  1827. break;
  1828. }
  1829. /* end of the file? */
  1830. if ( formsize <= fp->Tell() - 8 ) break;
  1831. /* get the next chunk header */
  1832. set_flen( 0 );
  1833. id = getU4( fp );
  1834. cksize = getU4( fp );
  1835. if ( 8 != get_flen() ) goto Fail2;
  1836. }
  1837. fileSystem->CloseFile( fp );
  1838. fp = NULL;
  1839. lwGetBoundingBox( &layer->point, layer->bbox );
  1840. lwGetPolyNormals( &layer->point, &layer->polygon );
  1841. if ( !lwGetPointPolygons( &layer->point, &layer->polygon )) goto Fail2;
  1842. if ( !lwResolvePolySurfaces( &layer->polygon, &object->taglist,
  1843. &object->surf, &object->nsurfs )) goto Fail2;
  1844. lwGetVertNormals( &layer->point, &layer->polygon );
  1845. return object;
  1846. Fail2:
  1847. if ( failID ) *failID = id;
  1848. if ( fp ) {
  1849. if ( failpos ) *failpos = fp->Tell();
  1850. fileSystem->CloseFile( fp );
  1851. }
  1852. lwFreeObject( object );
  1853. return NULL;
  1854. }
  1855. /*
  1856. ======================================================================
  1857. lwFreePoints()
  1858. Free the memory used by an lwPointList.
  1859. ====================================================================== */
  1860. void lwFreePoints( lwPointList *point )
  1861. {
  1862. int i;
  1863. if ( point ) {
  1864. if ( point->pt ) {
  1865. for ( i = 0; i < point->count; i++ ) {
  1866. if ( point->pt[ i ].pol ) Mem_Free( point->pt[ i ].pol );
  1867. if ( point->pt[ i ].vm ) Mem_Free( point->pt[ i ].vm );
  1868. }
  1869. Mem_Free( point->pt );
  1870. }
  1871. memset( point, 0, sizeof( lwPointList ));
  1872. }
  1873. }
  1874. /*
  1875. ======================================================================
  1876. lwFreePolygons()
  1877. Free the memory used by an lwPolygonList.
  1878. ====================================================================== */
  1879. void lwFreePolygons( lwPolygonList *plist )
  1880. {
  1881. int i, j;
  1882. if ( plist ) {
  1883. if ( plist->pol ) {
  1884. for ( i = 0; i < plist->count; i++ ) {
  1885. if ( plist->pol[ i ].v ) {
  1886. for ( j = 0; j < plist->pol[ i ].nverts; j++ )
  1887. if ( plist->pol[ i ].v[ j ].vm )
  1888. Mem_Free( plist->pol[ i ].v[ j ].vm );
  1889. }
  1890. }
  1891. if ( plist->pol[ 0 ].v )
  1892. Mem_Free( plist->pol[ 0 ].v );
  1893. Mem_Free( plist->pol );
  1894. }
  1895. memset( plist, 0, sizeof( lwPolygonList ));
  1896. }
  1897. }
  1898. /*
  1899. ======================================================================
  1900. lwGetPoints()
  1901. Read point records from a PNTS chunk in an LWO2 file. The points are
  1902. added to the array in the lwPointList.
  1903. ====================================================================== */
  1904. int lwGetPoints( idFile *fp, int cksize, lwPointList *point )
  1905. {
  1906. float *f;
  1907. int np, i, j;
  1908. if ( cksize == 1 ) return 1;
  1909. /* extend the point array to hold the new points */
  1910. np = cksize / 12;
  1911. point->offset = point->count;
  1912. point->count += np;
  1913. lwPoint *oldpt = point->pt;
  1914. point->pt = (lwPoint*)Mem_Alloc( point->count * sizeof( lwPoint ), TAG_MODEL );
  1915. if ( !point->pt ) return 0;
  1916. if ( oldpt ) {
  1917. memcpy( point->pt, oldpt, point->offset * sizeof( lwPoint ) );
  1918. Mem_Free( oldpt );
  1919. }
  1920. memset( &point->pt[ point->offset ], 0, np * sizeof( lwPoint ) );
  1921. /* read the whole chunk */
  1922. f = ( float * ) getbytes( fp, cksize );
  1923. if ( !f ) return 0;
  1924. BigRevBytes( f, 4, np * 3 );
  1925. /* assign position values */
  1926. for ( i = 0, j = 0; i < np; i++, j += 3 ) {
  1927. point->pt[ i ].pos[ 0 ] = f[ j ];
  1928. point->pt[ i ].pos[ 1 ] = f[ j + 1 ];
  1929. point->pt[ i ].pos[ 2 ] = f[ j + 2 ];
  1930. }
  1931. Mem_Free( f );
  1932. return 1;
  1933. }
  1934. /*
  1935. ======================================================================
  1936. lwGetBoundingBox()
  1937. Calculate the bounding box for a point list, but only if the bounding
  1938. box hasn't already been initialized.
  1939. ====================================================================== */
  1940. void lwGetBoundingBox( lwPointList *point, float bbox[] )
  1941. {
  1942. int i, j;
  1943. if ( point->count == 0 ) return;
  1944. for ( i = 0; i < 6; i++ )
  1945. if ( bbox[ i ] != 0.0f ) return;
  1946. bbox[ 0 ] = bbox[ 1 ] = bbox[ 2 ] = 1e20f;
  1947. bbox[ 3 ] = bbox[ 4 ] = bbox[ 5 ] = -1e20f;
  1948. for ( i = 0; i < point->count; i++ ) {
  1949. for ( j = 0; j < 3; j++ ) {
  1950. if ( bbox[ j ] > point->pt[ i ].pos[ j ] )
  1951. bbox[ j ] = point->pt[ i ].pos[ j ];
  1952. if ( bbox[ j + 3 ] < point->pt[ i ].pos[ j ] )
  1953. bbox[ j + 3 ] = point->pt[ i ].pos[ j ];
  1954. }
  1955. }
  1956. }
  1957. /*
  1958. ======================================================================
  1959. lwAllocPolygons()
  1960. Allocate or extend the polygon arrays to hold new records.
  1961. ====================================================================== */
  1962. int lwAllocPolygons( lwPolygonList *plist, int npols, int nverts )
  1963. {
  1964. int i;
  1965. plist->offset = plist->count;
  1966. plist->count += npols;
  1967. lwPolygon *oldpol = plist->pol;
  1968. plist->pol = (lwPolygon*)Mem_Alloc( plist->count * sizeof( lwPolygon ), TAG_MODEL );
  1969. if ( !plist->pol ) return 0;
  1970. if ( oldpol ) {
  1971. memcpy( plist->pol, oldpol, plist->offset * sizeof( lwPolygon ) );
  1972. Mem_Free( oldpol );
  1973. }
  1974. memset( plist->pol + plist->offset, 0, npols * sizeof( lwPolygon ) );
  1975. plist->voffset = plist->vcount;
  1976. plist->vcount += nverts;
  1977. lwPolVert *oldpolv = plist->pol[0].v;
  1978. plist->pol[0].v = (lwPolVert*)Mem_Alloc( plist->vcount * sizeof( lwPolVert ), TAG_MODEL );
  1979. if ( !plist->pol[ 0 ].v ) return 0;
  1980. if ( oldpolv ) {
  1981. memcpy( plist->pol[0].v, oldpolv, plist->voffset * sizeof( lwPolVert ) );
  1982. Mem_Free( oldpolv );
  1983. }
  1984. memset( plist->pol[ 0 ].v + plist->voffset, 0, nverts * sizeof( lwPolVert ) );
  1985. /* fix up the old vertex pointers */
  1986. for ( i = 1; i < plist->offset; i++ )
  1987. plist->pol[ i ].v = plist->pol[ i - 1 ].v + plist->pol[ i - 1 ].nverts;
  1988. return 1;
  1989. }
  1990. /*
  1991. ======================================================================
  1992. lwGetPolygons()
  1993. Read polygon records from a POLS chunk in an LWO2 file. The polygons
  1994. are added to the array in the lwPolygonList.
  1995. ====================================================================== */
  1996. int lwGetPolygons( idFile *fp, int cksize, lwPolygonList *plist, int ptoffset )
  1997. {
  1998. lwPolygon *pp;
  1999. lwPolVert *pv;
  2000. unsigned char *buf, *bp;
  2001. int i, j, flags, nv, nverts, npols;
  2002. unsigned int type;
  2003. if ( cksize == 0 ) return 1;
  2004. /* read the whole chunk */
  2005. set_flen( 0 );
  2006. type = getU4( fp );
  2007. buf = (unsigned char*)getbytes( fp, cksize - 4 );
  2008. if ( cksize != get_flen() ) goto Fail;
  2009. /* count the polygons and vertices */
  2010. nverts = 0;
  2011. npols = 0;
  2012. bp = buf;
  2013. while ( bp < buf + cksize - 4 ) {
  2014. nv = sgetU2( &bp );
  2015. nv &= 0x03FF;
  2016. nverts += nv;
  2017. npols++;
  2018. for ( i = 0; i < nv; i++ )
  2019. j = sgetVX( &bp );
  2020. }
  2021. if ( !lwAllocPolygons( plist, npols, nverts ))
  2022. goto Fail;
  2023. /* fill in the new polygons */
  2024. bp = buf;
  2025. pp = plist->pol + plist->offset;
  2026. pv = plist->pol[ 0 ].v + plist->voffset;
  2027. for ( i = 0; i < npols; i++ ) {
  2028. nv = sgetU2( &bp );
  2029. flags = nv & 0xFC00;
  2030. nv &= 0x03FF;
  2031. pp->nverts = nv;
  2032. pp->flags = flags;
  2033. pp->type = type;
  2034. if ( !pp->v ) pp->v = pv;
  2035. for ( j = 0; j < nv; j++ )
  2036. pp->v[ j ].index = sgetVX( &bp ) + ptoffset;
  2037. pp++;
  2038. pv += nv;
  2039. }
  2040. Mem_Free( buf );
  2041. return 1;
  2042. Fail:
  2043. if ( buf ) Mem_Free( buf );
  2044. lwFreePolygons( plist );
  2045. return 0;
  2046. }
  2047. /*
  2048. ======================================================================
  2049. lwGetPolyNormals()
  2050. Calculate the polygon normals. By convention, LW's polygon normals
  2051. are found as the cross product of the first and last edges. It's
  2052. undefined for one- and two-point polygons.
  2053. ====================================================================== */
  2054. void lwGetPolyNormals( lwPointList *point, lwPolygonList *polygon )
  2055. {
  2056. int i, j;
  2057. float p1[ 3 ], p2[ 3 ], pn[ 3 ], v1[ 3 ], v2[ 3 ];
  2058. for ( i = 0; i < polygon->count; i++ ) {
  2059. if ( polygon->pol[ i ].nverts < 3 ) continue;
  2060. for ( j = 0; j < 3; j++ ) {
  2061. // FIXME: track down why indexes are way out of range
  2062. p1[ j ] = point->pt[ polygon->pol[ i ].v[ 0 ].index ].pos[ j ];
  2063. p2[ j ] = point->pt[ polygon->pol[ i ].v[ 1 ].index ].pos[ j ];
  2064. pn[ j ] = point->pt[ polygon->pol[ i ].v[ polygon->pol[ i ].nverts - 1 ].index ].pos[ j ];
  2065. }
  2066. for ( j = 0; j < 3; j++ ) {
  2067. v1[ j ] = p2[ j ] - p1[ j ];
  2068. v2[ j ] = pn[ j ] - p1[ j ];
  2069. }
  2070. cross( v1, v2, polygon->pol[ i ].norm );
  2071. normalize( polygon->pol[ i ].norm );
  2072. }
  2073. }
  2074. /*
  2075. ======================================================================
  2076. lwGetPointPolygons()
  2077. For each point, fill in the indexes of the polygons that share the
  2078. point. Returns 0 if any of the memory allocations fail, otherwise
  2079. returns 1.
  2080. ====================================================================== */
  2081. int lwGetPointPolygons( lwPointList *point, lwPolygonList *polygon )
  2082. {
  2083. int i, j, k;
  2084. /* count the number of polygons per point */
  2085. for ( i = 0; i < polygon->count; i++ )
  2086. for ( j = 0; j < polygon->pol[ i ].nverts; j++ )
  2087. ++point->pt[ polygon->pol[ i ].v[ j ].index ].npols;
  2088. /* alloc per-point polygon arrays */
  2089. for ( i = 0; i < point->count; i++ ) {
  2090. if ( point->pt[ i ].npols == 0 ) continue;
  2091. point->pt[ i ].pol = (int*)Mem_ClearedAlloc( point->pt[ i ].npols * sizeof( int ), TAG_MODEL );
  2092. if ( !point->pt[ i ].pol ) return 0;
  2093. point->pt[ i ].npols = 0;
  2094. }
  2095. /* fill in polygon array for each point */
  2096. for ( i = 0; i < polygon->count; i++ ) {
  2097. for ( j = 0; j < polygon->pol[ i ].nverts; j++ ) {
  2098. k = polygon->pol[ i ].v[ j ].index;
  2099. point->pt[ k ].pol[ point->pt[ k ].npols ] = i;
  2100. ++point->pt[ k ].npols;
  2101. }
  2102. }
  2103. return 1;
  2104. }
  2105. /*
  2106. ======================================================================
  2107. lwResolvePolySurfaces()
  2108. Convert tag indexes into actual lwSurface pointers. If any polygons
  2109. point to tags for which no corresponding surface can be found, a
  2110. default surface is created.
  2111. ====================================================================== */
  2112. int lwResolvePolySurfaces( lwPolygonList *polygon, lwTagList *tlist,
  2113. lwSurface **surf, int *nsurfs )
  2114. {
  2115. lwSurface **s, *st;
  2116. int i, index;
  2117. if ( tlist->count == 0 ) return 1;
  2118. s = (lwSurface**)Mem_ClearedAlloc( tlist->count * sizeof( lwSurface * ), TAG_MODEL );
  2119. if ( !s ) return 0;
  2120. for ( i = 0; i < tlist->count; i++ ) {
  2121. st = *surf;
  2122. while ( st ) {
  2123. if ( !strcmp( st->name, tlist->tag[ i ] )) {
  2124. s[ i ] = st;
  2125. break;
  2126. }
  2127. st = st->next;
  2128. }
  2129. }
  2130. for ( i = 0; i < polygon->count; i++ ) {
  2131. index = ( int ) polygon->pol[ i ].surf;
  2132. if ( index < 0 || index > tlist->count ) return 0;
  2133. if ( !s[ index ] ) {
  2134. s[ index ] = lwDefaultSurface();
  2135. if ( !s[ index ] ) return 0;
  2136. s[ index ]->name = (char*)Mem_ClearedAlloc( strlen( tlist->tag[ index ] ) + 1, TAG_MODEL );
  2137. if ( !s[ index ]->name ) return 0;
  2138. strcpy( s[ index ]->name, tlist->tag[ index ] );
  2139. lwListAdd( (void**)surf, s[ index ] );
  2140. *nsurfs = *nsurfs + 1;
  2141. }
  2142. polygon->pol[ i ].surf = s[ index ];
  2143. }
  2144. Mem_Free( s );
  2145. return 1;
  2146. }
  2147. /*
  2148. ======================================================================
  2149. lwGetVertNormals()
  2150. Calculate the vertex normals. For each polygon vertex, sum the
  2151. normals of the polygons that share the point. If the normals of the
  2152. current and adjacent polygons form an angle greater than the max
  2153. smoothing angle for the current polygon's surface, the normal of the
  2154. adjacent polygon is excluded from the sum. It's also excluded if the
  2155. polygons aren't in the same smoothing group.
  2156. Assumes that lwGetPointPolygons(), lwGetPolyNormals() and
  2157. lwResolvePolySurfaces() have already been called.
  2158. ====================================================================== */
  2159. void lwGetVertNormals( lwPointList *point, lwPolygonList *polygon )
  2160. {
  2161. int j, k, n, g, h, p;
  2162. float a;
  2163. for ( j = 0; j < polygon->count; j++ ) {
  2164. for ( n = 0; n < polygon->pol[ j ].nverts; n++ ) {
  2165. for ( k = 0; k < 3; k++ )
  2166. polygon->pol[ j ].v[ n ].norm[ k ] = polygon->pol[ j ].norm[ k ];
  2167. if ( polygon->pol[ j ].surf->smooth <= 0 ) continue;
  2168. p = polygon->pol[ j ].v[ n ].index;
  2169. for ( g = 0; g < point->pt[ p ].npols; g++ ) {
  2170. h = point->pt[ p ].pol[ g ];
  2171. if ( h == j ) continue;
  2172. if ( polygon->pol[ j ].smoothgrp != polygon->pol[ h ].smoothgrp )
  2173. continue;
  2174. a = vecangle( polygon->pol[ j ].norm, polygon->pol[ h ].norm );
  2175. if ( a > polygon->pol[ j ].surf->smooth ) continue;
  2176. for ( k = 0; k < 3; k++ )
  2177. polygon->pol[ j ].v[ n ].norm[ k ] += polygon->pol[ h ].norm[ k ];
  2178. }
  2179. normalize( polygon->pol[ j ].v[ n ].norm );
  2180. }
  2181. }
  2182. }
  2183. /*
  2184. ======================================================================
  2185. lwFreeTags()
  2186. Free memory used by an lwTagList.
  2187. ====================================================================== */
  2188. void lwFreeTags( lwTagList *tlist )
  2189. {
  2190. int i;
  2191. if ( tlist ) {
  2192. if ( tlist->tag ) {
  2193. for ( i = 0; i < tlist->count; i++ )
  2194. if ( tlist->tag[ i ] ) {
  2195. Mem_Free( tlist->tag[ i ] );
  2196. }
  2197. Mem_Free( tlist->tag );
  2198. }
  2199. memset( tlist, 0, sizeof( lwTagList ));
  2200. }
  2201. }
  2202. /*
  2203. ======================================================================
  2204. lwGetTags()
  2205. Read tag strings from a TAGS chunk in an LWO2 file. The tags are
  2206. added to the lwTagList array.
  2207. ====================================================================== */
  2208. int lwGetTags( idFile *fp, int cksize, lwTagList *tlist )
  2209. {
  2210. char *buf, *bp;
  2211. int i, len, ntags;
  2212. if ( cksize == 0 ) return 1;
  2213. /* read the whole chunk */
  2214. set_flen( 0 );
  2215. buf = (char*)getbytes( fp, cksize );
  2216. if ( !buf ) return 0;
  2217. /* count the strings */
  2218. ntags = 0;
  2219. bp = buf;
  2220. while ( bp < buf + cksize ) {
  2221. len = strlen( bp ) + 1;
  2222. len += len & 1;
  2223. bp += len;
  2224. ++ntags;
  2225. }
  2226. /* expand the string array to hold the new tags */
  2227. tlist->offset = tlist->count;
  2228. tlist->count += ntags;
  2229. char **oldtag = tlist->tag;
  2230. tlist->tag = (char**)Mem_Alloc( tlist->count * sizeof( char * ), TAG_MODEL );
  2231. if ( !tlist->tag ) goto Fail;
  2232. if ( oldtag ) {
  2233. memcpy( tlist->tag, oldtag, tlist->offset * sizeof( char * ) );
  2234. Mem_Free( oldtag );
  2235. }
  2236. memset( &tlist->tag[ tlist->offset ], 0, ntags * sizeof( char * ) );
  2237. /* copy the new tags to the tag array */
  2238. bp = buf;
  2239. for ( i = 0; i < ntags; i++ )
  2240. tlist->tag[ i + tlist->offset ] = sgetS0( (unsigned char**)&bp );
  2241. Mem_Free( buf );
  2242. return 1;
  2243. Fail:
  2244. if ( buf ) Mem_Free( buf );
  2245. return 0;
  2246. }
  2247. /*
  2248. ======================================================================
  2249. lwGetPolygonTags()
  2250. Read polygon tags from a PTAG chunk in an LWO2 file.
  2251. ====================================================================== */
  2252. int lwGetPolygonTags( idFile *fp, int cksize, lwTagList *tlist, lwPolygonList *plist )
  2253. {
  2254. unsigned int type;
  2255. int rlen = 0, i, j;
  2256. set_flen( 0 );
  2257. type = getU4( fp );
  2258. rlen = get_flen();
  2259. if ( rlen < 0 ) return 0;
  2260. if ( type != ID_SURF && type != ID_PART && type != ID_SMGP ) {
  2261. fp->Seek( cksize - 4, FS_SEEK_CUR );
  2262. return 1;
  2263. }
  2264. while ( rlen < cksize ) {
  2265. i = getVX( fp ) + plist->offset;
  2266. j = getVX( fp ) + tlist->offset;
  2267. rlen = get_flen();
  2268. if ( rlen < 0 || rlen > cksize ) return 0;
  2269. switch ( type ) {
  2270. case ID_SURF: plist->pol[ i ].surf = ( lwSurface * ) j; break;
  2271. case ID_PART: plist->pol[ i ].part = j; break;
  2272. case ID_SMGP: plist->pol[ i ].smoothgrp = j; break;
  2273. }
  2274. }
  2275. return 1;
  2276. }
  2277. /*
  2278. ======================================================================
  2279. lwFreePlugin()
  2280. Free the memory used by an lwPlugin.
  2281. ====================================================================== */
  2282. void lwFreePlugin( lwPlugin *p )
  2283. {
  2284. if ( p ) {
  2285. if ( p->ord ) Mem_Free( p->ord );
  2286. if ( p->name ) Mem_Free( p->name );
  2287. if ( p->data ) Mem_Free( p->data );
  2288. Mem_Free( p );
  2289. }
  2290. }
  2291. /*
  2292. ======================================================================
  2293. lwFreeTexture()
  2294. Free the memory used by an lwTexture.
  2295. ====================================================================== */
  2296. void lwFreeTexture( lwTexture *t )
  2297. {
  2298. if ( t ) {
  2299. if ( t->ord ) Mem_Free( t->ord );
  2300. switch ( t->type ) {
  2301. case ID_IMAP:
  2302. if ( t->param.imap.vmap_name ) Mem_Free( t->param.imap.vmap_name );
  2303. break;
  2304. case ID_PROC:
  2305. if ( t->param.proc.name ) Mem_Free( t->param.proc.name );
  2306. if ( t->param.proc.data ) Mem_Free( t->param.proc.data );
  2307. break;
  2308. case ID_GRAD:
  2309. if ( t->param.grad.key ) Mem_Free( t->param.grad.key );
  2310. if ( t->param.grad.ikey ) Mem_Free( t->param.grad.ikey );
  2311. break;
  2312. }
  2313. if ( t->tmap.ref_object ) Mem_Free( t->tmap.ref_object );
  2314. Mem_Free( t );
  2315. }
  2316. }
  2317. /*
  2318. ======================================================================
  2319. lwFreeSurface()
  2320. Free the memory used by an lwSurface.
  2321. ====================================================================== */
  2322. void lwFreeSurface( lwSurface *surf )
  2323. {
  2324. if ( surf ) {
  2325. if ( surf->name ) Mem_Free( surf->name );
  2326. if ( surf->srcname ) Mem_Free( surf->srcname );
  2327. lwListFree( surf->shader, (void (__cdecl *)(void *))lwFreePlugin );
  2328. lwListFree( surf->color.tex, (void (__cdecl *)(void *))lwFreeTexture );
  2329. lwListFree( surf->luminosity.tex, (void (__cdecl *)(void *))lwFreeTexture );
  2330. lwListFree( surf->diffuse.tex, (void (__cdecl *)(void *))lwFreeTexture );
  2331. lwListFree( surf->specularity.tex, (void (__cdecl *)(void *))lwFreeTexture );
  2332. lwListFree( surf->glossiness.tex, (void (__cdecl *)(void *))lwFreeTexture );
  2333. lwListFree( surf->reflection.val.tex, (void (__cdecl *)(void *))lwFreeTexture );
  2334. lwListFree( surf->transparency.val.tex, (void (__cdecl *)(void *))lwFreeTexture );
  2335. lwListFree( surf->eta.tex, (void (__cdecl *)(void *))lwFreeTexture );
  2336. lwListFree( surf->translucency.tex, (void (__cdecl *)(void *))lwFreeTexture );
  2337. lwListFree( surf->bump.tex, (void (__cdecl *)(void *))lwFreeTexture );
  2338. Mem_Free( surf );
  2339. }
  2340. }
  2341. /*
  2342. ======================================================================
  2343. lwGetTHeader()
  2344. Read a texture map header from a SURF.BLOK in an LWO2 file. This is
  2345. the first subchunk in a BLOK, and its contents are common to all three
  2346. texture types.
  2347. ====================================================================== */
  2348. int lwGetTHeader( idFile *fp, int hsz, lwTexture *tex )
  2349. {
  2350. unsigned int id;
  2351. unsigned short sz;
  2352. int pos, rlen;
  2353. /* remember where we started */
  2354. set_flen( 0 );
  2355. pos = fp->Tell();
  2356. /* ordinal string */
  2357. tex->ord = getS0( fp );
  2358. /* first subchunk header */
  2359. id = getU4( fp );
  2360. sz = getU2( fp );
  2361. if ( 0 > get_flen() ) return 0;
  2362. /* process subchunks as they're encountered */
  2363. while ( 1 ) {
  2364. sz += sz & 1;
  2365. set_flen( 0 );
  2366. switch ( id ) {
  2367. case ID_CHAN:
  2368. tex->chan = getU4( fp );
  2369. break;
  2370. case ID_OPAC:
  2371. tex->opac_type = getU2( fp );
  2372. tex->opacity.val = getF4( fp );
  2373. tex->opacity.eindex = getVX( fp );
  2374. break;
  2375. case ID_ENAB:
  2376. tex->enabled = getU2( fp );
  2377. break;
  2378. case ID_NEGA:
  2379. tex->negative = getU2( fp );
  2380. break;
  2381. case ID_AXIS:
  2382. tex->axis = getU2( fp );
  2383. break;
  2384. default:
  2385. break;
  2386. }
  2387. /* error while reading current subchunk? */
  2388. rlen = get_flen();
  2389. if ( rlen < 0 || rlen > sz ) return 0;
  2390. /* skip unread parts of the current subchunk */
  2391. if ( rlen < sz )
  2392. fp->Seek( sz - rlen, FS_SEEK_CUR );
  2393. /* end of the texture header subchunk? */
  2394. if ( hsz <= fp->Tell() - pos )
  2395. break;
  2396. /* get the next subchunk header */
  2397. set_flen( 0 );
  2398. id = getU4( fp );
  2399. sz = getU2( fp );
  2400. if ( 6 != get_flen() ) return 0;
  2401. }
  2402. set_flen( fp->Tell() - pos );
  2403. return 1;
  2404. }
  2405. /*
  2406. ======================================================================
  2407. lwGetTMap()
  2408. Read a texture map from a SURF.BLOK in an LWO2 file. The TMAP
  2409. defines the mapping from texture to world or object coordinates.
  2410. ====================================================================== */
  2411. int lwGetTMap( idFile *fp, int tmapsz, lwTMap *tmap )
  2412. {
  2413. unsigned int id;
  2414. unsigned short sz;
  2415. int rlen, pos, i;
  2416. pos = fp->Tell();
  2417. id = getU4( fp );
  2418. sz = getU2( fp );
  2419. if ( 0 > get_flen() ) return 0;
  2420. while ( 1 ) {
  2421. sz += sz & 1;
  2422. set_flen( 0 );
  2423. switch ( id ) {
  2424. case ID_SIZE:
  2425. for ( i = 0; i < 3; i++ )
  2426. tmap->size.val[ i ] = getF4( fp );
  2427. tmap->size.eindex = getVX( fp );
  2428. break;
  2429. case ID_CNTR:
  2430. for ( i = 0; i < 3; i++ )
  2431. tmap->center.val[ i ] = getF4( fp );
  2432. tmap->center.eindex = getVX( fp );
  2433. break;
  2434. case ID_ROTA:
  2435. for ( i = 0; i < 3; i++ )
  2436. tmap->rotate.val[ i ] = getF4( fp );
  2437. tmap->rotate.eindex = getVX( fp );
  2438. break;
  2439. case ID_FALL:
  2440. tmap->fall_type = getU2( fp );
  2441. for ( i = 0; i < 3; i++ )
  2442. tmap->falloff.val[ i ] = getF4( fp );
  2443. tmap->falloff.eindex = getVX( fp );
  2444. break;
  2445. case ID_OREF:
  2446. tmap->ref_object = getS0( fp );
  2447. break;
  2448. case ID_CSYS:
  2449. tmap->coord_sys = getU2( fp );
  2450. break;
  2451. default:
  2452. break;
  2453. }
  2454. /* error while reading the current subchunk? */
  2455. rlen = get_flen();
  2456. if ( rlen < 0 || rlen > sz ) return 0;
  2457. /* skip unread parts of the current subchunk */
  2458. if ( rlen < sz )
  2459. fp->Seek( sz - rlen, FS_SEEK_CUR );
  2460. /* end of the TMAP subchunk? */
  2461. if ( tmapsz <= fp->Tell() - pos )
  2462. break;
  2463. /* get the next subchunk header */
  2464. set_flen( 0 );
  2465. id = getU4( fp );
  2466. sz = getU2( fp );
  2467. if ( 6 != get_flen() ) return 0;
  2468. }
  2469. set_flen( fp->Tell() - pos );
  2470. return 1;
  2471. }
  2472. /*
  2473. ======================================================================
  2474. lwGetImageMap()
  2475. Read an lwImageMap from a SURF.BLOK in an LWO2 file.
  2476. ====================================================================== */
  2477. int lwGetImageMap( idFile *fp, int rsz, lwTexture *tex )
  2478. {
  2479. unsigned int id;
  2480. unsigned short sz;
  2481. int rlen, pos;
  2482. pos = fp->Tell();
  2483. id = getU4( fp );
  2484. sz = getU2( fp );
  2485. if ( 0 > get_flen() ) return 0;
  2486. while ( 1 ) {
  2487. sz += sz & 1;
  2488. set_flen( 0 );
  2489. switch ( id ) {
  2490. case ID_TMAP:
  2491. if ( !lwGetTMap( fp, sz, &tex->tmap )) return 0;
  2492. break;
  2493. case ID_PROJ:
  2494. tex->param.imap.projection = getU2( fp );
  2495. break;
  2496. case ID_VMAP:
  2497. tex->param.imap.vmap_name = getS0( fp );
  2498. break;
  2499. case ID_AXIS:
  2500. tex->param.imap.axis = getU2( fp );
  2501. break;
  2502. case ID_IMAG:
  2503. tex->param.imap.cindex = getVX( fp );
  2504. break;
  2505. case ID_WRAP:
  2506. tex->param.imap.wrapw_type = getU2( fp );
  2507. tex->param.imap.wraph_type = getU2( fp );
  2508. break;
  2509. case ID_WRPW:
  2510. tex->param.imap.wrapw.val = getF4( fp );
  2511. tex->param.imap.wrapw.eindex = getVX( fp );
  2512. break;
  2513. case ID_WRPH:
  2514. tex->param.imap.wraph.val = getF4( fp );
  2515. tex->param.imap.wraph.eindex = getVX( fp );
  2516. break;
  2517. case ID_AAST:
  2518. tex->param.imap.aas_flags = getU2( fp );
  2519. tex->param.imap.aa_strength = getF4( fp );
  2520. break;
  2521. case ID_PIXB:
  2522. tex->param.imap.pblend = getU2( fp );
  2523. break;
  2524. case ID_STCK:
  2525. tex->param.imap.stck.val = getF4( fp );
  2526. tex->param.imap.stck.eindex = getVX( fp );
  2527. break;
  2528. case ID_TAMP:
  2529. tex->param.imap.amplitude.val = getF4( fp );
  2530. tex->param.imap.amplitude.eindex = getVX( fp );
  2531. break;
  2532. default:
  2533. break;
  2534. }
  2535. /* error while reading the current subchunk? */
  2536. rlen = get_flen();
  2537. if ( rlen < 0 || rlen > sz ) return 0;
  2538. /* skip unread parts of the current subchunk */
  2539. if ( rlen < sz )
  2540. fp->Seek( sz - rlen, FS_SEEK_CUR );
  2541. /* end of the image map? */
  2542. if ( rsz <= fp->Tell() - pos )
  2543. break;
  2544. /* get the next subchunk header */
  2545. set_flen( 0 );
  2546. id = getU4( fp );
  2547. sz = getU2( fp );
  2548. if ( 6 != get_flen() ) return 0;
  2549. }
  2550. set_flen( fp->Tell() - pos );
  2551. return 1;
  2552. }
  2553. /*
  2554. ======================================================================
  2555. lwGetProcedural()
  2556. Read an lwProcedural from a SURF.BLOK in an LWO2 file.
  2557. ====================================================================== */
  2558. int lwGetProcedural( idFile *fp, int rsz, lwTexture *tex )
  2559. {
  2560. unsigned int id;
  2561. unsigned short sz;
  2562. int rlen, pos;
  2563. pos = fp->Tell();
  2564. id = getU4( fp );
  2565. sz = getU2( fp );
  2566. if ( 0 > get_flen() ) return 0;
  2567. while ( 1 ) {
  2568. sz += sz & 1;
  2569. set_flen( 0 );
  2570. switch ( id ) {
  2571. case ID_TMAP:
  2572. if ( !lwGetTMap( fp, sz, &tex->tmap )) return 0;
  2573. break;
  2574. case ID_AXIS:
  2575. tex->param.proc.axis = getU2( fp );
  2576. break;
  2577. case ID_VALU:
  2578. tex->param.proc.value[ 0 ] = getF4( fp );
  2579. if ( sz >= 8 ) tex->param.proc.value[ 1 ] = getF4( fp );
  2580. if ( sz >= 12 ) tex->param.proc.value[ 2 ] = getF4( fp );
  2581. break;
  2582. case ID_FUNC:
  2583. tex->param.proc.name = getS0( fp );
  2584. rlen = get_flen();
  2585. tex->param.proc.data = getbytes( fp, sz - rlen );
  2586. break;
  2587. default:
  2588. break;
  2589. }
  2590. /* error while reading the current subchunk? */
  2591. rlen = get_flen();
  2592. if ( rlen < 0 || rlen > sz ) return 0;
  2593. /* skip unread parts of the current subchunk */
  2594. if ( rlen < sz )
  2595. fp->Seek( sz - rlen, FS_SEEK_CUR );
  2596. /* end of the procedural block? */
  2597. if ( rsz <= fp->Tell() - pos )
  2598. break;
  2599. /* get the next subchunk header */
  2600. set_flen( 0 );
  2601. id = getU4( fp );
  2602. sz = getU2( fp );
  2603. if ( 6 != get_flen() ) return 0;
  2604. }
  2605. set_flen( fp->Tell() - pos );
  2606. return 1;
  2607. }
  2608. /*
  2609. ======================================================================
  2610. lwGetGradient()
  2611. Read an lwGradient from a SURF.BLOK in an LWO2 file.
  2612. ====================================================================== */
  2613. int lwGetGradient( idFile *fp, int rsz, lwTexture *tex )
  2614. {
  2615. unsigned int id;
  2616. unsigned short sz;
  2617. int rlen, pos, i, j, nkeys;
  2618. pos = fp->Tell();
  2619. id = getU4( fp );
  2620. sz = getU2( fp );
  2621. if ( 0 > get_flen() ) return 0;
  2622. while ( 1 ) {
  2623. sz += sz & 1;
  2624. set_flen( 0 );
  2625. switch ( id ) {
  2626. case ID_TMAP:
  2627. if ( !lwGetTMap( fp, sz, &tex->tmap )) return 0;
  2628. break;
  2629. case ID_PNAM:
  2630. tex->param.grad.paramname = getS0( fp );
  2631. break;
  2632. case ID_INAM:
  2633. tex->param.grad.itemname = getS0( fp );
  2634. break;
  2635. case ID_GRST:
  2636. tex->param.grad.start = getF4( fp );
  2637. break;
  2638. case ID_GREN:
  2639. tex->param.grad.end = getF4( fp );
  2640. break;
  2641. case ID_GRPT:
  2642. tex->param.grad.repeat = getU2( fp );
  2643. break;
  2644. case ID_FKEY:
  2645. nkeys = sz / sizeof( lwGradKey );
  2646. tex->param.grad.key = (lwGradKey*)Mem_ClearedAlloc( nkeys * sizeof( lwGradKey ), TAG_MODEL );
  2647. if ( !tex->param.grad.key ) return 0;
  2648. for ( i = 0; i < nkeys; i++ ) {
  2649. tex->param.grad.key[ i ].value = getF4( fp );
  2650. for ( j = 0; j < 4; j++ )
  2651. tex->param.grad.key[ i ].rgba[ j ] = getF4( fp );
  2652. }
  2653. break;
  2654. case ID_IKEY:
  2655. nkeys = sz / 2;
  2656. tex->param.grad.ikey = (short*)Mem_ClearedAlloc( nkeys * sizeof( short ), TAG_MODEL );
  2657. if ( !tex->param.grad.ikey ) return 0;
  2658. for ( i = 0; i < nkeys; i++ )
  2659. tex->param.grad.ikey[ i ] = getU2( fp );
  2660. break;
  2661. default:
  2662. break;
  2663. }
  2664. /* error while reading the current subchunk? */
  2665. rlen = get_flen();
  2666. if ( rlen < 0 || rlen > sz ) return 0;
  2667. /* skip unread parts of the current subchunk */
  2668. if ( rlen < sz )
  2669. fp->Seek( sz - rlen, FS_SEEK_CUR );
  2670. /* end of the gradient? */
  2671. if ( rsz <= fp->Tell() - pos )
  2672. break;
  2673. /* get the next subchunk header */
  2674. set_flen( 0 );
  2675. id = getU4( fp );
  2676. sz = getU2( fp );
  2677. if ( 6 != get_flen() ) return 0;
  2678. }
  2679. set_flen( fp->Tell() - pos );
  2680. return 1;
  2681. }
  2682. /*
  2683. ======================================================================
  2684. lwGetTexture()
  2685. Read an lwTexture from a SURF.BLOK in an LWO2 file.
  2686. ====================================================================== */
  2687. lwTexture *lwGetTexture( idFile *fp, int bloksz, unsigned int type )
  2688. {
  2689. lwTexture *tex;
  2690. unsigned short sz;
  2691. int ok;
  2692. tex = (lwTexture*)Mem_ClearedAlloc( sizeof( lwTexture ), TAG_MODEL );
  2693. if ( !tex ) return NULL;
  2694. tex->type = type;
  2695. tex->tmap.size.val[ 0 ] =
  2696. tex->tmap.size.val[ 1 ] =
  2697. tex->tmap.size.val[ 2 ] = 1.0f;
  2698. tex->opacity.val = 1.0f;
  2699. tex->enabled = 1;
  2700. sz = getU2( fp );
  2701. if ( !lwGetTHeader( fp, sz, tex )) {
  2702. Mem_Free( tex );
  2703. return NULL;
  2704. }
  2705. sz = bloksz - sz - 6;
  2706. switch ( type ) {
  2707. case ID_IMAP: ok = lwGetImageMap( fp, sz, tex ); break;
  2708. case ID_PROC: ok = lwGetProcedural( fp, sz, tex ); break;
  2709. case ID_GRAD: ok = lwGetGradient( fp, sz, tex ); break;
  2710. default:
  2711. ok = !fp->Seek( sz, FS_SEEK_CUR );
  2712. }
  2713. if ( !ok ) {
  2714. lwFreeTexture( tex );
  2715. return NULL;
  2716. }
  2717. set_flen( bloksz );
  2718. return tex;
  2719. }
  2720. /*
  2721. ======================================================================
  2722. lwGetShader()
  2723. Read a shader record from a SURF.BLOK in an LWO2 file.
  2724. ====================================================================== */
  2725. lwPlugin *lwGetShader( idFile *fp, int bloksz )
  2726. {
  2727. lwPlugin *shdr;
  2728. unsigned int id;
  2729. unsigned short sz;
  2730. int hsz, rlen, pos;
  2731. shdr = (lwPlugin*)Mem_ClearedAlloc( sizeof( lwPlugin ), TAG_MODEL );
  2732. if ( !shdr ) return NULL;
  2733. pos = fp->Tell();
  2734. set_flen( 0 );
  2735. hsz = getU2( fp );
  2736. shdr->ord = getS0( fp );
  2737. id = getU4( fp );
  2738. sz = getU2( fp );
  2739. if ( 0 > get_flen() ) goto Fail;
  2740. while ( hsz > 0 ) {
  2741. sz += sz & 1;
  2742. hsz -= sz;
  2743. if ( id == ID_ENAB ) {
  2744. shdr->flags = getU2( fp );
  2745. break;
  2746. }
  2747. else {
  2748. fp->Seek( sz, FS_SEEK_CUR );
  2749. id = getU4( fp );
  2750. sz = getU2( fp );
  2751. }
  2752. }
  2753. id = getU4( fp );
  2754. sz = getU2( fp );
  2755. if ( 0 > get_flen() ) goto Fail;
  2756. while ( 1 ) {
  2757. sz += sz & 1;
  2758. set_flen( 0 );
  2759. switch ( id ) {
  2760. case ID_FUNC:
  2761. shdr->name = getS0( fp );
  2762. rlen = get_flen();
  2763. shdr->data = getbytes( fp, sz - rlen );
  2764. break;
  2765. default:
  2766. break;
  2767. }
  2768. /* error while reading the current subchunk? */
  2769. rlen = get_flen();
  2770. if ( rlen < 0 || rlen > sz ) goto Fail;
  2771. /* skip unread parts of the current subchunk */
  2772. if ( rlen < sz )
  2773. fp->Seek( sz - rlen, FS_SEEK_CUR );
  2774. /* end of the shader block? */
  2775. if ( bloksz <= fp->Tell() - pos )
  2776. break;
  2777. /* get the next subchunk header */
  2778. set_flen( 0 );
  2779. id = getU4( fp );
  2780. sz = getU2( fp );
  2781. if ( 6 != get_flen() ) goto Fail;
  2782. }
  2783. set_flen( fp->Tell() - pos );
  2784. return shdr;
  2785. Fail:
  2786. lwFreePlugin( shdr );
  2787. return NULL;
  2788. }
  2789. /*
  2790. ======================================================================
  2791. compare_textures()
  2792. compare_shaders()
  2793. Callbacks for the lwListInsert() function, which is called to add
  2794. textures to surface channels and shaders to surfaces.
  2795. ====================================================================== */
  2796. static int compare_textures( lwTexture *a, lwTexture *b )
  2797. {
  2798. return strcmp( a->ord, b->ord );
  2799. }
  2800. static int compare_shaders( lwPlugin *a, lwPlugin *b )
  2801. {
  2802. return strcmp( a->ord, b->ord );
  2803. }
  2804. /*
  2805. ======================================================================
  2806. add_texture()
  2807. Finds the surface channel (lwTParam or lwCParam) to which a texture is
  2808. applied, then calls lwListInsert().
  2809. ====================================================================== */
  2810. static int add_texture( lwSurface *surf, lwTexture *tex )
  2811. {
  2812. lwTexture **list;
  2813. switch ( tex->chan ) {
  2814. case ID_COLR: list = &surf->color.tex; break;
  2815. case ID_LUMI: list = &surf->luminosity.tex; break;
  2816. case ID_DIFF: list = &surf->diffuse.tex; break;
  2817. case ID_SPEC: list = &surf->specularity.tex; break;
  2818. case ID_GLOS: list = &surf->glossiness.tex; break;
  2819. case ID_REFL: list = &surf->reflection.val.tex; break;
  2820. case ID_TRAN: list = &surf->transparency.val.tex; break;
  2821. case ID_RIND: list = &surf->eta.tex; break;
  2822. case ID_TRNL: list = &surf->translucency.tex; break;
  2823. case ID_BUMP: list = &surf->bump.tex; break;
  2824. default: return 0;
  2825. }
  2826. lwListInsert( (void**)list, tex, (int (__cdecl *)(void *,void *))compare_textures );
  2827. return 1;
  2828. }
  2829. /*
  2830. ======================================================================
  2831. lwDefaultSurface()
  2832. Allocate and initialize a surface.
  2833. ====================================================================== */
  2834. lwSurface *lwDefaultSurface()
  2835. {
  2836. lwSurface *surf;
  2837. surf = (lwSurface*)Mem_ClearedAlloc( sizeof( lwSurface ), TAG_MODEL );
  2838. if ( !surf ) return NULL;
  2839. surf->color.rgb[ 0 ] = 0.78431f;
  2840. surf->color.rgb[ 1 ] = 0.78431f;
  2841. surf->color.rgb[ 2 ] = 0.78431f;
  2842. surf->diffuse.val = 1.0f;
  2843. surf->glossiness.val = 0.4f;
  2844. surf->bump.val = 1.0f;
  2845. surf->eta.val = 1.0f;
  2846. surf->sideflags = 1;
  2847. return surf;
  2848. }
  2849. /*
  2850. ======================================================================
  2851. lwGetSurface()
  2852. Read an lwSurface from an LWO2 file.
  2853. ====================================================================== */
  2854. lwSurface *lwGetSurface( idFile *fp, int cksize )
  2855. {
  2856. lwSurface *surf;
  2857. lwTexture *tex;
  2858. lwPlugin *shdr;
  2859. unsigned int id, type;
  2860. unsigned short sz;
  2861. int pos, rlen;
  2862. /* allocate the Surface structure */
  2863. surf = (lwSurface*)Mem_ClearedAlloc( sizeof( lwSurface ), TAG_MODEL );
  2864. if ( !surf ) goto Fail;
  2865. /* non-zero defaults */
  2866. surf->color.rgb[ 0 ] = 0.78431f;
  2867. surf->color.rgb[ 1 ] = 0.78431f;
  2868. surf->color.rgb[ 2 ] = 0.78431f;
  2869. surf->diffuse.val = 1.0f;
  2870. surf->glossiness.val = 0.4f;
  2871. surf->bump.val = 1.0f;
  2872. surf->eta.val = 1.0f;
  2873. surf->sideflags = 1;
  2874. /* remember where we started */
  2875. set_flen( 0 );
  2876. pos = fp->Tell();
  2877. /* names */
  2878. surf->name = getS0( fp );
  2879. surf->srcname = getS0( fp );
  2880. /* first subchunk header */
  2881. id = getU4( fp );
  2882. sz = getU2( fp );
  2883. if ( 0 > get_flen() ) goto Fail;
  2884. /* process subchunks as they're encountered */
  2885. while ( 1 ) {
  2886. sz += sz & 1;
  2887. set_flen( 0 );
  2888. switch ( id ) {
  2889. case ID_COLR:
  2890. surf->color.rgb[ 0 ] = getF4( fp );
  2891. surf->color.rgb[ 1 ] = getF4( fp );
  2892. surf->color.rgb[ 2 ] = getF4( fp );
  2893. surf->color.eindex = getVX( fp );
  2894. break;
  2895. case ID_LUMI:
  2896. surf->luminosity.val = getF4( fp );
  2897. surf->luminosity.eindex = getVX( fp );
  2898. break;
  2899. case ID_DIFF:
  2900. surf->diffuse.val = getF4( fp );
  2901. surf->diffuse.eindex = getVX( fp );
  2902. break;
  2903. case ID_SPEC:
  2904. surf->specularity.val = getF4( fp );
  2905. surf->specularity.eindex = getVX( fp );
  2906. break;
  2907. case ID_GLOS:
  2908. surf->glossiness.val = getF4( fp );
  2909. surf->glossiness.eindex = getVX( fp );
  2910. break;
  2911. case ID_REFL:
  2912. surf->reflection.val.val = getF4( fp );
  2913. surf->reflection.val.eindex = getVX( fp );
  2914. break;
  2915. case ID_RFOP:
  2916. surf->reflection.options = getU2( fp );
  2917. break;
  2918. case ID_RIMG:
  2919. surf->reflection.cindex = getVX( fp );
  2920. break;
  2921. case ID_RSAN:
  2922. surf->reflection.seam_angle = getF4( fp );
  2923. break;
  2924. case ID_TRAN:
  2925. surf->transparency.val.val = getF4( fp );
  2926. surf->transparency.val.eindex = getVX( fp );
  2927. break;
  2928. case ID_TROP:
  2929. surf->transparency.options = getU2( fp );
  2930. break;
  2931. case ID_TIMG:
  2932. surf->transparency.cindex = getVX( fp );
  2933. break;
  2934. case ID_RIND:
  2935. surf->eta.val = getF4( fp );
  2936. surf->eta.eindex = getVX( fp );
  2937. break;
  2938. case ID_TRNL:
  2939. surf->translucency.val = getF4( fp );
  2940. surf->translucency.eindex = getVX( fp );
  2941. break;
  2942. case ID_BUMP:
  2943. surf->bump.val = getF4( fp );
  2944. surf->bump.eindex = getVX( fp );
  2945. break;
  2946. case ID_SMAN:
  2947. surf->smooth = getF4( fp );
  2948. break;
  2949. case ID_SIDE:
  2950. surf->sideflags = getU2( fp );
  2951. break;
  2952. case ID_CLRH:
  2953. surf->color_hilite.val = getF4( fp );
  2954. surf->color_hilite.eindex = getVX( fp );
  2955. break;
  2956. case ID_CLRF:
  2957. surf->color_filter.val = getF4( fp );
  2958. surf->color_filter.eindex = getVX( fp );
  2959. break;
  2960. case ID_ADTR:
  2961. surf->add_trans.val = getF4( fp );
  2962. surf->add_trans.eindex = getVX( fp );
  2963. break;
  2964. case ID_SHRP:
  2965. surf->dif_sharp.val = getF4( fp );
  2966. surf->dif_sharp.eindex = getVX( fp );
  2967. break;
  2968. case ID_GVAL:
  2969. surf->glow.val = getF4( fp );
  2970. surf->glow.eindex = getVX( fp );
  2971. break;
  2972. case ID_LINE:
  2973. surf->line.enabled = 1;
  2974. if ( sz >= 2 ) surf->line.flags = getU2( fp );
  2975. if ( sz >= 6 ) surf->line.size.val = getF4( fp );
  2976. if ( sz >= 8 ) surf->line.size.eindex = getVX( fp );
  2977. break;
  2978. case ID_ALPH:
  2979. surf->alpha_mode = getU2( fp );
  2980. surf->alpha = getF4( fp );
  2981. break;
  2982. case ID_AVAL:
  2983. surf->alpha = getF4( fp );
  2984. break;
  2985. case ID_BLOK:
  2986. type = getU4( fp );
  2987. switch ( type ) {
  2988. case ID_IMAP:
  2989. case ID_PROC:
  2990. case ID_GRAD:
  2991. tex = lwGetTexture( fp, sz - 4, type );
  2992. if ( !tex ) goto Fail;
  2993. if ( !add_texture( surf, tex ))
  2994. lwFreeTexture( tex );
  2995. set_flen( 4 + get_flen() );
  2996. break;
  2997. case ID_SHDR:
  2998. shdr = lwGetShader( fp, sz - 4 );
  2999. if ( !shdr ) goto Fail;
  3000. lwListInsert( (void**)&surf->shader, shdr, (int (__cdecl *)(void *,void *))compare_shaders );
  3001. ++surf->nshaders;
  3002. set_flen( 4 + get_flen() );
  3003. break;
  3004. }
  3005. break;
  3006. default:
  3007. break;
  3008. }
  3009. /* error while reading current subchunk? */
  3010. rlen = get_flen();
  3011. if ( rlen < 0 || rlen > sz ) goto Fail;
  3012. /* skip unread parts of the current subchunk */
  3013. if ( rlen < sz )
  3014. fp->Seek( sz - rlen, FS_SEEK_CUR );
  3015. /* end of the SURF chunk? */
  3016. if ( cksize <= fp->Tell() - pos )
  3017. break;
  3018. /* get the next subchunk header */
  3019. set_flen( 0 );
  3020. id = getU4( fp );
  3021. sz = getU2( fp );
  3022. if ( 6 != get_flen() ) goto Fail;
  3023. }
  3024. return surf;
  3025. Fail:
  3026. if ( surf ) lwFreeSurface( surf );
  3027. return NULL;
  3028. }
  3029. float dot( float a[], float b[] )
  3030. {
  3031. return a[ 0 ] * b[ 0 ] + a[ 1 ] * b[ 1 ] + a[ 2 ] * b[ 2 ];
  3032. }
  3033. void cross( float a[], float b[], float c[] )
  3034. {
  3035. c[ 0 ] = a[ 1 ] * b[ 2 ] - a[ 2 ] * b[ 1 ];
  3036. c[ 1 ] = a[ 2 ] * b[ 0 ] - a[ 0 ] * b[ 2 ];
  3037. c[ 2 ] = a[ 0 ] * b[ 1 ] - a[ 1 ] * b[ 0 ];
  3038. }
  3039. void normalize( float v[] )
  3040. {
  3041. float r;
  3042. r = ( float ) idMath::Sqrt( dot( v, v ));
  3043. if ( r > 0 ) {
  3044. v[ 0 ] /= r;
  3045. v[ 1 ] /= r;
  3046. v[ 2 ] /= r;
  3047. }
  3048. }
  3049. /*
  3050. ======================================================================
  3051. lwFreeVMap()
  3052. Free memory used by an lwVMap.
  3053. ====================================================================== */
  3054. void lwFreeVMap( lwVMap *vmap )
  3055. {
  3056. if ( vmap ) {
  3057. if ( vmap->name ) Mem_Free( vmap->name );
  3058. if ( vmap->vindex ) Mem_Free( vmap->vindex );
  3059. if ( vmap->pindex ) Mem_Free( vmap->pindex );
  3060. if ( vmap->val ) {
  3061. if ( vmap->val[ 0 ] ) Mem_Free( vmap->val[ 0 ] );
  3062. Mem_Free( vmap->val );
  3063. }
  3064. Mem_Free( vmap );
  3065. }
  3066. }
  3067. /*
  3068. ======================================================================
  3069. lwGetVMap()
  3070. Read an lwVMap from a VMAP or VMAD chunk in an LWO2.
  3071. ====================================================================== */
  3072. lwVMap *lwGetVMap( idFile *fp, int cksize, int ptoffset, int poloffset,
  3073. int perpoly )
  3074. {
  3075. unsigned char *buf, *bp;
  3076. lwVMap *vmap;
  3077. float *f;
  3078. int i, j, npts, rlen;
  3079. /* read the whole chunk */
  3080. set_flen( 0 );
  3081. buf = (unsigned char*)getbytes( fp, cksize );
  3082. if ( !buf ) return NULL;
  3083. vmap = (lwVMap*)Mem_ClearedAlloc( sizeof( lwVMap ), TAG_MODEL );
  3084. if ( !vmap ) {
  3085. Mem_Free( buf );
  3086. return NULL;
  3087. }
  3088. /* initialize the vmap */
  3089. vmap->perpoly = perpoly;
  3090. bp = buf;
  3091. set_flen( 0 );
  3092. vmap->type = sgetU4( &bp );
  3093. vmap->dim = sgetU2( &bp );
  3094. vmap->name = sgetS0( &bp );
  3095. rlen = get_flen();
  3096. /* count the vmap records */
  3097. npts = 0;
  3098. while ( bp < buf + cksize ) {
  3099. i = sgetVX( &bp );
  3100. if ( perpoly )
  3101. i = sgetVX( &bp );
  3102. bp += vmap->dim * sizeof( float );
  3103. ++npts;
  3104. }
  3105. /* allocate the vmap */
  3106. vmap->nverts = npts;
  3107. vmap->vindex = (int*)Mem_ClearedAlloc( npts * sizeof( int ), TAG_MODEL );
  3108. if ( !vmap->vindex ) goto Fail;
  3109. if ( perpoly ) {
  3110. vmap->pindex = (int*)Mem_ClearedAlloc( npts * sizeof( int ), TAG_MODEL );
  3111. if ( !vmap->pindex ) goto Fail;
  3112. }
  3113. if ( vmap->dim > 0 ) {
  3114. vmap->val = (float**)Mem_ClearedAlloc( npts * sizeof( float * ), TAG_MODEL );
  3115. if ( !vmap->val ) goto Fail;
  3116. f = (float*)Mem_ClearedAlloc( npts * vmap->dim * sizeof( float ), TAG_MODEL );
  3117. if ( !f ) goto Fail;
  3118. for ( i = 0; i < npts; i++ )
  3119. vmap->val[ i ] = f + i * vmap->dim;
  3120. }
  3121. /* fill in the vmap values */
  3122. bp = buf + rlen;
  3123. for ( i = 0; i < npts; i++ ) {
  3124. vmap->vindex[ i ] = sgetVX( &bp );
  3125. if ( perpoly )
  3126. vmap->pindex[ i ] = sgetVX( &bp );
  3127. for ( j = 0; j < vmap->dim; j++ )
  3128. vmap->val[ i ][ j ] = sgetF4( &bp );
  3129. }
  3130. Mem_Free( buf );
  3131. return vmap;
  3132. Fail:
  3133. if ( buf ) Mem_Free( buf );
  3134. lwFreeVMap( vmap );
  3135. return NULL;
  3136. }
  3137. /*
  3138. ======================================================================
  3139. lwGetPointVMaps()
  3140. Fill in the lwVMapPt structure for each point.
  3141. ====================================================================== */
  3142. int lwGetPointVMaps( lwPointList *point, lwVMap *vmap )
  3143. {
  3144. lwVMap *vm;
  3145. int i, j, n;
  3146. /* count the number of vmap values for each point */
  3147. vm = vmap;
  3148. while ( vm ) {
  3149. if ( !vm->perpoly )
  3150. for ( i = 0; i < vm->nverts; i++ )
  3151. ++point->pt[ vm->vindex[ i ]].nvmaps;
  3152. vm = vm->next;
  3153. }
  3154. /* allocate vmap references for each mapped point */
  3155. for ( i = 0; i < point->count; i++ ) {
  3156. if ( point->pt[ i ].nvmaps ) {
  3157. point->pt[ i ].vm = (lwVMapPt*)Mem_ClearedAlloc( point->pt[ i ].nvmaps * sizeof( lwVMapPt ), TAG_MODEL );
  3158. if ( !point->pt[ i ].vm ) return 0;
  3159. point->pt[ i ].nvmaps = 0;
  3160. }
  3161. }
  3162. /* fill in vmap references for each mapped point */
  3163. vm = vmap;
  3164. while ( vm ) {
  3165. if ( !vm->perpoly ) {
  3166. for ( i = 0; i < vm->nverts; i++ ) {
  3167. j = vm->vindex[ i ];
  3168. n = point->pt[ j ].nvmaps;
  3169. point->pt[ j ].vm[ n ].vmap = vm;
  3170. point->pt[ j ].vm[ n ].index = i;
  3171. ++point->pt[ j ].nvmaps;
  3172. }
  3173. }
  3174. vm = vm->next;
  3175. }
  3176. return 1;
  3177. }
  3178. /*
  3179. ======================================================================
  3180. lwGetPolyVMaps()
  3181. Fill in the lwVMapPt structure for each polygon vertex.
  3182. ====================================================================== */
  3183. int lwGetPolyVMaps( lwPolygonList *polygon, lwVMap *vmap )
  3184. {
  3185. lwVMap *vm;
  3186. lwPolVert *pv;
  3187. int i, j;
  3188. /* count the number of vmap values for each polygon vertex */
  3189. vm = vmap;
  3190. while ( vm ) {
  3191. if ( vm->perpoly ) {
  3192. for ( i = 0; i < vm->nverts; i++ ) {
  3193. for ( j = 0; j < polygon->pol[ vm->pindex[ i ]].nverts; j++ ) {
  3194. pv = &polygon->pol[ vm->pindex[ i ]].v[ j ];
  3195. if ( vm->vindex[ i ] == pv->index ) {
  3196. ++pv->nvmaps;
  3197. break;
  3198. }
  3199. }
  3200. }
  3201. }
  3202. vm = vm->next;
  3203. }
  3204. /* allocate vmap references for each mapped vertex */
  3205. for ( i = 0; i < polygon->count; i++ ) {
  3206. for ( j = 0; j < polygon->pol[ i ].nverts; j++ ) {
  3207. pv = &polygon->pol[ i ].v[ j ];
  3208. if ( pv->nvmaps ) {
  3209. pv->vm = (lwVMapPt*)Mem_ClearedAlloc( pv->nvmaps * sizeof( lwVMapPt ), TAG_MODEL );
  3210. if ( !pv->vm ) return 0;
  3211. pv->nvmaps = 0;
  3212. }
  3213. }
  3214. }
  3215. /* fill in vmap references for each mapped point */
  3216. vm = vmap;
  3217. while ( vm ) {
  3218. if ( vm->perpoly ) {
  3219. for ( i = 0; i < vm->nverts; i++ ) {
  3220. for ( j = 0; j < polygon->pol[ vm->pindex[ i ]].nverts; j++ ) {
  3221. pv = &polygon->pol[ vm->pindex[ i ]].v[ j ];
  3222. if ( vm->vindex[ i ] == pv->index ) {
  3223. pv->vm[ pv->nvmaps ].vmap = vm;
  3224. pv->vm[ pv->nvmaps ].index = i;
  3225. ++pv->nvmaps;
  3226. break;
  3227. }
  3228. }
  3229. }
  3230. }
  3231. vm = vm->next;
  3232. }
  3233. return 1;
  3234. }