flatten.c 59 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599
  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. // HEREH : ADD PARAMETER TO AVOID int DECAY TAIL BEING FLATTENED
  22. // compile and test on files on loom
  23. #include <stdio.h>
  24. #include <stdlib.h>
  25. #include <structures.h>
  26. #include <tkglobals.h>
  27. #include <pnames.h>
  28. #include <filetype.h>
  29. #include <processno.h>
  30. #include <modeno.h>
  31. #include <logic.h>
  32. #include <globcon.h>
  33. #include <cdpmain.h>
  34. #include <math.h>
  35. #include <mixxcon.h>
  36. #include <osbind.h>
  37. #include <standalone.h>
  38. #include <ctype.h>
  39. #include <sfsys.h>
  40. #include <string.h>
  41. #include <srates.h>
  42. #ifdef unix
  43. #define round(x) lround((x))
  44. #endif
  45. #ifndef HUGE
  46. #define HUGE 3.40282347e+38F
  47. #endif
  48. #define WINS_PER_ELEMENT (3) // No of envelope windows per element-to-find
  49. #define MAXLEV (0.95) // Maximum output level
  50. char errstr[2400];
  51. int anal_infiles = 1;
  52. int sloom = 0;
  53. int sloombatch = 0;
  54. const char* cdp_version = "6.1.0";
  55. //CDP LIB REPLACEMENTS
  56. static int check_flatten_param_validity_and_consistency(dataptr dz);
  57. static int setup_flatten_application(dataptr dz);
  58. static int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz);
  59. static int parse_infile_and_check_type(char **cmdline,dataptr dz);
  60. static int setup_flatten_param_ranges_and_defaults(dataptr dz);
  61. static int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz);
  62. static int setup_and_init_input_param_activity(dataptr dz,int tipc);
  63. static int setup_input_param_defaultval_stores(int tipc,aplptr ap);
  64. static int establish_application(dataptr dz);
  65. static int initialise_vflags(dataptr dz);
  66. static int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz);
  67. static int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz);
  68. static int mark_parameter_types(dataptr dz,aplptr ap);
  69. static int assign_file_data_storage(int infilecnt,dataptr dz);
  70. static int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q);
  71. static int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz);
  72. //static int get_the_mode_from_cmdline(char *str,dataptr dz);
  73. static int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt);
  74. static int create_flatten_sndbufs(dataptr dz);
  75. static int flatten_param_preprocess(dataptr dz);
  76. static int is_phase_change(float *ibuf,int *all_zero,int *phasechange,int wstart,int wend);
  77. static int find_phasechange_position(float *ibuf,int *zcrospos,int wstart,int wend);
  78. static int flatten(dataptr dz);
  79. /**************************************** MAIN *********************************************/
  80. int main(int argc,char *argv[])
  81. {
  82. int exit_status;
  83. dataptr dz = NULL;
  84. char **cmdline;
  85. int cmdlinecnt;
  86. int n;
  87. aplptr ap;
  88. int is_launched = FALSE;
  89. if(argc==2 && (strcmp(argv[1],"--version") == 0)) {
  90. fprintf(stdout,"%s\n",cdp_version);
  91. fflush(stdout);
  92. return 0;
  93. }
  94. /* CHECK FOR SOUNDLOOM */
  95. if((sloom = sound_loom_in_use(&argc,&argv)) > 1) {
  96. sloom = 0;
  97. sloombatch = 1;
  98. }
  99. if(sflinit("cdp")){
  100. sfperror("cdp: initialisation\n");
  101. return(FAILED);
  102. }
  103. /* SET UP THE PRINCIPLE DATASTRUCTURE */
  104. if((exit_status = establish_datastructure(&dz))<0) { // CDP LIB
  105. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  106. return(FAILED);
  107. }
  108. if(!sloom) {
  109. if(argc == 1) {
  110. usage1();
  111. return(FAILED);
  112. } else if(argc == 2) {
  113. usage2(argv[1]);
  114. return(FAILED);
  115. }
  116. }
  117. if(!sloom) {
  118. if((exit_status = make_initial_cmdline_check(&argc,&argv))<0) { // CDP LIB
  119. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  120. return(FAILED);
  121. }
  122. cmdline = argv;
  123. cmdlinecnt = argc;
  124. if((get_the_process_no(argv[0],dz))<0)
  125. return(FAILED);
  126. cmdline++;
  127. cmdlinecnt--;
  128. dz->maxmode = 0;
  129. // setup_particular_application =
  130. if((exit_status = setup_flatten_application(dz))<0) {
  131. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  132. return(FAILED);
  133. }
  134. if((exit_status = count_and_allocate_for_infiles(cmdlinecnt,cmdline,dz))<0) { // CDP LIB
  135. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  136. return(FAILED);
  137. }
  138. } else {
  139. //parse_TK_data() =
  140. if((exit_status = parse_sloom_data(argc,argv,&cmdline,&cmdlinecnt,dz))<0) {
  141. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  142. return(exit_status);
  143. }
  144. }
  145. ap = dz->application;
  146. // parse_infile_and_hone_type() =
  147. if((exit_status = parse_infile_and_check_type(cmdline,dz))<0) {
  148. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  149. return(FAILED);
  150. }
  151. // setup_param_ranges_and_defaults() =
  152. if((exit_status = setup_flatten_param_ranges_and_defaults(dz))<0) {
  153. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  154. return(FAILED);
  155. }
  156. // open_first_infile CDP LIB
  157. if((exit_status = open_first_infile(cmdline[0],dz))<0) {
  158. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  159. return(FAILED);
  160. }
  161. cmdlinecnt--;
  162. cmdline++;
  163. // handle_extra_infiles() : redundant
  164. // handle_outfile() =
  165. if((exit_status = handle_the_outfile(&cmdlinecnt,&cmdline,dz))<0) {
  166. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  167. return(FAILED);
  168. }
  169. // handle_formants() redundant
  170. // handle_formant_quiksearch() redundant
  171. // handle_special_data() redundant
  172. if((exit_status = read_parameters_and_flags(&cmdline,&cmdlinecnt,dz))<0) { // CDP LIB
  173. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  174. return(FAILED);
  175. }
  176. // check_param_validity_and_consistency....
  177. if((exit_status = check_flatten_param_validity_and_consistency(dz))<0) {
  178. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  179. return(FAILED);
  180. }
  181. is_launched = TRUE;
  182. dz->bufcnt = 2;
  183. if((dz->sampbuf = (float **)malloc(sizeof(float *) * (dz->bufcnt+1)))==NULL) {
  184. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffers.\n");
  185. return(MEMORY_ERROR);
  186. }
  187. if((dz->sbufptr = (float **)malloc(sizeof(float *) * dz->bufcnt))==NULL) {
  188. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffer pointers.\n");
  189. return(MEMORY_ERROR);
  190. }
  191. for(n = 0;n <dz->bufcnt; n++)
  192. dz->sampbuf[n] = dz->sbufptr[n] = (float *)0;
  193. dz->sampbuf[n] = (float *)0;
  194. if((exit_status = create_flatten_sndbufs(dz))<0) { // CDP LIB
  195. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  196. return(FAILED);
  197. }
  198. //param_preprocess ...
  199. if((exit_status = flatten_param_preprocess(dz))<0) {
  200. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  201. return(FAILED);
  202. }
  203. //spec_process_file =
  204. if((exit_status = flatten(dz))<0) {
  205. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  206. return(FAILED);
  207. }
  208. if((exit_status = complete_output(dz))<0) { // CDP LIB
  209. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  210. return(FAILED);
  211. }
  212. exit_status = print_messages_and_close_sndfiles(FINISHED,is_launched,dz); // CDP LIB
  213. free(dz);
  214. return(SUCCEEDED);
  215. }
  216. /**********************************************
  217. REPLACED CDP LIB FUNCTIONS
  218. **********************************************/
  219. /****************************** SET_PARAM_DATA *********************************/
  220. int set_param_data(aplptr ap, int special_data,int maxparamcnt,int paramcnt,char *paramlist)
  221. {
  222. ap->special_data = (char)special_data;
  223. ap->param_cnt = (char)paramcnt;
  224. ap->max_param_cnt = (char)maxparamcnt;
  225. if(ap->max_param_cnt>0) {
  226. if((ap->param_list = (char *)malloc((size_t)(ap->max_param_cnt+1)))==NULL) {
  227. sprintf(errstr,"INSUFFICIENT MEMORY: for param_list\n");
  228. return(MEMORY_ERROR);
  229. }
  230. strcpy(ap->param_list,paramlist);
  231. }
  232. return(FINISHED);
  233. }
  234. /****************************** SET_VFLGS *********************************/
  235. int set_vflgs
  236. (aplptr ap,char *optflags,int optcnt,char *optlist,char *varflags,int vflagcnt, int vparamcnt,char *varlist)
  237. {
  238. ap->option_cnt = (char) optcnt; /*RWD added cast */
  239. if(optcnt) {
  240. if((ap->option_list = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  241. sprintf(errstr,"INSUFFICIENT MEMORY: for option_list\n");
  242. return(MEMORY_ERROR);
  243. }
  244. strcpy(ap->option_list,optlist);
  245. if((ap->option_flags = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  246. sprintf(errstr,"INSUFFICIENT MEMORY: for option_flags\n");
  247. return(MEMORY_ERROR);
  248. }
  249. strcpy(ap->option_flags,optflags);
  250. }
  251. ap->vflag_cnt = (char) vflagcnt;
  252. ap->variant_param_cnt = (char) vparamcnt;
  253. if(vflagcnt) {
  254. if((ap->variant_list = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  255. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_list\n");
  256. return(MEMORY_ERROR);
  257. }
  258. strcpy(ap->variant_list,varlist);
  259. if((ap->variant_flags = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  260. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_flags\n");
  261. return(MEMORY_ERROR);
  262. }
  263. strcpy(ap->variant_flags,varflags);
  264. }
  265. return(FINISHED);
  266. }
  267. /***************************** APPLICATION_INIT **************************/
  268. int application_init(dataptr dz)
  269. {
  270. int exit_status;
  271. int storage_cnt;
  272. int tipc, brkcnt;
  273. aplptr ap = dz->application;
  274. if(ap->vflag_cnt>0)
  275. initialise_vflags(dz);
  276. tipc = ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt;
  277. ap->total_input_param_cnt = (char)tipc;
  278. if(tipc>0) {
  279. if((exit_status = setup_input_param_range_stores(tipc,ap))<0)
  280. return(exit_status);
  281. if((exit_status = setup_input_param_defaultval_stores(tipc,ap))<0)
  282. return(exit_status);
  283. if((exit_status = setup_and_init_input_param_activity(dz,tipc))<0)
  284. return(exit_status);
  285. }
  286. brkcnt = tipc;
  287. //THERE ARE NO INPUTFILE brktables USED IN THIS PROCESS
  288. if(brkcnt>0) {
  289. if((exit_status = setup_and_init_input_brktable_constants(dz,brkcnt))<0)
  290. return(exit_status);
  291. }
  292. if((storage_cnt = tipc + ap->internal_param_cnt)>0) {
  293. if((exit_status = setup_parameter_storage_and_constants(storage_cnt,dz))<0)
  294. return(exit_status);
  295. if((exit_status = initialise_is_int_and_no_brk_constants(storage_cnt,dz))<0)
  296. return(exit_status);
  297. }
  298. if((exit_status = mark_parameter_types(dz,ap))<0)
  299. return(exit_status);
  300. // establish_infile_constants() replaced by
  301. dz->infilecnt = 1;
  302. //establish_bufptrs_and_extra_buffers():
  303. return(FINISHED);
  304. }
  305. /********************** SETUP_PARAMETER_STORAGE_AND_CONSTANTS ********************/
  306. /* RWD mallo changed to calloc; helps debug verison run as release! */
  307. int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz)
  308. {
  309. if((dz->param = (double *)calloc(storage_cnt, sizeof(double)))==NULL) {
  310. sprintf(errstr,"setup_parameter_storage_and_constants(): 1\n");
  311. return(MEMORY_ERROR);
  312. }
  313. if((dz->iparam = (int *)calloc(storage_cnt, sizeof(int) ))==NULL) {
  314. sprintf(errstr,"setup_parameter_storage_and_constants(): 2\n");
  315. return(MEMORY_ERROR);
  316. }
  317. if((dz->is_int = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  318. sprintf(errstr,"setup_parameter_storage_and_constants(): 3\n");
  319. return(MEMORY_ERROR);
  320. }
  321. if((dz->no_brk = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  322. sprintf(errstr,"setup_parameter_storage_and_constants(): 5\n");
  323. return(MEMORY_ERROR);
  324. }
  325. return(FINISHED);
  326. }
  327. /************** INITIALISE_IS_INT_AND_NO_BRK_CONSTANTS *****************/
  328. int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz)
  329. {
  330. int n;
  331. for(n=0;n<storage_cnt;n++) {
  332. dz->is_int[n] = (char)0;
  333. dz->no_brk[n] = (char)0;
  334. }
  335. return(FINISHED);
  336. }
  337. /***************************** MARK_PARAMETER_TYPES **************************/
  338. int mark_parameter_types(dataptr dz,aplptr ap)
  339. {
  340. int n, m; /* PARAMS */
  341. for(n=0;n<ap->max_param_cnt;n++) {
  342. switch(ap->param_list[n]) {
  343. case('0'): break; /* dz->is_active[n] = 0 is default */
  344. case('i'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1;dz->no_brk[n] = (char)1; break;
  345. case('I'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1; break;
  346. case('d'): dz->is_active[n] = (char)1; dz->no_brk[n] = (char)1; break;
  347. case('D'): dz->is_active[n] = (char)1; /* normal case: double val or brkpnt file */ break;
  348. default:
  349. sprintf(errstr,"Programming error: invalid parameter type in mark_parameter_types()\n");
  350. return(PROGRAM_ERROR);
  351. }
  352. } /* OPTIONS */
  353. for(n=0,m=ap->max_param_cnt;n<ap->option_cnt;n++,m++) {
  354. switch(ap->option_list[n]) {
  355. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  356. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  357. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  358. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  359. default:
  360. sprintf(errstr,"Programming error: invalid option type in mark_parameter_types()\n");
  361. return(PROGRAM_ERROR);
  362. }
  363. } /* VARIANTS */
  364. for(n=0,m=ap->max_param_cnt + ap->option_cnt;n < ap->variant_param_cnt; n++, m++) {
  365. switch(ap->variant_list[n]) {
  366. case('0'): break;
  367. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  368. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  369. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  370. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  371. default:
  372. sprintf(errstr,"Programming error: invalid variant type in mark_parameter_types()\n");
  373. return(PROGRAM_ERROR);
  374. }
  375. } /* INTERNAL */
  376. for(n=0,
  377. m=ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt; n<ap->internal_param_cnt; n++,m++) {
  378. switch(ap->internal_param_list[n]) {
  379. case('0'): break; /* dummy variables: variables not used: but important for internal paream numbering!! */
  380. case('i'): dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  381. case('d'): dz->no_brk[m] = (char)1; break;
  382. default:
  383. sprintf(errstr,"Programming error: invalid internal param type in mark_parameter_types()\n");
  384. return(PROGRAM_ERROR);
  385. }
  386. }
  387. return(FINISHED);
  388. }
  389. /************************ HANDLE_THE_OUTFILE *********************/
  390. int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz)
  391. {
  392. int exit_status;
  393. char *filename = (*cmdline)[0];
  394. if(filename[0]=='-' && filename[1]=='f') {
  395. dz->floatsam_output = 1;
  396. dz->true_outfile_stype = SAMP_FLOAT;
  397. filename+= 2;
  398. }
  399. if(!sloom) {
  400. if(file_has_invalid_startchar(filename) || value_is_numeric(filename)) {
  401. sprintf(errstr,"Outfile name %s has invalid start character(s) or looks too much like a number.\n",filename);
  402. return(DATA_ERROR);
  403. }
  404. }
  405. strcpy(dz->outfilename,filename);
  406. if((exit_status = create_sized_outfile(filename,dz))<0)
  407. return(exit_status);
  408. (*cmdline)++;
  409. (*cmdlinecnt)--;
  410. return(FINISHED);
  411. }
  412. /***************************** ESTABLISH_APPLICATION **************************/
  413. int establish_application(dataptr dz)
  414. {
  415. aplptr ap;
  416. if((dz->application = (aplptr)malloc(sizeof (struct applic)))==NULL) {
  417. sprintf(errstr,"establish_application()\n");
  418. return(MEMORY_ERROR);
  419. }
  420. ap = dz->application;
  421. memset((char *)ap,0,sizeof(struct applic));
  422. return(FINISHED);
  423. }
  424. /************************* INITIALISE_VFLAGS *************************/
  425. int initialise_vflags(dataptr dz)
  426. {
  427. int n;
  428. if((dz->vflag = (char *)malloc(dz->application->vflag_cnt * sizeof(char)))==NULL) {
  429. sprintf(errstr,"INSUFFICIENT MEMORY: vflag store,\n");
  430. return(MEMORY_ERROR);
  431. }
  432. for(n=0;n<dz->application->vflag_cnt;n++)
  433. dz->vflag[n] = FALSE;
  434. return FINISHED;
  435. }
  436. /************************* SETUP_INPUT_PARAM_DEFAULTVALS *************************/
  437. int setup_input_param_defaultval_stores(int tipc,aplptr ap)
  438. {
  439. int n;
  440. if((ap->default_val = (double *)malloc(tipc * sizeof(double)))==NULL) {
  441. sprintf(errstr,"INSUFFICIENT MEMORY for application default values store\n");
  442. return(MEMORY_ERROR);
  443. }
  444. for(n=0;n<tipc;n++)
  445. ap->default_val[n] = 0.0;
  446. return(FINISHED);
  447. }
  448. /***************************** SETUP_AND_INIT_INPUT_PARAM_ACTIVITY **************************/
  449. int setup_and_init_input_param_activity(dataptr dz,int tipc)
  450. {
  451. int n;
  452. if((dz->is_active = (char *)malloc((size_t)tipc))==NULL) {
  453. sprintf(errstr,"setup_and_init_input_param_activity()\n");
  454. return(MEMORY_ERROR);
  455. }
  456. for(n=0;n<tipc;n++)
  457. dz->is_active[n] = (char)0;
  458. return(FINISHED);
  459. }
  460. /************************* SETUP_FLATTEN_APPLICATION *******************/
  461. int setup_flatten_application(dataptr dz)
  462. {
  463. int exit_status;
  464. aplptr ap;
  465. if((exit_status = establish_application(dz))<0) // GLOBAL
  466. return(FAILED);
  467. ap = dz->application;
  468. // SEE parstruct FOR EXPLANATION of next 2 functions
  469. if((exit_status = set_param_data(ap,0 ,2,2,"dd"))<0)
  470. return(FAILED);
  471. if((exit_status = set_vflgs(ap,"t",1,"d","",0,0,""))<0)
  472. return(FAILED);
  473. // set_legal_infile_structure -->
  474. dz->has_otherfile = FALSE;
  475. // assign_process_logic -->
  476. dz->input_data_type = SNDFILES_ONLY;
  477. dz->process_type = EQUAL_SNDFILE;
  478. dz->outfiletype = SNDFILE_OUT;
  479. return application_init(dz); //GLOBAL
  480. }
  481. /************************* PARSE_INFILE_AND_CHECK_TYPE *******************/
  482. int parse_infile_and_check_type(char **cmdline,dataptr dz)
  483. {
  484. int exit_status;
  485. infileptr infile_info;
  486. if(!sloom) {
  487. if((infile_info = (infileptr)malloc(sizeof(struct filedata)))==NULL) {
  488. sprintf(errstr,"INSUFFICIENT MEMORY for infile structure to test file data.");
  489. return(MEMORY_ERROR);
  490. } else if((exit_status = cdparse(cmdline[0],infile_info))<0) {
  491. sprintf(errstr,"Failed to parse input file %s\n",cmdline[0]);
  492. return(PROGRAM_ERROR);
  493. } else if(infile_info->filetype != SNDFILE) {
  494. sprintf(errstr,"File %s is not of correct type\n",cmdline[0]);
  495. return(DATA_ERROR);
  496. } else if(infile_info->channels != MONO) {
  497. sprintf(errstr,"File %s is not a mono soundfile\n",cmdline[0]);
  498. return(DATA_ERROR);
  499. } else if((exit_status = copy_parse_info_to_main_structure(infile_info,dz))<0) {
  500. sprintf(errstr,"Failed to copy file parsing information\n");
  501. return(PROGRAM_ERROR);
  502. }
  503. free(infile_info);
  504. }
  505. return(FINISHED);
  506. }
  507. /************************* SETUP_FLATTEN_PARAM_RANGES_AND_DEFAULTS *******************/
  508. int setup_flatten_param_ranges_and_defaults(dataptr dz)
  509. {
  510. int exit_status;
  511. aplptr ap = dz->application;
  512. // set_param_ranges()
  513. ap->total_input_param_cnt = (char)(ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt);
  514. // NB total_input_param_cnt is > 0 !!!
  515. if((exit_status = setup_input_param_range_stores(ap->total_input_param_cnt,ap))<0)
  516. return(FAILED);
  517. // get_param_ranges()
  518. ap->lo[0] = 0.001;
  519. ap->hi[0] = 100.0;
  520. ap->default_val[0] = 0.1;
  521. ap->lo[1] = 20.0;
  522. ap->hi[1] = 50000.0;
  523. ap->default_val[1] = 20.0;
  524. ap->lo[2] = 0.0;
  525. ap->hi[2] = dz->duration;
  526. ap->default_val[2] = 0.0;
  527. dz->maxmode = 0;
  528. if(!sloom)
  529. put_default_vals_in_all_params(dz);
  530. return(FINISHED);
  531. }
  532. /********************************* PARSE_SLOOM_DATA *********************************/
  533. int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz)
  534. {
  535. int exit_status;
  536. int cnt = 1, infilecnt;
  537. int filesize, insams, inbrksize;
  538. double dummy;
  539. int true_cnt = 0;
  540. aplptr ap;
  541. while(cnt<=PRE_CMDLINE_DATACNT) {
  542. if(cnt > argc) {
  543. sprintf(errstr,"Insufficient data sent from TK\n");
  544. return(DATA_ERROR);
  545. }
  546. switch(cnt) {
  547. case(1):
  548. if(sscanf(argv[cnt],"%d",&dz->process)!=1) {
  549. sprintf(errstr,"Cannot read process no. sent from TK\n");
  550. return(DATA_ERROR);
  551. }
  552. break;
  553. case(2):
  554. if(sscanf(argv[cnt],"%d",&dz->mode)!=1) {
  555. sprintf(errstr,"Cannot read mode no. sent from TK\n");
  556. return(DATA_ERROR);
  557. }
  558. if(dz->mode > 0)
  559. dz->mode--;
  560. //setup_particular_application() =
  561. if((exit_status = setup_flatten_application(dz))<0)
  562. return(exit_status);
  563. ap = dz->application;
  564. break;
  565. case(3):
  566. if(sscanf(argv[cnt],"%d",&infilecnt)!=1) {
  567. sprintf(errstr,"Cannot read infilecnt sent from TK\n");
  568. return(DATA_ERROR);
  569. }
  570. if(infilecnt < 1) {
  571. true_cnt = cnt + 1;
  572. cnt = PRE_CMDLINE_DATACNT; /* force exit from loop after assign_file_data_storage */
  573. }
  574. if((exit_status = assign_file_data_storage(infilecnt,dz))<0)
  575. return(exit_status);
  576. break;
  577. case(INPUT_FILETYPE+4):
  578. if(sscanf(argv[cnt],"%d",&dz->infile->filetype)!=1) {
  579. sprintf(errstr,"Cannot read filetype sent from TK (%s)\n",argv[cnt]);
  580. return(DATA_ERROR);
  581. }
  582. break;
  583. case(INPUT_FILESIZE+4):
  584. if(sscanf(argv[cnt],"%d",&filesize)!=1) {
  585. sprintf(errstr,"Cannot read infilesize sent from TK\n");
  586. return(DATA_ERROR);
  587. }
  588. dz->insams[0] = filesize;
  589. break;
  590. case(INPUT_INSAMS+4):
  591. if(sscanf(argv[cnt],"%d",&insams)!=1) {
  592. sprintf(errstr,"Cannot read insams sent from TK\n");
  593. return(DATA_ERROR);
  594. }
  595. dz->insams[0] = insams;
  596. break;
  597. case(INPUT_SRATE+4):
  598. if(sscanf(argv[cnt],"%d",&dz->infile->srate)!=1) {
  599. sprintf(errstr,"Cannot read srate sent from TK\n");
  600. return(DATA_ERROR);
  601. }
  602. break;
  603. case(INPUT_CHANNELS+4):
  604. if(sscanf(argv[cnt],"%d",&dz->infile->channels)!=1) {
  605. sprintf(errstr,"Cannot read channels sent from TK\n");
  606. return(DATA_ERROR);
  607. }
  608. break;
  609. case(INPUT_STYPE+4):
  610. if(sscanf(argv[cnt],"%d",&dz->infile->stype)!=1) {
  611. sprintf(errstr,"Cannot read stype sent from TK\n");
  612. return(DATA_ERROR);
  613. }
  614. break;
  615. case(INPUT_ORIGSTYPE+4):
  616. if(sscanf(argv[cnt],"%d",&dz->infile->origstype)!=1) {
  617. sprintf(errstr,"Cannot read origstype sent from TK\n");
  618. return(DATA_ERROR);
  619. }
  620. break;
  621. case(INPUT_ORIGRATE+4):
  622. if(sscanf(argv[cnt],"%d",&dz->infile->origrate)!=1) {
  623. sprintf(errstr,"Cannot read origrate sent from TK\n");
  624. return(DATA_ERROR);
  625. }
  626. break;
  627. case(INPUT_MLEN+4):
  628. if(sscanf(argv[cnt],"%d",&dz->infile->Mlen)!=1) {
  629. sprintf(errstr,"Cannot read Mlen sent from TK\n");
  630. return(DATA_ERROR);
  631. }
  632. break;
  633. case(INPUT_DFAC+4):
  634. if(sscanf(argv[cnt],"%d",&dz->infile->Dfac)!=1) {
  635. sprintf(errstr,"Cannot read Dfac sent from TK\n");
  636. return(DATA_ERROR);
  637. }
  638. break;
  639. case(INPUT_ORIGCHANS+4):
  640. if(sscanf(argv[cnt],"%d",&dz->infile->origchans)!=1) {
  641. sprintf(errstr,"Cannot read origchans sent from TK\n");
  642. return(DATA_ERROR);
  643. }
  644. break;
  645. case(INPUT_SPECENVCNT+4):
  646. if(sscanf(argv[cnt],"%d",&dz->infile->specenvcnt)!=1) {
  647. sprintf(errstr,"Cannot read specenvcnt sent from TK\n");
  648. return(DATA_ERROR);
  649. }
  650. dz->specenvcnt = dz->infile->specenvcnt;
  651. break;
  652. case(INPUT_WANTED+4):
  653. if(sscanf(argv[cnt],"%d",&dz->wanted)!=1) {
  654. sprintf(errstr,"Cannot read wanted sent from TK\n");
  655. return(DATA_ERROR);
  656. }
  657. break;
  658. case(INPUT_WLENGTH+4):
  659. if(sscanf(argv[cnt],"%d",&dz->wlength)!=1) {
  660. sprintf(errstr,"Cannot read wlength sent from TK\n");
  661. return(DATA_ERROR);
  662. }
  663. break;
  664. case(INPUT_OUT_CHANS+4):
  665. if(sscanf(argv[cnt],"%d",&dz->out_chans)!=1) {
  666. sprintf(errstr,"Cannot read out_chans sent from TK\n");
  667. return(DATA_ERROR);
  668. }
  669. break;
  670. /* RWD these chanegs to samps - tk will have to deal with that! */
  671. case(INPUT_DESCRIPTOR_BYTES+4):
  672. if(sscanf(argv[cnt],"%d",&dz->descriptor_samps)!=1) {
  673. sprintf(errstr,"Cannot read descriptor_samps sent from TK\n");
  674. return(DATA_ERROR);
  675. }
  676. break;
  677. case(INPUT_IS_TRANSPOS+4):
  678. if(sscanf(argv[cnt],"%d",&dz->is_transpos)!=1) {
  679. sprintf(errstr,"Cannot read is_transpos sent from TK\n");
  680. return(DATA_ERROR);
  681. }
  682. break;
  683. case(INPUT_COULD_BE_TRANSPOS+4):
  684. if(sscanf(argv[cnt],"%d",&dz->could_be_transpos)!=1) {
  685. sprintf(errstr,"Cannot read could_be_transpos sent from TK\n");
  686. return(DATA_ERROR);
  687. }
  688. break;
  689. case(INPUT_COULD_BE_PITCH+4):
  690. if(sscanf(argv[cnt],"%d",&dz->could_be_pitch)!=1) {
  691. sprintf(errstr,"Cannot read could_be_pitch sent from TK\n");
  692. return(DATA_ERROR);
  693. }
  694. break;
  695. case(INPUT_DIFFERENT_SRATES+4):
  696. if(sscanf(argv[cnt],"%d",&dz->different_srates)!=1) {
  697. sprintf(errstr,"Cannot read different_srates sent from TK\n");
  698. return(DATA_ERROR);
  699. }
  700. break;
  701. case(INPUT_DUPLICATE_SNDS+4):
  702. if(sscanf(argv[cnt],"%d",&dz->duplicate_snds)!=1) {
  703. sprintf(errstr,"Cannot read duplicate_snds sent from TK\n");
  704. return(DATA_ERROR);
  705. }
  706. break;
  707. case(INPUT_BRKSIZE+4):
  708. if(sscanf(argv[cnt],"%d",&inbrksize)!=1) {
  709. sprintf(errstr,"Cannot read brksize sent from TK\n");
  710. return(DATA_ERROR);
  711. }
  712. if(inbrksize > 0) {
  713. switch(dz->input_data_type) {
  714. case(WORDLIST_ONLY):
  715. break;
  716. case(PITCH_AND_PITCH):
  717. case(PITCH_AND_TRANSPOS):
  718. case(TRANSPOS_AND_TRANSPOS):
  719. dz->tempsize = inbrksize;
  720. break;
  721. case(BRKFILES_ONLY):
  722. case(UNRANGED_BRKFILE_ONLY):
  723. case(DB_BRKFILES_ONLY):
  724. case(ALL_FILES):
  725. case(ANY_NUMBER_OF_ANY_FILES):
  726. if(dz->extrabrkno < 0) {
  727. sprintf(errstr,"Storage location number for brktable not established by CDP.\n");
  728. return(DATA_ERROR);
  729. }
  730. if(dz->brksize == NULL) {
  731. sprintf(errstr,"CDP has not established storage space for input brktable.\n");
  732. return(PROGRAM_ERROR);
  733. }
  734. dz->brksize[dz->extrabrkno] = inbrksize;
  735. break;
  736. default:
  737. sprintf(errstr,"TK sent brktablesize > 0 for input_data_type [%d] not using brktables.\n",
  738. dz->input_data_type);
  739. return(PROGRAM_ERROR);
  740. }
  741. break;
  742. }
  743. break;
  744. case(INPUT_NUMSIZE+4):
  745. if(sscanf(argv[cnt],"%d",&dz->numsize)!=1) {
  746. sprintf(errstr,"Cannot read numsize sent from TK\n");
  747. return(DATA_ERROR);
  748. }
  749. break;
  750. case(INPUT_LINECNT+4):
  751. if(sscanf(argv[cnt],"%d",&dz->linecnt)!=1) {
  752. sprintf(errstr,"Cannot read linecnt sent from TK\n");
  753. return(DATA_ERROR);
  754. }
  755. break;
  756. case(INPUT_ALL_WORDS+4):
  757. if(sscanf(argv[cnt],"%d",&dz->all_words)!=1) {
  758. sprintf(errstr,"Cannot read all_words sent from TK\n");
  759. return(DATA_ERROR);
  760. }
  761. break;
  762. case(INPUT_ARATE+4):
  763. if(sscanf(argv[cnt],"%f",&dz->infile->arate)!=1) {
  764. sprintf(errstr,"Cannot read arate sent from TK\n");
  765. return(DATA_ERROR);
  766. }
  767. break;
  768. case(INPUT_FRAMETIME+4):
  769. if(sscanf(argv[cnt],"%lf",&dummy)!=1) {
  770. sprintf(errstr,"Cannot read frametime sent from TK\n");
  771. return(DATA_ERROR);
  772. }
  773. dz->frametime = (float)dummy;
  774. break;
  775. case(INPUT_WINDOW_SIZE+4):
  776. if(sscanf(argv[cnt],"%f",&dz->infile->window_size)!=1) {
  777. sprintf(errstr,"Cannot read window_size sent from TK\n");
  778. return(DATA_ERROR);
  779. }
  780. break;
  781. case(INPUT_NYQUIST+4):
  782. if(sscanf(argv[cnt],"%lf",&dz->nyquist)!=1) {
  783. sprintf(errstr,"Cannot read nyquist sent from TK\n");
  784. return(DATA_ERROR);
  785. }
  786. break;
  787. case(INPUT_DURATION+4):
  788. if(sscanf(argv[cnt],"%lf",&dz->duration)!=1) {
  789. sprintf(errstr,"Cannot read duration sent from TK\n");
  790. return(DATA_ERROR);
  791. }
  792. break;
  793. case(INPUT_MINBRK+4):
  794. if(sscanf(argv[cnt],"%lf",&dz->minbrk)!=1) {
  795. sprintf(errstr,"Cannot read minbrk sent from TK\n");
  796. return(DATA_ERROR);
  797. }
  798. break;
  799. case(INPUT_MAXBRK+4):
  800. if(sscanf(argv[cnt],"%lf",&dz->maxbrk)!=1) {
  801. sprintf(errstr,"Cannot read maxbrk sent from TK\n");
  802. return(DATA_ERROR);
  803. }
  804. break;
  805. case(INPUT_MINNUM+4):
  806. if(sscanf(argv[cnt],"%lf",&dz->minnum)!=1) {
  807. sprintf(errstr,"Cannot read minnum sent from TK\n");
  808. return(DATA_ERROR);
  809. }
  810. break;
  811. case(INPUT_MAXNUM+4):
  812. if(sscanf(argv[cnt],"%lf",&dz->maxnum)!=1) {
  813. sprintf(errstr,"Cannot read maxnum sent from TK\n");
  814. return(DATA_ERROR);
  815. }
  816. break;
  817. default:
  818. sprintf(errstr,"case switch item missing: parse_sloom_data()\n");
  819. return(PROGRAM_ERROR);
  820. }
  821. cnt++;
  822. }
  823. if(cnt!=PRE_CMDLINE_DATACNT+1) {
  824. sprintf(errstr,"Insufficient pre-cmdline params sent from TK\n");
  825. return(DATA_ERROR);
  826. }
  827. if(true_cnt)
  828. cnt = true_cnt;
  829. *cmdlinecnt = 0;
  830. while(cnt < argc) {
  831. if((exit_status = get_tk_cmdline_word(cmdlinecnt,cmdline,argv[cnt]))<0)
  832. return(exit_status);
  833. cnt++;
  834. }
  835. return(FINISHED);
  836. }
  837. /********************************* GET_TK_CMDLINE_WORD *********************************/
  838. int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q)
  839. {
  840. if(*cmdlinecnt==0) {
  841. if((*cmdline = (char **)malloc(sizeof(char *)))==NULL) {
  842. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  843. return(MEMORY_ERROR);
  844. }
  845. } else {
  846. if((*cmdline = (char **)realloc(*cmdline,((*cmdlinecnt)+1) * sizeof(char *)))==NULL) {
  847. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  848. return(MEMORY_ERROR);
  849. }
  850. }
  851. if(((*cmdline)[*cmdlinecnt] = (char *)malloc((strlen(q) + 1) * sizeof(char)))==NULL) {
  852. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline item %d.\n",(*cmdlinecnt)+1);
  853. return(MEMORY_ERROR);
  854. }
  855. strcpy((*cmdline)[*cmdlinecnt],q);
  856. (*cmdlinecnt)++;
  857. return(FINISHED);
  858. }
  859. /****************************** ASSIGN_FILE_DATA_STORAGE *********************************/
  860. int assign_file_data_storage(int infilecnt,dataptr dz)
  861. {
  862. int exit_status;
  863. int no_sndfile_system_files = FALSE;
  864. dz->infilecnt = infilecnt;
  865. if((exit_status = allocate_filespace(dz))<0)
  866. return(exit_status);
  867. if(no_sndfile_system_files)
  868. dz->infilecnt = 0;
  869. return(FINISHED);
  870. }
  871. /************************* redundant functions: to ensure libs compile OK *******************/
  872. int assign_process_logic(dataptr dz)
  873. {
  874. return(FINISHED);
  875. }
  876. void set_legal_infile_structure(dataptr dz)
  877. {}
  878. int set_legal_internalparam_structure(int process,int mode,aplptr ap)
  879. {
  880. return(FINISHED);
  881. }
  882. int setup_internal_arrays_and_array_pointers(dataptr dz)
  883. {
  884. return(FINISHED);
  885. }
  886. int establish_bufptrs_and_extra_buffers(dataptr dz)
  887. {
  888. return(FINISHED);
  889. }
  890. int read_special_data(char *str,dataptr dz)
  891. {
  892. return(FINISHED);
  893. }
  894. int inner_loop
  895. (int *peakscore,int *descnt,int *in_start_portion,int *least,int *pitchcnt,int windows_in_buf,dataptr dz)
  896. {
  897. return(FINISHED);
  898. }
  899. int get_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  900. {
  901. return(FINISHED);
  902. }
  903. /******************************** USAGE1 ********************************/
  904. int usage1(void)
  905. {
  906. usage2("flatten");
  907. return(USAGE_ONLY);
  908. }
  909. /**************************** CHECK_FLATTEN_PARAM_VALIDITY_AND_CONSISTENCY *****************************/
  910. int check_flatten_param_validity_and_consistency(dataptr dz)
  911. {
  912. if(dz->param[0] * 2 > dz->duration) {
  913. sprintf(errstr,"Elementsize (%lf) is too large for input source (duration %lf).\n",dz->param[0],dz->duration);
  914. return(DATA_ERROR);
  915. }
  916. if(dz->param[2] >= dz->duration) {
  917. sprintf(errstr,"Tail (%lf) is too large for input source (duration %lf).\n",dz->param[2],dz->duration);
  918. return(DATA_ERROR);
  919. }
  920. return FINISHED;
  921. }
  922. /******************************** DBTOLEVEL ***********************/
  923. double dbtolevel(double val)
  924. {
  925. int isneg = 0;
  926. if(flteq(val,0.0))
  927. return(1.0);
  928. if(val < 0.0) {
  929. val = -val;
  930. isneg = 1;
  931. }
  932. val /= 20.0;
  933. val = pow(10.0,val);
  934. if(isneg)
  935. val = 1.0/val;
  936. return(val);
  937. }
  938. /********************************************************************************************/
  939. int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  940. {
  941. if(!strcmp(prog_identifier_from_cmdline,"flatten")) dz->process = FLATTEN;
  942. else {
  943. sprintf(errstr,"Unknown program identification string '%s'\n",prog_identifier_from_cmdline);
  944. return(USAGE_ONLY);
  945. }
  946. return(FINISHED);
  947. }
  948. /******************************** SETUP_AND_INIT_INPUT_BRKTABLE_CONSTANTS ********************************/
  949. int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt)
  950. {
  951. int n;
  952. if((dz->brk = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  953. sprintf(errstr,"setup_and_init_input_brktable_constants(): 1\n");
  954. return(MEMORY_ERROR);
  955. }
  956. if((dz->brkptr = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  957. sprintf(errstr,"setup_and_init_input_brktable_constants(): 6\n");
  958. return(MEMORY_ERROR);
  959. }
  960. if((dz->brksize = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  961. sprintf(errstr,"setup_and_init_input_brktable_constants(): 2\n");
  962. return(MEMORY_ERROR);
  963. }
  964. if((dz->firstval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  965. sprintf(errstr,"setup_and_init_input_brktable_constants(): 3\n");
  966. return(MEMORY_ERROR);
  967. }
  968. if((dz->lastind = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  969. sprintf(errstr,"setup_and_init_input_brktable_constants(): 4\n");
  970. return(MEMORY_ERROR);
  971. }
  972. if((dz->lastval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  973. sprintf(errstr,"setup_and_init_input_brktable_constants(): 5\n");
  974. return(MEMORY_ERROR);
  975. }
  976. if((dz->brkinit = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  977. sprintf(errstr,"setup_and_init_input_brktable_constants(): 7\n");
  978. return(MEMORY_ERROR);
  979. }
  980. for(n=0;n<brkcnt;n++) {
  981. dz->brk[n] = NULL;
  982. dz->brkptr[n] = NULL;
  983. dz->brkinit[n] = 0;
  984. dz->brksize[n] = 0;
  985. }
  986. return(FINISHED);
  987. }
  988. /******************************** USAGE2 ********************************/
  989. int usage2(char *str)
  990. {
  991. if(!strcmp(str,"flatten")) {
  992. fprintf(stderr,
  993. "USAGE:\n"
  994. "flatten flatten infile outfile elementsize shoulder [-ttail]\n"
  995. "\n"
  996. "Equalise level of sound elements in mono src.\n"
  997. "\n"
  998. "ELEMENTSIZE Approx size of elements (e.g. syllables) in src.\n"
  999. " (Range 0.001 to 100).\n"
  1000. "SHOULDER Risetime in segment to changed level (mS).\n"
  1001. " (Range 20 to ELEMENTSIZE/2).\n"
  1002. " Will never be longer than distance from seg edge to peak.\n"
  1003. "TAIL Portion of end of sound to be treated as a whole segment.\n"
  1004. " (Range 0 to < duration).\n"
  1005. "\n");
  1006. } else
  1007. fprintf(stdout,"Unknown option '%s'\n",str);
  1008. return(USAGE_ONLY);
  1009. }
  1010. int usage3(char *str1,char *str2)
  1011. {
  1012. fprintf(stderr,"Insufficient parameters on command line.\n");
  1013. return(USAGE_ONLY);
  1014. }
  1015. /******************************** GATE ********************************/
  1016. int flatten(dataptr dz)
  1017. {
  1018. int exit_status, done, all_zero, phasechange, sub_all_zero, sub_phasechange, minwindow, passno;
  1019. double srate = (double)dz->infile->srate, maxval, minval, lastenv, maxsamp, maxmax;
  1020. double magprechange = 0.0, magpostchange = 0.0, incr, mag, lastmag = 0.0, max_samp, local_max_samp, val, normaliser = 1.0;
  1021. float *ibuf = dz->sampbuf[0], *obuf = dz->sampbuf[1];
  1022. int bufpos = 0, n, m, k, j, wsize, bigger_wsize, this_wsize, subwsize, finalsubwsize, this_subwsize;
  1023. int envcnt, trofcnt, nutrofcnt, trofpos, startsamp, endsamp, sub_startsamp, last_startsamp, last_endsamp, zcrospos;
  1024. int dove, maxat, seglen, peaksamp, samps_to_peak, samps_from_peak, doveup, dovedn, tail;
  1025. double *env = dz->parray[0], *maxamp;
  1026. int *trof = dz->lparray[0], *peakloc;
  1027. dz->tempsize = dz->insams[0];
  1028. dove = (int)round(dz->param[1] * MS_TO_SECS * srate); // level change time, in samples
  1029. wsize = (int)round((dz->param[0]/(double)WINS_PER_ELEMENT) * srate);
  1030. tail = (int)round(dz->param[2] * srate);
  1031. tail = dz->insams[0] - tail;
  1032. maxval = 0.0;
  1033. envcnt = 0;
  1034. bufpos = 0;
  1035. env = dz->parray[0];
  1036. if((exit_status = read_samps(ibuf,dz))<0)
  1037. return(exit_status);
  1038. // Read envelope at relevant elementsize
  1039. done = 0;
  1040. n = 0;
  1041. k = 0;
  1042. this_wsize = wsize;
  1043. while(dz->ssampsread > 0) {
  1044. while(n < this_wsize) {
  1045. if(fabs(ibuf[bufpos]) > maxval)
  1046. maxval = fabs(ibuf[bufpos]);
  1047. if(++bufpos >= dz->ssampsread) {
  1048. if((exit_status = read_samps(ibuf,dz))<0)
  1049. return(exit_status);
  1050. if(dz->ssampsread == 0) {
  1051. done = 1;
  1052. break;
  1053. }
  1054. bufpos = 0;
  1055. }
  1056. n++;
  1057. k++;
  1058. }
  1059. if(done)
  1060. break;
  1061. env[envcnt++] = maxval;
  1062. n = 0;
  1063. maxval = 0.0;
  1064. if(k + wsize > tail)
  1065. this_wsize = dz->insams[0] - k;
  1066. }
  1067. if(n) // If part-window at end, save envelope value for it
  1068. env[envcnt++] = maxval;
  1069. // Find troughs: at this stage the trof value is the envelope-cnt number
  1070. trofcnt = 0;
  1071. trof[trofcnt++] = 0;
  1072. lastenv = -1.0;
  1073. done = 0;
  1074. n = 0;
  1075. while(!done) {
  1076. while(env[n] >= lastenv) {
  1077. lastenv = env[n];
  1078. if(++n >= envcnt) {
  1079. done = 1;
  1080. break;
  1081. }
  1082. }
  1083. if(done)
  1084. break;
  1085. while(env[n] <= lastenv) {
  1086. lastenv = env[n];
  1087. if(++n >= envcnt) {
  1088. done = -1;
  1089. break;
  1090. }
  1091. }
  1092. if(done)
  1093. break;
  1094. trof[trofcnt++] = n; // Remember position of trof in envelope
  1095. }
  1096. if(done < 0) // If we were descending in level at end of envelope
  1097. trof[trofcnt++] = n-1; // Last env value is a trof
  1098. // For each trof, find the true minimum position
  1099. nutrofcnt = 0;
  1100. for(n = 0; n < trofcnt;n++) {
  1101. trofpos = trof[n] * wsize;
  1102. sndseekEx(dz->ifd[0],trofpos,0);
  1103. startsamp = 0;
  1104. if(n == trofcnt - 1 && tail > 0)
  1105. endsamp = dz->insams[0];
  1106. else
  1107. endsamp = wsize;
  1108. bigger_wsize = wsize;
  1109. bufpos = 0;
  1110. if((exit_status = read_samps(ibuf,dz)) < 0) // NB buflen > wsize
  1111. return(exit_status);
  1112. all_zero = 0;
  1113. phasechange = 0;
  1114. if(!is_phase_change(ibuf,&all_zero,&phasechange,startsamp,endsamp)) // If larger window has no phase-change
  1115. continue; // no zero-crossing here, so no zero-trof, continue
  1116. // recursively split window into 3 and find minimum window // Otherwise MUST be a phasechange in some subwindow!!
  1117. sub_all_zero = 0;
  1118. last_startsamp = -1;
  1119. last_endsamp = -1;
  1120. while(bigger_wsize > WINS_PER_ELEMENT * 2) {
  1121. all_zero = 0;
  1122. phasechange = 0;
  1123. subwsize = (int)round(bigger_wsize/(double)WINS_PER_ELEMENT); // Get next smaller window, (1/3 of larger window)
  1124. // There may not be an exact number of subwindows within the window,
  1125. finalsubwsize = bigger_wsize - (subwsize * (WINS_PER_ELEMENT - 1)); // so final subwindow must be length-adjusted
  1126. this_subwsize = subwsize;
  1127. minval = HUGE;
  1128. minwindow = -1;
  1129. for(k = 0; k < WINS_PER_ELEMENT; k++) { // For all subwindows
  1130. if(k == WINS_PER_ELEMENT - 1)
  1131. this_subwsize = finalsubwsize;
  1132. sub_all_zero = 0;
  1133. sub_phasechange = 0;
  1134. sub_startsamp = startsamp + (k * subwsize);
  1135. if(!is_phase_change(ibuf,&sub_all_zero,&sub_phasechange,sub_startsamp,sub_startsamp + this_subwsize)) {
  1136. if(sub_all_zero) { // IF any subwindow is all_zeros, use this as minimum
  1137. minwindow = k; // and quit
  1138. break;
  1139. } else // Otherwise, if no phase-change in window
  1140. continue; // no zero-crossing to do cut, so ignore this window
  1141. }
  1142. maxval = 0.0;
  1143. for(j = 0; j < this_subwsize; j++) {
  1144. if(fabs(ibuf[bufpos]) > maxval)
  1145. maxval = fabs(ibuf[bufpos]); // Find maxval in each subwindows
  1146. if(++bufpos >= dz->buflen) {
  1147. sprintf(errstr,"Error in buffer accounting for subwindows.\n");
  1148. return PROGRAM_ERROR;
  1149. }
  1150. }
  1151. if(maxval < minval) { // Find the minimum of these maxima
  1152. minval = maxval; // To find trof window
  1153. minwindow = k;
  1154. }
  1155. }
  1156. if(minwindow < 0) {
  1157. sprintf(errstr,"Minimum window not set.\n");
  1158. return PROGRAM_ERROR;
  1159. }
  1160. last_startsamp = startsamp; // Remember edges of this window
  1161. last_endsamp = endsamp;
  1162. startsamp += minwindow * subwsize; // Startsamp for nextpass = start of subwindow with min level
  1163. if(minwindow == WINS_PER_ELEMENT - 1)
  1164. endsamp = startsamp + finalsubwsize;
  1165. else
  1166. endsamp = startsamp + subwsize;
  1167. bufpos = startsamp;
  1168. bigger_wsize = endsamp - startsamp; // Now make the subwindow the window to be subdivided further
  1169. }
  1170. if(sub_all_zero) // If min window is ALL zero
  1171. trof[nutrofcnt++] = trofpos + (startsamp + endsamp)/2; // place trof in middle of window
  1172. else { // else there must be a phasechange in the min window
  1173. if(last_startsamp < 0) {
  1174. sprintf(errstr,"last_startsamp not set.\n");
  1175. return PROGRAM_ERROR;
  1176. }
  1177. if((exit_status = find_phasechange_position(ibuf,&zcrospos,last_startsamp,last_endsamp))< 0)
  1178. return exit_status;
  1179. trof[nutrofcnt++] = trofpos + zcrospos;
  1180. }
  1181. }
  1182. trofcnt = nutrofcnt;
  1183. if((maxamp = (double *)malloc(trofcnt * sizeof(double)))==NULL) {
  1184. sprintf(errstr,"Insufficient memory to store amplitudes of segments.\n");
  1185. return(MEMORY_ERROR);
  1186. }
  1187. if((peakloc = (int *)malloc(trofcnt * sizeof(int)))==NULL) {
  1188. sprintf(errstr,"Insufficient memory to store peak locations of segments.\n");
  1189. return(MEMORY_ERROR);
  1190. }
  1191. // Find maxima between trofs
  1192. sndseekEx(dz->ifd[0],0,0);
  1193. if((exit_status = read_samps(ibuf,dz)) < 0)
  1194. return(exit_status);
  1195. startsamp = 0;
  1196. bufpos = 0;
  1197. for(n = 0; n < trofcnt; n++) {
  1198. if(n == trofcnt - 1)
  1199. endsamp = dz->insams[0];
  1200. else
  1201. endsamp = trof[n+1];
  1202. maxsamp = 0.0;
  1203. maxat = startsamp;
  1204. for(k = startsamp; k < endsamp;k++) {
  1205. if(fabs(ibuf[bufpos]) > maxsamp) {
  1206. maxsamp = fabs(ibuf[bufpos]);
  1207. maxat = k;
  1208. }
  1209. if(++bufpos >= dz->ssampsread) {
  1210. if((exit_status = read_samps(ibuf,dz)) < 0)
  1211. return(exit_status);
  1212. if(dz->ssampsread == 0)
  1213. break;
  1214. bufpos = 0;
  1215. }
  1216. }
  1217. maxamp[n] = maxsamp;
  1218. peakloc[n] = maxat;
  1219. startsamp = endsamp;
  1220. }
  1221. // Find loudest segment
  1222. maxmax = maxamp[0];
  1223. for(n=1;n<trofcnt;n++) {
  1224. if(maxamp[n] > maxmax)
  1225. maxmax = maxamp[n];
  1226. }
  1227. // Get normalisers for all segments
  1228. for(n = 0; n < trofcnt;n++) {
  1229. if(flteq(maxamp[n],0.0))
  1230. maxamp[n] = 1.0;
  1231. else
  1232. maxamp[n] = maxmax/maxamp[n];
  1233. }
  1234. // Flatten the source
  1235. for(passno = 0;passno < 3; passno++) {
  1236. // if(sloom) {
  1237. switch(passno) {
  1238. case(0):
  1239. fprintf(stdout,"INFO: Adjusting segment levels.\n");
  1240. break;
  1241. case(1):
  1242. fprintf(stdout,"INFO: Adjusting overall level.\n");
  1243. break;
  1244. case(2):
  1245. fprintf(stdout,"INFO: Writing output.\n");
  1246. break;
  1247. }
  1248. fflush(stdout);
  1249. // }
  1250. dz->total_samps_written = 0;
  1251. sndseekEx(dz->ifd[0],0,0);
  1252. if((exit_status = read_samps(ibuf,dz)) < 0)
  1253. return(exit_status);
  1254. startsamp = 0;
  1255. bufpos = 0;
  1256. max_samp = 0.0;
  1257. for(n = 0; n < trofcnt; n++) {
  1258. if(n > 0)
  1259. magprechange = maxamp[n] - maxamp[n-1];
  1260. if(n < trofcnt - 1) {
  1261. magpostchange = maxamp[n+1] - maxamp[n];
  1262. endsamp = trof[n+1];
  1263. } else {
  1264. endsamp = dz->insams[0];
  1265. magpostchange = 0.0;
  1266. }
  1267. seglen = endsamp - startsamp;
  1268. peaksamp = peakloc[n];
  1269. samps_to_peak = peaksamp - startsamp;
  1270. doveup = min(dove,samps_to_peak); // Length of transition from previous amp boost
  1271. samps_from_peak = endsamp - peaksamp;
  1272. dovedn = min(dove,samps_from_peak); // Length of transition to next amp boost
  1273. local_max_samp = 0.0;
  1274. for(k = startsamp,j = 0,m = seglen-1; k < endsamp;k++,j++,m--) {
  1275. if(n > 0 && j < doveup) { // j goes 0 1 2 3 4 5 6 7 8 ...
  1276. incr = (double)j/(double)doveup; // If transit is 3 samps
  1277. mag = (magprechange/2) * incr; // incr 0/3 1/3 2/3
  1278. mag += lastmag;
  1279. val = ibuf[bufpos] * mag;
  1280. switch(passno) {
  1281. case(0):
  1282. local_max_samp = max(local_max_samp,fabs(val));
  1283. break;
  1284. case(1):
  1285. max_samp = max(max_samp,fabs(val));
  1286. break;
  1287. case(2):
  1288. obuf[bufpos] = (float)(val * normaliser);
  1289. break;
  1290. }
  1291. } else if(n < trofcnt - 1 && m < dovedn) { // m goes 8 7 6 5 4 3 2 1 0
  1292. incr = 1.0 - ((double)m/(double)dovedn); // If transit is 4 samps
  1293. mag = (magpostchange/2) * incr; // m/dovedn goes 3/4 2/4 1/4 0/4
  1294. mag += maxamp[n]; // incr goes 1/4 2/4 3/4 1
  1295. lastmag = mag;
  1296. val = ibuf[bufpos] * mag;
  1297. switch(passno) {
  1298. case(0):
  1299. local_max_samp = max(local_max_samp,fabs(val));
  1300. break;
  1301. case(1):
  1302. max_samp = max(max_samp,fabs(val));
  1303. break;
  1304. case(2):
  1305. obuf[bufpos] = (float)(val * normaliser);
  1306. break;
  1307. }
  1308. } else {
  1309. val = ibuf[bufpos] * maxamp[n];
  1310. switch(passno) {
  1311. case(0):
  1312. local_max_samp = max(local_max_samp,fabs(val));
  1313. break;
  1314. case(1):
  1315. max_samp = max(max_samp,fabs(val));
  1316. break;
  1317. case(2):
  1318. obuf[bufpos] = (float)(val * normaliser);
  1319. break;
  1320. }
  1321. }
  1322. if(++bufpos >= dz->ssampsread) {
  1323. if(passno == 2) {
  1324. if((exit_status = write_samps(obuf,dz->ssampsread,dz))<0)
  1325. return(exit_status);
  1326. } else {
  1327. dz->total_samps_written += dz->ssampsread;
  1328. dz->process = GREV;
  1329. display_virtual_time(dz->total_samps_written,dz);
  1330. dz->process = FLATTEN;
  1331. }
  1332. if((exit_status = read_samps(ibuf,dz)) < 0)
  1333. return(exit_status);
  1334. if(dz->ssampsread == 0)
  1335. break;
  1336. bufpos = 0;
  1337. }
  1338. }
  1339. if(passno == 0) {
  1340. if(!flteq(local_max_samp,0.0))
  1341. maxamp[n] *= MAXLEV/local_max_samp;
  1342. }
  1343. startsamp = endsamp;
  1344. }
  1345. if(passno == 1) {
  1346. if(max_samp > MAXLEV)
  1347. normaliser = MAXLEV/max_samp;
  1348. else
  1349. normaliser = 1.0;
  1350. }
  1351. }
  1352. return FINISHED;
  1353. }
  1354. /****************************** FLATTEN_PARAM_PREPROCESS ******************************/
  1355. #define SAFETY 64
  1356. int flatten_param_preprocess(dataptr dz)
  1357. {
  1358. int arraysize = (int)ceil(dz->duration/dz->param[0]);
  1359. if((dz->lparray = (int **)malloc(sizeof(int *)))==NULL) {
  1360. fprintf(stdout,"ERROR: INSUFFICIENT MEMORY to store Filter Data.\n");
  1361. fflush(stdout);
  1362. return(FAILED);
  1363. }
  1364. if((dz->lparray[0] = (int *)malloc((arraysize + SAFETY) * sizeof(int)))==NULL) { // Array for trof locations
  1365. fprintf(stdout,"ERROR: INSUFFICIENT MEMORY to store Filter Data.\n");
  1366. fflush(stdout);
  1367. return(FAILED);
  1368. }
  1369. if((dz->parray = (double **)malloc(2 * sizeof(double *)))==NULL) {
  1370. fprintf(stdout,"ERROR: INSUFFICIENT MEMORY to store Filter Data.\n");
  1371. fflush(stdout);
  1372. return(FAILED);
  1373. }
  1374. if((dz->parray[0] = (double *)malloc((arraysize * (WINS_PER_ELEMENT+1)) * sizeof(double)))==NULL) { // Array for initial envelope
  1375. fprintf(stdout,"ERROR: INSUFFICIENT MEMORY to store Filter Data.\n");
  1376. fflush(stdout);
  1377. return(FAILED);
  1378. }
  1379. memset((char *)dz->parray[0],0,(arraysize * (WINS_PER_ELEMENT+1)) * sizeof(double));
  1380. if((dz->parray[1] = (double *)malloc(4 * sizeof(double)))==NULL) {
  1381. fprintf(stdout,"ERROR: INSUFFICIENT MEMORY to store Filter Data.\n"); // Array for shrunk envelopes
  1382. fflush(stdout);
  1383. return(FAILED);
  1384. }
  1385. return FINISHED;
  1386. }
  1387. /*************************** CREATE_FLATTEN_SNDBUFS **************************/
  1388. int create_flatten_sndbufs(dataptr dz)
  1389. {
  1390. int n;
  1391. int bigbufsize, secsize;
  1392. int framesize;
  1393. double srate = (double)dz->infile->srate;
  1394. framesize = F_SECSIZE * dz->infile->channels;
  1395. if(dz->sbufptr == 0 || dz->sampbuf==0) {
  1396. sprintf(errstr,"buffer pointers not allocated: create_sndbufs()\n");
  1397. return(PROGRAM_ERROR);
  1398. }
  1399. dz->buflen = (int)ceil((dz->param[0]/2.0) * srate); // Buffer must be large-enough to accomodate 1 while envelope-window
  1400. secsize = dz->buflen/framesize; // Which is roughly 1/3 of elementsize = dz->param[0]
  1401. if(secsize * framesize < dz->buflen)
  1402. secsize++;
  1403. dz->buflen = secsize * framesize;
  1404. bigbufsize = dz->buflen * sizeof(float);
  1405. if((dz->bigbuf = (float *)malloc(bigbufsize * dz->bufcnt)) == NULL) {
  1406. sprintf(errstr,"INSUFFICIENT MEMORY to create sound buffers.\n");
  1407. return(PROGRAM_ERROR);
  1408. }
  1409. for(n=0;n<dz->bufcnt;n++)
  1410. dz->sbufptr[n] = dz->sampbuf[n] = dz->bigbuf + (dz->buflen * n);
  1411. dz->sampbuf[n] = dz->bigbuf + (dz->buflen * n);
  1412. return(FINISHED);
  1413. }
  1414. /*************************** IS_PHASE_CHANGE **************************/
  1415. int is_phase_change(float *ibuf,int *all_zero,int *phasechange,int wstart,int wend)
  1416. {
  1417. int phase = 0;
  1418. int k = wstart;
  1419. while(ibuf[k] == 0.0) {
  1420. if(++k >= wend) {
  1421. *all_zero = 1;
  1422. return FALSE;
  1423. }
  1424. }
  1425. if(ibuf[k] > 0)
  1426. phase = 1;
  1427. else
  1428. phase = -1;
  1429. k++;
  1430. while(k < wend) {
  1431. if(phase > 1) {
  1432. if(ibuf[k] < 0.0) {
  1433. *phasechange = 1;
  1434. return TRUE; // phase changed
  1435. }
  1436. } else {
  1437. if(ibuf[k] > 0.0) { // phase changed
  1438. *phasechange = 1;
  1439. return TRUE;
  1440. }
  1441. }
  1442. k++;
  1443. }
  1444. return FALSE;
  1445. }
  1446. /*************************** FIND_PHASECHANGE_POSITION **************************/
  1447. int find_phasechange_position(float *ibuf,int *zcrospos,int wstart,int wend)
  1448. {
  1449. int phase = 0;
  1450. int k = wstart;
  1451. while(ibuf[k] == 0.0) {
  1452. if(++k >= wend) {
  1453. sprintf(errstr,"Error: no phasechange found in window.\n");
  1454. return PROGRAM_ERROR;
  1455. }
  1456. }
  1457. if(ibuf[k] > 0)
  1458. phase = 1;
  1459. else
  1460. phase = -1;
  1461. k++;
  1462. while(k < wend) {
  1463. if(phase > 1) {
  1464. if(ibuf[k] < 0.0) {
  1465. *zcrospos = k;
  1466. break;
  1467. }
  1468. } else {
  1469. if(ibuf[k] > 0.0) { // phase changed
  1470. *zcrospos = k;
  1471. break;
  1472. }
  1473. }
  1474. k++;
  1475. }
  1476. return FINISHED;
  1477. }