ptobrk.c 40 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276
  1. /*
  2. * Copyright (c) 1983-2013 Trevor Wishart and Composers Desktop Project Ltd
  3. * http://www.trevorwishart.co.uk
  4. * http://www.composersdesktop.com
  5. *
  6. This file is part of the CDP System.
  7. The CDP System is free software; you can redistribute it
  8. and/or modify it under the terms of the GNU Lesser General Public
  9. License as published by the Free Software Foundation; either
  10. version 2.1 of the License, or (at your option) any later version.
  11. The CDP System is distributed in the hope that it will be useful,
  12. but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. GNU Lesser General Public License for more details.
  15. You should have received a copy of the GNU Lesser General Public
  16. License along with the CDP System; if not, write to the Free Software
  17. Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  18. 02111-1307 USA
  19. *
  20. */
  21. #include <stdio.h>
  22. #include <stdlib.h>
  23. #include <structures.h>
  24. #include <tkglobals.h>
  25. #include <pnames.h>
  26. #include <filetype.h>
  27. #include <processno.h>
  28. #include <modeno.h>
  29. #include <logic.h>
  30. #include <globcon.h>
  31. #include <cdpmain.h>
  32. #include <math.h>
  33. #include <mixxcon.h>
  34. #include <osbind.h>
  35. #include <standalone.h>
  36. #include <ctype.h>
  37. #include <sfsys.h>
  38. #include <string.h>
  39. #include <srates.h>
  40. #if defined unix || defined __GNUC__
  41. #define round(x) lround((x))
  42. #endif
  43. #ifndef HUGE
  44. #define HUGE 3.40282347e+38F
  45. #endif
  46. char errstr[2400];
  47. int anal_infiles = 1;
  48. int sloom = 0;
  49. int sloombatch = 0;
  50. const char* cdp_version = "7.1.0";
  51. /* CDP LIBRARY FUNCTIONS TRANSFERRED HERE */
  52. static int set_param_data(aplptr ap, int special_data,int maxparamcnt,int paramcnt,char *paramlist);
  53. static int set_vflgs(aplptr ap,char *optflags,int optcnt,char *optlist,
  54. char *varflags,int vflagcnt, int vparamcnt,char *varlist);
  55. static int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz);
  56. static int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz);
  57. static int mark_parameter_types(dataptr dz,aplptr ap);
  58. static int establish_application(dataptr dz);
  59. static int application_init(dataptr dz);
  60. static int initialise_vflags(dataptr dz);
  61. static int setup_input_param_defaultval_stores(int tipc,aplptr ap);
  62. static int setup_and_init_input_param_activity(dataptr dz,int tipc);
  63. static int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q);
  64. static int assign_file_data_storage(int infilecnt,dataptr dz);
  65. static int convert_pitch_from_binary_to_text(dataptr dz);
  66. static int convert_pch_data_to_brkpnttable(int *brksize,float *floatbuf,float frametime,int array_no,dataptr dz);
  67. static int incremental_p_datareduction(int array_no,int *bsize,double sharp,dataptr dz);
  68. static int p_datareduce(double **q,double sharp,double flat,double *thisarray,int *bsize);
  69. /* CDP LIB FUNCTION MODIFIED TO AVOID CALLING setup_particular_application() */
  70. static int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz);
  71. /* SIMPLIFICATION OF LIB FUNC TO APPLY TO JUST THIS FUNCTION */
  72. static int parse_infile_and_check_type(char **cmdline,dataptr dz);
  73. static int handle_the_outfile(int *cmdlinecnt,char ***cmdline,int is_launched,dataptr dz);
  74. static int setup_ptobrk_application(dataptr dz);
  75. static int setup_ptobrk_param_ranges_and_defaults(dataptr dz);
  76. /**************************************** MAIN *********************************************/
  77. int main(int argc,char *argv[])
  78. {
  79. int exit_status;
  80. dataptr dz = NULL;
  81. char **cmdline;
  82. int cmdlinecnt;
  83. aplptr ap;
  84. int is_launched = FALSE;
  85. if(argc==2 && (strcmp(argv[1],"--version") == 0)) {
  86. fprintf(stdout,"%s\n",cdp_version);
  87. fflush(stdout);
  88. return 0;
  89. }
  90. /* CHECK FOR SOUNDLOOM */
  91. if((sloom = sound_loom_in_use(&argc,&argv)) > 1) {
  92. sloom = 0;
  93. sloombatch = 1;
  94. }
  95. if(sflinit("cdp")){
  96. sfperror("cdp: initialisation\n");
  97. return(FAILED);
  98. }
  99. /* SET UP THE PRINCIPLE DATASTRUCTURE */
  100. if((exit_status = establish_datastructure(&dz))<0) { // CDP LIB
  101. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  102. return(FAILED);
  103. }
  104. if(!sloom) {
  105. if((exit_status = make_initial_cmdline_check(&argc,&argv))<0) { // CDP LIB
  106. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  107. return(FAILED);
  108. }
  109. cmdline = argv;
  110. cmdlinecnt = argc;
  111. // get_process_and_mode_from_cmdline -->
  112. if (!strcmp(argv[0],"withzeros")) {
  113. dz->process = PTOBRK;
  114. dz->mode = 0;
  115. // THERE IS NO MODE WITH THIS PROGRAM
  116. } else {
  117. usage1();
  118. return(FAILED);
  119. }
  120. cmdline++;
  121. cmdlinecnt--;
  122. // setup_particular_application =
  123. if((exit_status = setup_ptobrk_application(dz))<0) {
  124. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  125. return(FAILED);
  126. }
  127. if((exit_status = count_and_allocate_for_infiles(cmdlinecnt,cmdline,dz))<0) { // CDP LIB
  128. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  129. return(FAILED);
  130. }
  131. } else {
  132. //parse_TK_data() =
  133. if((exit_status = parse_sloom_data(argc,argv,&cmdline,&cmdlinecnt,dz))<0) {
  134. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  135. return(exit_status);
  136. }
  137. }
  138. ap = dz->application;
  139. // parse_infile_and_hone_type() =
  140. if((exit_status = parse_infile_and_check_type(cmdline,dz))<0) {
  141. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  142. return(FAILED);
  143. }
  144. // setup_param_ranges_and_defaults() =
  145. if((exit_status = setup_ptobrk_param_ranges_and_defaults(dz))<0) {
  146. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  147. return(FAILED);
  148. }
  149. // open_first_infile CDP LIB
  150. if((exit_status = open_first_infile(cmdline[0],dz))<0) {
  151. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  152. return(FAILED);
  153. }
  154. cmdlinecnt--;
  155. cmdline++;
  156. // handle_extra_infiles() : redundant
  157. // handle_outfile() =
  158. if((exit_status = handle_the_outfile(&cmdlinecnt,&cmdline,is_launched,dz))<0) {
  159. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  160. return(FAILED);
  161. }
  162. // handle_formants() redundant
  163. // handle_formant_quiksearch() redundant
  164. // handle_special_data() redundant
  165. if((exit_status = read_parameters_and_flags(&cmdline,&cmdlinecnt,dz))<0) { // CDP LIB
  166. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  167. return(FAILED);
  168. }
  169. //check_param_validity_and_consistency()
  170. dz->param[0] *= MS_TO_SECS;
  171. is_launched = TRUE;
  172. //allocate_large_buffers() redundant
  173. //param_preprocess() redundant
  174. //spec_process_file =
  175. if((exit_status = convert_pitch_from_binary_to_text(dz))<0) {
  176. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  177. return(FAILED);
  178. }
  179. if((exit_status = complete_output(dz))<0) { // CDP LIB
  180. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  181. return(FAILED);
  182. }
  183. exit_status = print_messages_and_close_sndfiles(FINISHED,is_launched,dz); // CDP LIB
  184. free(dz);
  185. return(SUCCEEDED);
  186. }
  187. /**********************************************
  188. REPLACED CDP LIB FUNCTIONS
  189. **********************************************/
  190. /****************************** SET_PARAM_DATA *********************************/
  191. int set_param_data(aplptr ap, int special_data,int maxparamcnt,int paramcnt,char *paramlist)
  192. {
  193. ap->special_data = (char)special_data;
  194. ap->param_cnt = (char)paramcnt;
  195. ap->max_param_cnt = (char)maxparamcnt;
  196. if(ap->max_param_cnt>0) {
  197. if((ap->param_list = (char *)malloc((size_t)(ap->max_param_cnt+1)))==NULL) {
  198. sprintf(errstr,"INSUFFICIENT MEMORY: for param_list\n");
  199. return(MEMORY_ERROR);
  200. }
  201. strcpy(ap->param_list,paramlist);
  202. }
  203. return(FINISHED);
  204. }
  205. /****************************** SET_VFLGS *********************************/
  206. int set_vflgs
  207. (aplptr ap,char *optflags,int optcnt,char *optlist,char *varflags,int vflagcnt, int vparamcnt,char *varlist)
  208. {
  209. ap->option_cnt = (char) optcnt; /*RWD added cast */
  210. if(optcnt) {
  211. if((ap->option_list = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  212. sprintf(errstr,"INSUFFICIENT MEMORY: for option_list\n");
  213. return(MEMORY_ERROR);
  214. }
  215. strcpy(ap->option_list,optlist);
  216. if((ap->option_flags = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  217. sprintf(errstr,"INSUFFICIENT MEMORY: for option_flags\n");
  218. return(MEMORY_ERROR);
  219. }
  220. strcpy(ap->option_flags,optflags);
  221. }
  222. ap->vflag_cnt = (char) vflagcnt;
  223. ap->variant_param_cnt = (char) vparamcnt;
  224. if(vflagcnt) {
  225. if((ap->variant_list = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  226. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_list\n");
  227. return(MEMORY_ERROR);
  228. }
  229. strcpy(ap->variant_list,varlist);
  230. if((ap->variant_flags = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  231. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_flags\n");
  232. return(MEMORY_ERROR);
  233. }
  234. strcpy(ap->variant_flags,varflags);
  235. }
  236. return(FINISHED);
  237. }
  238. /***************************** APPLICATION_INIT **************************/
  239. int application_init(dataptr dz)
  240. {
  241. int exit_status;
  242. int storage_cnt;
  243. int tipc;
  244. aplptr ap = dz->application;
  245. if(ap->vflag_cnt>0)
  246. initialise_vflags(dz);
  247. tipc = ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt;
  248. ap->total_input_param_cnt = (char)tipc;
  249. if(tipc>0) {
  250. if((exit_status = setup_input_param_range_stores(tipc,ap))<0)
  251. return(exit_status);
  252. if((exit_status = setup_input_param_defaultval_stores(tipc,ap))<0)
  253. return(exit_status);
  254. if((exit_status = setup_and_init_input_param_activity(dz,tipc))<0)
  255. return(exit_status);
  256. }
  257. //THERE ARE NO brktables USED IN THIS PROCESS
  258. if((storage_cnt = tipc + ap->internal_param_cnt)>0) {
  259. if((exit_status = setup_parameter_storage_and_constants(storage_cnt,dz))<0)
  260. return(exit_status);
  261. if((exit_status = initialise_is_int_and_no_brk_constants(storage_cnt,dz))<0)
  262. return(exit_status);
  263. }
  264. if((exit_status = mark_parameter_types(dz,ap))<0)
  265. return(exit_status);
  266. // establish_infile_constants() replaced by
  267. dz->infilecnt = ONE_NONSND_FILE;
  268. //establish_bufptrs_and_extra_buffers():
  269. dz->array_cnt=1;
  270. if((dz->parray = (double **)malloc(dz->array_cnt * sizeof(double *)))==NULL) {
  271. sprintf(errstr,"INSUFFICIENT MEMORY for internal double arrays.\n");
  272. return(MEMORY_ERROR);
  273. }
  274. dz->parray[0] = NULL;
  275. return(FINISHED);
  276. }
  277. /********************** SETUP_PARAMETER_STORAGE_AND_CONSTANTS ********************/
  278. /* RWD mallo changed to calloc; helps debug verison run as release! */
  279. int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz)
  280. {
  281. if((dz->param = (double *)calloc(storage_cnt, sizeof(double)))==NULL) {
  282. sprintf(errstr,"setup_parameter_storage_and_constants(): 1\n");
  283. return(MEMORY_ERROR);
  284. }
  285. if((dz->iparam = (int *)calloc(storage_cnt, sizeof(int) ))==NULL) {
  286. sprintf(errstr,"setup_parameter_storage_and_constants(): 2\n");
  287. return(MEMORY_ERROR);
  288. }
  289. if((dz->is_int = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  290. sprintf(errstr,"setup_parameter_storage_and_constants(): 3\n");
  291. return(MEMORY_ERROR);
  292. }
  293. if((dz->no_brk = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  294. sprintf(errstr,"setup_parameter_storage_and_constants(): 5\n");
  295. return(MEMORY_ERROR);
  296. }
  297. return(FINISHED);
  298. }
  299. /************** INITIALISE_IS_INT_AND_NO_BRK_CONSTANTS *****************/
  300. int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz)
  301. {
  302. int n;
  303. for(n=0;n<storage_cnt;n++) {
  304. dz->is_int[n] = (char)0;
  305. dz->no_brk[n] = (char)0;
  306. }
  307. return(FINISHED);
  308. }
  309. /***************************** MARK_PARAMETER_TYPES **************************/
  310. int mark_parameter_types(dataptr dz,aplptr ap)
  311. {
  312. int n, m; /* PARAMS */
  313. for(n=0;n<ap->max_param_cnt;n++) {
  314. switch(ap->param_list[n]) {
  315. case('0'): break; /* dz->is_active[n] = 0 is default */
  316. case('i'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1;dz->no_brk[n] = (char)1; break;
  317. case('I'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1; break;
  318. case('d'): dz->is_active[n] = (char)1; dz->no_brk[n] = (char)1; break;
  319. case('D'): dz->is_active[n] = (char)1; /* normal case: double val or brkpnt file */ break;
  320. default:
  321. sprintf(errstr,"Programming error: invalid parameter type in mark_parameter_types()\n");
  322. return(PROGRAM_ERROR);
  323. }
  324. } /* OPTIONS */
  325. for(n=0,m=ap->max_param_cnt;n<ap->option_cnt;n++,m++) {
  326. switch(ap->option_list[n]) {
  327. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  328. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  329. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  330. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  331. default:
  332. sprintf(errstr,"Programming error: invalid option type in mark_parameter_types()\n");
  333. return(PROGRAM_ERROR);
  334. }
  335. } /* VARIANTS */
  336. for(n=0,m=ap->max_param_cnt + ap->option_cnt;n < ap->variant_param_cnt; n++, m++) {
  337. switch(ap->variant_list[n]) {
  338. case('0'): break;
  339. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  340. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  341. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  342. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  343. default:
  344. sprintf(errstr,"Programming error: invalid variant type in mark_parameter_types()\n");
  345. return(PROGRAM_ERROR);
  346. }
  347. } /* INTERNAL */
  348. for(n=0,
  349. m=ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt; n<ap->internal_param_cnt; n++,m++) {
  350. switch(ap->internal_param_list[n]) {
  351. case('0'): break; /* dummy variables: variables not used: but important for internal paream numbering!! */
  352. case('i'): dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  353. case('d'): dz->no_brk[m] = (char)1; break;
  354. default:
  355. sprintf(errstr,"Programming error: invalid internal param type in mark_parameter_types()\n");
  356. return(PROGRAM_ERROR);
  357. }
  358. }
  359. return(FINISHED);
  360. }
  361. /***************************** HANDLE_THE_OUTFILE **************************/
  362. int handle_the_outfile(int *cmdlinecnt,char ***cmdline,int is_launched,dataptr dz)
  363. {
  364. char *filename = NULL;
  365. filename = (*cmdline)[0];
  366. strcpy(dz->outfilename,filename);
  367. if(file_has_reserved_extension(filename)) {
  368. sprintf(errstr,"Cannot open a textfile (%s) with a reserved extension.\n",filename);
  369. return(USER_ERROR);
  370. }
  371. if((dz->fp = fopen(filename,"w"))==NULL) {
  372. sprintf(errstr,"Cannot open output file %s\n",filename);
  373. return(USER_ERROR);
  374. }
  375. (*cmdline)++;
  376. (*cmdlinecnt)--;
  377. return(FINISHED);
  378. }
  379. /***************************** ESTABLISH_APPLICATION **************************/
  380. int establish_application(dataptr dz)
  381. {
  382. aplptr ap;
  383. if((dz->application = (aplptr)malloc(sizeof (struct applic)))==NULL) {
  384. sprintf(errstr,"establish_application()\n");
  385. return(MEMORY_ERROR);
  386. }
  387. ap = dz->application;
  388. memset((char *)ap,0,sizeof(struct applic));
  389. return(FINISHED);
  390. }
  391. /************************* INITIALISE_VFLAGS *************************/
  392. int initialise_vflags(dataptr dz)
  393. {
  394. int n;
  395. if((dz->vflag = (char *)malloc(dz->application->vflag_cnt * sizeof(char)))==NULL) {
  396. sprintf(errstr,"INSUFFICIENT MEMORY: vflag store,\n");
  397. return(MEMORY_ERROR);
  398. }
  399. for(n=0;n<dz->application->vflag_cnt;n++)
  400. dz->vflag[n] = FALSE;
  401. return FINISHED;
  402. }
  403. /************************* SETUP_INPUT_PARAM_DEFAULTVALS *************************/
  404. int setup_input_param_defaultval_stores(int tipc,aplptr ap)
  405. {
  406. int n;
  407. if((ap->default_val = (double *)malloc(tipc * sizeof(double)))==NULL) {
  408. sprintf(errstr,"INSUFFICIENT MEMORY for application default values store\n");
  409. return(MEMORY_ERROR);
  410. }
  411. for(n=0;n<tipc;n++)
  412. ap->default_val[n] = 0.0;
  413. return(FINISHED);
  414. }
  415. /***************************** SETUP_AND_INIT_INPUT_PARAM_ACTIVITY **************************/
  416. int setup_and_init_input_param_activity(dataptr dz,int tipc)
  417. {
  418. int n;
  419. if((dz->is_active = (char *)malloc((size_t)tipc))==NULL) {
  420. sprintf(errstr,"setup_and_init_input_param_activity()\n");
  421. return(MEMORY_ERROR);
  422. }
  423. for(n=0;n<tipc;n++)
  424. dz->is_active[n] = (char)0;
  425. return(FINISHED);
  426. }
  427. /************************* SETUP_PTOBRK_APPLICATION *******************/
  428. int setup_ptobrk_application(dataptr dz)
  429. {
  430. int exit_status;
  431. aplptr ap;
  432. if((exit_status = establish_application(dz))<0) // GLOBAL
  433. return(FAILED);
  434. ap = dz->application;
  435. // SEE parstruct FOR EXPLANATION of next 2 functions
  436. if((exit_status = set_param_data(ap,0 ,1,1,"d" ))<0)
  437. return(FAILED);
  438. if((exit_status = set_vflgs(ap,"",0,"","",0,0,""))<0)
  439. return(FAILED);
  440. // set_legal_infile_structure -->
  441. dz->has_otherfile = FALSE;
  442. // assign_process_logic -->
  443. dz->input_data_type = PITCHFILE_ONLY;
  444. dz->process_type = TO_TEXTFILE;
  445. dz->outfiletype = TEXTFILE_OUT;
  446. return application_init(dz); //GLOBAL
  447. }
  448. /************************* PARSE_INFILE_AND_CHECK_TYPE *******************/
  449. int parse_infile_and_check_type(char **cmdline,dataptr dz)
  450. {
  451. int exit_status;
  452. infileptr infile_info;
  453. if(!sloom) {
  454. if((infile_info = (infileptr)malloc(sizeof(struct filedata)))==NULL) {
  455. sprintf(errstr,"INSUFFICIENT MEMORY for infile structure to test file data.");
  456. return(MEMORY_ERROR);
  457. } else if((exit_status = cdparse(cmdline[0],infile_info))<0) {
  458. sprintf(errstr,"Failed tp parse input file %s\n",cmdline[0]);
  459. return(PROGRAM_ERROR);
  460. } else if(infile_info->filetype != PITCHFILE) {
  461. sprintf(errstr,"File %s is not of correct type\n",cmdline[0]);
  462. return(DATA_ERROR);
  463. } else if((exit_status = copy_parse_info_to_main_structure(infile_info,dz))<0) {
  464. sprintf(errstr,"Failed to copy file parsing information\n");
  465. return(PROGRAM_ERROR);
  466. }
  467. free(infile_info);
  468. }
  469. return(FINISHED);
  470. }
  471. /************************* SETUP_PTOBRK_PARAM_RANGES_AND_DEFAULTS *******************/
  472. int setup_ptobrk_param_ranges_and_defaults(dataptr dz)
  473. {
  474. int exit_status;
  475. aplptr ap = dz->application;
  476. // set_param_ranges()
  477. ap->total_input_param_cnt = (char)(ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt);
  478. // NB total_input_param_cnt is > 0 !!!s
  479. if((exit_status = setup_input_param_range_stores(ap->total_input_param_cnt,ap))<0)
  480. return(FAILED);
  481. // get_param_ranges()
  482. ap->lo[0] = 1.0;
  483. ap->hi[0] = 1000.00;
  484. ap->default_val[0] = 20.0;
  485. if(!sloom)
  486. put_default_vals_in_all_params(dz);
  487. return(FINISHED);
  488. }
  489. /********************************* PARSE_SLOOM_DATA *********************************/
  490. int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz)
  491. {
  492. int exit_status;
  493. int cnt = 1, infilecnt;
  494. int filesize, insams, inbrksize;
  495. double dummy;
  496. int true_cnt = 0;
  497. aplptr ap;
  498. while(cnt<=PRE_CMDLINE_DATACNT) {
  499. if(cnt > argc) {
  500. sprintf(errstr,"Insufficient data sent from TK\n");
  501. return(DATA_ERROR);
  502. }
  503. switch(cnt) {
  504. case(1):
  505. if(sscanf(argv[cnt],"%d",&dz->process)!=1) {
  506. sprintf(errstr,"Cannot read process no. sent from TK\n");
  507. return(DATA_ERROR);
  508. }
  509. break;
  510. case(2):
  511. if(sscanf(argv[cnt],"%d",&dz->mode)!=1) {
  512. sprintf(errstr,"Cannot read mode no. sent from TK\n");
  513. return(DATA_ERROR);
  514. }
  515. if(dz->mode > 0)
  516. dz->mode--;
  517. //setup_particular_application() =
  518. if((exit_status = setup_ptobrk_application(dz))<0)
  519. return(exit_status);
  520. ap = dz->application;
  521. break;
  522. case(3):
  523. if(sscanf(argv[cnt],"%d",&infilecnt)!=1) {
  524. sprintf(errstr,"Cannot read infilecnt sent from TK\n");
  525. return(DATA_ERROR);
  526. }
  527. if(infilecnt < 1) {
  528. true_cnt = cnt + 1;
  529. cnt = PRE_CMDLINE_DATACNT; /* force exit from loop after assign_file_data_storage */
  530. }
  531. if((exit_status = assign_file_data_storage(infilecnt,dz))<0)
  532. return(exit_status);
  533. break;
  534. case(INPUT_FILETYPE+4):
  535. if(sscanf(argv[cnt],"%d",&dz->infile->filetype)!=1) {
  536. sprintf(errstr,"Cannot read filetype sent from TK (%s)\n",argv[cnt]);
  537. return(DATA_ERROR);
  538. }
  539. break;
  540. case(INPUT_FILESIZE+4):
  541. if(sscanf(argv[cnt],"%d",&filesize)!=1) {
  542. sprintf(errstr,"Cannot read infilesize sent from TK\n");
  543. return(DATA_ERROR);
  544. }
  545. dz->insams[0] = filesize;
  546. break;
  547. case(INPUT_INSAMS+4):
  548. if(sscanf(argv[cnt],"%d",&insams)!=1) {
  549. sprintf(errstr,"Cannot read insams sent from TK\n");
  550. return(DATA_ERROR);
  551. }
  552. dz->insams[0] = insams;
  553. break;
  554. case(INPUT_SRATE+4):
  555. if(sscanf(argv[cnt],"%d",&dz->infile->srate)!=1) {
  556. sprintf(errstr,"Cannot read srate sent from TK\n");
  557. return(DATA_ERROR);
  558. }
  559. break;
  560. case(INPUT_CHANNELS+4):
  561. if(sscanf(argv[cnt],"%d",&dz->infile->channels)!=1) {
  562. sprintf(errstr,"Cannot read channels sent from TK\n");
  563. return(DATA_ERROR);
  564. }
  565. break;
  566. case(INPUT_STYPE+4):
  567. if(sscanf(argv[cnt],"%d",&dz->infile->stype)!=1) {
  568. sprintf(errstr,"Cannot read stype sent from TK\n");
  569. return(DATA_ERROR);
  570. }
  571. break;
  572. case(INPUT_ORIGSTYPE+4):
  573. if(sscanf(argv[cnt],"%d",&dz->infile->origstype)!=1) {
  574. sprintf(errstr,"Cannot read origstype sent from TK\n");
  575. return(DATA_ERROR);
  576. }
  577. break;
  578. case(INPUT_ORIGRATE+4):
  579. if(sscanf(argv[cnt],"%d",&dz->infile->origrate)!=1) {
  580. sprintf(errstr,"Cannot read origrate sent from TK\n");
  581. return(DATA_ERROR);
  582. }
  583. break;
  584. case(INPUT_MLEN+4):
  585. if(sscanf(argv[cnt],"%d",&dz->infile->Mlen)!=1) {
  586. sprintf(errstr,"Cannot read Mlen sent from TK\n");
  587. return(DATA_ERROR);
  588. }
  589. break;
  590. case(INPUT_DFAC+4):
  591. if(sscanf(argv[cnt],"%d",&dz->infile->Dfac)!=1) {
  592. sprintf(errstr,"Cannot read Dfac sent from TK\n");
  593. return(DATA_ERROR);
  594. }
  595. break;
  596. case(INPUT_ORIGCHANS+4):
  597. if(sscanf(argv[cnt],"%d",&dz->infile->origchans)!=1) {
  598. sprintf(errstr,"Cannot read origchans sent from TK\n");
  599. return(DATA_ERROR);
  600. }
  601. break;
  602. case(INPUT_SPECENVCNT+4):
  603. if(sscanf(argv[cnt],"%d",&dz->infile->specenvcnt)!=1) {
  604. sprintf(errstr,"Cannot read specenvcnt sent from TK\n");
  605. return(DATA_ERROR);
  606. }
  607. dz->specenvcnt = dz->infile->specenvcnt;
  608. break;
  609. case(INPUT_WANTED+4):
  610. if(sscanf(argv[cnt],"%d",&dz->wanted)!=1) {
  611. sprintf(errstr,"Cannot read wanted sent from TK\n");
  612. return(DATA_ERROR);
  613. }
  614. break;
  615. case(INPUT_WLENGTH+4):
  616. if(sscanf(argv[cnt],"%d",&dz->wlength)!=1) {
  617. sprintf(errstr,"Cannot read wlength sent from TK\n");
  618. return(DATA_ERROR);
  619. }
  620. break;
  621. case(INPUT_OUT_CHANS+4):
  622. if(sscanf(argv[cnt],"%d",&dz->out_chans)!=1) {
  623. sprintf(errstr,"Cannot read out_chans sent from TK\n");
  624. return(DATA_ERROR);
  625. }
  626. break;
  627. /* RWD these chanegs to samps - tk will have to deal with that! */
  628. case(INPUT_DESCRIPTOR_BYTES+4):
  629. if(sscanf(argv[cnt],"%d",&dz->descriptor_samps)!=1) {
  630. sprintf(errstr,"Cannot read descriptor_samps sent from TK\n");
  631. return(DATA_ERROR);
  632. }
  633. break;
  634. case(INPUT_IS_TRANSPOS+4):
  635. if(sscanf(argv[cnt],"%d",&dz->is_transpos)!=1) {
  636. sprintf(errstr,"Cannot read is_transpos sent from TK\n");
  637. return(DATA_ERROR);
  638. }
  639. break;
  640. case(INPUT_COULD_BE_TRANSPOS+4):
  641. if(sscanf(argv[cnt],"%d",&dz->could_be_transpos)!=1) {
  642. sprintf(errstr,"Cannot read could_be_transpos sent from TK\n");
  643. return(DATA_ERROR);
  644. }
  645. break;
  646. case(INPUT_COULD_BE_PITCH+4):
  647. if(sscanf(argv[cnt],"%d",&dz->could_be_pitch)!=1) {
  648. sprintf(errstr,"Cannot read could_be_pitch sent from TK\n");
  649. return(DATA_ERROR);
  650. }
  651. break;
  652. case(INPUT_DIFFERENT_SRATES+4):
  653. if(sscanf(argv[cnt],"%d",&dz->different_srates)!=1) {
  654. sprintf(errstr,"Cannot read different_srates sent from TK\n");
  655. return(DATA_ERROR);
  656. }
  657. break;
  658. case(INPUT_DUPLICATE_SNDS+4):
  659. if(sscanf(argv[cnt],"%d",&dz->duplicate_snds)!=1) {
  660. sprintf(errstr,"Cannot read duplicate_snds sent from TK\n");
  661. return(DATA_ERROR);
  662. }
  663. break;
  664. case(INPUT_BRKSIZE+4):
  665. if(sscanf(argv[cnt],"%d",&inbrksize)!=1) {
  666. sprintf(errstr,"Cannot read brksize sent from TK\n");
  667. return(DATA_ERROR);
  668. }
  669. if(inbrksize > 0) {
  670. switch(dz->input_data_type) {
  671. case(WORDLIST_ONLY):
  672. break;
  673. case(PITCH_AND_PITCH):
  674. case(PITCH_AND_TRANSPOS):
  675. case(TRANSPOS_AND_TRANSPOS):
  676. dz->tempsize = inbrksize;
  677. break;
  678. case(BRKFILES_ONLY):
  679. case(UNRANGED_BRKFILE_ONLY):
  680. case(DB_BRKFILES_ONLY):
  681. case(ALL_FILES):
  682. case(ANY_NUMBER_OF_ANY_FILES):
  683. if(dz->extrabrkno < 0) {
  684. sprintf(errstr,"Storage location number for brktable not established by CDP.\n");
  685. return(DATA_ERROR);
  686. }
  687. if(dz->brksize == NULL) {
  688. sprintf(errstr,"CDP has not established storage space for input brktable.\n");
  689. return(PROGRAM_ERROR);
  690. }
  691. dz->brksize[dz->extrabrkno] = inbrksize;
  692. break;
  693. default:
  694. sprintf(errstr,"TK sent brktablesize > 0 for input_data_type [%d] not using brktables.\n",
  695. dz->input_data_type);
  696. return(PROGRAM_ERROR);
  697. }
  698. break;
  699. }
  700. break;
  701. case(INPUT_NUMSIZE+4):
  702. if(sscanf(argv[cnt],"%d",&dz->numsize)!=1) {
  703. sprintf(errstr,"Cannot read numsize sent from TK\n");
  704. return(DATA_ERROR);
  705. }
  706. break;
  707. case(INPUT_LINECNT+4):
  708. if(sscanf(argv[cnt],"%d",&dz->linecnt)!=1) {
  709. sprintf(errstr,"Cannot read linecnt sent from TK\n");
  710. return(DATA_ERROR);
  711. }
  712. break;
  713. case(INPUT_ALL_WORDS+4):
  714. if(sscanf(argv[cnt],"%d",&dz->all_words)!=1) {
  715. sprintf(errstr,"Cannot read all_words sent from TK\n");
  716. return(DATA_ERROR);
  717. }
  718. break;
  719. case(INPUT_ARATE+4):
  720. if(sscanf(argv[cnt],"%f",&dz->infile->arate)!=1) {
  721. sprintf(errstr,"Cannot read arate sent from TK\n");
  722. return(DATA_ERROR);
  723. }
  724. break;
  725. case(INPUT_FRAMETIME+4):
  726. if(sscanf(argv[cnt],"%lf",&dummy)!=1) {
  727. sprintf(errstr,"Cannot read frametime sent from TK\n");
  728. return(DATA_ERROR);
  729. }
  730. dz->frametime = (float)dummy;
  731. break;
  732. case(INPUT_WINDOW_SIZE+4):
  733. if(sscanf(argv[cnt],"%f",&dz->infile->window_size)!=1) {
  734. sprintf(errstr,"Cannot read window_size sent from TK\n");
  735. return(DATA_ERROR);
  736. }
  737. break;
  738. case(INPUT_NYQUIST+4):
  739. if(sscanf(argv[cnt],"%lf",&dz->nyquist)!=1) {
  740. sprintf(errstr,"Cannot read nyquist sent from TK\n");
  741. return(DATA_ERROR);
  742. }
  743. break;
  744. case(INPUT_DURATION+4):
  745. if(sscanf(argv[cnt],"%lf",&dz->duration)!=1) {
  746. sprintf(errstr,"Cannot read duration sent from TK\n");
  747. return(DATA_ERROR);
  748. }
  749. break;
  750. case(INPUT_MINBRK+4):
  751. if(sscanf(argv[cnt],"%lf",&dz->minbrk)!=1) {
  752. sprintf(errstr,"Cannot read minbrk sent from TK\n");
  753. return(DATA_ERROR);
  754. }
  755. break;
  756. case(INPUT_MAXBRK+4):
  757. if(sscanf(argv[cnt],"%lf",&dz->maxbrk)!=1) {
  758. sprintf(errstr,"Cannot read maxbrk sent from TK\n");
  759. return(DATA_ERROR);
  760. }
  761. break;
  762. case(INPUT_MINNUM+4):
  763. if(sscanf(argv[cnt],"%lf",&dz->minnum)!=1) {
  764. sprintf(errstr,"Cannot read minnum sent from TK\n");
  765. return(DATA_ERROR);
  766. }
  767. break;
  768. case(INPUT_MAXNUM+4):
  769. if(sscanf(argv[cnt],"%lf",&dz->maxnum)!=1) {
  770. sprintf(errstr,"Cannot read maxnum sent from TK\n");
  771. return(DATA_ERROR);
  772. }
  773. break;
  774. default:
  775. sprintf(errstr,"case switch item missing: parse_sloom_data()\n");
  776. return(PROGRAM_ERROR);
  777. }
  778. cnt++;
  779. }
  780. if(cnt!=PRE_CMDLINE_DATACNT+1) {
  781. sprintf(errstr,"Insufficient pre-cmdline params sent from TK\n");
  782. return(DATA_ERROR);
  783. }
  784. if(true_cnt)
  785. cnt = true_cnt;
  786. *cmdlinecnt = 0;
  787. while(cnt < argc) {
  788. if((exit_status = get_tk_cmdline_word(cmdlinecnt,cmdline,argv[cnt]))<0)
  789. return(exit_status);
  790. cnt++;
  791. }
  792. return(FINISHED);
  793. }
  794. /********************************* GET_TK_CMDLINE_WORD *********************************/
  795. int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q)
  796. {
  797. if(*cmdlinecnt==0) {
  798. if((*cmdline = (char **)malloc(sizeof(char *)))==NULL) {
  799. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  800. return(MEMORY_ERROR);
  801. }
  802. } else {
  803. if((*cmdline = (char **)realloc(*cmdline,((*cmdlinecnt)+1) * sizeof(char *)))==NULL) {
  804. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  805. return(MEMORY_ERROR);
  806. }
  807. }
  808. if(((*cmdline)[*cmdlinecnt] = (char *)malloc((strlen(q) + 1) * sizeof(char)))==NULL) {
  809. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline item %d.\n",(*cmdlinecnt)+1);
  810. return(MEMORY_ERROR);
  811. }
  812. strcpy((*cmdline)[*cmdlinecnt],q);
  813. (*cmdlinecnt)++;
  814. return(FINISHED);
  815. }
  816. /****************************** ASSIGN_FILE_DATA_STORAGE *********************************/
  817. int assign_file_data_storage(int infilecnt,dataptr dz)
  818. {
  819. int exit_status;
  820. int no_sndfile_system_files = FALSE;
  821. dz->infilecnt = infilecnt;
  822. if((exit_status = allocate_filespace(dz))<0)
  823. return(exit_status);
  824. if(no_sndfile_system_files)
  825. dz->infilecnt = 0;
  826. return(FINISHED);
  827. }
  828. /************************* redundant functions: to ensure libs compile OK *******************/
  829. int assign_process_logic(dataptr dz)
  830. {
  831. return(FINISHED);
  832. }
  833. void set_legal_infile_structure(dataptr dz)
  834. {}
  835. int set_legal_internalparam_structure(int process,int mode,aplptr ap)
  836. {
  837. return(FINISHED);
  838. }
  839. int setup_internal_arrays_and_array_pointers(dataptr dz)
  840. {
  841. return(FINISHED);
  842. }
  843. int establish_bufptrs_and_extra_buffers(dataptr dz)
  844. {
  845. return(FINISHED);
  846. }
  847. int get_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  848. {
  849. return(FINISHED);
  850. }
  851. int read_special_data(char *str,dataptr dz)
  852. {
  853. return(FINISHED);
  854. }
  855. int inner_loop
  856. (int *peakscore,int *descnt,int *in_start_portion,int *least,int *pitchcnt,int windows_in_buf,dataptr dz)
  857. {
  858. return(FINISHED);
  859. }
  860. /******************************** USAGE ********************************/
  861. int usage1(void)
  862. {
  863. fprintf(stderr,
  864. "USAGE: ptobrk withzeros binary-pitchfile outtextfile min-pitch-dur\n\n"
  865. "Converts binary pitch data to time-frq pairs in a breakpoint textfile.\n"
  866. "\n"
  867. "This process should be used instead of 'repitch pchtotext'\n"
  868. "for files containing no-pitch and no-sound markers.\n"
  869. "\n"
  870. "MIN-PITCH-DUR gives minimum time (in milliseconds) any stretch of pitchdata\n"
  871. " must persist to be regarded as valid data.\n"
  872. " (range 1 ms to 1000 ms: suggest 20 ms).\n");
  873. return(USAGE_ONLY);
  874. }
  875. int usage2(char *str)
  876. {
  877. return usage1();
  878. }
  879. int usage3(char *str1,char *str2)
  880. {
  881. fprintf(stderr,"Insufficient parameters on command line.\n");
  882. return(USAGE_ONLY);
  883. }
  884. /************************* OPEN_FILE_AND_GET_PROPS *******************************/
  885. int open_file_and_get_props(int filecnt,char *filename,int *srate,int chans,dataptr dz)
  886. {
  887. int exit_status;
  888. double maxamp, maxloc;
  889. int maxrep;
  890. int getmax = 0, getmaxinfo = 0;
  891. infileptr ifp;
  892. if((ifp = (infileptr)malloc(sizeof(struct filedata)))==NULL) {
  893. sprintf(errstr,"INSUFFICIENT MEMORY to store data on files.\n");
  894. return(MEMORY_ERROR);
  895. }
  896. if((dz->ifd[filecnt] = sndopenEx(filename,0,CDP_OPEN_RDONLY)) < 0) {
  897. sprintf(errstr,"Failed to open sndfile %s\n",filename);
  898. return(SYSTEM_ERROR);
  899. }
  900. if((exit_status = readhead(ifp,dz->ifd[filecnt],filename,&maxamp,&maxloc,&maxrep,getmax,getmaxinfo))<0)
  901. return(exit_status);
  902. copy_to_fileptr(ifp,dz->infile);
  903. if(dz->infile->filetype!=SNDFILE) {
  904. sprintf(errstr,"Non soundfile encountered [%s]: open_file_and_get_props()\n",filename);
  905. return(PROGRAM_ERROR);
  906. }
  907. if(dz->infile->channels!=chans) {
  908. sprintf(errstr,"Incorrect channels found [%s]: open_file_and_get_props()\n",filename);
  909. return(PROGRAM_ERROR);
  910. }
  911. if(filecnt==0)
  912. *srate = dz->infile->srate;
  913. else if(dz->infile->srate != *srate) {
  914. sprintf(errstr,"incompatible srates: [file %s] open_file_and_get_props()\n",filename);
  915. return(PROGRAM_ERROR);
  916. }
  917. if((dz->insams[filecnt] = sndsizeEx(dz->ifd[filecnt]))<0) {
  918. sprintf(errstr, "Can't read size of input file %s: open_file_and_get_props()\n",filename);
  919. return(PROGRAM_ERROR);
  920. }
  921. if(dz->insams[filecnt] <=0) {
  922. sprintf(errstr, "Zero size for input file %s: open_file_and_get_props()\n",filename);
  923. return(PROGRAM_ERROR);
  924. }
  925. return(FINISHED);
  926. }
  927. /*************************** CONVERT_PITCH_FROM_BINARY_TO_TEXT **************************/
  928. int convert_pitch_from_binary_to_text(dataptr dz)
  929. {
  930. int exit_status;
  931. int brklen, n, m;
  932. if((dz->parray[0] = malloc(((dz->wlength + 1) * 2) * sizeof(double)))==NULL) {
  933. sprintf(errstr,"INSUFFICIENT MEMORY FOR TEXT DATA\n");
  934. return MEMORY_ERROR;
  935. }
  936. for(n=0;n<dz->wlength;n++) {
  937. if(dz->pitches[n] > dz->infile->origrate) {
  938. sprintf(errstr,"INFO: Infinities found in the binary pitch data\n");
  939. return(DATA_ERROR);
  940. }
  941. }
  942. if((exit_status = convert_pch_data_to_brkpnttable(&brklen,dz->pitches,dz->frametime,0,dz))<0)
  943. return(exit_status);
  944. for(n=0,m=0;n<brklen;n++,m+=2)
  945. fprintf(dz->fp,"%lf\t%lf\n",dz->parray[0][m],dz->parray[0][m+1]);
  946. return(FINISHED);
  947. }
  948. /***************** CONVERT_PCH_OR_TRANSPOS_DATA_TO_BRKPNTTABLE ***********************/
  949. #define TONE_CENT (.01) /* SEMITONES */
  950. int convert_pch_data_to_brkpnttable(int *brksize,float *floatbuf,float frametime,int array_no,dataptr dz)
  951. {
  952. int exit_status;
  953. double *q;
  954. float *p = floatbuf;
  955. float *endptab = floatbuf + dz->wlength;
  956. int n, bsize;
  957. double sharpness = TONE_CENT; /* sharpness in semitones */
  958. if(dz->wlength<2) {
  959. sprintf(errstr,"Not enough pitchdata to convert to brktable.\n");
  960. return(DATA_ERROR);
  961. }
  962. q = dz->parray[array_no];
  963. n = 0;
  964. *q++ = 0.0;
  965. *q++ = (double)*p++;
  966. *q++ = frametime;
  967. *q++ = (double)*p++;
  968. n = 2;
  969. while(endptab-p > 0) {
  970. *q++ = (double)n * frametime;
  971. *q++ = (double)*p++;
  972. n++;
  973. }
  974. bsize = q - dz->parray[array_no];
  975. if((exit_status = incremental_p_datareduction(array_no,&bsize,sharpness,dz))<0)
  976. return(exit_status);
  977. n = bsize;
  978. if((dz->parray[array_no] = (double *)realloc((char *)dz->parray[array_no],n*sizeof(double)))==NULL) {
  979. sprintf(errstr,"convert_pch_data_to_brkpnttable()\n");
  980. return(MEMORY_ERROR);
  981. }
  982. *brksize = n/2;
  983. return(FINISHED);
  984. }
  985. /***************************** incremental_p_datareduction ******************************/
  986. int incremental_p_datareduction(int array_no,int *bsize,double sharp,dataptr dz)
  987. {
  988. int exit_status;
  989. double flat;
  990. double *blokbase, *blokend, *qref, *val1, *val2, *val3;
  991. double sharp_semitones = LOG2(dz->is_sharp) * SEMITONES_PER_OCTAVE;
  992. double *thisarray = dz->parray[array_no], *thisstart, *arrayend;
  993. int done = 0;
  994. blokbase = thisarray;
  995. while(*(blokbase+1) < 0.0) { /* Advance over any initial -ve markers */
  996. blokbase += 2;
  997. if(blokbase >= thisarray + (*bsize) - 1)
  998. return(FINISHED);
  999. }
  1000. thisstart = blokbase; /* set base of all future data-reduction attempts where +ve value data begins */
  1001. while(*bsize >= 6 && sharp < sharp_semitones) {
  1002. arrayend = thisarray + (*bsize) - 1;
  1003. flat = -sharp;
  1004. blokbase = thisstart;
  1005. val1 = blokbase+1; /* Check if any of the next 3 values are -ve */
  1006. val2 = blokbase+3;
  1007. val3 = blokbase+5;
  1008. if(val3 >= arrayend)
  1009. break;
  1010. while(*val3 < 0.0 || *val2 < 0.0 || *val1 < 0.0) {
  1011. blokbase +=2; /* Advance until we have a block of 3 +ve values */
  1012. val1 = blokbase+1;
  1013. val2 = blokbase+3;
  1014. val3 = blokbase+5;
  1015. if(val3 >= arrayend) {
  1016. done = 1;
  1017. break;
  1018. }
  1019. }
  1020. if(done)
  1021. break;
  1022. while(val3 < arrayend) { /* At this point we examine a block of 3 val-pairs, and we're pointing to the 3rd */
  1023. if(*val3 < 0.0) { /* This 3rd value may be negative: If so, advance until we find a +ve value */
  1024. while(*val3 < 0.0) {
  1025. val3 += 2;
  1026. if(val3 >= arrayend) {
  1027. done = 1;
  1028. break;
  1029. }
  1030. }
  1031. if(done)
  1032. break;
  1033. blokbase = val3 - 1; /* we now definitely have 1 positive value .. but we need 3 */
  1034. val1 = blokbase+1;
  1035. val2 = blokbase+3;
  1036. val3 = blokbase+5;
  1037. if(val3 >= arrayend)
  1038. break;
  1039. while(*val1 < 0.0 || *val2 < 0.0 || *val3 < 0.0) {
  1040. blokbase += 2;
  1041. val1 = blokbase+1; /* Advance until we find a 3 +ve value */
  1042. val2 = blokbase+3;
  1043. val3 = blokbase+5;
  1044. if(val3 >= arrayend) {
  1045. done = 1;
  1046. break;
  1047. }
  1048. } /* we now have a block of 3 positive vals and can try data-reduce */
  1049. if(done)
  1050. break;
  1051. }
  1052. qref = blokbase + 4;
  1053. if((exit_status = p_datareduce(&qref,sharp,flat,thisarray,bsize))<0)
  1054. return(exit_status);
  1055. arrayend = thisarray + (*bsize) - 1;
  1056. blokbase += 2; /* advance the base of the block of three values */
  1057. val3 += 2;
  1058. }
  1059. sharp *= 2.0; /* interval-size doubles */
  1060. }
  1061. if(*bsize >= 6) {
  1062. blokbase = thisstart;
  1063. arrayend = thisarray + (*bsize) - 1;
  1064. sharp = sharp_semitones;
  1065. flat = -sharp;
  1066. val1 = blokbase+1;
  1067. val2 = blokbase+3;
  1068. val3 = blokbase+5;
  1069. if(val3 < arrayend) {
  1070. while(*val1 < 0.0 || *val2 < 0.0 || *val3 < 0.0) {
  1071. blokbase += 2;
  1072. val1 = blokbase+1;
  1073. val2 = blokbase+3;
  1074. val3 = blokbase+5;
  1075. if(val3 >= arrayend)
  1076. break;
  1077. } /* we now have a block of 3 positive vals and can try data-reduce */
  1078. while(val3 < arrayend) {
  1079. if(*val3 < 0.0) {
  1080. while(*val3 < 0.0) {
  1081. val3 += 2;
  1082. if(val3 >= arrayend) {
  1083. done = 1;
  1084. break;
  1085. }
  1086. }
  1087. if(done)
  1088. break;
  1089. blokbase = val3 - 1; /* we now definitely have 1 positive value .. but we need 3 */
  1090. val1 = blokbase+1;
  1091. val2 = blokbase+3;
  1092. val3 = blokbase+5;
  1093. if(val3 >= arrayend)
  1094. break;
  1095. while(*val1 < 0.0 || *val2 < 0.0 || *val3 < 0.0) {
  1096. blokbase += 2;
  1097. val1 = blokbase+1;
  1098. val2 = blokbase+3;
  1099. val3 = blokbase+5;
  1100. if(val3 >= arrayend) {
  1101. done = 1;
  1102. break;
  1103. }
  1104. } /* we now have a block of 3 positive vals and can try data-reduce */
  1105. if(done)
  1106. break;
  1107. }
  1108. qref = blokbase + 4;
  1109. if((exit_status = p_datareduce(&qref,sharp,flat,thisarray,bsize))<0)
  1110. return(exit_status);
  1111. arrayend = thisarray + (*bsize) - 1;
  1112. blokbase += 2; /* advance the base of the block of three values */
  1113. val3 += 2;
  1114. }
  1115. }
  1116. } /* 2nd pass datareduces blocks of -ve markers */
  1117. blokbase = thisarray;
  1118. val1 = blokbase+1;
  1119. val2 = blokbase+3;
  1120. arrayend = thisarray + (*bsize) - 1;
  1121. if(*bsize >= 6) {
  1122. while(val2 < arrayend) {
  1123. if(*val1 < 0.0) { /* Find -ve markers */
  1124. while(flteq(*val2,*val1)) { /* If the same -ve marker is repeated find the end of the self-similar block */
  1125. val2 += 2;
  1126. if(val2 >= arrayend)
  1127. break;
  1128. }
  1129. blokbase = val1 + 1; /* point to the first item after the block start (blokbase), and the last item before the block end (blokend)*/
  1130. blokend = val2 - 3;
  1131. if(blokend > blokbase) { /* if there are table entries lying between qbase and q */
  1132. *bsize -= (blokend - blokbase); /* shrink the tablesize by the size of the unwanted block */
  1133. while(blokend < arrayend) { /* overwrite the unwanted block by copying data backwards */
  1134. *blokbase = *blokend;
  1135. blokbase++;
  1136. blokend++;
  1137. }
  1138. val2 = val1 + 2; /* move the 2nd value pointer to point to the end of the rewritten self-similar block */
  1139. arrayend = thisarray + (*bsize) - 1; /* reset the address of the end of the array */
  1140. }
  1141. }
  1142. val1 = val2; /* advance up the array */
  1143. val2 += 2;
  1144. }
  1145. }
  1146. return(FINISHED);
  1147. }
  1148. /***************************** P_DATAREDUCE ***********************/
  1149. int p_datareduce(double **q,double sharp,double flat,double *thisarray,int *bsize)
  1150. {
  1151. double interval;
  1152. double *arrayend;
  1153. double *p = (*q)-6, *midpair = (*q)-4, *endpair = (*q)-2;
  1154. double startime = *p++;
  1155. double startval = LOG2(*p++); /* pitch = LOG(p/root) = LOG(p) - LOG(root) */
  1156. double midtime = *p++;
  1157. double midval = LOG2(*p++); /* pitch = LOG(p/root) = LOG(p) - LOG(root) */
  1158. double endtime = *p++;
  1159. double endval = LOG2(*p);
  1160. double valrange = endval-startval; /* LOG(root) cancels out */
  1161. double midtimeratio = (midtime-startime)/(endtime-startime);
  1162. double guessval = (valrange * midtimeratio) + startval; /* -LOG(root) reintroduced */
  1163. if((interval = (guessval - midval) * SEMITONES_PER_OCTAVE) < sharp && interval > flat) { /* but cancels again */
  1164. arrayend = thisarray + *bsize;
  1165. while(endpair < arrayend)
  1166. *midpair++ = *endpair++;
  1167. (*q) -= 2;
  1168. *bsize -= 2;
  1169. }
  1170. return(FINISHED);
  1171. }
  1172. #ifndef round
  1173. int round(double a)
  1174. {
  1175. return (int)floor(a + 0.5);
  1176. }
  1177. #endif