madrid.c 78 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965
  1. /*
  2. * Copyright (c) 1983-2023 Trevor Wishart and Composers Desktop Project Ltd
  3. * http://www.trevorwishart.co.uk
  4. * http://www.composersdesktop.com
  5. *
  6. This file is part of the CDP System.
  7. The CDP System is free software; you can redistribute it
  8. and/or modify it under the terms of the GNU Lesser General Public
  9. License as published by the Free Software Foundation; either
  10. version 2.1 of the License, or (at your option) any later version.
  11. The CDP System is distributed in the hope that it will be useful,
  12. but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. GNU Lesser General Public License for more details.
  15. You should have received a copy of the GNU Lesser General Public
  16. License along with the CDP System; if not, write to the Free Software
  17. Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  18. 02111-1307 USA
  19. *
  20. */
  21. /*
  22. * Need to separate lparrays into INTEGER and UNSIGNED LONG
  23. * THEN try compiling
  24. */
  25. #include <stdio.h>
  26. #include <stdlib.h>
  27. #include <structures.h>
  28. #include <tkglobals.h>
  29. #include <pnames.h>
  30. #include <filetype.h>
  31. #include <processno.h>
  32. #include <modeno.h>
  33. #include <logic.h>
  34. #include <globcon.h>
  35. #include <cdpmain.h>
  36. #include <math.h>
  37. #include <mixxcon.h>
  38. #include <osbind.h>
  39. #include <standalone.h>
  40. #include <ctype.h>
  41. #include <sfsys.h>
  42. #include <string.h>
  43. #include <srates.h>
  44. #define SIGNAL_TO_LEFT (0)
  45. #define SIGNAL_TO_RIGHT (1)
  46. #define ROOT2 (1.4142136)
  47. #define dupl descriptor_samps
  48. #ifdef unix
  49. #define round(x) lround((x))
  50. #endif
  51. char errstr[2400];
  52. int anal_infiles = 1;
  53. int sloom = 0;
  54. int sloombatch = 0;
  55. const char* cdp_version = "7.1.0";
  56. //CDP LIB REPLACEMENTS
  57. static int check_madrid_param_validity_and_consistency(dataptr dz);
  58. static int setup_madrid_application(dataptr dz);
  59. static int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz);
  60. static int parse_infile_and_check_type(char **cmdline,dataptr dz);
  61. static int handle_the_special_data(char *str,dataptr dz);
  62. static int setup_madrid_param_ranges_and_defaults(dataptr dz);
  63. static int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz);
  64. static int open_the_outfile(dataptr dz);
  65. static int setup_and_init_input_param_activity(dataptr dz,int tipc);
  66. static int setup_input_param_defaultval_stores(int tipc,aplptr ap);
  67. static int establish_application(dataptr dz);
  68. static int initialise_vflags(dataptr dz);
  69. static int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz);
  70. static int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz);
  71. static int mark_parameter_types(dataptr dz,aplptr ap);
  72. static int assign_file_data_storage(int infilecnt,dataptr dz);
  73. static int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q);
  74. static int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz);
  75. static int get_the_mode_from_cmdline(char *str,dataptr dz);
  76. static int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt);
  77. static int madrid(dataptr dz);
  78. static int madrid_param_preprocess(dataptr dz);
  79. static int create_madrid_sndbufs(dataptr dz);
  80. static void pancalc(double position,double *leftgain,double *rightgain);
  81. static void rndintperm(int *perm,int cnt);
  82. /**************************************** MAIN *********************************************/
  83. int main(int argc,char *argv[])
  84. {
  85. int exit_status;
  86. dataptr dz = NULL;
  87. char **cmdline, sfnam[400];
  88. int cmdlinecnt;
  89. // aplptr ap;
  90. int is_launched = FALSE;
  91. if(argc==2 && (strcmp(argv[1],"--version") == 0)) {
  92. fprintf(stdout,"%s\n",cdp_version);
  93. fflush(stdout);
  94. return 0;
  95. }
  96. /* CHECK FOR SOUNDLOOM */
  97. if((sloom = sound_loom_in_use(&argc,&argv)) > 1) {
  98. sloom = 0;
  99. sloombatch = 1;
  100. }
  101. if(sflinit("cdp")){
  102. sfperror("cdp: initialisation\n");
  103. return(FAILED);
  104. }
  105. /* SET UP THE PRINCIPLE DATASTRUCTURE */
  106. if((exit_status = establish_datastructure(&dz))<0) { // CDP LIB
  107. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  108. return(FAILED);
  109. }
  110. if(!sloom) {
  111. if(argc == 1) {
  112. usage1();
  113. return(FAILED);
  114. } else if(argc == 2) {
  115. usage2(argv[1]);
  116. return(FAILED);
  117. }
  118. }
  119. if(!sloom) {
  120. if((exit_status = make_initial_cmdline_check(&argc,&argv))<0) { // CDP LIB
  121. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  122. return(FAILED);
  123. }
  124. cmdline = argv;
  125. cmdlinecnt = argc;
  126. if((get_the_process_no(argv[0],dz))<0)
  127. return(FAILED);
  128. cmdline++;
  129. cmdlinecnt--;
  130. dz->maxmode = 2;
  131. if((exit_status = get_the_mode_from_cmdline(cmdline[0],dz))<0) {
  132. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  133. return(exit_status);
  134. }
  135. cmdline++;
  136. cmdlinecnt--;
  137. // setup_particular_application =
  138. if((exit_status = setup_madrid_application(dz))<0) {
  139. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  140. return(FAILED);
  141. }
  142. if((exit_status = count_and_allocate_for_infiles(cmdlinecnt,cmdline,dz))<0) { // CDP LIB
  143. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  144. return(FAILED);
  145. }
  146. } else {
  147. //parse_TK_data() =
  148. if((exit_status = parse_sloom_data(argc,argv,&cmdline,&cmdlinecnt,dz))<0) {
  149. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  150. return(exit_status);
  151. }
  152. }
  153. // ap = dz->application;
  154. // parse_infile_and_hone_type() =
  155. if((exit_status = parse_infile_and_check_type(cmdline,dz))<0) {
  156. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  157. return(FAILED);
  158. }
  159. // setup_param_ranges_and_defaults() =
  160. if((exit_status = setup_madrid_param_ranges_and_defaults(dz))<0) {
  161. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  162. return(FAILED);
  163. }
  164. // open_first_infile CDP LIB
  165. if((exit_status = open_first_infile(cmdline[0],dz))<0) {
  166. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  167. return(FAILED);
  168. }
  169. cmdlinecnt--;
  170. cmdline++;
  171. if(dz->infilecnt > 1) {
  172. if((exit_status = handle_extra_infiles(&cmdline,&cmdlinecnt,dz))<0) {
  173. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  174. return(FAILED);
  175. }
  176. }
  177. // handle_outfile() =
  178. if((exit_status = handle_the_outfile(&cmdlinecnt,&cmdline,dz))<0) {
  179. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  180. return(FAILED);
  181. }
  182. // handle_formants() redundant
  183. // handle_formant_quiksearch() redundant
  184. if(dz->mode == 1) {
  185. strcpy(sfnam,cmdline[0]);
  186. cmdlinecnt--;
  187. cmdline++;
  188. }
  189. if((exit_status = read_parameters_and_flags(&cmdline,&cmdlinecnt,dz))<0) { // CDP LIB
  190. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  191. return(FAILED);
  192. }
  193. if((exit_status = open_the_outfile(dz))<0) {
  194. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  195. return(FAILED);
  196. }
  197. if((exit_status = check_madrid_param_validity_and_consistency(dz))<0) {
  198. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  199. return(FAILED);
  200. }
  201. is_launched = TRUE;
  202. if((exit_status = create_madrid_sndbufs(dz))<0) {
  203. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  204. return(FAILED);
  205. }
  206. if((exit_status = madrid_param_preprocess(dz))<0) {
  207. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  208. return(FAILED);
  209. }
  210. if(dz->mode == 1) {
  211. if((exit_status = handle_the_special_data(sfnam,dz))<0) {
  212. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  213. return(FAILED);
  214. }
  215. }
  216. //spec_process_file =
  217. if((exit_status = madrid(dz))<0) {
  218. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  219. return(FAILED);
  220. }
  221. if((exit_status = complete_output(dz))<0) { // CDP LIB
  222. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  223. return(FAILED);
  224. }
  225. exit_status = print_messages_and_close_sndfiles(FINISHED,is_launched,dz); // CDP LIB
  226. free(dz);
  227. return(SUCCEEDED);
  228. }
  229. /**********************************************
  230. REPLACED CDP LIB FUNCTIONS
  231. **********************************************/
  232. /****************************** SET_PARAM_DATA *********************************/
  233. int set_param_data(aplptr ap, int special_data,int maxparamcnt,int paramcnt,char *paramlist)
  234. {
  235. ap->special_data = (char)special_data;
  236. ap->param_cnt = (char)paramcnt;
  237. ap->max_param_cnt = (char)maxparamcnt;
  238. if(ap->max_param_cnt>0) {
  239. if((ap->param_list = (char *)malloc((size_t)(ap->max_param_cnt+1)))==NULL) {
  240. sprintf(errstr,"INSUFFICIENT MEMORY: for param_list\n");
  241. return(MEMORY_ERROR);
  242. }
  243. strcpy(ap->param_list,paramlist);
  244. }
  245. return(FINISHED);
  246. }
  247. /****************************** SET_VFLGS *********************************/
  248. int set_vflgs
  249. (aplptr ap,char *optflags,int optcnt,char *optlist,char *varflags,int vflagcnt, int vparamcnt,char *varlist)
  250. {
  251. ap->option_cnt = (char) optcnt; /*RWD added cast */
  252. if(optcnt) {
  253. if((ap->option_list = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  254. sprintf(errstr,"INSUFFICIENT MEMORY: for option_list\n");
  255. return(MEMORY_ERROR);
  256. }
  257. strcpy(ap->option_list,optlist);
  258. if((ap->option_flags = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  259. sprintf(errstr,"INSUFFICIENT MEMORY: for option_flags\n");
  260. return(MEMORY_ERROR);
  261. }
  262. strcpy(ap->option_flags,optflags);
  263. }
  264. ap->vflag_cnt = (char) vflagcnt;
  265. ap->variant_param_cnt = (char) vparamcnt;
  266. if(vflagcnt) {
  267. if((ap->variant_list = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  268. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_list\n");
  269. return(MEMORY_ERROR);
  270. }
  271. strcpy(ap->variant_list,varlist);
  272. if((ap->variant_flags = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  273. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_flags\n");
  274. return(MEMORY_ERROR);
  275. }
  276. strcpy(ap->variant_flags,varflags);
  277. }
  278. return(FINISHED);
  279. }
  280. /***************************** APPLICATION_INIT **************************/
  281. int application_init(dataptr dz)
  282. {
  283. int exit_status;
  284. int storage_cnt;
  285. int tipc, brkcnt;
  286. aplptr ap = dz->application;
  287. if(ap->vflag_cnt>0)
  288. initialise_vflags(dz);
  289. tipc = ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt;
  290. ap->total_input_param_cnt = (char)tipc;
  291. if(tipc>0) {
  292. if((exit_status = setup_input_param_range_stores(tipc,ap))<0)
  293. return(exit_status);
  294. if((exit_status = setup_input_param_defaultval_stores(tipc,ap))<0)
  295. return(exit_status);
  296. if((exit_status = setup_and_init_input_param_activity(dz,tipc))<0)
  297. return(exit_status);
  298. }
  299. brkcnt = tipc;
  300. //THERE ARE NO INPUTFILE brktables USED IN THIS PROCESS
  301. if(brkcnt>0) {
  302. if((exit_status = setup_and_init_input_brktable_constants(dz,brkcnt))<0)
  303. return(exit_status);
  304. }
  305. if((storage_cnt = tipc + ap->internal_param_cnt)>0) {
  306. if((exit_status = setup_parameter_storage_and_constants(storage_cnt,dz))<0)
  307. return(exit_status);
  308. if((exit_status = initialise_is_int_and_no_brk_constants(storage_cnt,dz))<0)
  309. return(exit_status);
  310. }
  311. if((exit_status = mark_parameter_types(dz,ap))<0)
  312. return(exit_status);
  313. // establish_infile_constants() replaced by
  314. dz->infilecnt = 1;
  315. //establish_bufptrs_and_extra_buffers():
  316. return(FINISHED);
  317. }
  318. /********************** SETUP_PARAMETER_STORAGE_AND_CONSTANTS ********************/
  319. /* RWD mallo changed to calloc; helps debug verison run as release! */
  320. int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz)
  321. {
  322. if((dz->param = (double *)calloc(storage_cnt, sizeof(double)))==NULL) {
  323. sprintf(errstr,"setup_parameter_storage_and_constants(): 1\n");
  324. return(MEMORY_ERROR);
  325. }
  326. if((dz->iparam = (int *)calloc(storage_cnt, sizeof(int) ))==NULL) {
  327. sprintf(errstr,"setup_parameter_storage_and_constants(): 2\n");
  328. return(MEMORY_ERROR);
  329. }
  330. if((dz->is_int = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  331. sprintf(errstr,"setup_parameter_storage_and_constants(): 3\n");
  332. return(MEMORY_ERROR);
  333. }
  334. if((dz->no_brk = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  335. sprintf(errstr,"setup_parameter_storage_and_constants(): 5\n");
  336. return(MEMORY_ERROR);
  337. }
  338. return(FINISHED);
  339. }
  340. /************** INITIALISE_IS_INT_AND_NO_BRK_CONSTANTS *****************/
  341. int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz)
  342. {
  343. int n;
  344. for(n=0;n<storage_cnt;n++) {
  345. dz->is_int[n] = (char)0;
  346. dz->no_brk[n] = (char)0;
  347. }
  348. return(FINISHED);
  349. }
  350. /***************************** MARK_PARAMETER_TYPES **************************/
  351. int mark_parameter_types(dataptr dz,aplptr ap)
  352. {
  353. int n, m; /* PARAMS */
  354. for(n=0;n<ap->max_param_cnt;n++) {
  355. switch(ap->param_list[n]) {
  356. case('0'): break; /* dz->is_active[n] = 0 is default */
  357. case('i'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1;dz->no_brk[n] = (char)1; break;
  358. case('I'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1; break;
  359. case('d'): dz->is_active[n] = (char)1; dz->no_brk[n] = (char)1; break;
  360. case('D'): dz->is_active[n] = (char)1; /* normal case: double val or brkpnt file */ break;
  361. default:
  362. sprintf(errstr,"Programming error: invalid parameter type in mark_parameter_types()\n");
  363. return(PROGRAM_ERROR);
  364. }
  365. } /* OPTIONS */
  366. for(n=0,m=ap->max_param_cnt;n<ap->option_cnt;n++,m++) {
  367. switch(ap->option_list[n]) {
  368. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  369. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  370. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  371. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  372. default:
  373. sprintf(errstr,"Programming error: invalid option type in mark_parameter_types()\n");
  374. return(PROGRAM_ERROR);
  375. }
  376. } /* VARIANTS */
  377. for(n=0,m=ap->max_param_cnt + ap->option_cnt;n < ap->variant_param_cnt; n++, m++) {
  378. switch(ap->variant_list[n]) {
  379. case('0'): break;
  380. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  381. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  382. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  383. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  384. default:
  385. sprintf(errstr,"Programming error: invalid variant type in mark_parameter_types()\n");
  386. return(PROGRAM_ERROR);
  387. }
  388. } /* INTERNAL */
  389. for(n=0,
  390. m=ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt; n<ap->internal_param_cnt; n++,m++) {
  391. switch(ap->internal_param_list[n]) {
  392. case('0'): break; /* dummy variables: variables not used: but important for internal paream numbering!! */
  393. case('i'): dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  394. case('d'): dz->no_brk[m] = (char)1; break;
  395. default:
  396. sprintf(errstr,"Programming error: invalid internal param type in mark_parameter_types()\n");
  397. return(PROGRAM_ERROR);
  398. }
  399. }
  400. return(FINISHED);
  401. }
  402. /************************ HANDLE_THE_OUTFILE *********************/
  403. int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz)
  404. {
  405. char *filename = (*cmdline)[0], *p;
  406. if(filename[0]=='-' && filename[1]=='f') {
  407. dz->floatsam_output = 1;
  408. dz->true_outfile_stype = SAMP_FLOAT;
  409. filename+= 2;
  410. }
  411. if(!sloom) {
  412. if(file_has_invalid_startchar(filename) || value_is_numeric(filename)) {
  413. sprintf(errstr,"Outfile name %s has invalid start character(s) or looks too much like a number.\n",filename);
  414. return(DATA_ERROR);
  415. }
  416. }
  417. p = filename; // Drop file extension
  418. while(*p != ENDOFSTR) {
  419. if(*p == '.') {
  420. *p = ENDOFSTR;
  421. break;
  422. }
  423. p++;
  424. }
  425. strcpy(dz->outfilename,filename);
  426. (*cmdline)++;
  427. (*cmdlinecnt)--;
  428. return(FINISHED);
  429. }
  430. /************************ OPEN_THE_OUTFILE *********************/
  431. int open_the_outfile(dataptr dz)
  432. {
  433. int exit_status;
  434. dz->infile->channels = dz->iparam[MAD_CHANS];
  435. if((exit_status = create_sized_outfile(dz->outfilename,dz))<0)
  436. return(exit_status);
  437. dz->infile->channels = 1;
  438. return(FINISHED);
  439. }
  440. /***************************** ESTABLISH_APPLICATION **************************/
  441. int establish_application(dataptr dz)
  442. {
  443. aplptr ap;
  444. if((dz->application = (aplptr)malloc(sizeof (struct applic)))==NULL) {
  445. sprintf(errstr,"establish_application()\n");
  446. return(MEMORY_ERROR);
  447. }
  448. ap = dz->application;
  449. memset((char *)ap,0,sizeof(struct applic));
  450. return(FINISHED);
  451. }
  452. /************************* INITIALISE_VFLAGS *************************/
  453. int initialise_vflags(dataptr dz)
  454. {
  455. int n;
  456. if((dz->vflag = (char *)malloc(dz->application->vflag_cnt * sizeof(char)))==NULL) {
  457. sprintf(errstr,"INSUFFICIENT MEMORY: vflag store,\n");
  458. return(MEMORY_ERROR);
  459. }
  460. for(n=0;n<dz->application->vflag_cnt;n++)
  461. dz->vflag[n] = FALSE;
  462. return FINISHED;
  463. }
  464. /************************* SETUP_INPUT_PARAM_DEFAULTVALS *************************/
  465. int setup_input_param_defaultval_stores(int tipc,aplptr ap)
  466. {
  467. int n;
  468. if((ap->default_val = (double *)malloc(tipc * sizeof(double)))==NULL) {
  469. sprintf(errstr,"INSUFFICIENT MEMORY for application default values store\n");
  470. return(MEMORY_ERROR);
  471. }
  472. for(n=0;n<tipc;n++)
  473. ap->default_val[n] = 0.0;
  474. return(FINISHED);
  475. }
  476. /***************************** SETUP_AND_INIT_INPUT_PARAM_ACTIVITY **************************/
  477. int setup_and_init_input_param_activity(dataptr dz,int tipc)
  478. {
  479. int n;
  480. if((dz->is_active = (char *)malloc((size_t)tipc))==NULL) {
  481. sprintf(errstr,"setup_and_init_input_param_activity()\n");
  482. return(MEMORY_ERROR);
  483. }
  484. for(n=0;n<tipc;n++)
  485. dz->is_active[n] = (char)0;
  486. return(FINISHED);
  487. }
  488. /************************* SETUP_MADRID_APPLICATION *******************/
  489. int setup_madrid_application(dataptr dz)
  490. {
  491. int exit_status;
  492. aplptr ap;
  493. if((exit_status = establish_application(dz))<0) // GLOBAL
  494. return(FAILED);
  495. ap = dz->application;
  496. // SEE parstruct FOR EXPLANATION of next 2 functions
  497. if(dz->mode == 0) {
  498. if((exit_status = set_param_data(ap,0 ,6,6,"diiDDD"))<0)
  499. return(FAILED);
  500. if((exit_status = set_vflgs(ap,"s",1,"i","elrR",4,0,"0000"))<0)
  501. return(FAILED);
  502. } else {
  503. if((exit_status = set_param_data(ap,MAD_SEQUENCE,6,6,"diiDDD"))<0)
  504. return(FAILED);
  505. if((exit_status = set_vflgs(ap,"s",1,"i","el",2,0,"00"))<0)
  506. return(FAILED);
  507. }
  508. // set_legal_infile_structure -->
  509. dz->has_otherfile = FALSE;
  510. // assign_process_logic -->
  511. if(dz->mode == 0)
  512. dz->input_data_type = ONE_OR_MANY_SNDFILES;
  513. else
  514. dz->input_data_type = MANY_SNDFILES;
  515. dz->process_type = UNEQUAL_SNDFILE;
  516. dz->outfiletype = SNDFILE_OUT;
  517. return application_init(dz); //GLOBAL
  518. }
  519. /************************* PARSE_INFILE_AND_CHECK_TYPE *******************/
  520. int parse_infile_and_check_type(char **cmdline,dataptr dz)
  521. {
  522. int exit_status;
  523. infileptr infile_info;
  524. if(!sloom) {
  525. if((infile_info = (infileptr)malloc(sizeof(struct filedata)))==NULL) {
  526. sprintf(errstr,"INSUFFICIENT MEMORY for infile structure to test file data.");
  527. return(MEMORY_ERROR);
  528. } else if((exit_status = cdparse(cmdline[0],infile_info))<0) {
  529. sprintf(errstr,"Failed to parse input file %s\n",cmdline[0]);
  530. return(PROGRAM_ERROR);
  531. } else if(infile_info->filetype != SNDFILE) {
  532. sprintf(errstr,"File %s is not of correct type\n",cmdline[0]);
  533. return(DATA_ERROR);
  534. } else if(infile_info->channels != 1) {
  535. sprintf(errstr,"File %s is not of correct type (must be mono)\n",cmdline[0]);
  536. return(DATA_ERROR);
  537. } else if((exit_status = copy_parse_info_to_main_structure(infile_info,dz))<0) {
  538. sprintf(errstr,"Failed to copy file parsing information\n");
  539. return(PROGRAM_ERROR);
  540. }
  541. free(infile_info);
  542. }
  543. return(FINISHED);
  544. }
  545. /************************* SETUP_MADRID_PARAM_RANGES_AND_DEFAULTS *******************/
  546. int setup_madrid_param_ranges_and_defaults(dataptr dz)
  547. {
  548. int exit_status;
  549. aplptr ap = dz->application;
  550. // set_param_ranges()
  551. ap->total_input_param_cnt = (char)(ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt);
  552. // NB total_input_param_cnt is > 0 !!!
  553. if((exit_status = setup_input_param_range_stores(ap->total_input_param_cnt,ap))<0)
  554. return(FAILED);
  555. // get_param_ranges()
  556. ap->lo[MAD_DUR] = dz->duration;
  557. ap->hi[MAD_DUR] = 32767;
  558. ap->default_val[MAD_DUR] = 20;
  559. ap->lo[MAD_CHANS] = 2;
  560. ap->hi[MAD_CHANS] = 16;
  561. ap->default_val[MAD_CHANS] = 8;
  562. ap->lo[MAD_STRMS] = 2;
  563. ap->hi[MAD_STRMS] = 64;
  564. ap->default_val[MAD_STRMS] = 3;
  565. ap->lo[MAD_DELF] = 0;
  566. ap->hi[MAD_DELF] = 1000;
  567. ap->default_val[MAD_DELF] = 0.5;
  568. ap->lo[MAD_STEP] = 0;
  569. ap->hi[MAD_STEP] = 60;
  570. ap->default_val[MAD_STEP] = .2;
  571. ap->lo[MAD_RAND] = 0;
  572. ap->hi[MAD_RAND] = 1;
  573. ap->default_val[MAD_RAND] = 0;
  574. ap->lo[MAD_SEED] = 0;
  575. ap->hi[MAD_SEED] = 256;
  576. ap->default_val[MAD_SEED] = 256;
  577. dz->maxmode = 2;
  578. if(!sloom)
  579. put_default_vals_in_all_params(dz);
  580. return(FINISHED);
  581. }
  582. /********************************* PARSE_SLOOM_DATA *********************************/
  583. int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz)
  584. {
  585. int exit_status;
  586. int cnt = 1, infilecnt;
  587. int filesize, insams, inbrksize;
  588. double dummy;
  589. int true_cnt = 0;
  590. // aplptr ap;
  591. while(cnt<=PRE_CMDLINE_DATACNT) {
  592. if(cnt > argc) {
  593. sprintf(errstr,"Insufficient data sent from TK\n");
  594. return(DATA_ERROR);
  595. }
  596. switch(cnt) {
  597. case(1):
  598. if(sscanf(argv[cnt],"%d",&dz->process)!=1) {
  599. sprintf(errstr,"Cannot read process no. sent from TK\n");
  600. return(DATA_ERROR);
  601. }
  602. break;
  603. case(2):
  604. if(sscanf(argv[cnt],"%d",&dz->mode)!=1) {
  605. sprintf(errstr,"Cannot read mode no. sent from TK\n");
  606. return(DATA_ERROR);
  607. }
  608. if(dz->mode > 0)
  609. dz->mode--;
  610. //setup_particular_application() =
  611. if((exit_status = setup_madrid_application(dz))<0)
  612. return(exit_status);
  613. // ap = dz->application;
  614. break;
  615. case(3):
  616. if(sscanf(argv[cnt],"%d",&infilecnt)!=1) {
  617. sprintf(errstr,"Cannot read infilecnt sent from TK\n");
  618. return(DATA_ERROR);
  619. }
  620. if(infilecnt < 1) {
  621. true_cnt = cnt + 1;
  622. cnt = PRE_CMDLINE_DATACNT; /* force exit from loop after assign_file_data_storage */
  623. }
  624. if((exit_status = assign_file_data_storage(infilecnt,dz))<0)
  625. return(exit_status);
  626. break;
  627. case(INPUT_FILETYPE+4):
  628. if(sscanf(argv[cnt],"%d",&dz->infile->filetype)!=1) {
  629. sprintf(errstr,"Cannot read filetype sent from TK (%s)\n",argv[cnt]);
  630. return(DATA_ERROR);
  631. }
  632. break;
  633. case(INPUT_FILESIZE+4):
  634. if(sscanf(argv[cnt],"%d",&filesize)!=1) {
  635. sprintf(errstr,"Cannot read infilesize sent from TK\n");
  636. return(DATA_ERROR);
  637. }
  638. dz->insams[0] = filesize;
  639. break;
  640. case(INPUT_INSAMS+4):
  641. if(sscanf(argv[cnt],"%d",&insams)!=1) {
  642. sprintf(errstr,"Cannot read insams sent from TK\n");
  643. return(DATA_ERROR);
  644. }
  645. dz->insams[0] = insams;
  646. break;
  647. case(INPUT_SRATE+4):
  648. if(sscanf(argv[cnt],"%d",&dz->infile->srate)!=1) {
  649. sprintf(errstr,"Cannot read srate sent from TK\n");
  650. return(DATA_ERROR);
  651. }
  652. break;
  653. case(INPUT_CHANNELS+4):
  654. if(sscanf(argv[cnt],"%d",&dz->infile->channels)!=1) {
  655. sprintf(errstr,"Cannot read channels sent from TK\n");
  656. return(DATA_ERROR);
  657. }
  658. break;
  659. case(INPUT_STYPE+4):
  660. if(sscanf(argv[cnt],"%d",&dz->infile->stype)!=1) {
  661. sprintf(errstr,"Cannot read stype sent from TK\n");
  662. return(DATA_ERROR);
  663. }
  664. break;
  665. case(INPUT_ORIGSTYPE+4):
  666. if(sscanf(argv[cnt],"%d",&dz->infile->origstype)!=1) {
  667. sprintf(errstr,"Cannot read origstype sent from TK\n");
  668. return(DATA_ERROR);
  669. }
  670. break;
  671. case(INPUT_ORIGRATE+4):
  672. if(sscanf(argv[cnt],"%d",&dz->infile->origrate)!=1) {
  673. sprintf(errstr,"Cannot read origrate sent from TK\n");
  674. return(DATA_ERROR);
  675. }
  676. break;
  677. case(INPUT_MLEN+4):
  678. if(sscanf(argv[cnt],"%d",&dz->infile->Mlen)!=1) {
  679. sprintf(errstr,"Cannot read Mlen sent from TK\n");
  680. return(DATA_ERROR);
  681. }
  682. break;
  683. case(INPUT_DFAC+4):
  684. if(sscanf(argv[cnt],"%d",&dz->infile->Dfac)!=1) {
  685. sprintf(errstr,"Cannot read Dfac sent from TK\n");
  686. return(DATA_ERROR);
  687. }
  688. break;
  689. case(INPUT_ORIGCHANS+4):
  690. if(sscanf(argv[cnt],"%d",&dz->infile->origchans)!=1) {
  691. sprintf(errstr,"Cannot read origchans sent from TK\n");
  692. return(DATA_ERROR);
  693. }
  694. break;
  695. case(INPUT_SPECENVCNT+4):
  696. if(sscanf(argv[cnt],"%d",&dz->infile->specenvcnt)!=1) {
  697. sprintf(errstr,"Cannot read specenvcnt sent from TK\n");
  698. return(DATA_ERROR);
  699. }
  700. dz->specenvcnt = dz->infile->specenvcnt;
  701. break;
  702. case(INPUT_WANTED+4):
  703. if(sscanf(argv[cnt],"%d",&dz->wanted)!=1) {
  704. sprintf(errstr,"Cannot read wanted sent from TK\n");
  705. return(DATA_ERROR);
  706. }
  707. break;
  708. case(INPUT_WLENGTH+4):
  709. if(sscanf(argv[cnt],"%d",&dz->wlength)!=1) {
  710. sprintf(errstr,"Cannot read wlength sent from TK\n");
  711. return(DATA_ERROR);
  712. }
  713. break;
  714. case(INPUT_OUT_CHANS+4):
  715. if(sscanf(argv[cnt],"%d",&dz->out_chans)!=1) {
  716. sprintf(errstr,"Cannot read out_chans sent from TK\n");
  717. return(DATA_ERROR);
  718. }
  719. break;
  720. /* RWD these chanegs to samps - tk will have to deal with that! */
  721. case(INPUT_DESCRIPTOR_BYTES+4):
  722. if(sscanf(argv[cnt],"%d",&dz->descriptor_samps)!=1) {
  723. sprintf(errstr,"Cannot read descriptor_samps sent from TK\n");
  724. return(DATA_ERROR);
  725. }
  726. break;
  727. case(INPUT_IS_TRANSPOS+4):
  728. if(sscanf(argv[cnt],"%d",&dz->is_transpos)!=1) {
  729. sprintf(errstr,"Cannot read is_transpos sent from TK\n");
  730. return(DATA_ERROR);
  731. }
  732. break;
  733. case(INPUT_COULD_BE_TRANSPOS+4):
  734. if(sscanf(argv[cnt],"%d",&dz->could_be_transpos)!=1) {
  735. sprintf(errstr,"Cannot read could_be_transpos sent from TK\n");
  736. return(DATA_ERROR);
  737. }
  738. break;
  739. case(INPUT_COULD_BE_PITCH+4):
  740. if(sscanf(argv[cnt],"%d",&dz->could_be_pitch)!=1) {
  741. sprintf(errstr,"Cannot read could_be_pitch sent from TK\n");
  742. return(DATA_ERROR);
  743. }
  744. break;
  745. case(INPUT_DIFFERENT_SRATES+4):
  746. if(sscanf(argv[cnt],"%d",&dz->different_srates)!=1) {
  747. sprintf(errstr,"Cannot read different_srates sent from TK\n");
  748. return(DATA_ERROR);
  749. }
  750. break;
  751. case(INPUT_DUPLICATE_SNDS+4):
  752. if(sscanf(argv[cnt],"%d",&dz->duplicate_snds)!=1) {
  753. sprintf(errstr,"Cannot read duplicate_snds sent from TK\n");
  754. return(DATA_ERROR);
  755. }
  756. break;
  757. case(INPUT_BRKSIZE+4):
  758. if(sscanf(argv[cnt],"%d",&inbrksize)!=1) {
  759. sprintf(errstr,"Cannot read brksize sent from TK\n");
  760. return(DATA_ERROR);
  761. }
  762. if(inbrksize > 0) {
  763. switch(dz->input_data_type) {
  764. case(WORDLIST_ONLY):
  765. break;
  766. case(PITCH_AND_PITCH):
  767. case(PITCH_AND_TRANSPOS):
  768. case(TRANSPOS_AND_TRANSPOS):
  769. dz->tempsize = inbrksize;
  770. break;
  771. case(BRKFILES_ONLY):
  772. case(UNRANGED_BRKFILE_ONLY):
  773. case(DB_BRKFILES_ONLY):
  774. case(ALL_FILES):
  775. case(ANY_NUMBER_OF_ANY_FILES):
  776. if(dz->extrabrkno < 0) {
  777. sprintf(errstr,"Storage location number for brktable not established by CDP.\n");
  778. return(DATA_ERROR);
  779. }
  780. if(dz->brksize == NULL) {
  781. sprintf(errstr,"CDP has not established storage space for input brktable.\n");
  782. return(PROGRAM_ERROR);
  783. }
  784. dz->brksize[dz->extrabrkno] = inbrksize;
  785. break;
  786. default:
  787. sprintf(errstr,"TK sent brktablesize > 0 for input_data_type [%d] not using brktables.\n",
  788. dz->input_data_type);
  789. return(PROGRAM_ERROR);
  790. }
  791. break;
  792. }
  793. break;
  794. case(INPUT_NUMSIZE+4):
  795. if(sscanf(argv[cnt],"%d",&dz->numsize)!=1) {
  796. sprintf(errstr,"Cannot read numsize sent from TK\n");
  797. return(DATA_ERROR);
  798. }
  799. break;
  800. case(INPUT_LINECNT+4):
  801. if(sscanf(argv[cnt],"%d",&dz->linecnt)!=1) {
  802. sprintf(errstr,"Cannot read linecnt sent from TK\n");
  803. return(DATA_ERROR);
  804. }
  805. break;
  806. case(INPUT_ALL_WORDS+4):
  807. if(sscanf(argv[cnt],"%d",&dz->all_words)!=1) {
  808. sprintf(errstr,"Cannot read all_words sent from TK\n");
  809. return(DATA_ERROR);
  810. }
  811. break;
  812. case(INPUT_ARATE+4):
  813. if(sscanf(argv[cnt],"%f",&dz->infile->arate)!=1) {
  814. sprintf(errstr,"Cannot read arate sent from TK\n");
  815. return(DATA_ERROR);
  816. }
  817. break;
  818. case(INPUT_FRAMETIME+4):
  819. if(sscanf(argv[cnt],"%lf",&dummy)!=1) {
  820. sprintf(errstr,"Cannot read frametime sent from TK\n");
  821. return(DATA_ERROR);
  822. }
  823. dz->frametime = (float)dummy;
  824. break;
  825. case(INPUT_WINDOW_SIZE+4):
  826. if(sscanf(argv[cnt],"%f",&dz->infile->window_size)!=1) {
  827. sprintf(errstr,"Cannot read window_size sent from TK\n");
  828. return(DATA_ERROR);
  829. }
  830. break;
  831. case(INPUT_NYQUIST+4):
  832. if(sscanf(argv[cnt],"%lf",&dz->nyquist)!=1) {
  833. sprintf(errstr,"Cannot read nyquist sent from TK\n");
  834. return(DATA_ERROR);
  835. }
  836. break;
  837. case(INPUT_DURATION+4):
  838. if(sscanf(argv[cnt],"%lf",&dz->duration)!=1) {
  839. sprintf(errstr,"Cannot read duration sent from TK\n");
  840. return(DATA_ERROR);
  841. }
  842. break;
  843. case(INPUT_MINBRK+4):
  844. if(sscanf(argv[cnt],"%lf",&dz->minbrk)!=1) {
  845. sprintf(errstr,"Cannot read minbrk sent from TK\n");
  846. return(DATA_ERROR);
  847. }
  848. break;
  849. case(INPUT_MAXBRK+4):
  850. if(sscanf(argv[cnt],"%lf",&dz->maxbrk)!=1) {
  851. sprintf(errstr,"Cannot read maxbrk sent from TK\n");
  852. return(DATA_ERROR);
  853. }
  854. break;
  855. case(INPUT_MINNUM+4):
  856. if(sscanf(argv[cnt],"%lf",&dz->minnum)!=1) {
  857. sprintf(errstr,"Cannot read minnum sent from TK\n");
  858. return(DATA_ERROR);
  859. }
  860. break;
  861. case(INPUT_MAXNUM+4):
  862. if(sscanf(argv[cnt],"%lf",&dz->maxnum)!=1) {
  863. sprintf(errstr,"Cannot read maxnum sent from TK\n");
  864. return(DATA_ERROR);
  865. }
  866. break;
  867. default:
  868. sprintf(errstr,"case switch item missing: parse_sloom_data()\n");
  869. return(PROGRAM_ERROR);
  870. }
  871. cnt++;
  872. }
  873. if(cnt!=PRE_CMDLINE_DATACNT+1) {
  874. sprintf(errstr,"Insufficient pre-cmdline params sent from TK\n");
  875. return(DATA_ERROR);
  876. }
  877. if(true_cnt)
  878. cnt = true_cnt;
  879. *cmdlinecnt = 0;
  880. while(cnt < argc) {
  881. if((exit_status = get_tk_cmdline_word(cmdlinecnt,cmdline,argv[cnt]))<0)
  882. return(exit_status);
  883. cnt++;
  884. }
  885. return(FINISHED);
  886. }
  887. /********************************* GET_TK_CMDLINE_WORD *********************************/
  888. int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q)
  889. {
  890. if(*cmdlinecnt==0) {
  891. if((*cmdline = (char **)malloc(sizeof(char *)))==NULL) {
  892. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  893. return(MEMORY_ERROR);
  894. }
  895. } else {
  896. if((*cmdline = (char **)realloc(*cmdline,((*cmdlinecnt)+1) * sizeof(char *)))==NULL) {
  897. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  898. return(MEMORY_ERROR);
  899. }
  900. }
  901. if(((*cmdline)[*cmdlinecnt] = (char *)malloc((strlen(q) + 1) * sizeof(char)))==NULL) {
  902. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline item %d.\n",(*cmdlinecnt)+1);
  903. return(MEMORY_ERROR);
  904. }
  905. strcpy((*cmdline)[*cmdlinecnt],q);
  906. (*cmdlinecnt)++;
  907. return(FINISHED);
  908. }
  909. /****************************** ASSIGN_FILE_DATA_STORAGE *********************************/
  910. int assign_file_data_storage(int infilecnt,dataptr dz)
  911. {
  912. int exit_status;
  913. int no_sndfile_system_files = FALSE;
  914. dz->infilecnt = infilecnt;
  915. if((exit_status = allocate_filespace(dz))<0)
  916. return(exit_status);
  917. if(no_sndfile_system_files)
  918. dz->infilecnt = 0;
  919. return(FINISHED);
  920. }
  921. /************************* redundant functions: to ensure libs compile OK *******************/
  922. int assign_process_logic(dataptr dz)
  923. {
  924. return(FINISHED);
  925. }
  926. void set_legal_infile_structure(dataptr dz)
  927. {}
  928. int set_legal_internalparam_structure(int process,int mode,aplptr ap)
  929. {
  930. return(FINISHED);
  931. }
  932. int setup_internal_arrays_and_array_pointers(dataptr dz)
  933. {
  934. return(FINISHED);
  935. }
  936. int establish_bufptrs_and_extra_buffers(dataptr dz)
  937. {
  938. return(FINISHED);
  939. }
  940. int read_special_data(char *str,dataptr dz)
  941. {
  942. return(FINISHED);
  943. }
  944. int inner_loop
  945. (int *peakscore,int *descnt,int *in_start_portion,int *least,int *pitchcnt,int windows_in_buf,dataptr dz)
  946. {
  947. return(FINISHED);
  948. }
  949. int get_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  950. {
  951. return(FINISHED);
  952. }
  953. /******************************** USAGE1 ********************************/
  954. int usage1(void)
  955. {
  956. usage2("madrid");
  957. return(USAGE_ONLY);
  958. }
  959. /**************************** MADRID_PARAM_PREPROCESS ****************************/
  960. int madrid_param_preprocess(dataptr dz)
  961. {
  962. int exit_status, chans = dz->iparam[MAD_CHANS];
  963. double srate = (double)dz->infile->srate, maxrand, minstep, maxsteps, leftgain, rightgain;
  964. int imaxsteps, iminstep, maxoverlay, maxinsize, n, m;
  965. int *lmost, *rmost;
  966. double *pos, *llev, *rlev;
  967. dz->iparam[MAD_DUR] = (int)round(dz->param[MAD_DUR] * srate);
  968. // Calculate minimum possible step between events
  969. if(dz->brksize[MAD_STEP]) {
  970. if((exit_status = get_minvalue_in_brktable(&minstep,MAD_STEP,dz))<0)
  971. return PROGRAM_ERROR;
  972. } else
  973. minstep = dz->param[MAD_STEP];
  974. if(dz->brksize[MAD_RAND]) {
  975. if((exit_status = get_maxvalue_in_brktable(&maxrand,MAD_RAND,dz))<0)
  976. return PROGRAM_ERROR;
  977. } else
  978. maxrand = dz->param[MAD_RAND];
  979. minstep = minstep - (minstep/2.0 * maxrand);
  980. iminstep = (int)floor(dz->param[MAD_STEP] * srate);
  981. if(iminstep > 4)
  982. iminstep -= 4; // SAFETY
  983. // Calculate maximum possible overlay of streams
  984. maxinsize = dz->insams[0];
  985. for(n=1;n < dz->infilecnt;n++)
  986. maxinsize = max(maxinsize,dz->insams[n]);
  987. maxoverlay = maxinsize/iminstep;
  988. if(maxoverlay * iminstep != maxinsize)
  989. maxoverlay++;
  990. dz->dupl = maxoverlay;
  991. // Calculate maximum possible timesteps
  992. maxsteps = dz->param[MAD_DUR]/minstep;
  993. imaxsteps = (int)ceil(maxsteps * srate);
  994. imaxsteps += 4; // SAFETY
  995. dz->itemcnt = imaxsteps;
  996. /******************************************************************************
  997. * INTEGER ARRAYS LONG ARRAYS
  998. * points to points to
  999. * lmost | | | | MODE1 ptrfile
  1000. * | rmost | | | sequence | itimes
  1001. * | | ptrfile | | | array | | |
  1002. * | | | strperm | | no: 0 1 |
  1003. * | | | | fileperm | | | | |
  1004. * | | | | | fileon | | size strmcnt*dupl
  1005. * array | | | | | onoff-flags.. | | | maxsteps
  1006. * no: 0 1 2 3 4 5 6 1-for-each 6+strmcnt | | |
  1007. * | | | | | | | stream | |
  1008. * _ | | | | | | |--------------| |
  1009. * | strmcnt | | | | |
  1010. * | | strmcnt | | maxsteps maxsteps
  1011. * size | | strmcnt*dupl | |
  1012. * | | | | strmcnt | |
  1013. * | | | | | infilecnt | |
  1014. * |_ | | | | | maxsteps | |
  1015. *
  1016. * dz->iparray[0] = leftmost channel for output for each stream
  1017. * dz->iparray[1] = rightmost channel for output for each stream
  1018. * dz->iparray[2] = insound associated with ptr
  1019. * dz->iparray[3] = permutations of streams, to select those to be on/off.
  1020. * dz->iparray[4] = permutations of infile order - if ness.
  1021. * dz->iparray[5] = infile in use at each step.
  1022. * dz->iparray + 6 points to MAD_STRMS arrays of onoff flags
  1023. *
  1024. * dz->lparray[0] = pointers associated with streams (if repeats overlap one another, need duplicate pointers)
  1025. * dz->lparray[1] = times of events, in samples.
  1026. */
  1027. if(dz->mode == 1) {
  1028. if((dz->iparray = (int **)malloc((7 + dz->iparam[MAD_STRMS]) * sizeof(int *)))==NULL) {
  1029. sprintf(errstr,"INSUFFICIENT MEMORY to create integer arrays. Reduce stream cnt or duration, or increase step.\n");
  1030. return(MEMORY_ERROR);
  1031. }
  1032. } else {
  1033. if((dz->iparray = (int **)malloc((6 + dz->iparam[MAD_STRMS]) * sizeof(int *)))==NULL) {
  1034. sprintf(errstr,"INSUFFICIENT MEMORY to create integer arrays. Reduce stream cnt or duration, or increase step.\n");
  1035. return(MEMORY_ERROR);
  1036. }
  1037. }
  1038. for(n = 0; n < 2;n++) {
  1039. if((dz->iparray[n] = (int *)malloc(dz->iparam[MAD_STRMS] * sizeof(int)))==NULL) {
  1040. sprintf(errstr,"INSUFFICIENT MEMORY to create integer array %d. Reduce stream cnt or duration, or increase step.\n",n+1);
  1041. return(MEMORY_ERROR);
  1042. }
  1043. }
  1044. if((dz->iparray[2] = (int *)malloc((dz->dupl * dz->iparam[MAD_STRMS]) * sizeof(int)))==NULL) {
  1045. sprintf(errstr,"INSUFFICIENT MEMORY to create integer array 3. Reduce stream cnt or duration, or increase step.\n");
  1046. return(MEMORY_ERROR);
  1047. }
  1048. if((dz->iparray[3] = (int *)malloc((dz->iparam[MAD_STRMS] + 1) * sizeof(int)))==NULL) {
  1049. sprintf(errstr,"INSUFFICIENT MEMORY to create integer array 4. Reduce stream cnt or duration, or increase step.\n");
  1050. return(MEMORY_ERROR);
  1051. }
  1052. if((dz->iparray[4] = (int *)malloc((dz->infilecnt + 1) * sizeof(int)))==NULL) {
  1053. sprintf(errstr,"INSUFFICIENT MEMORY to create integer array 5. Reduce stream cnt or duration, or increase step.\n");
  1054. return(MEMORY_ERROR);
  1055. }
  1056. if((dz->iparray[5] = (int *)malloc(imaxsteps * sizeof(int)))==NULL) {
  1057. sprintf(errstr,"INSUFFICIENT MEMORY to create integer array 6. Reduce stream cnt or duration, or increase step.\n");
  1058. return(MEMORY_ERROR);
  1059. }
  1060. for(n = 0, m = 6; n < dz->iparam[MAD_STRMS];n++,m++) {
  1061. if((dz->iparray[m] = (int *)malloc(imaxsteps * sizeof(int)))==NULL) {
  1062. sprintf(errstr,"INSUFFICIENT MEMORY to create integer array %d.\nReduce stream count to <= %d\n",m+1,m-7);
  1063. return(MEMORY_ERROR);
  1064. }
  1065. }
  1066. if(dz->mode == 1) {
  1067. if((dz->iparray[m] = (int *)malloc(imaxsteps * sizeof(int)))==NULL) {
  1068. sprintf(errstr,"INSUFFICIENT MEMORY to create integer array %d. Reduce stream cnt or duration, or increase step.\n",m+1);
  1069. return(MEMORY_ERROR);
  1070. }
  1071. }
  1072. if((dz->lparray = (int **)malloc(2 * sizeof(int *)))==NULL) {
  1073. sprintf(errstr,"INSUFFICIENT MEMORY to create longs arrays. Reduce stream cnt or duration, or increase step.\n");
  1074. return(MEMORY_ERROR);
  1075. }
  1076. if((dz->lparray[0] = (int *)malloc((dz->iparam[MAD_STRMS] * dz->dupl) * sizeof(int)))==NULL) {
  1077. sprintf(errstr,"INSUFFICIENT MEMORY to create longs array 1. Reduce stream cnt or duration, or increase step.\n");
  1078. return(MEMORY_ERROR);
  1079. }
  1080. if((dz->lparray[1] = (int *)malloc(imaxsteps * sizeof(int)))==NULL) {
  1081. sprintf(errstr,"INSUFFICIENT MEMORY to create longs array 2. Reduce stream cnt or duration, or increase step.\n");
  1082. return(MEMORY_ERROR);
  1083. }
  1084. lmost = dz->iparray[0];
  1085. rmost = dz->iparray[1];
  1086. /*********************************************
  1087. *
  1088. * dz->parray[0] = level of leftmost channel for output of each stream
  1089. * dz->parray[1] = level of rightmost channel for output of each stream
  1090. */
  1091. if((dz->parray = (double **)malloc(2 * sizeof(double *)))==NULL) {
  1092. sprintf(errstr,"INSUFFICIENT MEMORY to create doubles arrays.\n");
  1093. return(MEMORY_ERROR);
  1094. }
  1095. for(n = 0; n < 2;n++) {
  1096. if((dz->parray[n] = (double *)malloc(dz->iparam[MAD_STRMS] * sizeof(double)))==NULL) {
  1097. sprintf(errstr,"INSUFFICIENT MEMORY to create doubles array %d.\n",n+1);
  1098. return(MEMORY_ERROR);
  1099. }
  1100. }
  1101. pos = dz->parray[0]; // Used initially for position, then overwritten by left level value
  1102. llev = dz->parray[0];
  1103. rlev = dz->parray[1];
  1104. // Calculate spatial positions of streams, and associated LR-levels
  1105. if(dz->iparam[MAD_STRMS] == chans) {
  1106. for(n = 0;n<chans;n++) {
  1107. lmost[n] = n;
  1108. rmost[n] = (lmost[n] + 1) % chans;
  1109. llev[n] = 1.0;
  1110. rlev[n] = 0.0;
  1111. }
  1112. } else {
  1113. if (chans == 1) {
  1114. for(n = 0;n<dz->iparam[MAD_STRMS];n++) {
  1115. lmost[n] = 0;
  1116. rmost[n] = 0;
  1117. llev[n] = 1.0; // Daft, but keeps same algo for all cases
  1118. rlev[n] = 0.0;
  1119. }
  1120. } else {
  1121. if(dz->vflag[MAD_LINEAR] || chans == 2) {
  1122. for(n = 0;n<dz->iparam[MAD_STRMS];n++) {
  1123. pos[n] = ((chans - 1) * n)/(double)(dz->iparam[MAD_STRMS] - 1);
  1124. lmost[n] = (int)floor(pos[n]);
  1125. pos[n] -= lmost[n];
  1126. }
  1127. } else {
  1128. for(n = 0;n<dz->iparam[MAD_STRMS];n++) {
  1129. pos[n] = (chans * n)/(double)dz->iparam[MAD_STRMS];
  1130. lmost[n] = (int)floor(pos[n]);
  1131. pos[n] -= lmost[n];
  1132. }
  1133. }
  1134. }
  1135. for(n = 0;n<dz->iparam[MAD_STRMS];n++) {
  1136. rmost[n] = (lmost[n] + 1) % chans;
  1137. if(flteq(pos[n],0.0)) {
  1138. rlev[n] = 0.0;
  1139. llev[n] = 1.0; // pos values overwritten by associated level values (ETC below)
  1140. } else if(flteq(pos[n],1.0)) {
  1141. rlev[n] = 1.0;
  1142. llev[n] = 0.0;
  1143. } else {
  1144. pos[n] *= 2.0;
  1145. pos[n] -= 1.0; // Change position to -1 to +1 range
  1146. pancalc(pos[n],&leftgain,&rightgain);
  1147. rlev[n] = rightgain;
  1148. llev[n] = leftgain;
  1149. }
  1150. }
  1151. }
  1152. return FINISHED;
  1153. }
  1154. /********************************************************************************************/
  1155. int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  1156. {
  1157. if(!strcmp(prog_identifier_from_cmdline,"madrid")) dz->process = MADRID;
  1158. else {
  1159. sprintf(errstr,"Unknown program identification string '%s'\n",prog_identifier_from_cmdline);
  1160. return(USAGE_ONLY);
  1161. }
  1162. return(FINISHED);
  1163. }
  1164. /******************************** SETUP_AND_INIT_INPUT_BRKTABLE_CONSTANTS ********************************/
  1165. int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt)
  1166. {
  1167. int n;
  1168. if((dz->brk = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  1169. sprintf(errstr,"setup_and_init_input_brktable_constants(): 1\n");
  1170. return(MEMORY_ERROR);
  1171. }
  1172. if((dz->brkptr = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  1173. sprintf(errstr,"setup_and_init_input_brktable_constants(): 6\n");
  1174. return(MEMORY_ERROR);
  1175. }
  1176. if((dz->brksize = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  1177. sprintf(errstr,"setup_and_init_input_brktable_constants(): 2\n");
  1178. return(MEMORY_ERROR);
  1179. }
  1180. if((dz->firstval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  1181. sprintf(errstr,"setup_and_init_input_brktable_constants(): 3\n");
  1182. return(MEMORY_ERROR);
  1183. }
  1184. if((dz->lastind = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  1185. sprintf(errstr,"setup_and_init_input_brktable_constants(): 4\n");
  1186. return(MEMORY_ERROR);
  1187. }
  1188. if((dz->lastval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  1189. sprintf(errstr,"setup_and_init_input_brktable_constants(): 5\n");
  1190. return(MEMORY_ERROR);
  1191. }
  1192. if((dz->brkinit = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  1193. sprintf(errstr,"setup_and_init_input_brktable_constants(): 7\n");
  1194. return(MEMORY_ERROR);
  1195. }
  1196. for(n=0;n<brkcnt;n++) {
  1197. dz->brk[n] = NULL;
  1198. dz->brkptr[n] = NULL;
  1199. dz->brkinit[n] = 0;
  1200. dz->brksize[n] = 0;
  1201. }
  1202. return(FINISHED);
  1203. }
  1204. /******************************** USAGE2 ********************************/
  1205. int usage2(char *str)
  1206. {
  1207. if(!strcmp(str,"madrid")) {
  1208. fprintf(stdout,
  1209. "USAGE:\n"
  1210. "madrid madrid 1 inf [inf2 ...] outf dur ochans strmcnt delfact step rand\n"
  1211. " [-sseed] [-l] [-e] [-r|-R]\n"
  1212. "madrid madrid 2 inf inf2 [inf3...] seqfile outf dur ochans strmcnt delfact step rand\n"
  1213. " [-sseed] [-l] [-e]\n"
  1214. "\n"
  1215. "Spatially syncopate repetitions of src(s) \n"
  1216. "by randomly deleting items from the spatially-separated repetition streams.\n"
  1217. "\n"
  1218. "For each output event, source played at 1 or more spatial locations, SYNCHRONOUSLY.\n"
  1219. "Depending on which/how many locations are used for an output event,\n"
  1220. "the output appears differently located in space, and differently accented.\n"
  1221. "\"DELFACT\" and \"-e\" are hence the crucial rhythmicising parameter here.\n"
  1222. "\n"
  1223. "SEQFILE textfile containing list of numbers in range 1 to count-of-infiles.\n"
  1224. " Determines the order in which infiles are used in the output.\n"
  1225. "\n"
  1226. "DUR Duration of output sound.\n"
  1227. "OCHANS Number of channels in output sound.\n"
  1228. "STRMCNT Number of spatially distinct streams.\n"
  1229. "DELFACT Proportion of items to (randomly) delete.\n"
  1230. " Vals from 0 to 1 delete that proportion of events in the various streams.\n"
  1231. " For vals > 1, proportion of events at single locations increases,\n"
  1232. " and, if the \"-e\" flag is set, the proportion of empty events increases.\n"
  1233. "STEP Time between event repetitions.\n"
  1234. "RAND Randomisation of step size (0-1).\n"
  1235. "SEED Value to initialise the randomisation OF DELETIONS.\n"
  1236. " With a non-zero value, re-running the process with the SAME parameters\n"
  1237. " will produce the same output. Otherwise deletions are always different.\n"
  1238. "-e allow Empty events i.e. sound absent at some of the repeat-steps.\n"
  1239. "-l For OCHANS > 2, lspkr array assumed to be circular.\n"
  1240. " -l flag forces array to be linear (with defined left and right ends).\n"
  1241. "-r Randomly permute the order of input sounds used in the output.\n"
  1242. " (ALL input sounds used ONCE before next order-permutation is generated).\n"
  1243. "-R Randomly select next input sound (selection unrelated to last selection).\n"
  1244. "\n"
  1245. "-r and -R cannot be used in combination.\n"
  1246. "When only 1 input sound is used, neither flag has any effect.\n"
  1247. "\n"
  1248. "DELFACT, STEP and RAND can vary over time.\n"
  1249. "\n");
  1250. } else
  1251. fprintf(stdout,"Unknown option '%s'\n",str);
  1252. return(USAGE_ONLY);
  1253. }
  1254. int usage3(char *str1,char *str2)
  1255. {
  1256. fprintf(stderr,"Insufficient parameters on command line.\n");
  1257. return(USAGE_ONLY);
  1258. }
  1259. /******************************** MADRID ********************************
  1260. *
  1261. * INTEGER ARRAYS LONG ARRAYS
  1262. * points to points to
  1263. * lmost | | | | | ptrfile
  1264. * | rmost | | | | | itimes
  1265. * | | ptrfile | | array | | |
  1266. * | | | strperm | no: 0 1 |
  1267. * | | | | fileperm | | | |
  1268. * | | | | | fileon | size strmcnt*dupl
  1269. * array | | | | | onoff-flags.. | | maxsteps
  1270. * no: 0 1 2 3 4 5 6 1-for-each | | | |
  1271. * | | | | | | | stream |
  1272. * _ | | | | | | |--------------|
  1273. * | strmcnt | | | |
  1274. * | | strmcnt | | maxsteps |
  1275. * size | | strmcnt*dupl |
  1276. * | | | | strmcnt |
  1277. * | | | | | infilecnt |
  1278. * |_ | | | | | maxsteps |
  1279. *
  1280. * dz->iparray[0] = leftmost channel for output for each stream
  1281. * dz->iparray[1] = rightmost channel for output for each stream
  1282. * dz->iparray[2] = insound associated with ptr
  1283. * dz->iparray[3] = permutations of streams, to select those to be on/off.
  1284. * dz->iparray[4] = permutations of infile order - if ness.
  1285. * dz->iparray[5] = infile in use.
  1286. * dz->iparray + 6 points to MAD_STRMS arrays of onoff flags
  1287. *
  1288. * dz->lparray[0] = pointers associated with streams
  1289. * dz->lparray[1] = times of events, in samples.
  1290. */
  1291. #define ibuf dz->sampbuf
  1292. int madrid(dataptr dz)
  1293. {
  1294. int exit_status, finished;
  1295. double *llev = dz->parray[0], *rlev = dz->parray[1];
  1296. int *lmost = dz->iparray[0], *rmost = dz->iparray[1], *inf = dz->iparray[2], *seq = NULL;
  1297. int *strmperm = dz->iparray[3], *srcsperm = dz->iparray[4], *fileon = dz->iparray[5];
  1298. int *ptr = dz->lparray[0], *itime = dz->lparray[1];
  1299. int **onoff = dz->iparray + 6;
  1300. float *obuf = dz->sampbuf[dz->infilecnt];
  1301. double srate = (double)dz->infile->srate;
  1302. int insnd = 0, ptrcnt, srcspermno, streams_off, lastinlastperm, xs, logxs = 0, chans = dz->iparam[MAD_CHANS];
  1303. int n, nn, m, samps_read, /* totaloutsamps,*/ outcnt, inexttime, stepcnt, opos, eventcnt = 0;
  1304. double maxsamp = 0.0, time = 0.0, nexttime, endtime, normaliser;
  1305. if(dz->iparam[MAD_SEED] > 0)
  1306. srand((int)dz->iparam[MAD_SEED]);
  1307. else
  1308. initrand48();
  1309. if(dz->mode == 1)
  1310. seq = dz->iparray[6 + dz->iparam[MAD_STRMS]];
  1311. ptrcnt = dz->dupl * dz->iparam[MAD_STRMS];
  1312. for(n=0;n<ptrcnt;n++) {
  1313. ptr[n] = -1; // Mark all buffer pointers as available
  1314. inf[n] = 0; // SAFETY: Connect all ptrs with infile 0
  1315. }
  1316. // Read all infiles, filling buffers
  1317. for(n=0;n<dz->infilecnt;n++) {
  1318. if((samps_read = fgetfbufEx(dz->sampbuf[n], dz->insams[n],dz->ifd[n],0))<0) {
  1319. sprintf(errstr,"Sound read error with input soundfile %d: %s\n",n+1,sferrstr());
  1320. return(SYSTEM_ERROR);
  1321. }
  1322. srcsperm[n] = n; // Initialise permutation-of-insounds
  1323. }
  1324. // totaloutsamps = dz->iparam[MAD_DUR];
  1325. nexttime = 0.0;
  1326. inexttime = 0;
  1327. stepcnt = -1;
  1328. outcnt = 0;
  1329. opos = 0;
  1330. srcspermno = 0;
  1331. eventcnt = 0;
  1332. fprintf(stdout,"INFO: First pass: assessing level.\n");
  1333. fflush(stdout);
  1334. memset((char *)obuf,0,dz->buflen * sizeof(float));
  1335. while(outcnt < dz->iparam[MAD_DUR]) {
  1336. if(outcnt >= inexttime) {
  1337. itime[stepcnt] = inexttime;
  1338. stepcnt++;
  1339. eventcnt++;
  1340. time = nexttime;
  1341. if(time >= dz->param[MAD_DUR]) // AAA: see note at foot of loop
  1342. break;
  1343. itime[stepcnt] = inexttime;
  1344. if((exit_status = read_values_from_all_existing_brktables(time,dz))<0)
  1345. return exit_status;
  1346. // GET SOUND FOR THIS EVENT : If only 1 infile, insnd defaults to 0
  1347. if(dz->infilecnt > 1) {
  1348. if(dz->mode == 1)
  1349. insnd = seq[eventcnt];
  1350. else {
  1351. srcspermno %= dz->infilecnt;
  1352. if(dz->vflag[MAD_INPERM]) {
  1353. if(srcspermno == 0) {
  1354. lastinlastperm = srcsperm[dz->infilecnt - 1];
  1355. rndintperm(srcsperm,dz->infilecnt);
  1356. if(lastinlastperm == srcsperm[0]) {
  1357. if(dz->infilecnt > 2) { // If no of srcs > 2
  1358. nn = srcsperm[0]; // Avoid first component of this perm
  1359. srcsperm[0] = srcsperm[1]; // being same as last component of previous perm
  1360. srcsperm[1] = nn; // (with 2 files, this restraints would force a 01010101010 alternating pattern)
  1361. }
  1362. }
  1363. }
  1364. insnd = srcsperm[srcspermno];
  1365. } else if(dz->vflag[MAD_INRAND])
  1366. insnd = (int)floor(drand48() * dz->infilecnt);
  1367. else
  1368. insnd = srcsperm[srcspermno];
  1369. srcspermno++;
  1370. }
  1371. }
  1372. endtime = time + (double)(dz->insams[insnd])/srate; // Check this event will not overrun duration
  1373. if(endtime >= dz->param[MAD_DUR]) // and if it does, quit
  1374. break;
  1375. fileon[stepcnt] = insnd;
  1376. // SELECT STREAMS THAT ARE ON FOR THIS EVENT
  1377. if(dz->param[MAD_DELF] <= 0) { // If no deletions
  1378. streams_off = 0;
  1379. for(n=0;n<dz->iparam[MAD_STRMS];n++) // Turn on all streams
  1380. onoff[n][stepcnt] = 1;
  1381. } else { // Select number of streams on, at random
  1382. rndintperm(strmperm,dz->iparam[MAD_STRMS]); // Randomly permute order of streams
  1383. // If the delfactor is > 1, bias the random selection
  1384. xs = max(0,((int)round(dz->param[MAD_DELF]) - 1));
  1385. if(xs)
  1386. logxs = (int)(round(LOG2(xs)));
  1387. if(dz->vflag[MAD_GAPS]) {
  1388. streams_off = (int)floor(drand48() * (dz->iparam[MAD_STRMS]+1+(xs*2))); // Range 0 to streamscnt + xs
  1389. if((xs = streams_off - dz->iparam[MAD_STRMS]) > 0) {
  1390. if(xs > logxs)
  1391. streams_off = dz->iparam[MAD_STRMS]; // For delfactor > 1, add bias to NO streams on
  1392. else
  1393. streams_off = dz->iparam[MAD_STRMS] - 1; // and add (less) bias to only 1 stream on
  1394. }
  1395. } else {
  1396. streams_off = (int)floor(drand48() * dz->iparam[MAD_STRMS]+xs); // Range 0 to streamscnt-1 + xs
  1397. if(streams_off >= dz->iparam[MAD_STRMS])
  1398. streams_off = dz->iparam[MAD_STRMS] - 1; // For delfactor > 1, add bias to only 1 stream on
  1399. }
  1400. for(n = 0;n < streams_off;n++) // Mark first "streams_off" streams in strmperm as off
  1401. onoff[strmperm[n]][stepcnt] = 0;
  1402. for(;n < dz->iparam[MAD_STRMS];n++) // Mark remainder as on
  1403. onoff[strmperm[n]][stepcnt] = 1;
  1404. }
  1405. if(streams_off == dz->iparam[MAD_STRMS]) { // If all streams are off, do not move to next insound yet
  1406. srcspermno--;
  1407. eventcnt--;
  1408. }
  1409. // FIND AN INACTIVE POINTER ASSOCIATED WITH EACH ON-STREAM, AND SET IT TO START COUNTING IN THE SPECIFIED insnd BUFFER
  1410. for(n = 0;n<dz->iparam[MAD_STRMS];n++) {
  1411. if(onoff[n][stepcnt]) { // For every stream that is on
  1412. for(m=n; m < ptrcnt; m+= dz->iparam[MAD_STRMS]) { // Find an available buffer-pointer assocd with that stream
  1413. if(ptr[m] < 0 || ptr[m] >= dz->insams[inf[m]]) {
  1414. ptr[m] = 0; // and set it to start counting in an infile
  1415. inf[m] = insnd; // indicating which infile it is pointing to.
  1416. break; // (as events may overlap within a stream, a ptr may still be playing tail of a DIFFERENT sound
  1417. } // when new event starts, so we need to remember which insound a pointer WAS reading from)
  1418. }
  1419. }
  1420. }
  1421. }
  1422. // WRITE TO NEXT SAMPLE IN OUTBUFFER FROM ALL ACTIVE POINTERS
  1423. for(n = 0;n<ptrcnt;n++) { // For every pointer...
  1424. if(ptr[n] >= 0 && ptr[n] < dz->insams[inf[n]]) {// If it is active
  1425. nn = n % dz->iparam[MAD_STRMS]; // Find the associated stream
  1426. // Add contribution to outbuffer, in correct spatial position
  1427. obuf[opos + lmost[nn]] = (float)(obuf[opos + lmost[nn]] + (ibuf[inf[n]][ptr[n]] * llev[nn]));
  1428. obuf[opos + rmost[nn]] = (float)(obuf[opos + rmost[nn]] + (ibuf[inf[n]][ptr[n]] * rlev[nn]));
  1429. // position-nn pointer[n] levels[nn]
  1430. // assocd with output stream is associated with are associated with
  1431. // and corresponds to chans sound inf[n] spatial pos
  1432. // in output buffer which it is reading of output stream
  1433. }
  1434. if(ptr[n] >= 0) // Advance all switched-on ptrs, whether are not they are currently reading a file.
  1435. ptr[n]++; // Once they are beyond file end, they become available to select for next read.
  1436. }
  1437. // ADVANCE IN OUTBUFFER, WRITING OUTPUT IF BUFFER IS FULL
  1438. opos += chans;
  1439. if(opos >= dz->buflen) {
  1440. fprintf(stdout,"INFO: Level Check at %lf secs\n",(double)outcnt/srate);
  1441. fflush(stdout);
  1442. for(n = 0;n < dz->buflen;n++)
  1443. maxsamp = max(maxsamp,fabs(obuf[n]));
  1444. memset((char *)obuf,0,dz->buflen * sizeof(float));
  1445. opos = 0;
  1446. }
  1447. // IF WE'VE JUST STARTED A NEW EVENT, DETERMINE TIME OF NEXT EVENT
  1448. if(outcnt >= inexttime) {
  1449. if(dz->param[MAD_RAND] > 0) {
  1450. nexttime = ((drand48() * 2.0) - 1.0)/2.0; // Range +- 1/2
  1451. nexttime *= dz->param[MAD_RAND]; // Max Range +- 1/2
  1452. nexttime *= dz->param[MAD_STEP]; // Max Range +- 1/2 STEP
  1453. nexttime += dz->param[MAD_STEP]; // Max Range 1/2STEP to 3/2STEP
  1454. nexttime += time;
  1455. } else
  1456. nexttime = time + dz->param[MAD_STEP];
  1457. inexttime = (int)round(nexttime * srate);
  1458. }
  1459. // ADVANCE THE OUTPUT GROUP-SAMPLE COUNTER
  1460. outcnt++;
  1461. }
  1462. // COMPLETE OUTPUT FROM ANY ADVANCING POINTERS
  1463. finished = 0;
  1464. while(!finished) {
  1465. finished = 1;
  1466. for(n = 0;n<ptrcnt;n++) { // For every pointer...
  1467. if(ptr[n] > 0 && ptr[n] < dz->insams[inf[n]]) { // If it is active
  1468. finished = 0; // Flag not yet finished
  1469. break;
  1470. }
  1471. }
  1472. if(finished)
  1473. break;
  1474. for(n = 0;n<ptrcnt;n++) {
  1475. if(ptr[n] > 0 && ptr[n] < dz->insams[inf[n]]) {
  1476. nn = n % dz->iparam[MAD_STRMS];
  1477. obuf[opos + lmost[nn]] = (float)(obuf[opos + lmost[nn]] + (ibuf[inf[n]][ptr[n]] * llev[nn]));
  1478. obuf[opos + rmost[nn]] = (float)(obuf[opos + rmost[nn]] + (ibuf[inf[n]][ptr[n]] * rlev[nn]));
  1479. }
  1480. if(ptr[n] > 0)
  1481. ptr[n]++;
  1482. }
  1483. opos += chans;
  1484. if(opos >= dz->buflen) {
  1485. fprintf(stdout,"INFO: Level Check at %lf secs\n",(double)outcnt/srate);
  1486. fflush(stdout);
  1487. for(n = 0;n < dz->buflen;n++)
  1488. maxsamp = max(maxsamp,fabs(obuf[n]));
  1489. memset((char *)obuf,0,dz->buflen * sizeof(float));
  1490. opos = 0;
  1491. }
  1492. outcnt++;
  1493. }
  1494. if(opos) {
  1495. fprintf(stdout,"INFO: Level Check at %lf secs\n",(double)outcnt/srate);
  1496. fflush(stdout);
  1497. for(n = 0;n < opos;n++)
  1498. maxsamp = max(maxsamp,fabs(obuf[n]));
  1499. }
  1500. dz->tempsize = outcnt * chans; /* For sloom progress bar */
  1501. normaliser = 1.0;
  1502. if(maxsamp > 0.95) {
  1503. normaliser = 0.95/maxsamp;
  1504. fprintf(stdout,"INFO: Normalising by %lf secs\n",(double)normaliser);
  1505. fflush(stdout);
  1506. }
  1507. for(n=0;n<ptrcnt;n++) {
  1508. ptr[n] = -1;
  1509. inf[n] = 0;
  1510. }
  1511. nexttime = 0.0;
  1512. inexttime = 0;
  1513. stepcnt = -1;
  1514. opos = 0;
  1515. outcnt = 0;
  1516. fprintf(stdout,"INFO: Second pass: generating output.\n");
  1517. fflush(stdout);
  1518. memset((char *)obuf,0,dz->buflen * sizeof(float));
  1519. while(outcnt < dz->iparam[MAD_DUR]) {
  1520. if(outcnt >= inexttime) {
  1521. // GO TO NEXT STEP VALUES, CHECKING WE'RE NOT AT OUTPUT END
  1522. stepcnt++;
  1523. time = (double)inexttime/srate;
  1524. if(time >= dz->param[MAD_DUR])
  1525. break;
  1526. insnd = fileon[stepcnt];
  1527. endtime = time + (double)(dz->insams[insnd])/srate;
  1528. if(endtime >= dz->param[MAD_DUR])
  1529. break;
  1530. // FIND AN INACTIVE POINTER ASSOCIATED WITH EACH ON-STREAM, AND SET IT TO START COUNTING IN THE SPECIFIED insnd BUFFER
  1531. for(n = 0;n<dz->iparam[MAD_STRMS];n++) {
  1532. if(onoff[n][stepcnt]) { // For every stream that is on
  1533. for(m=n; m < ptrcnt; m+= dz->iparam[MAD_STRMS]) { // Find an available buffer-pointer assocd with that stream
  1534. if(ptr[m] < 0 || ptr[m] >= dz->insams[inf[m]]) {
  1535. ptr[m] = 0; // and set it to start counting in an infile
  1536. inf[m] = insnd; // indicating which infile it is pointing to.
  1537. break; // (as events may overlap within a stream, a ptr may still be playing tail of a DIFFERENT sound
  1538. } // when new event starts, so we need to remember which insound a pointer WAS reading from)
  1539. }
  1540. }
  1541. }
  1542. }
  1543. // WRITE TO NEXT SAMPLE IN OUTBUFFER FROM ALL ACTIVE POINTERS
  1544. for(n = 0;n<ptrcnt;n++) { // For every pointer...
  1545. if(ptr[n] >= 0 && ptr[n] < dz->insams[inf[n]]) { // If it is active
  1546. nn = n % dz->iparam[MAD_STRMS]; // Find the associated stream
  1547. // Add contribution to outbuffer, in correct spatial position
  1548. obuf[opos + lmost[nn]] = (float)(obuf[opos + lmost[nn]] + (ibuf[inf[n]][ptr[n]] * llev[nn]));
  1549. obuf[opos + rmost[nn]] = (float)(obuf[opos + rmost[nn]] + (ibuf[inf[n]][ptr[n]] * rlev[nn]));
  1550. // position-nn pointer[n] levels[nn]
  1551. // assocd with output stream is associated with are associated with
  1552. // and corresponds to chans sound inf[n] spatial pos
  1553. // in output buffer which it is reading of output stream
  1554. }
  1555. if(ptr[n] >= 0) // Advance all switched-on ptrs, whether are not they are currently reading a file.
  1556. ptr[n]++; // Once they are beyond file end, they become available to select for next read.
  1557. }
  1558. // ADVANCE IN OUTBUFFER, WRITING OUTPUT IF BUFFER IS FULL
  1559. opos += chans;
  1560. if(opos >= dz->buflen) {
  1561. if(normaliser < 1.0) {
  1562. for(n = 0;n<dz->buflen;n++)
  1563. obuf[n] = (float)(obuf[n] * normaliser);
  1564. }
  1565. if((exit_status = write_samps(obuf,dz->buflen,dz))<0)
  1566. return(exit_status);
  1567. memset((char *)obuf,0,dz->buflen * sizeof(float));
  1568. opos = 0;
  1569. }
  1570. // IF WE'VE JUST STARTED A NEW EVENT, DETERMINE TIME OF NEXT EVENT
  1571. if(outcnt >= inexttime)
  1572. inexttime = itime[stepcnt];
  1573. // ADVANCE THE OUTPUT GROUP-SAMPLE COUNTER
  1574. outcnt++;
  1575. }
  1576. finished = 0;
  1577. while(!finished) {
  1578. finished = 1;
  1579. for(n = 0;n<ptrcnt;n++) { // For every pointer...
  1580. if(ptr[n] > 0 && ptr[n] < dz->insams[inf[n]]) { // If it is active
  1581. finished = 0; // Flag not yet finished
  1582. break;
  1583. }
  1584. }
  1585. if(finished)
  1586. break;
  1587. for(n = 0;n<ptrcnt;n++) {
  1588. if(ptr[n] > 0 && ptr[n] < dz->insams[inf[n]]) {
  1589. nn = n % dz->iparam[MAD_STRMS];
  1590. obuf[opos + lmost[nn]] = (float)(obuf[opos + lmost[nn]] + (ibuf[inf[n]][ptr[n]] * llev[nn]));
  1591. obuf[opos + rmost[nn]] = (float)(obuf[opos + rmost[nn]] + (ibuf[inf[n]][ptr[n]] * rlev[nn]));
  1592. }
  1593. if(ptr[n] > 0)
  1594. ptr[n]++;
  1595. }
  1596. opos += chans;
  1597. if(opos >= dz->buflen) {
  1598. if((exit_status = write_samps(obuf,dz->buflen,dz))<0)
  1599. return(exit_status);
  1600. memset((char *)obuf,0,dz->buflen * sizeof(float));
  1601. opos = 0;
  1602. }
  1603. outcnt++;
  1604. }
  1605. if(opos) {
  1606. if(normaliser < 1.0) {
  1607. for(n = 0;n<dz->buflen;n++)
  1608. obuf[n] = (float)(obuf[n] * normaliser);
  1609. }
  1610. if((exit_status = write_samps(obuf,opos,dz))<0)
  1611. return(exit_status);
  1612. }
  1613. return FINISHED;
  1614. }
  1615. /**************************** CREATE_MADRID_SNDBUFS ****************************/
  1616. int create_madrid_sndbufs(dataptr dz)
  1617. {
  1618. int n, safety = 4;
  1619. unsigned int lastbigbufsize, bigbufsize = 0;
  1620. float *bottom;
  1621. dz->bufcnt = dz->infilecnt+1;
  1622. if((dz->sampbuf = (float **)malloc(sizeof(float *) * (dz->bufcnt+1)))==NULL) {
  1623. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffers.\n");
  1624. return(MEMORY_ERROR);
  1625. }
  1626. if((dz->sbufptr = (float **)malloc(sizeof(float *) * dz->bufcnt))==NULL) {
  1627. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffer pointers.\n");
  1628. return(MEMORY_ERROR);
  1629. }
  1630. lastbigbufsize = 0;
  1631. bigbufsize = 0;
  1632. for(n=0;n<dz->infilecnt;n++) {
  1633. bigbufsize += (dz->insams[n] + safety) * sizeof(float);
  1634. if(bigbufsize < lastbigbufsize) {
  1635. sprintf(errstr,"Insufficient memory to store the input soundfiles in buffers.\n");
  1636. return(MEMORY_ERROR);
  1637. }
  1638. lastbigbufsize = bigbufsize;
  1639. }
  1640. dz->buflen = NTEX_OBUFSIZE * dz->iparam[MAD_CHANS];
  1641. bigbufsize += (dz->buflen + (safety * dz->iparam[MAD_CHANS])) * sizeof(float);
  1642. if(bigbufsize < lastbigbufsize) {
  1643. sprintf(errstr,"Insufficient memory to store the input soundfiles in buffers.\n");
  1644. return(MEMORY_ERROR);
  1645. }
  1646. if((dz->bigbuf = (float *)malloc(bigbufsize)) == NULL) {
  1647. sprintf(errstr,"INSUFFICIENT MEMORY to create sound buffers.\n");
  1648. return(PROGRAM_ERROR);
  1649. }
  1650. bottom = dz->bigbuf;
  1651. for(n = 0;n<dz->infilecnt;n++) {
  1652. dz->sbufptr[n] = dz->sampbuf[n] = bottom;
  1653. bottom += dz->insams[n] + safety;
  1654. }
  1655. dz->sbufptr[n] = dz->sampbuf[n] = bottom;
  1656. return(FINISHED);
  1657. }
  1658. /*********************** RNDINTPERM ************************/
  1659. void rndintperm(int *perm,int cnt)
  1660. {
  1661. int n,t,k;
  1662. memset((char *)perm,0,cnt * sizeof(int));
  1663. for(n=0;n<cnt+1;n++) {
  1664. t = (int)(drand48() * (double)(n+1)); /* TRUNCATE */
  1665. if(t==n) {
  1666. for(k=n;k>0;k--)
  1667. perm[k] = perm[k-1];
  1668. perm[0] = n;
  1669. } else {
  1670. for(k=n;k>t;k--)
  1671. perm[k] = perm[k-1];
  1672. perm[t] = n;
  1673. }
  1674. }
  1675. for(n=0;n<cnt;n++)
  1676. perm[n]--;
  1677. }
  1678. /************************************ PANCALC *******************************/
  1679. void pancalc(double position,double *leftgain,double *rightgain)
  1680. {
  1681. int dirflag;
  1682. double temp;
  1683. double relpos;
  1684. double reldist, invsquare;
  1685. if(position < 0.0)
  1686. dirflag = SIGNAL_TO_LEFT; /* signal on left */
  1687. else
  1688. dirflag = SIGNAL_TO_RIGHT;
  1689. if(position < 0)
  1690. relpos = -position;
  1691. else
  1692. relpos = position;
  1693. if(relpos <= 1.0){ /* between the speakers */
  1694. temp = 1.0 + (relpos * relpos);
  1695. reldist = ROOT2 / sqrt(temp);
  1696. temp = (position + 1.0) / 2.0;
  1697. *rightgain = temp * reldist;
  1698. *leftgain = (1.0 - temp ) * reldist;
  1699. } else { /* outside the speakers */
  1700. temp = (relpos * relpos) + 1.0;
  1701. reldist = sqrt(temp) / ROOT2; /* relative distance to source */
  1702. invsquare = 1.0 / (reldist * reldist);
  1703. if(dirflag == SIGNAL_TO_LEFT){
  1704. *leftgain = invsquare;
  1705. *rightgain = 0.0;
  1706. } else { /* SIGNAL_TO_RIGHT */
  1707. *rightgain = invsquare;
  1708. *leftgain = 0;
  1709. }
  1710. }
  1711. }
  1712. /**************************** CHECK_MADRID_PARAM_VALIDITY_AND_CONSISTENCY *****************************/
  1713. int check_madrid_param_validity_and_consistency(dataptr dz)
  1714. {
  1715. if(dz->mode == 0) {
  1716. if(dz->vflag[MAD_INPERM] && dz->vflag[MAD_INRAND]) {
  1717. sprintf(errstr,"You cannot set both the random permutation (-r), and the random selection (-R) flag.\n");
  1718. return(DATA_ERROR);
  1719. }
  1720. }
  1721. return FINISHED;
  1722. }
  1723. /****************************** GET_THE_MODE_FROM_CMDLINE *********************************/
  1724. int get_the_mode_from_cmdline(char *str,dataptr dz)
  1725. {
  1726. char temp[200], *p;
  1727. if(sscanf(str,"%s",temp)!=1) {
  1728. fprintf(stderr,"Cannot read mode of program.\n");
  1729. return(USAGE_ONLY);
  1730. }
  1731. p = temp + strlen(temp) - 1;
  1732. while(p >= temp) {
  1733. if(!isdigit(*p)) {
  1734. fprintf(stderr,"Invalid mode of program entered.\n");
  1735. return(USAGE_ONLY);
  1736. }
  1737. p--;
  1738. }
  1739. if(sscanf(str,"%d",&dz->mode)!=1) {
  1740. fprintf(stderr,"Cannot read mode of program.\n");
  1741. return(USAGE_ONLY);
  1742. }
  1743. if(dz->mode <= 0 || dz->mode > dz->maxmode) {
  1744. fprintf(stderr,"Program mode value [%d] is out of range [1 - %d].\n",dz->mode,dz->maxmode);
  1745. return(USAGE_ONLY);
  1746. }
  1747. dz->mode--; /* CHANGE TO INTERNAL REPRESENTATION OF MODE NO */
  1748. return(FINISHED);
  1749. }
  1750. /**************************** HANDLE_THE_SPECIAL_DATA ****************************/
  1751. int handle_the_special_data(char *str,dataptr dz)
  1752. {
  1753. int *evseq = dz->iparray[6 + dz->iparam[MAD_STRMS]], warned = 0, totalindatacnt, eventcnt, OK;
  1754. FILE *fp;
  1755. double dummy;
  1756. int seqcnt, idummy;
  1757. char temp[200], *p;
  1758. if((fp = fopen(str,"r"))==NULL) {
  1759. sprintf(errstr,"Cannot open file %s to read sequence data.\n",str);
  1760. return(DATA_ERROR);
  1761. }
  1762. totalindatacnt = 0;
  1763. while(fgets(temp,200,fp)!=NULL) {
  1764. p = temp;
  1765. while(isspace(*p))
  1766. p++;
  1767. if(*p == ';' || *p == ENDOFSTR) // Allow comments in file
  1768. continue;
  1769. while(get_float_from_within_string(&p,&dummy)) {
  1770. idummy = (int)round(dummy);
  1771. if(idummy < 1) {
  1772. sprintf(errstr,"Found sequence value %d in file %s: Sequence values must be >= 1\n",idummy,str);
  1773. return(DATA_ERROR);
  1774. } else if(idummy > dz->infilecnt) {
  1775. if(!warned) {
  1776. fprintf(stdout,"WARNING: Found sequence value(s) %d outside the range 1 to %d: These will be wrapped into range.\n",idummy,dz->infilecnt);
  1777. fflush(stdout);
  1778. warned = 1;
  1779. }
  1780. }
  1781. totalindatacnt++;
  1782. }
  1783. }
  1784. fseek(fp,0,0);
  1785. seqcnt = 0;
  1786. eventcnt = 0;
  1787. OK = 1;
  1788. while(fgets(temp,200,fp)!=NULL) {
  1789. p = temp;
  1790. while(isspace(*p))
  1791. p++;
  1792. if(*p == ';' || *p == ENDOFSTR) // Allow comments in file
  1793. continue;
  1794. while(get_float_from_within_string(&p,&dummy)) {
  1795. idummy = (int)round(dummy);
  1796. idummy--;
  1797. idummy %= dz->infilecnt;
  1798. seqcnt++;
  1799. evseq[eventcnt++] = idummy;
  1800. if(eventcnt >= dz->itemcnt) { // If more data than spaces for events
  1801. OK = 0; // Quit
  1802. break;
  1803. }
  1804. }
  1805. if(!OK)
  1806. break;
  1807. }
  1808. fclose(fp);
  1809. if(totalindatacnt > dz->itemcnt) {
  1810. fprintf(stdout,"INFO: Not all of sequence in file %s will be used.\n",str);
  1811. fflush(stdout);
  1812. }
  1813. while(eventcnt < dz->itemcnt) { // If length of sequence indata is less than number of events
  1814. evseq[eventcnt] = evseq[eventcnt % seqcnt]; // Duplicate sequence through all possible events
  1815. eventcnt++;
  1816. }
  1817. return FINISHED;
  1818. }