cantor.c 58 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525
  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. #ifdef unix
  41. #define round(x) lround((x))
  42. #endif
  43. char errstr[2400];
  44. int anal_infiles = 1;
  45. int sloom = 0;
  46. int sloombatch = 0;
  47. const char* cdp_version ="7.1.0";
  48. #define dig ringsize
  49. #define digsteps itemcnt
  50. #define arrraysize rampbrksize
  51. #define CACOSTABSIZ 16384
  52. //CDP LIB REPLACEMENTS
  53. static int check_cantor_param_validity_and_consistency(dataptr dz);
  54. static int setup_cantor_application(dataptr dz);
  55. static int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz);
  56. static int parse_infile_and_check_type(char **cmdline,dataptr dz);
  57. static int setup_cantor_param_ranges_and_defaults(dataptr dz);
  58. static int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz);
  59. static int open_the_outfile(dataptr dz);
  60. static int setup_and_init_input_param_activity(dataptr dz,int tipc);
  61. static int setup_input_param_defaultval_stores(int tipc,aplptr ap);
  62. static int establish_application(dataptr dz);
  63. static int initialise_vflags(dataptr dz);
  64. static int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz);
  65. static int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz);
  66. static int mark_parameter_types(dataptr dz,aplptr ap);
  67. static int assign_file_data_storage(int infilecnt,dataptr dz);
  68. static int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q);
  69. static int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz);
  70. static int get_the_mode_from_cmdline(char *str,dataptr dz);
  71. static int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt);
  72. //static double dbtolevel(double val);
  73. static int cantor(dataptr dz);
  74. static int create_cantor_sndbufs(dataptr dz);
  75. static int cut_hole(int startseg,int endseg,double holsttfrac,double holendfrac,double splincr,float *ibuf,float *obuf,int holeno,dataptr dz);
  76. static int woblwobl(float *ibuf,float *obuf,int *woblcnt,int stepcnt,double maxatten,dataptr dz);
  77. /**************************************** MAIN *********************************************/
  78. int main(int argc,char *argv[])
  79. {
  80. int exit_status;
  81. dataptr dz = NULL;
  82. char **cmdline;
  83. int cmdlinecnt;
  84. // aplptr ap;
  85. int is_launched = FALSE;
  86. if(argc==2 && (strcmp(argv[1],"--version") == 0)) {
  87. fprintf(stdout,"%s\n",cdp_version);
  88. fflush(stdout);
  89. return 0;
  90. }
  91. /* CHECK FOR SOUNDLOOM */
  92. if((sloom = sound_loom_in_use(&argc,&argv)) > 1) {
  93. sloom = 0;
  94. sloombatch = 1;
  95. }
  96. if(sflinit("cdp")){
  97. sfperror("cdp: initialisation\n");
  98. return(FAILED);
  99. }
  100. /* SET UP THE PRINCIPLE DATASTRUCTURE */
  101. if((exit_status = establish_datastructure(&dz))<0) { // CDP LIB
  102. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  103. return(FAILED);
  104. }
  105. if(!sloom) {
  106. if(argc == 1) {
  107. usage1();
  108. return(FAILED);
  109. } else if(argc == 2) {
  110. usage2(argv[1]);
  111. return(FAILED);
  112. }
  113. }
  114. if(!sloom) {
  115. if((exit_status = make_initial_cmdline_check(&argc,&argv))<0) { // CDP LIB
  116. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  117. return(FAILED);
  118. }
  119. cmdline = argv;
  120. cmdlinecnt = argc;
  121. if((get_the_process_no(argv[0],dz))<0)
  122. return(FAILED);
  123. cmdline++;
  124. cmdlinecnt--;
  125. dz->maxmode = 3;
  126. if((exit_status = get_the_mode_from_cmdline(cmdline[0],dz))<0) {
  127. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  128. return(exit_status);
  129. }
  130. cmdline++;
  131. cmdlinecnt--;
  132. // setup_particular_application =
  133. if((exit_status = setup_cantor_application(dz))<0) {
  134. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  135. return(FAILED);
  136. }
  137. if((exit_status = count_and_allocate_for_infiles(cmdlinecnt,cmdline,dz))<0) { // CDP LIB
  138. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  139. return(FAILED);
  140. }
  141. } else {
  142. //parse_TK_data() =
  143. if((exit_status = parse_sloom_data(argc,argv,&cmdline,&cmdlinecnt,dz))<0) {
  144. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  145. return(exit_status);
  146. }
  147. }
  148. // ap = dz->application;
  149. // parse_infile_and_hone_type() =
  150. if((exit_status = parse_infile_and_check_type(cmdline,dz))<0) {
  151. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  152. return(FAILED);
  153. }
  154. // setup_param_ranges_and_defaults() =
  155. if((exit_status = setup_cantor_param_ranges_and_defaults(dz))<0) {
  156. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  157. return(FAILED);
  158. }
  159. // open_first_infile CDP LIB
  160. if((exit_status = open_first_infile(cmdline[0],dz))<0) {
  161. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  162. return(FAILED);
  163. }
  164. cmdlinecnt--;
  165. cmdline++;
  166. // handle_extra_infiles() : redundant
  167. // handle_outfile() =
  168. if((exit_status = handle_the_outfile(&cmdlinecnt,&cmdline,dz))<0) {
  169. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  170. return(FAILED);
  171. }
  172. // handle_formants() redundant
  173. // handle_formant_quiksearch() redundant
  174. // handle_special_data() redundant
  175. if((exit_status = read_parameters_and_flags(&cmdline,&cmdlinecnt,dz))<0) { // CDP LIB
  176. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  177. return(FAILED);
  178. }
  179. // check_param_validity_and_consistency....
  180. if((exit_status = check_cantor_param_validity_and_consistency(dz))<0) {
  181. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  182. return(FAILED);
  183. }
  184. is_launched = TRUE;
  185. if((exit_status = create_cantor_sndbufs(dz))<0) { // CDP LIB
  186. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  187. return(FAILED);
  188. }
  189. if((exit_status = open_the_outfile(dz))<0) {
  190. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  191. return(FAILED);
  192. }
  193. //param_preprocess() redundant
  194. //spec_process_file =
  195. if((exit_status = cantor(dz))<0) {
  196. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  197. return(FAILED);
  198. }
  199. if((exit_status = complete_output(dz))<0) { // CDP LIB
  200. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  201. return(FAILED);
  202. }
  203. exit_status = print_messages_and_close_sndfiles(FINISHED,is_launched,dz); // CDP LIB
  204. free(dz);
  205. return(SUCCEEDED);
  206. }
  207. /**********************************************
  208. REPLACED CDP LIB FUNCTIONS
  209. **********************************************/
  210. /****************************** SET_PARAM_DATA *********************************/
  211. int set_param_data(aplptr ap, int special_data,int maxparamcnt,int paramcnt,char *paramlist)
  212. {
  213. ap->special_data = (char)special_data;
  214. ap->param_cnt = (char)paramcnt;
  215. ap->max_param_cnt = (char)maxparamcnt;
  216. if(ap->max_param_cnt>0) {
  217. if((ap->param_list = (char *)malloc((size_t)(ap->max_param_cnt+1)))==NULL) {
  218. sprintf(errstr,"INSUFFICIENT MEMORY: for param_list\n");
  219. return(MEMORY_ERROR);
  220. }
  221. strcpy(ap->param_list,paramlist);
  222. }
  223. return(FINISHED);
  224. }
  225. /****************************** SET_VFLGS *********************************/
  226. int set_vflgs
  227. (aplptr ap,char *optflags,int optcnt,char *optlist,char *varflags,int vflagcnt, int vparamcnt,char *varlist)
  228. {
  229. ap->option_cnt = (char) optcnt; /*RWD added cast */
  230. if(optcnt) {
  231. if((ap->option_list = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  232. sprintf(errstr,"INSUFFICIENT MEMORY: for option_list\n");
  233. return(MEMORY_ERROR);
  234. }
  235. strcpy(ap->option_list,optlist);
  236. if((ap->option_flags = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  237. sprintf(errstr,"INSUFFICIENT MEMORY: for option_flags\n");
  238. return(MEMORY_ERROR);
  239. }
  240. strcpy(ap->option_flags,optflags);
  241. }
  242. ap->vflag_cnt = (char) vflagcnt;
  243. ap->variant_param_cnt = (char) vparamcnt;
  244. if(vflagcnt) {
  245. if((ap->variant_list = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  246. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_list\n");
  247. return(MEMORY_ERROR);
  248. }
  249. strcpy(ap->variant_list,varlist);
  250. if((ap->variant_flags = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  251. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_flags\n");
  252. return(MEMORY_ERROR);
  253. }
  254. strcpy(ap->variant_flags,varflags);
  255. }
  256. return(FINISHED);
  257. }
  258. /***************************** APPLICATION_INIT **************************/
  259. int application_init(dataptr dz)
  260. {
  261. int exit_status;
  262. int storage_cnt;
  263. int tipc, brkcnt;
  264. aplptr ap = dz->application;
  265. if(ap->vflag_cnt>0)
  266. initialise_vflags(dz);
  267. tipc = ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt;
  268. ap->total_input_param_cnt = (char)tipc;
  269. if(tipc>0) {
  270. if((exit_status = setup_input_param_range_stores(tipc,ap))<0)
  271. return(exit_status);
  272. if((exit_status = setup_input_param_defaultval_stores(tipc,ap))<0)
  273. return(exit_status);
  274. if((exit_status = setup_and_init_input_param_activity(dz,tipc))<0)
  275. return(exit_status);
  276. }
  277. brkcnt = tipc;
  278. //THERE ARE NO INPUTFILE brktables USED IN THIS PROCESS
  279. if(brkcnt>0) {
  280. if((exit_status = setup_and_init_input_brktable_constants(dz,brkcnt))<0)
  281. return(exit_status);
  282. }
  283. if((storage_cnt = tipc + ap->internal_param_cnt)>0) {
  284. if((exit_status = setup_parameter_storage_and_constants(storage_cnt,dz))<0)
  285. return(exit_status);
  286. if((exit_status = initialise_is_int_and_no_brk_constants(storage_cnt,dz))<0)
  287. return(exit_status);
  288. }
  289. if((exit_status = mark_parameter_types(dz,ap))<0)
  290. return(exit_status);
  291. // establish_infile_constants() replaced by
  292. dz->infilecnt = 1;
  293. //establish_bufptrs_and_extra_buffers():
  294. return(FINISHED);
  295. }
  296. /********************** SETUP_PARAMETER_STORAGE_AND_CONSTANTS ********************/
  297. /* RWD mallo changed to calloc; helps debug verison run as release! */
  298. int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz)
  299. {
  300. if((dz->param = (double *)calloc(storage_cnt, sizeof(double)))==NULL) {
  301. sprintf(errstr,"setup_parameter_storage_and_constants(): 1\n");
  302. return(MEMORY_ERROR);
  303. }
  304. if((dz->iparam = (int *)calloc(storage_cnt, sizeof(int) ))==NULL) {
  305. sprintf(errstr,"setup_parameter_storage_and_constants(): 2\n");
  306. return(MEMORY_ERROR);
  307. }
  308. if((dz->is_int = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  309. sprintf(errstr,"setup_parameter_storage_and_constants(): 3\n");
  310. return(MEMORY_ERROR);
  311. }
  312. if((dz->no_brk = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  313. sprintf(errstr,"setup_parameter_storage_and_constants(): 5\n");
  314. return(MEMORY_ERROR);
  315. }
  316. return(FINISHED);
  317. }
  318. /************** INITIALISE_IS_INT_AND_NO_BRK_CONSTANTS *****************/
  319. int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz)
  320. {
  321. int n;
  322. for(n=0;n<storage_cnt;n++) {
  323. dz->is_int[n] = (char)0;
  324. dz->no_brk[n] = (char)0;
  325. }
  326. return(FINISHED);
  327. }
  328. /***************************** MARK_PARAMETER_TYPES **************************/
  329. int mark_parameter_types(dataptr dz,aplptr ap)
  330. {
  331. int n, m; /* PARAMS */
  332. for(n=0;n<ap->max_param_cnt;n++) {
  333. switch(ap->param_list[n]) {
  334. case('0'): break; /* dz->is_active[n] = 0 is default */
  335. case('i'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1;dz->no_brk[n] = (char)1; break;
  336. case('I'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1; break;
  337. case('d'): dz->is_active[n] = (char)1; dz->no_brk[n] = (char)1; break;
  338. case('D'): dz->is_active[n] = (char)1; /* normal case: double val or brkpnt file */ break;
  339. default:
  340. sprintf(errstr,"Programming error: invalid parameter type in mark_parameter_types()\n");
  341. return(PROGRAM_ERROR);
  342. }
  343. } /* OPTIONS */
  344. for(n=0,m=ap->max_param_cnt;n<ap->option_cnt;n++,m++) {
  345. switch(ap->option_list[n]) {
  346. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  347. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  348. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  349. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  350. default:
  351. sprintf(errstr,"Programming error: invalid option type in mark_parameter_types()\n");
  352. return(PROGRAM_ERROR);
  353. }
  354. } /* VARIANTS */
  355. for(n=0,m=ap->max_param_cnt + ap->option_cnt;n < ap->variant_param_cnt; n++, m++) {
  356. switch(ap->variant_list[n]) {
  357. case('0'): break;
  358. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  359. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  360. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  361. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  362. default:
  363. sprintf(errstr,"Programming error: invalid variant type in mark_parameter_types()\n");
  364. return(PROGRAM_ERROR);
  365. }
  366. } /* INTERNAL */
  367. for(n=0,
  368. m=ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt; n<ap->internal_param_cnt; n++,m++) {
  369. switch(ap->internal_param_list[n]) {
  370. case('0'): break; /* dummy variables: variables not used: but important for internal paream numbering!! */
  371. case('i'): dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  372. case('d'): dz->no_brk[m] = (char)1; break;
  373. default:
  374. sprintf(errstr,"Programming error: invalid internal param type in mark_parameter_types()\n");
  375. return(PROGRAM_ERROR);
  376. }
  377. }
  378. return(FINISHED);
  379. }
  380. /************************ HANDLE_THE_OUTFILE *********************/
  381. int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz)
  382. {
  383. char *p, *filename = (*cmdline)[0];
  384. int n;
  385. if(filename[0]=='-' && filename[1]=='f') {
  386. dz->floatsam_output = 1;
  387. dz->true_outfile_stype = SAMP_FLOAT;
  388. filename+= 2;
  389. }
  390. if(!sloom) {
  391. if(file_has_invalid_startchar(filename) || value_is_numeric(filename)) {
  392. sprintf(errstr,"Outfile name %s has invalid start character(s) or looks too much like a number.\n",filename);
  393. return(DATA_ERROR);
  394. }
  395. }
  396. p = filename; // Drop file extension
  397. while(*p != ENDOFSTR) {
  398. if(*p == '.') {
  399. *p = ENDOFSTR;
  400. break;
  401. }
  402. p++;
  403. }
  404. strcpy(dz->outfilename,filename);
  405. if(sloom) { // IF sloom, drop trailing zero
  406. n = strlen(dz->outfilename);
  407. n--;
  408. dz->outfilename[n] = ENDOFSTR;
  409. }
  410. // strcpy(dz->outfilename,filename);
  411. (*cmdline)++;
  412. (*cmdlinecnt)--;
  413. return(FINISHED);
  414. }
  415. /************************ OPEN_THE_OUTFILE *********************/
  416. int open_the_outfile(dataptr dz)
  417. {
  418. int exit_status;
  419. char filename[400];
  420. strcpy(filename,dz->outfilename);
  421. strcat(filename,"0");
  422. if((exit_status = create_sized_outfile(filename,dz))<0)
  423. return(exit_status);
  424. return(FINISHED);
  425. }
  426. /***************************** ESTABLISH_APPLICATION **************************/
  427. int establish_application(dataptr dz)
  428. {
  429. aplptr ap;
  430. if((dz->application = (aplptr)malloc(sizeof (struct applic)))==NULL) {
  431. sprintf(errstr,"establish_application()\n");
  432. return(MEMORY_ERROR);
  433. }
  434. ap = dz->application;
  435. memset((char *)ap,0,sizeof(struct applic));
  436. return(FINISHED);
  437. }
  438. /************************* INITIALISE_VFLAGS *************************/
  439. int initialise_vflags(dataptr dz)
  440. {
  441. int n;
  442. if((dz->vflag = (char *)malloc(dz->application->vflag_cnt * sizeof(char)))==NULL) {
  443. sprintf(errstr,"INSUFFICIENT MEMORY: vflag store,\n");
  444. return(MEMORY_ERROR);
  445. }
  446. for(n=0;n<dz->application->vflag_cnt;n++)
  447. dz->vflag[n] = FALSE;
  448. return FINISHED;
  449. }
  450. /************************* SETUP_INPUT_PARAM_DEFAULTVALS *************************/
  451. int setup_input_param_defaultval_stores(int tipc,aplptr ap)
  452. {
  453. int n;
  454. if((ap->default_val = (double *)malloc(tipc * sizeof(double)))==NULL) {
  455. sprintf(errstr,"INSUFFICIENT MEMORY for application default values store\n");
  456. return(MEMORY_ERROR);
  457. }
  458. for(n=0;n<tipc;n++)
  459. ap->default_val[n] = 0.0;
  460. return(FINISHED);
  461. }
  462. /***************************** SETUP_AND_INIT_INPUT_PARAM_ACTIVITY **************************/
  463. int setup_and_init_input_param_activity(dataptr dz,int tipc)
  464. {
  465. int n;
  466. if((dz->is_active = (char *)malloc((size_t)tipc))==NULL) {
  467. sprintf(errstr,"setup_and_init_input_param_activity()\n");
  468. return(MEMORY_ERROR);
  469. }
  470. for(n=0;n<tipc;n++)
  471. dz->is_active[n] = (char)0;
  472. return(FINISHED);
  473. }
  474. /************************* SETUP_CANTOR_APPLICATION *******************/
  475. int setup_cantor_application(dataptr dz)
  476. {
  477. int exit_status;
  478. aplptr ap;
  479. if((exit_status = establish_application(dz))<0) // GLOBAL
  480. return(FAILED);
  481. ap = dz->application;
  482. // SEE parstruct FOR EXPLANATION of next 2 functions
  483. if(dz->mode == 2) {
  484. if((exit_status = set_param_data(ap,0 ,5,5,"diidd"))<0)
  485. return(FAILED);
  486. if((exit_status = set_vflgs(ap,"",0,"","",0,0,""))<0)
  487. return(FAILED);
  488. } else {
  489. if((exit_status = set_param_data(ap,0 ,5,5,"ddddd"))<0)
  490. return(FAILED);
  491. if((exit_status = set_vflgs(ap,"",0,"","e",1,0,"0"))<0)
  492. return(FAILED);
  493. }
  494. // set_legal_infile_structure -->
  495. dz->has_otherfile = FALSE;
  496. // assign_process_logic -->
  497. dz->input_data_type = SNDFILES_ONLY;
  498. dz->process_type = EQUAL_SNDFILE;
  499. dz->outfiletype = SNDFILE_OUT;
  500. return application_init(dz); //GLOBAL
  501. }
  502. /************************* PARSE_INFILE_AND_CHECK_TYPE *******************/
  503. int parse_infile_and_check_type(char **cmdline,dataptr dz)
  504. {
  505. int exit_status;
  506. infileptr infile_info;
  507. if(!sloom) {
  508. if((infile_info = (infileptr)malloc(sizeof(struct filedata)))==NULL) {
  509. sprintf(errstr,"INSUFFICIENT MEMORY for infile structure to test file data.");
  510. return(MEMORY_ERROR);
  511. } else if((exit_status = cdparse(cmdline[0],infile_info))<0) {
  512. sprintf(errstr,"Failed to parse input file %s\n",cmdline[0]);
  513. return(PROGRAM_ERROR);
  514. } else if(infile_info->filetype != SNDFILE) {
  515. sprintf(errstr,"File %s is not of correct type\n",cmdline[0]);
  516. return(DATA_ERROR);
  517. } else if(infile_info->channels != 1) {
  518. sprintf(errstr,"File %s is not of correct type (must be mono)\n",cmdline[0]);
  519. return(DATA_ERROR);
  520. } else if((exit_status = copy_parse_info_to_main_structure(infile_info,dz))<0) {
  521. sprintf(errstr,"Failed to copy file parsing information\n");
  522. return(PROGRAM_ERROR);
  523. }
  524. free(infile_info);
  525. }
  526. return(FINISHED);
  527. }
  528. /************************* SETUP_CANTOR_PARAM_RANGES_AND_DEFAULTS *******************/
  529. int setup_cantor_param_ranges_and_defaults(dataptr dz)
  530. {
  531. int exit_status;
  532. aplptr ap = dz->application;
  533. // set_param_ranges()
  534. ap->total_input_param_cnt = (char)(ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt);
  535. // NB total_input_param_cnt is > 0 !!!
  536. if((exit_status = setup_input_param_range_stores(ap->total_input_param_cnt,ap))<0)
  537. return(FAILED);
  538. // get_param_ranges()
  539. switch(dz->mode) {
  540. case(0):
  541. ap->lo[CA_HOLEN] = 0.0;
  542. ap->hi[CA_HOLEN] = 99.0;
  543. ap->default_val[CA_HOLEN] = 0.333;
  544. ap->lo[CA_HOLEDIG] = 0.001;
  545. ap->hi[CA_HOLEDIG] = 1.0;
  546. ap->default_val[CA_HOLEDIG] = 0.1;
  547. ap->lo[CA_TRIGLEV] = 0.001;
  548. ap->hi[CA_TRIGLEV] = 1.0;
  549. ap->default_val[CA_TRIGLEV] = 0.5;
  550. ap->lo[CA_SPLEN] = 3;
  551. ap->hi[CA_SPLEN] = 50;
  552. ap->default_val[CA_SPLEN] = 5;
  553. break;
  554. case(1):
  555. ap->lo[CA_HOLEN] = 0.0;
  556. ap->hi[CA_HOLEN] = dz->duration/3.0;
  557. ap->default_val[CA_HOLEN] = dz->duration/3.0;
  558. ap->lo[CA_HOLEDIG] = 0.001;
  559. ap->hi[CA_HOLEDIG] = 1.0;
  560. ap->default_val[CA_HOLEDIG] = 0.1;
  561. ap->lo[CA_TRIGLEV] = 0.001;
  562. ap->hi[CA_TRIGLEV] = 1.0;
  563. ap->default_val[CA_TRIGLEV] = 0.5;
  564. ap->lo[CA_SPLEN] = 3;
  565. ap->hi[CA_SPLEN] = 50;
  566. ap->default_val[CA_SPLEN] = 5;
  567. break;
  568. case(2):
  569. ap->lo[CA_HOLEN] = 0.0;
  570. ap->hi[CA_HOLEN] = 0.99;
  571. ap->default_val[CA_HOLEN] = 0.0;
  572. ap->lo[CA_HOLEDIG] = 2;
  573. ap->hi[CA_HOLEDIG] = 256;
  574. ap->default_val[CA_HOLEDIG] = 8;
  575. ap->lo[CA_WOBDEC] = 0.01;
  576. ap->hi[CA_WOBDEC] = 1;
  577. ap->default_val[CA_WOBDEC] = 0.5;
  578. ap->lo[CA_WOBBLES] = 1;
  579. ap->hi[CA_WOBBLES] = 100;
  580. ap->default_val[CA_WOBBLES] = 4;
  581. break;
  582. }
  583. ap->lo[CA_MAXDUR] = dz->duration * 2;
  584. ap->hi[CA_MAXDUR] = 32767;
  585. ap->default_val[CA_MAXDUR] = 60.0;
  586. dz->maxmode = 0;
  587. if(!sloom)
  588. put_default_vals_in_all_params(dz);
  589. return(FINISHED);
  590. }
  591. /********************************* PARSE_SLOOM_DATA *********************************/
  592. int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz)
  593. {
  594. int exit_status;
  595. int cnt = 1, infilecnt;
  596. int filesize, insams, inbrksize;
  597. double dummy;
  598. int true_cnt = 0;
  599. // aplptr ap;
  600. while(cnt<=PRE_CMDLINE_DATACNT) {
  601. if(cnt > argc) {
  602. sprintf(errstr,"Insufficient data sent from TK\n");
  603. return(DATA_ERROR);
  604. }
  605. switch(cnt) {
  606. case(1):
  607. if(sscanf(argv[cnt],"%d",&dz->process)!=1) {
  608. sprintf(errstr,"Cannot read process no. sent from TK\n");
  609. return(DATA_ERROR);
  610. }
  611. break;
  612. case(2):
  613. if(sscanf(argv[cnt],"%d",&dz->mode)!=1) {
  614. sprintf(errstr,"Cannot read mode no. sent from TK\n");
  615. return(DATA_ERROR);
  616. }
  617. if(dz->mode > 0)
  618. dz->mode--;
  619. //setup_particular_application() =
  620. if((exit_status = setup_cantor_application(dz))<0)
  621. return(exit_status);
  622. // ap = dz->application;
  623. break;
  624. case(3):
  625. if(sscanf(argv[cnt],"%d",&infilecnt)!=1) {
  626. sprintf(errstr,"Cannot read infilecnt sent from TK\n");
  627. return(DATA_ERROR);
  628. }
  629. if(infilecnt < 1) {
  630. true_cnt = cnt + 1;
  631. cnt = PRE_CMDLINE_DATACNT; /* force exit from loop after assign_file_data_storage */
  632. }
  633. if((exit_status = assign_file_data_storage(infilecnt,dz))<0)
  634. return(exit_status);
  635. break;
  636. case(INPUT_FILETYPE+4):
  637. if(sscanf(argv[cnt],"%d",&dz->infile->filetype)!=1) {
  638. sprintf(errstr,"Cannot read filetype sent from TK (%s)\n",argv[cnt]);
  639. return(DATA_ERROR);
  640. }
  641. break;
  642. case(INPUT_FILESIZE+4):
  643. if(sscanf(argv[cnt],"%d",&filesize)!=1) {
  644. sprintf(errstr,"Cannot read infilesize sent from TK\n");
  645. return(DATA_ERROR);
  646. }
  647. dz->insams[0] = filesize;
  648. break;
  649. case(INPUT_INSAMS+4):
  650. if(sscanf(argv[cnt],"%d",&insams)!=1) {
  651. sprintf(errstr,"Cannot read insams sent from TK\n");
  652. return(DATA_ERROR);
  653. }
  654. dz->insams[0] = insams;
  655. break;
  656. case(INPUT_SRATE+4):
  657. if(sscanf(argv[cnt],"%d",&dz->infile->srate)!=1) {
  658. sprintf(errstr,"Cannot read srate sent from TK\n");
  659. return(DATA_ERROR);
  660. }
  661. break;
  662. case(INPUT_CHANNELS+4):
  663. if(sscanf(argv[cnt],"%d",&dz->infile->channels)!=1) {
  664. sprintf(errstr,"Cannot read channels sent from TK\n");
  665. return(DATA_ERROR);
  666. }
  667. break;
  668. case(INPUT_STYPE+4):
  669. if(sscanf(argv[cnt],"%d",&dz->infile->stype)!=1) {
  670. sprintf(errstr,"Cannot read stype sent from TK\n");
  671. return(DATA_ERROR);
  672. }
  673. break;
  674. case(INPUT_ORIGSTYPE+4):
  675. if(sscanf(argv[cnt],"%d",&dz->infile->origstype)!=1) {
  676. sprintf(errstr,"Cannot read origstype sent from TK\n");
  677. return(DATA_ERROR);
  678. }
  679. break;
  680. case(INPUT_ORIGRATE+4):
  681. if(sscanf(argv[cnt],"%d",&dz->infile->origrate)!=1) {
  682. sprintf(errstr,"Cannot read origrate sent from TK\n");
  683. return(DATA_ERROR);
  684. }
  685. break;
  686. case(INPUT_MLEN+4):
  687. if(sscanf(argv[cnt],"%d",&dz->infile->Mlen)!=1) {
  688. sprintf(errstr,"Cannot read Mlen sent from TK\n");
  689. return(DATA_ERROR);
  690. }
  691. break;
  692. case(INPUT_DFAC+4):
  693. if(sscanf(argv[cnt],"%d",&dz->infile->Dfac)!=1) {
  694. sprintf(errstr,"Cannot read Dfac sent from TK\n");
  695. return(DATA_ERROR);
  696. }
  697. break;
  698. case(INPUT_ORIGCHANS+4):
  699. if(sscanf(argv[cnt],"%d",&dz->infile->origchans)!=1) {
  700. sprintf(errstr,"Cannot read origchans sent from TK\n");
  701. return(DATA_ERROR);
  702. }
  703. break;
  704. case(INPUT_SPECENVCNT+4):
  705. if(sscanf(argv[cnt],"%d",&dz->infile->specenvcnt)!=1) {
  706. sprintf(errstr,"Cannot read specenvcnt sent from TK\n");
  707. return(DATA_ERROR);
  708. }
  709. dz->specenvcnt = dz->infile->specenvcnt;
  710. break;
  711. case(INPUT_WANTED+4):
  712. if(sscanf(argv[cnt],"%d",&dz->wanted)!=1) {
  713. sprintf(errstr,"Cannot read wanted sent from TK\n");
  714. return(DATA_ERROR);
  715. }
  716. break;
  717. case(INPUT_WLENGTH+4):
  718. if(sscanf(argv[cnt],"%d",&dz->wlength)!=1) {
  719. sprintf(errstr,"Cannot read wlength sent from TK\n");
  720. return(DATA_ERROR);
  721. }
  722. break;
  723. case(INPUT_OUT_CHANS+4):
  724. if(sscanf(argv[cnt],"%d",&dz->out_chans)!=1) {
  725. sprintf(errstr,"Cannot read out_chans sent from TK\n");
  726. return(DATA_ERROR);
  727. }
  728. break;
  729. /* RWD these chanegs to samps - tk will have to deal with that! */
  730. case(INPUT_DESCRIPTOR_BYTES+4):
  731. if(sscanf(argv[cnt],"%d",&dz->descriptor_samps)!=1) {
  732. sprintf(errstr,"Cannot read descriptor_samps sent from TK\n");
  733. return(DATA_ERROR);
  734. }
  735. break;
  736. case(INPUT_IS_TRANSPOS+4):
  737. if(sscanf(argv[cnt],"%d",&dz->is_transpos)!=1) {
  738. sprintf(errstr,"Cannot read is_transpos sent from TK\n");
  739. return(DATA_ERROR);
  740. }
  741. break;
  742. case(INPUT_COULD_BE_TRANSPOS+4):
  743. if(sscanf(argv[cnt],"%d",&dz->could_be_transpos)!=1) {
  744. sprintf(errstr,"Cannot read could_be_transpos sent from TK\n");
  745. return(DATA_ERROR);
  746. }
  747. break;
  748. case(INPUT_COULD_BE_PITCH+4):
  749. if(sscanf(argv[cnt],"%d",&dz->could_be_pitch)!=1) {
  750. sprintf(errstr,"Cannot read could_be_pitch sent from TK\n");
  751. return(DATA_ERROR);
  752. }
  753. break;
  754. case(INPUT_DIFFERENT_SRATES+4):
  755. if(sscanf(argv[cnt],"%d",&dz->different_srates)!=1) {
  756. sprintf(errstr,"Cannot read different_srates sent from TK\n");
  757. return(DATA_ERROR);
  758. }
  759. break;
  760. case(INPUT_DUPLICATE_SNDS+4):
  761. if(sscanf(argv[cnt],"%d",&dz->duplicate_snds)!=1) {
  762. sprintf(errstr,"Cannot read duplicate_snds sent from TK\n");
  763. return(DATA_ERROR);
  764. }
  765. break;
  766. case(INPUT_BRKSIZE+4):
  767. if(sscanf(argv[cnt],"%d",&inbrksize)!=1) {
  768. sprintf(errstr,"Cannot read brksize sent from TK\n");
  769. return(DATA_ERROR);
  770. }
  771. if(inbrksize > 0) {
  772. switch(dz->input_data_type) {
  773. case(WORDLIST_ONLY):
  774. break;
  775. case(PITCH_AND_PITCH):
  776. case(PITCH_AND_TRANSPOS):
  777. case(TRANSPOS_AND_TRANSPOS):
  778. dz->tempsize = inbrksize;
  779. break;
  780. case(BRKFILES_ONLY):
  781. case(UNRANGED_BRKFILE_ONLY):
  782. case(DB_BRKFILES_ONLY):
  783. case(ALL_FILES):
  784. case(ANY_NUMBER_OF_ANY_FILES):
  785. if(dz->extrabrkno < 0) {
  786. sprintf(errstr,"Storage location number for brktable not established by CDP.\n");
  787. return(DATA_ERROR);
  788. }
  789. if(dz->brksize == NULL) {
  790. sprintf(errstr,"CDP has not established storage space for input brktable.\n");
  791. return(PROGRAM_ERROR);
  792. }
  793. dz->brksize[dz->extrabrkno] = inbrksize;
  794. break;
  795. default:
  796. sprintf(errstr,"TK sent brktablesize > 0 for input_data_type [%d] not using brktables.\n",
  797. dz->input_data_type);
  798. return(PROGRAM_ERROR);
  799. }
  800. break;
  801. }
  802. break;
  803. case(INPUT_NUMSIZE+4):
  804. if(sscanf(argv[cnt],"%d",&dz->numsize)!=1) {
  805. sprintf(errstr,"Cannot read numsize sent from TK\n");
  806. return(DATA_ERROR);
  807. }
  808. break;
  809. case(INPUT_LINECNT+4):
  810. if(sscanf(argv[cnt],"%d",&dz->linecnt)!=1) {
  811. sprintf(errstr,"Cannot read linecnt sent from TK\n");
  812. return(DATA_ERROR);
  813. }
  814. break;
  815. case(INPUT_ALL_WORDS+4):
  816. if(sscanf(argv[cnt],"%d",&dz->all_words)!=1) {
  817. sprintf(errstr,"Cannot read all_words sent from TK\n");
  818. return(DATA_ERROR);
  819. }
  820. break;
  821. case(INPUT_ARATE+4):
  822. if(sscanf(argv[cnt],"%f",&dz->infile->arate)!=1) {
  823. sprintf(errstr,"Cannot read arate sent from TK\n");
  824. return(DATA_ERROR);
  825. }
  826. break;
  827. case(INPUT_FRAMETIME+4):
  828. if(sscanf(argv[cnt],"%lf",&dummy)!=1) {
  829. sprintf(errstr,"Cannot read frametime sent from TK\n");
  830. return(DATA_ERROR);
  831. }
  832. dz->frametime = (float)dummy;
  833. break;
  834. case(INPUT_WINDOW_SIZE+4):
  835. if(sscanf(argv[cnt],"%f",&dz->infile->window_size)!=1) {
  836. sprintf(errstr,"Cannot read window_size sent from TK\n");
  837. return(DATA_ERROR);
  838. }
  839. break;
  840. case(INPUT_NYQUIST+4):
  841. if(sscanf(argv[cnt],"%lf",&dz->nyquist)!=1) {
  842. sprintf(errstr,"Cannot read nyquist sent from TK\n");
  843. return(DATA_ERROR);
  844. }
  845. break;
  846. case(INPUT_DURATION+4):
  847. if(sscanf(argv[cnt],"%lf",&dz->duration)!=1) {
  848. sprintf(errstr,"Cannot read duration sent from TK\n");
  849. return(DATA_ERROR);
  850. }
  851. break;
  852. case(INPUT_MINBRK+4):
  853. if(sscanf(argv[cnt],"%lf",&dz->minbrk)!=1) {
  854. sprintf(errstr,"Cannot read minbrk sent from TK\n");
  855. return(DATA_ERROR);
  856. }
  857. break;
  858. case(INPUT_MAXBRK+4):
  859. if(sscanf(argv[cnt],"%lf",&dz->maxbrk)!=1) {
  860. sprintf(errstr,"Cannot read maxbrk sent from TK\n");
  861. return(DATA_ERROR);
  862. }
  863. break;
  864. case(INPUT_MINNUM+4):
  865. if(sscanf(argv[cnt],"%lf",&dz->minnum)!=1) {
  866. sprintf(errstr,"Cannot read minnum sent from TK\n");
  867. return(DATA_ERROR);
  868. }
  869. break;
  870. case(INPUT_MAXNUM+4):
  871. if(sscanf(argv[cnt],"%lf",&dz->maxnum)!=1) {
  872. sprintf(errstr,"Cannot read maxnum sent from TK\n");
  873. return(DATA_ERROR);
  874. }
  875. break;
  876. default:
  877. sprintf(errstr,"case switch item missing: parse_sloom_data()\n");
  878. return(PROGRAM_ERROR);
  879. }
  880. cnt++;
  881. }
  882. if(cnt!=PRE_CMDLINE_DATACNT+1) {
  883. sprintf(errstr,"Insufficient pre-cmdline params sent from TK\n");
  884. return(DATA_ERROR);
  885. }
  886. if(true_cnt)
  887. cnt = true_cnt;
  888. *cmdlinecnt = 0;
  889. while(cnt < argc) {
  890. if((exit_status = get_tk_cmdline_word(cmdlinecnt,cmdline,argv[cnt]))<0)
  891. return(exit_status);
  892. cnt++;
  893. }
  894. return(FINISHED);
  895. }
  896. /********************************* GET_TK_CMDLINE_WORD *********************************/
  897. int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q)
  898. {
  899. if(*cmdlinecnt==0) {
  900. if((*cmdline = (char **)malloc(sizeof(char *)))==NULL) {
  901. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  902. return(MEMORY_ERROR);
  903. }
  904. } else {
  905. if((*cmdline = (char **)realloc(*cmdline,((*cmdlinecnt)+1) * sizeof(char *)))==NULL) {
  906. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  907. return(MEMORY_ERROR);
  908. }
  909. }
  910. if(((*cmdline)[*cmdlinecnt] = (char *)malloc((strlen(q) + 1) * sizeof(char)))==NULL) {
  911. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline item %d.\n",(*cmdlinecnt)+1);
  912. return(MEMORY_ERROR);
  913. }
  914. strcpy((*cmdline)[*cmdlinecnt],q);
  915. (*cmdlinecnt)++;
  916. return(FINISHED);
  917. }
  918. /****************************** ASSIGN_FILE_DATA_STORAGE *********************************/
  919. int assign_file_data_storage(int infilecnt,dataptr dz)
  920. {
  921. int exit_status;
  922. int no_sndfile_system_files = FALSE;
  923. dz->infilecnt = infilecnt;
  924. if((exit_status = allocate_filespace(dz))<0)
  925. return(exit_status);
  926. if(no_sndfile_system_files)
  927. dz->infilecnt = 0;
  928. return(FINISHED);
  929. }
  930. /************************* redundant functions: to ensure libs compile OK *******************/
  931. int assign_process_logic(dataptr dz)
  932. {
  933. return(FINISHED);
  934. }
  935. void set_legal_infile_structure(dataptr dz)
  936. {}
  937. int set_legal_internalparam_structure(int process,int mode,aplptr ap)
  938. {
  939. return(FINISHED);
  940. }
  941. int setup_internal_arrays_and_array_pointers(dataptr dz)
  942. {
  943. return(FINISHED);
  944. }
  945. int establish_bufptrs_and_extra_buffers(dataptr dz)
  946. {
  947. return(FINISHED);
  948. }
  949. int read_special_data(char *str,dataptr dz)
  950. {
  951. return(FINISHED);
  952. }
  953. int inner_loop
  954. (int *peakscore,int *descnt,int *in_start_portion,int *least,int *pitchcnt,int windows_in_buf,dataptr dz)
  955. {
  956. return(FINISHED);
  957. }
  958. int get_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  959. {
  960. return(FINISHED);
  961. }
  962. /******************************** USAGE1 ********************************/
  963. int usage1(void)
  964. {
  965. usage2("set");
  966. return(USAGE_ONLY);
  967. }
  968. /**************************** CHECK_CANTOR_PARAM_VALIDITY_AND_CONSISTENCY *****************************/
  969. int check_cantor_param_validity_and_consistency(dataptr dz)
  970. {
  971. int cnt, totalcnt, firstholen, n, m, k;
  972. int chans = dz->infile->channels;
  973. dz->iparam[CA_SPLEN] = (int)round(dz->param[CA_SPLEN] * MS_TO_SECS * (double)dz->infile->srate);
  974. dz->digsteps = (int)ceil(1.0/dz->param[CA_HOLEDIG]);
  975. dz->dig = dz->iparam[CA_SPLEN]/dz->digsteps; // chunk of splicelen carved at each dig
  976. if(dz->dig * dz->digsteps != dz->iparam[CA_SPLEN]) {
  977. dz->dig++;
  978. dz->iparam[CA_SPLEN] = dz->dig * dz->digsteps; // splicelen is a multiple of level decrements
  979. }
  980. switch(dz->mode) {
  981. case(0):
  982. dz->param[CA_HOLEN] /= 100.0;
  983. firstholen = (int)round((dz->insams[0]/chans) * dz->param[CA_HOLEN]);
  984. if(!dz->vflag[0] && (firstholen <= dz->iparam[CA_SPLEN] * 2)) {
  985. sprintf(errstr,"Hole too short for splice length specified.\n");
  986. return(DATA_ERROR);
  987. }
  988. break;
  989. case(1):
  990. dz->iparam[CA_HOLEN] = (int)round(dz->param[CA_HOLEN] * (double)dz->infile->srate) * chans;
  991. if(dz->iparam[CA_SPLEN] * chans * 2 >= dz->iparam[CA_HOLEN]) {
  992. sprintf(errstr,"Holes too small for splice length given.\n");
  993. return(DATA_ERROR);
  994. }
  995. if(dz->iparam[CA_SPLEN] < chans) {
  996. sprintf(errstr,"Holes too small.\n");
  997. return(DATA_ERROR);
  998. }
  999. break;
  1000. }
  1001. dz->iparam[CA_MAXDUR] = (int)round(dz->param[CA_MAXDUR] * (double)dz->infile->srate) * chans;
  1002. if(dz->mode == 2) {
  1003. if((dz->parray = (double **)malloc(dz->iparam[CA_WOBBLES] * sizeof(double *)))==NULL) {
  1004. sprintf(errstr,"INSUFFICIENT MEMORY to create data double arrays.\n");
  1005. return(MEMORY_ERROR);
  1006. }
  1007. for(n=0;n < dz->iparam[CA_WOBBLES];n++) {
  1008. if((dz->parray[n] = (double *)malloc((CACOSTABSIZ + 1) * sizeof(double)))==NULL) {
  1009. sprintf(errstr,"INSUFFICIENT MEMORY to create cosin data table.\n");
  1010. return(MEMORY_ERROR);
  1011. }
  1012. }
  1013. for(n=0;n < dz->iparam[CA_WOBBLES];n++) {
  1014. for(m=0;m < CACOSTABSIZ;m++) {
  1015. dz->parray[n][m] = cos(((double)m/(double)CACOSTABSIZ) * 2.0 * PI);
  1016. dz->parray[n][m] += 1.0;
  1017. dz->parray[n][m] /= 2.0;
  1018. dz->parray[n][m] = 1.0 - dz->parray[n][m];
  1019. }
  1020. dz->parray[n][m] = dz->parray[n][m-1];
  1021. }
  1022. for(n=0,m = dz->iparam[CA_WOBBLES];n < dz->iparam[CA_WOBBLES]-1;n++,m--) {
  1023. for(k=0;k < CACOSTABSIZ;k++)
  1024. dz->parray[n][k] = pow(dz->parray[n][k],m);
  1025. dz->parray[n][k] = dz->parray[n][k-1];
  1026. }
  1027. } else {
  1028. if((dz->iparray = (int **)malloc(3 * sizeof(int *)))==NULL) {
  1029. sprintf(errstr,"INSUFFICIENT MEMORY to create data integer arrays.\n");
  1030. return(MEMORY_ERROR);
  1031. }
  1032. dz->arrraysize = 0;
  1033. totalcnt = dz->insams[0]/chans;
  1034. while(totalcnt >= 1) {
  1035. dz->arrraysize++;
  1036. if(totalcnt == 1)
  1037. break;
  1038. cnt = totalcnt/2;
  1039. if(cnt * 2 != totalcnt)
  1040. cnt++;
  1041. totalcnt = cnt;
  1042. }
  1043. dz->arrraysize += 4;// SAFETY
  1044. if((dz->iparray[0] = (int *)malloc(dz->arrraysize * sizeof(int)))==NULL) {
  1045. sprintf(errstr,"INSUFFICIENT MEMORY to create hole count stores.\n");
  1046. return(MEMORY_ERROR);
  1047. }
  1048. for(cnt=0;cnt<dz->arrraysize;cnt++)
  1049. dz->iparray[0][cnt] = 1;
  1050. if((dz->iparray[1] = (int *)malloc(dz->arrraysize * sizeof(int)))==NULL) {
  1051. sprintf(errstr,"INSUFFICIENT MEMORY to create hole count stores.\n");
  1052. return(MEMORY_ERROR);
  1053. }
  1054. for(cnt=0;cnt<dz->arrraysize;cnt++)
  1055. dz->iparray[1][cnt] = CONTINUE;
  1056. if((dz->iparray[2] = (int *)malloc(dz->arrraysize * sizeof(int)))==NULL) {
  1057. sprintf(errstr,"INSUFFICIENT MEMORY to create hole count stores.\n");
  1058. return(MEMORY_ERROR);
  1059. }
  1060. for(cnt=0;cnt<dz->arrraysize;cnt++)
  1061. dz->iparray[2][cnt] = 0;
  1062. }
  1063. return FINISHED;
  1064. }
  1065. /********************************************************************************************/
  1066. int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  1067. {
  1068. if(!strcmp(prog_identifier_from_cmdline,"set")) dz->process = CANTOR;
  1069. else {
  1070. sprintf(errstr,"Unknown program identification string '%s'\n",prog_identifier_from_cmdline);
  1071. return(USAGE_ONLY);
  1072. }
  1073. return(FINISHED);
  1074. }
  1075. /******************************** SETUP_AND_INIT_INPUT_BRKTABLE_CONSTANTS ********************************/
  1076. int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt)
  1077. {
  1078. int n;
  1079. if((dz->brk = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  1080. sprintf(errstr,"setup_and_init_input_brktable_constants(): 1\n");
  1081. return(MEMORY_ERROR);
  1082. }
  1083. if((dz->brkptr = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  1084. sprintf(errstr,"setup_and_init_input_brktable_constants(): 6\n");
  1085. return(MEMORY_ERROR);
  1086. }
  1087. if((dz->brksize = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  1088. sprintf(errstr,"setup_and_init_input_brktable_constants(): 2\n");
  1089. return(MEMORY_ERROR);
  1090. }
  1091. if((dz->firstval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  1092. sprintf(errstr,"setup_and_init_input_brktable_constants(): 3\n");
  1093. return(MEMORY_ERROR);
  1094. }
  1095. if((dz->lastind = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  1096. sprintf(errstr,"setup_and_init_input_brktable_constants(): 4\n");
  1097. return(MEMORY_ERROR);
  1098. }
  1099. if((dz->lastval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  1100. sprintf(errstr,"setup_and_init_input_brktable_constants(): 5\n");
  1101. return(MEMORY_ERROR);
  1102. }
  1103. if((dz->brkinit = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  1104. sprintf(errstr,"setup_and_init_input_brktable_constants(): 7\n");
  1105. return(MEMORY_ERROR);
  1106. }
  1107. for(n=0;n<brkcnt;n++) {
  1108. dz->brk[n] = NULL;
  1109. dz->brkptr[n] = NULL;
  1110. dz->brkinit[n] = 0;
  1111. dz->brksize[n] = 0;
  1112. }
  1113. return(FINISHED);
  1114. }
  1115. /******************************** USAGE2 ********************************/
  1116. int usage2(char *str)
  1117. {
  1118. if(!strcmp(str,"set")) {
  1119. fprintf(stdout,
  1120. "USAGE:\n"
  1121. "cantor set infile outfile 1-2 holesize holedig depth-trig splicelen maxdur [-e]\n"
  1122. "cantor set infile outfile 3 holelev holedig layercnt layerdec maxdur\n"
  1123. "\n"
  1124. "Gradually cut hole in central 3rd of input sound.\n"
  1125. "Cut holes in central 3rd of the remaining segments, and so on.\n"
  1126. "Output is a sequence of sounds with more and more holes cut.\n"
  1127. "Mode 3 uses superimposed vibrati envelopes\n"
  1128. "\n"
  1129. "MODES 1 and 2\n"
  1130. "\n"
  1131. "HOLESIZE MODE 1: Percentage of current segment-time taken up by hole.\n"
  1132. " Size of hole depends on size of segment being cut.\n"
  1133. " MODE 2: (Fixed) Duration of holes.\n"
  1134. "HOLEDIG Depth of each cut as hole is gradually created (>0-1).\n"
  1135. "DEPTH-TRIG Level-Depth of hole triggering next hole-cutting.\n"
  1136. "SPLICELEN Splicelength in mS.\n"
  1137. "MAXDUR Maximum total duration of all the output sound.\n"
  1138. "-e Extend sound beyond splicelen limits.\n"
  1139. "\n"
  1140. "MODES 3\n"
  1141. "\n"
  1142. "HOLELEV Level of signal at base of holes.\n"
  1143. "HOLEDIG How many repets before full-depth reached.\n"
  1144. "LAYERCNT Number of vibrato layers used.\n"
  1145. "LAYERDEC Depth of next vibrato in relation to previous\n"
  1146. "MAXDUR Maximum total duration of all the output sound.\n"
  1147. "\n");
  1148. } else
  1149. fprintf(stdout,"Unknown option '%s'\n",str);
  1150. return(USAGE_ONLY);
  1151. }
  1152. int usage3(char *str1,char *str2)
  1153. {
  1154. fprintf(stderr,"Insufficient parameters on command line.\n");
  1155. return(USAGE_ONLY);
  1156. }
  1157. /******************************** CANTOR ********************************/
  1158. int cantor(dataptr dz)
  1159. {
  1160. int exit_status, status;
  1161. char thisnum[200], filename[400];
  1162. double holsttfrac = 1.0, holendfrac = 1.0;
  1163. float *ibuf = dz->sampbuf[0], *obuf = dz->sampbuf[1];
  1164. int startseg = 0, sum_total_samps = 0, fileno = 0, woblcnt = 0;
  1165. int endseg = dz->insams[0];
  1166. double splincr = 1.0/dz->iparam[CA_SPLEN];
  1167. int stepcnt = 0;
  1168. double maxatten = 0.0;
  1169. if(dz->mode == 2) {
  1170. stepcnt = dz->iparam[CA_HOLEDIG];
  1171. maxatten = 1.0 - dz->param[CA_HOLEN];
  1172. }
  1173. if((exit_status = read_samps(ibuf,dz))<0)
  1174. return(exit_status);
  1175. if(dz->mode == 0) {
  1176. holsttfrac = (1.0 - dz->param[CA_HOLEN])/2.0;
  1177. holendfrac = 1.0 - holsttfrac;
  1178. }
  1179. for(;;) {
  1180. if(fileno > 0) {
  1181. if(sndcloseEx(dz->ofd) < 0) {
  1182. sprintf(errstr,"Failed to close output file %d\n",fileno+1);
  1183. return(SYSTEM_ERROR);
  1184. }
  1185. dz->ofd = -1;
  1186. strcpy(filename,dz->outfilename);
  1187. sprintf(thisnum,"%d",fileno);
  1188. strcat(filename,thisnum);
  1189. strcat(filename,".wav");
  1190. if((exit_status = create_sized_outfile(filename,dz))<0)
  1191. return(exit_status);
  1192. sndseekEx(dz->ifd[0],0,0);
  1193. reset_filedata_counters(dz);
  1194. }
  1195. memcpy((char *)obuf,(char *)ibuf,dz->insams[0] * sizeof(float));
  1196. if(dz->mode == 2)
  1197. exit_status = woblwobl(ibuf,obuf,&woblcnt,stepcnt,maxatten,dz);
  1198. else
  1199. exit_status = cut_hole(startseg,endseg,holsttfrac,holendfrac,splincr,ibuf,obuf,0,dz);
  1200. if(exit_status<0)
  1201. return GOAL_FAILED;
  1202. status = exit_status;
  1203. if((exit_status = write_samps(obuf,dz->insams[0],dz))<0)
  1204. return(exit_status);
  1205. if(status != CONTINUE)
  1206. break;
  1207. memset((char *)obuf,0,dz->insams[0] * sizeof(float));
  1208. sum_total_samps += dz->total_samps_written;
  1209. if(sum_total_samps >= dz->iparam[CA_MAXDUR])
  1210. return FINISHED;
  1211. fileno++;
  1212. }
  1213. return exit_status;
  1214. }
  1215. /******************************** CUT_HOLE ********************************/
  1216. int cut_hole(int startseg,int endseg,double holsttfrac,double holendfrac,double splincr,float *ibuf,float *obuf,int holeno,dataptr dz)
  1217. {
  1218. int chans = dz->infile->channels, k, j, m;
  1219. int seglen, holstt, holend, hollen, digdepth, digcnt, holendsttsplice, splen, digmax;
  1220. int gphollen, halfgphollen, holgpcentre, over;
  1221. double spliceval, centrelevel;
  1222. int *exitval = dz->iparray[1];
  1223. int passlimit = (int)round(pow(2,holeno));
  1224. int passno = dz->iparray[2][holeno];
  1225. seglen = endseg - startseg;
  1226. splen = dz->iparam[CA_SPLEN]; // and its length
  1227. digdepth = dz->dig; // digdepth is how far we dig hole (furTher) on each pass, till will reach full cut
  1228. if(dz->mode == 0) {
  1229. if(seglen <= 0) {
  1230. exitval[holeno] = FINISHED;
  1231. return FINISHED;
  1232. }
  1233. holstt = (int)round((seglen/chans) * holsttfrac) + startseg;
  1234. holend = (int)round((seglen/chans) * holendfrac) + startseg;
  1235. hollen = holend - holstt; // Find start and end of hole, and its length
  1236. if(dz->vflag[0]) { // If extending to smallest possible segment
  1237. if(hollen <= 0) { // If no hole to dig, quit
  1238. exitval[holeno] = FINISHED;
  1239. return FINISHED;
  1240. }
  1241. else if(hollen <= 2 * splen) { // Or if hole is smaller than 2-splices, reduce splicelens
  1242. splen = hollen/2;
  1243. digdepth = (int)round((double)splen/(double)dz->digsteps);
  1244. if(digdepth < 1)
  1245. return FINISHED;
  1246. splincr = 1.0/(double)splen;
  1247. }
  1248. } else { // Once holes smaller than 2 splices, quit
  1249. if(hollen <= 2 * splen) {
  1250. exitval[holeno] = FINISHED;
  1251. return FINISHED;
  1252. }
  1253. }
  1254. } else {
  1255. if(seglen <= dz->iparam[CA_HOLEN]) {
  1256. exitval[holeno] = FINISHED;
  1257. return FINISHED;
  1258. }
  1259. gphollen = dz->iparam[CA_HOLEN]/chans;
  1260. halfgphollen = gphollen/2;
  1261. holgpcentre = (seglen/chans)/2;
  1262. holstt = holgpcentre - halfgphollen;
  1263. holend = holstt + gphollen;
  1264. holstt *= chans;
  1265. holend *= chans;
  1266. holstt += startseg;
  1267. holend += startseg;
  1268. if((over = startseg - holstt) > 0) {
  1269. holstt += over;
  1270. holend += over;
  1271. if(holend >= endseg) {
  1272. return FINISHED;
  1273. }
  1274. } else if((over = holend - endseg) > 0) {
  1275. holend -= over;
  1276. holstt -= over;
  1277. if(holstt < startseg) {
  1278. }
  1279. return FINISHED;
  1280. }
  1281. splincr = 1.0/(double)splen;
  1282. }
  1283. holendsttsplice = holend - splen;
  1284. digcnt = dz->iparray[0][holeno];
  1285. holstt *= chans;
  1286. holend *= chans;
  1287. holendsttsplice *= chans;
  1288. spliceval = 1.0 - splincr;
  1289. digmax = min(splen, digcnt * digdepth); // Maximum depth (therefore sample count) to which we dig splice on this pass
  1290. holendsttsplice = holend - digmax; // Find where upsplice at end of hole begins
  1291. for(k = 0, j = holstt; k < digmax;k++,j+=chans) {
  1292. for(m=0;m<chans;m++) // Dig downsplice as far as ness on this pass
  1293. obuf[j+m] = (float)(ibuf[j+m] * spliceval);
  1294. spliceval = max(0.0,spliceval - splincr);
  1295. }
  1296. centrelevel = spliceval;
  1297. while(j < holendsttsplice) { // Central part is reduced in level (until it gets to zero after successive passes)
  1298. obuf[j] = (float)(ibuf[j] * spliceval);
  1299. j++;
  1300. }
  1301. spliceval += splincr;
  1302. for(k = 0; k < digmax;k++,j+=chans) { // Do upsplice
  1303. for(m=0;m<chans;m++)
  1304. obuf[j+m] = (float)(ibuf[j+m] * spliceval);
  1305. spliceval = min(1.0,spliceval + splincr);
  1306. }
  1307. passno++;
  1308. dz->iparray[2][holeno] = passno; // Count number of passes, so we know when we're at last one
  1309. if(passno >= passlimit)
  1310. (dz->iparray[0][holeno])++; // Count no of digs, so we know how deep to dig in next sound
  1311. if(centrelevel < dz->param[CA_TRIGLEV]) { // If centre of hole reaches triggering level
  1312. // Dig holes in the two sidearms of this segment
  1313. if((exitval[holeno+1] = cut_hole(startseg,holstt,holsttfrac,holendfrac,splincr,ibuf,obuf,holeno+1,dz))<0)
  1314. return(exitval[holeno+1]);
  1315. if(exitval[holeno+1] == FINISHED && (passno >= passlimit))
  1316. exitval[holeno] = FINISHED;
  1317. if((exitval[holeno+1] = cut_hole(holend,endseg,holsttfrac,holendfrac,splincr,ibuf,obuf,holeno+1,dz))<0)
  1318. return(exitval[holeno+1]);
  1319. if(exitval[holeno+1] == FINISHED && (passno >= passlimit))
  1320. exitval[holeno] = FINISHED;
  1321. }
  1322. if(exitval[holeno] == FINISHED && (passno >= passlimit)) {
  1323. return FINISHED;
  1324. }
  1325. exitval[holeno] = CONTINUE;
  1326. return CONTINUE;
  1327. }
  1328. /**************************** CREATE_CANTOR_SNDBUFS ****************************/
  1329. int create_cantor_sndbufs(dataptr dz)
  1330. {
  1331. int n;
  1332. int bigbufsize;
  1333. int framesize;
  1334. framesize = F_SECSIZE * dz->infile->channels;
  1335. dz->bufcnt = 2;
  1336. if((dz->sampbuf = (float **)malloc(sizeof(float *) * (dz->bufcnt+1)))==NULL) {
  1337. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffers.\n");
  1338. return(MEMORY_ERROR);
  1339. }
  1340. if((dz->sbufptr = (float **)malloc(sizeof(float *) * dz->bufcnt))==NULL) {
  1341. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffer pointers.\n");
  1342. return(MEMORY_ERROR);
  1343. }
  1344. dz->buflen = dz->insams[0];
  1345. dz->buflen = (dz->buflen / framesize) * framesize;
  1346. dz->buflen += framesize;
  1347. bigbufsize = dz->buflen * sizeof(float);
  1348. if(bigbufsize <=0 || bigbufsize * 2 <=0) {
  1349. sprintf(errstr,"Input sound too large for this process\n");
  1350. return(DATA_ERROR);
  1351. }
  1352. if((dz->bigbuf = (float *)malloc(bigbufsize * dz->bufcnt)) == NULL) {
  1353. sprintf(errstr,"INSUFFICIENT MEMORY to create sound buffers.\n");
  1354. return(PROGRAM_ERROR);
  1355. }
  1356. for(n=0;n<dz->bufcnt;n++)
  1357. dz->sbufptr[n] = dz->sampbuf[n] = dz->bigbuf + (dz->buflen * n);
  1358. dz->sampbuf[n] = dz->bigbuf + (dz->buflen * n);
  1359. return(FINISHED);
  1360. }
  1361. /****************************** GET_MODE *********************************/
  1362. int get_the_mode_from_cmdline(char *str,dataptr dz)
  1363. {
  1364. char temp[200], *p;
  1365. if(sscanf(str,"%s",temp)!=1) {
  1366. sprintf(errstr,"Cannot read mode of program.\n");
  1367. return(USAGE_ONLY);
  1368. }
  1369. p = temp + strlen(temp) - 1;
  1370. while(p >= temp) {
  1371. if(!isdigit(*p)) {
  1372. fprintf(stderr,"Invalid mode of program entered.\n");
  1373. return(USAGE_ONLY);
  1374. }
  1375. p--;
  1376. }
  1377. if(sscanf(str,"%d",&dz->mode)!=1) {
  1378. fprintf(stderr,"Cannot read mode of program.\n");
  1379. return(USAGE_ONLY);
  1380. }
  1381. if(dz->mode <= 0 || dz->mode > dz->maxmode) {
  1382. fprintf(stderr,"Program mode value [%d] is out of range [1 - %d].\n",dz->mode,dz->maxmode);
  1383. return(USAGE_ONLY);
  1384. }
  1385. dz->mode--; /* CHANGE TO INTERNAL REPRESENTATION OF MODE NO */
  1386. return(FINISHED);
  1387. }
  1388. /****************************** WOBLWOBL *********************************/
  1389. int woblwobl(float *ibuf,float *obuf,int *woblcnt,int stepcnt,double maxatten,dataptr dz)
  1390. {
  1391. double factor, interval, tabpos, tablen = (double)CACOSTABSIZ, frac, diff, val;
  1392. double *tab;
  1393. int t, n, ipos;
  1394. int fac;
  1395. factor = 1.0; // How deep is the vibrato layer
  1396. for(t=0;t < dz->iparam[CA_WOBBLES];t++) { // Apply each vibrato layer in turn
  1397. tab = dz->parray[t];
  1398. fac = (t*2) + 1; // Read table faster for later (faster) vibrato layers
  1399. interval = pow(2.0,((double)(*woblcnt)/(double)stepcnt)); // Range 1 - 2 oct
  1400. interval -= 1.0; // Range 0 - 1 oct
  1401. interval *= factor; // Reduce interval for later wobbles
  1402. interval = min(interval,1.0); // Block at 8va max
  1403. interval *= maxatten; // Confine loudness variation to range specified
  1404. tabpos = 0.0;
  1405. if(interval > 0.0) {
  1406. for(n=0;n<dz->insams[0];n++) {
  1407. tabpos = ((double)n/(double)dz->insams[0]) * fac * tablen;
  1408. while(tabpos >= CACOSTABSIZ)
  1409. tabpos -= CACOSTABSIZ;
  1410. ipos = (int)floor(tabpos);
  1411. frac = tabpos - (double)ipos;
  1412. diff = tab[ipos+1] - tab[ipos];
  1413. frac *= diff;
  1414. val = tab[ipos] + frac; // Val from inverted cos table range 0 up to 1
  1415. val *= interval; // range 0 up to maxrange
  1416. val = 1.0 - val; // Val from 1 down to (1.0-maxatten)
  1417. obuf[n] = (float)(obuf[n] * val);
  1418. }
  1419. }
  1420. factor *= dz->param[CA_WOBDEC]; // Reduce depth of next vibrato layer
  1421. }
  1422. (*woblcnt)++;
  1423. return(CONTINUE);
  1424. }