packet.c 67 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734
  1. /*
  2. * Copyright (c) 1983-2023 Trevor Wishart and Composers Desktop Project Ltd
  3. * http://www.trevorwishart.co.uk
  4. * http://www.composersdesktop.com
  5. *
  6. This file is part of the CDP System.
  7. The CDP System is free software; you can redistribute it
  8. and/or modify it under the terms of the GNU Lesser General Public
  9. License as published by the Free Software Foundation; either
  10. version 2.1 of the License, or (at your option) any later version.
  11. The CDP System is distributed in the hope that it will be useful,
  12. but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. GNU Lesser General Public License for more details.
  15. You should have received a copy of the GNU Lesser General Public
  16. License along with the CDP System; if not, write to the Free Software
  17. Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  18. 02111-1307 USA
  19. *
  20. */
  21. #include <stdio.h>
  22. #include <stdlib.h>
  23. #include <structures.h>
  24. #include <tkglobals.h>
  25. #include <pnames.h>
  26. #include <filetype.h>
  27. #include <processno.h>
  28. #include <modeno.h>
  29. #include <logic.h>
  30. #include <globcon.h>
  31. #include <cdpmain.h>
  32. #include <math.h>
  33. #include <mixxcon.h>
  34. #include <osbind.h>
  35. #include <standalone.h>
  36. #include <ctype.h>
  37. #include <sfsys.h>
  38. #include <string.h>
  39. #include <srates.h>
  40. #define PAK_SCALE (6.0) // Scaling of centring 0-1 range, to make it more linear in effect
  41. #define PAK_MINSEG (32) // minimum length of halfwave to level-adjust with -f
  42. #define PAK_NORM (0.95) // Level of normalised packet
  43. #define BUFEXPAND (3)
  44. #ifdef unix
  45. #define round(x) lround((x))
  46. #endif
  47. char errstr[2400];
  48. int anal_infiles = 1;
  49. int sloom = 0;
  50. int sloombatch = 0;
  51. const char* cdp_version = "7.1.0";
  52. //CDP LIB REPLACEMENTS
  53. static int setup_packet_application(dataptr dz);
  54. static int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz);
  55. static int parse_infile_and_check_type(char **cmdline,dataptr dz);
  56. static int setup_packet_param_ranges_and_defaults(dataptr dz);
  57. static int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz);
  58. static int handle_the_special_data(char *str,dataptr dz);
  59. static int setup_and_init_input_param_activity(dataptr dz,int tipc);
  60. static int setup_input_param_defaultval_stores(int tipc,aplptr ap);
  61. static int establish_application(dataptr dz);
  62. static int initialise_vflags(dataptr dz);
  63. static int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz);
  64. static int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz);
  65. static int mark_parameter_types(dataptr dz,aplptr ap);
  66. static int assign_file_data_storage(int infilecnt,dataptr dz);
  67. static int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q);
  68. static int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz);
  69. static int get_the_mode_from_cmdline(char *str,dataptr dz);
  70. static int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt);
  71. static int packet(dataptr dz);
  72. static int find_all_positive_peaks(int startsearch,int endsearch,int *peakcnt,dataptr dz);
  73. static int find_all_local_minima(int peakcnt,int *local_minima_cnt,dataptr dz);
  74. static int locate_zero_crossings(int local_minima_cnt,dataptr dz);
  75. static int create_packet_sndbufs(dataptr dz);
  76. static int packet_param_preprocess(dataptr dz);
  77. static void shave(float *obuf,int *outcnt);
  78. /**************************************** MAIN *********************************************/
  79. int main(int argc,char *argv[])
  80. {
  81. int exit_status;
  82. dataptr dz = NULL;
  83. char **cmdline;
  84. int cmdlinecnt;
  85. int n;
  86. // aplptr ap;
  87. int is_launched = FALSE;
  88. if(argc==2 && (strcmp(argv[1],"--version") == 0)) {
  89. fprintf(stdout,"%s\n",cdp_version);
  90. fflush(stdout);
  91. return 0;
  92. }
  93. /* CHECK FOR SOUNDLOOM */
  94. if((sloom = sound_loom_in_use(&argc,&argv)) > 1) {
  95. sloom = 0;
  96. sloombatch = 1;
  97. }
  98. if(sflinit("cdp")){
  99. sfperror("cdp: initialisation\n");
  100. return(FAILED);
  101. }
  102. /* SET UP THE PRINCIPLE DATASTRUCTURE */
  103. if((exit_status = establish_datastructure(&dz))<0) { // CDP LIB
  104. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  105. return(FAILED);
  106. }
  107. if(!sloom) {
  108. if(argc == 1) {
  109. usage1();
  110. return(FAILED);
  111. } else if(argc == 2) {
  112. usage2(argv[1]);
  113. return(FAILED);
  114. }
  115. }
  116. if(!sloom) {
  117. if((exit_status = make_initial_cmdline_check(&argc,&argv))<0) { // CDP LIB
  118. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  119. return(FAILED);
  120. }
  121. cmdline = argv;
  122. cmdlinecnt = argc;
  123. if((get_the_process_no(argv[0],dz))<0)
  124. return(FAILED);
  125. cmdline++;
  126. cmdlinecnt--;
  127. dz->maxmode = 2;
  128. if((exit_status = get_the_mode_from_cmdline(cmdline[0],dz))<0) {
  129. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  130. return(exit_status);
  131. }
  132. cmdline++;
  133. cmdlinecnt--;
  134. // setup_particular_application =
  135. if((exit_status = setup_packet_application(dz))<0) {
  136. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  137. return(FAILED);
  138. }
  139. if((exit_status = count_and_allocate_for_infiles(cmdlinecnt,cmdline,dz))<0) { // CDP LIB
  140. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  141. return(FAILED);
  142. }
  143. } else {
  144. //parse_TK_data() =
  145. if((exit_status = parse_sloom_data(argc,argv,&cmdline,&cmdlinecnt,dz))<0) {
  146. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  147. return(exit_status);
  148. }
  149. }
  150. // ap = dz->application;
  151. // parse_infile_and_hone_type() =
  152. if((exit_status = parse_infile_and_check_type(cmdline,dz))<0) {
  153. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  154. return(FAILED);
  155. }
  156. // setup_param_ranges_and_defaults() =
  157. if((exit_status = setup_packet_param_ranges_and_defaults(dz))<0) {
  158. exit_status = print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  159. return(FAILED);
  160. }
  161. // open_first_infile CDP LIB
  162. if((exit_status = open_first_infile(cmdline[0],dz))<0) {
  163. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  164. return(FAILED);
  165. }
  166. cmdlinecnt--;
  167. cmdline++;
  168. // handle_extra_infiles() : redundant
  169. // handle_outfile() =
  170. if((exit_status = handle_the_outfile(&cmdlinecnt,&cmdline,dz))<0) {
  171. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  172. return(FAILED);
  173. }
  174. // handle_formants() redundant
  175. // handle_formant_quiksearch() redundant
  176. dz->larray_cnt = 2;
  177. if((dz->lparray = (int **)malloc(dz->larray_cnt * sizeof(int *)))==NULL) {
  178. sprintf(errstr,"INSUFFICIENT MEMORY for internal long arrays.\n");
  179. return(MEMORY_ERROR);
  180. }
  181. dz->array_cnt = 3;
  182. if((dz->parray = (double **)malloc(dz->array_cnt * sizeof(double *)))==NULL) {
  183. sprintf(errstr,"INSUFFICIENT MEMORY for internal integer arrays.\n");
  184. return(MEMORY_ERROR);
  185. }
  186. if((exit_status = handle_the_special_data(cmdline[0],dz))<0) {
  187. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  188. return(FAILED);
  189. }
  190. cmdlinecnt--;
  191. cmdline++;
  192. if((exit_status = read_parameters_and_flags(&cmdline,&cmdlinecnt,dz))<0) { // CDP LIB
  193. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  194. return(FAILED);
  195. }
  196. // check_param_validity_and_consistency() redundant
  197. is_launched = TRUE;
  198. dz->bufcnt = 2;
  199. if((dz->sampbuf = (float **)malloc(sizeof(float *) * (dz->bufcnt+1)))==NULL) {
  200. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffers.\n");
  201. return(MEMORY_ERROR);
  202. }
  203. if((dz->sbufptr = (float **)malloc(sizeof(float *) * dz->bufcnt))==NULL) {
  204. sprintf(errstr,"INSUFFICIENT MEMORY establishing sample buffer pointers.\n");
  205. return(MEMORY_ERROR);
  206. }
  207. for(n = 0;n <dz->bufcnt; n++)
  208. dz->sampbuf[n] = dz->sbufptr[n] = (float *)0;
  209. dz->sampbuf[n] = (float *)0;
  210. if((exit_status = create_packet_sndbufs(dz))<0) {
  211. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  212. return(FAILED);
  213. }
  214. if((exit_status = packet_param_preprocess(dz))<0) {
  215. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  216. return(FAILED);
  217. }
  218. //spec_process_file =
  219. if((exit_status = packet(dz))<0) {
  220. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  221. return(FAILED);
  222. }
  223. if((exit_status = complete_output(dz))<0) { // CDP LIB
  224. print_messages_and_close_sndfiles(exit_status,is_launched,dz);
  225. return(FAILED);
  226. }
  227. exit_status = print_messages_and_close_sndfiles(FINISHED,is_launched,dz); // CDP LIB
  228. free(dz);
  229. return(SUCCEEDED);
  230. }
  231. /**********************************************
  232. REPLACED CDP LIB FUNCTIONS
  233. **********************************************/
  234. /****************************** SET_PARAM_DATA *********************************/
  235. int set_param_data(aplptr ap, int special_data,int maxparamcnt,int paramcnt,char *paramlist)
  236. {
  237. ap->special_data = (char)special_data;
  238. ap->param_cnt = (char)paramcnt;
  239. ap->max_param_cnt = (char)maxparamcnt;
  240. if(ap->max_param_cnt>0) {
  241. if((ap->param_list = (char *)malloc((size_t)(ap->max_param_cnt+1)))==NULL) {
  242. sprintf(errstr,"INSUFFICIENT MEMORY: for param_list\n");
  243. return(MEMORY_ERROR);
  244. }
  245. strcpy(ap->param_list,paramlist);
  246. }
  247. return(FINISHED);
  248. }
  249. /****************************** SET_VFLGS *********************************/
  250. int set_vflgs
  251. (aplptr ap,char *optflags,int optcnt,char *optlist,char *varflags,int vflagcnt, int vparamcnt,char *varlist)
  252. {
  253. ap->option_cnt = (char) optcnt; /*RWD added cast */
  254. if(optcnt) {
  255. if((ap->option_list = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  256. sprintf(errstr,"INSUFFICIENT MEMORY: for option_list\n");
  257. return(MEMORY_ERROR);
  258. }
  259. strcpy(ap->option_list,optlist);
  260. if((ap->option_flags = (char *)malloc((size_t)(optcnt+1)))==NULL) {
  261. sprintf(errstr,"INSUFFICIENT MEMORY: for option_flags\n");
  262. return(MEMORY_ERROR);
  263. }
  264. strcpy(ap->option_flags,optflags);
  265. }
  266. ap->vflag_cnt = (char) vflagcnt;
  267. ap->variant_param_cnt = (char) vparamcnt;
  268. if(vflagcnt) {
  269. if((ap->variant_list = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  270. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_list\n");
  271. return(MEMORY_ERROR);
  272. }
  273. strcpy(ap->variant_list,varlist);
  274. if((ap->variant_flags = (char *)malloc((size_t)(vflagcnt+1)))==NULL) {
  275. sprintf(errstr,"INSUFFICIENT MEMORY: for variant_flags\n");
  276. return(MEMORY_ERROR);
  277. }
  278. strcpy(ap->variant_flags,varflags);
  279. }
  280. return(FINISHED);
  281. }
  282. /***************************** APPLICATION_INIT **************************/
  283. int application_init(dataptr dz)
  284. {
  285. int exit_status;
  286. int storage_cnt;
  287. int tipc, brkcnt;
  288. aplptr ap = dz->application;
  289. if(ap->vflag_cnt>0)
  290. initialise_vflags(dz);
  291. tipc = ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt;
  292. ap->total_input_param_cnt = (char)tipc;
  293. if(tipc>0) {
  294. if((exit_status = setup_input_param_range_stores(tipc,ap))<0)
  295. return(exit_status);
  296. if((exit_status = setup_input_param_defaultval_stores(tipc,ap))<0)
  297. return(exit_status);
  298. if((exit_status = setup_and_init_input_param_activity(dz,tipc))<0)
  299. return(exit_status);
  300. }
  301. brkcnt = tipc;
  302. //THERE ARE NO INPUTFILE brktables USED IN THIS PROCESS
  303. if(brkcnt>0) {
  304. if((exit_status = setup_and_init_input_brktable_constants(dz,brkcnt))<0)
  305. return(exit_status);
  306. }
  307. if((storage_cnt = tipc + ap->internal_param_cnt)>0) {
  308. if((exit_status = setup_parameter_storage_and_constants(storage_cnt,dz))<0)
  309. return(exit_status);
  310. if((exit_status = initialise_is_int_and_no_brk_constants(storage_cnt,dz))<0)
  311. return(exit_status);
  312. }
  313. if((exit_status = mark_parameter_types(dz,ap))<0)
  314. return(exit_status);
  315. // establish_infile_constants() replaced by
  316. dz->infilecnt = 1;
  317. //establish_bufptrs_and_extra_buffers():
  318. return(FINISHED);
  319. }
  320. /********************** SETUP_PARAMETER_STORAGE_AND_CONSTANTS ********************/
  321. /* RWD mallo changed to calloc; helps debug verison run as release! */
  322. int setup_parameter_storage_and_constants(int storage_cnt,dataptr dz)
  323. {
  324. if((dz->param = (double *)calloc(storage_cnt, sizeof(double)))==NULL) {
  325. sprintf(errstr,"setup_parameter_storage_and_constants(): 1\n");
  326. return(MEMORY_ERROR);
  327. }
  328. if((dz->iparam = (int *)calloc(storage_cnt, sizeof(int) ))==NULL) {
  329. sprintf(errstr,"setup_parameter_storage_and_constants(): 2\n");
  330. return(MEMORY_ERROR);
  331. }
  332. if((dz->is_int = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  333. sprintf(errstr,"setup_parameter_storage_and_constants(): 3\n");
  334. return(MEMORY_ERROR);
  335. }
  336. if((dz->no_brk = (char *)calloc(storage_cnt, sizeof(char)))==NULL) {
  337. sprintf(errstr,"setup_parameter_storage_and_constants(): 5\n");
  338. return(MEMORY_ERROR);
  339. }
  340. return(FINISHED);
  341. }
  342. /************** INITIALISE_IS_INT_AND_NO_BRK_CONSTANTS *****************/
  343. int initialise_is_int_and_no_brk_constants(int storage_cnt,dataptr dz)
  344. {
  345. int n;
  346. for(n=0;n<storage_cnt;n++) {
  347. dz->is_int[n] = (char)0;
  348. dz->no_brk[n] = (char)0;
  349. }
  350. return(FINISHED);
  351. }
  352. /***************************** MARK_PARAMETER_TYPES **************************/
  353. int mark_parameter_types(dataptr dz,aplptr ap)
  354. {
  355. int n, m; /* PARAMS */
  356. for(n=0;n<ap->max_param_cnt;n++) {
  357. switch(ap->param_list[n]) {
  358. case('0'): break; /* dz->is_active[n] = 0 is default */
  359. case('i'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1;dz->no_brk[n] = (char)1; break;
  360. case('I'): dz->is_active[n] = (char)1; dz->is_int[n] = (char)1; break;
  361. case('d'): dz->is_active[n] = (char)1; dz->no_brk[n] = (char)1; break;
  362. case('D'): dz->is_active[n] = (char)1; /* normal case: double val or brkpnt file */ break;
  363. default:
  364. sprintf(errstr,"Programming error: invalid parameter type in mark_parameter_types()\n");
  365. return(PROGRAM_ERROR);
  366. }
  367. } /* OPTIONS */
  368. for(n=0,m=ap->max_param_cnt;n<ap->option_cnt;n++,m++) {
  369. switch(ap->option_list[n]) {
  370. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  371. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  372. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  373. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  374. default:
  375. sprintf(errstr,"Programming error: invalid option type in mark_parameter_types()\n");
  376. return(PROGRAM_ERROR);
  377. }
  378. } /* VARIANTS */
  379. for(n=0,m=ap->max_param_cnt + ap->option_cnt;n < ap->variant_param_cnt; n++, m++) {
  380. switch(ap->variant_list[n]) {
  381. case('0'): break;
  382. case('i'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  383. case('I'): dz->is_active[m] = (char)1; dz->is_int[m] = (char)1; break;
  384. case('d'): dz->is_active[m] = (char)1; dz->no_brk[m] = (char)1; break;
  385. case('D'): dz->is_active[m] = (char)1; /* normal case: double val or brkpnt file */ break;
  386. default:
  387. sprintf(errstr,"Programming error: invalid variant type in mark_parameter_types()\n");
  388. return(PROGRAM_ERROR);
  389. }
  390. } /* INTERNAL */
  391. for(n=0,
  392. m=ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt; n<ap->internal_param_cnt; n++,m++) {
  393. switch(ap->internal_param_list[n]) {
  394. case('0'): break; /* dummy variables: variables not used: but important for internal paream numbering!! */
  395. case('i'): dz->is_int[m] = (char)1; dz->no_brk[m] = (char)1; break;
  396. case('d'): dz->no_brk[m] = (char)1; break;
  397. default:
  398. sprintf(errstr,"Programming error: invalid internal param type in mark_parameter_types()\n");
  399. return(PROGRAM_ERROR);
  400. }
  401. }
  402. return(FINISHED);
  403. }
  404. /************************ HANDLE_THE_OUTFILE *********************/
  405. int handle_the_outfile(int *cmdlinecnt,char ***cmdline,dataptr dz)
  406. {
  407. int n;
  408. char *filename = (*cmdline)[0], *p;
  409. if(filename[0]=='-' && filename[1]=='f') {
  410. dz->floatsam_output = 1;
  411. dz->true_outfile_stype = SAMP_FLOAT;
  412. filename+= 2;
  413. }
  414. if(!sloom) {
  415. if(file_has_invalid_startchar(filename) || value_is_numeric(filename)) {
  416. sprintf(errstr,"Outfile name %s has invalid start character(s) or looks too much like a number.\n",filename);
  417. return(DATA_ERROR);
  418. }
  419. }
  420. p = filename; // Drop file extension
  421. while(*p != ENDOFSTR) {
  422. if(*p == '.') {
  423. *p = ENDOFSTR;
  424. break;
  425. }
  426. p++;
  427. }
  428. strcpy(dz->outfilename,filename);
  429. if(sloom) { // IF sloom, drop trailing zero
  430. n = strlen(dz->outfilename);
  431. n--;
  432. dz->outfilename[n] = ENDOFSTR;
  433. }
  434. (*cmdline)++;
  435. (*cmdlinecnt)--;
  436. return(FINISHED);
  437. }
  438. /***************************** ESTABLISH_APPLICATION **************************/
  439. int establish_application(dataptr dz)
  440. {
  441. aplptr ap;
  442. if((dz->application = (aplptr)malloc(sizeof (struct applic)))==NULL) {
  443. sprintf(errstr,"establish_application()\n");
  444. return(MEMORY_ERROR);
  445. }
  446. ap = dz->application;
  447. memset((char *)ap,0,sizeof(struct applic));
  448. return(FINISHED);
  449. }
  450. /************************* INITIALISE_VFLAGS *************************/
  451. int initialise_vflags(dataptr dz)
  452. {
  453. int n;
  454. if((dz->vflag = (char *)malloc(dz->application->vflag_cnt * sizeof(char)))==NULL) {
  455. sprintf(errstr,"INSUFFICIENT MEMORY: vflag store,\n");
  456. return(MEMORY_ERROR);
  457. }
  458. for(n=0;n<dz->application->vflag_cnt;n++)
  459. dz->vflag[n] = FALSE;
  460. return FINISHED;
  461. }
  462. /************************* SETUP_INPUT_PARAM_DEFAULTVALS *************************/
  463. int setup_input_param_defaultval_stores(int tipc,aplptr ap)
  464. {
  465. int n;
  466. if((ap->default_val = (double *)malloc(tipc * sizeof(double)))==NULL) {
  467. sprintf(errstr,"INSUFFICIENT MEMORY for application default values store\n");
  468. return(MEMORY_ERROR);
  469. }
  470. for(n=0;n<tipc;n++)
  471. ap->default_val[n] = 0.0;
  472. return(FINISHED);
  473. }
  474. /***************************** SETUP_AND_INIT_INPUT_PARAM_ACTIVITY **************************/
  475. int setup_and_init_input_param_activity(dataptr dz,int tipc)
  476. {
  477. int n;
  478. if((dz->is_active = (char *)malloc((size_t)tipc))==NULL) {
  479. sprintf(errstr,"setup_and_init_input_param_activity()\n");
  480. return(MEMORY_ERROR);
  481. }
  482. for(n=0;n<tipc;n++)
  483. dz->is_active[n] = (char)0;
  484. return(FINISHED);
  485. }
  486. /************************* SETUP_PACKET_APPLICATION *******************/
  487. int setup_packet_application(dataptr dz)
  488. {
  489. int exit_status;
  490. aplptr ap;
  491. if((exit_status = establish_application(dz))<0) // GLOBAL
  492. return(FAILED);
  493. ap = dz->application;
  494. // SEE parstruct FOR EXPLANATION of next 2 functions
  495. if((exit_status = set_param_data(ap,PAK_TIMES,3,3,"ddd"))<0)
  496. return(FAILED);
  497. if((exit_status = set_vflgs(ap,"",0,"","nfs",3,0,"000"))<0)
  498. return(FAILED);
  499. // set_legal_infile_structure -->
  500. dz->has_otherfile = FALSE;
  501. // assign_process_logic -->
  502. dz->input_data_type = SNDFILES_ONLY;
  503. dz->process_type = UNEQUAL_SNDFILE;
  504. dz->outfiletype = SNDFILE_OUT;
  505. return application_init(dz); //GLOBAL
  506. }
  507. /************************* PARSE_INFILE_AND_CHECK_TYPE *******************/
  508. int parse_infile_and_check_type(char **cmdline,dataptr dz)
  509. {
  510. int exit_status;
  511. infileptr infile_info;
  512. if(!sloom) {
  513. if((infile_info = (infileptr)malloc(sizeof(struct filedata)))==NULL) {
  514. sprintf(errstr,"INSUFFICIENT MEMORY for infile structure to test file data.");
  515. return(MEMORY_ERROR);
  516. } else if((exit_status = cdparse(cmdline[0],infile_info))<0) {
  517. sprintf(errstr,"Failed to parse input file %s\n",cmdline[0]);
  518. return(PROGRAM_ERROR);
  519. } else if(infile_info->filetype != SNDFILE) {
  520. sprintf(errstr,"File %s is not of correct type\n",cmdline[0]);
  521. return(DATA_ERROR);
  522. } else if((exit_status = copy_parse_info_to_main_structure(infile_info,dz))<0) {
  523. sprintf(errstr,"Failed to copy file parsing information\n");
  524. return(PROGRAM_ERROR);
  525. }
  526. free(infile_info);
  527. }
  528. return(FINISHED);
  529. }
  530. /************************* SETUP_PACKET_PARAM_RANGES_AND_DEFAULTS *******************/
  531. int setup_packet_param_ranges_and_defaults(dataptr dz)
  532. {
  533. int exit_status;
  534. aplptr ap = dz->application;
  535. // set_param_ranges()
  536. ap->total_input_param_cnt = (char)(ap->max_param_cnt + ap->option_cnt + ap->variant_param_cnt);
  537. // NB total_input_param_cnt is > 0 !!!
  538. if((exit_status = setup_input_param_range_stores(ap->total_input_param_cnt,ap))<0)
  539. return(FAILED);
  540. // get_param_ranges()
  541. ap->lo[PAK_DUR] = 2.0;
  542. ap->hi[PAK_DUR] = (dz->duration/2.0) * SECS_TO_MS;
  543. ap->default_val[PAK_DUR] = 50.0;
  544. ap->lo[PAK_SQZ] = 0.0;
  545. ap->hi[PAK_SQZ] = 1000.0;
  546. ap->default_val[PAK_SQZ] = 1.0;
  547. ap->lo[PAK_CTR] = -1.0;
  548. ap->hi[PAK_CTR] = 1.0;
  549. ap->default_val[PAK_CTR] = 0.0;
  550. dz->maxmode = 2;
  551. if(!sloom)
  552. put_default_vals_in_all_params(dz);
  553. return(FINISHED);
  554. }
  555. /********************************* PARSE_SLOOM_DATA *********************************/
  556. int parse_sloom_data(int argc,char *argv[],char ***cmdline,int *cmdlinecnt,dataptr dz)
  557. {
  558. int exit_status;
  559. int cnt = 1, infilecnt;
  560. int filesize, insams, inbrksize;
  561. double dummy;
  562. int true_cnt = 0;
  563. // aplptr ap;
  564. while(cnt<=PRE_CMDLINE_DATACNT) {
  565. if(cnt > argc) {
  566. sprintf(errstr,"Insufficient data sent from TK\n");
  567. return(DATA_ERROR);
  568. }
  569. switch(cnt) {
  570. case(1):
  571. if(sscanf(argv[cnt],"%d",&dz->process)!=1) {
  572. sprintf(errstr,"Cannot read process no. sent from TK\n");
  573. return(DATA_ERROR);
  574. }
  575. break;
  576. case(2):
  577. if(sscanf(argv[cnt],"%d",&dz->mode)!=1) {
  578. sprintf(errstr,"Cannot read mode no. sent from TK\n");
  579. return(DATA_ERROR);
  580. }
  581. if(dz->mode > 0)
  582. dz->mode--;
  583. //setup_particular_application() =
  584. if((exit_status = setup_packet_application(dz))<0)
  585. return(exit_status);
  586. // ap = dz->application;
  587. break;
  588. case(3):
  589. if(sscanf(argv[cnt],"%d",&infilecnt)!=1) {
  590. sprintf(errstr,"Cannot read infilecnt sent from TK\n");
  591. return(DATA_ERROR);
  592. }
  593. if(infilecnt < 1) {
  594. true_cnt = cnt + 1;
  595. cnt = PRE_CMDLINE_DATACNT; /* force exit from loop after assign_file_data_storage */
  596. }
  597. if((exit_status = assign_file_data_storage(infilecnt,dz))<0)
  598. return(exit_status);
  599. break;
  600. case(INPUT_FILETYPE+4):
  601. if(sscanf(argv[cnt],"%d",&dz->infile->filetype)!=1) {
  602. sprintf(errstr,"Cannot read filetype sent from TK (%s)\n",argv[cnt]);
  603. return(DATA_ERROR);
  604. }
  605. break;
  606. case(INPUT_FILESIZE+4):
  607. if(sscanf(argv[cnt],"%d",&filesize)!=1) {
  608. sprintf(errstr,"Cannot read infilesize sent from TK\n");
  609. return(DATA_ERROR);
  610. }
  611. dz->insams[0] = filesize;
  612. break;
  613. case(INPUT_INSAMS+4):
  614. if(sscanf(argv[cnt],"%d",&insams)!=1) {
  615. sprintf(errstr,"Cannot read insams sent from TK\n");
  616. return(DATA_ERROR);
  617. }
  618. dz->insams[0] = insams;
  619. break;
  620. case(INPUT_SRATE+4):
  621. if(sscanf(argv[cnt],"%d",&dz->infile->srate)!=1) {
  622. sprintf(errstr,"Cannot read srate sent from TK\n");
  623. return(DATA_ERROR);
  624. }
  625. break;
  626. case(INPUT_CHANNELS+4):
  627. if(sscanf(argv[cnt],"%d",&dz->infile->channels)!=1) {
  628. sprintf(errstr,"Cannot read channels sent from TK\n");
  629. return(DATA_ERROR);
  630. }
  631. break;
  632. case(INPUT_STYPE+4):
  633. if(sscanf(argv[cnt],"%d",&dz->infile->stype)!=1) {
  634. sprintf(errstr,"Cannot read stype sent from TK\n");
  635. return(DATA_ERROR);
  636. }
  637. break;
  638. case(INPUT_ORIGSTYPE+4):
  639. if(sscanf(argv[cnt],"%d",&dz->infile->origstype)!=1) {
  640. sprintf(errstr,"Cannot read origstype sent from TK\n");
  641. return(DATA_ERROR);
  642. }
  643. break;
  644. case(INPUT_ORIGRATE+4):
  645. if(sscanf(argv[cnt],"%d",&dz->infile->origrate)!=1) {
  646. sprintf(errstr,"Cannot read origrate sent from TK\n");
  647. return(DATA_ERROR);
  648. }
  649. break;
  650. case(INPUT_MLEN+4):
  651. if(sscanf(argv[cnt],"%d",&dz->infile->Mlen)!=1) {
  652. sprintf(errstr,"Cannot read Mlen sent from TK\n");
  653. return(DATA_ERROR);
  654. }
  655. break;
  656. case(INPUT_DFAC+4):
  657. if(sscanf(argv[cnt],"%d",&dz->infile->Dfac)!=1) {
  658. sprintf(errstr,"Cannot read Dfac sent from TK\n");
  659. return(DATA_ERROR);
  660. }
  661. break;
  662. case(INPUT_ORIGCHANS+4):
  663. if(sscanf(argv[cnt],"%d",&dz->infile->origchans)!=1) {
  664. sprintf(errstr,"Cannot read origchans sent from TK\n");
  665. return(DATA_ERROR);
  666. }
  667. break;
  668. case(INPUT_SPECENVCNT+4):
  669. if(sscanf(argv[cnt],"%d",&dz->infile->specenvcnt)!=1) {
  670. sprintf(errstr,"Cannot read specenvcnt sent from TK\n");
  671. return(DATA_ERROR);
  672. }
  673. dz->specenvcnt = dz->infile->specenvcnt;
  674. break;
  675. case(INPUT_WANTED+4):
  676. if(sscanf(argv[cnt],"%d",&dz->wanted)!=1) {
  677. sprintf(errstr,"Cannot read wanted sent from TK\n");
  678. return(DATA_ERROR);
  679. }
  680. break;
  681. case(INPUT_WLENGTH+4):
  682. if(sscanf(argv[cnt],"%d",&dz->wlength)!=1) {
  683. sprintf(errstr,"Cannot read wlength sent from TK\n");
  684. return(DATA_ERROR);
  685. }
  686. break;
  687. case(INPUT_OUT_CHANS+4):
  688. if(sscanf(argv[cnt],"%d",&dz->out_chans)!=1) {
  689. sprintf(errstr,"Cannot read out_chans sent from TK\n");
  690. return(DATA_ERROR);
  691. }
  692. break;
  693. /* RWD these chanegs to samps - tk will have to deal with that! */
  694. case(INPUT_DESCRIPTOR_BYTES+4):
  695. if(sscanf(argv[cnt],"%d",&dz->descriptor_samps)!=1) {
  696. sprintf(errstr,"Cannot read descriptor_samps sent from TK\n");
  697. return(DATA_ERROR);
  698. }
  699. break;
  700. case(INPUT_IS_TRANSPOS+4):
  701. if(sscanf(argv[cnt],"%d",&dz->is_transpos)!=1) {
  702. sprintf(errstr,"Cannot read is_transpos sent from TK\n");
  703. return(DATA_ERROR);
  704. }
  705. break;
  706. case(INPUT_COULD_BE_TRANSPOS+4):
  707. if(sscanf(argv[cnt],"%d",&dz->could_be_transpos)!=1) {
  708. sprintf(errstr,"Cannot read could_be_transpos sent from TK\n");
  709. return(DATA_ERROR);
  710. }
  711. break;
  712. case(INPUT_COULD_BE_PITCH+4):
  713. if(sscanf(argv[cnt],"%d",&dz->could_be_pitch)!=1) {
  714. sprintf(errstr,"Cannot read could_be_pitch sent from TK\n");
  715. return(DATA_ERROR);
  716. }
  717. break;
  718. case(INPUT_DIFFERENT_SRATES+4):
  719. if(sscanf(argv[cnt],"%d",&dz->different_srates)!=1) {
  720. sprintf(errstr,"Cannot read different_srates sent from TK\n");
  721. return(DATA_ERROR);
  722. }
  723. break;
  724. case(INPUT_DUPLICATE_SNDS+4):
  725. if(sscanf(argv[cnt],"%d",&dz->duplicate_snds)!=1) {
  726. sprintf(errstr,"Cannot read duplicate_snds sent from TK\n");
  727. return(DATA_ERROR);
  728. }
  729. break;
  730. case(INPUT_BRKSIZE+4):
  731. if(sscanf(argv[cnt],"%d",&inbrksize)!=1) {
  732. sprintf(errstr,"Cannot read brksize sent from TK\n");
  733. return(DATA_ERROR);
  734. }
  735. if(inbrksize > 0) {
  736. switch(dz->input_data_type) {
  737. case(WORDLIST_ONLY):
  738. break;
  739. case(PITCH_AND_PITCH):
  740. case(PITCH_AND_TRANSPOS):
  741. case(TRANSPOS_AND_TRANSPOS):
  742. dz->tempsize = inbrksize;
  743. break;
  744. case(BRKFILES_ONLY):
  745. case(UNRANGED_BRKFILE_ONLY):
  746. case(DB_BRKFILES_ONLY):
  747. case(ALL_FILES):
  748. case(ANY_NUMBER_OF_ANY_FILES):
  749. if(dz->extrabrkno < 0) {
  750. sprintf(errstr,"Storage location number for brktable not established by CDP.\n");
  751. return(DATA_ERROR);
  752. }
  753. if(dz->brksize == NULL) {
  754. sprintf(errstr,"CDP has not established storage space for input brktable.\n");
  755. return(PROGRAM_ERROR);
  756. }
  757. dz->brksize[dz->extrabrkno] = inbrksize;
  758. break;
  759. default:
  760. sprintf(errstr,"TK sent brktablesize > 0 for input_data_type [%d] not using brktables.\n",
  761. dz->input_data_type);
  762. return(PROGRAM_ERROR);
  763. }
  764. break;
  765. }
  766. break;
  767. case(INPUT_NUMSIZE+4):
  768. if(sscanf(argv[cnt],"%d",&dz->numsize)!=1) {
  769. sprintf(errstr,"Cannot read numsize sent from TK\n");
  770. return(DATA_ERROR);
  771. }
  772. break;
  773. case(INPUT_LINECNT+4):
  774. if(sscanf(argv[cnt],"%d",&dz->linecnt)!=1) {
  775. sprintf(errstr,"Cannot read linecnt sent from TK\n");
  776. return(DATA_ERROR);
  777. }
  778. break;
  779. case(INPUT_ALL_WORDS+4):
  780. if(sscanf(argv[cnt],"%d",&dz->all_words)!=1) {
  781. sprintf(errstr,"Cannot read all_words sent from TK\n");
  782. return(DATA_ERROR);
  783. }
  784. break;
  785. case(INPUT_ARATE+4):
  786. if(sscanf(argv[cnt],"%f",&dz->infile->arate)!=1) {
  787. sprintf(errstr,"Cannot read arate sent from TK\n");
  788. return(DATA_ERROR);
  789. }
  790. break;
  791. case(INPUT_FRAMETIME+4):
  792. if(sscanf(argv[cnt],"%lf",&dummy)!=1) {
  793. sprintf(errstr,"Cannot read frametime sent from TK\n");
  794. return(DATA_ERROR);
  795. }
  796. dz->frametime = (float)dummy;
  797. break;
  798. case(INPUT_WINDOW_SIZE+4):
  799. if(sscanf(argv[cnt],"%f",&dz->infile->window_size)!=1) {
  800. sprintf(errstr,"Cannot read window_size sent from TK\n");
  801. return(DATA_ERROR);
  802. }
  803. break;
  804. case(INPUT_NYQUIST+4):
  805. if(sscanf(argv[cnt],"%lf",&dz->nyquist)!=1) {
  806. sprintf(errstr,"Cannot read nyquist sent from TK\n");
  807. return(DATA_ERROR);
  808. }
  809. break;
  810. case(INPUT_DURATION+4):
  811. if(sscanf(argv[cnt],"%lf",&dz->duration)!=1) {
  812. sprintf(errstr,"Cannot read duration sent from TK\n");
  813. return(DATA_ERROR);
  814. }
  815. break;
  816. case(INPUT_MINBRK+4):
  817. if(sscanf(argv[cnt],"%lf",&dz->minbrk)!=1) {
  818. sprintf(errstr,"Cannot read minbrk sent from TK\n");
  819. return(DATA_ERROR);
  820. }
  821. break;
  822. case(INPUT_MAXBRK+4):
  823. if(sscanf(argv[cnt],"%lf",&dz->maxbrk)!=1) {
  824. sprintf(errstr,"Cannot read maxbrk sent from TK\n");
  825. return(DATA_ERROR);
  826. }
  827. break;
  828. case(INPUT_MINNUM+4):
  829. if(sscanf(argv[cnt],"%lf",&dz->minnum)!=1) {
  830. sprintf(errstr,"Cannot read minnum sent from TK\n");
  831. return(DATA_ERROR);
  832. }
  833. break;
  834. case(INPUT_MAXNUM+4):
  835. if(sscanf(argv[cnt],"%lf",&dz->maxnum)!=1) {
  836. sprintf(errstr,"Cannot read maxnum sent from TK\n");
  837. return(DATA_ERROR);
  838. }
  839. break;
  840. default:
  841. sprintf(errstr,"case switch item missing: parse_sloom_data()\n");
  842. return(PROGRAM_ERROR);
  843. }
  844. cnt++;
  845. }
  846. if(cnt!=PRE_CMDLINE_DATACNT+1) {
  847. sprintf(errstr,"Insufficient pre-cmdline params sent from TK\n");
  848. return(DATA_ERROR);
  849. }
  850. if(true_cnt)
  851. cnt = true_cnt;
  852. *cmdlinecnt = 0;
  853. while(cnt < argc) {
  854. if((exit_status = get_tk_cmdline_word(cmdlinecnt,cmdline,argv[cnt]))<0)
  855. return(exit_status);
  856. cnt++;
  857. }
  858. return(FINISHED);
  859. }
  860. /********************************* GET_TK_CMDLINE_WORD *********************************/
  861. int get_tk_cmdline_word(int *cmdlinecnt,char ***cmdline,char *q)
  862. {
  863. if(*cmdlinecnt==0) {
  864. if((*cmdline = (char **)malloc(sizeof(char *)))==NULL) {
  865. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  866. return(MEMORY_ERROR);
  867. }
  868. } else {
  869. if((*cmdline = (char **)realloc(*cmdline,((*cmdlinecnt)+1) * sizeof(char *)))==NULL) {
  870. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline array.\n");
  871. return(MEMORY_ERROR);
  872. }
  873. }
  874. if(((*cmdline)[*cmdlinecnt] = (char *)malloc((strlen(q) + 1) * sizeof(char)))==NULL) {
  875. sprintf(errstr,"INSUFFICIENT MEMORY for TK cmdline item %d.\n",(*cmdlinecnt)+1);
  876. return(MEMORY_ERROR);
  877. }
  878. strcpy((*cmdline)[*cmdlinecnt],q);
  879. (*cmdlinecnt)++;
  880. return(FINISHED);
  881. }
  882. /****************************** ASSIGN_FILE_DATA_STORAGE *********************************/
  883. int assign_file_data_storage(int infilecnt,dataptr dz)
  884. {
  885. int exit_status;
  886. int no_sndfile_system_files = FALSE;
  887. dz->infilecnt = infilecnt;
  888. if((exit_status = allocate_filespace(dz))<0)
  889. return(exit_status);
  890. if(no_sndfile_system_files)
  891. dz->infilecnt = 0;
  892. return(FINISHED);
  893. }
  894. /************************* redundant functions: to ensure libs compile OK *******************/
  895. int assign_process_logic(dataptr dz)
  896. {
  897. return(FINISHED);
  898. }
  899. void set_legal_infile_structure(dataptr dz)
  900. {}
  901. int set_legal_internalparam_structure(int process,int mode,aplptr ap)
  902. {
  903. return(FINISHED);
  904. }
  905. int setup_internal_arrays_and_array_pointers(dataptr dz)
  906. {
  907. return(FINISHED);
  908. }
  909. int establish_bufptrs_and_extra_buffers(dataptr dz)
  910. {
  911. return(FINISHED);
  912. }
  913. int read_special_data(char *str,dataptr dz)
  914. {
  915. return(FINISHED);
  916. }
  917. int inner_loop
  918. (int *peakscore,int *descnt,int *in_start_portion,int *least,int *pitchcnt,int windows_in_buf,dataptr dz)
  919. {
  920. return(FINISHED);
  921. }
  922. int get_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  923. {
  924. return(FINISHED);
  925. }
  926. /******************************** USAGE1 ********************************/
  927. int usage1(void)
  928. {
  929. usage2("packet");
  930. return(USAGE_ONLY);
  931. }
  932. /********************************************************************************************/
  933. int get_the_process_no(char *prog_identifier_from_cmdline,dataptr dz)
  934. {
  935. if(!strcmp(prog_identifier_from_cmdline,"packet")) dz->process = PACKET;
  936. else {
  937. sprintf(errstr,"Unknown program identification string '%s'\n",prog_identifier_from_cmdline);
  938. return(USAGE_ONLY);
  939. }
  940. return(FINISHED);
  941. }
  942. /******************************** SETUP_AND_INIT_INPUT_BRKTABLE_CONSTANTS ********************************/
  943. int setup_and_init_input_brktable_constants(dataptr dz,int brkcnt)
  944. {
  945. int n;
  946. if((dz->brk = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  947. sprintf(errstr,"setup_and_init_input_brktable_constants(): 1\n");
  948. return(MEMORY_ERROR);
  949. }
  950. if((dz->brkptr = (double **)malloc(brkcnt * sizeof(double *)))==NULL) {
  951. sprintf(errstr,"setup_and_init_input_brktable_constants(): 6\n");
  952. return(MEMORY_ERROR);
  953. }
  954. if((dz->brksize = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  955. sprintf(errstr,"setup_and_init_input_brktable_constants(): 2\n");
  956. return(MEMORY_ERROR);
  957. }
  958. if((dz->firstval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  959. sprintf(errstr,"setup_and_init_input_brktable_constants(): 3\n");
  960. return(MEMORY_ERROR);
  961. }
  962. if((dz->lastind = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  963. sprintf(errstr,"setup_and_init_input_brktable_constants(): 4\n");
  964. return(MEMORY_ERROR);
  965. }
  966. if((dz->lastval = (double *)malloc(brkcnt * sizeof(double)))==NULL) {
  967. sprintf(errstr,"setup_and_init_input_brktable_constants(): 5\n");
  968. return(MEMORY_ERROR);
  969. }
  970. if((dz->brkinit = (int *)malloc(brkcnt * sizeof(int)))==NULL) {
  971. sprintf(errstr,"setup_and_init_input_brktable_constants(): 7\n");
  972. return(MEMORY_ERROR);
  973. }
  974. for(n=0;n<brkcnt;n++) {
  975. dz->brk[n] = NULL;
  976. dz->brkptr[n] = NULL;
  977. dz->brkinit[n] = 0;
  978. dz->brksize[n] = 0;
  979. }
  980. return(FINISHED);
  981. }
  982. /******************************** USAGE2 ********************************/
  983. int usage2(char *str)
  984. {
  985. if(!strcmp(str,"packet")) {
  986. fprintf(stdout,
  987. "USAGE:\n"
  988. "packet packet 1 infile outfile times mindur narrowing centring [-n|-f] [-s]\n"
  989. "packet packet 2 infile outfile times dur narrowing centring [-n|-f] [-s]\n"
  990. "\n"
  991. "Isolate or generate a sound packet.\n"
  992. "\n"
  993. "Mode 1: Found packet: Looks for signal minima as edges of wave-packet.\n"
  994. "Mode 2: Forced packet: Creates packet at specified time.\n"
  995. "\n"
  996. "TIMES Time (or textfile of times) at which packet is extracted/created.\n"
  997. "\n"
  998. "MINDUR Min duration of (found) packet (in mS) (less than half src duration).\n"
  999. "DUR Duration of (forced) packet (in mS) (less than half src duration).\n"
  1000. "\n"
  1001. "NARROWING Narrowing of packet envelope (0 - 1000).\n"
  1002. " Values below 1.0 broaden the packet.\n"
  1003. " Values very close to zero may produce clicks (square-wave envelope).\n"
  1004. " Very high vals with very short packets may produce\n"
  1005. " click-impulses or silence.\n"
  1006. "\n"
  1007. "CENTRING Centring of peak of packet envelope.\n"
  1008. " 0 peak at centre: -1 peak at start: 1 peak at end.\n"
  1009. " If packet content has varying level, true peak position may not\n"
  1010. " correspond to envelope peak position, unless \"-f\" flag used.\n"
  1011. "\n"
  1012. "-n Normalise packet level.\n"
  1013. "\n"
  1014. "-f Packet wave maxima and minima forced up(down)to packet contour.\n"
  1015. " (default, packet envelope simply imposed on existing signal).\n"
  1016. " (normalisatiojn flag ignored if \"-f\" flag used\n"
  1017. "\n"
  1018. "-s Shave off leading or trailing silence.\n"
  1019. "\n");
  1020. } else
  1021. fprintf(stdout,"Unknown option '%s'\n",str);
  1022. return(USAGE_ONLY);
  1023. }
  1024. int usage3(char *str1,char *str2)
  1025. {
  1026. fprintf(stderr,"Insufficient parameters on command line.\n");
  1027. return(USAGE_ONLY);
  1028. }
  1029. /**************************** PACKET_PARAM_PREPROCESS *************************/
  1030. int packet_param_preprocess (dataptr dz)
  1031. {
  1032. int n, halftabsize = TREMOLO_TABSIZE/2;
  1033. int isneg = 0, tablopos, tabhipos;
  1034. double *costab, *temptab, diff, tabrem, tabincr, lotabincr, hitabincr, readpos, frac;
  1035. if((dz->parray[0] = (double *)malloc((TREMOLO_TABSIZE + 1) * sizeof(double)))==NULL) {
  1036. sprintf(errstr,"INSUFFICIENT MEMORY for sine table.\n");
  1037. return(MEMORY_ERROR);
  1038. }
  1039. costab = dz->parray[0];
  1040. if((dz->parray[2] = (double *)malloc((TREMOLO_TABSIZE + 1) * sizeof(double)))==NULL) {
  1041. sprintf(errstr,"INSUFFICIENT MEMORY for sine table.\n");
  1042. return(MEMORY_ERROR);
  1043. }
  1044. temptab = dz->parray[2];
  1045. for(n=0;n<TREMOLO_TABSIZE;n++) {
  1046. costab[n] = cos(PI * 2.0 * ((double)n/(double)TREMOLO_TABSIZE));
  1047. costab[n] += 1.0;
  1048. costab[n] /= 2.0;
  1049. costab[n] = 1.0 - costab[n];
  1050. }
  1051. costab[n] = 0.0; /* wrap around point */
  1052. if(!flteq(dz->param[PAK_SQZ],1.0)) {
  1053. for(n=0;n<TREMOLO_TABSIZE;n++)
  1054. costab[n] = pow(costab[n],dz->param[PAK_SQZ]);
  1055. }
  1056. if(!flteq(dz->param[PAK_CTR],1.0)) {
  1057. if(dz->param[PAK_CTR] < 0.0) {
  1058. frac = 1.0 + dz->param[PAK_CTR];
  1059. isneg = 1;
  1060. } else
  1061. frac = 1.0 - dz->param[PAK_CTR];
  1062. if(isneg) {
  1063. lotabincr = 1.0/frac;
  1064. hitabincr = 1.0/(2.0 - frac);
  1065. } else {
  1066. lotabincr = 1.0/(2.0 - frac);
  1067. hitabincr = 1.0/frac;
  1068. }
  1069. readpos = 0;
  1070. tabincr = lotabincr;
  1071. for(n=0;n<TREMOLO_TABSIZE;n++) {
  1072. if(readpos >= halftabsize)
  1073. tabincr = hitabincr;
  1074. tablopos = (int)floor(readpos);
  1075. tabhipos = min(tablopos + 1,TREMOLO_TABSIZE);
  1076. tabrem = readpos - (double)tablopos;
  1077. diff = costab[tabhipos] - costab[tablopos];
  1078. temptab[n] = costab[tablopos] + (diff * tabrem);
  1079. readpos += tabincr;
  1080. }
  1081. for(n=0;n<TREMOLO_TABSIZE;n++)
  1082. costab[n] = temptab[n];
  1083. }
  1084. return(FINISHED);
  1085. }
  1086. /******************************** PACKET ********************************/
  1087. int packet(dataptr dz)
  1088. {
  1089. int exit_status, chans = dz->infile->channels, fileno, j, OK, gotit, negwritten, poswritten = 0, ispos;
  1090. float *ibuf = dz->sampbuf[0], *obuf = dz->sampbuf[1];
  1091. double *costab = dz->parray[0];
  1092. int n, m, k, nn = -1, srate = dz->infile->srate, *packet_at = dz->lparray[0], *pos, peakcnt = 0, local_minima_cnt = 0;
  1093. int halfspan = 0, span, pakat, startspan, endspan, pack_centre, pack_start = 0, pack_end = 0;
  1094. int true_startspan = 0, true_endspan = 0, truehalfspan = 0, truespan = 0;
  1095. int /*pack_gpstart,*/ outcnt, outgpcnt, tabsize = TREMOLO_TABSIZE, tablopos, tabhipos;
  1096. int upstart = -1, maxat = -1, dnstart = -1, minat = -1;
  1097. char filename[200], thisnum[8];
  1098. double tabpos, tabincr, tabrem, diff, env, maxval = -1.0, minval = 1.0, adjust, normaliser, maxsamp;
  1099. dz->iparam[PAK_DUR] = (int)round(dz->param[PAK_DUR] * MS_TO_SECS * (double)srate) * chans;
  1100. if((dz->lparray[1] = (int *)malloc(dz->iparam[PAK_DUR] * BUFEXPAND * sizeof(int)))==NULL) {
  1101. sprintf(errstr,"INSUFFICIENT MEMORY to store peak locations.\n");
  1102. return(MEMORY_ERROR);
  1103. }
  1104. if((dz->parray[1] = (double *)malloc(dz->iparam[PAK_DUR] * BUFEXPAND * sizeof(double)))==NULL) {
  1105. sprintf(errstr,"INSUFFICIENT MEMORY to store peaks.\n");
  1106. return(MEMORY_ERROR);
  1107. }
  1108. pos = dz->lparray[1];
  1109. if(dz->mode == 0) {
  1110. truehalfspan = (int)ceil((dz->param[PAK_DUR] * MS_TO_SECS/2.0) * (double)srate) * chans;
  1111. truespan = truehalfspan * 2;
  1112. halfspan = truehalfspan * 3;
  1113. }
  1114. for(fileno = 0;fileno < dz->itemcnt; fileno++) {
  1115. if(dz->mode == 0) {
  1116. pakat = packet_at[fileno];
  1117. startspan = pakat - halfspan;
  1118. if(startspan < 0)
  1119. startspan = 0;
  1120. endspan = pakat + halfspan;
  1121. if(endspan > dz->insams[0])
  1122. endspan = dz->insams[0];
  1123. span = endspan - startspan;
  1124. if(span < dz->iparam[PAK_DUR]) {
  1125. fprintf(stdout,"WARNING: Packet %d too close to start or end of file: add silence to (start or end) of source.\n",fileno+1);
  1126. fflush(stdout);
  1127. continue;
  1128. }
  1129. true_startspan = pakat - truehalfspan;
  1130. true_endspan = pakat + truehalfspan;
  1131. if(startspan > 0) {
  1132. true_startspan -= startspan;
  1133. true_endspan -= startspan;
  1134. endspan -= startspan;
  1135. sndseekEx(dz->ifd[0],startspan,0);
  1136. startspan = 0;
  1137. }
  1138. if((exit_status = read_samps(ibuf,dz))<0)
  1139. return(exit_status);
  1140. peakcnt = 0;
  1141. if((exit_status = find_all_positive_peaks(startspan,endspan,&peakcnt,dz)) < 0)
  1142. return exit_status;
  1143. local_minima_cnt = 0;
  1144. if((exit_status = find_all_local_minima(peakcnt,&local_minima_cnt,dz)) < 0)
  1145. return(exit_status);
  1146. if((exit_status = locate_zero_crossings(local_minima_cnt,dz)) < 0)
  1147. return (exit_status);
  1148. OK = 0;
  1149. gotit = 0;
  1150. for(n = 0;n < local_minima_cnt; n++) {
  1151. if(pos[n] > true_startspan) { // Once we reach the start of true-span
  1152. if(n > 0) { // Find first minimum before true-span
  1153. k = n-1;
  1154. pack_start = (pos[k]/chans) * chans;
  1155. } else {
  1156. k = 0;
  1157. pack_start = 0;
  1158. }
  1159. endspan = max(pack_start + truespan,true_endspan);
  1160. if(endspan > dz->buflen) {
  1161. fprintf(stdout,"WARNING: Failed to find long-enough segment for time %d\n",fileno + 1);
  1162. fflush(stdout);
  1163. OK = 0;
  1164. break;
  1165. }
  1166. m = k; // Fine first minimum after true-span
  1167. while(m < local_minima_cnt) {
  1168. if(pos[m] >= endspan) {
  1169. pack_end = (pos[m]/chans) * chans;
  1170. OK = 1;
  1171. gotit = 1;
  1172. break;
  1173. }
  1174. m++;
  1175. }
  1176. if(!gotit) {
  1177. fprintf(stdout,"WARNING: Failed to find segment for time %d\n",fileno + 1);
  1178. fflush(stdout);
  1179. OK = 0;
  1180. }
  1181. break; // Break, whether or not we found a valid cut
  1182. }
  1183. }
  1184. if(!OK) // If no valid cut here, move to next designated time
  1185. continue;
  1186. } else {
  1187. pack_centre = packet_at[fileno];
  1188. span = (int)ceil((dz->param[PAK_DUR] * MS_TO_SECS) * (double)srate) * chans;
  1189. halfspan = (int)ceil((dz->param[PAK_DUR] * MS_TO_SECS/2.0) * (double)srate) * chans;
  1190. pack_start = pack_centre - halfspan;
  1191. pack_end = pack_centre + halfspan;
  1192. if(pack_start <= 0) {
  1193. pack_start = 0;
  1194. pack_end = pack_start + span;
  1195. if(pack_end > dz->buflen) {
  1196. sprintf(errstr,"Error in buffer size estimation\n");
  1197. return(PROGRAM_ERROR);
  1198. }
  1199. } else {
  1200. sndseekEx(dz->ifd[0],pack_start,0);
  1201. pack_end -= pack_start;
  1202. pack_start = 0;
  1203. }
  1204. if((exit_status = read_samps(ibuf,dz))<0)
  1205. return(exit_status);
  1206. }
  1207. if(fileno > 0) {
  1208. if(sndcloseEx(dz->ofd) < 0) {
  1209. sprintf(errstr,"Failed to close output file %d\n",fileno+1);
  1210. return(SYSTEM_ERROR);
  1211. }
  1212. dz->ofd = -1;
  1213. }
  1214. strcpy(filename,dz->outfilename);
  1215. sprintf(thisnum,"%d",fileno);
  1216. strcat(filename,thisnum);
  1217. strcat(filename,".wav");
  1218. if((exit_status = create_sized_outfile(filename,dz))<0)
  1219. return(exit_status);
  1220. sndseekEx(dz->ifd[0],0,0);
  1221. reset_filedata_counters(dz);
  1222. // pack_gpstart = pack_start/chans;
  1223. for(n = pack_start, outcnt = 0;n < pack_end; n++, outcnt++)
  1224. obuf[outcnt] = ibuf[n]; // Copy basic packet to outbuf
  1225. outgpcnt = outcnt/chans;
  1226. tabincr = (double)tabsize/(double)(outgpcnt - 1); // Force last read to be at end of envelope table
  1227. tabpos = 0;
  1228. for(n = 0; n < outcnt; n+=chans) { // Impose envelope on packet
  1229. tablopos = (int)floor(tabpos);
  1230. tabhipos = min(tablopos + 1,TREMOLO_TABSIZE);
  1231. tabrem = tabpos - (double)tablopos;
  1232. diff = costab[tabhipos] - costab[tablopos];
  1233. env = costab[tablopos] + (diff * tabrem);
  1234. for(j=0;j<chans;j++)
  1235. obuf[n+j] = (float)(obuf[n+j] * env);
  1236. tabpos += tabincr;
  1237. }
  1238. if(dz->vflag[1]) { // if "forced"
  1239. negwritten = 0; // Force levels to follow packet envelope countour
  1240. poswritten = 0;
  1241. ispos = 0;
  1242. for(j = 0; j < chans; j++) { // for each channel in turn.
  1243. for(n = 0; n < outgpcnt; n++) { // Search the packet
  1244. nn = (n * chans) + j; // Start in specific channel
  1245. switch(ispos) {
  1246. case(0): // Does it go +ve or -ve initially?
  1247. if(obuf[nn] > 0) {
  1248. upstart = nn;
  1249. ispos = 1;
  1250. maxval = obuf[nn];
  1251. maxat = n;
  1252. } else if(obuf[nn] < 0) {
  1253. dnstart = nn;
  1254. ispos = -1;
  1255. minval = obuf[nn];
  1256. minat = n; // NB index to groupcnt, not sample-cnt
  1257. }
  1258. break;
  1259. case(1): // +ve vals
  1260. if(obuf[nn] > 0) { // While > 0, Keep looking for maximum
  1261. maxval = max(maxval,obuf[nn]);
  1262. maxat = n;
  1263. } else { // Once goes -ve
  1264. if(nn - upstart >= PAK_MINSEG * chans) {
  1265. tabpos = maxat * tabincr; // Find corresponding (group-)position in envelope
  1266. tablopos = (int)floor(tabpos);
  1267. tabhipos = min(tablopos + 1,TREMOLO_TABSIZE);
  1268. tabrem = tabpos - (double)tablopos;
  1269. diff = costab[tabhipos] - costab[tablopos];
  1270. env = costab[tablopos] + (diff * tabrem);
  1271. adjust = env/maxval; // Find ratio of envelope to max sample pf +ve excursion
  1272. for(m = upstart; m < nn; m+= chans) // Adjust the +ve excursion to level of envelope
  1273. obuf[m] = (float)(obuf[m] * adjust);
  1274. }
  1275. poswritten = 1; // Note that adjustment made (or ignored)
  1276. negwritten = 0;
  1277. ispos = -1; // Mark start of -ve excursion
  1278. minval = obuf[nn];
  1279. minat = n;
  1280. dnstart = nn;
  1281. }
  1282. break;
  1283. case(-1): // -ve vals
  1284. if(obuf[nn] <= 0) {
  1285. minval = min(minval,obuf[nn]);
  1286. minat = nn;
  1287. } else {
  1288. if(nn - upstart >= PAK_MINSEG * chans) {
  1289. tabpos = minat * tabincr;
  1290. tablopos = (int)floor(tabpos);
  1291. tabhipos = min(tablopos + 1,TREMOLO_TABSIZE);
  1292. tabrem = tabpos - (double)tablopos;
  1293. diff = costab[tabhipos] - costab[tablopos];
  1294. env = costab[tablopos] + (diff * tabrem);
  1295. adjust = fabs(env/minval); // Find ratio of envelope to fabs(maxsample) of -ve excursion
  1296. for(m = dnstart; m < nn; m+= chans)
  1297. obuf[m] = (float)(obuf[m] * adjust);
  1298. }
  1299. negwritten = 1;
  1300. poswritten = 0;
  1301. ispos = 1;
  1302. maxval = obuf[nn];
  1303. maxat = n;
  1304. upstart = nn;
  1305. }
  1306. break;
  1307. }
  1308. }
  1309. if(ispos && !poswritten) { // Finish off final excursion
  1310. if(nn < 0 || upstart < 0 || maxval < 0.0 || maxat < 0) {
  1311. fprintf(stderr,"Error in accounting 1\n");
  1312. return(PROGRAM_ERROR);
  1313. }
  1314. tabpos = maxat * tabincr;
  1315. tablopos = (int)floor(tabpos);
  1316. tabhipos = min(tablopos + 1,TREMOLO_TABSIZE);
  1317. tabrem = tabpos - (double)tablopos;
  1318. diff = costab[tabhipos] - costab[tablopos];
  1319. env = costab[tablopos] + (diff * tabrem);
  1320. adjust = env/maxval;
  1321. for(m = upstart; m < nn; m+= chans)
  1322. obuf[m] = (float)(obuf[m] * adjust);
  1323. } else if(!ispos && !negwritten) {
  1324. if(nn < 0 || dnstart < 0 || minval > 0.0 || minat < 0) {
  1325. fprintf(stderr,"Error in accounting 2\n");
  1326. return(PROGRAM_ERROR);
  1327. }
  1328. tabpos = minat * tabincr;
  1329. tablopos = (int)floor(tabpos);
  1330. tabhipos = min(tablopos + 1,TREMOLO_TABSIZE);
  1331. tabrem = tabpos - (double)tablopos;
  1332. diff = costab[tabhipos] - costab[tablopos];
  1333. env = costab[tablopos] + (diff * tabrem);
  1334. adjust = fabs(env/maxval);
  1335. for(m = dnstart; m < nn; m+= chans)
  1336. obuf[m] = (float)(obuf[m] * adjust);
  1337. }
  1338. }
  1339. for(n = 0; n < outcnt; n++)
  1340. obuf[n] = (float)(obuf[n] * PAK_NORM);
  1341. } else if(dz->vflag[0]) {
  1342. maxsamp = 0.0;
  1343. for(n = 0; n < outcnt; n++)
  1344. maxsamp = max(fabs(obuf[n]),maxsamp);
  1345. if(maxsamp < PAK_NORM) {
  1346. normaliser = PAK_NORM/maxsamp;
  1347. for(n = 0; n < outcnt; n++)
  1348. obuf[n] = (float)(obuf[n] * normaliser);
  1349. }
  1350. }
  1351. if(dz->vflag[2])
  1352. shave(obuf,&outcnt);
  1353. if((exit_status = write_samps(obuf,outcnt,dz))<0)
  1354. return(exit_status);
  1355. }
  1356. return FINISHED;
  1357. }
  1358. /****************************** GET_MODE *********************************/
  1359. int get_the_mode_from_cmdline(char *str,dataptr dz)
  1360. {
  1361. char temp[200], *p;
  1362. if(sscanf(str,"%s",temp)!=1) {
  1363. sprintf(errstr,"Cannot read mode of program.\n");
  1364. return(USAGE_ONLY);
  1365. }
  1366. p = temp + strlen(temp) - 1;
  1367. while(p >= temp) {
  1368. if(!isdigit(*p)) {
  1369. fprintf(stderr,"Invalid mode of program entered.\n");
  1370. return(USAGE_ONLY);
  1371. }
  1372. p--;
  1373. }
  1374. if(sscanf(str,"%d",&dz->mode)!=1) {
  1375. fprintf(stderr,"Cannot read mode of program.\n");
  1376. return(USAGE_ONLY);
  1377. }
  1378. if(dz->mode <= 0 || dz->mode > dz->maxmode) {
  1379. fprintf(stderr,"Program mode value [%d] is out of range [1 - %d].\n",dz->mode,dz->maxmode);
  1380. return(USAGE_ONLY);
  1381. }
  1382. dz->mode--; /* CHANGE TO INTERNAL REPRESENTATION OF MODE NO */
  1383. return(FINISHED);
  1384. }
  1385. /**************************** HANDLE_THE_SPECIAL_DATA ****************************/
  1386. int handle_the_special_data(char *str,dataptr dz)
  1387. {
  1388. double dummy = 0.0;
  1389. int *q;
  1390. FILE *fp;
  1391. int cnt, isfile = 0;
  1392. char temp[200], *p;
  1393. if(!sloom) {
  1394. if(!value_is_numeric(str) && file_has_invalid_startchar(str)) {
  1395. sprintf(errstr,"Cannot read time value [%s]\n",str);
  1396. return(USER_ERROR);
  1397. }
  1398. if(value_is_numeric(str)) {
  1399. if(sscanf(str,"%lf",&dummy)<1) {
  1400. sprintf(errstr,"Cannot read times parameters '%s'\n",str);
  1401. return(USER_ERROR);
  1402. }
  1403. } else {
  1404. isfile = 1;
  1405. }
  1406. } else { /* TK convention, all numeric values are preceded by NUMERICVAL_MARKER */
  1407. if(str[0]==NUMERICVAL_MARKER) {
  1408. str++;
  1409. if(strlen(str)<=0 || sscanf(str,"%lf",&dummy)!=1) {
  1410. sprintf(errstr,"Invalid time value (%s) encountered.\n",str);
  1411. return(USER_ERROR);
  1412. }
  1413. } else {
  1414. isfile = 1;
  1415. }
  1416. }
  1417. if(isfile) {
  1418. if((fp = fopen(str,"r"))==NULL) {
  1419. sprintf(errstr,"Cannot open file %s to read times.\n",str);
  1420. return(DATA_ERROR);
  1421. }
  1422. cnt = 0;
  1423. while(fgets(temp,200,fp)!=NULL) {
  1424. p = temp;
  1425. if(*p == ';') // Allow comments in file
  1426. continue;
  1427. while(get_float_from_within_string(&p,&dummy)) {
  1428. if(dummy < 0.0) {
  1429. sprintf(errstr,"Time (%lf) less than zero in cuts file.\n",dummy);
  1430. return(DATA_ERROR);
  1431. } else if(dummy > dz->duration) {
  1432. sprintf(errstr,"Time (%lf) beyond end of file (%lf).\n",dummy,dz->duration);
  1433. return(DATA_ERROR);
  1434. }
  1435. cnt++;
  1436. }
  1437. }
  1438. if(cnt == 0) {
  1439. sprintf(errstr,"No valid times in file.\n");
  1440. return(DATA_ERROR);
  1441. }
  1442. dz->itemcnt = cnt;
  1443. dz->larray_cnt = 1;
  1444. if((dz->lparray[0] = (int *)malloc(dz->itemcnt * sizeof(int)))==NULL) {
  1445. sprintf(errstr,"INSUFFICIENT MEMORY to store packet times.\n");
  1446. return(MEMORY_ERROR);
  1447. }
  1448. fseek(fp,0,0);
  1449. cnt = 0;
  1450. q = dz->lparray[0];
  1451. while(fgets(temp,200,fp)!=NULL) {
  1452. p = temp;
  1453. if(*p == ';') // Allow comments in file
  1454. continue;
  1455. while(get_float_from_within_string(&p,&dummy)) {
  1456. *q = (int)round(dummy * (double)(dz->infile->srate)) * dz->infile->channels;
  1457. q++;
  1458. }
  1459. }
  1460. if(fclose(fp)<0) {
  1461. fprintf(stdout,"WARNING: Failed to close input textfile %s.\n",str);
  1462. fflush(stdout);
  1463. }
  1464. } else {
  1465. if(dummy < 0.0) {
  1466. sprintf(errstr,"Time (%lf) less than zero.\n",dummy);
  1467. return(DATA_ERROR);
  1468. } else if(dummy > dz->duration) {
  1469. sprintf(errstr,"Time (%lf) beyond end of file (%lf).\n",dummy,dz->duration);
  1470. return(DATA_ERROR);
  1471. }
  1472. if((dz->lparray[0] = (int *)malloc(sizeof(int)))==NULL) {
  1473. sprintf(errstr,"INSUFFICIENT MEMORY to store packet time.\n");
  1474. return(MEMORY_ERROR);
  1475. }
  1476. dz->lparray[0][0] = (int)round(dummy * (double)(dz->infile->srate)) * dz->infile->channels;
  1477. dz->itemcnt = 1;
  1478. }
  1479. return(FINISHED);
  1480. }
  1481. /****************************** FIND_ALL_POSITIVE_PEAKS ***********************************/
  1482. int find_all_positive_peaks(int startsearch,int endsearch,int *peakcnt,dataptr dz)
  1483. {
  1484. double *peak = dz->parray[1], thispeak;
  1485. int *pos = dz->lparray[1];
  1486. float *ibuf = dz->sampbuf[0];
  1487. int thissamp = startsearch, thispos;
  1488. while(ibuf[thissamp] <= 0) { /* skip values below zero */
  1489. if(++thissamp >= endsearch)
  1490. break;
  1491. }
  1492. if(thissamp >= endsearch) {
  1493. sprintf(errstr,"Cannot locate any peaks in the signal. Are the search times incorrect??\n");
  1494. return(DATA_ERROR);
  1495. }
  1496. thispeak = ibuf[thissamp];
  1497. thispos = thissamp;
  1498. thissamp++;
  1499. while(thissamp < endsearch) {
  1500. if(ibuf[thissamp] >= 0.0) {
  1501. if(ibuf[thissamp] > thispeak) { /* search for (positive) peak val */
  1502. thispeak = ibuf[thissamp];
  1503. thispos = thissamp;
  1504. }
  1505. } else {
  1506. peak[*peakcnt] = thispeak; /* once signal becomes -ve3, store last found peak */
  1507. pos[*peakcnt] = thispos;
  1508. (*peakcnt)++;
  1509. while(ibuf[thissamp] < 0) { /* then skip over -ve part of signal */
  1510. if(++thissamp >= endsearch)
  1511. break;
  1512. }
  1513. thispeak = ibuf[thissamp]; /* once dignal is +ve again, set up an initial value for peak */
  1514. thispos = thissamp;
  1515. }
  1516. thissamp++;
  1517. }
  1518. if(*peakcnt > 0) { /* check for peak found near end, before signal goes -ve once more */
  1519. if((thispos != pos[(*peakcnt)-1]) && (thispeak > 0.0)) {
  1520. peak[*peakcnt] = thispeak;
  1521. pos[*peakcnt] = thispos;
  1522. (*peakcnt)++;
  1523. }
  1524. }
  1525. if(*peakcnt < 3) {
  1526. sprintf(errstr,"Insufficient signal peaks found (need 3).??\n");
  1527. return(DATA_ERROR);
  1528. }
  1529. return(FINISHED);
  1530. }
  1531. /****************************** FIND_ALL_LOCAL_MINIMA ***********************************/
  1532. int find_all_local_minima(int peakcnt,int *local_minima_cnt,dataptr dz)
  1533. {
  1534. int thispeak;
  1535. double *peak = dz->parray[1];
  1536. int *pos = dz->lparray[1];
  1537. /* double peakmin = peak[0];*/
  1538. int finished = 0;
  1539. *local_minima_cnt = 0;
  1540. thispeak = 1;
  1541. while(thispeak < peakcnt) {
  1542. while(peak[thispeak] <= peak[thispeak-1]) { /* while peaks are falling, look for local peak minimum */
  1543. if(++thispeak >= peakcnt) {
  1544. finished = 1;
  1545. break;
  1546. }
  1547. }
  1548. if(finished)
  1549. break;
  1550. peak[*local_minima_cnt] = peak[thispeak-1]; /* store value and position of local mimimum */
  1551. pos[*local_minima_cnt] = pos[thispeak-1];
  1552. (*local_minima_cnt)++;
  1553. while(peak[thispeak] >= peak[thispeak-1]) { /* skip over rising sequence of peaks */
  1554. if(++thispeak >= peakcnt) {
  1555. break;
  1556. }
  1557. }
  1558. }
  1559. if(*local_minima_cnt < 2) {
  1560. sprintf(errstr,"Insufficient local minima found in inital search.\n");
  1561. return(DATA_ERROR);
  1562. }
  1563. return(FINISHED);
  1564. }
  1565. /****************************** LOCATE_ZERO_CROSSINGS ***********************************/
  1566. int locate_zero_crossings(int local_minima_cnt,dataptr dz)
  1567. {
  1568. int finished = 0;
  1569. int n;
  1570. float *ibuf = dz->sampbuf[0];
  1571. double *peak = dz->parray[1];
  1572. int *pos = dz->lparray[1];
  1573. for(n=0;n<local_minima_cnt;n++) {
  1574. while (peak[n] >= 0.0) { /* advance position from minimum +ve peak until value crosses zero */
  1575. if(++pos[n] >= dz->buflen) {
  1576. finished = 1;
  1577. break;
  1578. }
  1579. peak[n] = ibuf[pos[n]];
  1580. }
  1581. if(finished)
  1582. break;
  1583. }
  1584. return(FINISHED);
  1585. }
  1586. /*************************** CREATE_PACKET_SNDBUFS **************************/
  1587. int create_packet_sndbufs(dataptr dz)
  1588. {
  1589. int n;
  1590. int bigbufsize;
  1591. int framesize = F_SECSIZE * dz->infile->channels;
  1592. if(dz->sbufptr == 0 || dz->sampbuf==0) {
  1593. sprintf(errstr,"buffer pointers not allocated: create_packet_sndbufs()\n");
  1594. return(PROGRAM_ERROR);
  1595. }
  1596. dz->buflen = (int)ceil(dz->param[PAK_DUR] * (double)dz->infile->srate) * dz->infile->channels;
  1597. dz->buflen *= BUFEXPAND;
  1598. dz->buflen = (dz->buflen / framesize) * framesize;
  1599. dz->buflen += framesize;
  1600. bigbufsize = dz->buflen * sizeof(float);
  1601. if((dz->bigbuf = (float *)malloc(bigbufsize * dz->bufcnt)) == NULL) {
  1602. sprintf(errstr,"INSUFFICIENT MEMORY to create sound buffers.\n");
  1603. return(PROGRAM_ERROR);
  1604. }
  1605. for(n=0;n<dz->bufcnt;n++)
  1606. dz->sbufptr[n] = dz->sampbuf[n] = dz->bigbuf + (dz->buflen * n);
  1607. dz->sampbuf[n] = dz->bigbuf + (dz->buflen * n);
  1608. return(FINISHED);
  1609. }
  1610. /*************************** SHAVE **************************/
  1611. void shave(float *obuf,int *outcnt)
  1612. {
  1613. int n = 0, m, k = *outcnt;
  1614. while(obuf[n] == 0.0) {
  1615. n++;
  1616. if(n >= *outcnt)
  1617. return;
  1618. }
  1619. if(n > 0) {
  1620. for(k = 0,m = n;m < *outcnt; m++,k++)
  1621. obuf[k] = obuf[m];
  1622. *outcnt = k;
  1623. }
  1624. k--;
  1625. while(obuf[k] == 0.0)
  1626. k--;
  1627. *outcnt = k + 1;
  1628. }