motor.c 95 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223
  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. // _cdprogs\motor motor 1 motorsrc.wav test.wav 10 20 .5 .6 .8 .5
  22. #include <stdio.h>
  23. #include <stdlib.h>
  24. #include <structures.h>
  25. #include <tkglobals.h>
  26. #include <pnames.h>
  27. #include <filetype.h>
  28. #include <processno.h>
  29. #include <modeno.h>
  30. #include <logic.h>
  31. #include <globcon.h>
  32. #include <cdpmain.h>
  33. #include <math.h>
  34. #include <mixxcon.h>
  35. #include <osbind.h>
  36. #include <standalone.h>
  37. #include <science.h>
  38. #include <ctype.h>
  39. #include <sfsys.h>
  40. #include <string.h>
  41. #include <srates.h>
  42. #define gp_maxinsmps rampbrksize
  43. #define gp_maxpulsesmps total_windows
  44. #define minpulsesmps temp_sampsize
  45. #define symwarning fzeroset
  46. #define inbufcnt is_mapping
  47. #define MOT_SNGLE 0
  48. #define MOT_SLICE 1
  49. #define MOT_MULTI 2
  50. #ifdef unix
  51. #define round(x) lround((x))
  52. #endif
  53. #ifndef HUGE
  54. #define HUGE 3.40282347e+38F
  55. #endif
  56. char errstr[2400];
  57. int anal_infiles = 1;
  58. int sloom = 0;
  59. int sloombatch = 0;
  60. const char* cdp_version = "6.1.0";
  61. //CDP LIB REPLACEMENTS
  62. static int check_motor_param_validity_and_consistency(dataptr dz);
  63. static int setup_motor_application(dataptr dz);
  64. static int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz);
  65. static int parse_infile_and_check_type(char **cmdline,dataptr dz);
  66. static int setup_motor_param_ranges_and_defaults(dataptr dz);
  67. static int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz);
  68. static int setup_and_init_input_param_activity(dataptr dz,int tipc);
  69. static int setup_input_param_defaultval_stores(int tipc,aplptr ap);
  70. static int establish_application(dataptr dz);
  71. static int initialise_vflags(dataptr dz);
  72. static int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz);
  73. static int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz);
  74. static int mark_parameter_types(dataptr dz,aplptr ap);
  75. static int assign_file_data_storage(int infilecnt,dataptr dz);
  76. static int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q);
  77. static int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz);
  78. static int get_the_mode_from_cmdline(char *str,dataptr dz);
  79. static int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt);
  80. static int motor(dataptr dz);
  81. static int create_motor_sndbufs(dataptr dz);
  82. static int motor_param_preprocess(dataptr dz);
  83. static void rndpermm(int permlen,int *permm);
  84. static void insert(int m,int t,int permlen,int *permm);
  85. static void prefix(int m,int permlen,int *permm);
  86. static void shuflup(int k,int permlen, int *permm);
  87. static int generate_inner_pulse(float *ebuf,float *ibuf,float *obuf,int ibufpos,int obufpos,int gp_eventsamps,int gp_tail,double incr,
  88. double trem,int output,dataptr dz);
  89. static int calculate_cresc_and_decresc_counts_of_inner_events(int *cresc_cnt,int *decresc_cnt,double *cresctime, double *decresctime,
  90. double sym,double symrnd,double pulsdur,double frq,dataptr dz);
  91. static void calculate_fwd_and_bkwd_sampsteps_in_infile(int *in_upstep,int *in_dnstep,double srate,int chans,
  92. int gp_sampsread,int cresc_cnt,int decresc_cnt,double inner_dur,double edge,int ibufno,dataptr dz);
  93. static void calculate_inputsamps_to_read_and_length_of_tail(int *gp_eventsamps,int *gp_tail,double srate,double inner_dur,double fratio,double edge,dataptr dz);
  94. static int calculate_max_read_events_in_any_env_pulse(int *max_cresccnt,int *max_innercnt,double *frq,double *edge,int arraysize,int *permm,int permcnt,
  95. int *gp_sampsread,dataptr dz);
  96. static int select_infile_to_use(int *bufcntr,int *permm,int permcnt,dataptr dz);
  97. static int handle_the_special_data(char *str,int *max_gp_seg,dataptr dz);
  98. /**************************************** MAIN *********************************************/
  99. int main(int argc,char *argv[])
  100. {
  101. int exit_status, modetype;
  102. dataptr dz = NULL;
  103. char **cmdline;
  104. int cmdlinecnt;
  105. int n, max_gp_seg = 0;
  106. aplptr ap;
  107. int is_launched = FALSE;
  108. if(argc==2 && (strcmp(argv[1],"--version") == 0)) {
  109. fprintf(stdout,"%s\n",cdp_version);
  110. fflush(stdout);
  111. return 0;
  112. }
  113. /* CHECK FOR SOUNDLOOM */
  114. if((sloom = sound_loom_in_use(&argc,&argv)) > 1) {
  115. sloom = 0;
  116. sloombatch = 1;
  117. }
  118. if(sflinit("cdp")){
  119. sfperror("cdp: initialisation\n");
  120. return(FAILED);
  121. }
  122. /* SET UP THE PRINCIPLE DATASTRUCTURE */
  123. if((exit_status = establish_datastructure(&dz))<0) { // CDP LIB
  124. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  125. return(FAILED);
  126. }
  127. if(!sloom) {
  128. if(argc == 1) {
  129. usage1();
  130. return(FAILED);
  131. } else if(argc == 2) {
  132. usage2(argv[1]);
  133. return(FAILED);
  134. }
  135. }
  136. if(!sloom) {
  137. if((exit_status = make_initial_cmdline_check(&argc,&argv))<0) { // CDP LIB
  138. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  139. return(FAILED);
  140. }
  141. cmdline = argv;
  142. cmdlinecnt = argc;
  143. if((get_the_process_no(argv[0],dz))<0)
  144. return(FAILED);
  145. cmdline++;
  146. cmdlinecnt--;
  147. dz->maxmode = 9;
  148. if((exit_status = get_the_mode_from_cmdline(cmdline[0],dz))<0) {
  149. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  150. return(exit_status);
  151. }
  152. cmdline++;
  153. cmdlinecnt--;
  154. // setup_particular_application =
  155. if((exit_status = setup_motor_application(dz))<0) {
  156. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  157. return(FAILED);
  158. }
  159. if((exit_status = count_and_allocate_for_infiles(cmdlinecnt,cmdline,dz))<0) { // CDP LIB
  160. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  161. return(FAILED);
  162. }
  163. } else {
  164. //parse_TK_data() =
  165. if((exit_status = parse_sloom_data(argc,argv,&cmdline,&cmdlinecnt,dz))<0) {
  166. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  167. return(exit_status);
  168. }
  169. }
  170. ap = dz->application;
  171. modetype = dz->mode % 3;
  172. // parse_infile_and_hone_type() =
  173. if((exit_status = parse_infile_and_check_type(cmdline,dz))<0) {
  174. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  175. return(FAILED);
  176. }
  177. // setup_param_ranges_and_defaults() =
  178. if((exit_status = setup_motor_param_ranges_and_defaults(dz))<0) {
  179. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  180. return(FAILED);
  181. }
  182. // open_first_infile CDP LIB
  183. if((exit_status = open_first_infile(cmdline[0],dz))<0) {
  184. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  185. return(FAILED);
  186. }
  187. cmdlinecnt--;
  188. cmdline++;
  189. // handle_extra_infiles() CDP LIB
  190. if((exit_status = handle_extra_infiles(&cmdline,&cmdlinecnt,dz))<0) {
  191. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  192. return(FAILED);
  193. }
  194. dz->gp_maxinsmps = 0;
  195. if(modetype != MOT_SLICE) {
  196. dz->inbufcnt = dz->infilecnt;
  197. for(n=0;n<dz->inbufcnt;n++) // Largest buffer for input data is size of largest infile
  198. dz->gp_maxinsmps = max(dz->gp_maxinsmps,dz->insams[n]);
  199. dz->gp_maxinsmps /= dz->infile->channels;
  200. }
  201. // handle_outfile() =
  202. if((exit_status = handle_the_outfile(&cmdlinecnt,&cmdline,dz))<0) {
  203. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  204. return(FAILED);
  205. }
  206. // handle_formants() redundant
  207. // handle_formant_quiksearch() redundant
  208. // handle_special_data....
  209. if(modetype == MOT_SLICE) {
  210. if((exit_status = handle_the_special_data(cmdline[0],&max_gp_seg,dz))<0) {
  211. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  212. return(FAILED);
  213. }
  214. dz->inbufcnt = dz->itemcnt;
  215. dz->gp_maxinsmps = max_gp_seg; // Largest buffer for input data is size of largest cut seg
  216. cmdlinecnt--;
  217. cmdline++;
  218. }
  219. if((exit_status = read_parameters_and_flags(&cmdline,&cmdlinecnt,dz))<0) { // CDP LIB
  220. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  221. return(FAILED);
  222. }
  223. // check_param_validity_and_consistency....
  224. if((exit_status = check_motor_param_validity_and_consistency(dz))<0) {
  225. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  226. return(FAILED);
  227. }
  228. //param_preprocess =
  229. if((exit_status = motor_param_preprocess(dz))<0) {
  230. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  231. return(FAILED);
  232. }
  233. is_launched = TRUE;
  234. dz->bufcnt = dz->inbufcnt + 3;
  235. if((dz->sampbuf = (float **)malloc(sizeof(float *) * (dz->bufcnt+1)))==NULL) {
  236. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffers.\n");
  237. return(MEMORY_ERROR);
  238. }
  239. if((dz->sbufptr = (float **)malloc(sizeof(float *) * dz->bufcnt))==NULL) {
  240. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffer pointers.\n");
  241. return(MEMORY_ERROR);
  242. }
  243. for(n = 0;n <dz->bufcnt; n++)
  244. dz->sampbuf[n] = dz->sbufptr[n] = (float *)0;
  245. dz->sampbuf[n] = (float *)0;
  246. if((exit_status = create_motor_sndbufs(dz))<0) {
  247. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  248. return(FAILED);
  249. }
  250. //spec_process_file =
  251. if((exit_status = motor(dz))<0) {
  252. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  253. return(FAILED);
  254. }
  255. if((exit_status = complete_output(dz))<0) { // CDP LIB
  256. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  257. return(FAILED);
  258. }
  259. exit_status = print_messages_and_close_sndfiles(FINISHED,is_launched,dz); // CDP LIB
  260. free(dz);
  261. return(SUCCEEDED);
  262. }
  263. /**********************************************
  264. REPLACED CDP LIB FUNCTIONS
  265. **********************************************/
  266. /****************************** SET_PARAM_DATA *********************************/
  267. int set_param_data(aplptr ap, int special_data,int maxparamcnt,int paramcnt,char *paramlist)
  268. {
  269. ap->special_data = (char)special_data;
  270. ap->param_cnt = (char)paramcnt;
  271. ap->max_param_cnt = (char)maxparamcnt;
  272. if(ap->max_param_cnt>0) {
  273. if((ap->param_list = (char *)malloc((size_t)(ap->max_param_cnt+1)))==NULL) {
  274. sprintf(errstr,"INSUFFICIENT MEMORY: for param_list\n");
  275. return(MEMORY_ERROR);
  276. }
  277. strcpy(ap->param_list,paramlist);
  278. }
  279. return(FINISHED);
  280. }
  281. /****************************** SET_VFLGS *********************************/
  282. int set_vflgs
  283. (aplptr ap,char *optflags,int optcnt,char *optlist,char *varflags,int vflagcnt, int vparamcnt,char *varlist)
  284. {
  285. ap->option_cnt = (char) optcnt; /*RWD added cast */
  286. if(optcnt) {
  287. if((ap->option_list = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  288. sprintf(errstr,"INSUFFICIENT MEMORY: for option_list\n");
  289. return(MEMORY_ERROR);
  290. }
  291. strcpy(ap->option_list,optlist);
  292. if((ap->option_flags = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  293. sprintf(errstr,"INSUFFICIENT MEMORY: for option_flags\n");
  294. return(MEMORY_ERROR);
  295. }
  296. strcpy(ap->option_flags,optflags);
  297. }
  298. ap->vflag_cnt = (char) vflagcnt;
  299. ap->variant_param_cnt = (char) vparamcnt;
  300. if(vflagcnt) {
  301. if((ap->variant_list = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  302. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_list\n");
  303. return(MEMORY_ERROR);
  304. }
  305. strcpy(ap->variant_list,varlist);
  306. if((ap->variant_flags = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  307. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_flags\n");
  308. return(MEMORY_ERROR);
  309. }
  310. strcpy(ap->variant_flags,varflags);
  311. }
  312. return(FINISHED);
  313. }
  314. /***************************** APPLICATION_INIT **************************/
  315. int application_init(dataptr dz)
  316. {
  317. int exit_status;
  318. int storage_cnt;
  319. int tipc, brkcnt;
  320. aplptr ap = dz->application;
  321. if(ap->vflag_cnt>0)
  322. initialise_vflags(dz);
  323. tipc = ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt;
  324. ap->total_input_param_cnt = (char)tipc;
  325. if(tipc>0) {
  326. if((exit_status = setup_input_param_range_stores(tipc,ap))<0)
  327. return(exit_status);
  328. if((exit_status = setup_input_param_defaultval_stores(tipc,ap))<0)
  329. return(exit_status);
  330. if((exit_status = setup_and_init_input_param_activity(dz,tipc))<0)
  331. return(exit_status);
  332. }
  333. brkcnt = tipc;
  334. //THERE ARE NO INPUTFILE brktables USED IN THIS PROCESS
  335. if(brkcnt>0) {
  336. if((exit_status = setup_and_init_input_brktable_constants(dz,brkcnt))<0)
  337. return(exit_status);
  338. }
  339. if((storage_cnt = tipc + ap->internal_param_cnt)>0) {
  340. if((exit_status = setup_parameter_storage_and_constants(storage_cnt,dz))<0)
  341. return(exit_status);
  342. if((exit_status = initialise_is_int_and_no_brk_constants(storage_cnt,dz))<0)
  343. return(exit_status);
  344. }
  345. if((exit_status = mark_parameter_types(dz,ap))<0)
  346. return(exit_status);
  347. switch(dz->input_data_type) {
  348. case(SNDFILES_ONLY):
  349. dz->infilecnt = 1;
  350. break;
  351. case(MANY_SNDFILES):
  352. dz->infilecnt = -2;
  353. break;
  354. }
  355. //establish_bufptrs_and_extra_buffers():
  356. return(FINISHED);
  357. }
  358. /********************** SETUP_PARAMETER_STORAGE_AND_CONSTANTS ********************/
  359. /* RWD mallo changed to calloc; helps debug verison run as release! */
  360. int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz)
  361. {
  362. if((dz->param = (double *)calloc(storage_cnt, sizeof(double)))==NULL) {
  363. sprintf(errstr,"setup_parameter_storage_and_constants(): 1\n");
  364. return(MEMORY_ERROR);
  365. }
  366. if((dz->iparam = (int *)calloc(storage_cnt, sizeof(int) ))==NULL) {
  367. sprintf(errstr,"setup_parameter_storage_and_constants(): 2\n");
  368. return(MEMORY_ERROR);
  369. }
  370. if((dz->is_int = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  371. sprintf(errstr,"setup_parameter_storage_and_constants(): 3\n");
  372. return(MEMORY_ERROR);
  373. }
  374. if((dz->no_brk = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  375. sprintf(errstr,"setup_parameter_storage_and_constants(): 5\n");
  376. return(MEMORY_ERROR);
  377. }
  378. return(FINISHED);
  379. }
  380. /************** INITIALISE_IS_INT_AND_NO_BRK_CONSTANTS *****************/
  381. int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz)
  382. {
  383. int n;
  384. for(n=0;n<storage_cnt;n++) {
  385. dz->is_int[n] = (char)0;
  386. dz->no_brk[n] = (char)0;
  387. }
  388. return(FINISHED);
  389. }
  390. /***************************** MARK_PARAMETER_TYPES **************************/
  391. int mark_parameter_types(dataptr dz,aplptr ap)
  392. {
  393. int n, m; /* PARAMS */
  394. for(n=0;n<ap->max_param_cnt;n++) {
  395. switch(ap->param_list[n]) {
  396. case('0'): break; /* dz->is_active[n] = 0 is default */
  397. case('i'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1;dz->no_brk[n] = (char)1; break;
  398. case('I'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1; break;
  399. case('d'): dz->is_active[n] = (char)1; dz->no_brk[n] = (char)1; break;
  400. case('D'): dz->is_active[n] = (char)1; /* normal case: double val or brkpnt file */ break;
  401. default:
  402. sprintf(errstr,"Programming error: invalid parameter type in mark_parameter_types()\n");
  403. return(PROGRAM_ERROR);
  404. }
  405. } /* OPTIONS */
  406. for(n=0,m=ap->max_param_cnt;n<ap->option_cnt;n++,m++) {
  407. switch(ap->option_list[n]) {
  408. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  409. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  410. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  411. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  412. default:
  413. sprintf(errstr,"Programming error: invalid option type in mark_parameter_types()\n");
  414. return(PROGRAM_ERROR);
  415. }
  416. } /* VARIANTS */
  417. for(n=0,m=ap->max_param_cnt + ap->option_cnt;n < ap->variant_param_cnt; n++, m++) {
  418. switch(ap->variant_list[n]) {
  419. case('0'): break;
  420. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  421. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  422. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  423. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  424. default:
  425. sprintf(errstr,"Programming error: invalid variant type in mark_parameter_types()\n");
  426. return(PROGRAM_ERROR);
  427. }
  428. } /* INTERNAL */
  429. for(n=0,
  430. m=ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt; n<ap->internal_param_cnt; n++,m++) {
  431. switch(ap->internal_param_list[n]) {
  432. case('0'): break; /* dummy variables: variables not used: but important for internal paream numbering!! */
  433. case('i'): dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  434. case('d'): dz->no_brk[m] = (char)1; break;
  435. default:
  436. sprintf(errstr,"Programming error: invalid internal param type in mark_parameter_types()\n");
  437. return(PROGRAM_ERROR);
  438. }
  439. }
  440. return(FINISHED);
  441. }
  442. /************************ HANDLE_THE_OUTFILE *********************/
  443. int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz)
  444. {
  445. int exit_status;
  446. char *filename = (*cmdline)[0];
  447. if(filename[0]=='-' && filename[1]=='f') {
  448. dz->floatsam_output = 1;
  449. dz->true_outfile_stype = SAMP_FLOAT;
  450. filename+= 2;
  451. }
  452. if(!sloom) {
  453. if(file_has_invalid_startchar(filename) || value_is_numeric(filename)) {
  454. sprintf(errstr,"Outfile name %s has invalid start character(s) or looks too much like a number.\n",filename);
  455. return(DATA_ERROR);
  456. }
  457. }
  458. strcpy(dz->outfilename,filename);
  459. if((exit_status = create_sized_outfile(filename,dz))<0)
  460. return(exit_status);
  461. (*cmdline)++;
  462. (*cmdlinecnt)--;
  463. return(FINISHED);
  464. }
  465. /***************************** ESTABLISH_APPLICATION **************************/
  466. int establish_application(dataptr dz)
  467. {
  468. aplptr ap;
  469. if((dz->application = (aplptr)malloc(sizeof (struct applic)))==NULL) {
  470. sprintf(errstr,"establish_application()\n");
  471. return(MEMORY_ERROR);
  472. }
  473. ap = dz->application;
  474. memset((char *)ap,0,sizeof(struct applic));
  475. return(FINISHED);
  476. }
  477. /************************* INITIALISE_VFLAGS *************************/
  478. int initialise_vflags(dataptr dz)
  479. {
  480. int n;
  481. if((dz->vflag = (char *)malloc(dz->application->vflag_cnt * sizeof(char)))==NULL) {
  482. sprintf(errstr,"INSUFFICIENT MEMORY: vflag store,\n");
  483. return(MEMORY_ERROR);
  484. }
  485. for(n=0;n<dz->application->vflag_cnt;n++)
  486. dz->vflag[n] = FALSE;
  487. return FINISHED;
  488. }
  489. /************************* SETUP_INPUT_PARAM_DEFAULTVALS *************************/
  490. int setup_input_param_defaultval_stores(int tipc,aplptr ap)
  491. {
  492. int n;
  493. if((ap->default_val = (double *)malloc(tipc * sizeof(double)))==NULL) {
  494. sprintf(errstr,"INSUFFICIENT MEMORY for application default values store\n");
  495. return(MEMORY_ERROR);
  496. }
  497. for(n=0;n<tipc;n++)
  498. ap->default_val[n] = 0.0;
  499. return(FINISHED);
  500. }
  501. /***************************** SETUP_AND_INIT_INPUT_PARAM_ACTIVITY **************************/
  502. int setup_and_init_input_param_activity(dataptr dz,int tipc)
  503. {
  504. int n;
  505. if((dz->is_active = (char *)malloc((size_t)tipc))==NULL) {
  506. sprintf(errstr,"setup_and_init_input_param_activity()\n");
  507. return(MEMORY_ERROR);
  508. }
  509. for(n=0;n<tipc;n++)
  510. dz->is_active[n] = (char)0;
  511. return(FINISHED);
  512. }
  513. /************************* SETUP_MOTOR_APPLICATION *******************/
  514. int setup_motor_application(dataptr dz)
  515. {
  516. int exit_status, modetype = dz->mode % 3;
  517. aplptr ap;
  518. if((exit_status = establish_application(dz))<0) // GLOBAL
  519. return(FAILED);
  520. ap = dz->application;
  521. // SEE parstruct FOR EXPLANATION of next 2 functions
  522. switch(modetype) {
  523. case(MOT_SNGLE): exit_status = set_param_data(ap,0 ,6,6,"dDDDDD"); break;
  524. case(MOT_SLICE): exit_status = set_param_data(ap,MOTORDATA,6,6,"dDDDDD"); break;
  525. case(MOT_MULTI): exit_status = set_param_data(ap,0 ,6,6,"dDDDDD"); break;
  526. }
  527. if((exit_status = set_param_data(ap,0 ,6,6,"DDDDDd"))<0)
  528. return(FAILED);
  529. switch(modetype) {
  530. case(MOT_SNGLE): exit_status = set_vflgs(ap,"fpjtyebvs",9,"DDDDDDDDi","a",1,0,"0"); break;
  531. case(MOT_SLICE): // fall thro
  532. case(MOT_MULTI): exit_status = set_vflgs(ap,"fpjtyebvs",9,"DDDDDDDDi","ac",2,0,"00"); break;
  533. }
  534. if(exit_status<0)
  535. return(FAILED);
  536. // set_legal_infile_structure -->
  537. dz->has_otherfile = FALSE;
  538. // assign_process_logic -->
  539. switch(modetype) {
  540. case(MOT_SNGLE): // fall thro
  541. case(MOT_SLICE): dz->input_data_type = SNDFILES_ONLY; break;
  542. case(MOT_MULTI): dz->input_data_type = MANY_SNDFILES; break;
  543. }
  544. dz->process_type = UNEQUAL_SNDFILE;
  545. dz->outfiletype = SNDFILE_OUT;
  546. return application_init(dz); //GLOBAL
  547. }
  548. /************************* PARSE_INFILE_AND_CHECK_TYPE *******************/
  549. int parse_infile_and_check_type(char **cmdline,dataptr dz)
  550. {
  551. int exit_status;
  552. infileptr infile_info;
  553. if(!sloom) {
  554. if((infile_info = (infileptr)malloc(sizeof(struct filedata)))==NULL) {
  555. sprintf(errstr,"INSUFFICIENT MEMORY for infile structure to test file data.");
  556. return(MEMORY_ERROR);
  557. } else if((exit_status = cdparse(cmdline[0],infile_info))<0) {
  558. sprintf(errstr,"Failed to parse input file %s\n",cmdline[0]);
  559. return(PROGRAM_ERROR);
  560. } else if(infile_info->filetype != SNDFILE) {
  561. sprintf(errstr,"File %s is not of correct type\n",cmdline[0]);
  562. return(DATA_ERROR);
  563. } else if((exit_status = copy_parse_info_to_main_structure(infile_info,dz))<0) {
  564. sprintf(errstr,"Failed to copy file parsing information\n");
  565. return(PROGRAM_ERROR);
  566. }
  567. free(infile_info);
  568. }
  569. return(FINISHED);
  570. }
  571. /************************* SETUP_MOTOR_PARAM_RANGES_AND_DEFAULTS *******************/
  572. int setup_motor_param_ranges_and_defaults(dataptr dz)
  573. {
  574. int exit_status;
  575. aplptr ap = dz->application;
  576. // set_param_ranges()
  577. ap->total_input_param_cnt = (char)(ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt);
  578. // NB total_input_param_cnt is > 0 !!!
  579. if((exit_status = setup_input_param_range_stores(ap->total_input_param_cnt,ap))<0)
  580. return(FAILED);
  581. // get_param_ranges()
  582. ap->lo[MOT_DUR] = 1.0;
  583. ap->hi[MOT_DUR] = 7200.0;
  584. ap->default_val[MOT_DUR] = 20.0;
  585. ap->lo[MOT_FRQ] = 2;
  586. ap->hi[MOT_FRQ] = 100;
  587. ap->default_val[MOT_FRQ] = MOT_FRQ_DFLT;
  588. ap->lo[MOT_PULSE] = 0.1;
  589. ap->hi[MOT_PULSE] = 10.0;
  590. ap->default_val[MOT_PULSE] = 1.0;
  591. ap->lo[MOT_FRATIO] = 0.0;
  592. ap->hi[MOT_FRATIO] = 1.0;
  593. ap->default_val[MOT_FRATIO] = 0.5;
  594. ap->lo[MOT_PRATIO] = 0.0;
  595. ap->hi[MOT_PRATIO] = 1.0;
  596. ap->default_val[MOT_PRATIO] = 1.0;
  597. ap->lo[MOT_SYM] = 0.0;
  598. ap->hi[MOT_SYM] = 1.0;
  599. ap->default_val[MOT_SYM] = 0.5;
  600. ap->lo[MOT_FRND] = 0.0;
  601. ap->hi[MOT_FRND] = 1.0;
  602. ap->default_val[MOT_FRND] = 0.0;
  603. ap->lo[MOT_PRND] = 0.0;
  604. ap->hi[MOT_PRND] = 1.0;
  605. ap->default_val[MOT_PRND] = 0.0;
  606. ap->lo[MOT_JIT] = 0.0;
  607. ap->hi[MOT_JIT] = 3.0;
  608. ap->default_val[MOT_JIT] = 0.0;
  609. ap->lo[MOT_TREM] = 0.0;
  610. ap->hi[MOT_TREM] = 1.0;
  611. ap->default_val[MOT_TREM] = 0.0;
  612. ap->lo[MOT_SYMRND] = 0.0;
  613. ap->hi[MOT_SYMRND] = 1.0;
  614. ap->default_val[MOT_SYMRND] = 0.0;
  615. ap->lo[MOT_EDGE] = 0;
  616. ap->hi[MOT_EDGE] = 20.0;
  617. ap->default_val[MOT_EDGE] = 0;
  618. ap->lo[MOT_BITE] = 0.1;
  619. ap->hi[MOT_BITE] = 10.0;
  620. ap->default_val[MOT_BITE] = 3.0;
  621. ap->lo[MOT_VARY] = 0;
  622. ap->hi[MOT_VARY] = 1.0;
  623. ap->default_val[MOT_VARY] = 0.0;
  624. ap->lo[MOT_SEED] = 0;
  625. ap->hi[MOT_SEED] = 256;
  626. ap->default_val[MOT_SEED] = 0;
  627. dz->maxmode = 9;
  628. if(!sloom)
  629. put_default_vals_in_all_params(dz);
  630. return(FINISHED);
  631. }
  632. /********************************* PARSE_SLOOM_DATA *********************************/
  633. int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz)
  634. {
  635. int exit_status;
  636. int cnt = 1, infilecnt;
  637. int filesize, insams, inbrksize;
  638. double dummy;
  639. int true_cnt = 0;
  640. aplptr ap;
  641. while(cnt<=PRE_CMDLINE_DATACNT) {
  642. if(cnt > argc) {
  643. sprintf(errstr,"Insufficient data sent from TK\n");
  644. return(DATA_ERROR);
  645. }
  646. switch(cnt) {
  647. case(1):
  648. if(sscanf(argv[cnt],"%d",&dz->process)!=1) {
  649. sprintf(errstr,"Cannot read process no. sent from TK\n");
  650. return(DATA_ERROR);
  651. }
  652. break;
  653. case(2):
  654. if(sscanf(argv[cnt],"%d",&dz->mode)!=1) {
  655. sprintf(errstr,"Cannot read mode no. sent from TK\n");
  656. return(DATA_ERROR);
  657. }
  658. if(dz->mode > 0)
  659. dz->mode--;
  660. //setup_particular_application() =
  661. if((exit_status = setup_motor_application(dz))<0)
  662. return(exit_status);
  663. ap = dz->application;
  664. break;
  665. case(3):
  666. if(sscanf(argv[cnt],"%d",&infilecnt)!=1) {
  667. sprintf(errstr,"Cannot read infilecnt sent from TK\n");
  668. return(DATA_ERROR);
  669. }
  670. if(infilecnt < 1) {
  671. true_cnt = cnt + 1;
  672. cnt = PRE_CMDLINE_DATACNT; /* force exit from loop after assign_file_data_storage */
  673. }
  674. if((exit_status = assign_file_data_storage(infilecnt,dz))<0)
  675. return(exit_status);
  676. break;
  677. case(INPUT_FILETYPE+4):
  678. if(sscanf(argv[cnt],"%d",&dz->infile->filetype)!=1) {
  679. sprintf(errstr,"Cannot read filetype sent from TK (%s)\n",argv[cnt]);
  680. return(DATA_ERROR);
  681. }
  682. break;
  683. case(INPUT_FILESIZE+4):
  684. if(sscanf(argv[cnt],"%d",&filesize)!=1) {
  685. sprintf(errstr,"Cannot read infilesize sent from TK\n");
  686. return(DATA_ERROR);
  687. }
  688. dz->insams[0] = filesize;
  689. break;
  690. case(INPUT_INSAMS+4):
  691. if(sscanf(argv[cnt],"%d",&insams)!=1) {
  692. sprintf(errstr,"Cannot read insams sent from TK\n");
  693. return(DATA_ERROR);
  694. }
  695. dz->insams[0] = insams;
  696. break;
  697. case(INPUT_SRATE+4):
  698. if(sscanf(argv[cnt],"%d",&dz->infile->srate)!=1) {
  699. sprintf(errstr,"Cannot read srate sent from TK\n");
  700. return(DATA_ERROR);
  701. }
  702. break;
  703. case(INPUT_CHANNELS+4):
  704. if(sscanf(argv[cnt],"%d",&dz->infile->channels)!=1) {
  705. sprintf(errstr,"Cannot read channels sent from TK\n");
  706. return(DATA_ERROR);
  707. }
  708. break;
  709. case(INPUT_STYPE+4):
  710. if(sscanf(argv[cnt],"%d",&dz->infile->stype)!=1) {
  711. sprintf(errstr,"Cannot read stype sent from TK\n");
  712. return(DATA_ERROR);
  713. }
  714. break;
  715. case(INPUT_ORIGSTYPE+4):
  716. if(sscanf(argv[cnt],"%d",&dz->infile->origstype)!=1) {
  717. sprintf(errstr,"Cannot read origstype sent from TK\n");
  718. return(DATA_ERROR);
  719. }
  720. break;
  721. case(INPUT_ORIGRATE+4):
  722. if(sscanf(argv[cnt],"%d",&dz->infile->origrate)!=1) {
  723. sprintf(errstr,"Cannot read origrate sent from TK\n");
  724. return(DATA_ERROR);
  725. }
  726. break;
  727. case(INPUT_MLEN+4):
  728. if(sscanf(argv[cnt],"%d",&dz->infile->Mlen)!=1) {
  729. sprintf(errstr,"Cannot read Mlen sent from TK\n");
  730. return(DATA_ERROR);
  731. }
  732. break;
  733. case(INPUT_DFAC+4):
  734. if(sscanf(argv[cnt],"%d",&dz->infile->Dfac)!=1) {
  735. sprintf(errstr,"Cannot read Dfac sent from TK\n");
  736. return(DATA_ERROR);
  737. }
  738. break;
  739. case(INPUT_ORIGCHANS+4):
  740. if(sscanf(argv[cnt],"%d",&dz->infile->origchans)!=1) {
  741. sprintf(errstr,"Cannot read origchans sent from TK\n");
  742. return(DATA_ERROR);
  743. }
  744. break;
  745. case(INPUT_SPECENVCNT+4):
  746. if(sscanf(argv[cnt],"%d",&dz->infile->specenvcnt)!=1) {
  747. sprintf(errstr,"Cannot read specenvcnt sent from TK\n");
  748. return(DATA_ERROR);
  749. }
  750. dz->specenvcnt = dz->infile->specenvcnt;
  751. break;
  752. case(INPUT_WANTED+4):
  753. if(sscanf(argv[cnt],"%d",&dz->wanted)!=1) {
  754. sprintf(errstr,"Cannot read wanted sent from TK\n");
  755. return(DATA_ERROR);
  756. }
  757. break;
  758. case(INPUT_WLENGTH+4):
  759. if(sscanf(argv[cnt],"%d",&dz->wlength)!=1) {
  760. sprintf(errstr,"Cannot read wlength sent from TK\n");
  761. return(DATA_ERROR);
  762. }
  763. break;
  764. case(INPUT_OUT_CHANS+4):
  765. if(sscanf(argv[cnt],"%d",&dz->out_chans)!=1) {
  766. sprintf(errstr,"Cannot read out_chans sent from TK\n");
  767. return(DATA_ERROR);
  768. }
  769. break;
  770. /* RWD these chanegs to samps - tk will have to deal with that! */
  771. case(INPUT_DESCRIPTOR_BYTES+4):
  772. if(sscanf(argv[cnt],"%d",&dz->descriptor_samps)!=1) {
  773. sprintf(errstr,"Cannot read descriptor_samps sent from TK\n");
  774. return(DATA_ERROR);
  775. }
  776. break;
  777. case(INPUT_IS_TRANSPOS+4):
  778. if(sscanf(argv[cnt],"%d",&dz->is_transpos)!=1) {
  779. sprintf(errstr,"Cannot read is_transpos sent from TK\n");
  780. return(DATA_ERROR);
  781. }
  782. break;
  783. case(INPUT_COULD_BE_TRANSPOS+4):
  784. if(sscanf(argv[cnt],"%d",&dz->could_be_transpos)!=1) {
  785. sprintf(errstr,"Cannot read could_be_transpos sent from TK\n");
  786. return(DATA_ERROR);
  787. }
  788. break;
  789. case(INPUT_COULD_BE_PITCH+4):
  790. if(sscanf(argv[cnt],"%d",&dz->could_be_pitch)!=1) {
  791. sprintf(errstr,"Cannot read could_be_pitch sent from TK\n");
  792. return(DATA_ERROR);
  793. }
  794. break;
  795. case(INPUT_DIFFERENT_SRATES+4):
  796. if(sscanf(argv[cnt],"%d",&dz->different_srates)!=1) {
  797. sprintf(errstr,"Cannot read different_srates sent from TK\n");
  798. return(DATA_ERROR);
  799. }
  800. break;
  801. case(INPUT_DUPLICATE_SNDS+4):
  802. if(sscanf(argv[cnt],"%d",&dz->duplicate_snds)!=1) {
  803. sprintf(errstr,"Cannot read duplicate_snds sent from TK\n");
  804. return(DATA_ERROR);
  805. }
  806. break;
  807. case(INPUT_BRKSIZE+4):
  808. if(sscanf(argv[cnt],"%d",&inbrksize)!=1) {
  809. sprintf(errstr,"Cannot read brksize sent from TK\n");
  810. return(DATA_ERROR);
  811. }
  812. if(inbrksize > 0) {
  813. switch(dz->input_data_type) {
  814. case(WORDLIST_ONLY):
  815. break;
  816. case(PITCH_AND_PITCH):
  817. case(PITCH_AND_TRANSPOS):
  818. case(TRANSPOS_AND_TRANSPOS):
  819. dz->tempsize = inbrksize;
  820. break;
  821. case(BRKFILES_ONLY):
  822. case(UNRANGED_BRKFILE_ONLY):
  823. case(DB_BRKFILES_ONLY):
  824. case(ALL_FILES):
  825. case(ANY_NUMBER_OF_ANY_FILES):
  826. if(dz->extrabrkno < 0) {
  827. sprintf(errstr,"Storage location number for brktable not established by CDP.\n");
  828. return(DATA_ERROR);
  829. }
  830. if(dz->brksize == NULL) {
  831. sprintf(errstr,"CDP has not established storage space for input brktable.\n");
  832. return(PROGRAM_ERROR);
  833. }
  834. dz->brksize[dz->extrabrkno] = inbrksize;
  835. break;
  836. default:
  837. sprintf(errstr,"TK sent brktablesize > 0 for input_data_type [%d] not using brktables.\n",
  838. dz->input_data_type);
  839. return(PROGRAM_ERROR);
  840. }
  841. break;
  842. }
  843. break;
  844. case(INPUT_NUMSIZE+4):
  845. if(sscanf(argv[cnt],"%d",&dz->numsize)!=1) {
  846. sprintf(errstr,"Cannot read numsize sent from TK\n");
  847. return(DATA_ERROR);
  848. }
  849. break;
  850. case(INPUT_LINECNT+4):
  851. if(sscanf(argv[cnt],"%d",&dz->linecnt)!=1) {
  852. sprintf(errstr,"Cannot read linecnt sent from TK\n");
  853. return(DATA_ERROR);
  854. }
  855. break;
  856. case(INPUT_ALL_WORDS+4):
  857. if(sscanf(argv[cnt],"%d",&dz->all_words)!=1) {
  858. sprintf(errstr,"Cannot read all_words sent from TK\n");
  859. return(DATA_ERROR);
  860. }
  861. break;
  862. case(INPUT_ARATE+4):
  863. if(sscanf(argv[cnt],"%f",&dz->infile->arate)!=1) {
  864. sprintf(errstr,"Cannot read arate sent from TK\n");
  865. return(DATA_ERROR);
  866. }
  867. break;
  868. case(INPUT_FRAMETIME+4):
  869. if(sscanf(argv[cnt],"%lf",&dummy)!=1) {
  870. sprintf(errstr,"Cannot read frametime sent from TK\n");
  871. return(DATA_ERROR);
  872. }
  873. dz->frametime = (float)dummy;
  874. break;
  875. case(INPUT_WINDOW_SIZE+4):
  876. if(sscanf(argv[cnt],"%f",&dz->infile->window_size)!=1) {
  877. sprintf(errstr,"Cannot read window_size sent from TK\n");
  878. return(DATA_ERROR);
  879. }
  880. break;
  881. case(INPUT_NYQUIST+4):
  882. if(sscanf(argv[cnt],"%lf",&dz->nyquist)!=1) {
  883. sprintf(errstr,"Cannot read nyquist sent from TK\n");
  884. return(DATA_ERROR);
  885. }
  886. break;
  887. case(INPUT_DURATION+4):
  888. if(sscanf(argv[cnt],"%lf",&dz->duration)!=1) {
  889. sprintf(errstr,"Cannot read duration sent from TK\n");
  890. return(DATA_ERROR);
  891. }
  892. break;
  893. case(INPUT_MINBRK+4):
  894. if(sscanf(argv[cnt],"%lf",&dz->minbrk)!=1) {
  895. sprintf(errstr,"Cannot read minbrk sent from TK\n");
  896. return(DATA_ERROR);
  897. }
  898. break;
  899. case(INPUT_MAXBRK+4):
  900. if(sscanf(argv[cnt],"%lf",&dz->maxbrk)!=1) {
  901. sprintf(errstr,"Cannot read maxbrk sent from TK\n");
  902. return(DATA_ERROR);
  903. }
  904. break;
  905. case(INPUT_MINNUM+4):
  906. if(sscanf(argv[cnt],"%lf",&dz->minnum)!=1) {
  907. sprintf(errstr,"Cannot read minnum sent from TK\n");
  908. return(DATA_ERROR);
  909. }
  910. break;
  911. case(INPUT_MAXNUM+4):
  912. if(sscanf(argv[cnt],"%lf",&dz->maxnum)!=1) {
  913. sprintf(errstr,"Cannot read maxnum sent from TK\n");
  914. return(DATA_ERROR);
  915. }
  916. break;
  917. default:
  918. sprintf(errstr,"case switch item missing: parse_sloom_data()\n");
  919. return(PROGRAM_ERROR);
  920. }
  921. cnt++;
  922. }
  923. if(cnt!=PRE_CMDLINE_DATACNT+1) {
  924. sprintf(errstr,"Insufficient pre-cmdline params sent from TK\n");
  925. return(DATA_ERROR);
  926. }
  927. if(true_cnt)
  928. cnt = true_cnt;
  929. *cmdlinecnt = 0;
  930. while(cnt < argc) {
  931. if((exit_status = get_tk_cmdline_word(cmdlinecnt,cmdline,argv[cnt]))<0)
  932. return(exit_status);
  933. cnt++;
  934. }
  935. return(FINISHED);
  936. }
  937. /********************************* GET_TK_CMDLINE_WORD *********************************/
  938. int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q)
  939. {
  940. if(*cmdlinecnt==0) {
  941. if((*cmdline = (char **)malloc(sizeof(char *)))==NULL) {
  942. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  943. return(MEMORY_ERROR);
  944. }
  945. } else {
  946. if((*cmdline = (char **)realloc(*cmdline,((*cmdlinecnt)+1) * sizeof(char *)))==NULL) {
  947. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  948. return(MEMORY_ERROR);
  949. }
  950. }
  951. if(((*cmdline)[*cmdlinecnt] = (char *)malloc((strlen(q) + 1) * sizeof(char)))==NULL) {
  952. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline item %d.\n",(*cmdlinecnt)+1);
  953. return(MEMORY_ERROR);
  954. }
  955. strcpy((*cmdline)[*cmdlinecnt],q);
  956. (*cmdlinecnt)++;
  957. return(FINISHED);
  958. }
  959. /****************************** ASSIGN_FILE_DATA_STORAGE *********************************/
  960. int assign_file_data_storage(int infilecnt,dataptr dz)
  961. {
  962. int exit_status;
  963. int no_sndfile_system_files = FALSE;
  964. dz->infilecnt = infilecnt;
  965. if((exit_status = allocate_filespace(dz))<0)
  966. return(exit_status);
  967. if(no_sndfile_system_files)
  968. dz->infilecnt = 0;
  969. return(FINISHED);
  970. }
  971. /************************* redundant functions: to ensure libs compile OK *******************/
  972. int assign_process_logic(dataptr dz)
  973. {
  974. return(FINISHED);
  975. }
  976. void set_legal_infile_structure(dataptr dz)
  977. {}
  978. int set_legal_internalparam_structure(int process,int mode,aplptr ap)
  979. {
  980. return(FINISHED);
  981. }
  982. int setup_internal_arrays_and_array_pointers(dataptr dz)
  983. {
  984. return(FINISHED);
  985. }
  986. int establish_bufptrs_and_extra_buffers(dataptr dz)
  987. {
  988. return(FINISHED);
  989. }
  990. int read_special_data(char *str,dataptr dz)
  991. {
  992. return(FINISHED);
  993. }
  994. int inner_loop
  995. (int *peakscore,int *descnt,int *in_start_portion,int *least,int *pitchcnt,int windows_in_buf,dataptr dz)
  996. {
  997. return(FINISHED);
  998. }
  999. int get_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  1000. {
  1001. return(FINISHED);
  1002. }
  1003. /******************************** USAGE1 ********************************/
  1004. int usage1(void)
  1005. {
  1006. usage2("motor");
  1007. return(USAGE_ONLY);
  1008. }
  1009. /**************************** CHECK_MOTOR_PARAM_VALIDITY_AND_CONSISTENCY *****************************/
  1010. int check_motor_param_validity_and_consistency(dataptr dz)
  1011. {
  1012. int exit_status;
  1013. double maxratio, maxpulse, minfrq, minpulsedur, maxfrqdur;
  1014. if(dz->brksize[MOT_FRATIO]) {
  1015. if((exit_status = get_maxvalue_in_brktable(&maxratio,MOT_FRATIO,dz))<0)
  1016. return exit_status;
  1017. } else
  1018. maxratio = dz->param[MOT_FRATIO];
  1019. if(maxratio == 0.0) {
  1020. sprintf(errstr,"Zero event-ratio will create a silent output.\n");
  1021. return DATA_ERROR;
  1022. }
  1023. if(dz->brksize[MOT_PRATIO]) {
  1024. if((exit_status = get_maxvalue_in_brktable(&maxratio,MOT_PRATIO,dz))<0)
  1025. return exit_status;
  1026. } else
  1027. maxratio = dz->param[MOT_PRATIO];
  1028. if(maxratio == 0.0) {
  1029. sprintf(errstr,"Zero pulsed-enveloped-ratio will create a silent output.\n");
  1030. return DATA_ERROR;
  1031. }
  1032. if((dz->brksize[MOT_VARY] || dz->param[MOT_VARY] > 0.0) && dz->vflag[MOT_FXDSTP]) {
  1033. sprintf(errstr,"Fixed step and varying step in src-read cannot both be used.\n");
  1034. return DATA_ERROR;
  1035. }
  1036. if(dz->brksize[MOT_PULSE]) {
  1037. if((exit_status = get_maxvalue_in_brktable(&maxpulse,MOT_PULSE,dz))<0)
  1038. return exit_status;
  1039. } else
  1040. maxpulse = dz->param[MOT_PULSE];
  1041. if(dz->brksize[MOT_FRQ]) {
  1042. if((exit_status = get_minvalue_in_brktable(&minfrq,MOT_FRQ,dz))<0)
  1043. return exit_status;
  1044. } else
  1045. minfrq = dz->param[MOT_FRQ];
  1046. minpulsedur = 1.0/maxpulse;
  1047. minpulsedur *= maxratio;
  1048. maxfrqdur = 1.0/minfrq;
  1049. if(minpulsedur <= 2.0 * maxfrqdur) {
  1050. fprintf(stdout,"ERROR: Min outerpulse dur (1/rate(%lf) = %lf) less max-offtime (shorten by %.2lf) = %lf\n",maxpulse,1/maxpulse,1/maxpulse * (1 - dz->param[MOT_PRATIO]),(1/maxpulse) - (1/maxpulse * (1 - dz->param[MOT_PRATIO])));
  1051. fprintf(stdout,"ERROR: is less than or equal to 2 * max innerpulse dur (1/rate(%lf) = %.2lf X2= %.2lf).\n",minfrq,1/minfrq,1/minfrq * 2);
  1052. fflush(stdout);
  1053. return DATA_ERROR;
  1054. }
  1055. return FINISHED;
  1056. }
  1057. /**************************** MOTOR_PARAM_PREPROCESS *****************************/
  1058. int motor_param_preprocess(dataptr dz)
  1059. {
  1060. double maxpulse, minpulse, thispulse, srate = (double)dz->infile->srate;
  1061. int chans = dz->infile->channels;
  1062. int n, v;
  1063. minpulse = HUGE;
  1064. maxpulse = 0.0;
  1065. if(dz->brksize[MOT_PULSE]) {
  1066. for(n=0,v=1;n <dz->brksize[MOT_PULSE];n++,v+=2) {
  1067. thispulse = 1.0/dz->brk[MOT_PULSE][v];
  1068. maxpulse = max(maxpulse,thispulse); // Find the largest pulse to fit into a buffer, to help determine buffer size
  1069. minpulse = min(minpulse,thispulse); // and the smallest pulse, to later determine the max number of pulses per buffer
  1070. }
  1071. } else {
  1072. maxpulse = 1.0/dz->param[MOT_PULSE];
  1073. minpulse = 1.0/dz->param[MOT_PULSE];
  1074. }
  1075. dz->gp_maxpulsesmps = (int)ceil(maxpulse * srate);
  1076. dz->minpulsesmps = (int)floor(minpulse * srate) * chans;
  1077. if(dz->brksize[MOT_PULSE]) { // Convert Frq into wavelength
  1078. for(n=0,v=1;n <dz->brksize[MOT_PULSE];n++,v+=2)
  1079. dz->brk[MOT_PULSE][v] = 1.0/dz->brk[MOT_PULSE][v];
  1080. } else
  1081. dz->param[MOT_PULSE] = 1.0/dz->param[MOT_PULSE];
  1082. return FINISHED;
  1083. }
  1084. /********************************************************************************************/
  1085. int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  1086. {
  1087. if(!strcmp(prog_identifier_from_cmdline,"motor")) dz->process = MOTOR;
  1088. else {
  1089. sprintf(errstr,"Unknown program identification string '%s'\n",prog_identifier_from_cmdline);
  1090. return(USAGE_ONLY);
  1091. }
  1092. return(FINISHED);
  1093. }
  1094. /******************************** SETUP_AND_INIT_INPUT_BRKTABLE_CONSTANTS ********************************/
  1095. int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt)
  1096. {
  1097. int n;
  1098. if((dz->brk = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  1099. sprintf(errstr,"setup_and_init_input_brktable_constants(): 1\n");
  1100. return(MEMORY_ERROR);
  1101. }
  1102. if((dz->brkptr = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  1103. sprintf(errstr,"setup_and_init_input_brktable_constants(): 6\n");
  1104. return(MEMORY_ERROR);
  1105. }
  1106. if((dz->brksize = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  1107. sprintf(errstr,"setup_and_init_input_brktable_constants(): 2\n");
  1108. return(MEMORY_ERROR);
  1109. }
  1110. if((dz->firstval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  1111. sprintf(errstr,"setup_and_init_input_brktable_constants(): 3\n");
  1112. return(MEMORY_ERROR);
  1113. }
  1114. if((dz->lastind = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  1115. sprintf(errstr,"setup_and_init_input_brktable_constants(): 4\n");
  1116. return(MEMORY_ERROR);
  1117. }
  1118. if((dz->lastval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  1119. sprintf(errstr,"setup_and_init_input_brktable_constants(): 5\n");
  1120. return(MEMORY_ERROR);
  1121. }
  1122. if((dz->brkinit = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  1123. sprintf(errstr,"setup_and_init_input_brktable_constants(): 7\n");
  1124. return(MEMORY_ERROR);
  1125. }
  1126. for(n=0;n<brkcnt;n++) {
  1127. dz->brk[n] = NULL;
  1128. dz->brkptr[n] = NULL;
  1129. dz->brkinit[n] = 0;
  1130. dz->brksize[n] = 0;
  1131. }
  1132. return(FINISHED);
  1133. }
  1134. /******************************** USAGE2 ********************************/
  1135. int usage2(char *str)
  1136. {
  1137. if(!strcmp(str,"motor")) {
  1138. fprintf(stderr,
  1139. "USAGE: motor motor 1,4,7 infile outfile params\n"
  1140. "USAGE: motor motor 2,5,8 infile outfile data params\n"
  1141. "OR: motor motor 3,6,9 inf1 [inf2 inf3 ....] outfile params\n"
  1142. "Params are...\n"
  1143. "dur freq pulse fratio pratio sym [-ffrand] [-pprand] [-jjitter] [-ttremor]\n"
  1144. "[-yshift] [-eedge] [-bbite] [-vvary | -a] [-sseed] [-c]\n"
  1145. "\n"
  1146. "Create fast (inner) pulse-stream, within slower (outer) pulsed-enveloping.\n"
  1147. "Under every outer-pulse, set of inner events cut successively from input src(s)\n"
  1148. "as the outer-envelope rises, then in reverse order as it falls.\n"
  1149. "Outer-pulse, shortened by \"PRATIO\", must hold at least 2 inner-pulses.\n"
  1150. "\n"
  1151. "Mode 1+3: Typical source(s) short, & widening in frq-range from start to end.\n"
  1152. "Mode 2: Cuts segments from single src, at slice-times specified in \"data\".\n"
  1153. "Modes 4-6: Similar except source-reads only advance.\n"
  1154. "Modes 7-9: Similar except source-reads either only advance or only regress.\n"
  1155. "\n"
  1156. "DATA Textfile of times in infile at which to slice it into separate srcs.\n"
  1157. "DUR Duration of the output file.\n"
  1158. "FREQ Pulse-rate (Hz) of inner-pulses (range 2 to 100).\n"
  1159. "PULSE Pulse-rate (Hz) of outer-pulses. (range 0.1 to 10)\n"
  1160. "FRATIO Proportion of on-time to off-time of inner-events. (range 0 to 1)\n"
  1161. "PRATIO Proportion of on-time to off-time of outer-events. (range 0 to 1)\n"
  1162. "SYM Symmetry of outer-pulses. (range 0 to 1)\n"
  1163. " \"sym\" marks peak of rising-falling envelope on range 0 to 1.\n"
  1164. " 0.5 gives symmetrical cresc-decresc envelope.\n"
  1165. " 1 gives cresc envelope: 0 gives decresc envelope.\n"
  1166. " 0.75 gives long cresc and short decresc. etc\n"
  1167. "FRAND Freq(f) randomisation (Range 0-1): max variation from f/2 to 3f/2\n"
  1168. "PRAND Pulse(p) randomisation (Range 0-1): max variation from p/2 to 3p/2\n"
  1169. "JITTER Range of any pitch randomisation of inner-pulses (0 - 3 semitones).\n"
  1170. "TREMOR Range of any random amplitude attenuation of inner-pulses (0-1).\n"
  1171. "SHIFT Range of any randomisation of outer-pulse symmetry (Range 0 to 1).\n"
  1172. "EDGE Length of decay-tail of inner-pulses (multiple of dur: Range 0 to 20)\n"
  1173. "BITE Shape of outer-pulses. (Range 0.1 to 10: Dflt 3). 1 = Linear rise-fall\n"
  1174. " > 1 slow-fast rise, fast-slow fall: < 1 fast-slow rise, slow-fast fall.\n"
  1175. "VARY Advance-step in src-read rand-varies from 1 outer-pulse to next.(0-1).\n"
  1176. " 0 = no variation, 1 = max variation range (from no advance to max-step).\n"
  1177. "SEED Different seed vals gives different randomised outputs.(Range 0 to 256)\n"
  1178. "-a Inner-events under outer-pulse-cresc advance by fixed step.\n"
  1179. " (Default: Inner-events advance to end of source, unless \"vary\" set).\n"
  1180. "-c (Mode 2-3 only) cycle through input srcs.(Default, randomly permute order).\n");
  1181. } else
  1182. fprintf(stdout,"Unknown option '%s'\n",str);
  1183. return(USAGE_ONLY);
  1184. }
  1185. int usage3(char *str1,char *str2)
  1186. {
  1187. fprintf(stderr,"Insufficient parameters on command line.\n");
  1188. return(USAGE_ONLY);
  1189. }
  1190. /******************************** MOTOR ********************************/
  1191. int motor(dataptr dz)
  1192. {
  1193. int exit_status, warned = 0, bufcntr = 0, done = 0, event_cnt, ibufno, ch, chans = dz->infile->channels;
  1194. float **ibuf, *ebuf, *obuf, *ovflwbuf;
  1195. int *instep, *gp_sampsread, *mot_starts, *mot_ends, arraysize, in_upstep = 0, in_dnstep = 0, write_position, gp_edgsmps, pulsesmps, start = 0, end = 0, next;
  1196. int n, m, j, k, cresc_cnt, decresc_cnt, max_cresccnt, inner_cnt, max_innercnt, outstep, gp_eventsamps, gp_tail, ibufpos, obufpos = 0;
  1197. double time, srate = (double)dz->infile->srate;
  1198. double *mot_frq, *mot_sym, *mot_frnd, *mot_jit, *mot_trem, *mot_symrnd, *mot_fratio, *mot_dur, *mot_edge, *mot_bite, *inseg;
  1199. double frq, edge, sym, frnd, jit, trem, symrnd, fratio, pulsdur, bite = 1.0, edgelen, outer_dur, real_outer_dur, rnd, endtime, cresctime = 0.0, decresctime = 0.0;
  1200. double inner_dur, thisdur, val, incr, mindur, segdur;
  1201. int *permm, permcnt = dz->inbufcnt;
  1202. int *samphold, start_read, samps_to_read, gp_splicelen, gp_samps_envup, gp_samps_envdn, zerocnt;
  1203. int modetype = dz->mode % 3, advance_regress = 0, only_advance = 0;
  1204. if(dz->mode < 3)
  1205. advance_regress = 1;
  1206. else if(dz->mode < 6)
  1207. only_advance = 1;
  1208. if((samphold = (int *)malloc(dz->inbufcnt * sizeof(int)))==NULL) {
  1209. sprintf(errstr,"Insufficient memory to create store for source sizes.\n");
  1210. return(MEMORY_ERROR);
  1211. }
  1212. if(modetype != MOT_SLICE) { // Arrays already created for MOT_SLICE in read_special_data
  1213. if((dz->parray = (double **)malloc(10 * sizeof(double *)))==NULL) {
  1214. sprintf(errstr,"Insufficient memory to create temporary varying parameter storage.\n");
  1215. return(MEMORY_ERROR);
  1216. }
  1217. }
  1218. // PRELIMINARIES
  1219. if((permm = (int *)malloc(dz->inbufcnt * sizeof(int)))==NULL) { // Establish array for permuting order of infiles
  1220. sprintf(errstr,"Insufficient memory to create file-order permutation store.\n");
  1221. return(MEMORY_ERROR);
  1222. }
  1223. // Establish arrays to store brkpnt values for each outer-pulse in a buffer
  1224. arraysize = (dz->buflen/dz->minpulsesmps) + 64; // Array must accomodate max number of inner-pulses with an outer_envelope-pulse
  1225. for(n=0;n < 10;n++) {
  1226. if((dz->parray[n] = (double *)malloc(arraysize * sizeof(double)))==NULL) {
  1227. sprintf(errstr,"Insufficient memory to temporary varying parameter storage %d.\n",n+1);
  1228. return(MEMORY_ERROR);
  1229. }
  1230. }
  1231. if((dz->lparray = (int **)malloc(3 * sizeof(int *)))==NULL) {
  1232. sprintf(errstr,"Insufficient memory to create 'int' arrays.\n");
  1233. return(MEMORY_ERROR);
  1234. }
  1235. if((dz->lparray[0] = (int *)malloc(arraysize * sizeof(int)))==NULL) {
  1236. sprintf(errstr,"Insufficient memory to create pulse markers for events in buffer.\n");
  1237. return(MEMORY_ERROR);
  1238. }
  1239. if((dz->lparray[1] = (int *)malloc(arraysize * sizeof(int)))==NULL) {
  1240. sprintf(errstr,"Insufficient memory to create pulse markers for events in buffer.\n");
  1241. return(MEMORY_ERROR);
  1242. }
  1243. // Establish array to store sample-step between inner-events, in each infile
  1244. if((dz->lparray[2] = (int *)malloc(dz->inbufcnt * sizeof(int)))==NULL) {
  1245. sprintf(errstr,"Insufficient memory to create array to store stpes with infiles.\n");
  1246. return(MEMORY_ERROR);
  1247. }
  1248. // Establish array of input buffers
  1249. if((ibuf = (float **)malloc(dz->inbufcnt * sizeof(float *)))==NULL) {
  1250. sprintf(errstr,"Insufficient memory to create input sound buffers.\n");
  1251. return(MEMORY_ERROR);
  1252. }
  1253. if((gp_sampsread = (int *)malloc(dz->inbufcnt * sizeof(int)))==NULL) {
  1254. sprintf(errstr,"Insufficient memory to create input file pointers.\n");
  1255. return(MEMORY_ERROR);
  1256. }
  1257. instep = dz->lparray[2]; // Sample-step (within each infile) to next inner-event, when "advance" flag not set
  1258. mot_starts = dz->lparray[0]; // Start of each envelope-event
  1259. mot_ends = dz->lparray[1]; // End of each envelope-event
  1260. mot_sym = dz->parray[0]; // Parameters of the envelope
  1261. mot_symrnd = dz->parray[1];
  1262. mot_bite = dz->parray[2];
  1263. mot_dur = dz->parray[3];
  1264. mot_frq = dz->parray[4]; // Parameters of inner-events within the envelope
  1265. mot_frnd = dz->parray[5];
  1266. mot_jit = dz->parray[6];
  1267. mot_trem = dz->parray[7];
  1268. mot_fratio = dz->parray[8];
  1269. mot_edge = dz->parray[9];
  1270. for(n=0;n<dz->inbufcnt;n++) // Establish arrays to store input and output sound
  1271. ibuf[n] = dz->sampbuf[n];
  1272. ebuf = dz->sampbuf[n++];
  1273. obuf = dz->sampbuf[n++];
  1274. ovflwbuf = dz->sampbuf[n];
  1275. if(modetype == MOT_SLICE) { // Read single source at different points, and store segments in buffers, splicing starts and ends
  1276. gp_splicelen = (int)round(MOT_SPLICE * MS_TO_SECS * srate);
  1277. inseg = dz->parray[10]; // noting the length of each segment in gp_samples
  1278. for(n=0,m=0;n < dz->inbufcnt;n++,m+=2) {
  1279. start_read = (int)round(inseg[m] * srate) * chans;
  1280. if(n == dz->itemcnt - 1)
  1281. samps_to_read = dz->insams[0] - start_read;
  1282. else {
  1283. segdur = inseg[m+1] - inseg[m];
  1284. samps_to_read = (int)round(segdur * srate) * chans;
  1285. }
  1286. sndseekEx(dz->ifd[0],start_read,0);
  1287. if((dz->ssampsread = fgetfbufEx(ibuf[n],samps_to_read,dz->ifd[0],0)) < 0) {
  1288. sprintf(errstr,"Can't read sample-set %d from input soundfile.\n",n+1);
  1289. return(SYSTEM_ERROR);
  1290. }
  1291. if(dz->ssampsread != samps_to_read) {
  1292. fprintf(stdout,"WARNING: Samps read (%d) not exactly as asked for (%d) for input seg %d\n",dz->ssampsread,samps_to_read,n+1);
  1293. fflush(stdout);
  1294. }
  1295. samphold[n] = dz->ssampsread;
  1296. gp_sampsread[n] = dz->ssampsread/chans;
  1297. if(n>0) {
  1298. ibufpos = 0;
  1299. for(k=0;k<gp_splicelen;k++) {
  1300. val = (double)k/(double)gp_splicelen;
  1301. for(ch=0;ch<chans;ch++) {
  1302. ibuf[n][ibufpos] = (float)(ibuf[n][ibufpos] * val);
  1303. ibufpos++;
  1304. }
  1305. }
  1306. }
  1307. if(n<dz->inbufcnt-1) {
  1308. for(k=0,j=gp_sampsread[n] - 1;k<gp_splicelen;k++,j--) {
  1309. ibufpos = j * chans;
  1310. val = (double)k/(double)gp_splicelen;
  1311. for(ch=0;ch<chans;ch++) {
  1312. ibuf[n][ibufpos] = (float)(ibuf[n][ibufpos] * val);
  1313. ibufpos++;
  1314. }
  1315. }
  1316. }
  1317. }
  1318. } else { // OR Read (all) input file(s) and note their length(s) in gp_samples
  1319. for(n=0;n<dz->inbufcnt;n++) {
  1320. if((dz->ssampsread = fgetfbufEx(ibuf[n], dz->buflen,dz->ifd[n],0)) < 0) {
  1321. sprintf(errstr,"Can't read samples from input soundfile %d.\n",n+1);
  1322. return(SYSTEM_ERROR);
  1323. }
  1324. samphold[n] = dz->ssampsread;
  1325. gp_sampsread[n] = dz->ssampsread/chans;
  1326. }
  1327. }
  1328. time = 0.0;
  1329. write_position = 0;
  1330. // In fixed-step mode we advance by a fixed step in the input file.
  1331. // Need to know the maximum number of steps within the crescendo part of any envelope-pulse, so.....
  1332. dz->symwarning = 0;
  1333. if(dz->vflag[MOT_FXDSTP]) {
  1334. srand(dz->iparam[MOT_SEED]); // Initialise randomisation
  1335. rndpermm(permcnt,permm); // and do initial permutation
  1336. if((exit_status = calculate_max_read_events_in_any_env_pulse(&max_cresccnt,&max_innercnt,&frq,&edge,arraysize,permm,permcnt,gp_sampsread,dz))<0)
  1337. return exit_status;
  1338. inner_dur = 1/frq; // Duration of final inner-event
  1339. edgelen = inner_dur * edge; // Tail on final event
  1340. gp_edgsmps = (int)ceil(edgelen * srate); // Allowing for possible tail on last sample-read
  1341. for(n=0;n<dz->inbufcnt;n++) { // Divide each input file into max possible number of steps to find the instep for each src
  1342. if(advance_regress) // In these modes, whole src must fit under crescendo
  1343. instep[n] = (int)floor(((samphold[n]/chans) - gp_edgsmps)/max_cresccnt) * chans;
  1344. else // In these modes, whole src must fit under crescendo+decrescendo
  1345. instep[n] = (int)floor(((samphold[n]/chans) - gp_edgsmps)/max_innercnt) * chans;
  1346. }
  1347. }
  1348. srand(dz->iparam[MOT_SEED]); // (re)Initialise randomisation
  1349. rndpermm(permcnt,permm); // and (re)do initial permutation
  1350. while(time < dz->param[MOT_DUR]) { // Until we have generated the required output duration
  1351. event_cnt = 0;
  1352. // LOCATE POSITION AND END-TIMES OF ALL LARGE-PULSES FITTING WITHIN CURRENT BUFFER
  1353. while(write_position < dz->buflen) { // Find all large-pulses FITTING IN A BUFFER
  1354. if(event_cnt >= arraysize) {
  1355. sprintf(errstr,"Array overrun storing pulse start and end times in buffer.\n");
  1356. return PROGRAM_ERROR;
  1357. } // Store sample-time of start of large-pulse .....
  1358. mot_starts[event_cnt] = (int)round(time * srate) * chans;
  1359. mot_starts[event_cnt] -= dz->total_samps_written;// .....within the current buffer
  1360. // Find parameters for internal-events inside each of envelope-pulse
  1361. if((exit_status = read_values_from_all_existing_brktables(time,dz))<0)
  1362. return exit_status;
  1363. mot_frq[event_cnt] = dz->param[MOT_FRQ];
  1364. mot_sym[event_cnt] = dz->param[MOT_SYM];
  1365. mot_frnd[event_cnt] = dz->param[MOT_FRND];
  1366. mot_jit[event_cnt] = dz->param[MOT_JIT];
  1367. mot_trem[event_cnt] = dz->param[MOT_TREM];
  1368. mot_symrnd[event_cnt] = dz->param[MOT_SYMRND];
  1369. mot_fratio[event_cnt] = dz->param[MOT_FRATIO];
  1370. mot_edge[event_cnt] = dz->param[MOT_EDGE];
  1371. mot_bite[event_cnt] = dz->param[MOT_BITE];
  1372. mindur = 1.0/dz->param[MOT_FRQ]; // Duration of inner-events
  1373. mindur += 0.001; // Correct for rounding errors
  1374. mindur *= 2; // Two inner pulses is minimum to fit in 1 outer-pulse
  1375. // Find step between envelope-pulses, and actual sounding-end of envelope-pulse
  1376. outer_dur = dz->param[MOT_PULSE]; // Find actual duration of large-pulse, modifying it, if randomised
  1377. if(dz->param[MOT_PRND] > 0.0) {
  1378. rnd = (drand48() * 2.0) - 1.0; // Range -1 to 1
  1379. rnd *= dz->param[MOT_PRND]; // Range -r to + r
  1380. rnd += 1.0; // Range 1-r to 1+r
  1381. outer_dur *= rnd;
  1382. outer_dur = max(outer_dur,2 * mindur); // Outer-Pulse cannot be shorter than 2 inner_pulses
  1383. }
  1384. real_outer_dur = outer_dur * dz->param[MOT_PRATIO]; // If pulse does NOT sound for all its duration, find actual end of sound-write
  1385. real_outer_dur = max(real_outer_dur,mindur); // Outer-Pulse cannot be shorter than 2 inner_pulses
  1386. mot_dur[event_cnt] = real_outer_dur; // and store it
  1387. endtime = time + real_outer_dur; // Store sample-time of end of large-pulse-write ....
  1388. mot_ends[event_cnt] = (int)round(endtime * srate) * chans;
  1389. mot_ends[event_cnt] -= dz->total_samps_written; // ....within the current buffer
  1390. pulsesmps = (int)round(outer_dur * srate) * chans;
  1391. event_cnt++; // Advance event-counter to next event
  1392. write_position += pulsesmps; // Advance write-position in output buffer.
  1393. time += outer_dur; // Advance time for next brktable-read
  1394. if(time >= dz->param[MOT_DUR]) { // If this large-pulse event runs over required total-duration-of-output,
  1395. done = 1; // flag to quit, once inner-events have been generated
  1396. break; // and break (so no further envel-pulses generated).
  1397. }
  1398. }
  1399. // NOW GENERATE THE INNER EVENTS INSIDE THE LARGE-PULSES
  1400. for(n = 0; n <event_cnt; n++) {
  1401. // Get params needed for for inner-event within each outer-pulse
  1402. start = mot_starts[n];
  1403. end = mot_ends[n];
  1404. if(n < event_cnt - 1)
  1405. next = mot_starts[n+1]; // Note start of next pulse
  1406. else // (if there is one)
  1407. next = -1;
  1408. frq = mot_frq[n];
  1409. sym = mot_sym[n];
  1410. frnd = mot_frnd[n];
  1411. jit = mot_jit[n];
  1412. trem = mot_trem[n];
  1413. symrnd = mot_symrnd[n];
  1414. fratio = mot_fratio[n];
  1415. pulsdur = mot_dur[n];
  1416. edge = mot_edge[n];
  1417. bite = mot_bite[n];
  1418. // Using outer-event duration and symmetry, find true durations of cresc and decresc in envelope
  1419. // find counts of inner events in cresc and decresc portions of envelope
  1420. if((exit_status = calculate_cresc_and_decresc_counts_of_inner_events(&cresc_cnt,&decresc_cnt,&cresctime,&decresctime,sym,symrnd,pulsdur,frq,dz))<0)
  1421. return exit_status;
  1422. inner_cnt = cresc_cnt + decresc_cnt;
  1423. // Select appropriate infile to read
  1424. ibufno = select_infile_to_use(&bufcntr,permm,permcnt,dz);
  1425. // Get (average) separation-time of inner-events, in the output
  1426. inner_dur = 1/frq;
  1427. outstep = (int)round(inner_dur * srate) * chans;
  1428. // Calculate read-steps in infile
  1429. calculate_fwd_and_bkwd_sampsteps_in_infile(&in_upstep,&in_dnstep,srate,chans,gp_sampsread[ibufno],cresc_cnt,decresc_cnt,inner_dur,edge,ibufno,dz);
  1430. // Calculate number of input samples to read, and length of inner-event tail
  1431. calculate_inputsamps_to_read_and_length_of_tail(&gp_eventsamps,&gp_tail,srate,inner_dur,fratio,edge,dz);
  1432. // Set start points in input and output buffers
  1433. obufpos = start;
  1434. if(jit != 0.0) { // Check for pitch-jitter
  1435. rnd = (drand48() * 2.0) - 1.0; // Range -1 to 1
  1436. jit *= rnd; // Semitones up or down
  1437. jit = pow(2.0,jit/SEMITONES_PER_OCTAVE); // Frq-ratio up or down = incr in reading data
  1438. incr = jit;
  1439. } else
  1440. incr = 1.0;
  1441. if(advance_regress) { // In these modes Read advances then regresses
  1442. ibufpos = 0;
  1443. // GENERATE ALL THE EVENTS IN THE CRESC PART OF ENVELOPE
  1444. for(m = 0; m < cresc_cnt;m++) {
  1445. if((exit_status = generate_inner_pulse(ebuf,ibuf[ibufno],obuf,ibufpos,obufpos,gp_eventsamps,gp_tail,incr,trem,1,dz))<0)
  1446. return exit_status;
  1447. if(frnd > 0.0) { // If inner-event timings are randomised, Recalculate step to next event
  1448. rnd = ((drand48() * 2.0) - 1.0)/2.0; // Range -1/2 to 1/2
  1449. rnd *= frnd; // Range -frnd(min -1/2) to frnd (max 1/2)
  1450. thisdur = inner_dur * (1.0 + rnd); // Step-time increased or decreaserd by max of +- 1/2
  1451. outstep = (int)round(thisdur * srate) * chans;
  1452. }
  1453. obufpos += outstep;
  1454. ibufpos += in_upstep;
  1455. }
  1456. // GENERATE ALL EVENTS IN THE DECRESC PART OF ENVELOPE
  1457. for(m = 0; m < decresc_cnt;m++) {
  1458. if((ibufpos -= in_dnstep) < 0) {
  1459. ibufpos = 0;
  1460. if(!warned) {
  1461. fprintf(stdout,"WARNING: Decrescendoing part of an event overran foot of buffer.\n");
  1462. fflush(stdout);
  1463. warned = 1;
  1464. }
  1465. }
  1466. if((exit_status = generate_inner_pulse(ebuf,ibuf[ibufno],obuf,ibufpos,obufpos,gp_eventsamps,gp_tail,incr,trem,1,dz))<0)
  1467. return exit_status;
  1468. if(frnd > 0.0) {
  1469. rnd = ((drand48() * 2.0) - 1.0)/2.0;
  1470. rnd *= frnd;
  1471. thisdur = inner_dur * (1.0 + rnd);
  1472. outstep = (int)round(thisdur * srate) * chans;
  1473. }
  1474. obufpos += outstep;
  1475. }
  1476. } else { // In these modes Read only advances, or only regresses
  1477. if(only_advance) // Advances from start
  1478. ibufpos = 0;
  1479. else { // Advances from start OR Regresses from end at random
  1480. rnd = drand48();
  1481. if(rnd < 0.5)
  1482. ibufpos = 0; // Advance
  1483. else {
  1484. ibufpos = (in_upstep) * (inner_cnt - 1);
  1485. in_upstep = -in_upstep; // Regress
  1486. }
  1487. }
  1488. for(m = 0; m < inner_cnt;m++) {
  1489. if((exit_status = generate_inner_pulse(ebuf,ibuf[ibufno],obuf,ibufpos,obufpos,gp_eventsamps,gp_tail,incr,trem,1,dz))<0)
  1490. return exit_status;
  1491. if(frnd > 0.0) { // If inner-event timings are randomised, Recalculate step to next event
  1492. rnd = ((drand48() * 2.0) - 1.0)/2.0; // Range -1/2 to 1/2
  1493. rnd *= frnd; // Range -frnd(min -1/2) to frnd (max 1/2)
  1494. thisdur = inner_dur * (1.0 + rnd); // Step-time increased or decreaserd by max of +- 1/2
  1495. outstep = (int)round(thisdur * srate) * chans;
  1496. }
  1497. obufpos += outstep;
  1498. ibufpos += in_upstep;
  1499. }
  1500. }
  1501. // THEN DO ENVELOPE OVER CRESC+DECRESC EVENTS
  1502. gp_samps_envup = (int)round(cresctime * srate); // Number of sample-groups in the cresc and decresc
  1503. gp_samps_envdn = (int)round(decresctime * srate);
  1504. // Adjust for rounding errors
  1505. while(start + ((gp_samps_envup + gp_samps_envdn) * chans) > end)
  1506. gp_samps_envdn--;
  1507. obufpos = start; // Returning to start of the outer-event
  1508. for(m = 0; m < gp_samps_envup; m++) {
  1509. val = (double)m/(double)gp_samps_envup;
  1510. val = pow(val,bite); // Impose "bite" curvature on outer-nvelope
  1511. for(ch=0;ch<chans;ch++) {
  1512. obuf[obufpos] = (float)(obuf[obufpos] * val);
  1513. obufpos++;
  1514. }
  1515. }
  1516. for(m = gp_samps_envdn - 1; m >= 0; m--) {
  1517. val = (double)m/(double)gp_samps_envdn;
  1518. val = pow(val,bite);
  1519. for(ch=0;ch<chans;ch++) {
  1520. obuf[obufpos] = (float)(obuf[obufpos] * val);
  1521. obufpos++;
  1522. }
  1523. }
  1524. zerocnt = (dz->buflen * 2) - obufpos; // zero the rest of the outbuffer
  1525. if(zerocnt > 0) // in case any writes to it have not fallen under envelope,
  1526. memset((char *)(obuf+obufpos),0,zerocnt * sizeof(float));
  1527. }
  1528. if(done) // If already got total duration, quit
  1529. break;
  1530. if((exit_status = write_samps(obuf,dz->buflen,dz))<0) // otherwise ...
  1531. return exit_status; // Write buffer-full of sound
  1532. memcpy((char *)obuf,(char *)ovflwbuf,dz->buflen * sizeof(float));
  1533. memset((char *)ovflwbuf,0,dz->buflen * sizeof(float)); // .... and copy back any overflow
  1534. write_position -= dz->buflen; // Reset position of write in buffer.
  1535. }
  1536. if((exit_status = write_samps(obuf,obufpos,dz))<0) // Write any remaining samples
  1537. return exit_status;
  1538. return FINISHED;
  1539. }
  1540. /****************************** GET_MODE *********************************/
  1541. int get_the_mode_from_cmdline(char *str,dataptr dz)
  1542. {
  1543. char temp[200], *p;
  1544. if(sscanf(str,"%s",temp)!=1) {
  1545. sprintf(errstr,"Cannot read mode of program.\n");
  1546. return(USAGE_ONLY);
  1547. }
  1548. p = temp + strlen(temp) - 1;
  1549. while(p >= temp) {
  1550. if(!isdigit(*p)) {
  1551. fprintf(stderr,"Invalid mode of program entered.\n");
  1552. return(USAGE_ONLY);
  1553. }
  1554. p--;
  1555. }
  1556. if(sscanf(str,"%d",&dz->mode)!=1) {
  1557. fprintf(stderr,"Cannot read mode of program.\n");
  1558. return(USAGE_ONLY);
  1559. }
  1560. if(dz->mode <= 0 || dz->mode > dz->maxmode) {
  1561. fprintf(stderr,"Program mode value [%d] is out of range [1 - %d].\n",dz->mode,dz->maxmode);
  1562. return(USAGE_ONLY);
  1563. }
  1564. dz->mode--; /* CHANGE TO INTERNAL REPRESENTATION OF MODE NO */
  1565. return(FINISHED);
  1566. }
  1567. /******************************** CREATE_MOTOR_SNDBUFS ********************************/
  1568. int create_motor_sndbufs(dataptr dz)
  1569. {
  1570. int n, chans = dz->infile->channels;
  1571. int bigbufsize, secsize, framesize = F_SECSIZE * chans;
  1572. double max_transpos;
  1573. dz->buflen = max(dz->gp_maxinsmps,dz->gp_maxpulsesmps);
  1574. max_transpos = pow(2.0,dz->application->hi[MOT_JIT]/SEMITONES_PER_OCTAVE); // Allow for maximal transposition of output
  1575. dz->buflen = (int)ceil((double)dz->buflen * max_transpos);
  1576. dz->buflen = (int)ceil((double)dz->buflen * 1.5); // Allow for maximal warp of inner-pulse-lengths
  1577. dz->buflen *= chans;
  1578. secsize = dz->buflen/framesize;
  1579. if(secsize * framesize != dz->buflen)
  1580. secsize++;
  1581. dz->buflen = secsize * framesize;
  1582. bigbufsize = (dz->buflen * dz->bufcnt) * sizeof(float);
  1583. if((dz->bigbuf = (float *)malloc(bigbufsize)) == NULL) {
  1584. sprintf(errstr,"INSUFFICIENT MEMORY to create total sound buffers.\n");
  1585. return(PROGRAM_ERROR);
  1586. }
  1587. dz->sbufptr[0] = dz->sampbuf[0] = dz->bigbuf; // 1 Inbuf for each infile
  1588. for(n=1;n < dz->bufcnt;n++) // 1 untransposed inner-pulse buf
  1589. dz->sbufptr[n] = dz->sampbuf[n] = dz->sampbuf[n-1] + dz->buflen; // 1 motor-pulses output buf
  1590. dz->sampbuf[n] = dz->sampbuf[n-1] + dz->buflen; // 1 motor-pulses overflow
  1591. return(FINISHED);
  1592. }
  1593. /*************************** RNDPERMM ********************************/
  1594. void rndpermm(int permlen,int *permm)
  1595. {
  1596. int n, t;
  1597. for(n=0;n<permlen;n++) { /* 1 */
  1598. t = (int)(drand48() * (double)(n+1)); /* 2 */
  1599. if(t==n)
  1600. prefix(n,permlen,permm);
  1601. else
  1602. insert(n,t,permlen,permm);
  1603. }
  1604. }
  1605. /***************************** INSERT **********************************
  1606. *
  1607. * Insert the value m AFTER the T-th element in permm[pindex].
  1608. */
  1609. void insert(int m,int t,int permlen,int *permm)
  1610. {
  1611. shuflup(t+1,permlen,permm);
  1612. permm[t+1] = m;
  1613. }
  1614. /***************************** PREFIX ************************************
  1615. *
  1616. * Insert the value m at start of the permutation permm[pindex].
  1617. */
  1618. void prefix(int m,int permlen,int *permm)
  1619. {
  1620. shuflup(0,permlen,permm);
  1621. permm[0] = m;
  1622. }
  1623. /****************************** SHUFLUP ***********************************
  1624. *
  1625. * move set members in permm[pindex] upwards, starting from element k.
  1626. */
  1627. void shuflup(int k,int permlen, int *permm)
  1628. {
  1629. int n, *i;
  1630. int z = permlen - 1;
  1631. i = permm + z;
  1632. for(n = z;n > k;n--) {
  1633. *i = *(i-1);
  1634. i--;
  1635. }
  1636. }
  1637. /****************************** GENERATE_INNER_PULSE ***********************************/
  1638. int generate_inner_pulse(float *ebuf,float *ibuf,float *obuf,int ibufpos,int obufpos,int gp_eventsamps,int gp_tail,double incr,double trem,int output,dataptr dz)
  1639. {
  1640. int chans = dz->infile->channels, splen, ch;
  1641. int k, kk, m, mm, thispos, nextpos, gp_fadelen;
  1642. double splic, rnd, amp, debufpos, frac, val, diff, srate = (double)dz->infile->srate;
  1643. int gp_splicelen = (int)round((MOT_SPLICE * MS_TO_SECS) * srate);
  1644. if(output) {
  1645. memset((char *)ebuf,0,dz->buflen * sizeof(float)); // Copy total event samples from ibuf
  1646. memcpy((char *)ebuf,(char *)(ibuf + ibufpos),gp_eventsamps * chans * sizeof(float));
  1647. splen = min(gp_splicelen,gp_eventsamps/2); // Find appropriate splicelen
  1648. for(k = 0; k < splen;k++) { // Do on-splice
  1649. kk = k * chans;
  1650. splic = (double)k/(double)splen;
  1651. for(ch = 0;ch < chans;ch++)
  1652. ebuf[kk + ch] = (float)(ebuf[kk + ch] * splic);
  1653. }
  1654. if(gp_tail == 0) { // If No tail
  1655. for(k = 0, m = gp_eventsamps - 1; k < splen;k++,m--) {
  1656. mm = m * chans; // Do off-splice
  1657. splic = (double)k/(double)splen;
  1658. for(ch = 0;ch < chans;ch++)
  1659. ebuf[mm + ch] = (float)(ebuf[mm + ch] * splic);
  1660. }
  1661. } else { // Else, fade through splicelen and tail
  1662. gp_fadelen = splen + gp_tail;
  1663. for(k = 0, m = gp_eventsamps - 1; k < gp_fadelen;k++,m--) {
  1664. mm = m * chans;
  1665. splic = (double)k/(double)gp_fadelen;
  1666. splic = pow(splic,MOT_EXPDECAY); // Exponential decay
  1667. for(ch = 0;ch < chans;ch++)
  1668. ebuf[mm + ch] = (float)(ebuf[mm + ch] * splic);
  1669. }
  1670. }
  1671. }
  1672. // NOW ADD THE EVENT TO THE OUTPUT, VARYING PITCH AND AMPLITUDE IF NESS
  1673. if(trem > 0.0) { // If amplitude varies
  1674. rnd = drand48(); // Range 0 to 1
  1675. rnd *= trem; // Range 0 to trem
  1676. amp = 1.0 - rnd; // Amp = 1 minus rnd-variation
  1677. } else
  1678. amp = 1.0;
  1679. if(output) {
  1680. debufpos = 0.0;
  1681. while(debufpos < gp_eventsamps) { // Read input using increment (for possible pitch-shift)
  1682. thispos = (int)floor(debufpos);
  1683. frac = debufpos - (double)thispos;
  1684. thispos *= chans;
  1685. nextpos = thispos + chans;
  1686. for(ch = 0;ch < chans; ch++) {
  1687. val = ebuf[thispos++];
  1688. diff = ebuf[nextpos++] - val;
  1689. val += diff * frac;
  1690. val *= amp; // Do any required amplitude atenuation
  1691. obuf[obufpos] = (float)(obuf[obufpos] + val);// Add sample into output (in case there are event overlaps)
  1692. obufpos++;
  1693. }
  1694. debufpos += incr;
  1695. if(obufpos >= dz->buflen * 2) {
  1696. sprintf(errstr,"Error in output buffer logic. May be due to jitter.\n");
  1697. return PROGRAM_ERROR;
  1698. }
  1699. }
  1700. }
  1701. return FINISHED;
  1702. }
  1703. /********************************** CALCULATE_CRESC_AND_DECRESC_COUNTS_OF_INNER_EVENTS ************************************/
  1704. int calculate_cresc_and_decresc_counts_of_inner_events(int *cresc_cnt,int *decresc_cnt,double *cresctime,double *decresctime,
  1705. double sym,double symrnd,double pulsdur,double frq,dataptr dz)
  1706. {
  1707. double rnd, offset, adjust;
  1708. int total;
  1709. int bum = 0;
  1710. if(symrnd > 0.0) { // If symmetry randomised
  1711. rnd = (drand48() * 2.0) - 1.0; // Rand value in range -1 to 1
  1712. rnd *= symrnd; // Rand value in range -symrand to symrand
  1713. if(rnd < 0.0) {
  1714. rnd = (-rnd) * sym; // Push backward the symmetry position by a random amount
  1715. sym -= rnd;
  1716. } else { // OR Push forward the symmetry position by a random amount
  1717. rnd *= (1.0 - sym);
  1718. sym += rnd;
  1719. }
  1720. }
  1721. *cresctime = pulsdur * sym; // use length and symmetry to work out how many events needed in cresc and decresc
  1722. *decresctime = pulsdur - *cresctime;
  1723. *cresc_cnt = (int)floor(*cresctime * frq);
  1724. *decresc_cnt = (int)floor(*decresctime * frq);
  1725. total = *cresc_cnt + *decresc_cnt;
  1726. if(total < 2) {
  1727. if(!dz->symwarning) {
  1728. fprintf(stdout,"WARNING: Insufficient inner-events underneath envelope : adjusting symmetry.\n");
  1729. fflush(stdout);
  1730. dz->symwarning = 1;
  1731. }
  1732. offset = sym - 0.5; // distance from midpoint to sym-peak
  1733. adjust = -offset; // step back to midpoint
  1734. adjust /= 10.0; // 1/10 of this distance
  1735. while(total < 2) {
  1736. sym += adjust; // Move symmetry towards midpoint, in small steps
  1737. if(adjust > 0.0 && sym > 0.5) // recalculating cresctime & decresctime, to get values that work
  1738. bum = 1;
  1739. else if(adjust < 0.0 && sym < 0.5) // But if no values work ... fail!!!!
  1740. bum = 1;
  1741. if(bum) {
  1742. sprintf(errstr,"Insufficient inner-events underneath envelope. sym = %lf pulsdur = %lf\n",sym,pulsdur);
  1743. return PROGRAM_ERROR;
  1744. }
  1745. *cresctime = pulsdur * sym;
  1746. *decresctime = pulsdur - *cresctime;
  1747. *cresc_cnt = (int)floor(*cresctime * frq);
  1748. *decresc_cnt = (int)floor(*decresctime * frq);
  1749. total = *cresc_cnt + *decresc_cnt;
  1750. }
  1751. }
  1752. if(*cresc_cnt == 0) {
  1753. (*cresc_cnt)++;
  1754. (*decresc_cnt)--;
  1755. *cresctime = *cresc_cnt/frq;
  1756. *decresctime = *decresc_cnt/frq;
  1757. } else if (*decresc_cnt == 0) {
  1758. (*decresc_cnt)++;
  1759. (*cresc_cnt)--;
  1760. *cresctime = *cresc_cnt/frq;
  1761. *decresctime = *decresc_cnt/frq;
  1762. }
  1763. return FINISHED;
  1764. }
  1765. /********************************** SELECT_INFILE_TO_USE ************************************/
  1766. int select_infile_to_use(int *bufcntr,int *permm,int permcnt,dataptr dz)
  1767. {
  1768. int ibufno = 0;
  1769. int modetype = dz->mode % 3;
  1770. if(modetype != MOT_SNGLE) { // Find appropriate inbuf, if multiple input files, or many cut segments
  1771. if(dz->vflag[MOT_CYCLIC])
  1772. ibufno = *bufcntr; // either next one cyclically
  1773. else
  1774. ibufno = permm[*bufcntr]; // or next one in perm
  1775. if(++(*bufcntr) >= dz->inbufcnt) { // and advance infile counter "bufcntr"
  1776. if(!dz->vflag[MOT_CYCLIC])
  1777. rndpermm(permcnt,permm);
  1778. *bufcntr = 0;
  1779. }
  1780. }
  1781. return ibufno;
  1782. }
  1783. /********************************** CALCULATE_FWD_AND_BKWD_SAMPSTEPS_IN_INFILE ************************************/
  1784. void calculate_fwd_and_bkwd_sampsteps_in_infile(int *in_upstep,int *in_dnstep,double srate,int chans,int gp_sampsread,
  1785. int cresc_cnt,int decresc_cnt,double inner_dur,double edge,int ibufno,dataptr dz)
  1786. {
  1787. double edgelen, upsteptime, advance, dnsteptime, rnd;
  1788. int gp_edgsmps, smp_advance, smp_regress;
  1789. int *instep = dz->lparray[2];
  1790. int advance_regress = 0;
  1791. if(dz->mode < 3)
  1792. advance_regress = 1;
  1793. if(dz->vflag[MOT_FXDSTP]) { // Envelope inner-events always advance by a fixed amount
  1794. // From known pre-calculated timestep between reads, for this infile
  1795. *in_upstep = instep[ibufno]; // Fixed step calculated so this is same in all modes (for modes > 3 in_dnstep not used)
  1796. if(advance_regress) {
  1797. upsteptime = (double)((*in_upstep)/chans)/srate;
  1798. advance = upsteptime * cresc_cnt; // End time in infile after all reads
  1799. dnsteptime = advance/(double)decresc_cnt; // Length of time-steps back to start of file, in decresendo-steps
  1800. *in_dnstep = (int)round(dnsteptime * srate) * chans;
  1801. }
  1802. } else { // Envelope inner-events always advance to end of infile data
  1803. edgelen = inner_dur * edge; // how many infile steps to advance to end, and to return to start
  1804. gp_edgsmps = (int)ceil(edgelen * srate); // Allow for overlay of last sample due to its tail
  1805. if(dz->param[MOT_VARY] > 0.0) { // If advance in src randomly varies, vary apparent length of source
  1806. rnd = drand48() * dz->param[MOT_VARY]; // Range 0 to mot_vary
  1807. rnd = 1.0 - rnd; // Range 1 to (1-mot_vary);
  1808. gp_sampsread = (int)round((double)gp_sampsread * rnd);
  1809. }
  1810. if(advance_regress) {
  1811. *in_upstep = (int)floor((gp_sampsread - gp_edgsmps)/cresc_cnt) * chans;
  1812. *in_dnstep = (int)floor((gp_sampsread - gp_edgsmps)/decresc_cnt) * chans;
  1813. } else
  1814. *in_upstep = (int)floor((gp_sampsread - gp_edgsmps)/(cresc_cnt + decresc_cnt)) * chans;
  1815. }
  1816. smp_advance = (*in_upstep) * cresc_cnt;
  1817. smp_regress = (*in_dnstep) * decresc_cnt;
  1818. while(smp_advance - smp_regress < 0) { // After stepping up then down, should be back at file start
  1819. *in_dnstep -= chans; // IF overshoot zero, reduce down-step by 1 gp_sample at a time, until fixed
  1820. smp_regress= *in_dnstep * decresc_cnt;
  1821. }
  1822. }
  1823. /********************************** CALCULATE_INPUTSAMPS_TO_READ_AND_LENGTH_OF_TAIL ************************************/
  1824. void calculate_inputsamps_to_read_and_length_of_tail(int *gp_eventsamps,int *gp_tail,double srate,double inner_dur,double fratio,double edge,dataptr dz)
  1825. {
  1826. double cliplen, eventdur;
  1827. int gp_clipsamps;
  1828. cliplen = inner_dur * fratio; // Actual (main) sounding part of inner-event
  1829. eventdur = cliplen + (cliplen * edge); // Actual time needed in order to have required tail
  1830. gp_clipsamps = (int)round(cliplen * srate); // Sample length of inner-event (without tail)
  1831. *gp_eventsamps= (int)round(eventdur * srate); // Sample length of inner-event WITH tail
  1832. *gp_tail = *gp_eventsamps - gp_clipsamps; // Length of event tail
  1833. }
  1834. /********************************* CALCULATE_MAX_READ_EVENTS_IN_ANY_ENV_PULSE ****************************************/
  1835. int calculate_max_read_events_in_any_env_pulse(int *max_cresccnt,int *max_innercnt,double *frq,double *edge,int arraysize,int *permm,int permcnt,int *gp_sampsread,dataptr dz)
  1836. {
  1837. int exit_status, chans = dz->infile->channels, done = 0, ibufno, bufcntr;
  1838. int n, event_cnt, write_position, cresc_cnt = 0, decresc_cnt = 0, pulsesmps;
  1839. double time, cresctime = 0.0, decresctime = 0.0, srate = (double)dz->infile->srate;
  1840. double *mot_sym = dz->parray[0], *mot_symrnd = dz->parray[1], *mot_dur = dz->parray[3], *mot_frnd = dz->parray[5];
  1841. double *mot_jit = dz->parray[6], *mot_trem = dz->parray[7];
  1842. double outer_dur, rnd, real_outer_dur, sym, symrnd, frnd, jit, trem;
  1843. float *ebuf, *obuf;
  1844. ebuf = dz->sampbuf[dz->inbufcnt];
  1845. obuf = dz->sampbuf[dz->inbufcnt+1];
  1846. time = 0.0;
  1847. write_position = 0;
  1848. while(time < dz->param[MOT_DUR]) { // Until we have generated the required output duration
  1849. event_cnt = 0;
  1850. // LOCATE POSITION AND END-TIMES OF ALL LARGE-PULSES FITTING WITHIN CURRENT BUFFER
  1851. while(write_position < dz->buflen) { // Find all large-pulses FITTING IN A BUFFER
  1852. if(event_cnt >= arraysize) {
  1853. sprintf(errstr,"Array overrun storing pulse start and end times in buffer.\n");
  1854. return PROGRAM_ERROR;
  1855. } // Store sample-time of start of large-pulse .....
  1856. // Find parameters for internal-events inside each of envelope-pulse
  1857. if((exit_status = read_values_from_all_existing_brktables(time,dz))<0)
  1858. return exit_status;
  1859. mot_sym[event_cnt] = dz->param[MOT_SYM];
  1860. mot_symrnd[event_cnt] = dz->param[MOT_SYMRND];
  1861. *frq = dz->param[MOT_FRQ];
  1862. *edge = dz->param[MOT_EDGE];
  1863. // Find step between envelope-pulses, and actual sounding-end of envelope-pulse
  1864. outer_dur = dz->param[MOT_PULSE]; // Find actual duration of large-pulse, modifying it, if randomised
  1865. if(dz->param[MOT_PRND] > 0.0) {
  1866. rnd = (drand48() * 2.0) - 1.0; // Range -1 to 1
  1867. rnd *= dz->param[MOT_PRND]; // Range -r to + r
  1868. rnd += 1.0; // Range 1-r to 1+r
  1869. outer_dur *= rnd;
  1870. outer_dur = max(outer_dur,2.0/dz->param[MOT_FRQ]); // Outer-Pulse cannot be shorter than 2 inner_pulses
  1871. }
  1872. real_outer_dur = outer_dur * dz->param[MOT_PRATIO];// If pulse does NOT sound for all its duration, find actual end of sound-write
  1873. real_outer_dur = max(outer_dur,2.0/dz->param[MOT_FRQ]); // Outer-Pulse cannot be shorter than 2 inner_pulses
  1874. mot_dur[event_cnt] = real_outer_dur; // and store it
  1875. pulsesmps = (int)round(outer_dur * srate) * chans;
  1876. event_cnt++; // Advance event-counter to next event
  1877. write_position += pulsesmps; // Advance write-position in output buffer.
  1878. time += outer_dur; // Advance time for next brktable-read
  1879. if(time >= dz->param[MOT_DUR]) { // If this large-pulse event runs over required total-duration-of-output,
  1880. done = 1; // flag to quit, once inner-events have been generated
  1881. break; // and break (so no further envel-pulses generated).
  1882. }
  1883. }
  1884. // NOW PSEUDO-GENERATE THE INNER EVENTS INSIDE THE LARGE-PULSES
  1885. for(n = 0; n <event_cnt; n++) {
  1886. // Get params needed for for inner-event within each outer-pulse
  1887. sym = mot_sym[n];
  1888. symrnd = mot_symrnd[n];
  1889. outer_dur = mot_dur[n];
  1890. frnd = mot_frnd[n];
  1891. jit = mot_jit[n];
  1892. trem = mot_trem[n];
  1893. // Using outer-event duration and symmetry, find true durations of cresc and decresc in envelope
  1894. // find counts of inner events in cresc and decresc portions of envelope
  1895. if((exit_status = calculate_cresc_and_decresc_counts_of_inner_events(&cresc_cnt,&decresc_cnt,&cresctime,&decresctime,sym,symrnd,outer_dur,*frq,dz))<0)
  1896. return exit_status;
  1897. *max_innercnt = max(*max_innercnt,cresc_cnt + decresc_cnt);
  1898. *max_cresccnt = max(*max_cresccnt,cresc_cnt);
  1899. // Select appropriate infile to read MAY USE RAND
  1900. ibufno = select_infile_to_use(&bufcntr,permm,permcnt,dz);
  1901. // USE ANY RAND FUNCTIONS THAT MAY BE USED LATER, TO KEEP RAND OUTPUT REPRODUCIBLE
  1902. if(dz->param[MOT_VARY] > 0.0)
  1903. rnd = drand48();
  1904. if(jit != 0.0)
  1905. rnd = drand48();
  1906. if(dz->mode >= 6)
  1907. rnd = drand48();
  1908. // USE ANY RAND FUNCTIONS THAT MAY BE USED IN GENERATING THE EVENTS IN THE CRESC PART OF ENVELOPE
  1909. for(n = 0; n < cresc_cnt;n++) {
  1910. if(trem > 0.0)
  1911. rnd = drand48();
  1912. if(frnd > 0.0)
  1913. rnd = drand48();
  1914. }
  1915. // USE ANY RAND FUNCTIONS THAT MAY BE USED IN GENERATING THE EVENTS IN THE DECRESC PART OF ENVELOPE
  1916. for(n = 0; n < decresc_cnt;n++) {
  1917. if(trem > 0.0)
  1918. rnd = drand48();
  1919. if(frnd > 0.0)
  1920. rnd = drand48();
  1921. }
  1922. }
  1923. write_position -= dz->buflen; // Reset position of write in buffer.
  1924. }
  1925. return FINISHED;
  1926. }
  1927. /**************************** HANDLE_THE_SPECIAL_DATA ****************************/
  1928. int handle_the_special_data(char *str,int *max_gp_seg,dataptr dz)
  1929. {
  1930. int done = 0, outcnt, n, m;
  1931. double dummy = 0.0, lasttime, maxsegdur, srate = (double)dz->infile->srate;
  1932. double splicedur = MOT_SPLICE * MS_TO_SECS;
  1933. double dblsplicedur = splicedur * 2;
  1934. double overlap = (MOT_DOVE + MOT_SPLICE) * MS_TO_SECS;
  1935. FILE *fp;
  1936. int cnt = 0, linecnt;
  1937. char temp[800], *p;
  1938. if((fp = fopen(str,"r"))==NULL) {
  1939. sprintf(errstr,"Cannot open file %s to read times.\n",str);
  1940. return(DATA_ERROR);
  1941. }
  1942. linecnt = 0;
  1943. lasttime = -1.0;
  1944. while(fgets(temp,200,fp)!=NULL) {
  1945. p = temp;
  1946. while(isspace(*p))
  1947. p++;
  1948. if(*p == ';' || *p == ENDOFSTR) // Allow comments in file
  1949. continue;
  1950. while(get_float_from_within_string(&p,&dummy)) {
  1951. if(cnt == 0) {
  1952. if(dummy <= dblsplicedur) {
  1953. sprintf(errstr,"Invalid time (%lf) (closer to start than 2 splicedurs = %.3lf) at line %d in file %s.\n",dummy,dblsplicedur,linecnt+1,str);
  1954. return(DATA_ERROR);
  1955. }
  1956. } else if(dummy <= lasttime + dblsplicedur) {
  1957. sprintf(errstr,"Times (%lf & %lf) not increasing by 2 splicedurs (%.3lf) line %d in file %s.\n",lasttime, dummy,dblsplicedur,linecnt,str);
  1958. return(DATA_ERROR);
  1959. } else if(dummy >= dz->duration - dblsplicedur) {
  1960. fprintf(stdout,"WARNING: Time (%lf) too near or beyond end of source-file, at line %d in file %s.\n",dummy,linecnt+1,str);
  1961. fprintf(stdout,"WARNING: Ignoring data at and after this time.\n");
  1962. fflush(stdout);
  1963. done = 1;
  1964. break;
  1965. }
  1966. lasttime = dummy;
  1967. cnt++;
  1968. }
  1969. if(done)
  1970. break;
  1971. linecnt++;
  1972. }
  1973. if(cnt == 0) {
  1974. sprintf(errstr,"No valid data found in file %s.\n",str);
  1975. return(DATA_ERROR);
  1976. }
  1977. dz->itemcnt = cnt;
  1978. outcnt = (dz->itemcnt + 1) * 2; // Slice times expanded into edit-time-pairs in source
  1979. if((dz->parray = (double **)malloc(11 * sizeof(double *)))==NULL) {
  1980. sprintf(errstr,"INSUFFICIENT MEMORY to create time-data storage. (1)\n");
  1981. return(MEMORY_ERROR);
  1982. }
  1983. if((dz->parray[10] = (double *)malloc(outcnt * sizeof(double)))==NULL) {
  1984. sprintf(errstr,"INSUFFICIENT MEMORY to create time-data storage. (2)\n");
  1985. return(MEMORY_ERROR);
  1986. }
  1987. fseek(fp,0,0);
  1988. cnt = 0;
  1989. done = 0;
  1990. while(fgets(temp,200,fp)!=NULL) {
  1991. p = temp;
  1992. while(isspace(*p))
  1993. p++;
  1994. if(*p == ';' || *p == ENDOFSTR) // Allow comments in file
  1995. continue;
  1996. while(get_float_from_within_string(&p,&dummy)) {
  1997. dz->parray[10][cnt] = dummy;
  1998. if(++cnt >= dz->itemcnt) {
  1999. done = 1;
  2000. break;
  2001. }
  2002. }
  2003. if(done)
  2004. break;
  2005. }
  2006. dz->parray[10][outcnt-1] = dz->duration;
  2007. for(n=outcnt-2,m = dz->itemcnt-1; m >= 0; n-=2,m--) {
  2008. dz->parray[10][n] = dz->parray[10][m] - overlap;
  2009. dz->parray[10][n-1] = dz->parray[10][m] + overlap;
  2010. }
  2011. dz->parray[10][n] = 0.0;
  2012. // orig storage 0 1 2 3
  2013. // prog vals A B C D
  2014. // final storage 0 1 2 3 4 5 6 7 8 9
  2015. // final vals 0 A+ -A B+ B- C+ C- D+ D- dur
  2016. dz->itemcnt = outcnt/2; // dz->itemcnt is now the number of cut segments
  2017. maxsegdur = 0.0;
  2018. for(n=0,m=0;n < dz->itemcnt;n++,m+=2)
  2019. maxsegdur = max(maxsegdur,dz->parray[10][m+1] - dz->parray[10][m]);
  2020. *max_gp_seg = (int)ceil(maxsegdur * srate);
  2021. fclose(fp);
  2022. return FINISHED;
  2023. }