fractal.c 53 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360
  1. /*
  2. * Copyright (c) 1983-2013 Trevor Wishart and Composers Desktop Project Ltd
  3. * http://www.trevorwishart.co.uk
  4. * http://www.composersdesktop.com
  5. *
  6. This file is part of the CDP System.
  7. The CDP System is free software; you can redistribute it
  8. and/or modify it under the terms of the GNU Lesser General Public
  9. License as published by the Free Software Foundation; either
  10. version 2.1 of the License, or (at your option) any later version.
  11. The CDP System is distributed in the hope that it will be useful,
  12. but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. GNU Lesser General Public License for more details.
  15. You should have received a copy of the GNU Lesser General Public
  16. License along with the CDP System; if not, write to the Free Software
  17. Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  18. 02111-1307 USA
  19. *
  20. */
  21. #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. #ifdef unix
  41. #define round(x) lround((x))
  42. #endif
  43. #define maxfraccnt rampbrksize
  44. char errstr[2400];
  45. int anal_infiles = 1;
  46. int sloom = 0;
  47. int sloombatch = 0;
  48. const char* cdp_version = "6.1.0";
  49. //CDP LIB REPLACEMENTS
  50. static int check_fractal_param_validity_and_consistency(dataptr dz);
  51. static int setup_fractal_application(dataptr dz);
  52. static int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz);
  53. static int parse_infile_and_check_type(char **cmdline,dataptr dz);
  54. static int setup_fractal_param_ranges_and_defaults(dataptr dz);
  55. static int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz);
  56. static int setup_and_init_input_param_activity(dataptr dz,int tipc);
  57. static int setup_input_param_defaultval_stores(int tipc,aplptr ap);
  58. static int establish_application(dataptr dz);
  59. static int initialise_vflags(dataptr dz);
  60. static int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz);
  61. static int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz);
  62. static int mark_parameter_types(dataptr dz,aplptr ap);
  63. static int assign_file_data_storage(int infilecnt,dataptr dz);
  64. static int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q);
  65. static int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz);
  66. //static int get_the_mode_from_cmdline(char *str,dataptr dz);
  67. static int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt);
  68. static int float_array_for_fractal(int nnn,int n, float **ptr);
  69. static int generate_fractal_pattern(dataptr dz);
  70. static int create_fractal_sndbufs(dataptr dz);
  71. /**************************************** MAIN *********************************************/
  72. int main(int argc,char *argv[])
  73. {
  74. int exit_status;
  75. dataptr dz = NULL;
  76. char **cmdline;
  77. int cmdlinecnt;
  78. int n;
  79. aplptr ap;
  80. int is_launched = FALSE;
  81. if(argc==2 && (strcmp(argv[1],"--version") == 0)) {
  82. fprintf(stdout,"%s\n",cdp_version);
  83. fflush(stdout);
  84. return 0;
  85. }
  86. /* CHECK FOR SOUNDLOOM */
  87. if((sloom = sound_loom_in_use(&argc,&argv)) > 1) {
  88. sloom = 0;
  89. sloombatch = 1;
  90. }
  91. if(sflinit("cdp")){
  92. sfperror("cdp: initialisation\n");
  93. return(FAILED);
  94. }
  95. /* SET UP THE PRINCIPLE DATASTRUCTURE */
  96. if((exit_status = establish_datastructure(&dz))<0) { // CDP LIB
  97. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  98. return(FAILED);
  99. }
  100. if(!sloom) {
  101. if(argc == 1) {
  102. usage1();
  103. return(FAILED);
  104. } else if(argc == 2) {
  105. usage2(argv[1]);
  106. return(FAILED);
  107. }
  108. }
  109. if(!sloom) {
  110. if((exit_status = make_initial_cmdline_check(&argc,&argv))<0) { // CDP LIB
  111. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  112. return(FAILED);
  113. }
  114. cmdline = argv;
  115. cmdlinecnt = argc;
  116. if((get_the_process_no(argv[0],dz))<0)
  117. return(FAILED);
  118. cmdline++;
  119. cmdlinecnt--;
  120. dz->maxmode = 0;
  121. // get_the_mode_from_cmdline
  122. // setup_particular_application =
  123. if((exit_status = setup_fractal_application(dz))<0) {
  124. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  125. return(FAILED);
  126. }
  127. if((exit_status = count_and_allocate_for_infiles(cmdlinecnt,cmdline,dz))<0) { // CDP LIB
  128. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  129. return(FAILED);
  130. }
  131. } else {
  132. //parse_TK_data() =
  133. if((exit_status = parse_sloom_data(argc,argv,&cmdline,&cmdlinecnt,dz))<0) {
  134. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  135. return(exit_status);
  136. }
  137. }
  138. ap = dz->application;
  139. // parse_infile_and_hone_type() =
  140. if((exit_status = parse_infile_and_check_type(cmdline,dz))<0) {
  141. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  142. return(FAILED);
  143. }
  144. // setup_param_ranges_and_defaults() =
  145. if((exit_status = setup_fractal_param_ranges_and_defaults(dz))<0) {
  146. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  147. return(FAILED);
  148. }
  149. // open_first_infile CDP LIB
  150. if((exit_status = open_first_infile(cmdline[0],dz))<0) {
  151. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  152. return(FAILED);
  153. }
  154. cmdlinecnt--;
  155. cmdline++;
  156. // handle_extra_infiles() : redundant
  157. // handle_outfile() =
  158. if((exit_status = handle_the_outfile(&cmdlinecnt,&cmdline,dz))<0) {
  159. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  160. return(FAILED);
  161. }
  162. // handle_formants() redundant
  163. // handle_formant_quiksearch() redundant
  164. // handle_special_data() redundant
  165. if((exit_status = read_parameters_and_flags(&cmdline,&cmdlinecnt,dz))<0) { // CDP LIB
  166. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  167. return(FAILED);
  168. }
  169. // check_param_validity_and_consistency....
  170. if((exit_status = check_fractal_param_validity_and_consistency(dz))<0) {
  171. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  172. return(FAILED);
  173. }
  174. is_launched = TRUE;
  175. dz->bufcnt = 3;
  176. if((dz->sampbuf = (float **)malloc(sizeof(float *) * (dz->bufcnt+1)))==NULL) {
  177. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffers.\n");
  178. return(MEMORY_ERROR);
  179. }
  180. if((dz->sbufptr = (float **)malloc(sizeof(float *) * dz->bufcnt))==NULL) {
  181. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffer pointers.\n");
  182. return(MEMORY_ERROR);
  183. }
  184. for(n = 0;n <dz->bufcnt; n++)
  185. dz->sampbuf[n] = dz->sbufptr[n] = (float *)0;
  186. dz->sampbuf[n] = (float *)0;
  187. if((exit_status = create_fractal_sndbufs(dz))<0) { // CDP LIB
  188. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  189. return(FAILED);
  190. }
  191. //param_preprocess() redundant
  192. //spec_process_file =
  193. if((exit_status = generate_fractal_pattern(dz))<0) {
  194. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  195. return(FAILED);
  196. }
  197. if((exit_status = complete_output(dz))<0) { // CDP LIB
  198. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  199. return(FAILED);
  200. }
  201. exit_status = print_messages_and_close_sndfiles(FINISHED,is_launched,dz); // CDP LIB
  202. free(dz);
  203. return(SUCCEEDED);
  204. }
  205. /**********************************************
  206. REPLACED CDP LIB FUNCTIONS
  207. **********************************************/
  208. /****************************** SET_PARAM_DATA *********************************/
  209. int set_param_data(aplptr ap, int special_data,int maxparamcnt,int paramcnt,char *paramlist)
  210. {
  211. ap->special_data = (char)special_data;
  212. ap->param_cnt = (char)paramcnt;
  213. ap->max_param_cnt = (char)maxparamcnt;
  214. if(ap->max_param_cnt>0) {
  215. if((ap->param_list = (char *)malloc((size_t)(ap->max_param_cnt+1)))==NULL) {
  216. sprintf(errstr,"INSUFFICIENT MEMORY: for param_list\n");
  217. return(MEMORY_ERROR);
  218. }
  219. strcpy(ap->param_list,paramlist);
  220. }
  221. return(FINISHED);
  222. }
  223. /****************************** SET_VFLGS *********************************/
  224. int set_vflgs
  225. (aplptr ap,char *optflags,int optcnt,char *optlist,char *varflags,int vflagcnt, int vparamcnt,char *varlist)
  226. {
  227. ap->option_cnt = (char) optcnt; /*RWD added cast */
  228. if(optcnt) {
  229. if((ap->option_list = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  230. sprintf(errstr,"INSUFFICIENT MEMORY: for option_list\n");
  231. return(MEMORY_ERROR);
  232. }
  233. strcpy(ap->option_list,optlist);
  234. if((ap->option_flags = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  235. sprintf(errstr,"INSUFFICIENT MEMORY: for option_flags\n");
  236. return(MEMORY_ERROR);
  237. }
  238. strcpy(ap->option_flags,optflags);
  239. }
  240. ap->vflag_cnt = (char) vflagcnt;
  241. ap->variant_param_cnt = (char) vparamcnt;
  242. if(vflagcnt) {
  243. if((ap->variant_list = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  244. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_list\n");
  245. return(MEMORY_ERROR);
  246. }
  247. strcpy(ap->variant_list,varlist);
  248. if((ap->variant_flags = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  249. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_flags\n");
  250. return(MEMORY_ERROR);
  251. }
  252. strcpy(ap->variant_flags,varflags);
  253. }
  254. return(FINISHED);
  255. }
  256. /***************************** APPLICATION_INIT **************************/
  257. int application_init(dataptr dz)
  258. {
  259. int exit_status;
  260. int storage_cnt;
  261. int tipc, brkcnt;
  262. aplptr ap = dz->application;
  263. if(ap->vflag_cnt>0)
  264. initialise_vflags(dz);
  265. tipc = ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt;
  266. ap->total_input_param_cnt = (char)tipc;
  267. if(tipc>0) {
  268. if((exit_status = setup_input_param_range_stores(tipc,ap))<0)
  269. return(exit_status);
  270. if((exit_status = setup_input_param_defaultval_stores(tipc,ap))<0)
  271. return(exit_status);
  272. if((exit_status = setup_and_init_input_param_activity(dz,tipc))<0)
  273. return(exit_status);
  274. }
  275. brkcnt = tipc;
  276. //THERE ARE NO INPUTFILE brktables USED IN THIS PROCESS
  277. if(brkcnt>0) {
  278. if((exit_status = setup_and_init_input_brktable_constants(dz,brkcnt))<0)
  279. return(exit_status);
  280. }
  281. if((storage_cnt = tipc + ap->internal_param_cnt)>0) {
  282. if((exit_status = setup_parameter_storage_and_constants(storage_cnt,dz))<0)
  283. return(exit_status);
  284. if((exit_status = initialise_is_int_and_no_brk_constants(storage_cnt,dz))<0)
  285. return(exit_status);
  286. }
  287. if((exit_status = mark_parameter_types(dz,ap))<0)
  288. return(exit_status);
  289. // establish_infile_constants() replaced by
  290. dz->infilecnt = 1;
  291. //establish_bufptrs_and_extra_buffers():
  292. return(FINISHED);
  293. }
  294. /********************** SETUP_PARAMETER_STORAGE_AND_CONSTANTS ********************/
  295. /* RWD mallo changed to calloc; helps debug verison run as release! */
  296. int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz)
  297. {
  298. if((dz->param = (double *)calloc(storage_cnt, sizeof(double)))==NULL) {
  299. sprintf(errstr,"setup_parameter_storage_and_constants(): 1\n");
  300. return(MEMORY_ERROR);
  301. }
  302. if((dz->iparam = (int *)calloc(storage_cnt, sizeof(int) ))==NULL) {
  303. sprintf(errstr,"setup_parameter_storage_and_constants(): 2\n");
  304. return(MEMORY_ERROR);
  305. }
  306. if((dz->is_int = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  307. sprintf(errstr,"setup_parameter_storage_and_constants(): 3\n");
  308. return(MEMORY_ERROR);
  309. }
  310. if((dz->no_brk = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  311. sprintf(errstr,"setup_parameter_storage_and_constants(): 5\n");
  312. return(MEMORY_ERROR);
  313. }
  314. return(FINISHED);
  315. }
  316. /************** INITIALISE_IS_INT_AND_NO_BRK_CONSTANTS *****************/
  317. int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz)
  318. {
  319. int n;
  320. for(n=0;n<storage_cnt;n++) {
  321. dz->is_int[n] = (char)0;
  322. dz->no_brk[n] = (char)0;
  323. }
  324. return(FINISHED);
  325. }
  326. /***************************** MARK_PARAMETER_TYPES **************************/
  327. int mark_parameter_types(dataptr dz,aplptr ap)
  328. {
  329. int n, m; /* PARAMS */
  330. for(n=0;n<ap->max_param_cnt;n++) {
  331. switch(ap->param_list[n]) {
  332. case('0'): break; /* dz->is_active[n] = 0 is default */
  333. case('i'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1;dz->no_brk[n] = (char)1; break;
  334. case('I'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1; break;
  335. case('d'): dz->is_active[n] = (char)1; dz->no_brk[n] = (char)1; break;
  336. case('D'): dz->is_active[n] = (char)1; /* normal case: double val or brkpnt file */ break;
  337. default:
  338. sprintf(errstr,"Programming error: invalid parameter type in mark_parameter_types()\n");
  339. return(PROGRAM_ERROR);
  340. }
  341. } /* OPTIONS */
  342. for(n=0,m=ap->max_param_cnt;n<ap->option_cnt;n++,m++) {
  343. switch(ap->option_list[n]) {
  344. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  345. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  346. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  347. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  348. default:
  349. sprintf(errstr,"Programming error: invalid option type in mark_parameter_types()\n");
  350. return(PROGRAM_ERROR);
  351. }
  352. } /* VARIANTS */
  353. for(n=0,m=ap->max_param_cnt + ap->option_cnt;n < ap->variant_param_cnt; n++, m++) {
  354. switch(ap->variant_list[n]) {
  355. case('0'): break;
  356. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  357. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  358. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  359. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  360. default:
  361. sprintf(errstr,"Programming error: invalid variant type in mark_parameter_types()\n");
  362. return(PROGRAM_ERROR);
  363. }
  364. } /* INTERNAL */
  365. for(n=0,
  366. m=ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt; n<ap->internal_param_cnt; n++,m++) {
  367. switch(ap->internal_param_list[n]) {
  368. case('0'): break; /* dummy variables: variables not used: but important for internal paream numbering!! */
  369. case('i'): dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  370. case('d'): dz->no_brk[m] = (char)1; break;
  371. default:
  372. sprintf(errstr,"Programming error: invalid internal param type in mark_parameter_types()\n");
  373. return(PROGRAM_ERROR);
  374. }
  375. }
  376. return(FINISHED);
  377. }
  378. /************************ HANDLE_THE_OUTFILE *********************/
  379. int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz)
  380. {
  381. int exit_status;
  382. char *filename = (*cmdline)[0];
  383. if(filename[0]=='-' && filename[1]=='f') {
  384. dz->floatsam_output = 1;
  385. dz->true_outfile_stype = SAMP_FLOAT;
  386. filename+= 2;
  387. }
  388. if(!sloom) {
  389. if(file_has_invalid_startchar(filename) || value_is_numeric(filename)) {
  390. sprintf(errstr,"Outfile name %s has invalid start character(s) or looks too much like a number.\n",filename);
  391. return(DATA_ERROR);
  392. }
  393. }
  394. strcpy(dz->outfilename,filename);
  395. if((exit_status = create_sized_outfile(filename,dz))<0)
  396. return(exit_status);
  397. (*cmdline)++;
  398. (*cmdlinecnt)--;
  399. return(FINISHED);
  400. }
  401. /***************************** ESTABLISH_APPLICATION **************************/
  402. int establish_application(dataptr dz)
  403. {
  404. aplptr ap;
  405. if((dz->application = (aplptr)malloc(sizeof (struct applic)))==NULL) {
  406. sprintf(errstr,"establish_application()\n");
  407. return(MEMORY_ERROR);
  408. }
  409. ap = dz->application;
  410. memset((char *)ap,0,sizeof(struct applic));
  411. return(FINISHED);
  412. }
  413. /************************* INITIALISE_VFLAGS *************************/
  414. int initialise_vflags(dataptr dz)
  415. {
  416. int n;
  417. if((dz->vflag = (char *)malloc(dz->application->vflag_cnt * sizeof(char)))==NULL) {
  418. sprintf(errstr,"INSUFFICIENT MEMORY: vflag store,\n");
  419. return(MEMORY_ERROR);
  420. }
  421. for(n=0;n<dz->application->vflag_cnt;n++)
  422. dz->vflag[n] = FALSE;
  423. return FINISHED;
  424. }
  425. /************************* SETUP_INPUT_PARAM_DEFAULTVALS *************************/
  426. int setup_input_param_defaultval_stores(int tipc,aplptr ap)
  427. {
  428. int n;
  429. if((ap->default_val = (double *)malloc(tipc * sizeof(double)))==NULL) {
  430. sprintf(errstr,"INSUFFICIENT MEMORY for application default values store\n");
  431. return(MEMORY_ERROR);
  432. }
  433. for(n=0;n<tipc;n++)
  434. ap->default_val[n] = 0.0;
  435. return(FINISHED);
  436. }
  437. /***************************** SETUP_AND_INIT_INPUT_PARAM_ACTIVITY **************************/
  438. int setup_and_init_input_param_activity(dataptr dz,int tipc)
  439. {
  440. int n;
  441. if((dz->is_active = (char *)malloc((size_t)tipc))==NULL) {
  442. sprintf(errstr,"setup_and_init_input_param_activity()\n");
  443. return(MEMORY_ERROR);
  444. }
  445. for(n=0;n<tipc;n++)
  446. dz->is_active[n] = (char)0;
  447. return(FINISHED);
  448. }
  449. /************************* SETUP_FRACTAL_APPLICATION *******************/
  450. int setup_fractal_application(dataptr dz)
  451. {
  452. int exit_status;
  453. aplptr ap;
  454. if((exit_status = establish_application(dz))<0) // GLOBAL
  455. return(FAILED);
  456. ap = dz->application;
  457. // SEE parstruct FOR EXPLANATION of next 2 functions
  458. if((exit_status = set_param_data(ap,0 ,1,1,"i"))<0)
  459. return(FAILED);
  460. if((exit_status = set_vflgs(ap,"s",1,"i","",0,0,""))<0)
  461. return(FAILED);
  462. // set_legal_infile_structure -->
  463. dz->has_otherfile = FALSE;
  464. // assign_process_logic -->
  465. dz->input_data_type = SNDFILES_ONLY;
  466. dz->process_type = UNEQUAL_SNDFILE;
  467. dz->outfiletype = SNDFILE_OUT;
  468. return application_init(dz); //GLOBAL
  469. }
  470. /************************* PARSE_INFILE_AND_CHECK_TYPE *******************/
  471. int parse_infile_and_check_type(char **cmdline,dataptr dz)
  472. {
  473. int exit_status;
  474. infileptr infile_info;
  475. if(!sloom) {
  476. if((infile_info = (infileptr)malloc(sizeof(struct filedata)))==NULL) {
  477. sprintf(errstr,"INSUFFICIENT MEMORY for infile structure to test file data.");
  478. return(MEMORY_ERROR);
  479. } else if((exit_status = cdparse(cmdline[0],infile_info))<0) {
  480. sprintf(errstr,"Failed to parse input file %s\n",cmdline[0]);
  481. return(PROGRAM_ERROR);
  482. } else if(infile_info->filetype != SNDFILE) {
  483. sprintf(errstr,"File %s is not of correct type\n",cmdline[0]);
  484. return(DATA_ERROR);
  485. } else if((exit_status = copy_parse_info_to_main_structure(infile_info,dz))<0) {
  486. sprintf(errstr,"Failed to copy file parsing information\n");
  487. return(PROGRAM_ERROR);
  488. }
  489. free(infile_info);
  490. }
  491. return(FINISHED);
  492. }
  493. /************************* SETUP_FRACTAL_PARAM_RANGES_AND_DEFAULTS *******************/
  494. int setup_fractal_param_ranges_and_defaults(dataptr dz)
  495. {
  496. int exit_status;
  497. aplptr ap = dz->application;
  498. // set_param_ranges()
  499. ap->total_input_param_cnt = (char)(ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt);
  500. // NB total_input_param_cnt is > 0 !!!
  501. if((exit_status = setup_input_param_range_stores(ap->total_input_param_cnt,ap))<0)
  502. return(FAILED);
  503. // get_param_ranges()
  504. ap->lo[0] = 2;
  505. ap->hi[0] = 100;
  506. ap->default_val[0] = 8;
  507. ap->lo[1] = 2;
  508. ap->hi[1] = 50;
  509. ap->default_val[1] = 15;
  510. dz->maxmode = 0;
  511. if(!sloom)
  512. put_default_vals_in_all_params(dz);
  513. return(FINISHED);
  514. }
  515. /********************************* PARSE_SLOOM_DATA *********************************/
  516. int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz)
  517. {
  518. int exit_status;
  519. int cnt = 1, infilecnt;
  520. int filesize, insams, inbrksize;
  521. double dummy;
  522. int true_cnt = 0;
  523. aplptr ap;
  524. while(cnt<=PRE_CMDLINE_DATACNT) {
  525. if(cnt > argc) {
  526. sprintf(errstr,"Insufficient data sent from TK\n");
  527. return(DATA_ERROR);
  528. }
  529. switch(cnt) {
  530. case(1):
  531. if(sscanf(argv[cnt],"%d",&dz->process)!=1) {
  532. sprintf(errstr,"Cannot read process no. sent from TK\n");
  533. return(DATA_ERROR);
  534. }
  535. break;
  536. case(2):
  537. if(sscanf(argv[cnt],"%d",&dz->mode)!=1) {
  538. sprintf(errstr,"Cannot read mode no. sent from TK\n");
  539. return(DATA_ERROR);
  540. }
  541. if(dz->mode > 0)
  542. dz->mode--;
  543. //setup_particular_application() =
  544. if((exit_status = setup_fractal_application(dz))<0)
  545. return(exit_status);
  546. ap = dz->application;
  547. break;
  548. case(3):
  549. if(sscanf(argv[cnt],"%d",&infilecnt)!=1) {
  550. sprintf(errstr,"Cannot read infilecnt sent from TK\n");
  551. return(DATA_ERROR);
  552. }
  553. if(infilecnt < 1) {
  554. true_cnt = cnt + 1;
  555. cnt = PRE_CMDLINE_DATACNT; /* force exit from loop after assign_file_data_storage */
  556. }
  557. if((exit_status = assign_file_data_storage(infilecnt,dz))<0)
  558. return(exit_status);
  559. break;
  560. case(INPUT_FILETYPE+4):
  561. if(sscanf(argv[cnt],"%d",&dz->infile->filetype)!=1) {
  562. sprintf(errstr,"Cannot read filetype sent from TK (%s)\n",argv[cnt]);
  563. return(DATA_ERROR);
  564. }
  565. break;
  566. case(INPUT_FILESIZE+4):
  567. if(sscanf(argv[cnt],"%d",&filesize)!=1) {
  568. sprintf(errstr,"Cannot read infilesize sent from TK\n");
  569. return(DATA_ERROR);
  570. }
  571. dz->insams[0] = filesize;
  572. break;
  573. case(INPUT_INSAMS+4):
  574. if(sscanf(argv[cnt],"%d",&insams)!=1) {
  575. sprintf(errstr,"Cannot read insams sent from TK\n");
  576. return(DATA_ERROR);
  577. }
  578. dz->insams[0] = insams;
  579. break;
  580. case(INPUT_SRATE+4):
  581. if(sscanf(argv[cnt],"%d",&dz->infile->srate)!=1) {
  582. sprintf(errstr,"Cannot read srate sent from TK\n");
  583. return(DATA_ERROR);
  584. }
  585. break;
  586. case(INPUT_CHANNELS+4):
  587. if(sscanf(argv[cnt],"%d",&dz->infile->channels)!=1) {
  588. sprintf(errstr,"Cannot read channels sent from TK\n");
  589. return(DATA_ERROR);
  590. }
  591. break;
  592. case(INPUT_STYPE+4):
  593. if(sscanf(argv[cnt],"%d",&dz->infile->stype)!=1) {
  594. sprintf(errstr,"Cannot read stype sent from TK\n");
  595. return(DATA_ERROR);
  596. }
  597. break;
  598. case(INPUT_ORIGSTYPE+4):
  599. if(sscanf(argv[cnt],"%d",&dz->infile->origstype)!=1) {
  600. sprintf(errstr,"Cannot read origstype sent from TK\n");
  601. return(DATA_ERROR);
  602. }
  603. break;
  604. case(INPUT_ORIGRATE+4):
  605. if(sscanf(argv[cnt],"%d",&dz->infile->origrate)!=1) {
  606. sprintf(errstr,"Cannot read origrate sent from TK\n");
  607. return(DATA_ERROR);
  608. }
  609. break;
  610. case(INPUT_MLEN+4):
  611. if(sscanf(argv[cnt],"%d",&dz->infile->Mlen)!=1) {
  612. sprintf(errstr,"Cannot read Mlen sent from TK\n");
  613. return(DATA_ERROR);
  614. }
  615. break;
  616. case(INPUT_DFAC+4):
  617. if(sscanf(argv[cnt],"%d",&dz->infile->Dfac)!=1) {
  618. sprintf(errstr,"Cannot read Dfac sent from TK\n");
  619. return(DATA_ERROR);
  620. }
  621. break;
  622. case(INPUT_ORIGCHANS+4):
  623. if(sscanf(argv[cnt],"%d",&dz->infile->origchans)!=1) {
  624. sprintf(errstr,"Cannot read origchans sent from TK\n");
  625. return(DATA_ERROR);
  626. }
  627. break;
  628. case(INPUT_SPECENVCNT+4):
  629. if(sscanf(argv[cnt],"%d",&dz->infile->specenvcnt)!=1) {
  630. sprintf(errstr,"Cannot read specenvcnt sent from TK\n");
  631. return(DATA_ERROR);
  632. }
  633. dz->specenvcnt = dz->infile->specenvcnt;
  634. break;
  635. case(INPUT_WANTED+4):
  636. if(sscanf(argv[cnt],"%d",&dz->wanted)!=1) {
  637. sprintf(errstr,"Cannot read wanted sent from TK\n");
  638. return(DATA_ERROR);
  639. }
  640. break;
  641. case(INPUT_WLENGTH+4):
  642. if(sscanf(argv[cnt],"%d",&dz->wlength)!=1) {
  643. sprintf(errstr,"Cannot read wlength sent from TK\n");
  644. return(DATA_ERROR);
  645. }
  646. break;
  647. case(INPUT_OUT_CHANS+4):
  648. if(sscanf(argv[cnt],"%d",&dz->out_chans)!=1) {
  649. sprintf(errstr,"Cannot read out_chans sent from TK\n");
  650. return(DATA_ERROR);
  651. }
  652. break;
  653. /* RWD these chanegs to samps - tk will have to deal with that! */
  654. case(INPUT_DESCRIPTOR_BYTES+4):
  655. if(sscanf(argv[cnt],"%d",&dz->descriptor_samps)!=1) {
  656. sprintf(errstr,"Cannot read descriptor_samps sent from TK\n");
  657. return(DATA_ERROR);
  658. }
  659. break;
  660. case(INPUT_IS_TRANSPOS+4):
  661. if(sscanf(argv[cnt],"%d",&dz->is_transpos)!=1) {
  662. sprintf(errstr,"Cannot read is_transpos sent from TK\n");
  663. return(DATA_ERROR);
  664. }
  665. break;
  666. case(INPUT_COULD_BE_TRANSPOS+4):
  667. if(sscanf(argv[cnt],"%d",&dz->could_be_transpos)!=1) {
  668. sprintf(errstr,"Cannot read could_be_transpos sent from TK\n");
  669. return(DATA_ERROR);
  670. }
  671. break;
  672. case(INPUT_COULD_BE_PITCH+4):
  673. if(sscanf(argv[cnt],"%d",&dz->could_be_pitch)!=1) {
  674. sprintf(errstr,"Cannot read could_be_pitch sent from TK\n");
  675. return(DATA_ERROR);
  676. }
  677. break;
  678. case(INPUT_DIFFERENT_SRATES+4):
  679. if(sscanf(argv[cnt],"%d",&dz->different_srates)!=1) {
  680. sprintf(errstr,"Cannot read different_srates sent from TK\n");
  681. return(DATA_ERROR);
  682. }
  683. break;
  684. case(INPUT_DUPLICATE_SNDS+4):
  685. if(sscanf(argv[cnt],"%d",&dz->duplicate_snds)!=1) {
  686. sprintf(errstr,"Cannot read duplicate_snds sent from TK\n");
  687. return(DATA_ERROR);
  688. }
  689. break;
  690. case(INPUT_BRKSIZE+4):
  691. if(sscanf(argv[cnt],"%d",&inbrksize)!=1) {
  692. sprintf(errstr,"Cannot read brksize sent from TK\n");
  693. return(DATA_ERROR);
  694. }
  695. if(inbrksize > 0) {
  696. switch(dz->input_data_type) {
  697. case(WORDLIST_ONLY):
  698. break;
  699. case(PITCH_AND_PITCH):
  700. case(PITCH_AND_TRANSPOS):
  701. case(TRANSPOS_AND_TRANSPOS):
  702. dz->tempsize = inbrksize;
  703. break;
  704. case(BRKFILES_ONLY):
  705. case(UNRANGED_BRKFILE_ONLY):
  706. case(DB_BRKFILES_ONLY):
  707. case(ALL_FILES):
  708. case(ANY_NUMBER_OF_ANY_FILES):
  709. if(dz->extrabrkno < 0) {
  710. sprintf(errstr,"Storage location number for brktable not established by CDP.\n");
  711. return(DATA_ERROR);
  712. }
  713. if(dz->brksize == NULL) {
  714. sprintf(errstr,"CDP has not established storage space for input brktable.\n");
  715. return(PROGRAM_ERROR);
  716. }
  717. dz->brksize[dz->extrabrkno] = inbrksize;
  718. break;
  719. default:
  720. sprintf(errstr,"TK sent brktablesize > 0 for input_data_type [%d] not using brktables.\n",
  721. dz->input_data_type);
  722. return(PROGRAM_ERROR);
  723. }
  724. break;
  725. }
  726. break;
  727. case(INPUT_NUMSIZE+4):
  728. if(sscanf(argv[cnt],"%d",&dz->numsize)!=1) {
  729. sprintf(errstr,"Cannot read numsize sent from TK\n");
  730. return(DATA_ERROR);
  731. }
  732. break;
  733. case(INPUT_LINECNT+4):
  734. if(sscanf(argv[cnt],"%d",&dz->linecnt)!=1) {
  735. sprintf(errstr,"Cannot read linecnt sent from TK\n");
  736. return(DATA_ERROR);
  737. }
  738. break;
  739. case(INPUT_ALL_WORDS+4):
  740. if(sscanf(argv[cnt],"%d",&dz->all_words)!=1) {
  741. sprintf(errstr,"Cannot read all_words sent from TK\n");
  742. return(DATA_ERROR);
  743. }
  744. break;
  745. case(INPUT_ARATE+4):
  746. if(sscanf(argv[cnt],"%f",&dz->infile->arate)!=1) {
  747. sprintf(errstr,"Cannot read arate sent from TK\n");
  748. return(DATA_ERROR);
  749. }
  750. break;
  751. case(INPUT_FRAMETIME+4):
  752. if(sscanf(argv[cnt],"%lf",&dummy)!=1) {
  753. sprintf(errstr,"Cannot read frametime sent from TK\n");
  754. return(DATA_ERROR);
  755. }
  756. dz->frametime = (float)dummy;
  757. break;
  758. case(INPUT_WINDOW_SIZE+4):
  759. if(sscanf(argv[cnt],"%f",&dz->infile->window_size)!=1) {
  760. sprintf(errstr,"Cannot read window_size sent from TK\n");
  761. return(DATA_ERROR);
  762. }
  763. break;
  764. case(INPUT_NYQUIST+4):
  765. if(sscanf(argv[cnt],"%lf",&dz->nyquist)!=1) {
  766. sprintf(errstr,"Cannot read nyquist sent from TK\n");
  767. return(DATA_ERROR);
  768. }
  769. break;
  770. case(INPUT_DURATION+4):
  771. if(sscanf(argv[cnt],"%lf",&dz->duration)!=1) {
  772. sprintf(errstr,"Cannot read duration sent from TK\n");
  773. return(DATA_ERROR);
  774. }
  775. break;
  776. case(INPUT_MINBRK+4):
  777. if(sscanf(argv[cnt],"%lf",&dz->minbrk)!=1) {
  778. sprintf(errstr,"Cannot read minbrk sent from TK\n");
  779. return(DATA_ERROR);
  780. }
  781. break;
  782. case(INPUT_MAXBRK+4):
  783. if(sscanf(argv[cnt],"%lf",&dz->maxbrk)!=1) {
  784. sprintf(errstr,"Cannot read maxbrk sent from TK\n");
  785. return(DATA_ERROR);
  786. }
  787. break;
  788. case(INPUT_MINNUM+4):
  789. if(sscanf(argv[cnt],"%lf",&dz->minnum)!=1) {
  790. sprintf(errstr,"Cannot read minnum sent from TK\n");
  791. return(DATA_ERROR);
  792. }
  793. break;
  794. case(INPUT_MAXNUM+4):
  795. if(sscanf(argv[cnt],"%lf",&dz->maxnum)!=1) {
  796. sprintf(errstr,"Cannot read maxnum sent from TK\n");
  797. return(DATA_ERROR);
  798. }
  799. break;
  800. default:
  801. sprintf(errstr,"case switch item missing: parse_sloom_data()\n");
  802. return(PROGRAM_ERROR);
  803. }
  804. cnt++;
  805. }
  806. if(cnt!=PRE_CMDLINE_DATACNT+1) {
  807. sprintf(errstr,"Insufficient pre-cmdline params sent from TK\n");
  808. return(DATA_ERROR);
  809. }
  810. if(true_cnt)
  811. cnt = true_cnt;
  812. *cmdlinecnt = 0;
  813. while(cnt < argc) {
  814. if((exit_status = get_tk_cmdline_word(cmdlinecnt,cmdline,argv[cnt]))<0)
  815. return(exit_status);
  816. cnt++;
  817. }
  818. return(FINISHED);
  819. }
  820. /********************************* GET_TK_CMDLINE_WORD *********************************/
  821. int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q)
  822. {
  823. if(*cmdlinecnt==0) {
  824. if((*cmdline = (char **)malloc(sizeof(char *)))==NULL) {
  825. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  826. return(MEMORY_ERROR);
  827. }
  828. } else {
  829. if((*cmdline = (char **)realloc(*cmdline,((*cmdlinecnt)+1) * sizeof(char *)))==NULL) {
  830. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  831. return(MEMORY_ERROR);
  832. }
  833. }
  834. if(((*cmdline)[*cmdlinecnt] = (char *)malloc((strlen(q) + 1) * sizeof(char)))==NULL) {
  835. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline item %d.\n",(*cmdlinecnt)+1);
  836. return(MEMORY_ERROR);
  837. }
  838. strcpy((*cmdline)[*cmdlinecnt],q);
  839. (*cmdlinecnt)++;
  840. return(FINISHED);
  841. }
  842. /****************************** ASSIGN_FILE_DATA_STORAGE *********************************/
  843. int assign_file_data_storage(int infilecnt,dataptr dz)
  844. {
  845. int exit_status;
  846. int no_sndfile_system_files = FALSE;
  847. dz->infilecnt = infilecnt;
  848. if((exit_status = allocate_filespace(dz))<0)
  849. return(exit_status);
  850. if(no_sndfile_system_files)
  851. dz->infilecnt = 0;
  852. return(FINISHED);
  853. }
  854. /************************* redundant functions: to ensure libs compile OK *******************/
  855. int assign_process_logic(dataptr dz)
  856. {
  857. return(FINISHED);
  858. }
  859. void set_legal_infile_structure(dataptr dz)
  860. {}
  861. int set_legal_internalparam_structure(int process,int mode,aplptr ap)
  862. {
  863. return(FINISHED);
  864. }
  865. int setup_internal_arrays_and_array_pointers(dataptr dz)
  866. {
  867. return(FINISHED);
  868. }
  869. int establish_bufptrs_and_extra_buffers(dataptr dz)
  870. {
  871. return(FINISHED);
  872. }
  873. int read_special_data(char *str,dataptr dz)
  874. {
  875. return(FINISHED);
  876. }
  877. int inner_loop
  878. (int *peakscore,int *descnt,int *in_start_portion,int *least,int *pitchcnt,int windows_in_buf,dataptr dz)
  879. {
  880. return(FINISHED);
  881. }
  882. int get_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  883. {
  884. return(FINISHED);
  885. }
  886. /******************************** USAGE1 ********************************/
  887. int usage1(void)
  888. {
  889. usage2("fractal");
  890. return(USAGE_ONLY);
  891. }
  892. /**************************** CHECK_FRACTAL_PARAM_VALIDITY_AND_CONSISTENCY *****************************/
  893. int check_fractal_param_validity_and_consistency(dataptr dz)
  894. {
  895. int gpsamplen, minfracsize, maxsegcnt, maxcutcnt;
  896. gpsamplen = dz->insams[0]/dz->infile->channels; // Length of file in sample-groups
  897. dz->iparam[FRACSPLICE] = (int)round(dz->param[FRACSPLICE] * MS_TO_SECS * dz->infile->srate);
  898. minfracsize = dz->iparam[FRACSPLICE] * 3; // Assume splicelen is in groupsamples
  899. // Assume min size = 3 X splicelen
  900. maxsegcnt = (int)floor((double)gpsamplen/(double)(minfracsize));// Number of segments obtained by cutting file into minlength chunks
  901. maxcutcnt = 1;
  902. dz->maxfraccnt = 2; // Count how many successive cuts-in-half are needed
  903. while(dz->maxfraccnt < maxsegcnt) { // To generate NO MORE THAN maxfraccnt segments.
  904. dz->maxfraccnt *= 2;
  905. maxcutcnt++; // calculate the maximum number of divisions by 2
  906. } // which will fit INSIDE the maxsegcnt
  907. dz->maxfraccnt /= 2;
  908. maxcutcnt--;
  909. if(dz->iparam[FRACDEPTH] > maxcutcnt) {
  910. sprintf(errstr,"INFO: Maximum number of fractal cuts for this file = %d\n",maxcutcnt);
  911. return DATA_ERROR;
  912. }
  913. return FINISHED;
  914. }
  915. /********************************************************************************************/
  916. int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  917. {
  918. if(!strcmp(prog_identifier_from_cmdline,"fractal")) dz->process = FRACTAL;
  919. else {
  920. sprintf(errstr,"Unknown program identification string '%s'\n",prog_identifier_from_cmdline);
  921. return(USAGE_ONLY);
  922. }
  923. return(FINISHED);
  924. }
  925. /******************************** SETUP_AND_INIT_INPUT_BRKTABLE_CONSTANTS ********************************/
  926. int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt)
  927. {
  928. int n;
  929. if((dz->brk = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  930. sprintf(errstr,"setup_and_init_input_brktable_constants(): 1\n");
  931. return(MEMORY_ERROR);
  932. }
  933. if((dz->brkptr = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  934. sprintf(errstr,"setup_and_init_input_brktable_constants(): 6\n");
  935. return(MEMORY_ERROR);
  936. }
  937. if((dz->brksize = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  938. sprintf(errstr,"setup_and_init_input_brktable_constants(): 2\n");
  939. return(MEMORY_ERROR);
  940. }
  941. if((dz->firstval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  942. sprintf(errstr,"setup_and_init_input_brktable_constants(): 3\n");
  943. return(MEMORY_ERROR);
  944. }
  945. if((dz->lastind = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  946. sprintf(errstr,"setup_and_init_input_brktable_constants(): 4\n");
  947. return(MEMORY_ERROR);
  948. }
  949. if((dz->lastval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  950. sprintf(errstr,"setup_and_init_input_brktable_constants(): 5\n");
  951. return(MEMORY_ERROR);
  952. }
  953. if((dz->brkinit = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  954. sprintf(errstr,"setup_and_init_input_brktable_constants(): 7\n");
  955. return(MEMORY_ERROR);
  956. }
  957. for(n=0;n<brkcnt;n++) {
  958. dz->brk[n] = NULL;
  959. dz->brkptr[n] = NULL;
  960. dz->brkinit[n] = 0;
  961. dz->brksize[n] = 0;
  962. }
  963. return(FINISHED);
  964. }
  965. /******************************** USAGE2 ********************************/
  966. int usage2(char *str)
  967. {
  968. if(!strcmp(str,"fractal")) {
  969. fprintf(stderr,
  970. "USAGE:\n"
  971. "fractal fractal infile outfile layers [-ssplicelen]\n"
  972. "\n"
  973. "Create fractalised version of sound.\n"
  974. "\n"
  975. "SPLICELEN Length of splices in mS.\n"
  976. "\n"
  977. "LAYERS Number of fractal layers in the output sound.\n"
  978. " Note that the maximum number of layers possible\n"
  979. " depends on the duration of the input sound\n"
  980. " and the size of splices used\n"
  981. " and cannot be easily predicted in advance\n"
  982. "\n"
  983. "WARNINGS\n"
  984. "(1) Specifying many layers will produce very long output sounds.\n"
  985. "(2) Don't use very long input sounds, or you will run out of memory,\n"
  986. "\n");
  987. } else
  988. fprintf(stdout,"Unknown option '%s'\n",str);
  989. return(USAGE_ONLY);
  990. }
  991. int usage3(char *str1,char *str2)
  992. {
  993. fprintf(stderr,"Insufficient parameters on command line.\n");
  994. return(USAGE_ONLY);
  995. }
  996. /************************** GENERATE_FRACTAL_PATTERN *************************/
  997. int generate_fractal_pattern(dataptr dz)
  998. {
  999. int exit_status, chans, segcnt, grpcnt, fracdepth, tailsize, cutcnt, splicelen;
  1000. int gpsamplen, patterncnt, segsize, total_used_len, obufpos, endfilestt, bufsize, starttail, origbuflen;
  1001. int n, j, m, z, c, thiscut, cutstt, cutend, thissegsize, patcnt, segno, insams;
  1002. double spliceincr;
  1003. float *ibuf = dz->sampbuf[0], *obuf = dz->sampbuf[1], *ovflwbuf = dz->sampbuf[2];
  1004. float *splicebuf, *tailbuf, **buf;
  1005. int *patterna, *patternb, *pattern1, *pattern2, *cutsegsize;
  1006. chans = dz->infile->channels;
  1007. gpsamplen = dz->insams[0]/chans;
  1008. fracdepth = dz->iparam[FRACDEPTH];
  1009. splicelen = dz->iparam[FRACSPLICE];
  1010. obufpos = 0;
  1011. // CREATE SPLICE VALUES IN BUFFER
  1012. memset((char *)obuf,0,dz->buflen * 2 * sizeof(float)); // Initialise obuf, and ovflwbuf to zero
  1013. origbuflen = dz->buflen;
  1014. dz->buflen = dz->insams[0];
  1015. if((exit_status = read_samps(ibuf,dz))<0) // Fill the input buffer
  1016. return(exit_status);
  1017. dz->buflen = origbuflen;
  1018. if((exit_status = float_array_for_fractal(splicelen,-2,&splicebuf)) < 0)
  1019. return exit_status; // Create buffer to store splice values
  1020. spliceincr = 1.0/(double)splicelen; // Fill the splice buffer
  1021. for(m = 0; m < splicelen; m++)
  1022. splicebuf[m] = (float)((double)m * spliceincr);
  1023. // FIND HOW MANY SEGMENTS NEEDED (segcnt) AND THEIR SIZE (segsize) in gpsamples
  1024. // For cut-stage 0 need 2^0 = 1 segment
  1025. // For cut-stage 1 need 2^1 = 2 segments
  1026. // For cut-stage 2 need 2^2 = 4 segments
  1027. // For cut N need 2^N segments.
  1028. segcnt = 1;
  1029. for(n = 1;n < fracdepth; n++)
  1030. segcnt *= 2;
  1031. // HOW int ARE THE SEGMENTS, IN SAMPLES : WHAT IS THE BUFFER SIZE REQUIRED
  1032. segsize = gpsamplen/segcnt; // Sizeof segments (truncated)
  1033. bufsize = (segsize + splicelen) * chans;
  1034. // STORE UNUSED TAIL OF FILE IN ITS OWN BUFFER
  1035. total_used_len = segcnt * segsize * chans; // How much of file used in making fractal
  1036. tailsize = dz->insams[0] - total_used_len; // How much is left
  1037. tailsize += splicelen * chans; // Add room for upsplice
  1038. starttail = total_used_len - (splicelen * chans); // Find start of portion extended-tail-portion to copy
  1039. if((exit_status = float_array_for_fractal(tailsize,-1,&tailbuf)) < 0)
  1040. return exit_status; // Create buffer to store tail
  1041. for(n = 0, m = starttail;n < tailsize; n++,m++) // Copy tail into buffer
  1042. tailbuf[n] = ibuf[m];
  1043. for(m = 0; m < splicelen; m++) { // Put upsplice on tail
  1044. j = m * 2;
  1045. for(c = 0; c < chans; c++) {
  1046. tailbuf[j] = (float)(tailbuf[j] * splicebuf[m]);
  1047. j++;
  1048. }
  1049. if(j == tailsize) // Break, if tail is shorter than full splice
  1050. break;
  1051. }
  1052. // SET UP ARRAY OF BUFFERS TO STORE SEGMENTS
  1053. if((buf = (float **)malloc(segcnt * sizeof(float *)))==NULL) {
  1054. sprintf(errstr,"Insufficient memory to store cut segments 1.\n");
  1055. return(MEMORY_ERROR);
  1056. }
  1057. for(n = 0; n < segcnt; n++) {
  1058. if((exit_status = float_array_for_fractal(bufsize,-1,&buf[n])) < 0) // Create buffers to store segments
  1059. return exit_status;
  1060. }
  1061. // FIND FINAL SIZE OF FRACTAL PATTERN, AND SET UP ARRAYS TO STORE (GROWING) PATTERN
  1062. // At every cut, the initial_pattern of segments is copied (and reversed), and appended, to make pattern twice as int
  1063. // So total pattern of segments doubles in size at every cut
  1064. patterncnt = segcnt;
  1065. for(n = 0;n < fracdepth; n++)
  1066. patterncnt *= 2;
  1067. if((patterna = (int *)malloc(patterncnt * sizeof(int)))==NULL) {
  1068. sprintf(errstr,"Insufficient memory to store pattern array 1.\n");
  1069. return(MEMORY_ERROR);
  1070. }
  1071. if((patternb = (int *)malloc(patterncnt * sizeof(int)))==NULL) {
  1072. sprintf(errstr,"Insufficient memory to store pattern array 2.\n");
  1073. return(MEMORY_ERROR);
  1074. }
  1075. // CREATE ARRAY TO STORE SIZES OF STORED SEGMENTS
  1076. if((cutsegsize = (int *)malloc(segcnt * sizeof(int)))==NULL) { // Stores lengths of cut-segs, after splices added (or not)
  1077. sprintf(errstr,"Insufficient memory to store gating points.\n");
  1078. return(MEMORY_ERROR);
  1079. }
  1080. // FILL THE PATTERN ARRAY
  1081. pattern1 = patterna;
  1082. pattern2 = patternb;
  1083. for(n = 0; n < segcnt; n++) // Initiate pattern : put all (numbered) segments in numeric order
  1084. pattern1[n] = n;
  1085. grpcnt = segcnt; // Start off repatterning all existing segments
  1086. cutcnt = 1;
  1087. patcnt = 0;
  1088. for(n = 0;n < fracdepth; n++) { // For every cut-stage : loop-n
  1089. thiscut = 0; // Specify start and end of first-cut of cutcnt repatternings
  1090. cutend = grpcnt;
  1091. patcnt = 0; // Initialise pattern counter at start of every repatterning
  1092. for(j = 0; j < cutcnt;j ++) { // For the number of cuts to be made at this stage : loop-j
  1093. if(patcnt + (grpcnt * 2) > patterncnt) {
  1094. sprintf(errstr,"ERROR: Error in pattern generation counting.\n");
  1095. return PROGRAM_ERROR;
  1096. }
  1097. for(m = thiscut; m <cutend;m++) // Copy pattern to new array abcd
  1098. pattern2[patcnt++] = pattern1[m];
  1099. for(m = cutend-1; m >= thiscut;m--) // Then copy it in reverse abcddbca
  1100. pattern2[patcnt++] = pattern1[m];
  1101. thiscut += grpcnt;
  1102. cutend += grpcnt; // Advance start and end of cut in j-loop
  1103. }
  1104. if(EVEN(n)) {
  1105. pattern1 = patternb; // Swap pattern pointers
  1106. pattern2 = patterna;
  1107. } else { // Final pattern always ends up as pattern1
  1108. pattern1 = patterna;
  1109. pattern2 = patternb;
  1110. } // ONCE ALL segs at this level are reverse-copied and abutted
  1111. grpcnt /= 2; // Gpsize to Cut gets smaller (by 1/2) BUT the total pattern has doubled in size
  1112. cutcnt *= 4; // SO The number of cuts goes up by 2 X 2 !!
  1113. }
  1114. // TRANSFER SEGMENTS TO BUFFERS, EXTENDING BACKWARDS FOR UPSPLICE, AND DO START AND END SPLICES
  1115. // Segments extended backwards by splicelen, but not forwards
  1116. // |_______ |
  1117. // | /| \ |
  1118. // |/ | \|
  1119. // | | |
  1120. // add | |
  1121. // for | length |
  1122. // splice|specified|
  1123. // |_________|
  1124. // |_______ |
  1125. // /| \ |
  1126. // / | next \|
  1127. // | segment |
  1128. // |
  1129. for(n = 0; n < segcnt; n++) {
  1130. cutstt = ((n * segsize) - splicelen) * chans; // Startcut is segment-index in pattern X segsize, MINUS room for splice
  1131. cutstt = max(cutstt,0);
  1132. cutend = (n + 1) * segsize * chans; // Startcut is segment-index+1
  1133. cutend = min(cutend,dz->insams[0]);
  1134. for(m = cutstt,thissegsize = 0; m < cutend; m++,thissegsize++) // Copy segment to Relevant buffer
  1135. buf[n][thissegsize] = ibuf[m]; // Counting the segment size with thissegsize
  1136. z = thissegsize - 1;
  1137. for(m = 0; m < splicelen; m++) {
  1138. if( n == 0) { // Start segment has no upsplice
  1139. for(c = 0; c < chans; c++) {
  1140. buf[n][z] = (float)(buf[n][z] * splicebuf[m]);
  1141. z--;
  1142. }
  1143. } else {
  1144. j = m*2; // Otherwise : do start and end splices simultaneously
  1145. for(c = 0; c < chans; c++) {
  1146. buf[n][j] = (float)(buf[n][j] * splicebuf[m]);
  1147. j++;
  1148. buf[n][z] = (float)(buf[n][z] * splicebuf[m]);
  1149. z--;
  1150. }
  1151. }
  1152. }
  1153. cutsegsize[n] = thissegsize;
  1154. }
  1155. dz->tempsize = segsize * patcnt; // Approximate size of output
  1156. // JOIN SEGMENTS TOGETHER IN OUTBUF, IN ORDER OF PATTERN
  1157. obufpos = splicelen * chans; // Preset ensures baktrak for splice doesn't run off start of infile
  1158. for(n = 0; n < patterncnt; n++) {
  1159. obufpos -= splicelen * chans; // baktrak to do splice
  1160. segno = pattern1[n]; // Find segment indicated at position "n" in pattern
  1161. // and therefore get its buffer number (segno)
  1162. for(m = 0; m < cutsegsize[segno]; m++) {
  1163. obuf[obufpos] = (float)(obuf[obufpos] + buf[segno][m]); // Add-Copy segment to obuf (automatically overlapping splices)
  1164. if(++obufpos >= dz->buflen * 2) {
  1165. insams = dz->insams[0]; // These two lines ensure that
  1166. dz->insams[0] = dz->tempsize; // time-reports when program runs are correct
  1167. if((exit_status = write_samps(obuf,dz->buflen,dz))<0)
  1168. return(exit_status);
  1169. dz->insams[0] = insams;
  1170. memcpy((char *)obuf,(char *)ovflwbuf,dz->buflen * sizeof(float));
  1171. memset((char *)ovflwbuf,0,dz->buflen * sizeof(float));
  1172. obufpos -= dz->buflen;
  1173. }
  1174. }
  1175. }
  1176. // ADD TAIL OF SOUND
  1177. endfilestt = ((segcnt * segsize) - splicelen) * chans;
  1178. tailsize = dz->insams[0] - endfilestt;
  1179. obufpos -= splicelen * chans;
  1180. for(m = 0; m < tailsize; m++) {
  1181. obuf[obufpos] = (float)(obuf[obufpos] + ibuf[m]);
  1182. if(++obufpos >= dz->buflen * 2) {
  1183. insams = dz->insams[0];
  1184. dz->insams[0] = dz->tempsize;
  1185. if((exit_status = write_samps(obuf,dz->buflen,dz))<0)
  1186. return(exit_status);
  1187. dz->insams[0] = insams;
  1188. memcpy((char *)obuf,(char *)ovflwbuf,dz->buflen * sizeof(float));
  1189. memset((char *)ovflwbuf,0,dz->buflen * sizeof(float));
  1190. obufpos -= dz->buflen;
  1191. }
  1192. }
  1193. if(obufpos) {
  1194. insams = dz->insams[0];
  1195. dz->insams[0] = dz->tempsize;
  1196. if((exit_status = write_samps(obuf,obufpos,dz))<0)
  1197. return(exit_status);
  1198. dz->insams[0] = insams;
  1199. }
  1200. return FINISHED;
  1201. }
  1202. /****************************** FLOAT_ARRAY ******************************/
  1203. int float_array_for_fractal(int nnn,int n, float **ptr)
  1204. { /* set up a floating point array length nnn. */
  1205. *ptr = (float *) calloc(nnn,sizeof(float));
  1206. if(*ptr==NULL){
  1207. if(n == -2) {
  1208. sprintf(errstr,"pvoc: insufficient memory to store splice values.\n");
  1209. return(MEMORY_ERROR);
  1210. } else if(n == -1) {
  1211. sprintf(errstr,"pvoc: insufficient memory to store end-segment of sound\n");
  1212. return(MEMORY_ERROR);
  1213. } else {
  1214. sprintf(errstr,"pvoc: insufficient memory for segment-of-pattern %d\n",n+1);
  1215. return(MEMORY_ERROR);
  1216. }
  1217. }
  1218. return(FINISHED);
  1219. }
  1220. /****************************** CREATE_FRACTAL_SNDBUFS ******************************/
  1221. int create_fractal_sndbufs(dataptr dz)
  1222. {
  1223. int bigbufsize, splicelen;
  1224. int framesize;
  1225. framesize = F_SECSIZE * dz->infile->channels;
  1226. if(dz->sbufptr == 0 || dz->sampbuf==0) {
  1227. sprintf(errstr,"buffer pointers not allocated: create_sndbufs()\n");
  1228. return(PROGRAM_ERROR);
  1229. }
  1230. splicelen = (int)round(1.0 * MS_TO_SECS * (double)dz->infile->srate) * dz->infile->channels;
  1231. dz->buflen = max(2 * splicelen,4096);
  1232. dz->buflen = (dz->buflen / framesize) * framesize;
  1233. bigbufsize = dz->insams[0] + (2 * dz->buflen);
  1234. bigbufsize *= sizeof(float);
  1235. if((dz->bigbuf = (float *)malloc(bigbufsize)) == NULL) {
  1236. sprintf(errstr,"INSUFFICIENT MEMORY to create sound buffers. Don't use very big infiles\n");
  1237. return(PROGRAM_ERROR);
  1238. }
  1239. dz->sbufptr[0] = dz->sampbuf[0] = dz->bigbuf;
  1240. dz->sbufptr[1] = dz->sampbuf[1] = dz->sampbuf[0] + dz->insams[0];
  1241. dz->sbufptr[2] = dz->sampbuf[2] = dz->sampbuf[1] + dz->buflen;
  1242. dz->sbufptr[3] = dz->sampbuf[3] = dz->sampbuf[2] + dz->buflen;
  1243. return(FINISHED);
  1244. }