ceracu.c 68 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765
  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. #include <stdio.h>
  22. #include <stdlib.h>
  23. #include <structures.h>
  24. #include <tkglobals.h>
  25. #include <pnames.h>
  26. #include <filetype.h>
  27. #include <processno.h>
  28. #include <modeno.h>
  29. #include <logic.h>
  30. #include <globcon.h>
  31. #include <cdpmain.h>
  32. #include <math.h>
  33. #include <mixxcon.h>
  34. #include <osbind.h>
  35. #include <standalone.h>
  36. #include <ctype.h>
  37. #include <sfsys.h>
  38. #include <string.h>
  39. #include <srates.h>
  40. #define SIGNAL_TO_LEFT (0)
  41. #define SIGNAL_TO_RIGHT (1)
  42. #define ROOT2 (1.4142136)
  43. #define dupl descriptor_samps
  44. #ifdef unix
  45. #define round(x) lround((x))
  46. #endif
  47. char errstr[2400];
  48. int anal_infiles = 1;
  49. int sloom = 0;
  50. int sloombatch = 0;
  51. const char* cdp_version = "7.1.0";
  52. //CDP LIB REPLACEMENTS
  53. static int setup_ceracu_application(dataptr dz);
  54. static int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz);
  55. static int parse_infile_and_check_type(char **cmdline,dataptr dz);
  56. static int setup_ceracu_param_ranges_and_defaults(dataptr dz);
  57. static int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz);
  58. static int open_the_outfile(dataptr dz);
  59. static int setup_and_init_input_param_activity(dataptr dz,int tipc);
  60. static int setup_input_param_defaultval_stores(int tipc,aplptr ap);
  61. static int establish_application(dataptr dz);
  62. static int initialise_vflags(dataptr dz);
  63. static int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz);
  64. static int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz);
  65. static int mark_parameter_types(dataptr dz,aplptr ap);
  66. static int assign_file_data_storage(int infilecnt,dataptr dz);
  67. static int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q);
  68. static int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz);
  69. static int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt);
  70. static int handle_the_special_data(char *str,dataptr dz);
  71. static int create_ceracu_sndbufs(dataptr dz);
  72. static int ceracu(dataptr dz);
  73. static void pancalc(double position,double *leftgain,double *rightgain);
  74. static int get_lcm(int arraycnt,int *lcm,dataptr dz);
  75. static int ceracu_param_preprocess(dataptr dz);
  76. /**************************************** MAIN *********************************************/
  77. int main(int argc,char *argv[])
  78. {
  79. int exit_status;
  80. dataptr dz = NULL;
  81. char **cmdline;
  82. int cmdlinecnt;
  83. //aplptr ap;
  84. int is_launched = FALSE;
  85. if(argc==2 && (strcmp(argv[1],"--version") == 0)) {
  86. fprintf(stdout,"%s\n",cdp_version);
  87. fflush(stdout);
  88. return 0;
  89. }
  90. /* CHECK FOR SOUNDLOOM */
  91. if((sloom = sound_loom_in_use(&argc,&argv)) > 1) {
  92. sloom = 0;
  93. sloombatch = 1;
  94. }
  95. if(sflinit("cdp")){
  96. sfperror("cdp: initialisation\n");
  97. return(FAILED);
  98. }
  99. /* SET UP THE PRINCIPLE DATASTRUCTURE */
  100. if((exit_status = establish_datastructure(&dz))<0) { // CDP LIB
  101. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  102. return(FAILED);
  103. }
  104. if(!sloom) {
  105. if(argc == 1) {
  106. usage1();
  107. return(FAILED);
  108. } else if(argc == 2) {
  109. usage2(argv[1]);
  110. return(FAILED);
  111. }
  112. }
  113. if(!sloom) {
  114. if((exit_status = make_initial_cmdline_check(&argc,&argv))<0) { // CDP LIB
  115. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  116. return(FAILED);
  117. }
  118. cmdline = argv;
  119. cmdlinecnt = argc;
  120. if((get_the_process_no(argv[0],dz))<0)
  121. return(FAILED);
  122. cmdline++;
  123. cmdlinecnt--;
  124. dz->maxmode = 0;
  125. // if((exit_status = get_the_mode_from_cmdline(cmdline[0],dz))<0) {
  126. // print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  127. // return(exit_status);
  128. // }
  129. // cmdline++;
  130. // cmdlinecnt--;
  131. // setup_particular_application =
  132. if((exit_status = setup_ceracu_application(dz))<0) {
  133. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  134. return(FAILED);
  135. }
  136. if((exit_status = count_and_allocate_for_infiles(cmdlinecnt,cmdline,dz))<0) { // CDP LIB
  137. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  138. return(FAILED);
  139. }
  140. } else {
  141. //parse_TK_data() =
  142. if((exit_status = parse_sloom_data(argc,argv,&cmdline,&cmdlinecnt,dz))<0) {
  143. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  144. return(exit_status);
  145. }
  146. }
  147. //ap = dz->application;
  148. // parse_infile_and_hone_type() =
  149. if((exit_status = parse_infile_and_check_type(cmdline,dz))<0) {
  150. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  151. return(FAILED);
  152. }
  153. // setup_param_ranges_and_defaults() =
  154. if((exit_status = setup_ceracu_param_ranges_and_defaults(dz))<0) {
  155. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  156. return(FAILED);
  157. }
  158. // open_first_infile CDP LIB
  159. if((exit_status = open_first_infile(cmdline[0],dz))<0) {
  160. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  161. return(FAILED);
  162. }
  163. cmdlinecnt--;
  164. cmdline++;
  165. // handle_extra_infiles() : redundant
  166. // handle_outfile() =
  167. if((exit_status = handle_the_outfile(&cmdlinecnt,&cmdline,dz))<0) {
  168. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  169. return(FAILED);
  170. }
  171. // handle_formants() redundant
  172. // handle_formant_quiksearch() redundant
  173. if((exit_status = handle_the_special_data(cmdline[0],dz))<0) {
  174. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  175. return(FAILED);
  176. }
  177. cmdlinecnt--;
  178. cmdline++;
  179. if((exit_status = read_parameters_and_flags(&cmdline,&cmdlinecnt,dz))<0) { // CDP LIB
  180. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  181. return(FAILED);
  182. }
  183. if((exit_status = open_the_outfile(dz))<0) {
  184. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  185. return(FAILED);
  186. }
  187. // check_param_validity_and_consistency() redundant
  188. is_launched = TRUE;
  189. if((exit_status = create_ceracu_sndbufs(dz))<0) {
  190. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  191. return(FAILED);
  192. }
  193. if((exit_status = ceracu_param_preprocess(dz))<0) {
  194. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  195. return(FAILED);
  196. }
  197. //spec_process_file =
  198. if((exit_status = ceracu(dz))<0) {
  199. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  200. return(FAILED);
  201. }
  202. if((exit_status = complete_output(dz))<0) { // CDP LIB
  203. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  204. return(FAILED);
  205. }
  206. exit_status = print_messages_and_close_sndfiles(FINISHED,is_launched,dz); // CDP LIB
  207. free(dz);
  208. return(SUCCEEDED);
  209. }
  210. /**********************************************
  211. REPLACED CDP LIB FUNCTIONS
  212. **********************************************/
  213. /****************************** SET_PARAM_DATA *********************************/
  214. int set_param_data(aplptr ap, int special_data,int maxparamcnt,int paramcnt,char *paramlist)
  215. {
  216. ap->special_data = (char)special_data;
  217. ap->param_cnt = (char)paramcnt;
  218. ap->max_param_cnt = (char)maxparamcnt;
  219. if(ap->max_param_cnt>0) {
  220. if((ap->param_list = (char *)malloc((size_t)(ap->max_param_cnt+1)))==NULL) {
  221. sprintf(errstr,"INSUFFICIENT MEMORY: for param_list\n");
  222. return(MEMORY_ERROR);
  223. }
  224. strcpy(ap->param_list,paramlist);
  225. }
  226. return(FINISHED);
  227. }
  228. /****************************** SET_VFLGS *********************************/
  229. int set_vflgs
  230. (aplptr ap,char *optflags,int optcnt,char *optlist,char *varflags,int vflagcnt, int vparamcnt,char *varlist)
  231. {
  232. ap->option_cnt = (char) optcnt; /*RWD added cast */
  233. if(optcnt) {
  234. if((ap->option_list = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  235. sprintf(errstr,"INSUFFICIENT MEMORY: for option_list\n");
  236. return(MEMORY_ERROR);
  237. }
  238. strcpy(ap->option_list,optlist);
  239. if((ap->option_flags = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  240. sprintf(errstr,"INSUFFICIENT MEMORY: for option_flags\n");
  241. return(MEMORY_ERROR);
  242. }
  243. strcpy(ap->option_flags,optflags);
  244. }
  245. ap->vflag_cnt = (char) vflagcnt;
  246. ap->variant_param_cnt = (char) vparamcnt;
  247. if(vflagcnt) {
  248. if((ap->variant_list = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  249. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_list\n");
  250. return(MEMORY_ERROR);
  251. }
  252. strcpy(ap->variant_list,varlist);
  253. if((ap->variant_flags = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  254. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_flags\n");
  255. return(MEMORY_ERROR);
  256. }
  257. strcpy(ap->variant_flags,varflags);
  258. }
  259. return(FINISHED);
  260. }
  261. /***************************** APPLICATION_INIT **************************/
  262. int application_init(dataptr dz)
  263. {
  264. int exit_status;
  265. int storage_cnt;
  266. int tipc, brkcnt;
  267. aplptr ap = dz->application;
  268. if(ap->vflag_cnt>0)
  269. initialise_vflags(dz);
  270. tipc = ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt;
  271. ap->total_input_param_cnt = (char)tipc;
  272. if(tipc>0) {
  273. if((exit_status = setup_input_param_range_stores(tipc,ap))<0)
  274. return(exit_status);
  275. if((exit_status = setup_input_param_defaultval_stores(tipc,ap))<0)
  276. return(exit_status);
  277. if((exit_status = setup_and_init_input_param_activity(dz,tipc))<0)
  278. return(exit_status);
  279. }
  280. brkcnt = tipc;
  281. //THERE ARE NO INPUTFILE brktables USED IN THIS PROCESS
  282. if(brkcnt>0) {
  283. if((exit_status = setup_and_init_input_brktable_constants(dz,brkcnt))<0)
  284. return(exit_status);
  285. }
  286. if((storage_cnt = tipc + ap->internal_param_cnt)>0) {
  287. if((exit_status = setup_parameter_storage_and_constants(storage_cnt,dz))<0)
  288. return(exit_status);
  289. if((exit_status = initialise_is_int_and_no_brk_constants(storage_cnt,dz))<0)
  290. return(exit_status);
  291. }
  292. if((exit_status = mark_parameter_types(dz,ap))<0)
  293. return(exit_status);
  294. // establish_infile_constants() replaced by
  295. dz->infilecnt = 1;
  296. //establish_bufptrs_and_extra_buffers():
  297. return(FINISHED);
  298. }
  299. /********************** SETUP_PARAMETER_STORAGE_AND_CONSTANTS ********************/
  300. /* RWD mallo changed to calloc; helps debug verison run as release! */
  301. int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz)
  302. {
  303. if((dz->param = (double *)calloc(storage_cnt, sizeof(double)))==NULL) {
  304. sprintf(errstr,"setup_parameter_storage_and_constants(): 1\n");
  305. return(MEMORY_ERROR);
  306. }
  307. if((dz->iparam = (int *)calloc(storage_cnt, sizeof(int) ))==NULL) {
  308. sprintf(errstr,"setup_parameter_storage_and_constants(): 2\n");
  309. return(MEMORY_ERROR);
  310. }
  311. if((dz->is_int = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  312. sprintf(errstr,"setup_parameter_storage_and_constants(): 3\n");
  313. return(MEMORY_ERROR);
  314. }
  315. if((dz->no_brk = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  316. sprintf(errstr,"setup_parameter_storage_and_constants(): 5\n");
  317. return(MEMORY_ERROR);
  318. }
  319. return(FINISHED);
  320. }
  321. /************** INITIALISE_IS_INT_AND_NO_BRK_CONSTANTS *****************/
  322. int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz)
  323. {
  324. int n;
  325. for(n=0;n<storage_cnt;n++) {
  326. dz->is_int[n] = (char)0;
  327. dz->no_brk[n] = (char)0;
  328. }
  329. return(FINISHED);
  330. }
  331. /***************************** MARK_PARAMETER_TYPES **************************/
  332. int mark_parameter_types(dataptr dz,aplptr ap)
  333. {
  334. int n, m; /* PARAMS */
  335. for(n=0;n<ap->max_param_cnt;n++) {
  336. switch(ap->param_list[n]) {
  337. case('0'): break; /* dz->is_active[n] = 0 is default */
  338. case('i'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1;dz->no_brk[n] = (char)1; break;
  339. case('I'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1; break;
  340. case('d'): dz->is_active[n] = (char)1; dz->no_brk[n] = (char)1; break;
  341. case('D'): dz->is_active[n] = (char)1; /* normal case: double val or brkpnt file */ break;
  342. default:
  343. sprintf(errstr,"Programming error: invalid parameter type in mark_parameter_types()\n");
  344. return(PROGRAM_ERROR);
  345. }
  346. } /* OPTIONS */
  347. for(n=0,m=ap->max_param_cnt;n<ap->option_cnt;n++,m++) {
  348. switch(ap->option_list[n]) {
  349. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  350. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  351. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  352. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  353. default:
  354. sprintf(errstr,"Programming error: invalid option type in mark_parameter_types()\n");
  355. return(PROGRAM_ERROR);
  356. }
  357. } /* VARIANTS */
  358. for(n=0,m=ap->max_param_cnt + ap->option_cnt;n < ap->variant_param_cnt; n++, m++) {
  359. switch(ap->variant_list[n]) {
  360. case('0'): break;
  361. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  362. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  363. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  364. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  365. default:
  366. sprintf(errstr,"Programming error: invalid variant type in mark_parameter_types()\n");
  367. return(PROGRAM_ERROR);
  368. }
  369. } /* INTERNAL */
  370. for(n=0,
  371. m=ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt; n<ap->internal_param_cnt; n++,m++) {
  372. switch(ap->internal_param_list[n]) {
  373. case('0'): break; /* dummy variables: variables not used: but important for internal paream numbering!! */
  374. case('i'): dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  375. case('d'): dz->no_brk[m] = (char)1; break;
  376. default:
  377. sprintf(errstr,"Programming error: invalid internal param type in mark_parameter_types()\n");
  378. return(PROGRAM_ERROR);
  379. }
  380. }
  381. return(FINISHED);
  382. }
  383. /************************ HANDLE_THE_OUTFILE *********************/
  384. int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz)
  385. {
  386. char *filename = (*cmdline)[0], *p;
  387. if(filename[0]=='-' && filename[1]=='f') {
  388. dz->floatsam_output = 1;
  389. dz->true_outfile_stype = SAMP_FLOAT;
  390. filename+= 2;
  391. }
  392. if(!sloom) {
  393. if(file_has_invalid_startchar(filename) || value_is_numeric(filename)) {
  394. sprintf(errstr,"Outfile name %s has invalid start character(s) or looks too much like a number.\n",filename);
  395. return(DATA_ERROR);
  396. }
  397. }
  398. p = filename; // Drop file extension
  399. while(*p != ENDOFSTR) {
  400. if(*p == '.') {
  401. *p = ENDOFSTR;
  402. break;
  403. }
  404. p++;
  405. }
  406. strcpy(dz->outfilename,filename);
  407. (*cmdline)++;
  408. (*cmdlinecnt)--;
  409. return(FINISHED);
  410. }
  411. /***************************** ESTABLISH_APPLICATION **************************/
  412. int establish_application(dataptr dz)
  413. {
  414. aplptr ap;
  415. if((dz->application = (aplptr)malloc(sizeof (struct applic)))==NULL) {
  416. sprintf(errstr,"establish_application()\n");
  417. return(MEMORY_ERROR);
  418. }
  419. ap = dz->application;
  420. memset((char *)ap,0,sizeof(struct applic));
  421. return(FINISHED);
  422. }
  423. /************************* INITIALISE_VFLAGS *************************/
  424. int initialise_vflags(dataptr dz)
  425. {
  426. int n;
  427. if((dz->vflag = (char *)malloc(dz->application->vflag_cnt * sizeof(char)))==NULL) {
  428. sprintf(errstr,"INSUFFICIENT MEMORY: vflag store,\n");
  429. return(MEMORY_ERROR);
  430. }
  431. for(n=0;n<dz->application->vflag_cnt;n++)
  432. dz->vflag[n] = FALSE;
  433. return FINISHED;
  434. }
  435. /************************* SETUP_INPUT_PARAM_DEFAULTVALS *************************/
  436. int setup_input_param_defaultval_stores(int tipc,aplptr ap)
  437. {
  438. int n;
  439. if((ap->default_val = (double *)malloc(tipc * sizeof(double)))==NULL) {
  440. sprintf(errstr,"INSUFFICIENT MEMORY for application default values store\n");
  441. return(MEMORY_ERROR);
  442. }
  443. for(n=0;n<tipc;n++)
  444. ap->default_val[n] = 0.0;
  445. return(FINISHED);
  446. }
  447. /***************************** SETUP_AND_INIT_INPUT_PARAM_ACTIVITY **************************/
  448. int setup_and_init_input_param_activity(dataptr dz,int tipc)
  449. {
  450. int n;
  451. if((dz->is_active = (char *)malloc((size_t)tipc))==NULL) {
  452. sprintf(errstr,"setup_and_init_input_param_activity()\n");
  453. return(MEMORY_ERROR);
  454. }
  455. for(n=0;n<tipc;n++)
  456. dz->is_active[n] = (char)0;
  457. return(FINISHED);
  458. }
  459. /************************* SETUP_CERACU_APPLICATION *******************/
  460. int setup_ceracu_application(dataptr dz)
  461. {
  462. int exit_status;
  463. aplptr ap;
  464. if((exit_status = establish_application(dz))<0) // GLOBAL
  465. return(FAILED);
  466. ap = dz->application;
  467. // SEE parstruct FOR EXPLANATION of next 2 functions
  468. if((exit_status = set_param_data(ap,CYCLECNTS,5,5,"diddi"))<0)
  469. return(FAILED);
  470. if((exit_status = set_vflgs(ap,"",0,"","ol",2,0,"00"))<0)
  471. return(FAILED);
  472. // set_legal_infile_structure -->
  473. dz->has_otherfile = FALSE;
  474. // assign_process_logic -->
  475. dz->input_data_type = SNDFILES_ONLY;
  476. dz->process_type = UNEQUAL_SNDFILE;
  477. dz->outfiletype = SNDFILE_OUT;
  478. return application_init(dz); //GLOBAL
  479. }
  480. /************************* PARSE_INFILE_AND_CHECK_TYPE *******************/
  481. int parse_infile_and_check_type(char **cmdline,dataptr dz)
  482. {
  483. int exit_status;
  484. infileptr infile_info;
  485. if(!sloom) {
  486. if((infile_info = (infileptr)malloc(sizeof(struct filedata)))==NULL) {
  487. sprintf(errstr,"INSUFFICIENT MEMORY for infile structure to test file data.");
  488. return(MEMORY_ERROR);
  489. } else if((exit_status = cdparse(cmdline[0],infile_info))<0) {
  490. sprintf(errstr,"Failed to parse input file %s\n",cmdline[0]);
  491. return(PROGRAM_ERROR);
  492. } else if(infile_info->filetype != SNDFILE) {
  493. sprintf(errstr,"File %s is not of correct type\n",cmdline[0]);
  494. return(DATA_ERROR);
  495. } else if(infile_info->channels != 1) {
  496. sprintf(errstr,"File %s is not of correct type (must be mono)\n",cmdline[0]);
  497. return(DATA_ERROR);
  498. } else if((exit_status = copy_parse_info_to_main_structure(infile_info,dz))<0) {
  499. sprintf(errstr,"Failed to copy file parsing information\n");
  500. return(PROGRAM_ERROR);
  501. }
  502. free(infile_info);
  503. }
  504. return(FINISHED);
  505. }
  506. /************************* SETUP_CERACU_PARAM_RANGES_AND_DEFAULTS *******************/
  507. int setup_ceracu_param_ranges_and_defaults(dataptr dz)
  508. {
  509. int exit_status;
  510. aplptr ap = dz->application;
  511. // set_param_ranges()
  512. ap->total_input_param_cnt = (char)(ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt);
  513. // NB total_input_param_cnt is > 0 !!!
  514. if((exit_status = setup_input_param_range_stores(ap->total_input_param_cnt,ap))<0)
  515. return(FAILED);
  516. // get_param_ranges()
  517. ap->lo[CER_MINDUR] = 0.0;
  518. ap->hi[CER_MINDUR] = dz->duration * 32;
  519. ap->default_val[CER_MINDUR] = dz->duration;
  520. ap->lo[CER_OCHANS] = 1;
  521. ap->hi[CER_OCHANS] = 16;
  522. ap->default_val[CER_OCHANS] = 8;
  523. ap->lo[CER_CUTOFF] = 0.0;
  524. ap->hi[CER_CUTOFF] = 3600;
  525. ap->default_val[CER_CUTOFF] = 60;
  526. ap->lo[CER_DELAY] = 0.0;
  527. ap->hi[CER_DELAY] = dz->duration * 16;
  528. ap->default_val[CER_DELAY] = 0;
  529. ap->lo[CER_DSTEP] = -16;
  530. ap->hi[CER_DSTEP] = 16;
  531. ap->default_val[CER_DSTEP] = 1;
  532. dz->maxmode = 0;
  533. if(!sloom)
  534. put_default_vals_in_all_params(dz);
  535. return(FINISHED);
  536. }
  537. /********************************* PARSE_SLOOM_DATA *********************************/
  538. int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz)
  539. {
  540. int exit_status;
  541. int cnt = 1, infilecnt;
  542. int filesize, insams, inbrksize;
  543. double dummy;
  544. int true_cnt = 0;
  545. //aplptr ap;
  546. while(cnt<=PRE_CMDLINE_DATACNT) {
  547. if(cnt > argc) {
  548. sprintf(errstr,"Insufficient data sent from TK\n");
  549. return(DATA_ERROR);
  550. }
  551. switch(cnt) {
  552. case(1):
  553. if(sscanf(argv[cnt],"%d",&dz->process)!=1) {
  554. sprintf(errstr,"Cannot read process no. sent from TK\n");
  555. return(DATA_ERROR);
  556. }
  557. break;
  558. case(2):
  559. if(sscanf(argv[cnt],"%d",&dz->mode)!=1) {
  560. sprintf(errstr,"Cannot read mode no. sent from TK\n");
  561. return(DATA_ERROR);
  562. }
  563. if(dz->mode > 0)
  564. dz->mode--;
  565. //setup_particular_application() =
  566. if((exit_status = setup_ceracu_application(dz))<0)
  567. return(exit_status);
  568. //ap = dz->application;
  569. break;
  570. case(3):
  571. if(sscanf(argv[cnt],"%d",&infilecnt)!=1) {
  572. sprintf(errstr,"Cannot read infilecnt sent from TK\n");
  573. return(DATA_ERROR);
  574. }
  575. if(infilecnt < 1) {
  576. true_cnt = cnt + 1;
  577. cnt = PRE_CMDLINE_DATACNT; /* force exit from loop after assign_file_data_storage */
  578. }
  579. if((exit_status = assign_file_data_storage(infilecnt,dz))<0)
  580. return(exit_status);
  581. break;
  582. case(INPUT_FILETYPE+4):
  583. if(sscanf(argv[cnt],"%d",&dz->infile->filetype)!=1) {
  584. sprintf(errstr,"Cannot read filetype sent from TK (%s)\n",argv[cnt]);
  585. return(DATA_ERROR);
  586. }
  587. break;
  588. case(INPUT_FILESIZE+4):
  589. if(sscanf(argv[cnt],"%d",&filesize)!=1) {
  590. sprintf(errstr,"Cannot read infilesize sent from TK\n");
  591. return(DATA_ERROR);
  592. }
  593. dz->insams[0] = filesize;
  594. break;
  595. case(INPUT_INSAMS+4):
  596. if(sscanf(argv[cnt],"%d",&insams)!=1) {
  597. sprintf(errstr,"Cannot read insams sent from TK\n");
  598. return(DATA_ERROR);
  599. }
  600. dz->insams[0] = insams;
  601. break;
  602. case(INPUT_SRATE+4):
  603. if(sscanf(argv[cnt],"%d",&dz->infile->srate)!=1) {
  604. sprintf(errstr,"Cannot read srate sent from TK\n");
  605. return(DATA_ERROR);
  606. }
  607. break;
  608. case(INPUT_CHANNELS+4):
  609. if(sscanf(argv[cnt],"%d",&dz->infile->channels)!=1) {
  610. sprintf(errstr,"Cannot read channels sent from TK\n");
  611. return(DATA_ERROR);
  612. }
  613. break;
  614. case(INPUT_STYPE+4):
  615. if(sscanf(argv[cnt],"%d",&dz->infile->stype)!=1) {
  616. sprintf(errstr,"Cannot read stype sent from TK\n");
  617. return(DATA_ERROR);
  618. }
  619. break;
  620. case(INPUT_ORIGSTYPE+4):
  621. if(sscanf(argv[cnt],"%d",&dz->infile->origstype)!=1) {
  622. sprintf(errstr,"Cannot read origstype sent from TK\n");
  623. return(DATA_ERROR);
  624. }
  625. break;
  626. case(INPUT_ORIGRATE+4):
  627. if(sscanf(argv[cnt],"%d",&dz->infile->origrate)!=1) {
  628. sprintf(errstr,"Cannot read origrate sent from TK\n");
  629. return(DATA_ERROR);
  630. }
  631. break;
  632. case(INPUT_MLEN+4):
  633. if(sscanf(argv[cnt],"%d",&dz->infile->Mlen)!=1) {
  634. sprintf(errstr,"Cannot read Mlen sent from TK\n");
  635. return(DATA_ERROR);
  636. }
  637. break;
  638. case(INPUT_DFAC+4):
  639. if(sscanf(argv[cnt],"%d",&dz->infile->Dfac)!=1) {
  640. sprintf(errstr,"Cannot read Dfac sent from TK\n");
  641. return(DATA_ERROR);
  642. }
  643. break;
  644. case(INPUT_ORIGCHANS+4):
  645. if(sscanf(argv[cnt],"%d",&dz->infile->origchans)!=1) {
  646. sprintf(errstr,"Cannot read origchans sent from TK\n");
  647. return(DATA_ERROR);
  648. }
  649. break;
  650. case(INPUT_SPECENVCNT+4):
  651. if(sscanf(argv[cnt],"%d",&dz->infile->specenvcnt)!=1) {
  652. sprintf(errstr,"Cannot read specenvcnt sent from TK\n");
  653. return(DATA_ERROR);
  654. }
  655. dz->specenvcnt = dz->infile->specenvcnt;
  656. break;
  657. case(INPUT_WANTED+4):
  658. if(sscanf(argv[cnt],"%d",&dz->wanted)!=1) {
  659. sprintf(errstr,"Cannot read wanted sent from TK\n");
  660. return(DATA_ERROR);
  661. }
  662. break;
  663. case(INPUT_WLENGTH+4):
  664. if(sscanf(argv[cnt],"%d",&dz->wlength)!=1) {
  665. sprintf(errstr,"Cannot read wlength sent from TK\n");
  666. return(DATA_ERROR);
  667. }
  668. break;
  669. case(INPUT_OUT_CHANS+4):
  670. if(sscanf(argv[cnt],"%d",&dz->out_chans)!=1) {
  671. sprintf(errstr,"Cannot read out_chans sent from TK\n");
  672. return(DATA_ERROR);
  673. }
  674. break;
  675. /* RWD these chanegs to samps - tk will have to deal with that! */
  676. case(INPUT_DESCRIPTOR_BYTES+4):
  677. if(sscanf(argv[cnt],"%d",&dz->descriptor_samps)!=1) {
  678. sprintf(errstr,"Cannot read descriptor_samps sent from TK\n");
  679. return(DATA_ERROR);
  680. }
  681. break;
  682. case(INPUT_IS_TRANSPOS+4):
  683. if(sscanf(argv[cnt],"%d",&dz->is_transpos)!=1) {
  684. sprintf(errstr,"Cannot read is_transpos sent from TK\n");
  685. return(DATA_ERROR);
  686. }
  687. break;
  688. case(INPUT_COULD_BE_TRANSPOS+4):
  689. if(sscanf(argv[cnt],"%d",&dz->could_be_transpos)!=1) {
  690. sprintf(errstr,"Cannot read could_be_transpos sent from TK\n");
  691. return(DATA_ERROR);
  692. }
  693. break;
  694. case(INPUT_COULD_BE_PITCH+4):
  695. if(sscanf(argv[cnt],"%d",&dz->could_be_pitch)!=1) {
  696. sprintf(errstr,"Cannot read could_be_pitch sent from TK\n");
  697. return(DATA_ERROR);
  698. }
  699. break;
  700. case(INPUT_DIFFERENT_SRATES+4):
  701. if(sscanf(argv[cnt],"%d",&dz->different_srates)!=1) {
  702. sprintf(errstr,"Cannot read different_srates sent from TK\n");
  703. return(DATA_ERROR);
  704. }
  705. break;
  706. case(INPUT_DUPLICATE_SNDS+4):
  707. if(sscanf(argv[cnt],"%d",&dz->duplicate_snds)!=1) {
  708. sprintf(errstr,"Cannot read duplicate_snds sent from TK\n");
  709. return(DATA_ERROR);
  710. }
  711. break;
  712. case(INPUT_BRKSIZE+4):
  713. if(sscanf(argv[cnt],"%d",&inbrksize)!=1) {
  714. sprintf(errstr,"Cannot read brksize sent from TK\n");
  715. return(DATA_ERROR);
  716. }
  717. if(inbrksize > 0) {
  718. switch(dz->input_data_type) {
  719. case(WORDLIST_ONLY):
  720. break;
  721. case(PITCH_AND_PITCH):
  722. case(PITCH_AND_TRANSPOS):
  723. case(TRANSPOS_AND_TRANSPOS):
  724. dz->tempsize = inbrksize;
  725. break;
  726. case(BRKFILES_ONLY):
  727. case(UNRANGED_BRKFILE_ONLY):
  728. case(DB_BRKFILES_ONLY):
  729. case(ALL_FILES):
  730. case(ANY_NUMBER_OF_ANY_FILES):
  731. if(dz->extrabrkno < 0) {
  732. sprintf(errstr,"Storage location number for brktable not established by CDP.\n");
  733. return(DATA_ERROR);
  734. }
  735. if(dz->brksize == NULL) {
  736. sprintf(errstr,"CDP has not established storage space for input brktable.\n");
  737. return(PROGRAM_ERROR);
  738. }
  739. dz->brksize[dz->extrabrkno] = inbrksize;
  740. break;
  741. default:
  742. sprintf(errstr,"TK sent brktablesize > 0 for input_data_type [%d] not using brktables.\n",
  743. dz->input_data_type);
  744. return(PROGRAM_ERROR);
  745. }
  746. break;
  747. }
  748. break;
  749. case(INPUT_NUMSIZE+4):
  750. if(sscanf(argv[cnt],"%d",&dz->numsize)!=1) {
  751. sprintf(errstr,"Cannot read numsize sent from TK\n");
  752. return(DATA_ERROR);
  753. }
  754. break;
  755. case(INPUT_LINECNT+4):
  756. if(sscanf(argv[cnt],"%d",&dz->linecnt)!=1) {
  757. sprintf(errstr,"Cannot read linecnt sent from TK\n");
  758. return(DATA_ERROR);
  759. }
  760. break;
  761. case(INPUT_ALL_WORDS+4):
  762. if(sscanf(argv[cnt],"%d",&dz->all_words)!=1) {
  763. sprintf(errstr,"Cannot read all_words sent from TK\n");
  764. return(DATA_ERROR);
  765. }
  766. break;
  767. case(INPUT_ARATE+4):
  768. if(sscanf(argv[cnt],"%f",&dz->infile->arate)!=1) {
  769. sprintf(errstr,"Cannot read arate sent from TK\n");
  770. return(DATA_ERROR);
  771. }
  772. break;
  773. case(INPUT_FRAMETIME+4):
  774. if(sscanf(argv[cnt],"%lf",&dummy)!=1) {
  775. sprintf(errstr,"Cannot read frametime sent from TK\n");
  776. return(DATA_ERROR);
  777. }
  778. dz->frametime = (float)dummy;
  779. break;
  780. case(INPUT_WINDOW_SIZE+4):
  781. if(sscanf(argv[cnt],"%f",&dz->infile->window_size)!=1) {
  782. sprintf(errstr,"Cannot read window_size sent from TK\n");
  783. return(DATA_ERROR);
  784. }
  785. break;
  786. case(INPUT_NYQUIST+4):
  787. if(sscanf(argv[cnt],"%lf",&dz->nyquist)!=1) {
  788. sprintf(errstr,"Cannot read nyquist sent from TK\n");
  789. return(DATA_ERROR);
  790. }
  791. break;
  792. case(INPUT_DURATION+4):
  793. if(sscanf(argv[cnt],"%lf",&dz->duration)!=1) {
  794. sprintf(errstr,"Cannot read duration sent from TK\n");
  795. return(DATA_ERROR);
  796. }
  797. break;
  798. case(INPUT_MINBRK+4):
  799. if(sscanf(argv[cnt],"%lf",&dz->minbrk)!=1) {
  800. sprintf(errstr,"Cannot read minbrk sent from TK\n");
  801. return(DATA_ERROR);
  802. }
  803. break;
  804. case(INPUT_MAXBRK+4):
  805. if(sscanf(argv[cnt],"%lf",&dz->maxbrk)!=1) {
  806. sprintf(errstr,"Cannot read maxbrk sent from TK\n");
  807. return(DATA_ERROR);
  808. }
  809. break;
  810. case(INPUT_MINNUM+4):
  811. if(sscanf(argv[cnt],"%lf",&dz->minnum)!=1) {
  812. sprintf(errstr,"Cannot read minnum sent from TK\n");
  813. return(DATA_ERROR);
  814. }
  815. break;
  816. case(INPUT_MAXNUM+4):
  817. if(sscanf(argv[cnt],"%lf",&dz->maxnum)!=1) {
  818. sprintf(errstr,"Cannot read maxnum sent from TK\n");
  819. return(DATA_ERROR);
  820. }
  821. break;
  822. default:
  823. sprintf(errstr,"case switch item missing: parse_sloom_data()\n");
  824. return(PROGRAM_ERROR);
  825. }
  826. cnt++;
  827. }
  828. if(cnt!=PRE_CMDLINE_DATACNT+1) {
  829. sprintf(errstr,"Insufficient pre-cmdline params sent from TK\n");
  830. return(DATA_ERROR);
  831. }
  832. if(true_cnt)
  833. cnt = true_cnt;
  834. *cmdlinecnt = 0;
  835. while(cnt < argc) {
  836. if((exit_status = get_tk_cmdline_word(cmdlinecnt,cmdline,argv[cnt]))<0)
  837. return(exit_status);
  838. cnt++;
  839. }
  840. return(FINISHED);
  841. }
  842. /********************************* GET_TK_CMDLINE_WORD *********************************/
  843. int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q)
  844. {
  845. if(*cmdlinecnt==0) {
  846. if((*cmdline = (char **)malloc(sizeof(char *)))==NULL) {
  847. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  848. return(MEMORY_ERROR);
  849. }
  850. } else {
  851. if((*cmdline = (char **)realloc(*cmdline,((*cmdlinecnt)+1) * sizeof(char *)))==NULL) {
  852. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  853. return(MEMORY_ERROR);
  854. }
  855. }
  856. if(((*cmdline)[*cmdlinecnt] = (char *)malloc((strlen(q) + 1) * sizeof(char)))==NULL) {
  857. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline item %d.\n",(*cmdlinecnt)+1);
  858. return(MEMORY_ERROR);
  859. }
  860. strcpy((*cmdline)[*cmdlinecnt],q);
  861. (*cmdlinecnt)++;
  862. return(FINISHED);
  863. }
  864. /****************************** ASSIGN_FILE_DATA_STORAGE *********************************/
  865. int assign_file_data_storage(int infilecnt,dataptr dz)
  866. {
  867. int exit_status;
  868. int no_sndfile_system_files = FALSE;
  869. dz->infilecnt = infilecnt;
  870. if((exit_status = allocate_filespace(dz))<0)
  871. return(exit_status);
  872. if(no_sndfile_system_files)
  873. dz->infilecnt = 0;
  874. return(FINISHED);
  875. }
  876. /************************* redundant functions: to ensure libs compile OK *******************/
  877. int assign_process_logic(dataptr dz)
  878. {
  879. return(FINISHED);
  880. }
  881. void set_legal_infile_structure(dataptr dz)
  882. {}
  883. int set_legal_internalparam_structure(int process,int mode,aplptr ap)
  884. {
  885. return(FINISHED);
  886. }
  887. int setup_internal_arrays_and_array_pointers(dataptr dz)
  888. {
  889. return(FINISHED);
  890. }
  891. int establish_bufptrs_and_extra_buffers(dataptr dz)
  892. {
  893. return(FINISHED);
  894. }
  895. int read_special_data(char *str,dataptr dz)
  896. {
  897. return(FINISHED);
  898. }
  899. int inner_loop
  900. (int *peakscore,int *descnt,int *in_start_portion,int *least,int *pitchcnt,int windows_in_buf,dataptr dz)
  901. {
  902. return(FINISHED);
  903. }
  904. int get_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  905. {
  906. return(FINISHED);
  907. }
  908. /******************************** USAGE1 ********************************/
  909. int usage1(void)
  910. {
  911. usage2("ceracu");
  912. return(USAGE_ONLY);
  913. }
  914. /********************************************************************************************/
  915. int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  916. {
  917. if(!strcmp(prog_identifier_from_cmdline,"ceracu")) dz->process = CERACU;
  918. else {
  919. sprintf(errstr,"Unknown program identification string '%s'\n",prog_identifier_from_cmdline);
  920. return(USAGE_ONLY);
  921. }
  922. return(FINISHED);
  923. }
  924. /******************************** SETUP_AND_INIT_INPUT_BRKTABLE_CONSTANTS ********************************/
  925. int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt)
  926. {
  927. int n;
  928. if((dz->brk = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  929. sprintf(errstr,"setup_and_init_input_brktable_constants(): 1\n");
  930. return(MEMORY_ERROR);
  931. }
  932. if((dz->brkptr = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  933. sprintf(errstr,"setup_and_init_input_brktable_constants(): 6\n");
  934. return(MEMORY_ERROR);
  935. }
  936. if((dz->brksize = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  937. sprintf(errstr,"setup_and_init_input_brktable_constants(): 2\n");
  938. return(MEMORY_ERROR);
  939. }
  940. if((dz->firstval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  941. sprintf(errstr,"setup_and_init_input_brktable_constants(): 3\n");
  942. return(MEMORY_ERROR);
  943. }
  944. if((dz->lastind = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  945. sprintf(errstr,"setup_and_init_input_brktable_constants(): 4\n");
  946. return(MEMORY_ERROR);
  947. }
  948. if((dz->lastval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  949. sprintf(errstr,"setup_and_init_input_brktable_constants(): 5\n");
  950. return(MEMORY_ERROR);
  951. }
  952. if((dz->brkinit = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  953. sprintf(errstr,"setup_and_init_input_brktable_constants(): 7\n");
  954. return(MEMORY_ERROR);
  955. }
  956. for(n=0;n<brkcnt;n++) {
  957. dz->brk[n] = NULL;
  958. dz->brkptr[n] = NULL;
  959. dz->brkinit[n] = 0;
  960. dz->brksize[n] = 0;
  961. }
  962. return(FINISHED);
  963. }
  964. /******************************** USAGE2 ********************************/
  965. int usage2(char *str)
  966. {
  967. if(!strcmp(str,"ceracu")) {
  968. fprintf(stdout,
  969. "USAGE:\n"
  970. "ceracu ceracu inf outf cyclcnts mincycdur chans outdur echo echshift [-o] [-l]\n"
  971. "\n"
  972. "Repeat src in several cyclestreams that resynchronise after specified counts.\n"
  973. "One complete pass is a \"resync-cycle\". e.g. for 10 12 15\n"
  974. "Source repeat 10,12 and 15 times before cyclestreams resynchronise ....\n"
  975. "IF source sound is \"A\", cyclestreams would be ....\n"
  976. "A A A A A A A A A A A (10 times)\n"
  977. "A A A A A A A A A A A A A (12 times)\n"
  978. "A A A A A A A A A A A A A A A A (15 times)\n"
  979. "|--------------------------Resync cycle --------------------|\n"
  980. "|---| = Mincycdur (see below)\n"
  981. "\n"
  982. "CYCLECNTS A list of integers, being\n"
  983. " the number of repeats in each cyclestream before the streams resync.\n"
  984. "MINCYCDUR Time before the first repeat in the fastest cyclestream.\n"
  985. " If set to ZERO, assumed to be the duration of the input sound.\n"
  986. "CHANS: Number of channels in output. (Not ness same as number of cyclestreams)\n"
  987. "OUTDUR Duration of output. (If set to ZERO, outputs a single resync-cycle).\n"
  988. " Process always outputs a WHOLE NUMBER of complete resync-cycles,\n"
  989. " equal to or greater than the specified output duration.\n"
  990. " If true duration > 1 hour, sound curtailed, unless \"-o\" flag set.\n"
  991. "ECHO Single-echo-delay of entire output, in secs (Set to zero for no echo).\n"
  992. "ECHSHIFT Spatial offset of echo-delay (an integer value). (Ignored if no echo)\n"
  993. " 1 = 1 chan to right; 2 = 2 chans to right; -1 = 1 channel to left; etc\n"
  994. "-o Override duration restriction, to produce all resync-cycles (CARE!).\n"
  995. "-l Output channels arranged linearly (default: arranged in a circle).\n"
  996. "\n");
  997. } else
  998. fprintf(stdout,"Unknown option '%s'\n",str);
  999. return(USAGE_ONLY);
  1000. }
  1001. int usage3(char *str1,char *str2)
  1002. {
  1003. fprintf(stderr,"Insufficient parameters on command line.\n");
  1004. return(USAGE_ONLY);
  1005. }
  1006. /**************************** HANDLE_THE_SPECIAL_DATA ****************************/
  1007. int handle_the_special_data(char *str,dataptr dz)
  1008. {
  1009. int n, k, cnt, *cyclen;
  1010. FILE *fp;
  1011. char temp[200], *p;
  1012. double dummy;
  1013. if((fp = fopen(str,"r"))==NULL) {
  1014. sprintf(errstr,"Cannot open file %s to read cyclecounts.\n",str);
  1015. return(DATA_ERROR);
  1016. }
  1017. cnt = 0;
  1018. while(fgets(temp,200,fp)!=NULL) {
  1019. p = temp;
  1020. while(isspace(*p))
  1021. p++;
  1022. if(*p == ';' || *p == ENDOFSTR) // Allow comments in file
  1023. continue;
  1024. while(get_float_from_within_string(&p,&dummy)) {
  1025. if(dummy < 1.0) {
  1026. sprintf(errstr,"Invalid cyclecnt (%.1lf) (must be >=1)\n",dummy);
  1027. return(DATA_ERROR);
  1028. }
  1029. cnt++;
  1030. }
  1031. }
  1032. if(cnt < 2) {
  1033. sprintf(errstr,"Must be more than 1 cycle value\n");
  1034. return(DATA_ERROR);
  1035. }
  1036. dz->itemcnt = cnt;
  1037. /*********************************************
  1038. *
  1039. * dz->iparray[0] = cyclecnts (eventually as samplecnts)
  1040. * dz->iparray[1] = Array to determine lcm of samplecnts, and as temp store of cyclecnts
  1041. * dz->iparray[2] = leftmost channel for output for each cycle
  1042. * dz->iparray[3] = rightmost channel for output for each cycle
  1043. * dz->iparray[4] = pointers associated with cycles
  1044. */
  1045. if((dz->iparray = (int **)malloc(5 * sizeof(int *)))==NULL) {
  1046. sprintf(errstr,"INSUFFICIENT MEMORY to create integer arrays.\n");
  1047. return(MEMORY_ERROR);
  1048. }
  1049. for(n = 0; n < 4;n++) { // 5th array established later
  1050. if((dz->iparray[n] = (int *)malloc(dz->itemcnt * sizeof(int)))==NULL) {
  1051. sprintf(errstr,"INSUFFICIENT MEMORY to create integer array %d.\n",n+1);
  1052. return(MEMORY_ERROR);
  1053. }
  1054. }
  1055. cyclen = dz->iparray[0];
  1056. cnt = 0;
  1057. fseek(fp,0,0);
  1058. while(fgets(temp,200,fp)!=NULL) {
  1059. p = temp;
  1060. while(isspace(*p))
  1061. p++;
  1062. if(*p == ';' || *p == ENDOFSTR) // Allow comments in file
  1063. continue;
  1064. while(get_float_from_within_string(&p,&dummy)) {
  1065. cyclen[cnt] = (int)round(dummy);
  1066. cnt++;
  1067. }
  1068. }
  1069. for(cnt = 0;cnt < dz->itemcnt-1;cnt++) {
  1070. for(n=cnt+1;n<dz->itemcnt;n++) {
  1071. if(cyclen[cnt] == cyclen[n]) {
  1072. sprintf(errstr,"Not all cycle counts (which must be whole numbers) are distinct (e.g. %d)\n",cyclen[n]);
  1073. return(DATA_ERROR);
  1074. } else if(cyclen[cnt] > cyclen[n]) {
  1075. k = cyclen[cnt];
  1076. cyclen[cnt] = cyclen[n];
  1077. cyclen[n] = k;
  1078. }
  1079. }
  1080. }
  1081. // Array of position of left and right levels for each cycle
  1082. if((dz->parray = (double **)malloc(2 * sizeof(double *)))==NULL) {
  1083. sprintf(errstr,"INSUFFICIENT MEMORY to create double arrays.\n");
  1084. return(MEMORY_ERROR);
  1085. }
  1086. if((dz->parray[0] = (double *)malloc(dz->itemcnt * sizeof(double)))==NULL) {
  1087. sprintf(errstr,"INSUFFICIENT MEMORY to create array for output positions.\n");
  1088. return(MEMORY_ERROR);
  1089. }
  1090. if((dz->parray[1] = (double *)malloc(dz->itemcnt * sizeof(double)))==NULL) {
  1091. sprintf(errstr,"INSUFFICIENT MEMORY to create array for output positions.\n");
  1092. return(MEMORY_ERROR);
  1093. }
  1094. return FINISHED;
  1095. }
  1096. /**************************** CERACU_PARAM_PREPROCESS ****************************/
  1097. int ceracu_param_preprocess(dataptr dz)
  1098. {
  1099. int exit_status, chans = dz->iparam[CER_OCHANS];
  1100. double srate = (double)dz->infile->srate, *pos = dz->parray[0], *llev = dz->parray[0], *rlev = dz->parray[1];
  1101. double leftgain, rightgain;
  1102. int *cyclen = dz->iparray[0], *lmost = dz->iparray[2], *rmost = dz->iparray[3], done_warning = 0, n;
  1103. int totallen, lcm_of_cycles;
  1104. int maxcyclecnt, ptrcnt;
  1105. while(dz->iparam[CER_DSTEP] < 0)
  1106. dz->iparam[CER_DSTEP] = dz->iparam[CER_OCHANS] - dz->iparam[CER_DSTEP];
  1107. dz->iparam[CER_DSTEP] %= dz->iparam[CER_OCHANS];
  1108. dz->iparam[CER_DELAY] = (int)round(dz->param[CER_DELAY] * srate);
  1109. dz->iparam[CER_CUTOFF] = (int)round(dz->param[CER_CUTOFF] * srate);
  1110. dz->iparam[CER_MINDUR] = (int)round(dz->param[CER_MINDUR] * srate); // Number of samples in the minimum repeat-duration
  1111. if(dz->iparam[CER_MINDUR] == 0) // If set to zero, assumed to be length of input sound
  1112. dz->iparam[CER_MINDUR] = dz->insams[0];
  1113. // Calculate cycle-lengths for each cycle
  1114. maxcyclecnt = cyclen[dz->itemcnt - 1]; // Item repeated most has least repeat-duration, to fit into sync-cycle
  1115. totallen = maxcyclecnt * dz->iparam[CER_MINDUR]; // So, initially, totallen = maxcyclecnt * min cyclelen in samples
  1116. if((exit_status = get_lcm(dz->itemcnt,&lcm_of_cycles,dz))<0) // Find lcm of all cycles EXCEPT max-cycle
  1117. return exit_status;
  1118. while((totallen/lcm_of_cycles) * lcm_of_cycles != totallen) { // Force totallen to be divisible by all cycles.
  1119. totallen++;
  1120. if(totallen < 0) {
  1121. sprintf(errstr,"Output length has overflowed: Cannot proceed.\n");
  1122. return(DATA_ERROR);
  1123. }
  1124. if(!done_warning) {
  1125. if(dz->vflag[CER_OVERRIDE] && (totallen > 3600 * dz->infile->srate)) {
  1126. fprintf(stdout,"WARNING: Output is longer than 1 hour\n");
  1127. fflush(stdout);
  1128. done_warning = 1;
  1129. }
  1130. }
  1131. }
  1132. for(n=0;n<dz->itemcnt;n++) { // Put adjusted length of cycles, in samples, in array
  1133. if((cyclen[n] = totallen/cyclen[n]) < 0) {
  1134. sprintf(errstr,"Output length for cycle %d has overflowed: Cannot proceed.\n",n+1);
  1135. return(DATA_ERROR);
  1136. }
  1137. }
  1138. if(dz->param[CER_DELAY] >= cyclen[dz->itemcnt-1]) {
  1139. sprintf(errstr,"Delay time (%lf) must be less than Fastest Repeat Time (%lf).\n",dz->param[CER_DELAY],(double)cyclen[dz->itemcnt-1]/srate);
  1140. return(DATA_ERROR);
  1141. }
  1142. dz->ringsize = totallen;
  1143. if(dz->iparam[CER_CUTOFF] == 0) // If output duration set to zero
  1144. dz->iparam[CER_CUTOFF] = dz->ringsize; // Assumed to be length of ONE complete cycle
  1145. ptrcnt = dz->itemcnt;
  1146. dz->dupl = (int)ceil((double)dz->insams[0]/(double)cyclen[dz->itemcnt - 1]);
  1147. if(dz->dupl > 1)
  1148. ptrcnt *= dz->dupl;
  1149. if(dz->iparam[CER_DELAY] > 0)
  1150. ptrcnt *= 2;
  1151. if((dz->iparray[4] = (int *)malloc(ptrcnt * sizeof(int)))==NULL) {
  1152. sprintf(errstr,"INSUFFICIENT MEMORY to create cycle-pointers.\n");
  1153. return(MEMORY_ERROR);
  1154. }
  1155. // Assign output positions and levels for sounds
  1156. if(dz->itemcnt == chans) {
  1157. for(n = 0;n<dz->itemcnt;n++) {
  1158. lmost[n] = n;
  1159. rmost[n] = (lmost[n] + 1) % chans;
  1160. llev[n] = 1.0;
  1161. rlev[n] = 0.0;
  1162. }
  1163. } else {
  1164. if (chans == 1) {
  1165. for(n = 0;n<dz->itemcnt;n++) {
  1166. lmost[n] = 0;
  1167. rmost[n] = 0;
  1168. llev[n] = 1.0; // Daft, but keeps same algo for all cases
  1169. rlev[n] = 0.0;
  1170. }
  1171. } else {
  1172. if(dz->vflag[CER_LINEAR] || chans == 2) {
  1173. for(n = 0;n<dz->itemcnt;n++) {
  1174. pos[n] = ((chans - 1) * n)/(double)(dz->itemcnt - 1);
  1175. lmost[n] = (int)floor(pos[n]);
  1176. pos[n] -= lmost[n];
  1177. }
  1178. } else {
  1179. for(n = 0;n<dz->itemcnt;n++) {
  1180. pos[n] = (chans * n)/(double)dz->itemcnt;
  1181. lmost[n] = (int)floor(pos[n]);
  1182. pos[n] -= lmost[n];
  1183. }
  1184. }
  1185. }
  1186. for(n = 0;n<dz->itemcnt;n++) {
  1187. rmost[n] = (lmost[n] + 1) % chans;
  1188. if(flteq(pos[n],0.0)) {
  1189. rlev[n] = 0.0;
  1190. llev[n] = 1.0; // pos values overwritten by associated level values (ETC below)
  1191. } else if(flteq(pos[n],1.0)) {
  1192. rlev[n] = 1.0;
  1193. llev[n] = 0.0;
  1194. } else {
  1195. pos[n] *= 2.0;
  1196. pos[n] -= 1.0; // Change position to -1 to +1 range
  1197. pancalc(pos[n],&leftgain,&rightgain);
  1198. rlev[n] = rightgain;
  1199. llev[n] = leftgain;
  1200. }
  1201. }
  1202. }
  1203. return FINISHED;
  1204. }
  1205. /*************************** LCM **********************************/
  1206. int get_lcm(int arraycnt,int *lcm,dataptr dz)
  1207. {
  1208. int *cycarray = dz->iparray[1];
  1209. int origlcm;
  1210. int n, m, k, div, OK;
  1211. for(n = 0,m = arraycnt - 1; n < arraycnt; n++,m--)
  1212. cycarray[m] = dz->iparray[0][n]; // Copy array to descending order
  1213. for(n = 0; n < arraycnt; n++) { // Eliminate "1" values
  1214. if(cycarray[n] == 1) {
  1215. for(k = n+1; k < arraycnt;k++) // Eliminate value "1" from lcm search
  1216. cycarray[k-1] = cycarray[k];
  1217. arraycnt--;
  1218. break;
  1219. }
  1220. }
  1221. if(arraycnt == 1) { // If only one value remains,
  1222. *lcm = cycarray[0]; // This is the LCM
  1223. return FINISHED;
  1224. }
  1225. for(n = 0; n < arraycnt - 1; n++) { // Eliminate exact multiples
  1226. for(m = n+1; m < arraycnt; m++) {
  1227. div = cycarray[n]/cycarray[m];
  1228. if(div * cycarray[m] == cycarray[n]) { // Exact divisor
  1229. for(k = m+1; k < arraycnt;k++) // Eliminate divisor
  1230. cycarray[k-1] = cycarray[k];
  1231. arraycnt--;
  1232. m--;
  1233. }
  1234. }
  1235. // n++; /* RWD ???? probably don't want this. */
  1236. }
  1237. if(arraycnt == 1) { // If only one value remains,
  1238. *lcm = cycarray[0]; // This is the LCM, as all other values (eliminated) were its divisors
  1239. return FINISHED;
  1240. }
  1241. *lcm = cycarray[0] * cycarray[1]; // If arraycnt = 2, this product is LCM, as these 2 values are not mutual divisors
  1242. origlcm = *lcm; // If arraycnt > 2, test this initial "lcm" against other remaining numbers in array
  1243. if (arraycnt > 2) {
  1244. OK = 0;
  1245. while(!OK) {
  1246. OK = 1;
  1247. for(n=0;n < arraycnt;n++) {
  1248. div = (*lcm)/cycarray[n];
  1249. if(div * cycarray[n] == *lcm) { // cycarray[n] is a divisor of "lcm"
  1250. for(k = n+1; k < arraycnt;k++) // Eliminate divisor cycarray[n]
  1251. cycarray[k-1] = cycarray[k];// As this will be divisor of this "lcm" and any multiple of it
  1252. origlcm = *lcm; // This becomes the lcm so far
  1253. arraycnt--;
  1254. n--;
  1255. } else {
  1256. OK = 0; // cycarray[n] is NOT a divisor of this "lcm"
  1257. break;
  1258. }
  1259. }
  1260. if(!OK) { // if there are still array components that do not divide the "lcm"
  1261. *lcm += origlcm; // ascend through multiples of original "lcm" until a true lcm is found
  1262. if(*lcm < 0) {
  1263. sprintf(errstr,"Numeric overflow in calculationg Lowest Common Multiple of cycle lengths.\n");
  1264. return(DATA_ERROR);
  1265. }
  1266. }
  1267. }
  1268. }
  1269. return FINISHED;
  1270. }
  1271. /************************************ PANCALC *******************************/
  1272. void pancalc(double position,double *leftgain,double *rightgain)
  1273. {
  1274. int dirflag;
  1275. double temp;
  1276. double relpos;
  1277. double reldist, invsquare;
  1278. if(position < 0.0)
  1279. dirflag = SIGNAL_TO_LEFT; /* signal on left */
  1280. else
  1281. dirflag = SIGNAL_TO_RIGHT;
  1282. if(position < 0)
  1283. relpos = -position;
  1284. else
  1285. relpos = position;
  1286. if(relpos <= 1.0){ /* between the speakers */
  1287. temp = 1.0 + (relpos * relpos);
  1288. reldist = ROOT2 / sqrt(temp);
  1289. temp = (position + 1.0) / 2.0;
  1290. *rightgain = temp * reldist;
  1291. *leftgain = (1.0 - temp ) * reldist;
  1292. } else { /* outside the speakers */
  1293. temp = (relpos * relpos) + 1.0;
  1294. reldist = sqrt(temp) / ROOT2; /* relative distance to source */
  1295. invsquare = 1.0 / (reldist * reldist);
  1296. if(dirflag == SIGNAL_TO_LEFT){
  1297. *leftgain = invsquare;
  1298. *rightgain = 0.0;
  1299. } else { /* SIGNAL_TO_RIGHT */
  1300. *rightgain = invsquare;
  1301. *leftgain = 0;
  1302. }
  1303. }
  1304. }
  1305. /************************************ CERACU *******************************/
  1306. int ceracu(dataptr dz)
  1307. {
  1308. int exit_status, chans = dz->iparam[CER_OCHANS], k, samps_left, insampcnt = dz->insams[0], mins = 0, hrs = 0;
  1309. float *ibuf = dz->sampbuf[0], *obuf = dz->sampbuf[1];
  1310. double maxsamp = 0.0, normaliser, srate = (double)dz->infile->srate, secs = 0.0;
  1311. int n, nn, m, lmst, rmst, ptrcnt, samps_read, bas, opos;
  1312. unsigned int outcnt, mintotalout;
  1313. int *iptr = dz->iparray[4], *cyclen = dz->iparray[0], *orig_cyclen = dz->iparray[1], *lmost = dz->iparray[2], *rmost = dz->iparray[3];
  1314. double *llev = dz->parray[0], *rlev = dz->parray[1];
  1315. if((samps_read = fgetfbufEx(dz->sampbuf[0], insampcnt,dz->ifd[0],0))<0) {
  1316. sprintf(errstr,"Sound read error with input soundfile: %s\n",sferrstr());
  1317. return(SYSTEM_ERROR);
  1318. }
  1319. memset((char *)obuf,0,dz->buflen * sizeof(float));
  1320. mintotalout = (int)ceil((double)dz->iparam[CER_CUTOFF]/(double)dz->ringsize); // How many complete-resyncing-cycles begin within specified outdur
  1321. mintotalout *= dz->ringsize; // Outdur is a complete number of these c-r-cyles
  1322. if(mintotalout < 0) {
  1323. sprintf(errstr,"Projected output length produces numeric overflow : Cannot proceed.\n");
  1324. return(DATA_ERROR);
  1325. }
  1326. if(!dz->vflag[CER_OVERRIDE] && (mintotalout > (unsigned int)(3600 * dz->infile->srate))) {
  1327. sprintf(errstr,"Projected output is longer than 1 hour: terminating (use the \"Override\" flag to force longer output).\n");
  1328. return(DATA_ERROR);
  1329. }
  1330. secs = (double)mintotalout/srate;
  1331. mins = (int)floor(secs/60.0);
  1332. secs -= (double)(mins * 60);
  1333. hrs = mins/60;
  1334. mins = mins - (hrs * 60);
  1335. if(hrs)
  1336. fprintf(stdout,"INFO: Output duration will be at least %d hrs %d mins and %.2lf secs\n",hrs,mins,secs);
  1337. else if(mins)
  1338. fprintf(stdout,"INFO: Output duration will be at least %d mins and %.2lf secs\n",mins,secs);
  1339. else
  1340. fprintf(stdout,"INFO: Output duration will be at least %.2lf secs\n",secs);
  1341. secs = (double)cyclen[dz->itemcnt - 1]/srate;
  1342. mins = (int)floor(secs/60.0);
  1343. secs -= (double)(mins * 60);
  1344. hrs = mins/60;
  1345. mins = mins - (hrs * 60);
  1346. if(hrs)
  1347. fprintf(stdout,"INFO: Minimum cycle step will be %d hrs %d mins and %.2lf secs\n",hrs,mins,secs);
  1348. else if(mins)
  1349. fprintf(stdout,"INFO: Minimum cycle step will be %d mins and %.2lf secs\n",mins,secs);
  1350. else
  1351. fprintf(stdout,"INFO: Minimum cycle step will be %lf secs\n",secs);
  1352. fprintf(stdout,"INFO: First pass: assessing level.\n");
  1353. fflush(stdout);
  1354. for(n = 0;n<dz->itemcnt;n++)
  1355. iptr[n] = 0;
  1356. if(dz->dupl > 1) { // If sound overlaps itself in output
  1357. for(k = 1;k < dz->dupl;k++) { // Every duplicated pointer is staggered a whole cycle before previous copy
  1358. bas = dz->itemcnt * k;
  1359. for(n = 0;n<dz->itemcnt;n++)
  1360. iptr[n + bas] = -(cyclen[n] * k);
  1361. }
  1362. for(n = 0;n<dz->itemcnt;n++) {
  1363. orig_cyclen[n] = cyclen[n];
  1364. cyclen[n] *= dz->dupl; // And then each duplicated pointer only switches on once every dupl cycles
  1365. }
  1366. }
  1367. ptrcnt = dz->itemcnt * dz->dupl;
  1368. if(dz->iparam[CER_DELAY] > 0) {
  1369. bas = ptrcnt;
  1370. for(n = 0;n < ptrcnt;n++)
  1371. iptr[n + bas] = iptr[n] - dz->iparam[CER_DELAY];
  1372. }
  1373. opos = 0;
  1374. outcnt = 0;
  1375. while(outcnt < mintotalout) {
  1376. for(n = 0; n < ptrcnt; n++) {
  1377. nn = n % dz->itemcnt;
  1378. if(iptr[n] >= 0 && iptr[n] < insampcnt) {
  1379. obuf[opos + lmost[nn]] = (float)(obuf[opos + lmost[nn]] + (ibuf[iptr[n]] * llev[nn]));
  1380. obuf[opos + rmost[nn]] = (float)(obuf[opos + rmost[nn]] + (ibuf[iptr[n]] * rlev[nn]));
  1381. }
  1382. iptr[n]++;
  1383. if(iptr[n] >= cyclen[nn])
  1384. iptr[n] = 0;
  1385. }
  1386. if(dz->iparam[CER_DELAY] > 0) {
  1387. for(n = 0,m = ptrcnt; n < ptrcnt; n++,m++) {
  1388. nn = n % dz->itemcnt;
  1389. lmst = (lmost[nn] + dz->iparam[CER_DSTEP]) % chans;
  1390. rmst = (lmst + 1) % chans;
  1391. if(iptr[m] >= 0 && iptr[m] < insampcnt) {
  1392. obuf[opos + lmst] = (float)(obuf[opos + lmst] + (ibuf[iptr[m]] * llev[nn])); // Use levels in orig chans llev\rlev[nn],
  1393. obuf[opos + rmst] = (float)(obuf[opos + rmst] + (ibuf[iptr[m]] * rlev[nn])); // applying them to delayed copy in
  1394. } // (possible different) chans lmst/rmst.
  1395. iptr[m]++;
  1396. if(iptr[m] >= cyclen[nn])
  1397. iptr[m] = 0;
  1398. }
  1399. }
  1400. outcnt++;
  1401. opos += chans;
  1402. if(opos >= dz->buflen) {
  1403. fprintf(stdout,"INFO: Level Check at %lf secs\n",(double)outcnt/srate);
  1404. fflush(stdout);
  1405. for(n=0;n < dz->buflen;n++)
  1406. maxsamp = max(maxsamp,fabs(obuf[n]));
  1407. memset((char *)obuf,0,dz->buflen * sizeof(float));
  1408. opos = 0;
  1409. }
  1410. }
  1411. samps_left = 1;
  1412. while(samps_left) { // Flush remaining buffers
  1413. samps_left = 0;
  1414. for(n = 0; n < ptrcnt; n++) {
  1415. nn = n % dz->itemcnt;
  1416. if(iptr[n] > 0 && iptr[n] < insampcnt) {
  1417. samps_left++;
  1418. break;
  1419. }
  1420. }
  1421. if(dz->iparam[CER_DELAY] > 0) {
  1422. for(n = 0, m= ptrcnt; n < ptrcnt; n++,m++) {
  1423. nn = n % dz->itemcnt;
  1424. if(iptr[m] > 0 && iptr[m] < insampcnt) {
  1425. samps_left++;
  1426. break;
  1427. }
  1428. }
  1429. }
  1430. if(!samps_left)
  1431. break;
  1432. for(n = 0; n < ptrcnt; n++) {
  1433. nn = n % dz->itemcnt;
  1434. if(iptr[n] > 0 && iptr[n] < insampcnt) {
  1435. obuf[opos + lmost[nn]] = (float)(obuf[opos + lmost[nn]] + (ibuf[iptr[n]] * llev[nn]));
  1436. obuf[opos + rmost[nn]] = (float)(obuf[opos + rmost[nn]] + (ibuf[iptr[n]] * rlev[nn]));
  1437. }
  1438. if(iptr[n] != 0)
  1439. iptr[n]++;
  1440. if(iptr[n] >= cyclen[nn])
  1441. iptr[n] = 0;
  1442. }
  1443. if(dz->iparam[CER_DELAY] > 0) {
  1444. for(n = 0, m= ptrcnt; n < ptrcnt; n++,m++) {
  1445. nn = n % dz->itemcnt;
  1446. lmst = (lmost[nn] + dz->iparam[CER_DSTEP]) % chans;
  1447. rmst = (lmst + 1) % chans;
  1448. if(iptr[m] >= 0 && iptr[m] < insampcnt) {
  1449. obuf[opos + lmst] = (float)(obuf[opos + lmst] + (ibuf[iptr[m]] * llev[nn]));
  1450. obuf[opos + rmst] = (float)(obuf[opos + rmst] + (ibuf[iptr[m]] * rlev[nn]));
  1451. }
  1452. if(iptr[m] != 0)
  1453. iptr[m]++;
  1454. if(iptr[m] >= cyclen[nn])
  1455. iptr[n] = 0;
  1456. }
  1457. }
  1458. outcnt++;
  1459. opos += chans;
  1460. if(opos >= dz->buflen) {
  1461. fprintf(stdout,"INFO: Level Check at %lf secs\n",(double)outcnt/srate);
  1462. fflush(stdout);
  1463. for(n=0;n < dz->buflen;n++)
  1464. maxsamp = max(maxsamp,fabs(obuf[n]));
  1465. memset((char *)obuf,0,dz->buflen * sizeof(float));
  1466. opos = 0;
  1467. }
  1468. }
  1469. if(opos >= 0) {
  1470. fprintf(stdout,"INFO: Level Check at %lf secs\n",(double)outcnt/srate);
  1471. fflush(stdout);
  1472. for(n=0;n < opos;n++)
  1473. maxsamp = max(maxsamp,fabs(obuf[n]));
  1474. }
  1475. normaliser = 1.0;
  1476. if(maxsamp > 0.95) {
  1477. normaliser = 0.95/maxsamp;
  1478. fprintf(stdout,"INFO: Output will be normalised by %.2lf secs\n",normaliser);
  1479. fflush(stdout);
  1480. }
  1481. if(sloom)
  1482. dz->insams[0] = outcnt * chans; // This forces sloom progress bar to proceed correctly, without mod to libraries
  1483. reset_filedata_counters(dz);
  1484. memset((char *)obuf,0,dz->buflen * sizeof(float));
  1485. for(n = 0;n<dz->itemcnt;n++)
  1486. iptr[n] = 0;
  1487. if(dz->dupl > 1) {
  1488. for(n = 0;n<dz->itemcnt;n++)
  1489. cyclen[n] = orig_cyclen[n];
  1490. for(k = 1;k < dz->dupl;k++) {
  1491. bas = dz->itemcnt * k;
  1492. for(n = 0;n<dz->itemcnt;n++)
  1493. iptr[n + bas] = -(cyclen[n] * k);
  1494. }
  1495. for(n = 0;n<dz->itemcnt;n++)
  1496. cyclen[n] *= dz->dupl;
  1497. }
  1498. if(dz->iparam[CER_DELAY] > 0) {
  1499. bas = ptrcnt;
  1500. for(n = 0;n < ptrcnt;n++)
  1501. iptr[n + bas] = iptr[n] - dz->iparam[CER_DELAY];
  1502. }
  1503. opos = 0;
  1504. outcnt = 0;
  1505. fprintf(stdout,"INFO: Second pass: creating sound.\n");
  1506. fflush(stdout);
  1507. while(outcnt < mintotalout) {
  1508. for(n = 0; n < ptrcnt; n++) {
  1509. nn = n % dz->itemcnt;
  1510. if(iptr[n] >= 0 && iptr[n] < insampcnt) {
  1511. obuf[opos + lmost[nn]] = (float)(obuf[opos + lmost[nn]] + (ibuf[iptr[n]] * llev[nn]));
  1512. obuf[opos + rmost[nn]] = (float)(obuf[opos + rmost[nn]] + (ibuf[iptr[n]] * rlev[nn]));
  1513. }
  1514. iptr[n]++;
  1515. if(iptr[n] >= cyclen[nn])
  1516. iptr[n] = 0;
  1517. }
  1518. if(dz->iparam[CER_DELAY] > 0) {
  1519. for(n = 0,m = ptrcnt; n < ptrcnt; n++,m++) {
  1520. nn = n % dz->itemcnt;
  1521. lmst = (lmost[nn] + dz->iparam[CER_DSTEP]) % chans;
  1522. rmst = (lmst + 1) % chans;
  1523. if(iptr[m] >= 0 && iptr[m] < insampcnt) {
  1524. obuf[opos + lmst] = (float)(obuf[opos + lmst] + (ibuf[iptr[m]] * llev[nn]));
  1525. obuf[opos + rmst] = (float)(obuf[opos + rmst] + (ibuf[iptr[m]] * rlev[nn]));
  1526. }
  1527. iptr[m]++;
  1528. if(iptr[m] >= cyclen[nn])
  1529. iptr[m] = 0;
  1530. }
  1531. }
  1532. outcnt++;
  1533. opos += chans;
  1534. if(opos >= dz->buflen) {
  1535. if(normaliser < 1.0) {
  1536. for(n=0;n < dz->buflen;n++)
  1537. obuf[n] = (float)(obuf[n] * normaliser);
  1538. }
  1539. if((exit_status = write_samps(obuf,dz->buflen,dz))<0)
  1540. return(exit_status);
  1541. memset((char *)obuf,0,dz->buflen * sizeof(float));
  1542. opos = 0;
  1543. }
  1544. }
  1545. samps_left = 1;
  1546. while(samps_left) { // Flush remaining buffers
  1547. samps_left = 0;
  1548. for(n = 0; n < ptrcnt; n++) {
  1549. nn = n % dz->itemcnt;
  1550. if(iptr[n] > 0 && iptr[n] < insampcnt) {
  1551. samps_left = 1;
  1552. break;
  1553. }
  1554. }
  1555. if(dz->iparam[CER_DELAY] > 0) {
  1556. for(n = 0, m= ptrcnt; n < ptrcnt; n++,m++) {
  1557. nn = n % dz->itemcnt;
  1558. if(iptr[m] > 0 && iptr[m] < insampcnt) {
  1559. samps_left++;
  1560. break;
  1561. }
  1562. }
  1563. }
  1564. if(!samps_left)
  1565. break;
  1566. for(n = 0; n < ptrcnt; n++) {
  1567. nn = n % dz->itemcnt;
  1568. if(iptr[n] > 0 && iptr[n] < insampcnt) {
  1569. obuf[opos + lmost[nn]] = (float)(obuf[opos + lmost[nn]] + (ibuf[iptr[n]] * llev[nn]));
  1570. obuf[opos + rmost[nn]] = (float)(obuf[opos + rmost[nn]] + (ibuf[iptr[n]] * rlev[nn]));
  1571. }
  1572. if(iptr[n] != 0)
  1573. iptr[n]++;
  1574. if(iptr[n] >= cyclen[nn])
  1575. iptr[n] = 0;
  1576. }
  1577. if(dz->iparam[CER_DELAY] > 0) {
  1578. for(n = 0, m= ptrcnt; n < ptrcnt; n++,m++) {
  1579. nn = n % dz->itemcnt;
  1580. lmst = (lmost[nn] + dz->iparam[CER_DSTEP]) % chans;
  1581. rmst = (lmst + 1) % chans;
  1582. if(iptr[m] >= 0 && iptr[m] < insampcnt) {
  1583. obuf[opos + lmst] = (float)(obuf[opos + lmst] + (ibuf[iptr[m]] * llev[nn]));
  1584. obuf[opos + rmst] = (float)(obuf[opos + rmst] + (ibuf[iptr[m]] * rlev[nn]));
  1585. }
  1586. if(iptr[m] != 0)
  1587. iptr[m]++;
  1588. if(iptr[m] >= cyclen[nn])
  1589. iptr[n] = 0;
  1590. }
  1591. }
  1592. opos += chans;
  1593. if(opos >= dz->buflen) {
  1594. if(normaliser < 1.0) {
  1595. for(n=0;n < dz->buflen;n++)
  1596. obuf[n] = (float)(obuf[n] * normaliser);
  1597. }
  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. }
  1604. if(opos >= 0) {
  1605. if(normaliser < 1.0) {
  1606. for(n=0;n < opos;n++)
  1607. obuf[n] = (float)(obuf[n] * normaliser);
  1608. }
  1609. if((exit_status = write_samps(obuf,opos,dz))<0)
  1610. return(exit_status);
  1611. }
  1612. return FINISHED;
  1613. }
  1614. /**************************** CREATE_CERACU_SNDBUFS ****************************/
  1615. int create_ceracu_sndbufs(dataptr dz)
  1616. {
  1617. int n, safety = 4;
  1618. unsigned int bigbufsize = 0;
  1619. float *bottom;
  1620. dz->bufcnt = 2;
  1621. if((dz->sampbuf = (float **)malloc(sizeof(float *) * (dz->bufcnt+1)))==NULL) {
  1622. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffers.\n");
  1623. return(MEMORY_ERROR);
  1624. }
  1625. if((dz->sbufptr = (float **)malloc(sizeof(float *) * dz->bufcnt))==NULL) {
  1626. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffer pointers.\n");
  1627. return(MEMORY_ERROR);
  1628. }
  1629. bigbufsize = (dz->insams[0] + safety) * sizeof(float);
  1630. dz->buflen = (512 * 512) * dz->iparam[CER_OCHANS];
  1631. bigbufsize += (dz->buflen + (safety * dz->iparam[NTEX_CHANS])) * sizeof(float);
  1632. if(bigbufsize < 0) {
  1633. sprintf(errstr,"Input sound too large.\n");
  1634. return(MEMORY_ERROR);
  1635. }
  1636. if((dz->bigbuf = (float *)malloc(bigbufsize)) == NULL) {
  1637. sprintf(errstr,"INSUFFICIENT MEMORY to create sound buffers.\n");
  1638. return(PROGRAM_ERROR);
  1639. }
  1640. bottom = dz->bigbuf;
  1641. for(n = 0;n<dz->infilecnt;n++) {
  1642. dz->sbufptr[n] = dz->sampbuf[n] = bottom;
  1643. bottom += dz->insams[n] + safety;
  1644. }
  1645. dz->sbufptr[n] = dz->sampbuf[n] = bottom;
  1646. return(FINISHED);
  1647. }
  1648. /************************ OPEN_THE_OUTFILE *********************/
  1649. int open_the_outfile(dataptr dz)
  1650. {
  1651. int exit_status;
  1652. dz->infile->channels = dz->iparam[CER_OCHANS];
  1653. if((exit_status = create_sized_outfile(dz->outfilename,dz))<0)
  1654. return(exit_status);
  1655. dz->infile->channels = 1;
  1656. return(FINISHED);
  1657. }