newtex.c 168 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718
  1. /*
  2. * Copyright (c) 1983-2013 Trevor Wishart and Composers Desktop Project Ltd
  3. * http://www.trevorwishart.co.uk
  4. * http://www.composersdesktop.com
  5. *
  6. This file is part of the CDP System.
  7. The CDP System is free software; you can redistribute it
  8. and/or modify it under the terms of the GNU Lesser General Public
  9. License as published by the Free Software Foundation; either
  10. version 2.1 of the License, or (at your option) any later version.
  11. The CDP System is distributed in the hope that it will be useful,
  12. but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. GNU Lesser General Public License for more details.
  15. You should have received a copy of the GNU Lesser General Public
  16. License along with the CDP System; if not, write to the Free Software
  17. Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  18. 02111-1307 USA
  19. *
  20. */
  21. /*
  22. * special_onoff indicates that a stream remains on but has changed its output position.
  23. * It must therefore fade out at the current location and level before fading in at the new location and level.
  24. * special_onoff2 in MODE 2 is used to flag that the same channel is remaining on, but starting from a new locus
  25. * It must therefore fade out using the previous locus, levels and spatial position
  26. * and only get its new locus, levels and position when the fade-up begins (after the fade-down)
  27. */
  28. #include <stdio.h>
  29. #include <stdlib.h>
  30. #include <structures.h>
  31. #include <tkglobals.h>
  32. #include <pnames.h>
  33. #include <filetype.h>
  34. #include <processno.h>
  35. #include <modeno.h>
  36. #include <logic.h>
  37. #include <globcon.h>
  38. #include <cdpmain.h>
  39. #include <math.h>
  40. #include <mixxcon.h>
  41. #include <osbind.h>
  42. #include <standalone.h>
  43. #include <ctype.h>
  44. #include <sfsys.h>
  45. #include <string.h>
  46. #include <srates.h>
  47. #define S_OFF 0
  48. #define S_ON 1
  49. #define SIGNAL_TO_LEFT (0)
  50. #define SIGNAL_TO_RIGHT (1)
  51. #define ROOT2 (1.4142136)
  52. #define NTEX_GRAIN (.002)
  53. #define NTX_X 0
  54. #define NTX_JUMP 1
  55. #ifdef unix
  56. #include <aaio.h>
  57. #define round(x) lround((x))
  58. #endif
  59. char errstr[2400];
  60. int anal_infiles = 1;
  61. int sloom = 0;
  62. int sloombatch = 0;
  63. const char* cdp_version = "7.1.1";
  64. //CDP LIB REPLACEMENTS
  65. static int setup_newtex_application(dataptr dz);
  66. static int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz);
  67. static int setup_newtex_param_ranges_and_defaults(dataptr dz);
  68. static int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz);
  69. static int open_the_outfile(dataptr dz);
  70. static int handle_the_special_data(char *str,dataptr dz);
  71. static int setup_and_init_input_param_activity(dataptr dz,int tipc);
  72. static int setup_input_param_defaultval_stores(int tipc,aplptr ap);
  73. static int establish_application(dataptr dz);
  74. static int initialise_vflags(dataptr dz);
  75. static int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz);
  76. static int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz);
  77. static int mark_parameter_types(dataptr dz,aplptr ap);
  78. static int assign_file_data_storage(int infilecnt,dataptr dz);
  79. static int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q);
  80. static int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz);
  81. static int get_the_mode_from_cmdline(char *str,dataptr dz);
  82. static int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt);
  83. static int parse_infile_and_check_type(char **cmdline,dataptr dz);
  84. static int newtex_param_preprocess(int **perm,int **permon,int **permoff,int **superperm,double *minrate,int *maxsteps,dataptr dz);
  85. static int newtex(int *perm,int *permon,int *permoff,int *superperm,double minrate,int maxsteps,dataptr dz);
  86. static void incr_tabptr(int n,double time,double *transval,int strmsrc,dataptr dz);
  87. //static double read_level(int n,double time,dataptr dz);
  88. static int create_newtex_sndbufs(dataptr dz);
  89. static void rndintperm(int *perm,int cnt);
  90. static void get_current_partial_vals(double time,double *pvals,int totalpartials,dataptr dz);
  91. static void pancalc(double position,double *leftgain,double *rightgain);
  92. static void sort_partials_into_ascending_frq_order(int mpcnt,double *pvals,double *tabptr,
  93. double **llev,double **rlev,int **onoff,int **lmost,int **origspl,int *splordr,int *strmsrc,dataptr dz);
  94. static void resort_partials_into_original_frq_order(int mpcnt,double *pvals,double *tabptr,
  95. double **llev,double **rlev,int **onoff,int **lmost,int **origspl,int *splordr,int *strmsrc,dataptr dz);
  96. static void xclusive(int *perm,int *permon,int *permoff,int max_partials_cnt,int partials_in_play, int **onoff,int stepcnt);
  97. static double emergepos(int emergchan,int chans,double time,double timespan);
  98. static double convergepos(int converchan,int chans,double time,double convergetime,double dur);
  99. static void spacebox_apply(double pos, double lev,int chans,int *lmost, int *rmost,double *rlev,double *llev,int spacetyp);
  100. static void output_special_spatialisation_sample(float *obuf,int sampcnt,int switchpos,int chans,double val,double valr,int lmost,int rmost,int spacetyp);
  101. static void spacebox(double *pos, int *switchpos, double posstep, int chans, int spacetyp, int configno, int configcnt,int *superperm);
  102. static int otherwise(dataptr dz);
  103. static void get_drunkpos(int *here,int thisdur,int sndlen,int grain,int n,int *loc,int stepcnt,dataptr dz);
  104. static int get_step(int grain,dataptr dz);
  105. static int get_new_locus_pos(int here,int ambitus,int locus,int step,int sndlen,int thisdur);
  106. static int get_new_pos(int here,int ambitus,int locus,int step,int sndlen,int thisdur);
  107. static void bounce_off_src_end_if_necessary(int *here,int thisdur,int sndlen);
  108. /**************************************** MAIN *********************************************/
  109. int main(int argc,char *argv[])
  110. {
  111. int exit_status;
  112. dataptr dz = NULL;
  113. char **cmdline, sfnam[400];
  114. int cmdlinecnt;
  115. //aplptr ap;
  116. int is_launched = FALSE;
  117. int *perm, *permon, *permoff, *superperm;
  118. int maxsteps = 0;
  119. double minrate = 0.0;
  120. if(argc==2 && (strcmp(argv[1],"--version") == 0)) {
  121. fprintf(stdout,"%s\n",cdp_version);
  122. fflush(stdout);
  123. return 0;
  124. }
  125. /* CHECK FOR SOUNDLOOM */
  126. if((sloom = sound_loom_in_use(&argc,&argv)) > 1) {
  127. sloom = 0;
  128. sloombatch = 1;
  129. }
  130. if(sflinit("cdp")){
  131. sfperror("cdp: initialisation\n");
  132. return(FAILED);
  133. }
  134. /* SET UP THE PRINCIPLE DATASTRUCTURE */
  135. if((exit_status = establish_datastructure(&dz))<0) { // CDP LIB
  136. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  137. return(FAILED);
  138. }
  139. if(!sloom) {
  140. if(argc == 1) {
  141. usage1();
  142. return(FAILED);
  143. } else if(argc == 2) {
  144. usage2(argv[1]);
  145. return(FAILED);
  146. }
  147. }
  148. if(!sloom) {
  149. if((exit_status = make_initial_cmdline_check(&argc,&argv))<0) { // CDP LIB
  150. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  151. return(FAILED);
  152. }
  153. cmdline = argv;
  154. cmdlinecnt = argc;
  155. if((get_the_process_no(argv[0],dz))<0)
  156. return(FAILED);
  157. cmdline++;
  158. cmdlinecnt--;
  159. dz->maxmode = 3;
  160. if((exit_status = get_the_mode_from_cmdline(cmdline[0],dz))<0) {
  161. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  162. return(exit_status);
  163. }
  164. cmdline++;
  165. cmdlinecnt--;
  166. // setup_particular_application =
  167. if(dz->mode == 0 && cmdlinecnt < 8) {
  168. usage2("newtex");
  169. return(FAILED);
  170. } else if(dz->mode == 1 && cmdlinecnt < 9) {
  171. usage2("newtex");
  172. return(FAILED);
  173. } else if(dz->mode == 2 && cmdlinecnt < 10) {
  174. usage2("newtex");
  175. return(FAILED);
  176. }
  177. if((exit_status = setup_newtex_application(dz))<0) {
  178. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  179. return(FAILED);
  180. }
  181. if((exit_status = count_and_allocate_for_infiles(cmdlinecnt,cmdline,dz))<0) { // CDP LIB
  182. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  183. return(FAILED);
  184. }
  185. } else {
  186. //parse_TK_data() =
  187. if((exit_status = parse_sloom_data(argc,argv,&cmdline,&cmdlinecnt,dz))<0) {
  188. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  189. return(exit_status);
  190. }
  191. }
  192. //ap = dz->application;
  193. // parse_infile_and_hone_type() =
  194. if((exit_status = parse_infile_and_check_type(cmdline,dz))<0) {
  195. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  196. return(FAILED);
  197. }
  198. // setup_param_ranges_and_defaults() =
  199. if((exit_status = setup_newtex_param_ranges_and_defaults(dz))<0) {
  200. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  201. return(FAILED);
  202. }
  203. if((exit_status = open_first_infile(cmdline[0],dz))<0) {
  204. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  205. return(FAILED);
  206. }
  207. cmdlinecnt--;
  208. cmdline++;
  209. if(dz->mode == 1 || dz->mode == 2) {
  210. if((exit_status = handle_extra_infiles(&cmdline,&cmdlinecnt,dz))<0) {
  211. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  212. return(FAILED);
  213. }
  214. }
  215. // handle_outfile() =
  216. if((exit_status = handle_the_outfile(&cmdlinecnt,&cmdline,dz))<0) {
  217. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  218. return(FAILED);
  219. }
  220. // handle_formants() redundant
  221. // handle_formant_quiksearch() redundant
  222. if(dz->mode == 0) {
  223. strcpy(sfnam,cmdline[0]);
  224. cmdlinecnt--;
  225. cmdline++;
  226. }
  227. if((exit_status = read_parameters_and_flags(&cmdline,&cmdlinecnt,dz))<0) { // CDP LIB
  228. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  229. return(FAILED);
  230. }
  231. // check_param_validity_and_consistency() redundant
  232. switch(dz->mode) {
  233. case(0):
  234. if((exit_status = handle_the_special_data(sfnam,dz))<0) {
  235. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  236. return(FAILED);
  237. }
  238. break;
  239. case(1):
  240. case(2):
  241. if((exit_status = otherwise(dz))<0) {
  242. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  243. return(FAILED);
  244. }
  245. break;
  246. }
  247. is_launched = TRUE;
  248. if((exit_status = create_newtex_sndbufs(dz))<0) {
  249. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  250. return(FAILED);
  251. }
  252. if((exit_status = newtex_param_preprocess(&perm,&permon,&permoff,&superperm,&minrate,&maxsteps,dz))<0) {
  253. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  254. return(FAILED);
  255. }
  256. if((exit_status = open_the_outfile(dz))<0) {
  257. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  258. return(FAILED);
  259. }
  260. //spec_process_file =
  261. if((exit_status = newtex(perm,permon,permoff,superperm,minrate,maxsteps,dz))<0) {
  262. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  263. return(FAILED);
  264. }
  265. if((exit_status = complete_output(dz))<0) { // CDP LIB
  266. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  267. return(FAILED);
  268. }
  269. exit_status = print_messages_and_close_sndfiles(FINISHED,is_launched,dz); // CDP LIB
  270. free(dz);
  271. return(SUCCEEDED);
  272. }
  273. /**********************************************
  274. REPLACED CDP LIB FUNCTIONS
  275. **********************************************/
  276. /****************************** SET_PARAM_DATA *********************************/
  277. int set_param_data(aplptr ap, int special_data,int maxparamcnt,int paramcnt,char *paramlist)
  278. {
  279. ap->special_data = (char)special_data;
  280. ap->param_cnt = (char)paramcnt;
  281. ap->max_param_cnt = (char)maxparamcnt;
  282. if(ap->max_param_cnt>0) {
  283. if((ap->param_list = (char *)malloc((size_t)(ap->max_param_cnt+1)))==NULL) {
  284. sprintf(errstr,"INSUFFICIENT MEMORY: for param_list\n");
  285. return(MEMORY_ERROR);
  286. }
  287. strcpy(ap->param_list,paramlist);
  288. }
  289. return(FINISHED);
  290. }
  291. /****************************** SET_VFLGS *********************************/
  292. int set_vflgs
  293. (aplptr ap,char *optflags,int optcnt,char *optlist,char *varflags,int vflagcnt, int vparamcnt,char *varlist)
  294. {
  295. ap->option_cnt = (char) optcnt; /*RWD added cast */
  296. if(optcnt) {
  297. if((ap->option_list = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  298. sprintf(errstr,"INSUFFICIENT MEMORY: for option_list\n");
  299. return(MEMORY_ERROR);
  300. }
  301. strcpy(ap->option_list,optlist);
  302. if((ap->option_flags = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  303. sprintf(errstr,"INSUFFICIENT MEMORY: for option_flags\n");
  304. return(MEMORY_ERROR);
  305. }
  306. strcpy(ap->option_flags,optflags);
  307. }
  308. ap->vflag_cnt = (char) vflagcnt;
  309. ap->variant_param_cnt = (char) vparamcnt;
  310. if(vflagcnt) {
  311. if((ap->variant_list = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  312. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_list\n");
  313. return(MEMORY_ERROR);
  314. }
  315. strcpy(ap->variant_list,varlist);
  316. if((ap->variant_flags = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  317. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_flags\n");
  318. return(MEMORY_ERROR);
  319. }
  320. strcpy(ap->variant_flags,varflags);
  321. }
  322. return(FINISHED);
  323. }
  324. /***************************** APPLICATION_INIT **************************/
  325. int application_init(dataptr dz)
  326. {
  327. int exit_status;
  328. int storage_cnt;
  329. int tipc, brkcnt;
  330. aplptr ap = dz->application;
  331. if(ap->vflag_cnt>0)
  332. initialise_vflags(dz);
  333. tipc = ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt;
  334. ap->total_input_param_cnt = (char)tipc;
  335. if(tipc>0) {
  336. if((exit_status = setup_input_param_range_stores(tipc,ap))<0)
  337. return(exit_status);
  338. if((exit_status = setup_input_param_defaultval_stores(tipc,ap))<0)
  339. return(exit_status);
  340. if((exit_status = setup_and_init_input_param_activity(dz,tipc))<0)
  341. return(exit_status);
  342. }
  343. brkcnt = tipc;
  344. //THERE ARE NO INPUTFILE brktables USED IN THIS PROCESS
  345. if(brkcnt>0) {
  346. if((exit_status = setup_and_init_input_brktable_constants(dz,brkcnt))<0)
  347. return(exit_status);
  348. }
  349. if((storage_cnt = tipc + ap->internal_param_cnt)>0) {
  350. if((exit_status = setup_parameter_storage_and_constants(storage_cnt,dz))<0)
  351. return(exit_status);
  352. if((exit_status = initialise_is_int_and_no_brk_constants(storage_cnt,dz))<0)
  353. return(exit_status);
  354. }
  355. if((exit_status = mark_parameter_types(dz,ap))<0)
  356. return(exit_status);
  357. // establish_infile_constants() replaced by
  358. dz->infilecnt = 1;
  359. //establish_bufptrs_and_extra_buffers():
  360. return(FINISHED);
  361. }
  362. /********************** SETUP_PARAMETER_STORAGE_AND_CONSTANTS ********************/
  363. /* RWD mallo changed to calloc; helps debug verison run as release! */
  364. int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz)
  365. {
  366. if((dz->param = (double *)calloc(storage_cnt, sizeof(double)))==NULL) {
  367. sprintf(errstr,"setup_parameter_storage_and_constants(): 1\n");
  368. return(MEMORY_ERROR);
  369. }
  370. if((dz->iparam = (int *)calloc(storage_cnt, sizeof(int) ))==NULL) {
  371. sprintf(errstr,"setup_parameter_storage_and_constants(): 2\n");
  372. return(MEMORY_ERROR);
  373. }
  374. if((dz->is_int = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  375. sprintf(errstr,"setup_parameter_storage_and_constants(): 3\n");
  376. return(MEMORY_ERROR);
  377. }
  378. if((dz->no_brk = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  379. sprintf(errstr,"setup_parameter_storage_and_constants(): 5\n");
  380. return(MEMORY_ERROR);
  381. }
  382. return(FINISHED);
  383. }
  384. /************** INITIALISE_IS_INT_AND_NO_BRK_CONSTANTS *****************/
  385. int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz)
  386. {
  387. int n;
  388. for(n=0;n<storage_cnt;n++) {
  389. dz->is_int[n] = (char)0;
  390. dz->no_brk[n] = (char)0;
  391. }
  392. return(FINISHED);
  393. }
  394. /***************************** MARK_PARAMETER_TYPES **************************/
  395. int mark_parameter_types(dataptr dz,aplptr ap)
  396. {
  397. int n, m; /* PARAMS */
  398. for(n=0;n<ap->max_param_cnt;n++) {
  399. switch(ap->param_list[n]) {
  400. case('0'): break; /* dz->is_active[n] = 0 is default */
  401. case('i'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1;dz->no_brk[n] = (char)1; break;
  402. case('I'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1; break;
  403. case('d'): dz->is_active[n] = (char)1; dz->no_brk[n] = (char)1; break;
  404. case('D'): dz->is_active[n] = (char)1; /* normal case: double val or brkpnt file */ break;
  405. default:
  406. sprintf(errstr,"Programming error: invalid parameter type in mark_parameter_types()\n");
  407. return(PROGRAM_ERROR);
  408. }
  409. } /* OPTIONS */
  410. for(n=0,m=ap->max_param_cnt;n<ap->option_cnt;n++,m++) {
  411. switch(ap->option_list[n]) {
  412. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  413. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  414. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  415. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  416. default:
  417. sprintf(errstr,"Programming error: invalid option type in mark_parameter_types()\n");
  418. return(PROGRAM_ERROR);
  419. }
  420. } /* VARIANTS */
  421. for(n=0,m=ap->max_param_cnt + ap->option_cnt;n < ap->variant_param_cnt; n++, m++) {
  422. switch(ap->variant_list[n]) {
  423. case('0'): break;
  424. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  425. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  426. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  427. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  428. default:
  429. sprintf(errstr,"Programming error: invalid variant type in mark_parameter_types()\n");
  430. return(PROGRAM_ERROR);
  431. }
  432. } /* INTERNAL */
  433. for(n=0,
  434. m=ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt; n<ap->internal_param_cnt; n++,m++) {
  435. switch(ap->internal_param_list[n]) {
  436. case('0'): break; /* dummy variables: variables not used: but important for internal paream numbering!! */
  437. case('i'): dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  438. case('d'): dz->no_brk[m] = (char)1; break;
  439. default:
  440. sprintf(errstr,"Programming error: invalid internal param type in mark_parameter_types()\n");
  441. return(PROGRAM_ERROR);
  442. }
  443. }
  444. return(FINISHED);
  445. }
  446. /************************ HANDLE_THE_OUTFILE *********************/
  447. int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz)
  448. {
  449. char *filename = (*cmdline)[0], *p;
  450. if(filename[0]=='-' && filename[1]=='f') {
  451. dz->floatsam_output = 1;
  452. dz->true_outfile_stype = SAMP_FLOAT;
  453. filename+= 2;
  454. }
  455. if(!sloom) {
  456. if(file_has_invalid_startchar(filename) || value_is_numeric(filename)) {
  457. sprintf(errstr,"Outfile name %s has invalid start character(s) or looks too much like a number.\n",filename);
  458. return(DATA_ERROR);
  459. }
  460. }
  461. p = filename; // Drop file extension
  462. while(*p != ENDOFSTR) {
  463. if(*p == '.') {
  464. *p = ENDOFSTR;
  465. break;
  466. }
  467. p++;
  468. }
  469. strcpy(dz->outfilename,filename);
  470. (*cmdline)++;
  471. (*cmdlinecnt)--;
  472. return(FINISHED);
  473. }
  474. /************************ OPEN_THE_OUTFILE *********************/
  475. int open_the_outfile(dataptr dz)
  476. {
  477. int exit_status;
  478. dz->infile->channels = dz->iparam[NTEX_CHANS];
  479. if((exit_status = create_sized_outfile(dz->outfilename,dz))<0)
  480. return(exit_status);
  481. dz->infile->channels = 1;
  482. return(FINISHED);
  483. }
  484. /***************************** ESTABLISH_APPLICATION **************************/
  485. int establish_application(dataptr dz)
  486. {
  487. aplptr ap;
  488. if((dz->application = (aplptr)malloc(sizeof (struct applic)))==NULL) {
  489. sprintf(errstr,"establish_application()\n");
  490. return(MEMORY_ERROR);
  491. }
  492. ap = dz->application;
  493. memset((char *)ap,0,sizeof(struct applic));
  494. return(FINISHED);
  495. }
  496. /************************* INITIALISE_VFLAGS *************************/
  497. int initialise_vflags(dataptr dz)
  498. {
  499. int n;
  500. if((dz->vflag = (char *)malloc(dz->application->vflag_cnt * sizeof(char)))==NULL) {
  501. sprintf(errstr,"INSUFFICIENT MEMORY: vflag store,\n");
  502. return(MEMORY_ERROR);
  503. }
  504. for(n=0;n<dz->application->vflag_cnt;n++)
  505. dz->vflag[n] = FALSE;
  506. return FINISHED;
  507. }
  508. /************************* SETUP_INPUT_PARAM_DEFAULTVALS *************************/
  509. int setup_input_param_defaultval_stores(int tipc,aplptr ap)
  510. {
  511. int n;
  512. if((ap->default_val = (double *)malloc(tipc * sizeof(double)))==NULL) {
  513. sprintf(errstr,"INSUFFICIENT MEMORY for application default values store\n");
  514. return(MEMORY_ERROR);
  515. }
  516. for(n=0;n<tipc;n++)
  517. ap->default_val[n] = 0.0;
  518. return(FINISHED);
  519. }
  520. /***************************** SETUP_AND_INIT_INPUT_PARAM_ACTIVITY **************************/
  521. int setup_and_init_input_param_activity(dataptr dz,int tipc)
  522. {
  523. int n;
  524. if((dz->is_active = (char *)malloc((size_t)tipc))==NULL) {
  525. sprintf(errstr,"setup_and_init_input_param_activity()\n");
  526. return(MEMORY_ERROR);
  527. }
  528. for(n=0;n<tipc;n++)
  529. dz->is_active[n] = (char)0;
  530. return(FINISHED);
  531. }
  532. /************************* SETUP_NEWTEX_APPLICATION *******************/
  533. int setup_newtex_application(dataptr dz)
  534. {
  535. int exit_status;
  536. aplptr ap;
  537. if((exit_status = establish_application(dz))<0) // GLOBAL
  538. return(FAILED);
  539. ap = dz->application;
  540. // SEE parstruct FOR EXPLANATION of next 2 functions
  541. switch(dz->mode) {
  542. case(0):
  543. if((exit_status = set_param_data(ap,NTEX_TRANPOS,9,5,"diDDi0000"))<0)
  544. return(FAILED);
  545. if((exit_status = set_vflgs(ap,"sneEcCr",7,"dIididd","xj",2,0,"00"))<0)
  546. return(exit_status);
  547. break;
  548. case(1):
  549. if((exit_status = set_param_data(ap,0,9,6,"diDDid000"))<0)
  550. return(FAILED);
  551. if((exit_status = set_vflgs(ap,"sneEcCr",7,"diididd","xj",2,0,"00"))<0)
  552. return(exit_status);
  553. break;
  554. case(2):
  555. if((exit_status = set_param_data(ap,0,9,8,"diDDi0DDD"))<0)
  556. return(FAILED);
  557. if((exit_status = set_vflgs(ap,"sneEcCr",7,"diididd","xj",2,0,"00"))<0)
  558. return(exit_status);
  559. break;
  560. }
  561. // set_legal_infile_structure -->
  562. dz->has_otherfile = FALSE;
  563. // assign_process_logic -->
  564. switch(dz->mode) {
  565. case(0):
  566. dz->input_data_type = SNDFILES_ONLY;
  567. break;
  568. case(1):
  569. dz->input_data_type = MANY_SNDFILES;
  570. break;
  571. case(2):
  572. dz->input_data_type = ONE_OR_MANY_SNDFILES;
  573. break;
  574. }
  575. dz->process_type = UNEQUAL_SNDFILE;
  576. dz->outfiletype = SNDFILE_OUT;
  577. return application_init(dz); //GLOBAL
  578. }
  579. /************************* PARSE_INFILE_AND_CHECK_TYPE *******************/
  580. int parse_infile_and_check_type(char **cmdline,dataptr dz)
  581. {
  582. int exit_status;
  583. infileptr infile_info;
  584. if(!sloom) {
  585. if((infile_info = (infileptr)malloc(sizeof(struct filedata)))==NULL) {
  586. sprintf(errstr,"INSUFFICIENT MEMORY for infile structure to test file data.");
  587. return(MEMORY_ERROR);
  588. } else if((exit_status = cdparse(cmdline[0],infile_info))<0) {
  589. sprintf(errstr,"Failed to parse input file %s\n",cmdline[0]);
  590. return(PROGRAM_ERROR);
  591. } else if(infile_info->filetype != SNDFILE) {
  592. sprintf(errstr,"File %s is not of correct type\n",cmdline[0]);
  593. return(DATA_ERROR);
  594. } else if(infile_info->channels != 1) {
  595. sprintf(errstr,"File %s is not MONO\n",cmdline[0]);
  596. return(DATA_ERROR);
  597. } else if((exit_status = copy_parse_info_to_main_structure(infile_info,dz))<0) {
  598. sprintf(errstr,"Failed to copy file parsing information\n");
  599. return(PROGRAM_ERROR);
  600. }
  601. free(infile_info);
  602. }
  603. return(FINISHED);
  604. }
  605. /************************* SETUP_NEWTEX_PARAM_RANGES_AND_DEFAULTS *******************/
  606. int setup_newtex_param_ranges_and_defaults(dataptr dz)
  607. {
  608. int exit_status;
  609. aplptr ap = dz->application;
  610. // set_param_ranges()
  611. ap->total_input_param_cnt = (char)(ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt);
  612. // NB total_input_param_cnt is > 0 !!!
  613. if((exit_status = setup_input_param_range_stores(ap->total_input_param_cnt,ap))<0)
  614. return(FAILED);
  615. // get_param_ranges()
  616. ap->lo[NTEX_DUR] = 0.0;
  617. ap->hi[NTEX_DUR] = 32767.0;
  618. ap->default_val[NTEX_DUR] = 1.0;
  619. ap->lo[NTEX_CHANS] = 2;
  620. ap->hi[NTEX_CHANS] = 16.0;
  621. ap->default_val[NTEX_CHANS] = 1.0;
  622. switch(dz->mode) {
  623. case(0):
  624. ap->lo[NTEX_MAX] = 1.0; // FOr mode 0 this is (current) max transposition
  625. ap->hi[NTEX_MAX] = 8.0;
  626. ap->default_val[NTEX_MAX] = 3.0;
  627. break;
  628. case(1):
  629. case(2):
  630. ap->lo[NTEX_MAX] = 1.0; // For mode 0 this is times any src can be duplicated in the output
  631. ap->hi[NTEX_MAX] = 8.0;
  632. ap->default_val[NTEX_MAX] = 2.0;
  633. break;
  634. }
  635. ap->lo[NTEX_RATE] = 0.004;
  636. ap->hi[NTEX_RATE] = 100;
  637. ap->default_val[NTEX_RATE] = 0.1;
  638. switch(dz->mode) {
  639. case(1):
  640. ap->lo[NTEX_DEL] = 0.0;
  641. ap->hi[NTEX_DEL] = 32767;
  642. ap->default_val[NTEX_DEL] = 0.0;
  643. break;
  644. case(2):
  645. ap->lo[NTEX_LOC] = 0.0;
  646. ap->hi[NTEX_LOC] = 32767;
  647. ap->default_val[NTEX_LOC] = 0.0;
  648. ap->lo[NTEX_AMB] = 0.0;
  649. ap->hi[NTEX_AMB] = 32767;
  650. ap->default_val[NTEX_AMB] = 0.0;
  651. ap->lo[NTEX_GST] = 0.0;
  652. ap->hi[NTEX_GST] = 32767;
  653. ap->default_val[NTEX_GST] = 0.0;
  654. break;
  655. }
  656. ap->lo[NTEX_SPLEN] = 2;
  657. ap->hi[NTEX_SPLEN] = 50;
  658. ap->default_val[NTEX_SPLEN] = 5;
  659. switch(dz->mode) {
  660. case(0):
  661. ap->lo[NTEX_NUM] = 0; // Number of streams active
  662. ap->hi[NTEX_NUM] = 32;
  663. ap->default_val[NTEX_NUM] = 0;
  664. break;
  665. case(1):
  666. case(2):
  667. ap->lo[NTEX_NUM] = 0; // Number of streams active
  668. ap->hi[NTEX_NUM] = 132;
  669. ap->default_val[NTEX_NUM] = 0;
  670. break;
  671. }
  672. ap->lo[NTEX_EFROM] = 0;
  673. ap->hi[NTEX_EFROM] = 16.0;
  674. ap->default_val[NTEX_EFROM] = 0;
  675. ap->lo[NTEX_ETIME] = 0;
  676. ap->hi[NTEX_ETIME] = 32767.0;
  677. ap->default_val[NTEX_ETIME] = 0;
  678. ap->lo[NTEX_CTO] = 0;
  679. ap->hi[NTEX_CTO] = 16.0;
  680. ap->default_val[NTEX_CTO] = 0;
  681. ap->lo[NTEX_CTIME] = 0;
  682. ap->hi[NTEX_CTIME] = 32767.0;
  683. ap->default_val[NTEX_CTIME] = 0;
  684. ap->lo[NTEX_STYPE] = 0;
  685. ap->hi[NTEX_STYPE] = 14;
  686. ap->default_val[NTEX_STYPE] = 0;
  687. ap->lo[NTEX_RSPEED] = -20;
  688. ap->hi[NTEX_RSPEED] = 20;
  689. ap->default_val[NTEX_RSPEED] = 0;
  690. dz->maxmode = 3;
  691. if(!sloom)
  692. put_default_vals_in_all_params(dz);
  693. return(FINISHED);
  694. }
  695. /********************************* PARSE_SLOOM_DATA *********************************/
  696. int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz)
  697. {
  698. int exit_status;
  699. int cnt = 1, infilecnt;
  700. int filesize, insams, inbrksize;
  701. double dummy;
  702. int true_cnt = 0;
  703. //aplptr ap;
  704. while(cnt<=PRE_CMDLINE_DATACNT) {
  705. if(cnt > argc) {
  706. sprintf(errstr,"Insufficient data sent from TK\n");
  707. return(DATA_ERROR);
  708. }
  709. switch(cnt) {
  710. case(1):
  711. if(sscanf(argv[cnt],"%d",&dz->process)!=1) {
  712. sprintf(errstr,"Cannot read process no. sent from TK\n");
  713. return(DATA_ERROR);
  714. }
  715. break;
  716. case(2):
  717. if(sscanf(argv[cnt],"%d",&dz->mode)!=1) {
  718. sprintf(errstr,"Cannot read mode no. sent from TK\n");
  719. return(DATA_ERROR);
  720. }
  721. if(dz->mode > 0)
  722. dz->mode--;
  723. //setup_particular_application() =
  724. if((exit_status = setup_newtex_application(dz))<0)
  725. return(exit_status);
  726. //ap = dz->application;
  727. break;
  728. case(3):
  729. if(sscanf(argv[cnt],"%d",&infilecnt)!=1) {
  730. sprintf(errstr,"Cannot read infilecnt sent from TK\n");
  731. return(DATA_ERROR);
  732. }
  733. if(infilecnt < 1) {
  734. true_cnt = cnt + 1;
  735. cnt = PRE_CMDLINE_DATACNT; /* force exit from loop after assign_file_data_storage */
  736. }
  737. if((exit_status = assign_file_data_storage(infilecnt,dz))<0)
  738. return(exit_status);
  739. break;
  740. case(INPUT_FILETYPE+4):
  741. if(sscanf(argv[cnt],"%d",&dz->infile->filetype)!=1) {
  742. sprintf(errstr,"Cannot read filetype sent from TK (%s)\n",argv[cnt]);
  743. return(DATA_ERROR);
  744. }
  745. break;
  746. case(INPUT_FILESIZE+4):
  747. if(sscanf(argv[cnt],"%d",&filesize)!=1) {
  748. sprintf(errstr,"Cannot read infilesize sent from TK\n");
  749. return(DATA_ERROR);
  750. }
  751. dz->insams[0] = filesize;
  752. break;
  753. case(INPUT_INSAMS+4):
  754. if(sscanf(argv[cnt],"%d",&insams)!=1) {
  755. sprintf(errstr,"Cannot read insams sent from TK\n");
  756. return(DATA_ERROR);
  757. }
  758. dz->insams[0] = insams;
  759. break;
  760. case(INPUT_SRATE+4):
  761. if(sscanf(argv[cnt],"%d",&dz->infile->srate)!=1) {
  762. sprintf(errstr,"Cannot read srate sent from TK\n");
  763. return(DATA_ERROR);
  764. }
  765. break;
  766. case(INPUT_CHANNELS+4):
  767. if(sscanf(argv[cnt],"%d",&dz->infile->channels)!=1) {
  768. sprintf(errstr,"Cannot read channels sent from TK\n");
  769. return(DATA_ERROR);
  770. }
  771. break;
  772. case(INPUT_STYPE+4):
  773. if(sscanf(argv[cnt],"%d",&dz->infile->stype)!=1) {
  774. sprintf(errstr,"Cannot read stype sent from TK\n");
  775. return(DATA_ERROR);
  776. }
  777. break;
  778. case(INPUT_ORIGSTYPE+4):
  779. if(sscanf(argv[cnt],"%d",&dz->infile->origstype)!=1) {
  780. sprintf(errstr,"Cannot read origstype sent from TK\n");
  781. return(DATA_ERROR);
  782. }
  783. break;
  784. case(INPUT_ORIGRATE+4):
  785. if(sscanf(argv[cnt],"%d",&dz->infile->origrate)!=1) {
  786. sprintf(errstr,"Cannot read origrate sent from TK\n");
  787. return(DATA_ERROR);
  788. }
  789. break;
  790. case(INPUT_MLEN+4):
  791. if(sscanf(argv[cnt],"%d",&dz->infile->Mlen)!=1) {
  792. sprintf(errstr,"Cannot read Mlen sent from TK\n");
  793. return(DATA_ERROR);
  794. }
  795. break;
  796. case(INPUT_DFAC+4):
  797. if(sscanf(argv[cnt],"%d",&dz->infile->Dfac)!=1) {
  798. sprintf(errstr,"Cannot read Dfac sent from TK\n");
  799. return(DATA_ERROR);
  800. }
  801. break;
  802. case(INPUT_ORIGCHANS+4):
  803. if(sscanf(argv[cnt],"%d",&dz->infile->origchans)!=1) {
  804. sprintf(errstr,"Cannot read origchans sent from TK\n");
  805. return(DATA_ERROR);
  806. }
  807. break;
  808. case(INPUT_SPECENVCNT+4):
  809. if(sscanf(argv[cnt],"%d",&dz->infile->specenvcnt)!=1) {
  810. sprintf(errstr,"Cannot read specenvcnt sent from TK\n");
  811. return(DATA_ERROR);
  812. }
  813. dz->specenvcnt = dz->infile->specenvcnt;
  814. break;
  815. case(INPUT_WANTED+4):
  816. if(sscanf(argv[cnt],"%d",&dz->wanted)!=1) {
  817. sprintf(errstr,"Cannot read wanted sent from TK\n");
  818. return(DATA_ERROR);
  819. }
  820. break;
  821. case(INPUT_WLENGTH+4):
  822. if(sscanf(argv[cnt],"%d",&dz->wlength)!=1) {
  823. sprintf(errstr,"Cannot read wlength sent from TK\n");
  824. return(DATA_ERROR);
  825. }
  826. break;
  827. case(INPUT_OUT_CHANS+4):
  828. if(sscanf(argv[cnt],"%d",&dz->out_chans)!=1) {
  829. sprintf(errstr,"Cannot read out_chans sent from TK\n");
  830. return(DATA_ERROR);
  831. }
  832. break;
  833. /* RWD these chanegs to samps - tk will have to deal with that! */
  834. case(INPUT_DESCRIPTOR_BYTES+4):
  835. if(sscanf(argv[cnt],"%d",&dz->descriptor_samps)!=1) {
  836. sprintf(errstr,"Cannot read descriptor_samps sent from TK\n");
  837. return(DATA_ERROR);
  838. }
  839. break;
  840. case(INPUT_IS_TRANSPOS+4):
  841. if(sscanf(argv[cnt],"%d",&dz->is_transpos)!=1) {
  842. sprintf(errstr,"Cannot read is_transpos sent from TK\n");
  843. return(DATA_ERROR);
  844. }
  845. break;
  846. case(INPUT_COULD_BE_TRANSPOS+4):
  847. if(sscanf(argv[cnt],"%d",&dz->could_be_transpos)!=1) {
  848. sprintf(errstr,"Cannot read could_be_transpos sent from TK\n");
  849. return(DATA_ERROR);
  850. }
  851. break;
  852. case(INPUT_COULD_BE_PITCH+4):
  853. if(sscanf(argv[cnt],"%d",&dz->could_be_pitch)!=1) {
  854. sprintf(errstr,"Cannot read could_be_pitch sent from TK\n");
  855. return(DATA_ERROR);
  856. }
  857. break;
  858. case(INPUT_DIFFERENT_SRATES+4):
  859. if(sscanf(argv[cnt],"%d",&dz->different_srates)!=1) {
  860. sprintf(errstr,"Cannot read different_srates sent from TK\n");
  861. return(DATA_ERROR);
  862. }
  863. break;
  864. case(INPUT_DUPLICATE_SNDS+4):
  865. if(sscanf(argv[cnt],"%d",&dz->duplicate_snds)!=1) {
  866. sprintf(errstr,"Cannot read duplicate_snds sent from TK\n");
  867. return(DATA_ERROR);
  868. }
  869. break;
  870. case(INPUT_BRKSIZE+4):
  871. if(sscanf(argv[cnt],"%d",&inbrksize)!=1) {
  872. sprintf(errstr,"Cannot read brksize sent from TK\n");
  873. return(DATA_ERROR);
  874. }
  875. if(inbrksize > 0) {
  876. switch(dz->input_data_type) {
  877. case(WORDLIST_ONLY):
  878. break;
  879. case(PITCH_AND_PITCH):
  880. case(PITCH_AND_TRANSPOS):
  881. case(TRANSPOS_AND_TRANSPOS):
  882. dz->tempsize = inbrksize;
  883. break;
  884. case(BRKFILES_ONLY):
  885. case(UNRANGED_BRKFILE_ONLY):
  886. case(DB_BRKFILES_ONLY):
  887. case(ALL_FILES):
  888. case(ANY_NUMBER_OF_ANY_FILES):
  889. if(dz->extrabrkno < 0) {
  890. sprintf(errstr,"Storage location number for brktable not established by CDP.\n");
  891. return(DATA_ERROR);
  892. }
  893. if(dz->brksize == NULL) {
  894. sprintf(errstr,"CDP has not established storage space for input brktable.\n");
  895. return(PROGRAM_ERROR);
  896. }
  897. dz->brksize[dz->extrabrkno] = inbrksize;
  898. break;
  899. default:
  900. sprintf(errstr,"TK sent brktablesize > 0 for input_data_type [%d] not using brktables.\n",
  901. dz->input_data_type);
  902. return(PROGRAM_ERROR);
  903. }
  904. break;
  905. }
  906. break;
  907. case(INPUT_NUMSIZE+4):
  908. if(sscanf(argv[cnt],"%d",&dz->numsize)!=1) {
  909. sprintf(errstr,"Cannot read numsize sent from TK\n");
  910. return(DATA_ERROR);
  911. }
  912. break;
  913. case(INPUT_LINECNT+4):
  914. if(sscanf(argv[cnt],"%d",&dz->linecnt)!=1) {
  915. sprintf(errstr,"Cannot read linecnt sent from TK\n");
  916. return(DATA_ERROR);
  917. }
  918. break;
  919. case(INPUT_ALL_WORDS+4):
  920. if(sscanf(argv[cnt],"%d",&dz->all_words)!=1) {
  921. sprintf(errstr,"Cannot read all_words sent from TK\n");
  922. return(DATA_ERROR);
  923. }
  924. break;
  925. case(INPUT_ARATE+4):
  926. if(sscanf(argv[cnt],"%f",&dz->infile->arate)!=1) {
  927. sprintf(errstr,"Cannot read arate sent from TK\n");
  928. return(DATA_ERROR);
  929. }
  930. break;
  931. case(INPUT_FRAMETIME+4):
  932. if(sscanf(argv[cnt],"%lf",&dummy)!=1) {
  933. sprintf(errstr,"Cannot read frametime sent from TK\n");
  934. return(DATA_ERROR);
  935. }
  936. dz->frametime = (float)dummy;
  937. break;
  938. case(INPUT_WINDOW_SIZE+4):
  939. if(sscanf(argv[cnt],"%f",&dz->infile->window_size)!=1) {
  940. sprintf(errstr,"Cannot read window_size sent from TK\n");
  941. return(DATA_ERROR);
  942. }
  943. break;
  944. case(INPUT_NYQUIST+4):
  945. if(sscanf(argv[cnt],"%lf",&dz->nyquist)!=1) {
  946. sprintf(errstr,"Cannot read nyquist sent from TK\n");
  947. return(DATA_ERROR);
  948. }
  949. break;
  950. case(INPUT_DURATION+4):
  951. if(sscanf(argv[cnt],"%lf",&dz->duration)!=1) {
  952. sprintf(errstr,"Cannot read duration sent from TK\n");
  953. return(DATA_ERROR);
  954. }
  955. break;
  956. case(INPUT_MINBRK+4):
  957. if(sscanf(argv[cnt],"%lf",&dz->minbrk)!=1) {
  958. sprintf(errstr,"Cannot read minbrk sent from TK\n");
  959. return(DATA_ERROR);
  960. }
  961. break;
  962. case(INPUT_MAXBRK+4):
  963. if(sscanf(argv[cnt],"%lf",&dz->maxbrk)!=1) {
  964. sprintf(errstr,"Cannot read maxbrk sent from TK\n");
  965. return(DATA_ERROR);
  966. }
  967. break;
  968. case(INPUT_MINNUM+4):
  969. if(sscanf(argv[cnt],"%lf",&dz->minnum)!=1) {
  970. sprintf(errstr,"Cannot read minnum sent from TK\n");
  971. return(DATA_ERROR);
  972. }
  973. break;
  974. case(INPUT_MAXNUM+4):
  975. if(sscanf(argv[cnt],"%lf",&dz->maxnum)!=1) {
  976. sprintf(errstr,"Cannot read maxnum sent from TK\n");
  977. return(DATA_ERROR);
  978. }
  979. break;
  980. default:
  981. sprintf(errstr,"case switch item missing: parse_sloom_data()\n");
  982. return(PROGRAM_ERROR);
  983. }
  984. cnt++;
  985. }
  986. if(cnt!=PRE_CMDLINE_DATACNT+1) {
  987. sprintf(errstr,"Insufficient pre-cmdline params sent from TK\n");
  988. return(DATA_ERROR);
  989. }
  990. if(true_cnt)
  991. cnt = true_cnt;
  992. *cmdlinecnt = 0;
  993. while(cnt < argc) {
  994. if((exit_status = get_tk_cmdline_word(cmdlinecnt,cmdline,argv[cnt]))<0)
  995. return(exit_status);
  996. cnt++;
  997. }
  998. return(FINISHED);
  999. }
  1000. /********************************* GET_TK_CMDLINE_WORD *********************************/
  1001. int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q)
  1002. {
  1003. if(*cmdlinecnt==0) {
  1004. if((*cmdline = (char **)malloc(sizeof(char *)))==NULL) {
  1005. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  1006. return(MEMORY_ERROR);
  1007. }
  1008. } else {
  1009. if((*cmdline = (char **)realloc(*cmdline,((*cmdlinecnt)+1) * sizeof(char *)))==NULL) {
  1010. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  1011. return(MEMORY_ERROR);
  1012. }
  1013. }
  1014. if(((*cmdline)[*cmdlinecnt] = (char *)malloc((strlen(q) + 1) * sizeof(char)))==NULL) {
  1015. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline item %d.\n",(*cmdlinecnt)+1);
  1016. return(MEMORY_ERROR);
  1017. }
  1018. strcpy((*cmdline)[*cmdlinecnt],q);
  1019. (*cmdlinecnt)++;
  1020. return(FINISHED);
  1021. }
  1022. /****************************** ASSIGN_FILE_DATA_STORAGE *********************************/
  1023. int assign_file_data_storage(int infilecnt,dataptr dz)
  1024. {
  1025. int exit_status;
  1026. int no_sndfile_system_files = FALSE;
  1027. dz->infilecnt = infilecnt;
  1028. if((exit_status = allocate_filespace(dz))<0)
  1029. return(exit_status);
  1030. if(no_sndfile_system_files)
  1031. dz->infilecnt = 0;
  1032. return(FINISHED);
  1033. }
  1034. /************************* redundant functions: to ensure libs compile OK *******************/
  1035. int assign_process_logic(dataptr dz)
  1036. {
  1037. return(FINISHED);
  1038. }
  1039. void set_legal_infile_structure(dataptr dz)
  1040. {}
  1041. int set_legal_internalparam_structure(int process,int mode,aplptr ap)
  1042. {
  1043. return(FINISHED);
  1044. }
  1045. int setup_internal_arrays_and_array_pointers(dataptr dz)
  1046. {
  1047. return(FINISHED);
  1048. }
  1049. int establish_bufptrs_and_extra_buffers(dataptr dz)
  1050. {
  1051. return(FINISHED);
  1052. }
  1053. int read_special_data(char *str,dataptr dz)
  1054. {
  1055. return(FINISHED);
  1056. }
  1057. int inner_loop
  1058. (int *peakscore,int *descnt,int *in_start_portion,int *least,int *pitchcnt,int windows_in_buf,dataptr dz)
  1059. {
  1060. return(FINISHED);
  1061. }
  1062. int get_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  1063. {
  1064. return(FINISHED);
  1065. }
  1066. /******************************** USAGE1 ********************************/
  1067. int usage1(void)
  1068. {
  1069. usage2("newtex");
  1070. return(USAGE_ONLY);
  1071. }
  1072. /********************************************************************************************/
  1073. int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  1074. {
  1075. if(!strcmp(prog_identifier_from_cmdline,"newtex")) dz->process = NEWTEX;
  1076. else {
  1077. fprintf(stderr,"Unknown program identification string '%s'\n",prog_identifier_from_cmdline);
  1078. return(USAGE_ONLY);
  1079. }
  1080. return(FINISHED);
  1081. }
  1082. /******************************** SETUP_AND_INIT_INPUT_BRKTABLE_CONSTANTS ********************************/
  1083. int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt)
  1084. {
  1085. int n;
  1086. if((dz->brk = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  1087. sprintf(errstr,"setup_and_init_input_brktable_constants(): 1\n");
  1088. return(MEMORY_ERROR);
  1089. }
  1090. if((dz->brkptr = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  1091. sprintf(errstr,"setup_and_init_input_brktable_constants(): 6\n");
  1092. return(MEMORY_ERROR);
  1093. }
  1094. if((dz->brksize = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  1095. sprintf(errstr,"setup_and_init_input_brktable_constants(): 2\n");
  1096. return(MEMORY_ERROR);
  1097. }
  1098. if((dz->firstval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  1099. sprintf(errstr,"setup_and_init_input_brktable_constants(): 3\n");
  1100. return(MEMORY_ERROR);
  1101. }
  1102. if((dz->lastind = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  1103. sprintf(errstr,"setup_and_init_input_brktable_constants(): 4\n");
  1104. return(MEMORY_ERROR);
  1105. }
  1106. if((dz->lastval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  1107. sprintf(errstr,"setup_and_init_input_brktable_constants(): 5\n");
  1108. return(MEMORY_ERROR);
  1109. }
  1110. if((dz->brkinit = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  1111. sprintf(errstr,"setup_and_init_input_brktable_constants(): 7\n");
  1112. return(MEMORY_ERROR);
  1113. }
  1114. for(n=0;n<brkcnt;n++) {
  1115. dz->brk[n] = NULL;
  1116. dz->brkptr[n] = NULL;
  1117. dz->brkinit[n] = 0;
  1118. dz->brksize[n] = 0;
  1119. }
  1120. return(FINISHED);
  1121. }
  1122. /******************************** USAGE2 ********************************/
  1123. int usage2(char *str)
  1124. {
  1125. int k;
  1126. if(!strcmp(str,"newtex")) {
  1127. fprintf(stdout,
  1128. "USAGE:\n"
  1129. "newtex newtex 1 inf outf transposes dur chans maxrange step spacetype\n"
  1130. " [-ssplice] [-nnumber] [-x] [-rrotspeed] [-j] [-efrom -Etime] [-cto -Ctime]\n"
  1131. "newtex newtex 2 inf1 inf2 [inf3 ....] outf dur chans maxrange step spacetype delay\n"
  1132. " [-ssplice] [-nnumber] [-x] [-rrotspeed] [-j] [-efrom -Etime] [-cto -Ctime]\n"
  1133. "newtex newtex 3 inf1 [inf2 ....] outf dur chans maxrange step spacetype loc amb gstep\n"
  1134. " [-ssplice] [-nnumber] [-x] [-rrotspeed] [-j] [-efrom -Etime] [-cto -Ctime]\n"
  1135. "\n"
  1136. "Create texture of grains made from src sound(s).\n"
  1137. "MODE 1 Src transpositions (spread over N 8vas, and spatially) fade in-out randomly.\n"
  1138. "MODE 2 Srcs read at orig rate (spread spatially) fade in-out randomly.\n"
  1139. "MODE 3 Srcs read as drunken walks (spread spatially) fade in-out randomly.\n"
  1140. "\n"
  1141. "TRANPOSES Listing of transposition ratios and relative levels, against time.\n"
  1142. " Data is a text file of lines of data.\n"
  1143. " Every line must have the same number of entries.\n"
  1144. " 1ST ENTRY on each line is a time.\n"
  1145. " Times must start at zero and increase.\n"
  1146. " ALL EVEN NUMBERED ENTRIES are transposition ratios.\n"
  1147. " Transpositions must increase from entry to entry.\n"
  1148. " ALL OTHER ODD NUMBERED ENTRIES are transposition levels.\n"
  1149. " Levels should have values between -1 and 1.\n"
  1150. " -ve values invert the phase of the source.\n"
  1151. "DUR Duration of output sound.\n"
  1152. "CHANS Number of output channels.\n"
  1153. "MAXRANGE (Mode 0) Range of transpositions of input (in 8vas).\n"
  1154. " (Mode 1) Number of simultaneous soundings of any src.\n"
  1155. "STEP Average time between changes to stream-content of output.\n"
  1156. "SPLICE Splice-lengths for component entry and exit, in mS.\n"
  1157. "NUMBER Number of components chosen for each event.\n"
  1158. "DELAY Time delay between identical components.\n"
  1159. "LOC Locus from which to read sound segments.\n"
  1160. "AMB Ambitus: restricted range around locus where reads can begin.\n"
  1161. "GSTEP Max size of random steps between one read start and next.\n"
  1162. "-x (Xclusive) change all components (as far as poss) from event to event.\n"
  1163. "-j (Jump) All components assigned to same location for any one event.\n"
  1164. "SPACETYPE Type of output spatialisation.\n"
  1165. "ROTSPEED rotation speed (for certain spatialisation types).\n"
  1166. "-e -E (Emerge) sound emerges from channel \"from\" over time \"time\" at start.\n"
  1167. "-c -C (Converge) Sound converges to channel \"to\" over time \"time\" at end.\n"
  1168. "NB: Flags with NO params must be placed AFTER any flags WITH params, on the cmdline.\n"
  1169. "MAXRANGE, STEP, NUMBER, LOC, AMB and GSTEP can vary over time.\n"
  1170. "\n"
  1171. "Hit key 's' to continue to \"SPACETYPE\" information, or 'e' to exit.\n");
  1172. while((k = getch())!='s' && k != 'e')
  1173. ;
  1174. if(k == 's') {
  1175. fprintf(stderr,
  1176. "\n"
  1177. "SPACETYPE options.\n"
  1178. "\n"
  1179. "0 Spatial position set at random.\n"
  1180. "\n"
  1181. "(For 8-channel output only)\n"
  1182. "\n"
  1183. "1 Positions alternate between Left and Right sides, but are otherwise random.\n"
  1184. "2 Positions alternate between Front and Back, but are otherwise random.\n"
  1185. "3 Rotating clockwise or anticlockwise.\n"
  1186. "4 Random permutations of all 8 channels.\n"
  1187. "5 ... plus all possible pairs of channels.\n"
  1188. "6 ... plus all possible meaningful small and large triangles.\n"
  1189. "7 ... plus square, diamond and all-at-once.\n"
  1190. " In types 4 to 7, all members of perm used before next perm starts.\n"
  1191. "8 Alternate between all-left and all-right.\n"
  1192. "9 Alternate between all-front and all-back.\n"
  1193. "10 Alternate between all-square and all-diamond.\n"
  1194. "11 Rotate triangle formed by lspkrs 2-apart clockwise.\n"
  1195. "12 Rotate triangle formed by lspkrs 3-apart clockwise.\n"
  1196. "13 Rotate triangle formed by lspkrs 2-apart anticlockwise.\n"
  1197. "14 Rotate triangle formed by lspkrs 3-apart anticlockwise.\n");
  1198. }
  1199. } else
  1200. fprintf(stdout,"Unknown option '%s'\n",str);
  1201. return(USAGE_ONLY);
  1202. }
  1203. int usage3(char *str1,char *str2)
  1204. {
  1205. fprintf(stderr,"Insufficient parameters on command line.\n");
  1206. return(USAGE_ONLY);
  1207. }
  1208. /**************************** NEWTEX_PARAM_PREPROCESS *************************/
  1209. int newtex_param_preprocess (int **perm,int **permon,int **permoff,int **superperm,double *minrate,int *maxsteps,dataptr dz)
  1210. {
  1211. int exit_status, chans, configno, imaxnum;
  1212. int n, minsrclen;
  1213. double srate, endsplice, maxrate, maxnum, minnum;
  1214. int partialscnt = dz->itemcnt;
  1215. srate = (double)dz->infile->srate;
  1216. //nyquist = srate/2.0;
  1217. chans = dz->iparam[NTEX_CHANS];
  1218. // Establish end splice length
  1219. dz->iparam[NTEX_DUR] = (int)round(dz->param[NTEX_DUR] * srate);
  1220. if(dz->brksize[NTEX_RATE]) {
  1221. if((exit_status = get_maxvalue_in_brktable(&maxrate,NTEX_RATE,dz))<0)
  1222. return PROGRAM_ERROR;
  1223. if((exit_status = get_minvalue_in_brktable(minrate,NTEX_RATE,dz))<0)
  1224. return PROGRAM_ERROR;
  1225. } else {
  1226. maxrate = dz->param[NTEX_RATE];
  1227. *minrate = dz->param[NTEX_RATE];
  1228. }
  1229. if(maxrate >= dz->param[NTEX_DUR]/2.0) {
  1230. sprintf(errstr,"(max) Rate (%lf) must be less than half duration (%lf).\n",maxrate,dz->param[NTEX_DUR]);
  1231. return(DATA_ERROR);
  1232. }
  1233. if(dz->mode == 2) {
  1234. minsrclen = dz->insams[0];
  1235. for(n=1;n<dz->infilecnt;n++)
  1236. minsrclen = min(minsrclen,dz->insams[n]);
  1237. if(maxrate >= minsrclen/2.0) {
  1238. sprintf(errstr,"(max) Rate (%lf) must be less than half duration of shortest sound (%lf).\n",maxrate,(double)minsrclen/srate);
  1239. return(DATA_ERROR);
  1240. }
  1241. if(dz->brksize[NTEX_LOC]) {
  1242. if((exit_status = get_maxvalue_in_brktable(&maxrate,NTEX_LOC,dz))<0)
  1243. return PROGRAM_ERROR;
  1244. } else
  1245. maxrate = dz->param[NTEX_LOC];
  1246. if(maxrate >= minsrclen) {
  1247. sprintf(errstr,"(max) Locus (%lf) cannot go beyond end of shortest sound (%lf).\n",maxrate,(double)minsrclen/srate);
  1248. return(DATA_ERROR);
  1249. }
  1250. if(dz->brksize[NTEX_AMB]) {
  1251. if((exit_status = get_maxvalue_in_brktable(&maxrate,NTEX_AMB,dz))<0)
  1252. return PROGRAM_ERROR;
  1253. } else
  1254. maxrate = dz->param[NTEX_AMB];
  1255. if(maxrate >= minsrclen/2.0) {
  1256. sprintf(errstr,"(max) Ambitus (%lf) must be less than half duration of shortest sound (%lf).\n",maxrate,(double)minsrclen/srate);
  1257. return(DATA_ERROR);
  1258. }
  1259. if(dz->brksize[NTEX_GST]) {
  1260. if((exit_status = get_maxvalue_in_brktable(&maxrate,NTEX_GST,dz))<0)
  1261. return PROGRAM_ERROR;
  1262. } else
  1263. maxrate = dz->param[NTEX_GST];
  1264. if(maxrate >= minsrclen/2.0) {
  1265. sprintf(errstr,"(max) Step (%lf) must be less than half duration of shortest sound (%lf).\n",maxrate,(double)minsrclen/srate);
  1266. return(DATA_ERROR);
  1267. }
  1268. }
  1269. if(dz->iparam[NTEX_STYPE] > 0) {
  1270. if(*minrate <= dz->param[NTEX_SPLEN] * MS_TO_SECS * 2.0) {
  1271. sprintf(errstr,"(min) Rate (%lf) must be greater than 2 * splice (%lf) For special spatialisation types\n",*minrate,dz->param[NTEX_SPLEN] * MS_TO_SECS * 2.0);
  1272. return(DATA_ERROR);
  1273. }
  1274. } else {
  1275. if(*minrate <= dz->param[NTEX_SPLEN] * MS_TO_SECS) {
  1276. sprintf(errstr,"(min) Rate (%lf) must be greater than splicelength (%lf).\n",*minrate,dz->param[NTEX_SPLEN] * MS_TO_SECS);
  1277. return(DATA_ERROR);
  1278. }
  1279. }
  1280. endsplice = 50.0 * MS_TO_SECS;
  1281. dz->rampbrksize = (int)floor(endsplice * srate);
  1282. if(dz->mode == 1)
  1283. dz->iparam[NTEX_DEL] = (int)round(dz->param[NTEX_DEL] * srate);
  1284. // Pointers into srcs for all transpositions
  1285. /*
  1286. * | |
  1287. * MODE 0 arrays positions
  1288. * mpcnt = all possible transposs, or streams | | |
  1289. * (partials+all transpositions) current
  1290. * frqs|
  1291. * parray |-|-----------------|---------------|-|-|-|----------|----------|
  1292. * |t| left_level | right-level step| | tvarying pno+plevel |
  1293. * |a| mpcnt | mpcnt times | (Mpcnt*2) |
  1294. * |b| | | | | (mpcnt*2)+4| |
  1295. * address 0p|1 (mpcnt)+1 | (mpcnt*2)+2 | |
  1296. * |t| | (mpcnt*2)+1 | |
  1297. * |r| | | | (mpcnt*2)+3 (mpcnt*3)+4|
  1298. * lengths | | maxsteps | maxsteps | |m| | linelen of srcdata
  1299. * |t| |t|p|t|
  1300. * |o| |o|c|o|
  1301. * |t| |t|n|t|
  1302. * |l| |l|t|l|
  1303. * (totl = estimate of no
  1304. * of timesteps used)
  1305. * splicecntr
  1306. * | transpos-order
  1307. * | | switchpos (special spatialisation)
  1308. * | | | infileno associated with stream
  1309. * | | | | itabptr(integer pointer to input buffers) MODE 1 only
  1310. * | | | | | lastloc (MODE 2/3)
  1311. * iparray |-----------------|-----------------|-----------------|-| | | (mpcnt*3)+4
  1312. * | on-off flags | leftmost chan | spo | | | (mpcnt*3)+3
  1313. * | (mpcnt) | (mpcnt) | (mpcnt) | | (mpcnt*3)+2 MODE 2/3 | |
  1314. * | | | | (mpcnt*3)+1 (readpos) special_onoff2
  1315. * address 0 mpcnt mpcnt*2 (mpcnt*3) | |-----------------| |
  1316. * | | | | | | | | (mpcnt*3)+5 | |
  1317. * lengths | maxsteps | maxsteps | maxsteps mpcnt | | | (mpcnt*3)+6 (mpcnt*4)+6
  1318. * | mpcnt | | | | |
  1319. * | | mpcnt | | maxsteps mpcnt
  1320. * (splcntrs = splice counters) | | | mpcnt | | |
  1321. * (spo = orig values of splice counters) | | | | mpcnt
  1322. * (mpcnt = max number of streams) | | | | | mpcnt
  1323. * (maxsteps = total number of timesteps in process)
  1324. */
  1325. dz->temp_sampsize = (partialscnt * 2) + 4; // Remember base of transpos/level data
  1326. // A pointer for every src and every src transposition (this is a float-pointer, interpolating in input buffers)
  1327. if((dz->parray[0] = (double *)malloc(dz->itemcnt * sizeof(double)))==NULL) {
  1328. sprintf(errstr,"INSUFFICIENT MEMORY for sine table pointers.\n");
  1329. return(MEMORY_ERROR);
  1330. }
  1331. // An array for every component on-off markers, every leftmost-chan, every splice-counter-orig-vals, plus actual splice-cntrs + porder
  1332. switch(dz->mode) {
  1333. case(0):
  1334. if((dz->iparray = (int **)malloc(((partialscnt * 3) + 4) * sizeof(int *)))==NULL) {
  1335. sprintf(errstr,"INSUFFICIENT MEMORY for integer arrays.\n");
  1336. return(MEMORY_ERROR);
  1337. }
  1338. break;
  1339. case(1):
  1340. if((dz->iparray = (int **)malloc(((partialscnt * 3) + 5) * sizeof(int *)))==NULL) {
  1341. sprintf(errstr,"INSUFFICIENT MEMORY for integer arrays.\n");
  1342. return(MEMORY_ERROR);
  1343. }
  1344. break;
  1345. case(2):
  1346. if((dz->iparray = (int **)malloc(((partialscnt * 4) + 7) * sizeof(int *)))==NULL) {
  1347. sprintf(errstr,"INSUFFICIENT MEMORY for integer arrays.\n");
  1348. return(MEMORY_ERROR);
  1349. }
  1350. break;
  1351. }
  1352. *maxsteps = ((int)ceil(dz->param[NTEX_DUR]/(*minrate)) * 2) + 4; // SAFETY
  1353. for(n=0;n<partialscnt;n++) {
  1354. // An array of on-off switching vals at steptimes, for every component and component-transposition
  1355. if((dz->iparray[n] = (int *)malloc((*maxsteps) * sizeof(int)))==NULL) {
  1356. sprintf(errstr,"INSUFFICIENT MEMORY for partial on-off marker array %d.\n",n+1); // base address = 0
  1357. return(MEMORY_ERROR);
  1358. }
  1359. // An array of leftmost output channel at steptimes, for every component and component-transposition
  1360. if((dz->iparray[n+partialscnt] = (int *)malloc((*maxsteps) * sizeof(int)))==NULL) {
  1361. sprintf(errstr,"INSUFFICIENT MEMORY to remember leftmost channels for stream %d.\n",n+1); // base address = partialscnt
  1362. return(MEMORY_ERROR);
  1363. }
  1364. // An array of original_vals of splice_counters, at steptimes for every component and component-transposition
  1365. if((dz->iparray[n+(partialscnt*2)] = (int *)malloc((*maxsteps) * sizeof(int)))==NULL) {
  1366. sprintf(errstr,"INSUFFICIENT MEMORY for splice-counters for stream %d.\n",n+1); // base address = partialscnt * 2
  1367. return(MEMORY_ERROR);
  1368. }
  1369. // An array levels (or of left levels), at every steptime, for each component and component-transposition // base address = 1
  1370. if((dz->parray[n+1] = (double *)malloc((*maxsteps) * sizeof(double)))==NULL) {
  1371. sprintf(errstr,"INSUFFICIENT MEMORY left-channel levels for stream %d.\n",n+1);
  1372. return(MEMORY_ERROR);
  1373. }
  1374. // An array of right levels, at every steptime, for each component and component-transposition // base address = partialscnt + 1
  1375. if((dz->parray[n+1+partialscnt] = (double *)malloc((*maxsteps) * sizeof(double)))==NULL) {
  1376. sprintf(errstr,"INSUFFICIENT MEMORY for right-channel levels for stream %d.\n",n+1);
  1377. return(MEMORY_ERROR);
  1378. }
  1379. }
  1380. // An array of steptimes
  1381. if((dz->parray[(partialscnt*2)+1] = (double *)malloc((*maxsteps) * sizeof(double)))==NULL) { // address = (partialscnt * 2) + 1
  1382. sprintf(errstr,"INSUFFICIENT MEMORY for partial step times.\n");
  1383. return(MEMORY_ERROR);
  1384. }
  1385. // An array of current transpositions of partials
  1386. if((dz->parray[(partialscnt*2)+2] = (double *)malloc(partialscnt * sizeof(double)))==NULL) { // address = (partialscnt * 2) + 2
  1387. sprintf(errstr,"INSUFFICIENT MEMORY for transposition data.\n");
  1388. return(MEMORY_ERROR);
  1389. }
  1390. // An array of current spatial positions
  1391. if((dz->parray[(partialscnt*2)+3] = (double *)malloc((*maxsteps) * sizeof(double)))==NULL) { // address = (partialscnt * 2) + 3
  1392. sprintf(errstr,"INSUFFICIENT MEMORY for spatial positions.\n");
  1393. return(MEMORY_ERROR);
  1394. }
  1395. // An array of splice-counters for every component
  1396. if((dz->iparray[partialscnt*3] = (int*)malloc(partialscnt * sizeof(int)))==NULL) { // address = (partialscnt * 3)
  1397. sprintf(errstr,"INSUFFICIENT MEMORY for splice_counters.\n");
  1398. return(MEMORY_ERROR);
  1399. }
  1400. // An array of to remember the component order, for 2nd run
  1401. if((dz->iparray[(partialscnt*3)+1] = (int*)malloc(partialscnt * sizeof(int)))==NULL) { // address = (partialscnt * 3)+1
  1402. sprintf(errstr,"INSUFFICIENT MEMORY to remember component order.\n");
  1403. return(MEMORY_ERROR);
  1404. }
  1405. for(n=0;n<partialscnt;n++) // Store original order
  1406. dz->iparray[(partialscnt*3)+1][n] = n;
  1407. // An array of to remember the switchpos for certain spatial options
  1408. if((dz->iparray[(partialscnt*3)+2] = (int*)malloc((*maxsteps) * sizeof(int)))==NULL) { // address = (partialscnt * 3)+2
  1409. sprintf(errstr,"INSUFFICIENT MEMORY for switching data for spatialisation.\n");
  1410. return(MEMORY_ERROR);
  1411. }
  1412. // An array of to remember the infile associated with each stream
  1413. if((dz->iparray[(partialscnt*3)+3] = (int*)malloc(partialscnt * sizeof(int)))==NULL) { // address = (partialscnt * 3)+3
  1414. sprintf(errstr,"INSUFFICIENT MEMORY to store association between streams and srcs.\n");
  1415. return(MEMORY_ERROR);
  1416. }
  1417. // An array of to store INTEGER pointers into sound buffers, where no transposition happening
  1418. switch(dz->mode) {
  1419. case(2):
  1420. if((dz->iparray[(partialscnt*4)+6] = (int*)malloc(partialscnt * sizeof(int)))==NULL) { // base address = (partialscnt * 4)+6
  1421. sprintf(errstr,"INSUFFICIENT MEMORY for remembering read locations for stream %d.\n",n+1);
  1422. return(MEMORY_ERROR);
  1423. }
  1424. for(n=0;n<partialscnt;n++) {
  1425. if((dz->iparray[n + (partialscnt*3)+6] = (int*)malloc((*maxsteps) * sizeof(int)))==NULL) { // base address = (partialscnt * 3)+6
  1426. sprintf(errstr,"INSUFFICIENT MEMORY for remembering read locations for stream %d.\n",n+1);
  1427. return(MEMORY_ERROR);
  1428. }
  1429. }
  1430. if((dz->iparray[(partialscnt*3)+5] = (int*)malloc(partialscnt * sizeof(int)))==NULL) { // address = (partialscnt * 3)+5
  1431. sprintf(errstr,"INSUFFICIENT MEMORY for storing locus values.\n");
  1432. return(MEMORY_ERROR);
  1433. }
  1434. // fall thro
  1435. case(1):
  1436. if((dz->iparray[(partialscnt*3)+4] = (int*)malloc(partialscnt * sizeof(int)))==NULL) { // address = (partialscnt * 3)+4
  1437. sprintf(errstr,"INSUFFICIENT MEMORY for storing src read pointers.\n");
  1438. return(MEMORY_ERROR);
  1439. }
  1440. break;
  1441. }
  1442. // A permutation array for randomly permuting component, and arrays for sorting these perms
  1443. if((*perm = (int *)malloc(((partialscnt * 2) + 2) * sizeof(int)))==NULL) {
  1444. sprintf(errstr,"NO MEMORY FOR PARTIALS PERMUTATIONS\n");
  1445. return(DATA_ERROR);
  1446. }
  1447. if((*permon = (int *)malloc(partialscnt*sizeof(int)))==NULL) {
  1448. sprintf(errstr,"NO MEMORY FOR PARTIALS PERMUTATIONS\n");
  1449. return(DATA_ERROR);
  1450. }
  1451. if((*permoff = (int *)malloc(partialscnt*sizeof(int)))==NULL) {
  1452. sprintf(errstr,"NO MEMORY FOR PARTIALS PERMUTATIONS\n");
  1453. return(DATA_ERROR);
  1454. }
  1455. // A permutation array for randomly permuting spatial configurations, for certain spatialisation types
  1456. configno = chans;
  1457. configno += (chans * ((chans/2) - 1)) + chans/2;
  1458. configno += chans * 2;
  1459. configno += 3;
  1460. if((*superperm = (int *)malloc(configno*sizeof(int)))==NULL) {
  1461. sprintf(errstr,"NO MEMORY FOR PARTIALS PERMUTATIONS\n");
  1462. return(DATA_ERROR);
  1463. }
  1464. for(n=0;n<dz->itemcnt;n++) // Zero component-table pointers for all partials
  1465. dz->parray[0][n] = 0.0;
  1466. if(dz->param[NTEX_ETIME] + dz->param[NTEX_CTIME] >= dz->param[NTEX_DUR]) {
  1467. sprintf(errstr,"Emerge and Converge times, combined, must be LESS than Output duration.\n");
  1468. return(DATA_ERROR);
  1469. }
  1470. if(dz->brksize[NTEX_NUM]) {
  1471. if((exit_status = get_maxvalue_in_brktable(&maxnum,NTEX_NUM,dz))<0)
  1472. return PROGRAM_ERROR;
  1473. if((exit_status = get_minvalue_in_brktable(&minnum,NTEX_NUM,dz))<0)
  1474. return PROGRAM_ERROR;
  1475. if(minnum < 1) {
  1476. sprintf(errstr,"Value for Number-of-streams in a brkpntfile cannot fall below 1\n");
  1477. return(DATA_ERROR);
  1478. }
  1479. imaxnum = (int)round(maxnum);
  1480. } else {
  1481. imaxnum = dz->iparam[NTEX_NUM];
  1482. if(imaxnum == 0)
  1483. imaxnum = 1;
  1484. }
  1485. switch(dz->mode) {
  1486. case(0):
  1487. if(imaxnum > partialscnt) {
  1488. sprintf(errstr,"Number of streams in play must be <= total number of transpositions in datafile and their octave equivalents (%d)\n",partialscnt);
  1489. return(DATA_ERROR);
  1490. }
  1491. break;
  1492. case(1):
  1493. case(2):
  1494. if(imaxnum > dz->itemcnt - 1) {
  1495. sprintf(errstr,"Number of streams in play must be < number of infiles (%d) times maximum duplication factor (making %d in total)\n",
  1496. dz->infilecnt,dz->itemcnt);
  1497. return(DATA_ERROR);
  1498. }
  1499. break;
  1500. }
  1501. if(dz->iparam[NTEX_EFROM] > dz->iparam[NTEX_CHANS] || dz->iparam[NTEX_CTO] > dz->iparam[NTEX_CHANS]) {
  1502. sprintf(errstr,"Channel to emerge from or converge to must be <= output channel count.\n");
  1503. return(DATA_ERROR);
  1504. }
  1505. if(dz->iparam[NTEX_EFROM] > 0 && dz->param[NTEX_ETIME] == 0.0) {
  1506. fprintf(stdout,"WARNING: Emergence time set to zero: Ignoring emergence channel.\n");
  1507. fflush(stdout);
  1508. dz->iparam[NTEX_EFROM] = 0;
  1509. }
  1510. if(dz->iparam[NTEX_EFROM] == 0 && dz->param[NTEX_ETIME] > 0.0) {
  1511. fprintf(stdout,"WARNING: Emergence channel not set: Ignoring emergence duration.\n");
  1512. fflush(stdout);
  1513. dz->param[NTEX_ETIME] = 0.0;
  1514. }
  1515. if(dz->iparam[NTEX_CTO] > 0 && dz->param[NTEX_CTIME] == 0.0) {
  1516. fprintf(stdout,"WARNING: Convergence time set to zero: Ignoring convergence channel.\n");
  1517. fflush(stdout);
  1518. dz->iparam[NTEX_CTO] = 0;
  1519. }
  1520. if(dz->iparam[NTEX_CTO] == 0 && dz->param[NTEX_CTIME] > 0.0) {
  1521. fprintf(stdout,"WARNING: Convergence channel not set: Ignoring convergence duration.\n");
  1522. fflush(stdout);
  1523. dz->param[NTEX_ETIME] = 0.0;
  1524. }
  1525. dz->param[NTEX_CTIME] = dz->param[NTEX_DUR] - dz->param[NTEX_CTIME];
  1526. if(dz->iparam[NTEX_STYPE] > 0) {
  1527. if(chans != 8) {
  1528. sprintf(errstr,"Special Spatialisation types Only available for 8-channel output.\n");
  1529. return(DATA_ERROR);
  1530. }
  1531. if(dz->iparam[NTEX_EFROM] || dz->iparam[NTEX_CTO]) {
  1532. fprintf(stdout,"WARNING: Emergence/convergence not available with Special Spatialisation types.\n");
  1533. fflush(stdout);
  1534. dz->iparam[NTEX_CTO] = 0;
  1535. dz->iparam[NTEX_EFROM] = 0;
  1536. dz->param[NTEX_ETIME] = 0.0;
  1537. dz->param[NTEX_CTIME] = 0.0;
  1538. }
  1539. if(dz->vflag[NTX_JUMP]) {
  1540. fprintf(stdout,"WARNING: Special Spatialisation types incompatible with Jump flag. Ignoring Jump Flag.\n");
  1541. dz->vflag[NTX_JUMP] = 0;
  1542. fflush(stdout);
  1543. }
  1544. if(dz->iparam[NTEX_STYPE] == SB_ROTATE && dz->param[NTEX_RSPEED] == 0.0) {
  1545. sprintf(errstr,"No rotation speed given for Special Spatialisation type %d, \"Rotation\".\n",SB_ROTATE);
  1546. return(DATA_ERROR);
  1547. }
  1548. if(dz->iparam[NTEX_STYPE] != SB_ROTATE && dz->param[NTEX_RSPEED] > 0.0) {
  1549. sprintf(errstr,"Special Spatialisation type %d, \"Rotation\" not set: Ignoring Rotation Speed.\n",SB_ROTATE);
  1550. fflush(stdout);
  1551. }
  1552. }
  1553. return(FINISHED);
  1554. }
  1555. /******************************** NEWTEX *********************************/
  1556. int newtex(int *perm,int *permon,int *permoff,int *superperm, double minrate,int maxsteps,dataptr dz)
  1557. {
  1558. int exit_status, n, chans, max_partials_cnt = 0, partials_in_play, rmost, k, m, terminate = 0, llmst = 0;
  1559. int loindex, hiindex, stepcnt = 0, totaloutsamps, base_sampcnt, sublen = 0, sndlen = 0, thisdur = 0;
  1560. double loval, hival, valdiff, timefrac, val = 0.0, valr = 0.0, vall = 0.0,/* level,*/ maxval = 1.0, pos = 0.0;
  1561. float *obuf, **ibuf;
  1562. double srate = (double)dz->infile->srate, thisstep, rangetop, posstep = 0.0;
  1563. int partialcnt = dz->itemcnt, total_partialcnt = 0, splen = 0, spacetyp = dz->iparam[NTEX_STYPE];
  1564. double *tabptr = NULL;
  1565. double **llev = NULL, **rlev = NULL, **transval = NULL /*, **translev = NULL*/;
  1566. double *steptimes = NULL, *pvals = NULL, *position = NULL;
  1567. int **onoff = NULL, **lmost = NULL, **origspl = NULL, *splcntr = NULL, *splordr = NULL, *swpos = NULL, *strmsrc = NULL;
  1568. int *itabptr = NULL, *lastloc = NULL, **loc = NULL, *special_onoff2 = NULL;
  1569. int inendsplice, instartsplice, total_samps_synthed = 0, jlmost = 0, switchpos = 0;
  1570. int configcnt = 0, configno = 0, l_most = 0, r_most = 0, special_onoff = 0, indownsplice = 0;
  1571. int sampcnt = 0, startspliceend = dz->rampbrksize, endsplicestart = dz->iparam[NTEX_DUR] - dz->rampbrksize, samps_read, here;
  1572. double time = 0.0, spliceincr, spliceval, localspliceval, normaliser, nexttime = -1.0, leftgain = 0.0, rightgain = 0.0;
  1573. int grain = 0;
  1574. if((ibuf = (float **)malloc(dz->infilecnt*sizeof(float *)))==NULL) {
  1575. sprintf(errstr,"NO MEMORY INPUT BUFFER POINTERS.\n");
  1576. return(DATA_ERROR);
  1577. }
  1578. for(n=0;n<dz->infilecnt;n++)
  1579. ibuf[n] = dz->sampbuf[n];
  1580. obuf = dz->sampbuf[n];
  1581. spliceincr = 1.0/(double)dz->rampbrksize;
  1582. spliceval = 0.0;
  1583. instartsplice = 1;
  1584. inendsplice = 0;
  1585. chans = dz->iparam[NTEX_CHANS];
  1586. totaloutsamps = dz->iparam[NTEX_DUR];
  1587. totaloutsamps *= chans;
  1588. if(spacetyp > 0) {
  1589. switch(spacetyp) {
  1590. case(SB_SUPERSPACE4): // Square, diamond and All-at-once
  1591. configno = 3; // For 8 chan = 3 + (8*2) + [((8*(4-1))+4] + 8 = 3 + 16 + 28 + 8 = 55
  1592. // fall thro
  1593. case(SB_SUPERSPACE3): // all possible meaningful small and large triangles
  1594. configno += chans * 2;
  1595. // fall thro
  1596. case(SB_SUPERSPACE2): // all possible pairs
  1597. configno += (chans * ((chans/2) - 1)) + chans/2;
  1598. // fall thro
  1599. case(SB_SUPERSPACE): // all single chans
  1600. configno += chans;
  1601. break;
  1602. }
  1603. }
  1604. endsplicestart = dz->iparam[NTEX_DUR] - (int)floor(50 * MS_TO_SECS * srate); // Force long splice at end
  1605. endsplicestart *= chans;
  1606. startspliceend = (int)floor(50 * MS_TO_SECS * srate); // Force int splice at start
  1607. startspliceend *= chans;
  1608. instartsplice = 1;
  1609. inendsplice = 0;
  1610. splen = (int)round(dz->param[NTEX_SPLEN] * MS_TO_SECS * srate);
  1611. total_partialcnt = partialcnt;
  1612. /******************************** ARRAYS ********************************
  1613. *
  1614. * MODE 0 arrays | |
  1615. * pcnt = partialcnt mpcnt = maxpartialcnt positions
  1616. * (partials+all transpositions) | | |
  1617. * | | current
  1618. * tabptrs frqs|
  1619. * parray |-|-----------------|---------------|-|-|-|----------|----------|
  1620. * | | left_level | right-level step| | transpos | level |
  1621. * | | mpcnt | mpcnt times | mpcnt | mpcnt |
  1622. * | | | | | | | | |
  1623. * | | | (mpcnt*2)+1 | |
  1624. * address 0 1 (mpcnt)+1 | (mpcnt*2)+2 (mpcnt*3)+4|
  1625. * | | | | | (mpcnt*2)+3 | |
  1626. * | | | | | | (mpcnt*2)+4| |
  1627. * | | | | | | | |
  1628. * lengths | | maxsteps | maxsteps | |m| | linelen | linelen |
  1629. * |t| |t|p|t|of srcdata|of srcdata|
  1630. * |o| |o|c|o| | |
  1631. * |t| |t|n|t| | |
  1632. * |l| |l|t|l| | |
  1633. * (totl = estimate of no of timesteps used)
  1634. * (mpcnt = total number of streams)
  1635. * (maxsteps = total number of timesteps)
  1636. * splicecntr
  1637. * | transpos-order
  1638. * | | switchpos (special spatialisation)
  1639. * | | | infileno associated with stream
  1640. * | | | | itabptr(integer pointer to input buffers) MODE 1 only
  1641. * | | | | | |
  1642. * iparray |-----------------|-----------------|-----------------|-| | | (mpcnt*3)+4
  1643. * | on-off flags | leftmost chan | spo | | | (mpcnt*3)+3
  1644. * | (mpcnt) | (mpcnt) | (mpcnt) | | (mpcnt*3)+2
  1645. * | | | | (mpcnt*3)+1 MODE 2/3 (readpos)
  1646. * address 0 mpcnt mpcnt*2 (mpcnt*3) | |-----------------|
  1647. * | | | | | | | | (mpcnt*3)+5 |
  1648. * lengths | maxsteps | maxsteps | maxsteps mpcnt | | | (mpcnt*3)+6 |
  1649. * | mpcnt | | | |
  1650. * | | mpcnt | | maxsteps |
  1651. * (splcntrs = splice counters) | | | mpcnt | |
  1652. * (spo = orig values of splice counters) | | | | mpcnt
  1653. * (mpcnt = max number of streams) | | | | | mpcnt
  1654. * (maxsteps = total number of timesteps in process)
  1655. */
  1656. llev = dz->parray + 1;
  1657. rlev = dz->parray + partialcnt + 1;
  1658. tabptr = dz->parray[0];
  1659. steptimes = dz->parray[(partialcnt * 2) + 1];
  1660. pvals = dz->parray[(partialcnt * 2) + 2];
  1661. position = dz->parray[(partialcnt * 2) + 3];
  1662. onoff = dz->iparray;
  1663. lmost = dz->iparray + partialcnt;
  1664. if(dz->mode == 0) {
  1665. transval = dz->parray + (partialcnt * 2) + 4;
  1666. // translev = dz->parray + (partialcnt * 3) + 4;
  1667. }
  1668. origspl = dz->iparray + (partialcnt * 2);
  1669. splcntr = dz->iparray[partialcnt * 3];
  1670. splordr = dz->iparray[(partialcnt * 3) + 1];
  1671. swpos = dz->iparray[(partialcnt * 3) + 2];
  1672. strmsrc = dz->iparray[(partialcnt * 3) + 3];
  1673. if(dz->mode == 1 || dz->mode == 2)
  1674. itabptr = dz->iparray[(partialcnt * 3) + 4];
  1675. if(dz->mode == 2)
  1676. special_onoff2 = dz->iparray[(partialcnt * 4) + 6];
  1677. for(n=0;n < partialcnt;n++) {
  1678. onoff[n][0] = S_OFF;// all partials initially flagged off
  1679. lmost[n][0] = 0; // all leftmost-outchan initially set to left - SAFETY
  1680. origspl[n][0] = 0; // all original-settings of splice-counters to zero
  1681. splcntr[n] = 0; // all splicecounters initially set to zero - SAFETY
  1682. llev[n][0] = 0.0; // all partial gains initially set to zero - SAFETY
  1683. rlev[n][0] = 0.0;
  1684. }
  1685. n = 0;
  1686. k = 0;
  1687. while(n < partialcnt) {
  1688. strmsrc[n] = k;
  1689. if(++k >= dz->infilecnt)
  1690. k = 0;
  1691. n++;
  1692. }
  1693. switch(dz->mode) {
  1694. case(1): // Set delays between parallel streams
  1695. k = partialcnt/dz->infilecnt;
  1696. for(n=0;n < dz->infilecnt;n++) { // Where more than 1 use of a file
  1697. sublen = dz->iparam[NTEX_DEL];
  1698. for(m=0;m < k; m++) {
  1699. itabptr[n + (m * dz->infilecnt)] = sublen * m; // Set delays between read-ptrs in identical streams
  1700. itabptr[n + (m * dz->infilecnt)] += (int)floor(drand48() * sublen/2); // Randomise delays somewhat
  1701. itabptr[n + (m * dz->infilecnt)] = itabptr[n + (m * dz->infilecnt)] % dz->insams[strmsrc[n]];
  1702. }
  1703. }
  1704. break;
  1705. case(2):
  1706. grain = (int)round(NTEX_GRAIN * srate);
  1707. lastloc = dz->iparray[(partialcnt*3)+5];
  1708. loc = dz->iparray + (partialcnt*3)+6;
  1709. if((exit_status = read_values_from_all_existing_brktables(time,dz))<0)
  1710. return exit_status;
  1711. dz->iparam[NTEX_AMB] = (int)round(dz->param[NTEX_AMB] * srate);
  1712. dz->iparam[NTEX_LOC] = (int)round(dz->param[NTEX_LOC] * srate);
  1713. dz->iparam[NTEX_GST] = (int)round(dz->param[NTEX_GST] * srate);
  1714. for(n=0;n < partialcnt;n++) {
  1715. loc[n][0] = dz->iparam[NTEX_LOC];
  1716. for(m=1;m < maxsteps;m++)
  1717. loc[n][m] = 0;
  1718. special_onoff2[n] = 0;
  1719. }
  1720. here = dz->iparam[NTEX_LOC];
  1721. break;
  1722. }
  1723. fprintf(stdout,"INFO: Reading input sound.\n");
  1724. fflush(stdout);
  1725. for(n=0;n<dz->infilecnt;n++) {
  1726. if((samps_read = fgetfbufEx(dz->sampbuf[n], dz->insams[n],dz->ifd[n],0))<0) {
  1727. sprintf(errstr,"Sound read error with input soundfile %d: %s\n",n+1,sferrstr());
  1728. return(SYSTEM_ERROR);
  1729. }
  1730. }
  1731. nexttime = 0.0; // initialise "nexttime" to trigger 1st setting of partials
  1732. steptimes[0] = nexttime;// initial steptime set to zero
  1733. stepcnt = 0;
  1734. fprintf(stdout,"INFO: First pass: assessing level.\n");
  1735. fflush(stdout);
  1736. memset((char *)obuf,0,dz->buflen * sizeof(float));
  1737. while(total_samps_synthed < totaloutsamps) {
  1738. time = (double)(total_samps_synthed/chans)/srate;
  1739. if((exit_status = read_values_from_all_existing_brktables(time,dz))<0)
  1740. return exit_status;
  1741. if(dz->mode == 2) {
  1742. dz->iparam[NTEX_AMB] = (int)round(dz->param[NTEX_AMB] * srate);
  1743. dz->iparam[NTEX_LOC] = (int)round(dz->param[NTEX_LOC] * srate);
  1744. dz->iparam[NTEX_GST] = (int)round(dz->param[NTEX_GST] * srate);
  1745. }
  1746. if(time >= steptimes[stepcnt]) { // If we've reached the next partials-change time
  1747. if(sloom && ((stepcnt % 200) == 0)) {
  1748. fprintf(stdout,"INFO: at %.1lf secs\n",time);
  1749. fflush(stdout);
  1750. }
  1751. if(spacetyp > 0) {
  1752. if(configcnt == 0)
  1753. rndintperm(superperm,configno);
  1754. if(++configcnt >= configno)
  1755. configcnt = 0;
  1756. }
  1757. thisstep = (drand48() * 2.0) - 1.0; // -1 to 1
  1758. thisstep *= dz->param[NTEX_RATE]/2.0; // -(1/2) rate to +(1/2) rate
  1759. thisstep += dz->param[NTEX_RATE]; // (1/2) rate to 1+(1/2) rate
  1760. nexttime = time + thisstep;
  1761. if(time == 0.0 && dz->mode >= 2) {
  1762. for(n=0;n < partialcnt;n++) {
  1763. here = dz->iparam[NTEX_LOC];
  1764. thisdur = (int)round(nexttime * srate);
  1765. sndlen = dz->insams[strmsrc[n]];
  1766. lastloc = loc[n];
  1767. get_drunkpos(&here,thisdur,sndlen,grain,n,lastloc,stepcnt,dz);
  1768. loc[n][stepcnt] = here;
  1769. itabptr[n] = loc[n][stepcnt];
  1770. }
  1771. }
  1772. stepcnt++;
  1773. if(spacetyp == SB_ROTATE)
  1774. posstep = thisstep * dz->param[NTEX_RSPEED] * chans;
  1775. if(stepcnt >= maxsteps - 1) { // If we run out of memory (as steps have random length) despite safety margin
  1776. terminate = 1; // Force all partials to turn off, and terminate at end of fade
  1777. totaloutsamps = total_samps_synthed + (splen * chans);
  1778. }
  1779. steptimes[stepcnt] = nexttime;
  1780. // Find current value of all partials, + sort to ascending order
  1781. if(dz->mode == 0) {
  1782. get_current_partial_vals(time,pvals,total_partialcnt,dz);
  1783. sort_partials_into_ascending_frq_order(total_partialcnt,pvals,tabptr,llev,rlev,onoff,lmost,origspl,splordr,strmsrc,dz);
  1784. }
  1785. // FIND THE RANGE OF PARTIALS WHICH CAN BE USED
  1786. if(terminate) { // TURN EVERYTHING OFF!!
  1787. for(n=0;n<total_partialcnt;n++) {
  1788. onoff[n][stepcnt] = S_OFF;
  1789. if(onoff[n][stepcnt-1] == S_ON) {
  1790. origspl[n][stepcnt] = splen; // Partial is switched off
  1791. splcntr[n] = splen; // Set up dnsplice, retaining previous level
  1792. llev[n][stepcnt] = llev[n][stepcnt-1];
  1793. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  1794. rlev[n][stepcnt] = rlev[n][stepcnt-1];
  1795. } else if(onoff[n][stepcnt-1] == S_OFF) {
  1796. origspl[n][stepcnt] = 0; // Partial already OFF
  1797. splcntr[n] = 0; // SAFETY
  1798. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  1799. }
  1800. }
  1801. } else {
  1802. switch(dz->mode) {
  1803. case(0):
  1804. rangetop = dz->param[NTEX_MAX] * dz->scalefact;
  1805. for(n = 0;n<total_partialcnt;n++) {
  1806. if(pvals[n] >= rangetop) // Find max partial we can use
  1807. break;
  1808. }
  1809. max_partials_cnt = n+1; // Max range of partials-and-transpositions we might use
  1810. max_partials_cnt = min(max_partials_cnt,total_partialcnt); // FAILSAFE !!
  1811. break;
  1812. case(1):
  1813. case(2):
  1814. rangetop = dz->param[NTEX_MAX];
  1815. max_partials_cnt = (int)ceil(rangetop) * dz->infilecnt;
  1816. break;
  1817. }
  1818. // P-and-ts we'll actually use at this moment (random)
  1819. if(dz->iparam[NTEX_NUM] > 0)
  1820. partials_in_play = min(dz->iparam[NTEX_NUM],max_partials_cnt);
  1821. else
  1822. partials_in_play = (int)floor(drand48() * (double)max_partials_cnt) + 1;
  1823. // If Jump flag set, do spatialisation for ALL partials FIRST
  1824. special_onoff = 0;
  1825. if(dz->vflag[NTX_JUMP]) {
  1826. if(dz->iparam[NTEX_EFROM] && (time < dz->param[NTEX_ETIME]))
  1827. pos = emergepos(dz->iparam[NTEX_EFROM],chans,time,dz->param[NTEX_ETIME]);
  1828. else if(dz->iparam[NTEX_CTO] && (time > dz->param[NTEX_CTIME]))
  1829. pos = convergepos(dz->iparam[NTEX_CTO],chans,time,dz->param[NTEX_CTIME],dz->param[NTEX_DUR]);
  1830. else
  1831. pos = chans * drand48();
  1832. jlmost = (int)floor(pos);
  1833. pos -= (double)jlmost;
  1834. pos = (pos * 2.0) - 1.0;
  1835. pancalc(pos,&leftgain,&rightgain);
  1836. } else if(spacetyp > 0) {
  1837. spacebox(&pos,&switchpos,posstep,chans,spacetyp,configno,configcnt,superperm);
  1838. position[stepcnt] = pos;
  1839. swpos[stepcnt] = switchpos;
  1840. if((position[stepcnt] != position[stepcnt-1]) || (swpos[stepcnt] != swpos[stepcnt-1]))
  1841. special_onoff = 1; // Where partial changes position, will need to fade-out then refade-in
  1842. }
  1843. // Randomly-> CHOOSE PARTIALS ON or OFF, ESTABLISH RELATIVE LEVEL, SET SPATIAL POSITION (if flagged)
  1844. switch(dz->mode) {
  1845. case(0):
  1846. case(1):
  1847. if(partials_in_play == max_partials_cnt) { // If partials fill available range
  1848. for(n=0;n<partials_in_play;n++) { // All partials in range are on
  1849. onoff[n][stepcnt] = S_ON;
  1850. if(onoff[n][stepcnt-1] == S_OFF) { // If previously off
  1851. origspl[n][stepcnt] = splen; // Mark as fade-up
  1852. splcntr[n] = splen; // Set splice-counter to count back down to zero
  1853. llev[n][stepcnt] = (drand48() * 0.5) + 0.5; // Set new (rand)level [llev stands in for mono level]
  1854. if(spacetyp == 0) {
  1855. if(dz->vflag[NTX_JUMP]) { // If Jump flag in use, leftmost chan and levels already set
  1856. lmost[n][stepcnt] = jlmost;
  1857. rlev[n][stepcnt] = llev[n][stepcnt] * rightgain;
  1858. llev[n][stepcnt] *= leftgain;
  1859. } else { // Else create position for each individual partial
  1860. if(dz->iparam[NTEX_EFROM] && (time < dz->param[NTEX_ETIME]))
  1861. pos = emergepos(dz->iparam[NTEX_EFROM],chans,time,dz->param[NTEX_ETIME]);
  1862. else if(dz->iparam[NTEX_CTO] && (time > dz->param[NTEX_CTIME]))
  1863. pos = convergepos(dz->iparam[NTEX_CTO],chans,time,dz->param[NTEX_CTIME],dz->param[NTEX_DUR]);
  1864. else
  1865. pos = chans * drand48();// Create spatial position at random (range 0 - chans)
  1866. lmost[n][stepcnt] = (int)floor(pos); // Find leftmost lspkr
  1867. pos -= (double)lmost[n][stepcnt]; // Range 0-1
  1868. pos = (pos * 2.0) - 1.0; // Range (-1 to 1)
  1869. pancalc(pos,&leftgain,&rightgain); // Calc relative levels of left and right signals
  1870. rlev[n][stepcnt] = llev[n][stepcnt] * rightgain;
  1871. llev[n][stepcnt] *= leftgain; // Readjust output levels
  1872. }
  1873. } else {
  1874. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  1875. rlev[n][stepcnt] = 0.0;
  1876. }
  1877. } else { // Else, already on
  1878. llev[n][stepcnt] = llev[n][stepcnt-1]; // Retain previous level(s)
  1879. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  1880. rlev[n][stepcnt] = rlev[n][stepcnt-1];
  1881. if(special_onoff) {
  1882. splcntr[n] = splen * 2;
  1883. origspl[n][stepcnt] = splen * 2;
  1884. } else {
  1885. origspl[n][stepcnt] = 0;
  1886. splcntr[n] = 0; // SAFETY
  1887. }
  1888. }
  1889. }
  1890. while(n < total_partialcnt) { // For all remaining (unused) partials
  1891. onoff[n][stepcnt] = S_OFF;
  1892. if(onoff[n][stepcnt-1] == S_ON) { // If partial was on
  1893. origspl[n][stepcnt] = splen; // Mark it as fading out
  1894. splcntr[n] = splen; // Set splice-counter to count down to zero
  1895. llev[n][stepcnt] = llev[n][stepcnt-1];
  1896. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  1897. rlev[n][stepcnt] = rlev[n][stepcnt-1];
  1898. } else { // Else it was previously off
  1899. origspl[n][stepcnt] = 0;
  1900. splcntr[n] = 0; // SAFETY
  1901. origspl[n][stepcnt] = 0;
  1902. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  1903. }
  1904. n++;
  1905. }
  1906. } else {
  1907. rndintperm(perm,max_partials_cnt); // Randomly permute all possible transposs
  1908. if(dz->vflag[NTX_X]) // If Exclusive, Force currently OFF-partials to top of list
  1909. xclusive(perm,permon,permoff,max_partials_cnt,partials_in_play,onoff,stepcnt);
  1910. for(n=0;n<partials_in_play;n++) // Switch first p_in_p partials in perm, ON
  1911. onoff[perm[n]][stepcnt] = S_ON;
  1912. while(n < max_partials_cnt) { // and switch remainder of those in range off
  1913. onoff[perm[n]][stepcnt] = S_OFF;
  1914. n++;
  1915. }
  1916. while(n < total_partialcnt) { // and switch remainder off
  1917. onoff[n][stepcnt] = S_OFF;
  1918. n++;
  1919. }
  1920. // ALGO ASSUMES THAT, BY THE TIME WE REACH NEXT STEP, splice has ended
  1921. for(n=0;n<total_partialcnt;n++) { // Switch first p_in_p partials in perm, ON
  1922. if(onoff[n][stepcnt] == S_ON) {
  1923. if(onoff[n][stepcnt-1] == S_ON) { // Partial remains on
  1924. llev[n][stepcnt] = llev[n][stepcnt-1];
  1925. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  1926. rlev[n][stepcnt] = rlev[n][stepcnt-1];
  1927. if(special_onoff) {
  1928. origspl[n][stepcnt] = splen * 2;
  1929. splcntr[n] = splen * 2;
  1930. } else {
  1931. origspl[n][stepcnt] = 0;
  1932. splcntr[n] = 0; // SAFETY
  1933. }
  1934. } else if(onoff[n][stepcnt-1] == S_OFF) {
  1935. origspl[n][stepcnt] = splen;
  1936. splcntr[n] = splen; // Partial is switched on
  1937. llev[n][stepcnt] = (drand48() * 0.5) + 0.5; // Set new (rand)level
  1938. if(spacetyp == 0) {
  1939. if(dz->vflag[NTX_JUMP]) { // If Jump flag in use, leftmost chan and levels already set
  1940. lmost[n][stepcnt] = jlmost;
  1941. rlev[n][stepcnt] = llev[n][stepcnt] * rightgain;
  1942. llev[n][stepcnt] *= leftgain;
  1943. } else { // Else create position for each individual partial
  1944. if(dz->iparam[NTEX_EFROM] && (time < dz->param[NTEX_ETIME]))
  1945. pos = emergepos(dz->iparam[NTEX_EFROM],chans,time,dz->param[NTEX_ETIME]);
  1946. else if(dz->iparam[NTEX_CTO] && (time > dz->param[NTEX_CTIME]))
  1947. pos = convergepos(dz->iparam[NTEX_CTO],chans,time,dz->param[NTEX_CTIME],dz->param[NTEX_DUR]);
  1948. else
  1949. pos = chans * drand48();
  1950. lmost[n][stepcnt] = (int)floor(pos);
  1951. pos -= (double)lmost[n][stepcnt];
  1952. pos = (pos * 2.0) - 1.0;
  1953. pancalc(pos,&leftgain,&rightgain);
  1954. rlev[n][stepcnt] = llev[n][stepcnt] * rightgain;
  1955. llev[n][stepcnt] *= leftgain;
  1956. }
  1957. } else {
  1958. rlev[n][stepcnt] = 0.0;
  1959. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  1960. }
  1961. }
  1962. } else { // Marked as OFF
  1963. if(onoff[n][stepcnt-1] == S_ON) {
  1964. origspl[n][stepcnt] = splen; // Partial is switched off
  1965. splcntr[n] = splen; // Set up dnsplice, retaining previous level
  1966. llev[n][stepcnt] = llev[n][stepcnt-1];
  1967. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  1968. rlev[n][stepcnt] = rlev[n][stepcnt-1];
  1969. } else if(onoff[n][stepcnt-1] == S_OFF) {
  1970. origspl[n][stepcnt] = 0; // Partial already OFF
  1971. splcntr[n] = 0; // SAFETY
  1972. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  1973. }
  1974. }
  1975. }
  1976. }
  1977. break;
  1978. case(2):
  1979. rndintperm(perm,max_partials_cnt); // Randomly permute all possible transposs
  1980. if(dz->vflag[NTX_X]) // If Exclusive, Force currently OFF-partials to top of list
  1981. xclusive(perm,permon,permoff,max_partials_cnt,partials_in_play,onoff,stepcnt);
  1982. for(n=0;n<partials_in_play;n++) // Switch first p_in_p partials in perm, ON
  1983. onoff[perm[n]][stepcnt] = S_ON;
  1984. while(n < max_partials_cnt) { // and switch remainder of those in range off
  1985. onoff[perm[n]][stepcnt] = S_OFF;
  1986. n++;
  1987. }
  1988. while(n < total_partialcnt) { // and switch remainder off
  1989. onoff[n][stepcnt] = S_OFF;
  1990. n++;
  1991. }
  1992. // ALGO ASSUMES THAT, BY THE TIME WE REACH NEXT STEP, splice has ended
  1993. for(n=0;n<total_partialcnt;n++) { // Switch first p_in_p partials in perm, ON
  1994. if(onoff[n][stepcnt] == S_ON) {
  1995. if(onoff[n][stepcnt-1] == S_ON) {
  1996. llev[n][stepcnt] = llev[n][stepcnt-1];
  1997. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  1998. rlev[n][stepcnt] = rlev[n][stepcnt-1];
  1999. origspl[n][stepcnt] = splen * 2;
  2000. splcntr[n] = splen * 2; // Fade out/in in initiated
  2001. } else {
  2002. origspl[n][stepcnt] = splen;
  2003. splcntr[n] = splen; // Partial is switched on
  2004. llev[n][stepcnt] = (drand48() * 0.5) + 0.5; // Set new (rand)level
  2005. if(spacetyp == 0) {
  2006. if(dz->vflag[NTX_JUMP]) { // If Jump flag in use, leftmost chan and levels already set
  2007. lmost[n][stepcnt] = jlmost;
  2008. rlev[n][stepcnt] = llev[n][stepcnt] * rightgain;
  2009. llev[n][stepcnt] *= leftgain;
  2010. } else { // Else create position for each individual partial
  2011. if(dz->iparam[NTEX_EFROM] && (time < dz->param[NTEX_ETIME]))
  2012. pos = emergepos(dz->iparam[NTEX_EFROM],chans,time,dz->param[NTEX_ETIME]);
  2013. else if(dz->iparam[NTEX_CTO] && (time > dz->param[NTEX_CTIME]))
  2014. pos = convergepos(dz->iparam[NTEX_CTO],chans,time,dz->param[NTEX_CTIME],dz->param[NTEX_DUR]);
  2015. else
  2016. pos = chans * drand48();
  2017. lmost[n][stepcnt] = (int)floor(pos);
  2018. pos -= (double)lmost[n][stepcnt];
  2019. pos = (pos * 2.0) - 1.0;
  2020. pancalc(pos,&leftgain,&rightgain);
  2021. rlev[n][stepcnt] = llev[n][stepcnt] * rightgain;
  2022. llev[n][stepcnt] *= leftgain;
  2023. }
  2024. } else {
  2025. rlev[n][stepcnt] = 0.0;
  2026. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  2027. }
  2028. }
  2029. } else { // Marked as OFF
  2030. if(onoff[n][stepcnt-1] == S_ON) {
  2031. origspl[n][stepcnt] = splen; // Partial is switched off
  2032. splcntr[n] = splen; // Set up dnsplice, retaining previous level
  2033. llev[n][stepcnt] = llev[n][stepcnt-1];
  2034. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  2035. rlev[n][stepcnt] = rlev[n][stepcnt-1];
  2036. } else if(onoff[n][stepcnt-1] == S_OFF) {
  2037. origspl[n][stepcnt] = 0; // Partial already OFF
  2038. splcntr[n] = 0; // SAFETY
  2039. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  2040. }
  2041. }
  2042. }
  2043. break;
  2044. }
  2045. }
  2046. }
  2047. // USING THE ON/OFF, RELATIVE LEVEL, SPLICING, AND SPATIALISATION INFO, WRITE VARIOUS PARTIALS
  2048. base_sampcnt = sampcnt;
  2049. for(n=0;n<total_partialcnt;n++) {
  2050. sampcnt = base_sampcnt;
  2051. if(onoff[n][stepcnt]) { // If partial is NOW on
  2052. switch(dz->mode) {
  2053. case(0):
  2054. loindex = (int)floor(tabptr[n]); // Read from srctable, using partial-increment
  2055. hiindex = loindex + 1;
  2056. if(hiindex >= dz->insams[0])
  2057. hiindex -= dz->insams[0];
  2058. loval = ibuf[0][loindex];
  2059. hival = ibuf[0][hiindex];
  2060. valdiff = hival - loval;
  2061. timefrac = tabptr[n] - (double)loindex;
  2062. val = loval + (valdiff * timefrac);
  2063. // level = read_level(n,time,dz); // Read corresponding level
  2064. break;
  2065. case(1):
  2066. case(2):
  2067. val = ibuf[strmsrc[n]][itabptr[n]];
  2068. // level = 1.0;
  2069. break;
  2070. }
  2071. indownsplice = 0;
  2072. if(splcntr[n] > 0) { // Get any splice contribution
  2073. if(splcntr[n] > splen) { // This indicates an OFF/ON splice
  2074. if(dz->mode == 2 && splcntr[n] == 2 * splen)
  2075. special_onoff2[n] = 1;
  2076. localspliceval = (double)(splcntr[n] - splen)/(double)splen;
  2077. indownsplice = 1; // Down-splice
  2078. } else {
  2079. if(dz->mode == 2 && splcntr[n] == splen && special_onoff2[n])
  2080. special_onoff2[n] = 0;
  2081. if(dz->mode == 2 && splcntr[n] == splen) { // If we're JUST in an on splice ... only now get new levels and locus
  2082. llev[n][stepcnt] = (drand48() * 0.5) + 0.5; // Set new (rand)level
  2083. if(spacetyp == 0) {
  2084. if(dz->vflag[NTX_JUMP]) { // If Jump flag in use, leftmost chan and levels already set
  2085. lmost[n][stepcnt] = jlmost;
  2086. rlev[n][stepcnt] = llev[n][stepcnt] * rightgain;
  2087. llev[n][stepcnt] *= leftgain;
  2088. } else { // Else create position for each individual partial
  2089. if(dz->iparam[NTEX_EFROM] && (time < dz->param[NTEX_ETIME]))
  2090. pos = emergepos(dz->iparam[NTEX_EFROM],chans,time,dz->param[NTEX_ETIME]);
  2091. else if(dz->iparam[NTEX_CTO] && (time > dz->param[NTEX_CTIME]))
  2092. pos = convergepos(dz->iparam[NTEX_CTO],chans,time,dz->param[NTEX_CTIME],dz->param[NTEX_DUR]);
  2093. else
  2094. pos = chans * drand48();
  2095. lmost[n][stepcnt] = (int)floor(pos);
  2096. pos -= (double)lmost[n][stepcnt];
  2097. pos = (pos * 2.0) - 1.0;
  2098. pancalc(pos,&leftgain,&rightgain);
  2099. rlev[n][stepcnt] = llev[n][stepcnt] * rightgain;
  2100. llev[n][stepcnt] *= leftgain;
  2101. }
  2102. } else {
  2103. rlev[n][stepcnt] = 0.0;
  2104. lmost[n][stepcnt] = lmost[n][stepcnt-1];
  2105. }
  2106. here = dz->iparam[NTEX_LOC];
  2107. thisdur = (int)round(steptimes[stepcnt] - steptimes[stepcnt-1]);
  2108. sndlen = dz->insams[strmsrc[n]];
  2109. lastloc[n] = loc[n][stepcnt-1];
  2110. get_drunkpos(&here,thisdur,sndlen,grain,n,lastloc,stepcnt,dz);
  2111. loc[n][stepcnt] = here;
  2112. itabptr[n] = loc[n][stepcnt];
  2113. }
  2114. indownsplice = 0; // Up-splice
  2115. localspliceval = (double)(splen - splcntr[n])/(double)splen;
  2116. }
  2117. val *= localspliceval; // Upfade, splcntr falling, splen-splcntr rising
  2118. splcntr[n]--; // Advance splicecnt towards zero
  2119. } else if(dz->mode == 2)
  2120. special_onoff2[n] = 0;
  2121. if(spacetyp > 0) {
  2122. if(indownsplice) {
  2123. pos = position[stepcnt-1];
  2124. switchpos = swpos[stepcnt-1];
  2125. spacebox_apply(pos,llev[n][stepcnt-1],chans,&l_most,&r_most,&valr,&vall,spacetyp);
  2126. } else {
  2127. pos = position[stepcnt];
  2128. switchpos = swpos[stepcnt];
  2129. spacebox_apply(pos,llev[n][stepcnt],chans,&l_most,&r_most,&valr,&vall,spacetyp);
  2130. }
  2131. valr = val * valr;
  2132. val = val * vall;
  2133. } else { // If spatialisation, get spatial contributions
  2134. valr = val * rlev[n][stepcnt];
  2135. val *= llev[n][stepcnt];
  2136. }
  2137. if(spacetyp > 0) {
  2138. output_special_spatialisation_sample(obuf,sampcnt,switchpos,chans,val,valr,l_most,r_most,spacetyp);
  2139. sampcnt += chans;
  2140. } else {
  2141. rmost = (lmost[n][stepcnt] + 1) % chans;
  2142. for(k = 0;k< chans;k++) {
  2143. if(k == lmost[n][stepcnt]) // Add output only to the 2 relevant channels
  2144. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  2145. else if(k == rmost)
  2146. obuf[sampcnt] = (float)(obuf[sampcnt] + valr);
  2147. sampcnt++;
  2148. }
  2149. }
  2150. } else { // Partial is OFF
  2151. if(splcntr[n] > 0) { // BUT IF its still a fade-out, Get any splice contribution
  2152. switch(dz->mode) {
  2153. case(0):
  2154. loindex = (int)floor(tabptr[n]); // Read from srctable, using partial-increment
  2155. hiindex = loindex + 1;
  2156. if(hiindex >= dz->insams[0])
  2157. hiindex -= dz->insams[0];
  2158. loval = ibuf[0][loindex];
  2159. hival = ibuf[0][hiindex];
  2160. valdiff = hival - loval;
  2161. timefrac = tabptr[n] - (double)loindex;
  2162. val = loval + (valdiff * timefrac);
  2163. // level = read_level(n,time,dz); // Read corresponding level
  2164. break;
  2165. case(1):
  2166. case(2):
  2167. val = ibuf[strmsrc[n]][itabptr[n]];
  2168. // level = 1.0;
  2169. break;
  2170. }
  2171. localspliceval = (double)splcntr[n]/(double)splen; // Downfade, splcntr falling
  2172. val *= localspliceval;
  2173. splcntr[n]--; // Advance splicecnt towards zero
  2174. if(spacetyp > 0) {
  2175. pos = position[stepcnt-1];
  2176. switchpos = swpos[stepcnt-1];
  2177. spacebox_apply(pos,llev[n][stepcnt-1],chans,&l_most,&r_most,&valr,&vall,spacetyp);
  2178. valr = val * valr;
  2179. val = val * vall;
  2180. } else {
  2181. valr = val * rlev[n][stepcnt];
  2182. val *= llev[n][stepcnt];
  2183. }
  2184. if(spacetyp > 0) {
  2185. output_special_spatialisation_sample(obuf,sampcnt,switchpos,chans,val,valr,l_most,r_most,spacetyp);
  2186. sampcnt += chans;
  2187. } else {
  2188. rmost = (lmost[n][stepcnt] + 1) % chans;
  2189. for(k = 0;k < chans;k++) {
  2190. if(k == lmost[n][stepcnt])
  2191. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  2192. else if(k == rmost)
  2193. obuf[sampcnt] = (float)(obuf[sampcnt] + valr);
  2194. sampcnt++;
  2195. }
  2196. }
  2197. }
  2198. }
  2199. if(dz->mode == 0)
  2200. incr_tabptr(n,time,transval[n],strmsrc[n],dz);
  2201. else if(++(itabptr[n]) >= dz->insams[strmsrc[n]])
  2202. itabptr[n] -= dz->insams[strmsrc[n]];
  2203. }
  2204. if(instartsplice) { // Do big splice at start of output
  2205. sampcnt = base_sampcnt;
  2206. for(k = 0;k < chans;k++) {
  2207. obuf[sampcnt] = (float)(obuf[sampcnt] * spliceval);
  2208. sampcnt++;
  2209. }
  2210. spliceval += spliceincr;
  2211. spliceval = min(spliceval,1.0);
  2212. } else if(inendsplice) { // Do big splice at end of output
  2213. sampcnt = base_sampcnt;
  2214. for(k = 0;k < chans;k++) {
  2215. obuf[sampcnt] = (float)(obuf[sampcnt] * spliceval);
  2216. sampcnt++;
  2217. }
  2218. spliceval -= spliceincr;
  2219. spliceval = max(spliceval,0.0);
  2220. }
  2221. sampcnt = base_sampcnt; // Find maxval over all channels
  2222. for(k = 0;k< chans;k++) {
  2223. maxval = max(maxval,fabs(obuf[sampcnt]));
  2224. sampcnt++;
  2225. }
  2226. if(sampcnt >= dz->buflen) { // Check if buffer full - refresh
  2227. memset((char *)obuf,0,dz->buflen * sizeof(float));
  2228. sampcnt = 0;
  2229. }
  2230. total_samps_synthed += chans; // Find out if (still) in startsplice or endsplice
  2231. if(!inendsplice && (total_samps_synthed >= endsplicestart)) {
  2232. inendsplice = 1;
  2233. spliceval = 1.0;
  2234. }
  2235. if(instartsplice && (total_samps_synthed >= startspliceend))
  2236. instartsplice = 0;
  2237. }
  2238. if(sloom) {
  2239. fprintf(stdout,"INFO: at %.1lf secs\n",time);
  2240. fflush(stdout);
  2241. }
  2242. normaliser = 0.85/maxval;
  2243. time = 0.0;
  2244. spliceval = 0.0;
  2245. instartsplice = 1;
  2246. inendsplice = 0;
  2247. total_samps_synthed = 0;
  2248. sampcnt = 0;
  2249. for(n=0;n<dz->itemcnt;n++) // Zero sine-table pointers for all partials
  2250. tabptr[n] = 0.0;
  2251. for(n=0;n < partialcnt;n++) {
  2252. onoff[n][0] = S_OFF;// all partials initially flagged off
  2253. lmost[n][0] = 0; // all leftmost-outchan initially set to left - SAFETY
  2254. origspl[n][0] = 0; // all original-settings of splice-counters to zero
  2255. splcntr[n] = 0; // all splicecounters initially set to zero - SAFETY
  2256. llev[n][0] = 0.0; // all partial gains initially set to zero - SAFETY
  2257. rlev[n][0] = 0.0;
  2258. }
  2259. if(dz->mode == 1) {
  2260. k = partialcnt/dz->infilecnt;
  2261. for(n=0;n < dz->infilecnt;n++) { // Reinitialise pointers
  2262. for(m=0;m < k; m++) {
  2263. itabptr[n + (m * dz->infilecnt)] = sublen * m; // Set delays between read-ptrs in identical streams
  2264. itabptr[n + (m * dz->infilecnt)] += (int)floor(drand48() * sublen/2); // Randomise delays somewhat
  2265. itabptr[n + (m * dz->infilecnt)] = itabptr[n + (m * dz->infilecnt)] % dz->insams[strmsrc[n]];
  2266. }
  2267. }
  2268. }
  2269. stepcnt = 0;
  2270. terminate = 0;
  2271. if(dz->mode == 0)
  2272. resort_partials_into_original_frq_order(total_partialcnt,pvals,tabptr,llev,rlev,onoff,lmost,origspl,splordr,strmsrc,dz);
  2273. if(dz->mode >= 2) {
  2274. for(n=0;n < partialcnt;n++)
  2275. itabptr[n] = loc[n][stepcnt];
  2276. }
  2277. if(sloom) // Forces correct read-out of time-bar
  2278. dz->tempsize = dz->iparam[SYNTH_DUR] * chans;
  2279. fprintf(stdout,"INFO: Second pass: synthesis.\n");
  2280. fflush(stdout);
  2281. memset((char *)obuf,0,dz->buflen * sizeof(float));
  2282. while(total_samps_synthed < totaloutsamps) {
  2283. time = (double)(total_samps_synthed/chans)/srate;
  2284. if((exit_status = read_values_from_all_existing_brktables(time,dz))<0)
  2285. return exit_status;
  2286. if(dz->mode == 2) {
  2287. dz->iparam[NTEX_AMB] = (int)round(dz->param[NTEX_AMB] * srate);
  2288. dz->iparam[NTEX_LOC] = (int)round(dz->param[NTEX_LOC] * srate);
  2289. dz->iparam[NTEX_GST] = (int)round(dz->param[NTEX_GST] * srate);
  2290. }
  2291. if(time >= steptimes[stepcnt]) { // If we've reached the next partials-change time
  2292. stepcnt++; // Advance to next vals
  2293. if(dz->mode == 0) {
  2294. get_current_partial_vals(time,pvals,total_partialcnt,dz);
  2295. sort_partials_into_ascending_frq_order(total_partialcnt,pvals,tabptr,llev,rlev,onoff,lmost,origspl,splordr,strmsrc,dz);
  2296. }
  2297. for(n=0;n<total_partialcnt;n++) // Set any splice counters needed
  2298. splcntr[n] = origspl[n][stepcnt];
  2299. }
  2300. base_sampcnt = sampcnt;
  2301. for(n=0;n<total_partialcnt;n++) {
  2302. sampcnt = base_sampcnt;
  2303. if(onoff[n][stepcnt]) { // If partial is on
  2304. switch(dz->mode) {
  2305. case(0):
  2306. loindex = (int)floor(tabptr[n]); // Read from srctable, using partial-increment
  2307. hiindex = loindex + 1;
  2308. if(hiindex >= dz->insams[0])
  2309. hiindex -= dz->insams[0];
  2310. loval = ibuf[0][loindex];
  2311. hival = ibuf[0][hiindex];
  2312. valdiff = hival - loval;
  2313. timefrac = tabptr[n] - (double)loindex;
  2314. val = loval + (valdiff * timefrac);
  2315. // level = read_level(n,time,dz); // Read corresponding level
  2316. break;
  2317. case(1):
  2318. case(2):
  2319. val = ibuf[strmsrc[n]][itabptr[n]];
  2320. // level = 1.0;
  2321. break;
  2322. }
  2323. indownsplice = 0;
  2324. if(splcntr[n] > 0) { // Get any splice contribution
  2325. if(splcntr[n] > splen) { // This indicates an OFF/ON splice
  2326. if(dz->mode == 2 && splcntr[n] == 2 * splen)
  2327. special_onoff2[n] = 1; // In mode 2, stick to previous values for lev,pos and loc, until dnsplice done
  2328. localspliceval = (double)(splcntr[n] - splen)/(double)splen;
  2329. indownsplice = 1; // Down-splice
  2330. } else {
  2331. if(dz->mode == 2 && splcntr[n] == splen) {
  2332. special_onoff2[n] = 0;
  2333. itabptr[n] = loc[n][stepcnt]; // Only at start of upsplice, for Modes2 and 3, set new itabptr
  2334. }
  2335. localspliceval = (double)(splen - splcntr[n])/(double)splen;
  2336. indownsplice = 0; // Up-splice
  2337. }
  2338. val *= localspliceval; // Upfade, splcntr falling, splen-splcntr rising
  2339. splcntr[n]--; // Advance splicecnt towards zero
  2340. } else if(dz->mode == 2)
  2341. special_onoff2[n] = 0;
  2342. if(spacetyp > 0) {
  2343. if(indownsplice) {
  2344. pos = position[stepcnt-1];
  2345. switchpos = swpos[stepcnt-1];
  2346. spacebox_apply(pos,llev[n][stepcnt-1],chans,&l_most,&r_most,&valr,&vall,spacetyp);
  2347. } else {
  2348. pos = position[stepcnt];
  2349. switchpos = swpos[stepcnt];
  2350. spacebox_apply(pos,llev[n][stepcnt],chans,&l_most,&r_most,&valr,&vall,spacetyp);
  2351. }
  2352. valr = val * valr;
  2353. val = val * vall;
  2354. } else { // If spatialisation, get spatial contributions
  2355. if(dz->mode == 2 && special_onoff2[n]) {
  2356. valr = val * rlev[n][stepcnt-1]; // The level has been changed, but this only takes effect
  2357. val = val * llev[n][stepcnt-1]; // after the downsplice part of the off/on splice
  2358. } else {
  2359. valr = val * rlev[n][stepcnt];
  2360. val = val * llev[n][stepcnt];
  2361. }
  2362. }
  2363. if(spacetyp > 0) {
  2364. output_special_spatialisation_sample(obuf,sampcnt,switchpos,chans,val,valr,l_most,r_most,spacetyp);
  2365. sampcnt += chans;
  2366. } else {
  2367. if(dz->mode == 2 && special_onoff2[n]) {
  2368. rmost = (lmost[n][stepcnt-1] + 1) % chans; // The position has been changed, but this only takes effect
  2369. llmst = lmost[n][stepcnt-1]; // after the downsplice part of the off/on splice
  2370. } else {
  2371. rmost = (lmost[n][stepcnt] + 1) % chans;
  2372. llmst = lmost[n][stepcnt];
  2373. }
  2374. for(k = 0;k< chans;k++) {
  2375. if(k == llmst) // Add output only to the 2 relevant channels
  2376. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  2377. else if(k == rmost)
  2378. obuf[sampcnt] = (float)(obuf[sampcnt] + valr);
  2379. sampcnt++;
  2380. }
  2381. }
  2382. } else { // Partial is OFF
  2383. if(splcntr[n] > 0) { // BUT IF its still a fade-out, Get any splice contribution
  2384. if(dz->mode == 0) {
  2385. loindex = (int)floor(tabptr[n]); // Read from srctable, using partial-increment
  2386. hiindex = loindex + 1;
  2387. if(hiindex >= dz->insams[0])
  2388. hiindex -= dz->insams[0];
  2389. loval = ibuf[0][loindex];
  2390. hival = ibuf[0][hiindex];
  2391. valdiff = hival - loval;
  2392. timefrac = tabptr[n] - (double)loindex;
  2393. val = loval + (valdiff * timefrac);
  2394. // level = read_level(n,time,dz); // Read corresponding level
  2395. } else {
  2396. val = ibuf[strmsrc[n]][itabptr[n]];
  2397. // level = 1.0;
  2398. }
  2399. localspliceval = (double)splcntr[n]/(double)splen; // Downfade, splcntr falling
  2400. val *= localspliceval;
  2401. splcntr[n]--; // Advance splicecnt towards zero
  2402. if(spacetyp > 0) {
  2403. pos = position[stepcnt-1];
  2404. switchpos = swpos[stepcnt-1];
  2405. spacebox_apply(pos,llev[n][stepcnt-1],chans,&l_most,&r_most,&valr,&vall,spacetyp);
  2406. valr = val * valr;
  2407. val = val * vall;
  2408. } else { // If spatialisation, get spatial contributions
  2409. valr = val * rlev[n][stepcnt-1];
  2410. val = val * llev[n][stepcnt-1];
  2411. }
  2412. if(spacetyp > 0) {
  2413. output_special_spatialisation_sample(obuf,sampcnt,switchpos,chans,val,valr,l_most,r_most,spacetyp);
  2414. sampcnt += chans;
  2415. } else {
  2416. rmost = (lmost[n][stepcnt-1] + 1) % chans;
  2417. for(k = 0;k < chans;k++) {
  2418. if(k == lmost[n][stepcnt-1])
  2419. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  2420. else if(k == rmost)
  2421. obuf[sampcnt] = (float)(obuf[sampcnt] + valr);
  2422. sampcnt++;
  2423. }
  2424. }
  2425. }
  2426. }
  2427. if(dz->mode == 0)
  2428. incr_tabptr(n,time,transval[n],strmsrc[n],dz); // Track (modify if ness) the partial-incr value for this partial
  2429. else if(++(itabptr[n]) >= dz->insams[strmsrc[n]])
  2430. itabptr[n] -= dz->insams[strmsrc[n]];
  2431. }
  2432. if(instartsplice) { // Do big splice at start of output
  2433. sampcnt = base_sampcnt;
  2434. for(k = 0;k < chans;k++) {
  2435. obuf[sampcnt] = (float)(obuf[sampcnt] * spliceval);
  2436. sampcnt++;
  2437. }
  2438. spliceval += spliceincr;
  2439. spliceval = min(spliceval,1.0);
  2440. } else if(inendsplice) { // Do big splice at end of output
  2441. sampcnt = base_sampcnt;
  2442. for(k = 0;k < chans;k++) {
  2443. obuf[sampcnt] = (float)(obuf[sampcnt] * spliceval);
  2444. sampcnt++;
  2445. }
  2446. spliceval -= spliceincr;
  2447. spliceval = max(spliceval,0.0);
  2448. }
  2449. sampcnt = base_sampcnt; // Normalise output
  2450. for(k = 0;k < chans;k++) {
  2451. obuf[sampcnt] = (float)(obuf[sampcnt] * normaliser);
  2452. sampcnt++;
  2453. }
  2454. if(sampcnt >= dz->buflen) { // Check if buffer full - write_samps and refresh
  2455. if((exit_status = write_samps(obuf,sampcnt,dz))<0)
  2456. return(exit_status);
  2457. memset((char *)obuf,0,dz->buflen * sizeof(float));
  2458. sampcnt = 0;
  2459. }
  2460. total_samps_synthed += chans; // Find out if (still) in startsplice or endsplice
  2461. if(!inendsplice && (total_samps_synthed >= endsplicestart)) {
  2462. inendsplice = 1;
  2463. spliceval = 1.0;
  2464. }
  2465. if(instartsplice && (total_samps_synthed >= startspliceend))
  2466. instartsplice = 0;
  2467. }
  2468. if(sampcnt) {
  2469. if((exit_status = write_samps(obuf,sampcnt,dz))<0)
  2470. return(exit_status);
  2471. }
  2472. return FINISHED;
  2473. }
  2474. /**************************** INCR_TABPTR ****************************/
  2475. void incr_tabptr(int n,double time,double *transval,int strmsrc,dataptr dz)
  2476. {
  2477. int m;
  2478. double hival, loval, hitime, lotime, timediff, timefrac, valdiff, transposval;
  2479. double *tabptr = dz->parray[0];
  2480. m = 0;
  2481. while(transval[m] < time) {
  2482. m += 2;
  2483. if(m >= dz->ringsize)
  2484. break;
  2485. }
  2486. if(m==0)
  2487. transposval = transval[1];
  2488. else if(m < dz->ringsize) {
  2489. hival = transval[m+1];
  2490. loval = transval[m-1];
  2491. hitime = transval[m];
  2492. lotime = transval[m-2];
  2493. timediff = hitime - lotime;
  2494. timefrac = (time - lotime)/timediff;
  2495. valdiff = hival - loval;
  2496. transposval = loval + (valdiff * timefrac);
  2497. } else
  2498. transposval = transval[dz->ringsize-1];
  2499. // Convert transpos numbers to table-increments
  2500. tabptr[n] += transposval; // In this case we're using transposition values as multipliers of src table
  2501. while(tabptr[n] >= dz->insams[strmsrc]) // And the entire file is in the buffer
  2502. tabptr[n] -= dz->insams[strmsrc];
  2503. }
  2504. /**************************** GET_CURRENT_PARTIAL_VALS ****************************/
  2505. void get_current_partial_vals(double time,double *pvals,int partialcnt,dataptr dz)
  2506. {
  2507. int m, n;
  2508. double hival, loval, hitime, lotime, timediff, timefrac, valdiff, partialval;
  2509. double *thispartial;
  2510. for(n = 0;n < partialcnt;n++ ) {
  2511. thispartial = dz->parray[dz->temp_sampsize + n];
  2512. m = 0;
  2513. while(thispartial[m] < time) {
  2514. m += 2;
  2515. if(m >= dz->ringsize)
  2516. break;
  2517. }
  2518. if(m==0)
  2519. partialval = thispartial[1];
  2520. else if(m < dz->ringsize) {
  2521. hival = thispartial[m+1];
  2522. loval = thispartial[m-1];
  2523. hitime = thispartial[m];
  2524. lotime = thispartial[m-2];
  2525. timediff = hitime - lotime;
  2526. timefrac = (time - lotime)/timediff;
  2527. valdiff = hival - loval;
  2528. partialval = loval + (valdiff * timefrac);
  2529. } else
  2530. partialval = thispartial[dz->ringsize-1];
  2531. pvals[n] = partialval;
  2532. }
  2533. }
  2534. /**************************** READ_LEVEL ****************************/
  2535. #if 0
  2536. //UNUSED
  2537. double read_level(int n,double time,dataptr dz)
  2538. {
  2539. int m;
  2540. double hival, loval, hitime, lotime, timediff, timefrac, valdiff, level;
  2541. double *thislevel = dz->parray[dz->temp_sampsize + dz->itemcnt + n]; // dz->temp_sampsize is base of transposs info
  2542. m = 0; // itemcnt = len of transposs brkpnt info
  2543. while(thislevel[m] < time) {
  2544. m += 2;
  2545. if(m >= dz->ringsize)
  2546. break;
  2547. }
  2548. if(m==0) {
  2549. level = thislevel[1];
  2550. } else if(m < dz->ringsize) {
  2551. hival = thislevel[m+1];
  2552. loval = thislevel[m-1];
  2553. hitime = thislevel[m];
  2554. lotime = thislevel[m-2];
  2555. timediff = hitime - lotime;
  2556. timefrac = (time - lotime)/timediff;
  2557. valdiff = hival - loval;
  2558. level = loval + (valdiff * timefrac);
  2559. } else {
  2560. level = thislevel[dz->ringsize-1];
  2561. }
  2562. return level;
  2563. }
  2564. #endif
  2565. /**************************** HANDLE_THE_SPECIAL_DATA ****************************/
  2566. int handle_the_special_data(char *str,dataptr dz)
  2567. {
  2568. int exit_status, imaxtrans;
  2569. double dummy = 0.0, lasttime = 0.0, lastpartial = 1.0, maxval = 0.0, normaliser, maxtrans;
  2570. int entrycnt = 0, partialcnt, n, timepos, valpos, pno_cnt = 0, lev_cnt = 0;
  2571. int zz, nupno_cnt = 0, nulev_cnt,lstart, pstart, m, k, nn, mm;
  2572. double *sortptr;
  2573. int totalpartials = 0, tablecnt, lno_cnt;
  2574. FILE *fp;
  2575. int cnt, linecnt;
  2576. char temp[200], *p;
  2577. if((fp = fopen(str,"r"))==NULL) {
  2578. sprintf(errstr,"Cannot open file %s to read times.\n",str);
  2579. return(DATA_ERROR);
  2580. }
  2581. linecnt = 0;
  2582. while(fgets(temp,200,fp)!=NULL) {
  2583. p = temp;
  2584. while(isspace(*p))
  2585. p++;
  2586. if(*p == ';' || *p == ENDOFSTR) // Allow comments in file
  2587. continue;
  2588. cnt = 0;
  2589. while(get_float_from_within_string(&p,&dummy)) {
  2590. switch(cnt) {
  2591. case(0):
  2592. if(linecnt == 0) {
  2593. if(dummy != 0) {
  2594. sprintf(errstr,"First time in transpositions data (%lf) must be zero.\n",dummy);
  2595. return(DATA_ERROR);
  2596. } else
  2597. lasttime = dummy;
  2598. } else {
  2599. if(dummy <= lasttime) {
  2600. sprintf(errstr,"Times do not advance at line %d in transpositions data.\n",linecnt+1);
  2601. return(DATA_ERROR);
  2602. }
  2603. }
  2604. break;
  2605. default:
  2606. if(ODD(cnt)) { // ODD entries, partial numbers
  2607. if(dummy < 1.0) {
  2608. sprintf(errstr,"Invalid transpositions (%lf) (less than 1) on line %d.\n",dummy,linecnt+1);
  2609. return(DATA_ERROR);
  2610. }
  2611. if(cnt == 1) {
  2612. if(dz->mode == 0 && dummy < 1.0) {
  2613. sprintf(errstr,"Invalid transposition (%lf) (must be >=1)\n",dummy);
  2614. return(DATA_ERROR);
  2615. }
  2616. lastpartial = dummy;
  2617. }
  2618. else {
  2619. if(dummy <= lastpartial) {
  2620. sprintf(errstr,"Transpositions numbers do not increase through line %d.\n",linecnt+1);
  2621. return(DATA_ERROR);
  2622. }
  2623. lastpartial = dummy;
  2624. }
  2625. } else // EVEN values are levels, which can be -ve (inverted phase)
  2626. maxval = max(maxval,fabs(dummy));
  2627. break;
  2628. }
  2629. cnt++;
  2630. }
  2631. if(cnt < 3 || EVEN(cnt)) {
  2632. sprintf(errstr,"Invalid number of entries (%d) on line %d\n",cnt,linecnt+1);
  2633. return(DATA_ERROR);
  2634. }
  2635. if(linecnt == 0)
  2636. entrycnt = cnt;
  2637. else if(cnt != entrycnt) {
  2638. sprintf(errstr,"Line %d has different number of entries (%d) to previous lines which have (%d)\n",linecnt+1,cnt,entrycnt);
  2639. return(DATA_ERROR);
  2640. }
  2641. linecnt++;
  2642. }
  2643. if(linecnt == 0) {
  2644. sprintf(errstr,"No data found in transpositions data file.\n");
  2645. return(DATA_ERROR);
  2646. }
  2647. if(flteq(maxval,0.0)) {
  2648. sprintf(errstr,"No significant level found in transpositions data file.\n");
  2649. return(DATA_ERROR);
  2650. }
  2651. normaliser = 1.0/maxval;
  2652. partialcnt = (entrycnt - 1)/2;
  2653. /*
  2654. * MODE 0 arrays | |
  2655. * pcnt = partialcnt mpcnt = maxpartialcnt positions
  2656. * (partials+all transpositions) | | |
  2657. * | | current
  2658. * tabptrs frqs|
  2659. * parray |-|-----------------|---------------|-|-|-|----------|----------|
  2660. * | | left_level | right-level step| | transpos | level |
  2661. * | | mpcnt | mpcnt times | mpcnt | mpcnt |
  2662. * | | | | | | | | |
  2663. * | | | (mpcnt*2)+1 | |
  2664. * address 0 1 (mpcnt)+1 | (mpcnt*2)+2 (mpcnt*3)+4|
  2665. * | | | | | (mpcnt*2)+3 | |
  2666. * | | | | | | (mpcnt*2)+4| |
  2667. * | | | | | | | |
  2668. * lengths | | maxsteps | maxsteps | |m| | linelen | linelen |
  2669. * |t| |t|p|t|of srcdata|of srcdata|
  2670. * |o| |o|c|o| | |
  2671. * |t| |t|n|t| | |
  2672. * |l| |l|t|l| | |
  2673. * (totl = estimate of no of timesteps used)
  2674. * (mpcnt = total number of streams)
  2675. * (maxsteps = total number of timesteps)
  2676. */
  2677. if(dz->brksize[NTEX_MAX]) {
  2678. if((exit_status = get_maxvalue_in_brktable(&maxtrans,NTEX_MAX,dz))<0)
  2679. return PROGRAM_ERROR;
  2680. imaxtrans = (int)ceil(maxtrans);
  2681. } else
  2682. imaxtrans = (int)ceil(dz->param[NTEX_MAX]);
  2683. totalpartials = partialcnt * imaxtrans;
  2684. dz->array_cnt = (totalpartials * 2) + 1; // An array for every component-and-transposition, every candt-level,
  2685. // and tab-incr-pointers
  2686. dz->array_cnt += (totalpartials * 2) + 3; // An array for the left and right level of every partial-and-partial-transposition.
  2687. // + Array for the steptimes, + Array for the transpostions of componenets at current-time
  2688. dz->itemcnt = totalpartials; // + Array for position at every step.
  2689. if((dz->parray = (double **)malloc(dz->array_cnt * sizeof(double *)))==NULL) {
  2690. sprintf(errstr,"INSUFFICIENT MEMORY to create partial data arrays.\n");
  2691. return(MEMORY_ERROR);
  2692. }
  2693. zz = totalpartials * 2;
  2694. for(n=0,m=(totalpartials*2) + 4;n < zz;n++,m++) { // 2 entries (time and value) for every line in the data.
  2695. if((dz->parray[m] = (double *)malloc((linecnt * 2) * sizeof(double)))==NULL) {
  2696. sprintf(errstr,"INSUFFICIENT MEMORY to store partial data.\n");
  2697. return(MEMORY_ERROR);
  2698. }
  2699. }
  2700. fseek(fp,0,0);
  2701. timepos = 0; // Pointer to time-values in all arrays
  2702. valpos = 1; // Pointer to val-at-time in all arrays
  2703. pstart = (totalpartials*2) + 4; // Pointer to transposition(pno) table
  2704. // Pointer to transposition(pno) table
  2705. // Start of level table
  2706. lstart = pstart + totalpartials;
  2707. while(fgets(temp,200,fp)!=NULL) {
  2708. p = temp;
  2709. if(*p == ';') // Allow comments in file
  2710. continue;
  2711. cnt = 0;
  2712. while(get_float_from_within_string(&p,&dummy)) {
  2713. switch(cnt) {
  2714. case(0):
  2715. for(m=pstart,n=0;n <partialcnt;n++,m++) // Put time in all pno arrays
  2716. dz->parray[m][timepos] = dummy;
  2717. for(m = lstart,n=0;n <partialcnt;n++,m++)// Put time in all level arrays
  2718. dz->parray[m][timepos] = dummy;
  2719. pno_cnt = pstart; // Point to start of pnos, and levels
  2720. lev_cnt = lstart;
  2721. break;
  2722. default:
  2723. if(ODD(cnt)) // Put pno in appropriate pno-array
  2724. dz->parray[pno_cnt++][valpos] = dummy;
  2725. else // Put level in appropriate level-array
  2726. dz->parray[lev_cnt++][valpos] = dummy * normaliser;
  2727. break;
  2728. }
  2729. cnt++;
  2730. }
  2731. if(cnt) {
  2732. timepos += 2; // Advance pointers in pno and level tables
  2733. valpos +=2;
  2734. }
  2735. }
  2736. if(fclose(fp)<0) {
  2737. fprintf(stdout,"WARNING: Failed to close input textfile %s.\n",str);
  2738. fflush(stdout);
  2739. }
  2740. dz->scalefact = dz->parray[pstart+partialcnt-1][1]; // Remember the original range : not quite correct, as range is time-variable!!
  2741. tablecnt = partialcnt; // Total number of original transposition (or level) tables
  2742. entrycnt = timepos; // Total number of entries in each table
  2743. if(dz->param[NTEX_MAX] > 1) {
  2744. // COPY ORIGINAL TRANSPOSITION AND LEVEL TABLES INTO HIGHER OCTAVES
  2745. nupno_cnt = pstart + partialcnt; // Start of new partial-transpositions tables
  2746. nulev_cnt = lstart + partialcnt; // Pointer to new levels tables
  2747. for(n=1;n<imaxtrans;n++) { // For every additional 8va
  2748. for(pno_cnt=pstart,lno_cnt=lstart;pno_cnt<pstart+tablecnt;pno_cnt++,lno_cnt++) {// For every original transposition-table, and level-table
  2749. for(k=0;k<entrycnt;k+=2) { // For every entry in original tables
  2750. dz->parray[nupno_cnt][k] = dz->parray[pno_cnt][k]; // At same time
  2751. dz->parray[nupno_cnt][k+1] = (dz->parray[pno_cnt][k+1]) * (n+1); // Create new table, transpositions up n octs
  2752. dz->parray[nulev_cnt][k] = dz->parray[lno_cnt][k]; // At same time
  2753. dz->parray[nulev_cnt][k+1] = dz->parray[lno_cnt][k+1]; // Create new table with same levels
  2754. }
  2755. nupno_cnt++;
  2756. nulev_cnt++;
  2757. }
  2758. }
  2759. // SORT TRANSPOSITIONS INTO ASCENDING ORDER
  2760. for(n = pstart, m = lstart; n < nupno_cnt-1; n++,m++) {
  2761. for(nn = n+1, mm = m+1; nn < nupno_cnt;nn++, mm++) {
  2762. if(dz->parray[nn][1] < dz->parray[n][1]) { // Sort of first transposition in array
  2763. sortptr = dz->parray[nn];
  2764. dz->parray[nn] = dz->parray[n];
  2765. dz->parray[n] = sortptr;
  2766. sortptr = dz->parray[mm];
  2767. dz->parray[mm] = dz->parray[m];
  2768. dz->parray[m] = sortptr;
  2769. }
  2770. }
  2771. }
  2772. }
  2773. dz->ringsize = linecnt * 2; // Store lengths of transposition tables (1 time and 1 value entry from each dataline)
  2774. return(FINISHED);
  2775. }
  2776. /**************************** OTHERWISE ****************************/
  2777. int otherwise(dataptr dz)
  2778. {
  2779. int exit_status, imaxmult;
  2780. double maxmult;
  2781. /*
  2782. * MODE 1 arrays | |
  2783. * pcnt = partialcnt mpcnt = maxpartialcnt positions
  2784. * (partials+all transpositions) | | |
  2785. * | | current
  2786. * tabptrs frqs|
  2787. * parray |-|-----------------|---------------|-|-|-|
  2788. * | | left_level | right-level step| |
  2789. * | | mpcnt | mpcnt times |
  2790. * | | | | | | |
  2791. * | | | (mpcnt*2)+1
  2792. * address 0 1 (mpcnt)+1 | (mpcnt*2)+2
  2793. * | | | | | (mpcnt*2)+3
  2794. * | | | | | | (mpcnt*2)+4
  2795. * | | | | | |
  2796. * lengths | | maxsteps | maxsteps | |m| |
  2797. * |t| |t|p|t|
  2798. * |o| |o|c|o|
  2799. * |t| |t|n|t|
  2800. * |l| |l|t|l|
  2801. * (mpcnt = total number of streams)
  2802. * (totl = maxsteps = total number of timesteps)
  2803. */
  2804. if(dz->brksize[NTEX_MAX]) {
  2805. if((exit_status = get_maxvalue_in_brktable(&maxmult,NTEX_MAX,dz))<0)
  2806. return PROGRAM_ERROR;
  2807. imaxmult = (int)ceil(maxmult);
  2808. } else
  2809. imaxmult = (int)ceil(dz->param[NTEX_MAX]);
  2810. dz->itemcnt = dz->infilecnt * imaxmult; // max number of streams
  2811. dz->array_cnt = (dz->itemcnt * 2) + 4;
  2812. if((dz->parray = (double **)malloc(dz->array_cnt * sizeof(double *)))==NULL) {
  2813. sprintf(errstr,"INSUFFICIENT MEMORY to create partial data arrays.\n");
  2814. return(MEMORY_ERROR);
  2815. }
  2816. return(FINISHED);
  2817. }
  2818. /**************************** CREATE_NEWTEX_SNDBUFS ****************************/
  2819. int create_newtex_sndbufs(dataptr dz)
  2820. {
  2821. int n, safety = 4;
  2822. unsigned int lastbigbufsize, bigbufsize = 0;
  2823. float *bottom;
  2824. dz->bufcnt = dz->infilecnt+1;
  2825. if((dz->sampbuf = (float **)malloc(sizeof(float *) * (dz->bufcnt+1)))==NULL) {
  2826. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffers.\n");
  2827. return(MEMORY_ERROR);
  2828. }
  2829. if((dz->sbufptr = (float **)malloc(sizeof(float *) * dz->bufcnt))==NULL) {
  2830. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffer pointers.\n");
  2831. return(MEMORY_ERROR);
  2832. }
  2833. lastbigbufsize = 0;
  2834. bigbufsize = 0;
  2835. for(n=0;n<dz->infilecnt;n++) {
  2836. bigbufsize += (dz->insams[n] + safety) * sizeof(float);
  2837. if(bigbufsize < lastbigbufsize) {
  2838. sprintf(errstr,"Insufficient memory to store the input soundfiles in buffers.\n");
  2839. return(MEMORY_ERROR);
  2840. }
  2841. lastbigbufsize = bigbufsize;
  2842. }
  2843. dz->buflen = NTEX_OBUFSIZE * dz->iparam[NTEX_CHANS];
  2844. bigbufsize += (dz->buflen + (safety * dz->iparam[NTEX_CHANS])) * sizeof(float);
  2845. if(bigbufsize < lastbigbufsize) {
  2846. sprintf(errstr,"Insufficient memory to store the input soundfiles in buffers.\n");
  2847. return(MEMORY_ERROR);
  2848. }
  2849. if((dz->bigbuf = (float *)malloc(bigbufsize)) == NULL) {
  2850. sprintf(errstr,"INSUFFICIENT MEMORY to create sound buffers.\n");
  2851. return(PROGRAM_ERROR);
  2852. }
  2853. bottom = dz->bigbuf;
  2854. for(n = 0;n<dz->infilecnt;n++) {
  2855. dz->sbufptr[n] = dz->sampbuf[n] = bottom;
  2856. bottom += dz->insams[n] + safety;
  2857. }
  2858. dz->sbufptr[n] = dz->sampbuf[n] = bottom;
  2859. return(FINISHED);
  2860. }
  2861. /****************************** GET_THE_MODE_FROM_CMDLINE *********************************/
  2862. int get_the_mode_from_cmdline(char *str,dataptr dz)
  2863. {
  2864. char temp[200], *p;
  2865. if(sscanf(str,"%s",temp)!=1) {
  2866. fprintf(stderr,"Cannot read mode of program.\n");
  2867. return(USAGE_ONLY);
  2868. }
  2869. p = temp + strlen(temp) - 1;
  2870. while(p >= temp) {
  2871. if(!isdigit(*p)) {
  2872. fprintf(stderr,"Invalid mode of program entered.\n");
  2873. return(USAGE_ONLY);
  2874. }
  2875. p--;
  2876. }
  2877. if(sscanf(str,"%d",&dz->mode)!=1) {
  2878. fprintf(stderr,"Cannot read mode of program.\n");
  2879. return(USAGE_ONLY);
  2880. }
  2881. if(dz->mode <= 0 || dz->mode > dz->maxmode) {
  2882. fprintf(stderr,"Program mode value [%d] is out of range [1 - %d].\n",dz->mode,dz->maxmode);
  2883. return(USAGE_ONLY);
  2884. }
  2885. dz->mode--; /* CHANGE TO INTERNAL REPRESENTATION OF MODE NO */
  2886. return(FINISHED);
  2887. }
  2888. /*********************** RNDINTPERM ************************/
  2889. void rndintperm(int *perm,int cnt)
  2890. {
  2891. int n,t,k;
  2892. memset((char *)perm,0,cnt * sizeof(int));
  2893. for(n=0;n<cnt+1;n++) {
  2894. t = (int)(drand48() * (double)(n+1)); /* TRUNCATE */
  2895. if(t==n) {
  2896. for(k=n;k>0;k--)
  2897. perm[k] = perm[k-1];
  2898. perm[0] = n;
  2899. } else {
  2900. for(k=n;k>t;k--)
  2901. perm[k] = perm[k-1];
  2902. perm[t] = n;
  2903. }
  2904. }
  2905. for(n=0;n<cnt;n++)
  2906. perm[n]--;
  2907. }
  2908. /************************************ PANCALC *******************************/
  2909. void pancalc(double position,double *leftgain,double *rightgain)
  2910. {
  2911. int dirflag;
  2912. double temp;
  2913. double relpos;
  2914. double reldist, invsquare;
  2915. if(position < 0.0)
  2916. dirflag = SIGNAL_TO_LEFT; /* signal on left */
  2917. else
  2918. dirflag = SIGNAL_TO_RIGHT;
  2919. if(position < 0)
  2920. relpos = -position;
  2921. else
  2922. relpos = position;
  2923. if(relpos <= 1.0){ /* between the speakers */
  2924. temp = 1.0 + (relpos * relpos);
  2925. reldist = ROOT2 / sqrt(temp);
  2926. temp = (position + 1.0) / 2.0;
  2927. *rightgain = temp * reldist;
  2928. *leftgain = (1.0 - temp ) * reldist;
  2929. } else { /* outside the speakers */
  2930. temp = (relpos * relpos) + 1.0;
  2931. reldist = sqrt(temp) / ROOT2; /* relative distance to source */
  2932. invsquare = 1.0 / (reldist * reldist);
  2933. if(dirflag == SIGNAL_TO_LEFT){
  2934. *leftgain = invsquare;
  2935. *rightgain = 0.0;
  2936. } else { /* SIGNAL_TO_RIGHT */
  2937. *rightgain = invsquare;
  2938. *leftgain = 0;
  2939. }
  2940. }
  2941. }
  2942. /************************************ SORT_PARTIALS_INTO_ASCENDING_FRQ_ORDER *******************************/
  2943. void sort_partials_into_ascending_frq_order(int mpcnt,double *pvals,double *tabptr,double **llev,double **rlev,int **onoff,int **lmost,int **origspl,int *splordr,int *strmsrc,dataptr dz)
  2944. {
  2945. double *sortptr, temp;
  2946. int n, nn, itemp;
  2947. int *iptr;
  2948. /*
  2949. * MODE 0 arrays | |
  2950. * pcnt = partialcnt mpcnt = maxpartialcnt positions
  2951. * (partials+all transpositions) | | |
  2952. * | | current
  2953. * tabptrs frqs|
  2954. * parray |-|-----------------|---------------|-|-|-|----------|----------|
  2955. * | | left_level | right-level step| | transpos | level |
  2956. * | | mpcnt | mpcnt times | mpcnt | mpcnt |
  2957. * | | | | | | | | |
  2958. * | | | (mpcnt*2)+1 | |
  2959. * address 0 1 (mpcnt)+1 | (mpcnt*2)+2 (mpcnt*3)+4|
  2960. * | | | | | (mpcnt*2)+3 | |
  2961. * | | | | | | (mpcnt*2)+4| |
  2962. * | | | | | | | |
  2963. * lengths | | maxsteps | maxsteps | |m| | linelen | linelen |
  2964. * |t| |t|p|t|of srcdata|of srcdata|
  2965. * |o| |o|c|o| | |
  2966. * |t| |t|n|t| | |
  2967. * |l| |l|t|l| | |
  2968. * (mpcnt = total number of streams)
  2969. * (totl = maxsteps = total number of timesteps)
  2970. * splicecntr
  2971. * | transpos-order
  2972. * | | switchpos (special spatialisation)
  2973. * | | | infileno associated with stream
  2974. * | | | | itabptr(integer pointer to input buffers) MODE 1 only
  2975. * | | | | | | last-locus
  2976. * iparray |-----------------|-----------------|-----------------|-| | | (mpcnt*3)+4
  2977. * | on-off flags | leftmost chan | spo | | | (mpcnt*3)+3
  2978. * | (mpcnt) | (mpcnt) | (mpcnt) | | (mpcnt*3)+2
  2979. * | | | | (mpcnt*3)+1 MODE 3/4 (readpos)
  2980. * address 0 mpcnt mpcnt*2 (mpcnt*3) | |-----------------|
  2981. * | | | | | | | | (mpcnt*3)+5 |
  2982. * lengths | maxsteps | maxsteps | maxsteps mpcnt | | | (mpcnt*3)+6 |
  2983. * | mpcnt | | | |
  2984. * | | mpcnt | | maxsteps |
  2985. * (splcntrs = splice counters) | | | mpcnt | |
  2986. * (spo = orig values of splice counters) | | | | mpcnt
  2987. * | | | | | mpcnt
  2988. *
  2989. *
  2990. */
  2991. int partialbase = (mpcnt*2)+4;
  2992. int levelbase = (mpcnt*3)+4;
  2993. for(n = 0; n < mpcnt-1; n++) {
  2994. for(nn = n+1; nn < mpcnt;nn++) {
  2995. if(pvals[nn] < pvals[n]) { // Sort on partialval
  2996. // Shuffle arrays so they're in ascending frq order, of CURRENT frqs
  2997. sortptr = dz->parray[nn+partialbase];
  2998. dz->parray[nn+partialbase] = dz->parray[n+partialbase];
  2999. dz->parray[n+partialbase] = sortptr;
  3000. sortptr = dz->parray[nn+levelbase];
  3001. dz->parray[nn+levelbase] = dz->parray[n+levelbase];
  3002. dz->parray[n+levelbase] = sortptr;
  3003. // Shuffle associated tabptrs
  3004. temp = tabptr[nn];
  3005. tabptr[nn] = tabptr[n];
  3006. tabptr[n] = temp;
  3007. // Shuffle associated (left-)level pointers
  3008. sortptr = llev[nn];
  3009. llev[nn] = llev[n];
  3010. llev[n] = sortptr;
  3011. // Shuffle associated right-level pointers
  3012. sortptr = rlev[nn];
  3013. rlev[nn] = rlev[n];
  3014. rlev[n] = sortptr;
  3015. // Shuffle associated onoff flags
  3016. iptr = onoff[nn];
  3017. onoff[nn] = onoff[n];
  3018. onoff[n] = iptr;
  3019. // Shuffle associated lmost-spkr info
  3020. iptr = lmost[nn];
  3021. lmost[nn] = lmost[n];
  3022. lmost[n] = iptr;
  3023. // Shuffle associated splicectr origins
  3024. iptr = origspl[nn];
  3025. origspl[nn] = origspl[n];
  3026. origspl[n] = iptr;
  3027. // Swap transposs into correct order
  3028. temp = pvals[nn];
  3029. pvals[nn] = pvals[n];
  3030. pvals[n] = temp;
  3031. // Finally keep track of which infile associated with each outstream
  3032. itemp = strmsrc[nn];
  3033. strmsrc[nn] = strmsrc[n];
  3034. strmsrc[n] = itemp;
  3035. // And keep track of reordering, for 2nd pass
  3036. itemp = splordr[nn];
  3037. splordr[nn] = splordr[n];
  3038. splordr[n] = itemp;
  3039. }
  3040. }
  3041. }
  3042. }
  3043. /************************************ RESORT_PARTIALS_INTO_ORIGINAL_FRQ_ORDER *******************************/
  3044. void resort_partials_into_original_frq_order(int mpcnt,double *pvals,double *tabptr,double **llev,double **rlev,int **onoff,int **lmost,
  3045. int **origspl,int *splordr,int *strmsrc,dataptr dz)
  3046. {
  3047. /*
  3048. * MODE 0 arrays | |
  3049. * pcnt = partialcnt mpcnt = maxpartialcnt positions
  3050. * (partials+all transpositions) | | |
  3051. * | | current
  3052. * tabptrs frqs|
  3053. * parray |-|-----------------|---------------|-|-|-|----------|----------|
  3054. * | | left_level | right-level step| | transpos | level |
  3055. * | | mpcnt | mpcnt times | mpcnt | mpcnt |
  3056. * | | | | | | | | |
  3057. * | | | (mpcnt*2)+1 | |
  3058. * address 0 1 (mpcnt)+1 | (mpcnt*2)+2 (mpcnt*3)+4|
  3059. * | | | | | (mpcnt*2)+3 | |
  3060. * | | | | | | (mpcnt*2)+4| |
  3061. * | | | | | | | |
  3062. * lengths | | maxsteps | maxsteps | |m| | linelen | linelen |
  3063. * |t| |t|p|t|of srcdata|of srcdata|
  3064. * |o| |o|c|o| | |
  3065. * |t| |t|n|t| | |
  3066. * |l| |l|t|l| | |
  3067. * (mpcnt = total number of streams)
  3068. * (totl = maxsteps = total number of timesteps)
  3069. */
  3070. double *sortptr, temp;
  3071. int n, nn;
  3072. int *iptr, itemp;
  3073. int partialbase = (mpcnt*2)+4;
  3074. int levelbase = (mpcnt*3)+4;
  3075. for(n = 0; n < mpcnt-1; n++) {
  3076. for(nn = n+1; nn < mpcnt;nn++) {
  3077. if(splordr[nn] < splordr[n]) { // Sort on original order value
  3078. // Shuffle arrays so they're in original order
  3079. sortptr = dz->parray[nn+partialbase];
  3080. dz->parray[nn+partialbase] = dz->parray[n+partialbase];
  3081. dz->parray[n+partialbase] = sortptr;
  3082. sortptr = dz->parray[nn+levelbase];
  3083. dz->parray[nn+levelbase] = dz->parray[n+levelbase];
  3084. dz->parray[n+levelbase] = sortptr;
  3085. // Shuffle associated sinptrs
  3086. temp = tabptr[nn];
  3087. tabptr[nn] = tabptr[n];
  3088. tabptr[n] = temp;
  3089. // Shuffle associated (left-)level pointers
  3090. sortptr = llev[nn];
  3091. llev[nn] = llev[n];
  3092. llev[n] = sortptr;
  3093. // Shuffle associated right-level pointers
  3094. sortptr = rlev[nn];
  3095. rlev[nn] = rlev[n];
  3096. rlev[n] = sortptr;
  3097. // Shuffle associated onoff flags
  3098. iptr = onoff[nn];
  3099. onoff[nn] = onoff[n];
  3100. onoff[n] = iptr;
  3101. // Shuffle associated lmost-spkr info
  3102. iptr = lmost[nn];
  3103. lmost[nn] = lmost[n];
  3104. lmost[n] = iptr;
  3105. // Shuffle associated splicectr origins
  3106. iptr = origspl[nn];
  3107. origspl[nn] = origspl[n];
  3108. origspl[n] = iptr;
  3109. // Swap frqs into correct order
  3110. temp = pvals[nn];
  3111. pvals[nn] = pvals[n];
  3112. pvals[n] = temp;
  3113. // Finally Restore original association between infiles and outstreams
  3114. itemp = strmsrc[nn];
  3115. strmsrc[nn] = strmsrc[n];
  3116. strmsrc[n] = itemp;
  3117. }
  3118. }
  3119. }
  3120. }
  3121. /**************************************** XCLUSIVE **************************************
  3122. *
  3123. * Resort an existing permutation (of partials chosen)
  3124. * so the already ON partials occur after all the corrently-OFF partials
  3125. */
  3126. void xclusive(int *perm,int *permon,int *permoff,int max_partials_cnt,int partials_in_play, int **onoff,int stepcnt)
  3127. {
  3128. int permoncnt = 0, permoffcnt = 0, n, ptl;
  3129. if(partials_in_play == max_partials_cnt)
  3130. return;
  3131. for(n = 0;n < max_partials_cnt;n++) {
  3132. ptl = perm[n];
  3133. if(onoff[ptl][stepcnt]) // If this partial is already ON
  3134. permon[permoncnt++] = ptl; // Store the ON-partials, in order they were in initial perm
  3135. else
  3136. permoff[permoffcnt++] = ptl; // If this partial is OFF
  3137. } // Store the OFF-partials, in order they were in initial perm
  3138. for(n=0;n<permoffcnt;n++) // Place the OFF partials first in the permlist,
  3139. perm[n] = permoff[n]; // But otherwise preserving perm order.
  3140. while(n < max_partials_cnt) {
  3141. perm[n] = permon[n];
  3142. n++;
  3143. }
  3144. }
  3145. /**************************************** EMERGEPOS **************************************
  3146. *
  3147. * Find spatial position, where image emerging from single channel to gradually fill all channels
  3148. */
  3149. double emergepos(int emergchan,int chans,double time,double timespan)
  3150. {
  3151. double frac, chanspan, pos, lmost;
  3152. emergchan--;
  3153. frac = time/timespan; // Fraction of emerge-time covered
  3154. if(frac < 0.33)
  3155. chanspan = 0;
  3156. else {
  3157. frac = pow((frac - 0.33),1.5);
  3158. chanspan = (double)chans * frac; // Fraction of total-channels available
  3159. }
  3160. pos = drand48() * chanspan; // Position randomly within chanspan
  3161. lmost = (double)emergchan - (chanspan/2.0); // Find leftmost position (relative to emergence chan)
  3162. pos += lmost; // Find true position
  3163. if(pos < 0.0) // Adjust for %N chans
  3164. pos += (double)chans;
  3165. else if(pos >= chans) // Adjust for %N chans
  3166. pos -= (double)chans;
  3167. return pos;
  3168. }
  3169. /**************************************** EMERGEPOS **************************************
  3170. *
  3171. * Find spatial position, where image converging to single channel from all channels
  3172. */
  3173. double convergepos(int converchan,int chans,double time,double convergetime,double dur)
  3174. {
  3175. double frac, chanspan, pos, lmost; // Fraction of converge-time covered
  3176. int ipos;
  3177. converchan--;
  3178. frac = (time - convergetime)/(dur - convergetime);
  3179. frac = 1.0 - frac; // Amount of convergence
  3180. if(frac < 0.33)
  3181. chanspan = 0;
  3182. else {
  3183. frac = pow((frac - 0.33),2.0);
  3184. chanspan = (double)chans * frac; // Fraction of total-channels available
  3185. }
  3186. pos = drand48() * chanspan; // Position randomly within chanspan
  3187. ipos = (int)round(pos/0.1);
  3188. pos = ipos * 0.1;
  3189. lmost = (double)converchan - (chanspan/2.0);// Find leftmost position (relative to convergence chan)
  3190. pos += lmost; // Find true position
  3191. if(pos < 0.0) // Adjust for %N chans
  3192. pos += (double)chans;
  3193. else if(pos >= chans) // Adjust for %N chans
  3194. pos -= (double)chans;
  3195. return pos;
  3196. }
  3197. /**************************************** SPACEBOX **************************************/
  3198. void spacebox(double *pos, int *switchpos, double posstep, int chans, int spacetyp, int configno, int configcnt,int *superperm)
  3199. {
  3200. switch(spacetyp) {
  3201. case(SB_LRRAND): // Alternate Left and Right sides, random position
  3202. *pos = chans/2 * drand48(); // Random choice of half of chan positions
  3203. if(*switchpos) // If switch on, put in 2nd half
  3204. *pos += chans/2;
  3205. *switchpos = -(*switchpos);
  3206. break;
  3207. case(SB_FBRAND): // Alternate Front and Back sides, random position
  3208. *pos = chans/2 * drand48(); // Simil for front and back
  3209. if(*switchpos) {
  3210. *pos += 2;
  3211. if(*pos >= chans)
  3212. *pos -= chans;
  3213. } else {
  3214. *pos += 6;
  3215. if(*pos >= chans)
  3216. *pos -= chans;
  3217. }
  3218. *switchpos = -(*switchpos);
  3219. break;
  3220. case(SB_ROTATE): // Rotating clockwise or anticlockwise
  3221. *pos += posstep;
  3222. if(*pos >= chans)
  3223. *pos -= chans;
  3224. else if(*pos < 0.0)
  3225. *pos += chans;
  3226. break;
  3227. case(SB_SUPERSPACE):
  3228. case(SB_SUPERSPACE2):
  3229. case(SB_SUPERSPACE3):
  3230. case(SB_SUPERSPACE4): // Get item in current permutaion of possibilities
  3231. *switchpos = superperm[configcnt];
  3232. break;
  3233. case(SB_LR): // Alternate all-left/all-right Switch between the 2 alternatives
  3234. case(SB_FB): // Alternate all-back/all-front
  3235. case(SB_FRAMESWITCH): // Switch all-square/all-diamond
  3236. *switchpos = !(*switchpos);
  3237. break;
  3238. case(SB_TRIROT1): // Rotate triangle formed by spkrs 2-apart clockwise
  3239. case(SB_TRIROT2): // Rotate triangle formed by spkrs 3-apart clockwise
  3240. (*switchpos)++; // Advance apex of triangle
  3241. if(*switchpos >= chans)
  3242. *switchpos -= chans;
  3243. break;
  3244. case(SB_ANTITRIROT1): // Rotate triangle formed by spkrs 2-apart anticlockwise
  3245. case(SB_ANTITRIROT2): // Rotate triangle formed by spkrs 2-apart anticlockwise
  3246. (*switchpos)--; // Regress apex of triangle
  3247. if(*switchpos < chans)
  3248. *switchpos += chans;
  3249. break;
  3250. }
  3251. }
  3252. /**************************************** SPACEBOX_APPLY **************************************/
  3253. void spacebox_apply(double pos, double lev,int chans,int *lmost, int *rmost,double *rlev,double *llev,int spacetyp)
  3254. {
  3255. double leftgain, rightgain;
  3256. switch(spacetyp) {
  3257. case(SB_LRRAND): // These options use true stereo between adjacent speakers
  3258. case(SB_FBRAND): // Find levels and left/right lspkrs
  3259. case(SB_ROTATE):
  3260. *lmost = (int)floor(pos);
  3261. pos -= (double)(*lmost);
  3262. pos = (pos * 2.0) - 1.0;
  3263. pancalc(pos,&leftgain,&rightgain);
  3264. *rlev = lev * rightgain;
  3265. *llev = lev * leftgain;
  3266. *rmost = (*lmost + 1) % chans;
  3267. break;
  3268. case(SB_LR):
  3269. case(SB_FB):
  3270. case(SB_TRIROT1):
  3271. case(SB_ANTITRIROT1):
  3272. case(SB_TRIROT2):
  3273. case(SB_ANTITRIROT2):
  3274. case(SB_FRAMESWITCH):
  3275. case(SB_SUPERSPACE):
  3276. case(SB_SUPERSPACE2):
  3277. case(SB_SUPERSPACE3):
  3278. case(SB_SUPERSPACE4):
  3279. *llev = lev; // Input level is distributed (as is) amongst various lspkrs
  3280. break;
  3281. }
  3282. }
  3283. /**************************************** OUTPUT_SPECIAL_SPATIALISATION_SAMPLE **************************************/
  3284. void output_special_spatialisation_sample(float *obuf,int sampcnt,int switchpos,int chans,double val,double valr,int lmost,int rmost,int spacetyp)
  3285. {
  3286. int k, tri1, tri2, tri3, a, b;
  3287. switch(spacetyp) {
  3288. case(SB_LR):
  3289. if(switchpos) {
  3290. for(k = (chans/2)+1;k < chans;k++)
  3291. obuf[sampcnt+k] = (float)(obuf[sampcnt+k] + val);
  3292. } else {
  3293. for(k = 1;k < chans/2;k++)
  3294. obuf[sampcnt+k] = (float)(obuf[sampcnt+k] + val);
  3295. }
  3296. break;
  3297. case(SB_FB):
  3298. if(switchpos) {
  3299. for(k = 0;k < chans;k++) {
  3300. if(k < 2 || k == 7)
  3301. obuf[sampcnt+k] = (float)(obuf[sampcnt+k] + val);
  3302. }
  3303. } else {
  3304. for(k = 3;k < 6;k++)
  3305. obuf[sampcnt+k] = (float)(obuf[sampcnt+k] + val);
  3306. }
  3307. break;
  3308. case(SB_TRIROT1):
  3309. case(SB_ANTITRIROT1):
  3310. tri1 = switchpos;
  3311. tri2 = (switchpos + 2) % chans;
  3312. tri3 = (switchpos + 6) % chans;
  3313. for(k = 0;k< chans;k++) {
  3314. if(k == tri1 || k == tri2 || k == tri3) // Add output only to the 2 relevant channels
  3315. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  3316. sampcnt++;
  3317. }
  3318. break;
  3319. case(SB_TRIROT2):
  3320. case(SB_ANTITRIROT2):
  3321. tri1 = switchpos;
  3322. tri2 = (switchpos + 3) % chans;
  3323. tri3 = (switchpos + 5) % chans;
  3324. for(k = 0;k< chans;k++) {
  3325. if(k == tri1 || k == tri2 || k == tri3) // Add output only to the 2 relevant channels
  3326. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  3327. sampcnt++;
  3328. }
  3329. break;
  3330. case(SB_FRAMESWITCH):
  3331. if(switchpos) {
  3332. for(k = 0;k< chans;k++) { // SQUARE
  3333. if(ODD(k))
  3334. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  3335. sampcnt++;
  3336. }
  3337. } else {
  3338. for(k = 0;k< chans;k++) { // DIAMOND
  3339. if(EVEN(k))
  3340. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  3341. sampcnt++;
  3342. }
  3343. }
  3344. break;
  3345. case(SB_SUPERSPACE):
  3346. case(SB_SUPERSPACE2):
  3347. case(SB_SUPERSPACE3):
  3348. case(SB_SUPERSPACE4):
  3349. if(switchpos <= 7) { // 0 - 7 Single chans
  3350. obuf[sampcnt+switchpos] = (float)(obuf[sampcnt+switchpos] + val);
  3351. } else if(switchpos <=35) { // 8 - 35
  3352. switchpos -= 8; // 0 - 27
  3353. if(switchpos >=24) { // 24 - 27
  3354. switchpos -= 24; // 0 - 3 paired with its opposite
  3355. obuf[sampcnt+switchpos] = (float)(obuf[sampcnt+switchpos] + val);
  3356. switchpos += chans/2; // 4 - 7
  3357. obuf[sampcnt+switchpos] = (float)(obuf[sampcnt+switchpos] + val);
  3358. } else { // 0 - 23
  3359. a = switchpos/3; // 0-7 = a
  3360. b = switchpos - (a*3); // 0-2
  3361. b++; // 1-3
  3362. b = (a + b) % chans; // a+(1-3)
  3363. obuf[sampcnt+a] = (float)(obuf[sampcnt+a] + val);
  3364. obuf[sampcnt+b] = (float)(obuf[sampcnt+b] + val);
  3365. }
  3366. } else if(switchpos <= 43) { // 36 - 43 TRIANGLE 1
  3367. switchpos -=36; // 0 - 7
  3368. tri1 = switchpos; // 0,1,2...
  3369. tri2 = (switchpos + 2) % chans; // 2,3,4...
  3370. tri3 = (switchpos + 6) % chans; // 7,6,0...
  3371. for(k = 0;k< chans;k++) {
  3372. if(k == tri1 || k == tri2 || k == tri3) // Add output only to the 2 relevant channels
  3373. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  3374. sampcnt++;
  3375. }
  3376. } else if(switchpos <= 51) { // 44 - 51 TRIANGLE 2
  3377. switchpos -= 44; // 0 - 7
  3378. tri1 = switchpos; // 0,1,2,...
  3379. tri2 = (switchpos + 3) % chans; // 3,4,5...
  3380. tri3 = (switchpos + 5) % chans; // 5,6,7...
  3381. for(k = 0;k< chans;k++) {
  3382. if(k == tri1 || k == tri2 || k == tri3) // Add output only to the 2 relevant channels
  3383. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  3384. sampcnt++;
  3385. }
  3386. } else if(switchpos == 52) { // SQUARE
  3387. for(k = 0;k< chans;k++) {
  3388. if(EVEN(k)) // 0,2,4,6
  3389. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  3390. sampcnt++;
  3391. }
  3392. break;
  3393. } else if(switchpos == 53) { // DIAMOND
  3394. for(k = 0;k< chans;k++) {
  3395. if(ODD(k)) // 1,3,5,7
  3396. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  3397. sampcnt++;
  3398. }
  3399. break;
  3400. } else { // 54 ALL
  3401. for(k = 0;k< chans;k++) { // 0,1,2,3,4,5,6,7
  3402. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  3403. sampcnt++;
  3404. }
  3405. break;
  3406. }
  3407. break;
  3408. default: // STEREO POSITIONED BETWEEN SOME PAIR OF CHANNELS
  3409. for(k = 0;k< chans;k++) {
  3410. if(k == lmost) // Add output only to the 2 relevant channels
  3411. obuf[sampcnt] = (float)(obuf[sampcnt] + val);
  3412. else if(k == rmost)
  3413. obuf[sampcnt] = (float)(obuf[sampcnt] + valr);
  3414. sampcnt++;
  3415. }
  3416. }
  3417. }
  3418. /***************************** GET_POS *******************************/
  3419. void get_drunkpos(int *here,int thisdur,int sndlen,int grain,int n,int *loc,int stepcnt,dataptr dz)
  3420. {
  3421. int step = 0;
  3422. if(dz->iparam[NTEX_AMB] > 0 && (step = get_step(grain,dz))!=0)
  3423. *here = get_new_pos(*here,dz->iparam[NTEX_AMB],dz->iparam[NTEX_LOC],step,sndlen,thisdur);
  3424. else if(loc[n] != dz->iparam[NTEX_LOC]) {
  3425. *here = get_new_locus_pos(*here,dz->iparam[NTEX_AMB],dz->iparam[NTEX_LOC],step,sndlen,thisdur);
  3426. loc[n] = dz->iparam[NTEX_LOC];
  3427. }
  3428. bounce_off_src_end_if_necessary(here,thisdur,sndlen);
  3429. }
  3430. /*************************** GET_STEP **************************/
  3431. int get_step(int grain,dataptr dz)
  3432. {
  3433. int step;
  3434. double dstep = (drand48() * 2.0) - 1.0; /* range +1 to -1 */
  3435. dstep *= dz->iparam[NTEX_GST]; /* range +gstep to -gstep in samples */
  3436. step = (int)round(dstep/(double)grain); /* Step as a multiple of min-grainsize */
  3437. step *= grain; /* Current stepsize in samples */
  3438. return step;
  3439. }
  3440. /*************************** GET_NEW_LOCUS_POS **************************/
  3441. int get_new_locus_pos(int here,int ambitus,int locus,int step,int sndlen,int thisdur)
  3442. {
  3443. int current_stray = here - locus; /* distance frm start available seg (locus) to current pos*/
  3444. int new_stray = current_stray + step; /* new_stray = distance from locus */
  3445. if(new_stray > ambitus || new_stray < -ambitus) /* if new_stray greater than ambitus */
  3446. here = locus + step;
  3447. else
  3448. here += step;
  3449. if(here<0) /* Bounce off start of buffer if ness */
  3450. here = -here;
  3451. return(here);
  3452. }
  3453. /*************************** GET_NEW_POS **************************/
  3454. int get_new_pos(int here,int ambitus,int locus,int step,int sndlen,int thisdur)
  3455. {
  3456. int current_stray = here - locus; /* distance frm start available seg (locus) to current pos*/
  3457. int new_stray = current_stray + step; /* new_stray = distance from locus */
  3458. int otherstray, newstep;
  3459. if(new_stray > ambitus || new_stray < -ambitus ) { /* if new_stray greater than ambitus */
  3460. otherstray = current_stray - step;
  3461. if(otherstray >= 0 && otherstray <= ambitus)
  3462. here = locus + otherstray; /* try reversing step */
  3463. else if(otherstray <0 && otherstray >= -ambitus)
  3464. here = locus + otherstray;
  3465. else {
  3466. newstep = abs(new_stray) % ambitus; /* otherwise take modulus */
  3467. if(step >= 0)
  3468. here = locus + newstep;
  3469. else
  3470. here = locus - newstep;
  3471. }
  3472. } else
  3473. here += step;
  3474. if(here<0) /* Else bounce off start of buffer */
  3475. here = -here;
  3476. return(here);
  3477. }
  3478. /*************************** BOUNCE_OFF_SRC_END_IF_NECESSARY **************************/
  3479. void bounce_off_src_end_if_necessary(int *here,int thisdur,int sndlen)
  3480. {
  3481. int diff, gap; /* if "here" too near end */
  3482. if((diff = sndlen - *here) < thisdur) { /* else Bounce off end */
  3483. gap = thisdur - diff;
  3484. *here -= 2 * gap;
  3485. *here = max(0,*here); // SAFETY
  3486. }
  3487. }