libcm is a C development framework with an emphasis on audio signal processing applications.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

cmProc2.c 157KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286
  1. #include "cmPrefix.h"
  2. #include "cmGlobal.h"
  3. #include "cmRpt.h"
  4. #include "cmErr.h"
  5. #include "cmCtx.h"
  6. #include "cmMem.h"
  7. #include "cmMallocDebug.h"
  8. #include "cmLinkedHeap.h"
  9. #include "cmSymTbl.h"
  10. #include "cmFloatTypes.h"
  11. #include "cmComplexTypes.h"
  12. #include "cmFile.h"
  13. #include "cmFileSys.h"
  14. #include "cmProcObj.h"
  15. #include "cmProcTemplate.h"
  16. #include "cmAudioFile.h"
  17. #include "cmMath.h"
  18. #include "cmProc.h"
  19. #include "cmVectOps.h"
  20. #include "cmKeyboard.h"
  21. #include "cmGnuPlot.h"
  22. #include "cmTime.h"
  23. #include "cmMidi.h"
  24. #include "cmProc2.h"
  25. //------------------------------------------------------------------------------------------------------------
  26. cmArray* cmArrayAllocate( cmCtx* c, cmArray* ap, unsigned eleCnt, unsigned eleByteCnt, unsigned flags )
  27. {
  28. cmArray* p = cmObjAlloc( cmArray, c, ap );
  29. if( eleCnt > 0 && eleByteCnt > 0 )
  30. if( cmArrayInit(p, eleCnt, eleByteCnt, flags ) != cmOkRC )
  31. cmArrayFree(&p);
  32. return cmOkRC;
  33. }
  34. cmRC_t cmArrayFree( cmArray** pp )
  35. {
  36. cmRC_t rc = cmOkRC;
  37. cmArray* p = *pp;
  38. if( pp == NULL || *pp == NULL )
  39. return cmOkRC;
  40. if((rc = cmArrayFinal(p)) != cmOkRC )
  41. return rc;
  42. cmMemPtrFree(&p->ptr);
  43. cmObjFree(pp);
  44. return rc;
  45. }
  46. cmRC_t cmArrayInit( cmArray* p, unsigned eleCnt, unsigned eleByteCnt, unsigned flags )
  47. {
  48. cmRC_t rc = cmOkRC;
  49. if((rc = cmArrayFinal(p)) != cmOkRC )
  50. return rc;
  51. p->allocByteCnt = eleCnt * eleByteCnt;
  52. p->ptr = cmIsFlag(flags,kZeroArrayFl) ? cmMemResizeZ( char, p->ptr, p->allocByteCnt ) : cmMemResize( char, p->ptr, p->allocByteCnt );
  53. p->eleCnt = eleCnt;
  54. p->eleByteCnt = eleByteCnt;
  55. return rc;
  56. }
  57. cmRC_t cmArrayFinal( cmArray* p )
  58. { return cmOkRC; }
  59. char* cmArrayReallocDestroy(cmArray* p, unsigned newEleCnt, unsigned newEleByteCnt, unsigned flags )
  60. {
  61. // if memory is expanding
  62. if( newEleCnt * newEleByteCnt > p->allocByteCnt )
  63. cmArrayInit( p, newEleCnt, newEleByteCnt, flags );
  64. else
  65. {
  66. // ... otherwise memory is contrcmting
  67. p->eleCnt = newEleCnt;
  68. p->eleByteCnt = newEleByteCnt;
  69. if( cmIsFlag( flags, kZeroArrayFl ))
  70. memset(p->ptr,0,p->eleByteCnt);
  71. }
  72. return p->ptr;
  73. }
  74. void cmArrayReallocDestroyV(cmArray* p, int eleByteCnt,unsigned flags, ... )
  75. {
  76. unsigned i;
  77. unsigned eleCnt = 0;
  78. unsigned argCnt = 0;
  79. va_list vl0,vl1;
  80. assert(eleByteCnt>0);
  81. va_start(vl0,flags);
  82. va_copy(vl1,vl0);
  83. while( va_arg(vl0,void**) != NULL )
  84. {
  85. int argEleCnt = va_arg(vl0,int);
  86. assert(argEleCnt>0);
  87. eleCnt += argEleCnt;
  88. ++argCnt;
  89. }
  90. va_end(vl0);
  91. char* a = cmArrayReallocDestroy(p,eleCnt,eleByteCnt,flags);
  92. for(i=0; i<argCnt; ++i)
  93. {
  94. void** vp = va_arg(vl1,void**);
  95. unsigned n = va_arg(vl1,unsigned);
  96. *vp = a;
  97. a += n*eleByteCnt;
  98. }
  99. va_end(vl1);
  100. }
  101. char* cmArrayReallocPreserve(cmArray* p, unsigned newEleCnt, unsigned newEleByteCnt, unsigned flags )
  102. {
  103. unsigned cn = p->eleCnt * p->eleByteCnt;
  104. unsigned dn = newEleCnt * newEleByteCnt;
  105. if( dn > p->allocByteCnt )
  106. p->allocByteCnt = dn;
  107. p->ptr = cmIsFlag(flags,kZeroArrayFl ) ? cmMemResizePZ( char, p->ptr, cn ) : cmMemResizeP( char, p->ptr, cn);
  108. p->eleCnt = newEleCnt;
  109. p->eleByteCnt= newEleByteCnt;
  110. return p->ptr;
  111. }
  112. //------------------------------------------------------------------------------------------------------------
  113. cmAudioFileWr* cmAudioFileWrAlloc( cmCtx* c, cmAudioFileWr* ap, unsigned procSmpCnt, const char* fn, double srate, unsigned chCnt, unsigned bitsPerSample )
  114. {
  115. cmAudioFileWr* p = cmObjAlloc( cmAudioFileWr, c, ap );
  116. if( cmAudioFileWrInit( p, procSmpCnt, fn, srate, chCnt, bitsPerSample ) != cmOkRC )
  117. cmObjFree(&p);
  118. return p;
  119. }
  120. cmRC_t cmAudioFileWrFree( cmAudioFileWr** pp )
  121. {
  122. cmRC_t rc = cmOkRC;
  123. if( pp != NULL && *pp != NULL )
  124. {
  125. cmAudioFileWr* p = *pp;
  126. if((rc = cmAudioFileWrFinal(p)) == cmOkRC )
  127. {
  128. cmMemPtrFree(&p->bufV);
  129. cmMemPtrFree(&p->fn );
  130. cmObjFree(pp);
  131. }
  132. }
  133. return rc;
  134. }
  135. cmRC_t cmAudioFileWrInit( cmAudioFileWr* p, unsigned procSmpCnt, const char* fn, double srate, unsigned chCnt, unsigned bitsPerSample )
  136. {
  137. cmRC_t rc;
  138. cmRC_t afRC;
  139. if((rc = cmAudioFileWrFinal( p)) != cmOkRC )
  140. return rc;
  141. p->h = cmAudioFileNewCreate( fn, srate, bitsPerSample, chCnt, &afRC, p->obj.err.rpt );
  142. if( afRC != kOkAfRC )
  143. return cmCtxRtCondition( &p->obj, afRC, "Unable to open the audio file:'%s'", fn );
  144. p->bufV = cmMemResize( cmSample_t, p->bufV, procSmpCnt * chCnt );
  145. p->procSmpCnt = procSmpCnt;
  146. p->chCnt = chCnt;
  147. p->curChCnt = 0;
  148. p->fn = cmMemResizeZ( cmChar_t, p->fn, strlen(fn)+1 );
  149. strcpy(p->fn,fn);
  150. return rc;
  151. }
  152. cmRC_t cmAudioFileWrFinal( cmAudioFileWr* p )
  153. {
  154. cmRC_t afRC;
  155. if( p != NULL )
  156. {
  157. if( cmAudioFileIsValid( p->h ) )
  158. if(( afRC = cmAudioFileDelete( &p->h )) != kOkAfRC )
  159. return cmCtxRtCondition( &p->obj, afRC, "Unable to close the audio file:'%s'", p->fn );
  160. }
  161. return cmOkRC;
  162. }
  163. cmRC_t cmAudioFileWrExec( cmAudioFileWr* p, unsigned chIdx, const cmSample_t* sp, unsigned sn )
  164. {
  165. cmRC_t afRC;
  166. assert( sn <= p->procSmpCnt && chIdx < p->chCnt );
  167. cmSample_t* buf = p->bufV + (chIdx * p->procSmpCnt);
  168. cmVOS_Copy( buf, sn, sp);
  169. if( sn < p->procSmpCnt )
  170. cmVOS_Fill( buf+sn, p->procSmpCnt-sn, 0 );
  171. p->curChCnt++;
  172. if( p->curChCnt == p->chCnt )
  173. {
  174. p->curChCnt = 0;
  175. cmSample_t* bufPtrPtr[ p->chCnt ];
  176. unsigned i = 0;
  177. for(i=0; i<p->chCnt; ++i)
  178. bufPtrPtr[i] = p->bufV + (i*p->procSmpCnt);
  179. if((afRC = cmAudioFileWriteSample( p->h, p->procSmpCnt, p->chCnt, bufPtrPtr )) != kOkAfRC )
  180. return cmCtxRtCondition( &p->obj, afRC, "Write failed on audio file:'%s'", p->fn );
  181. }
  182. return cmOkRC;
  183. }
  184. void cmAudioFileWrTest( cmRpt_t* rpt, cmLHeapH_t lhH, cmSymTblH_t stH )
  185. {
  186. const char* fn = "/home/kevin/src/cm/test0.aif";
  187. double durSecs = 10;
  188. double srate = 44100;
  189. unsigned chCnt = 2;
  190. unsigned bitsPerSmp = 16;
  191. unsigned procSmpCnt = 64;
  192. double hz = 1000;
  193. unsigned overToneCnt= 1;
  194. unsigned smpCnt = durSecs * srate;
  195. unsigned i;
  196. cmCtx* c = cmCtxAlloc( NULL, rpt, lhH, stH );
  197. cmSigGen* sgp = cmSigGenAlloc( c, NULL, procSmpCnt, srate, kWhiteWfId, hz, overToneCnt );
  198. cmAudioFileWr* awp = cmAudioFileWrAlloc( c, NULL, procSmpCnt, fn, srate, chCnt, bitsPerSmp );
  199. for(i=0; i<smpCnt; ++i)
  200. {
  201. cmSigGenExec( sgp );
  202. cmAudioFileWrExec( awp, 0, sgp->outV, sgp->outN );
  203. cmAudioFileWrExec( awp, 1, sgp->outV, sgp->outN );
  204. i += sgp->outN;
  205. }
  206. printf("Frames:%i\n",smpCnt);
  207. cmAudioFileWrFree(&awp);
  208. cmSigGenFree( &sgp );
  209. cmCtxFree(&c);
  210. cmAudioFileReportFn( fn, 0, 20, rpt );
  211. }
  212. //------------------------------------------------------------------------------------------------------------
  213. cmMatrixBuf* cmMatrixBufAllocFile( cmCtx* c, cmMatrixBuf* p, const char* fn )
  214. {
  215. cmRC_t rc;
  216. cmMatrixBuf* op = cmObjAlloc( cmMatrixBuf, c, p );
  217. if( fn != NULL )
  218. if((rc = cmMatrixBufInitFile(op,fn)) != cmOkRC )
  219. cmObjFree(&op);
  220. return op;
  221. }
  222. cmMatrixBuf* cmMatrixBufAllocCopy(cmCtx* c, cmMatrixBuf* p, unsigned rn, unsigned cn, const cmSample_t* sp )
  223. {
  224. cmRC_t rc;
  225. cmMatrixBuf* op = cmObjAlloc( cmMatrixBuf, c, p );
  226. if( sp != NULL && rn > 0 && cn > 0 )
  227. if((rc = cmMatrixBufInitCopy(op,rn,cn,sp)) != cmOkRC )
  228. cmObjFree(&op);
  229. return op;
  230. }
  231. cmMatrixBuf* cmMatrixBufAlloc( cmCtx* c, cmMatrixBuf* p, unsigned rn, unsigned cn )
  232. {
  233. cmRC_t rc;
  234. cmMatrixBuf* op = cmObjAlloc( cmMatrixBuf, c, p );
  235. if( rn > 0 && cn > 0 )
  236. if((rc = cmMatrixBufInit(op,rn,cn)) != cmOkRC )
  237. cmObjFree(&op);
  238. return op;
  239. }
  240. cmRC_t cmMatrixBufFree( cmMatrixBuf** pp )
  241. {
  242. cmRC_t rc = cmOkRC;
  243. if( pp != NULL && *pp != NULL )
  244. {
  245. cmMatrixBuf* p = *pp;
  246. if((rc = cmMatrixBufFinal(p)) == cmOkRC )
  247. {
  248. cmMemPtrFree(&p->bufPtr);
  249. cmObjFree(pp);
  250. }
  251. }
  252. return rc;
  253. }
  254. void _cmMatrixBufGetFileSize( FILE* fp, unsigned* lineCharCntPtr, unsigned* lineCntPtr )
  255. {
  256. *lineCharCntPtr = 0;
  257. *lineCntPtr = 0;
  258. while( !feof(fp) )
  259. {
  260. char ch;
  261. unsigned charCnt = 0;
  262. while( (ch = getc(fp)) != EOF )
  263. {
  264. charCnt++;
  265. if( ch == '\n' )
  266. break;
  267. }
  268. *lineCntPtr += 1;
  269. if(charCnt > *lineCharCntPtr )
  270. *lineCharCntPtr = charCnt;
  271. }
  272. *lineCharCntPtr += 5; // add a safety margin
  273. }
  274. cmRC_t _cmMatrixBufGetMatrixSize( cmObj* op, FILE* fp, unsigned lineCharCnt, unsigned lineCnt, unsigned* rowCntPtr, unsigned * colCntPtr, const char* fn )
  275. {
  276. unsigned i;
  277. char lineBuf[ lineCharCnt + 1 ];
  278. *rowCntPtr = 0;
  279. *colCntPtr = 0;
  280. for(i=0; i<lineCnt; ++i)
  281. {
  282. if(fgets(lineBuf,lineCharCnt,fp)==NULL)
  283. {
  284. // if the last line is blank then return from here
  285. if( feof(fp) )
  286. return cmOkRC;
  287. return cmCtxRtCondition( op, cmSystemErrorRC, "A read error occured on the matrix file:'%s'.",fn);
  288. }
  289. assert( strlen(lineBuf) < lineCharCnt );
  290. char* lp = lineBuf;
  291. char* tp;
  292. // eat any leading white space
  293. while( (*lp) && isspace(*lp) )
  294. ++lp;
  295. // if the line was blank then skip it
  296. if( strlen(lp) == 0 || *lp == '#' )
  297. continue;
  298. (*rowCntPtr) += 1;
  299. unsigned colCnt;
  300. for(colCnt=0; (tp = strtok(lp," ")) != NULL; ++colCnt )
  301. lp = NULL;
  302. if( colCnt > *colCntPtr )
  303. *colCntPtr = colCnt;
  304. }
  305. return cmOkRC;
  306. }
  307. double _cmMatrixBufStrToNum( cmObj* op, const char* cp )
  308. {
  309. double v;
  310. if( sscanf(cp,"%le ",&v) != 1 )
  311. cmCtxRtCondition( op, cmArgAssertRC, "Parse error reading matrix file.");
  312. return v;
  313. }
  314. cmRC_t _cmMatrixBufReadFile(cmObj* op, FILE* fp, cmSample_t* p, unsigned lineCharCnt, unsigned rn, unsigned cn)
  315. {
  316. char lineBuf[ lineCharCnt+1 ];
  317. unsigned ci = 0;
  318. unsigned ri = 0;
  319. while( fgets(lineBuf,lineCharCnt,fp) != NULL )
  320. {
  321. char* lp = lineBuf;
  322. char* tp;
  323. while( (*lp) && isspace(*lp) )
  324. lp++;
  325. if( strlen(lp) == 0 || *lp == '#' )
  326. continue;
  327. for(ci=0; (tp = strtok(lp," ")) != NULL; ++ci )
  328. {
  329. p[ (ci*rn) + ri ] = _cmMatrixBufStrToNum(op,tp); //atof(tp);
  330. lp = NULL;
  331. }
  332. ++ri;
  333. }
  334. return cmOkRC;
  335. }
  336. cmRC_t cmMatrixBufInitFile( cmMatrixBuf* p, const char* fn )
  337. {
  338. cmRC_t rc;
  339. FILE* fp;
  340. unsigned lineCharCnt;
  341. unsigned lineCnt;
  342. unsigned rn;
  343. unsigned cn;
  344. if((fp = fopen(fn,"rt")) == NULL )
  345. return cmCtxRtCondition( &p->obj, cmSystemErrorRC, "Unable to open the matrix file:'%s'", fn );
  346. // get the length of the longest line in the file
  347. _cmMatrixBufGetFileSize(fp,&lineCharCnt,&lineCnt);
  348. rewind(fp);
  349. // get the count of matrix rows and columns
  350. if((rc=_cmMatrixBufGetMatrixSize( &p->obj, fp, lineCharCnt, lineCnt, &rn, &cn, fn )) != cmOkRC )
  351. goto errLabel;
  352. rewind(fp);
  353. // allocate the matrix memory
  354. cmMatrixBufInit(p,rn,cn);
  355. // fill the matrix from the file
  356. rc = _cmMatrixBufReadFile(&p->obj,fp,p->bufPtr,lineCharCnt,rn,cn);
  357. errLabel:
  358. if( rc != cmOkRC )
  359. cmMatrixBufFinal(p);
  360. fclose(fp);
  361. return rc;
  362. }
  363. cmRC_t cmMatrixBufInitCopy( cmMatrixBuf* p, unsigned rn, unsigned cn, const cmSample_t* sp )
  364. {
  365. cmRC_t rc;
  366. if((rc = cmMatrixBufInit(p,rn,cn)) != cmOkRC )
  367. return rc;
  368. cmVOS_Copy(p->bufPtr,(rn*cn),sp);
  369. return rc;
  370. }
  371. cmRC_t cmMatrixBufInit( cmMatrixBuf* p, unsigned rn, unsigned cn )
  372. {
  373. cmRC_t rc;
  374. if((rc = cmMatrixBufFinal(p)) != cmOkRC )
  375. return rc;
  376. p->rn = rn;
  377. p->cn = cn;
  378. p->bufPtr = cmMemResize( cmSample_t, p->bufPtr, rn*cn );
  379. return cmOkRC;
  380. }
  381. cmRC_t cmMatrixBufFinal( cmMatrixBuf* p )
  382. { return cmOkRC; }
  383. cmSample_t* cmMatrixBufColPtr( cmMatrixBuf* p, unsigned ci )
  384. { assert(ci<p->cn); return p->bufPtr + (ci * p->rn); }
  385. cmSample_t* cmMatrixBufRowPtr( cmMatrixBuf* p, unsigned ri )
  386. { assert(ri<p->rn); return p->bufPtr + ri; }
  387. void cmMatrixBufTest( cmRpt_t* rpt, cmLHeapH_t lhH, cmSymTblH_t stH )
  388. {
  389. cmSample_t v[] = {1,2,2,3};
  390. cmCtx* c = cmCtxAlloc(NULL,rpt,lhH,stH);
  391. cmMatrixBuf* mbp = cmMatrixBufAllocFile(c, NULL, "temp.mat" );
  392. cmMatrixBuf* vbp = cmMatrixBufAllocCopy(c, NULL, 4,1,v);
  393. unsigned i;
  394. printf("rn:%i cn:%i\n",mbp->rn,mbp->cn);
  395. //cmVOS_Print( stdout, 10, 10, mbp->bufPtr );
  396. printf("%.1f\n ",cmVOS_Median( cmMatrixBufColPtr(vbp,0),vbp->rn));
  397. for(i=0; i<mbp->cn; ++i)
  398. {
  399. //cmVOS_Print( stdout, 1, mbp->cn, cmMatrixBufColPtr(c,mbp,i) );
  400. printf("%.1f, ",cmVOS_Median( cmMatrixBufColPtr(mbp,i),mbp->rn));
  401. }
  402. printf("\n");
  403. cmMatrixBufFree(&mbp);
  404. cmMatrixBufFree(&vbp);
  405. cmCtxFree(&c);
  406. }
  407. //------------------------------------------------------------------------------------------------------------
  408. cmSigGen* cmSigGenAlloc( cmCtx* c, cmSigGen* p, unsigned procSmpCnt, double srate, unsigned wfId, double fundFrqHz, unsigned overToneCnt )
  409. {
  410. cmSigGen* op = cmObjAlloc( cmSigGen, c, p );
  411. if( procSmpCnt > 0 && srate > 0 && wfId != kInvalidWfId )
  412. if( cmSigGenInit( op, procSmpCnt, srate, wfId, fundFrqHz, overToneCnt ) != cmOkRC )
  413. cmObjFree(&op);
  414. return op;
  415. }
  416. cmRC_t cmSigGenFree( cmSigGen** pp )
  417. {
  418. cmRC_t rc = cmOkRC;
  419. if( pp != NULL && *pp != NULL )
  420. {
  421. cmSigGen* p = *pp;
  422. if((rc = cmSigGenFinal(p)) == cmOkRC )
  423. {
  424. cmMemPtrFree(&p->outV);
  425. cmObjFree(pp);
  426. }
  427. }
  428. return rc;
  429. }
  430. cmRC_t cmSigGenInit( cmSigGen* p, unsigned procSmpCnt, double srate, unsigned wfId, double fundFrqHz, unsigned overToneCnt )
  431. {
  432. assert( srate > 0 && procSmpCnt > 0 );
  433. p->outV = cmMemResize( cmSample_t, p->outV, procSmpCnt );
  434. p->outN = procSmpCnt;
  435. p->wfId = wfId;
  436. p->overToneCnt = overToneCnt;
  437. p->fundFrqHz = fundFrqHz;
  438. p->phase = 0;
  439. p->delaySmp = 0;
  440. p->srate = srate;
  441. return cmOkRC;
  442. }
  443. cmRC_t cmSigGenFinal( cmSigGen* p )
  444. { return cmOkRC; }
  445. cmRC_t cmSigGenExec( cmSigGen* p )
  446. {
  447. switch( p->wfId )
  448. {
  449. case kSineWfId: p->phase = cmVOS_SynthSine( p->outV, p->outN, p->phase, p->srate, p->fundFrqHz ); break;
  450. case kCosWfId: p->phase = cmVOS_SynthCosine( p->outV, p->outN, p->phase, p->srate, p->fundFrqHz ); break;
  451. case kSquareWfId: p->phase = cmVOS_SynthSquare( p->outV, p->outN, p->phase, p->srate, p->fundFrqHz, p->overToneCnt ); break;
  452. case kTriangleWfId: p->phase = cmVOS_SynthTriangle( p->outV, p->outN, p->phase, p->srate, p->fundFrqHz, p->overToneCnt ); break;
  453. case kSawtoothWfId: p->phase = cmVOS_SynthSawtooth( p->outV, p->outN, p->phase, p->srate, p->fundFrqHz, p->overToneCnt ); break;
  454. case kWhiteWfId: cmVOS_Random( p->outV, p->outN, -1.0, 1.0 ); break;
  455. case kPinkWfId: p->delaySmp = cmVOS_SynthPinkNoise(p->outV, p->outN, p->delaySmp ); break;
  456. case kPulseWfId: p->phase = cmVOS_SynthPulseCos( p->outV, p->outN, p->phase, p->srate, p->fundFrqHz, p->overToneCnt ); break;
  457. case kImpulseWfId: p->phase = cmVOS_SynthImpulse( p->outV, p->outN, p->phase, p->srate, p->fundFrqHz ); break;
  458. case kSilenceWfId: cmVOS_Fill( p->outV, p->outN, 0 ); break;
  459. case kPhasorWfId: p->phase = cmVOS_SynthPhasor( p->outV, p->outN, p->phase, p->srate, p->fundFrqHz ); break;
  460. case kSeqWfId: p->phase = cmVOS_Seq( p->outV, p->outN, p->phase, 1 ); break;
  461. case kInvalidWfId:
  462. default:
  463. return cmCtxRtAssertFailed( &p->obj, 0, "Invalid waveform shape.");
  464. }
  465. return cmOkRC;
  466. }
  467. //------------------------------------------------------------------------------------------------------------
  468. cmDelay* cmDelayAlloc( cmCtx* c, cmDelay* ap, unsigned procSmpCnt, unsigned delaySmpCnt )
  469. {
  470. cmDelay* p = cmObjAlloc( cmDelay, c, ap );
  471. if( procSmpCnt > 0 && delaySmpCnt > 0 )
  472. if( cmDelayInit( p,procSmpCnt,delaySmpCnt) != cmOkRC && ap == NULL )
  473. cmObjFree(&p);
  474. return p;
  475. }
  476. cmRC_t cmDelayFree( cmDelay** pp )
  477. {
  478. cmRC_t rc = cmOkRC;
  479. if( pp != NULL && *pp != NULL )
  480. {
  481. cmDelay* p = *pp;
  482. if((rc = cmDelayFinal(*pp)) == cmOkRC )
  483. {
  484. cmMemPtrFree(&p->bufPtr);
  485. cmObjFree(pp);
  486. }
  487. }
  488. return rc;
  489. }
  490. cmRC_t cmDelayInit( cmDelay* p, unsigned procSmpCnt, unsigned delaySmpCnt )
  491. {
  492. p->procSmpCnt = procSmpCnt;
  493. p->delaySmpCnt = delaySmpCnt;
  494. p->bufSmpCnt = delaySmpCnt + procSmpCnt;
  495. p->bufPtr = cmMemResizeZ( cmSample_t, p->bufPtr, p->bufSmpCnt);
  496. p->delayInIdx = 0;
  497. p->outCnt = 1;
  498. p->outV[0] = p->bufPtr;
  499. p->outN[0] = p->procSmpCnt;
  500. p->outV[1] = NULL;
  501. p->outN[1] = 0;
  502. return cmOkRC;
  503. }
  504. cmRC_t cmDelayFinal( cmDelay* p )
  505. { return cmOkRC; }
  506. cmRC_t cmDelayCopyIn( cmDelay* p, const cmSample_t* sp, unsigned sn )
  507. {
  508. assert(sn<=p->procSmpCnt);
  509. unsigned n0 = cmMin(sn,p->bufSmpCnt - p->delayInIdx);
  510. // copy as many samples as possible from the input to the delayInIdx
  511. cmVOS_Copy(p->bufPtr + p->delayInIdx, n0, sp);
  512. p->delayInIdx = (p->delayInIdx + n0) % p->bufSmpCnt;
  513. // if there was not enough room to copy all the samples into the end of the buffer ....
  514. if( n0 < sn )
  515. {
  516. assert( p->delayInIdx == 0 );
  517. // ... then copy the rest to the beginning of the buffer
  518. unsigned n1 = sn - n0;
  519. cmVOS_Copy(p->bufPtr,n1, sp + n0 );
  520. p->delayInIdx = (p->delayInIdx + n1) % p->bufSmpCnt;
  521. }
  522. return cmOkRC;
  523. }
  524. cmRC_t cmDelayAdvance( cmDelay* p, unsigned sn )
  525. {
  526. // advance the output by sn and make sn samples available
  527. int delayOutIdx = ((p->outV[0] - p->bufPtr) + sn) % p->bufSmpCnt;
  528. p->outV[0] = p->bufPtr + delayOutIdx;
  529. p->outN[0] = cmMin(p->bufSmpCnt - delayOutIdx , sn );
  530. p->outCnt = p->outN[0] == sn ? 1 : 2 ;
  531. p->outV[1] = p->outCnt == 1 ? NULL : p->bufPtr;
  532. p->outN[1] = p->outCnt == 1 ? 0 : sn - p->outN[0];
  533. return cmOkRC;
  534. }
  535. cmRC_t cmDelayExec( cmDelay* p, const cmSample_t* sp, unsigned sn, bool bypassFl )
  536. {
  537. cmRC_t rc = cmOkRC;
  538. if( bypassFl )
  539. memcpy(p->outV,sp,sn*sizeof(cmSample_t));
  540. else
  541. {
  542. cmDelayCopyIn(p,sp,sn);
  543. rc = cmDelayAdvance(p,sn);
  544. }
  545. return rc;
  546. }
  547. void cmDelayTest( cmRpt_t* rpt, cmLHeapH_t lhH, cmSymTblH_t stH )
  548. {
  549. cmCtx ctx;
  550. cmDelay delay;
  551. cmSigGen sigGen;
  552. unsigned procCnt = 4;
  553. unsigned procSmpCnt = 5;
  554. unsigned delaySmpCnt = 3;
  555. unsigned i;
  556. cmCtx* c = cmCtxAlloc( &ctx, rpt, lhH, stH );
  557. cmDelay* dlp = cmDelayAlloc( c, &delay, procSmpCnt, delaySmpCnt );
  558. cmSigGen* sgp = cmSigGenAlloc( c, &sigGen, procSmpCnt, 0, kSeqWfId,0, 0);
  559. for(i=0; i<procCnt; ++i)
  560. {
  561. cmSigGenExec(sgp);
  562. cmDelayExec(dlp,sgp->outV,sgp->outN,false);
  563. //cmVOS_Print( c->outFp, 1, sgp->outN, sgp->outV, 5, 0 );
  564. cmCtxPrint(c,"%i %i : ",i,0);
  565. cmVOS_PrintE( rpt, 1, dlp->outN[0], dlp->outV[0] );
  566. if( dlp->outN[1] > 0 )
  567. {
  568. cmCtxPrint(c,"%i %i : ",i,1);
  569. cmVOS_PrintE( rpt, 1, dlp->outN[1], dlp->outV[1] );
  570. }
  571. }
  572. cmSigGenFinal(sgp);
  573. cmDelayFinal(dlp);
  574. cmCtxFinal(c);
  575. }
  576. //------------------------------------------------------------------------------------------------------------
  577. cmFIR* cmFIRAllocKaiser(cmCtx* c, cmFIR* p, unsigned procSmpCnt, double srate, double passHz, double stopHz, double passDb, double stopDb )
  578. {
  579. cmFIR* op = cmObjAlloc( cmFIR, c, p );
  580. if( procSmpCnt > 0 && srate > 0 )
  581. if( cmFIRInitKaiser(op,procSmpCnt,srate,passHz,stopHz,passDb,stopDb) != cmOkRC )
  582. cmObjFree(&op);
  583. return op;
  584. }
  585. cmFIR* cmFIRAllocSinc( cmCtx* c, cmFIR* p, unsigned procSmpCnt, double srate, unsigned sincSmpCnt, double fcHz, unsigned flags )
  586. {
  587. cmFIR* op = cmObjAlloc( cmFIR, c, p );
  588. if( srate > 0 && sincSmpCnt > 0 )
  589. if( cmFIRInitSinc(op,procSmpCnt,srate,sincSmpCnt,fcHz,flags) != cmOkRC )
  590. cmObjFree(&op);
  591. return op;
  592. }
  593. cmRC_t cmFIRFree( cmFIR** pp )
  594. {
  595. cmRC_t rc = cmOkRC;
  596. if( pp != NULL && *pp != NULL)
  597. {
  598. cmFIR* p = *pp;
  599. if((rc = cmFIRFinal(*pp)) != cmOkRC )
  600. {
  601. cmMemPtrFree(&p->coeffV);
  602. cmMemPtrFree(&p->outV);
  603. cmMemPtrFree(&p->delayV);
  604. cmObjFree(pp);
  605. }
  606. }
  607. return rc;
  608. }
  609. cmRC_t cmFIRInitKaiser( cmFIR* p, unsigned procSmpCnt, double srate, double passHz, double stopHz, double passDb, double stopDb )
  610. {
  611. // pass/stop frequencies above nyquist produce incorrect results
  612. assert( passHz <= srate/2 && stopHz<=srate/2);
  613. // based on Orfandis, Introduction to Signal Processing, p.551 Prentice Hall, 1996
  614. double fcHz = (passHz + stopHz) / 2; // fc is half way between passHz and stopHz
  615. double dHz = fabs(stopHz-passHz);
  616. //double signFcmt = stopHz > passHz ? 1 : -1;
  617. // convert ripple spec from db to linear
  618. double dPass = (pow(10,passDb/20)-1) / (pow(10,passDb/20)+1);
  619. double dStop = pow(10,-stopDb/20);
  620. // in prcmtice the ripple must be equal in the stop and pass band - so take the minimum between the two
  621. double d = cmMin(dPass,dStop);
  622. // convert the ripple bcmk to db
  623. double A = -20 * log10(d);
  624. // compute the kaiser alpha coeff
  625. double alpha = 0;
  626. if( A >= 50.0 ) // for ripple > 50
  627. alpha = 0.1102 * (A-8.7);
  628. else // for ripple <= 21
  629. {
  630. if( A > 21 )
  631. alpha = (0.5842 * (pow(A-21.0,0.4))) + (0.07886*(A-21));
  632. }
  633. double D = 0.922;
  634. if( A > 21 )
  635. D = (A - 7.95) / 14.36;
  636. // compute the filter order
  637. unsigned N = (unsigned)(floor(D * srate / dHz) + 1);
  638. //if N is even
  639. if( cmIsEvenU(N) )
  640. N = N + 1;
  641. //printf("fc=%f df=%f dPass=%f dStop=%f d=%f alpha=%f A=%f D=%f N=%i\n",fcHz,dHz,dPass,dStop,d,alpha,A,D,N);
  642. // form an ideal FIR LP impulse response based on a sinc function
  643. cmFIRInitSinc(p,procSmpCnt,srate,N,fcHz,0);
  644. // compute a kaiser function to truncate the sinc
  645. double wnd[ N ];
  646. cmVOD_Kaiser( wnd, N, alpha );
  647. // apply the kaiser window to the sinc function
  648. cmVOD_MultVV( p->coeffV, p->coeffCnt, wnd );
  649. double sum = cmVOD_Sum(p->coeffV,p->coeffCnt);
  650. cmVOD_DivVS(p->coeffV,p->coeffCnt,sum );
  651. //cmVOD_Print(stdout,1,p->coeffCnt,p->coeffV);
  652. return cmOkRC;
  653. }
  654. cmRC_t cmFIRInitSinc( cmFIR* p, unsigned procSmpCnt, double srate, unsigned sincSmpCnt, double fcHz, unsigned flags )
  655. {
  656. cmRC_t rc;
  657. if((rc = cmFIRFinal(p)) != cmOkRC )
  658. return rc;
  659. p->coeffCnt = sincSmpCnt;
  660. p->outV = cmMemResizeZ( cmSample_t, p->outV, procSmpCnt );
  661. p->outN = procSmpCnt;
  662. p->coeffV = cmMemResizeZ( double, p->coeffV, p->coeffCnt );
  663. p->delayV = cmMemResizeZ( double, p->delayV, p->coeffCnt-1 ); // there is always one less delay than coeff
  664. p->delayIdx = 0;
  665. cmVOD_LP_Sinc(p->coeffV, p->coeffCnt, srate, fcHz, cmIsFlag(flags,kHighPassFIRFl) ? kHighPass_LPSincFl : 0 );
  666. return cmOkRC;
  667. }
  668. cmRC_t cmFIRFinal( cmFIR* p )
  669. { return cmOkRC; }
  670. cmRC_t cmFIRExec( cmFIR* p, const cmSample_t* sbp, unsigned sn )
  671. {
  672. unsigned delayCnt = p->coeffCnt-1;
  673. int di = p->delayIdx;
  674. const cmSample_t* sep = sbp + sn;
  675. cmSample_t* op = p->outV;
  676. assert( di < delayCnt );
  677. assert( sn <= p->outN );
  678. // for each input sample
  679. while( sbp < sep )
  680. {
  681. // advance the delay line
  682. p->delayIdx = (p->delayIdx + 1) % delayCnt;
  683. const double* cbp = p->coeffV;
  684. const double* cep = cbp + p->coeffCnt;
  685. // mult input sample by coeff[0]
  686. double v = *sbp * *cbp++;
  687. // calc the output sample
  688. while( cbp<cep)
  689. {
  690. // note that the delay is being iterated bcmkwards
  691. if( di == -1 )
  692. di=delayCnt-1;
  693. v += *cbp++ * p->delayV[di];
  694. --di;
  695. }
  696. // store the output sample
  697. *op++ = v;
  698. // insert the input sample
  699. p->delayV[ p->delayIdx ] = *sbp++;
  700. // store the position of the newest ele in the delay line
  701. di = p->delayIdx;
  702. }
  703. return cmOkRC;
  704. }
  705. void cmFIRTest( cmRpt_t* rpt, cmLHeapH_t lhH, cmSymTblH_t stH )
  706. {
  707. unsigned N = 512;
  708. cmKbRecd kb;
  709. cmCtx c;
  710. cmCtxInit(&c,rpt,lhH,stH);
  711. double srate = N;
  712. unsigned procSmpCnt = N;
  713. cmPlotSetup("Test Proc Impl",2,1);
  714. cmSample_t in[ procSmpCnt ];
  715. cmVOS_Fill(in,procSmpCnt,0);
  716. in[0] = 1;
  717. cmVOS_Random(in,procSmpCnt, -1.0, 1.0 );
  718. cmFIR* ffp = cmFIRAllocKaiser( &c, NULL, procSmpCnt,srate, srate*0.025, srate/2, 10, 60 );
  719. //cmFIR* ffp = cmFIRAllocSinc( &c, NULL, 32, 1000, 0 );
  720. cmFftSR* ftp = cmFftAllocSR( &c, NULL, ffp->outV, ffp->outN, kToPolarFftFl );
  721. cmFIRExec( ffp, in, procSmpCnt );
  722. cmFftExecSR( ftp, NULL, 0 );
  723. cmVOR_AmplitudeToDb(ftp->magV,ftp->binCnt,ftp->magV);
  724. printf("coeff cnt:%i\n",ffp->coeffCnt );
  725. cmPlotClear();
  726. cmPlotLineR( "test", NULL, ftp->magV, NULL, ftp->binCnt, NULL, kSolidPlotLineId );
  727. cmPlotDraw();
  728. cmKeyPress(&kb);
  729. cmFftFreeSR(&ftp);
  730. cmFIRFree(&ffp);
  731. }
  732. //------------------------------------------------------------------------------------------------------------
  733. cmFuncFilter* cmFuncFilterAlloc( cmCtx* c, cmFuncFilter* p, unsigned procSmpCnt, cmFuncFiltPtr_t funcPtr, void* userPtr, unsigned wndSmpCnt )
  734. {
  735. cmRC_t rc;
  736. cmFuncFilter* op = cmObjAlloc( cmFuncFilter,c, p );
  737. if( procSmpCnt > 0 && funcPtr != NULL && wndSmpCnt > 0 )
  738. {
  739. if( cmShiftBufAlloc(c,&p->shiftBuf,0,0,0) != NULL )
  740. if((rc = cmFuncFilterInit(op,procSmpCnt,funcPtr,userPtr,wndSmpCnt)) != cmOkRC )
  741. {
  742. cmShiftBuf* sbp = &p->shiftBuf;
  743. cmShiftBufFree(&sbp);
  744. cmObjFree(&op);
  745. }
  746. }
  747. return op;
  748. }
  749. cmRC_t cmFuncFilterFree( cmFuncFilter** pp )
  750. {
  751. cmRC_t rc = cmOkRC;
  752. if( pp!=NULL && *pp != NULL )
  753. {
  754. cmFuncFilter* p = *pp;
  755. if((rc = cmFuncFilterFinal(*pp)) == cmOkRC )
  756. {
  757. cmShiftBuf* sbp = &p->shiftBuf;
  758. cmShiftBufFree(&sbp);
  759. cmMemPtrFree(&p->outV);
  760. cmObjFree(pp);
  761. }
  762. }
  763. return rc;
  764. }
  765. cmRC_t cmFuncFilterInit( cmFuncFilter* p, unsigned procSmpCnt, cmFuncFiltPtr_t funcPtr, void* userPtr, unsigned wndSmpCnt )
  766. {
  767. cmRC_t rc;
  768. if(( rc = cmFuncFilterFinal(p)) != cmOkRC )
  769. return rc;
  770. // The shift buffer always consits of the p->wndSmpCnt-1 samples from the previous
  771. // exec followed by the latest procSmpCnt samples at the end of the buffer
  772. cmShiftBufInit( &p->shiftBuf, procSmpCnt, wndSmpCnt + procSmpCnt - 1, procSmpCnt );
  773. p->outV = cmMemResizeZ( cmSample_t, p->outV, procSmpCnt);
  774. p->outN = procSmpCnt;
  775. p->funcPtr = funcPtr;
  776. p->curWndSmpCnt = 1;
  777. p->wndSmpCnt = wndSmpCnt;
  778. return rc;
  779. }
  780. cmRC_t cmFuncFilterFinal( cmFuncFilter* p )
  781. { return cmOkRC; }
  782. cmRC_t cmFuncFilterExec( cmFuncFilter* p, const cmSample_t* sp, unsigned sn )
  783. {
  784. assert( sn <= p->outN);
  785. // The window used by this function is always causal. At the very beginning of the signal
  786. // the window length begins at 1 and increases until is has the length p->wndSmpCnt.
  787. // Note that this approach ignores any zeros automatically prepended to the beginning of the
  788. // signal by the shift buffer. The first window processed always has a length of 1 and
  789. // begins with the first actual sample given to the shift buffer. Successive windows increase
  790. // by one and start at the first actual sample until the full window length is available
  791. // from the shift buffer. At this point the window length remains constant and it is hopped
  792. // by one sample for each window.
  793. while(cmShiftBufExec(&p->shiftBuf,sp,sn))
  794. {
  795. const cmSample_t* fsp = p->shiftBuf.outV;
  796. cmSample_t* dp = p->outV;
  797. cmSample_t* ep = p->outV + sn; // produce as many output values as there are input samples
  798. // for each output sample
  799. while( dp < ep )
  800. {
  801. // the source range should never extend outside the shift buffer
  802. assert( fsp + p->curWndSmpCnt <= p->shiftBuf.outV + p->shiftBuf.wndSmpCnt );
  803. // calc the next output value
  804. *dp++ = p->funcPtr( fsp, p->curWndSmpCnt, p->userPtr );
  805. // if the window has not yet achieved its full length ...
  806. if( p->curWndSmpCnt < p->wndSmpCnt )
  807. ++p->curWndSmpCnt; // ... then increase its length by 1
  808. else
  809. ++fsp; // ... otherwise shift it ahead by 1
  810. }
  811. }
  812. return cmOkRC;
  813. }
  814. cmSample_t cmFuncFiltTestFunc( const cmSample_t* sp, unsigned sn, void* vp )
  815. {
  816. //printf("% f % f %p % i\n",*sp,*sp+(sn-1),sp,sn);
  817. cmSample_t v = cmVOS_Median(sp,sn);
  818. printf("%f ",v);
  819. return v;
  820. //return *sp;
  821. }
  822. void cmFuncFilterTest( cmRpt_t* rpt, cmLHeapH_t lhH, cmSymTblH_t stH )
  823. {
  824. unsigned procSmpCnt = 1;
  825. unsigned N = 32;
  826. cmSample_t v[N];
  827. cmCtx c;
  828. unsigned i;
  829. cmCtxAlloc(&c,rpt,lhH,stH);
  830. cmVOS_Seq(v,N,0,1);
  831. cmVOS_Print(rpt,1,32,v);
  832. cmFuncFilter* ffp = NULL;
  833. ffp = cmFuncFilterAlloc( &c, NULL, procSmpCnt, cmFuncFiltTestFunc, NULL, 5 );
  834. for(i=0; i<N; ++i)
  835. cmFuncFilterExec(ffp,v+(i*procSmpCnt),procSmpCnt);
  836. cmFuncFilterFree( &ffp );
  837. cmCtxFinal(&c);
  838. //unsigned v1n = 9;
  839. //cmSample_t v1[9] = { 1, 75, 91, 35, 6, 80, 40, 91, 79};
  840. //cmSample_t v1[10] = {53, 64, 48, 78, 30, 59, 7, 50, 71, 53 };
  841. //printf("Median: %f \n",cmVOS_Median(v1,v1+v1n));
  842. }
  843. //------------------------------------------------------------------------------------------------------------
  844. cmDhmm* cmDhmmAlloc( cmCtx* c, cmDhmm* ap, unsigned stateN, unsigned symN, cmReal_t* initV, cmReal_t* transM, cmReal_t* stsM )
  845. {
  846. cmDhmm* p = cmObjAlloc( cmDhmm, c, ap );
  847. if( stateN > 0 && symN > 0 )
  848. if( cmDhmmInit(p, stateN, symN, initV, transM, stsM ) != cmOkRC )
  849. cmObjFree(&p);
  850. return p;
  851. }
  852. cmRC_t cmDhmmFree( cmDhmm** pp )
  853. {
  854. cmRC_t rc = cmOkRC;
  855. cmDhmm* p = *pp;
  856. if( pp==NULL || *pp==NULL )
  857. return cmOkRC;
  858. if((rc = cmDhmmFinal(p)) != cmOkRC )
  859. return cmOkRC;
  860. cmObjFree(pp);
  861. return rc;
  862. }
  863. cmRC_t cmDhmmInit( cmDhmm* p, unsigned stateN, unsigned symN, cmReal_t* initV, cmReal_t* transM, cmReal_t* stsM )
  864. {
  865. cmRC_t rc;
  866. if((rc = cmDhmmFinal(p)) != cmOkRC )
  867. return rc;
  868. p->stateN = stateN;
  869. p->symN = symN;
  870. p->initV = initV;
  871. p->transM = transM;
  872. p->stsM = stsM;
  873. return cmOkRC;
  874. }
  875. cmRC_t cmDhmmFinal( cmDhmm* p )
  876. { return cmOkRC; }
  877. cmRC_t cmDhmmExec( cmDhmm* p )
  878. {
  879. return cmOkRC;
  880. }
  881. // Generate a random matrix with rows that sum to 1.0.
  882. void _cmDhmmGenRandMatrix( cmReal_t* dp, unsigned rn, unsigned cn )
  883. {
  884. cmReal_t v[ cn ];
  885. unsigned i,j;
  886. for(i=0; i<rn; ++i)
  887. {
  888. cmVOR_Random( v, cn, 0.0, 1.0 );
  889. cmVOR_NormalizeProbability( v, cn);
  890. for(j=0; j<cn; ++j)
  891. dp[ (j * rn) + i ] = v[j];
  892. }
  893. }
  894. enum { kEqualProbHmmFl=0x01, kRandProbHmmFl=0x02, kManualProbHmmFl=0x04 };
  895. void _cmDhmmGenProb( cmReal_t* dp, unsigned rn, unsigned cn, unsigned flags, const cmReal_t* sp )
  896. {
  897. switch( flags )
  898. {
  899. case kRandProbHmmFl:
  900. _cmDhmmGenRandMatrix( dp, rn, cn );
  901. break;
  902. case kEqualProbHmmFl:
  903. {
  904. // equal prob
  905. cmReal_t pr = 1.0/cn;
  906. unsigned i,j;
  907. for(i=0; i<rn; ++i)
  908. for(j=0; j<cn; ++j)
  909. dp[ (j*rn) + i ] = pr;
  910. }
  911. break;
  912. case kManualProbHmmFl:
  913. cmVOR_Copy( dp, (rn*cn), sp );
  914. break;
  915. default:
  916. assert(0);
  917. }
  918. }
  919. // generate a random integer in the range 0 to probN-1 where probV[ probN ] contains
  920. // the probability of generating each of the possible values.
  921. unsigned _cmDhmmGenRandInt( const cmReal_t* probV, unsigned probN, unsigned stride )
  922. {
  923. cmReal_t tmp[ probN ];
  924. cmReal_t cumSumV[ probN+1 ];
  925. const cmReal_t* sp = probV;
  926. cumSumV[0] = 0;
  927. if( stride > 1 )
  928. {
  929. cmVOR_CopyStride( tmp, probN, probV, stride );
  930. sp = tmp;
  931. }
  932. cmVOR_CumSum( cumSumV+1, probN, sp );
  933. return cmVOR_BinIndex( cumSumV, probN+1, (cmReal_t)rand()/RAND_MAX );
  934. }
  935. cmRC_t cmDhmmGenObsSequence( cmDhmm* p, unsigned* dbp, unsigned dn )
  936. {
  937. const unsigned* dep = dbp + dn;
  938. // generate the first state based on the init state prob. vector
  939. unsigned state = _cmDhmmGenRandInt( p->initV, p->stateN, 1 );
  940. // generate an observation from the state based on the symbol prob. vector
  941. *dbp++ = _cmDhmmGenRandInt( p->stsM + state, p->symN, p->stateN );
  942. while( dbp < dep )
  943. {
  944. // get the next state based on the previous state
  945. state = _cmDhmmGenRandInt( p->transM + state, p->stateN, p->stateN );
  946. // given a state generate an observation
  947. *dbp++ = _cmDhmmGenRandInt( p->stsM + state, p->symN, p->stateN );
  948. }
  949. return cmOkRC;
  950. }
  951. /// Perform a forward evaluation of the model given a set of observations.
  952. /// initPrV[ stateN ] is the probability of the model being in each state at the start of the evaluation.
  953. /// alphaM[ stateN, obsN ] is a return value and represents the probability of seeing each symbol at each time step.
  954. enum { kNoLogScaleHmmFl = 0x00, kLogScaleHmmFl = 0x01 };
  955. cmRC_t cmDHmmForwardEval( cmDhmm* p, const cmReal_t* initPrV, const unsigned* obsV, unsigned obsN, cmReal_t* alphaM, unsigned flags, cmReal_t* logProbPtr )
  956. {
  957. bool scaleFl = cmIsFlag(flags,kLogScaleHmmFl);
  958. cmReal_t logProb = 0;
  959. cmReal_t* abp = alphaM; // define first dest. column
  960. const cmReal_t* aep = abp + p->stateN;
  961. const cmReal_t* sts = p->stsM + (obsV[0] * p->stateN); // stsM[] column for assoc'd with first obs. symbol
  962. unsigned i;
  963. // calc the prob of begining in each state given the obs. symbol
  964. for(i=0; abp < aep; ++i )
  965. *abp++ = *initPrV++ * *sts++;
  966. // scale to prevent underflow
  967. if( scaleFl )
  968. {
  969. cmReal_t sum = cmVOR_Sum(abp-p->stateN,p->stateN);
  970. if( sum > 0 )
  971. {
  972. cmVOR_DivVS( abp-p->stateN,p->stateN,sum);
  973. logProb += log(sum);
  974. }
  975. }
  976. // for each time step
  977. for(i=1; i<obsN; ++i)
  978. {
  979. // next state 0 (first col, first row) is calc'd first
  980. const cmReal_t* tm = p->transM;
  981. // pick the stsM[] column assoc'd with ith observation symbol
  982. const cmReal_t* sts = p->stsM + (obsV[i] * p->stateN);
  983. // store a pointer to the alpha column assoc'd with obsV[i-1]
  984. const cmReal_t* app0 = abp - p->stateN;
  985. aep = abp + p->stateN;
  986. // for each dest state
  987. while( abp < aep )
  988. {
  989. // prob of being in each state on the previous time step
  990. const cmReal_t* app = app0;
  991. const cmReal_t* ape = app + p->stateN;
  992. *abp = 0;
  993. // for each src state - calc prob. of trans from src to dest
  994. while( app<ape )
  995. *abp += *app++ * *tm++;
  996. // calc prob of obs symbol in dest state
  997. *abp++ *= *sts++;
  998. }
  999. // scale to prevent underflow
  1000. if( scaleFl )
  1001. {
  1002. cmReal_t sum = cmVOR_Sum(abp-p->stateN,p->stateN);
  1003. if( sum > 0 )
  1004. {
  1005. cmVOR_DivVS( abp-p->stateN,p->stateN,sum);
  1006. logProb += log(sum);
  1007. }
  1008. }
  1009. }
  1010. if( logProbPtr != NULL )
  1011. *logProbPtr = logProb;
  1012. return cmOkRC;
  1013. }
  1014. cmRC_t cmDHmmBcmkwardEval( cmDhmm* p, const unsigned* obsV, unsigned obsN, cmReal_t* betaM, unsigned flags )
  1015. {
  1016. bool scaleFl = cmIsFlag(flags,kLogScaleHmmFl);
  1017. int i,j,t;
  1018. cmVOR_Fill(betaM+((obsN-1)*p->stateN),p->stateN,1.0);
  1019. // for each time step
  1020. for(t=obsN-2; t>=0; --t)
  1021. {
  1022. // for each state at t
  1023. for(i=0; i<p->stateN; ++i)
  1024. {
  1025. double Bt = 0;
  1026. // for each state at t+1
  1027. for(j=0; j<p->stateN; ++j)
  1028. {
  1029. double aij = p->transM[ (j * p->stateN) + i ];
  1030. double bj = p->stsM[ (obsV[t+1] * p->stateN) + j ];
  1031. double Bt1 = betaM[ ((t+1) * p->stateN) + j ];
  1032. Bt += aij * bj * Bt1;
  1033. }
  1034. betaM[ (t * p->stateN) + i ] = Bt;
  1035. }
  1036. if( scaleFl )
  1037. {
  1038. double* bp = betaM + (t * p->stateN);
  1039. double sum = cmVOR_Sum(bp, p->stateN );
  1040. if( sum > 0 )
  1041. cmVOR_DivVS( bp, p->stateN, sum );
  1042. }
  1043. }
  1044. return cmOkRC;
  1045. }
  1046. void _cmDhmmNormRow( cmReal_t* p, unsigned pn, unsigned stride, const cmReal_t* sp )
  1047. {
  1048. if( sp == NULL )
  1049. sp = p;
  1050. cmReal_t sum = 0;
  1051. unsigned n = pn * stride;
  1052. const cmReal_t* bp = sp;
  1053. const cmReal_t* ep = bp + n;
  1054. for(; bp<ep; bp+=stride)
  1055. sum += *bp;
  1056. for(ep = p+n; p<ep; p+=stride,sp+=stride)
  1057. *p = *sp / sum;
  1058. }
  1059. void _cmDhmmNormMtxRows( cmReal_t* dp, unsigned rn, unsigned cn, const cmReal_t* sp )
  1060. {
  1061. const cmReal_t* erp = sp + rn;
  1062. while( sp < erp )
  1063. _cmDhmmNormRow( dp++, cn, rn, sp++ );
  1064. }
  1065. cmRC_t cmDhmmTrainEM( cmDhmm* p, const unsigned* obsV, unsigned obsN, unsigned iterCnt, unsigned flags )
  1066. {
  1067. unsigned i,j,k,t;
  1068. cmReal_t alphaM[ p->stateN * obsN ];
  1069. cmReal_t betaM[ p->stateN * obsN ];
  1070. cmReal_t g[ p->stateN * obsN ];
  1071. cmReal_t q[ p->stateN * p->symN ];
  1072. cmReal_t E[ p->stateN * p->stateN ];
  1073. cmReal_t logProb = 0;
  1074. //cmDhmmReport(p->obj.ctx,p);
  1075. for(k=0; k<iterCnt; ++k)
  1076. {
  1077. cmVOR_Fill( q, (p->stateN * p->symN), 0 );
  1078. cmVOR_Fill( E, (p->stateN * p->stateN), 0 );
  1079. // calculate alpha and beta
  1080. cmDHmmForwardEval( p, p->initV, obsV, obsN, alphaM, flags, &logProb);
  1081. cmDHmmBcmkwardEval( p, obsV, obsN, betaM, flags );
  1082. // gamma[ stateN, obsN ] = alphaM .* betaM - gamma is the probability of being in each state at each time step
  1083. cmVOR_MultVVV( g,(p->stateN*obsN), alphaM, betaM );
  1084. // normalize gamma
  1085. for(i=0; i<obsN; ++i)
  1086. cmVOR_NormalizeProbability( g + (i*p->stateN), p->stateN );
  1087. //printf("ITER:%i logProb:%f\n",k,logProb);
  1088. // count the number of times state i emits obsV[0] in the starting location
  1089. cmVOR_Copy( q + (obsV[0] * p->stateN), p->stateN, g );
  1090. for(t=0; t<obsN-1; ++t)
  1091. {
  1092. // point to alpha[:,t] and beta[:,t+1]
  1093. const cmReal_t* alpha_t0 = alphaM + (t*p->stateN);
  1094. const cmReal_t* beta_t1 = betaM + ((t+1)*p->stateN);
  1095. cmReal_t Et[ p->stateN * p->stateN ];
  1096. cmReal_t Esum = 0;
  1097. // for each source state
  1098. for(i=0; i<p->stateN; ++i)
  1099. {
  1100. // for each dest state
  1101. for(j=0; j<p->stateN; ++j)
  1102. {
  1103. // prob of transitioning from state i to j and emitting obs[t] at time t
  1104. cmReal_t Eps = alpha_t0[i] * p->transM[ (j*p->stateN) + i ] * p->stsM[ (obsV[t+1]*p->stateN) + j ] * beta_t1[j];
  1105. // count the number of transitions from i to j
  1106. Et[ (j*p->stateN) + i ] = Eps;
  1107. Esum += Eps;
  1108. }
  1109. // count the number of times state i emits obsV[t]
  1110. q[ (obsV[t+1] * p->stateN) + i ] += g[ ((t+1)*p->stateN) + i ];
  1111. }
  1112. // normalize Et and sum it into E
  1113. cmVOR_DivVS( Et, (p->stateN*p->stateN), Esum );
  1114. cmVOR_AddVV( E, (p->stateN*p->stateN), Et );
  1115. }
  1116. // update the model
  1117. _cmDhmmNormMtxRows( p->initV, 1, p->stateN, g );
  1118. _cmDhmmNormMtxRows( p->transM, p->stateN, p->stateN, E );
  1119. _cmDhmmNormMtxRows( p->stsM, p->stateN, p->symN, q );
  1120. }
  1121. return cmOkRC;
  1122. }
  1123. cmRC_t cmDhmmReport( cmDhmm* p )
  1124. {
  1125. cmVOR_PrintL("initV:\n", p->obj.err.rpt, 1, p->stateN, p->initV );
  1126. cmVOR_PrintL("transM:\n", p->obj.err.rpt, p->stateN, p->stateN, p->transM );
  1127. cmVOR_PrintL("symM:\n", p->obj.err.rpt, p->stateN, p->symN, p->stsM );
  1128. return cmOkRC;
  1129. }
  1130. void cmDhmmTest( cmRpt_t* rpt, cmLHeapH_t lhH, cmSymTblH_t stH )
  1131. {
  1132. unsigned stateN = 2;
  1133. unsigned symN = 3;
  1134. unsigned obsN = 4;
  1135. unsigned iterN = 10;
  1136. cmReal_t initV0[ stateN ];
  1137. cmReal_t transM0[ stateN * stateN ];
  1138. cmReal_t stsM0[ symN * stateN ];
  1139. cmReal_t initV1[ stateN ];
  1140. cmReal_t transM1[ stateN * stateN ];
  1141. cmReal_t stsM1[ symN * stateN ];
  1142. unsigned obsV[ obsN ];
  1143. unsigned hist[ symN ];
  1144. unsigned genFl = kManualProbHmmFl;
  1145. cmReal_t initV[] =
  1146. {
  1147. 0.44094,
  1148. 0.55906
  1149. };
  1150. cmReal_t transM[] =
  1151. {
  1152. 0.48336,
  1153. 0.81353,
  1154. 0.51664,
  1155. 0.18647,
  1156. };
  1157. cmReal_t stsM[] =
  1158. {
  1159. 0.20784,
  1160. 0.18698,
  1161. 0.43437,
  1162. 0.24102,
  1163. 0.35779,
  1164. 0.57199
  1165. };
  1166. unsigned obsM[] = { 2, 2, 2, 0 };
  1167. cmReal_t initV2[] = { 0.79060, 0.20940 };
  1168. cmReal_t transM2[] = { 0.508841, 0.011438, 0.491159, 0.988562 };
  1169. cmReal_t stsM2[] = { 0.25789, 0.35825, 0.61981, 0.42207, 0.12230, 0.21969 };
  1170. //srand( time(NULL) );
  1171. // generate a random HMM
  1172. _cmDhmmGenProb( initV0, 1, stateN, genFl, initV );
  1173. _cmDhmmGenProb( transM0, stateN, stateN, genFl, transM );
  1174. _cmDhmmGenProb( stsM0, stateN, symN, genFl, stsM );
  1175. cmCtx* c = cmCtxAlloc( NULL, rpt, lhH, stH);
  1176. cmDhmm* h0p = cmDhmmAlloc( c, NULL, stateN, symN, initV0, transM0, stsM0 );
  1177. // generate an observation sequence based on the random HMM
  1178. //cmDhmmGenObsSequence(c, h0p, obsV, obsN );
  1179. memcpy(obsV,obsM,obsN*sizeof(unsigned));
  1180. if( 0 )
  1181. {
  1182. // print the HMM
  1183. cmDhmmReport( h0p);
  1184. // print the observation symbols
  1185. cmVOU_PrintL("obs:\n", rpt, 1, obsN, obsV );
  1186. // print the histogram of the obs. symbols
  1187. cmVOU_Hist( hist, symN, obsV, obsN );
  1188. cmVOU_PrintL("hist:\n", rpt, 1, symN, hist );
  1189. // calc alpha (the forward probabilities)
  1190. cmReal_t alphaM[ h0p->stateN*obsN ];
  1191. cmReal_t logProb=0;
  1192. cmDHmmForwardEval( h0p, h0p->initV, obsV, obsN, alphaM, kLogScaleHmmFl, &logProb);
  1193. printf("log prob:%f\n alpha:\n", logProb );
  1194. cmVOR_Print( rpt, h0p->stateN, obsN, alphaM );
  1195. // calc beta (the bcmkward probabilities)
  1196. cmReal_t betaM[ h0p->stateN*obsN ];
  1197. logProb=0;
  1198. cmDHmmBcmkwardEval( h0p, obsV, obsN, betaM, kLogScaleHmmFl);
  1199. printf("log prob:%f\n beta:\n", logProb );
  1200. cmVOR_Print( h0p->obj.err.rpt, h0p->stateN, obsN, betaM );
  1201. }
  1202. // initialize a second HMM with random probabilities
  1203. _cmDhmmGenProb( initV1, 1, stateN, kManualProbHmmFl, initV2 );
  1204. _cmDhmmGenProb( transM1, stateN, stateN, kManualProbHmmFl, transM2 );
  1205. _cmDhmmGenProb( stsM1, stateN, symN, kManualProbHmmFl, stsM2 );
  1206. cmDhmm* h1p = cmDhmmAlloc( c, NULL, stateN, symN, initV1, transM1, stsM1 );
  1207. cmDhmmTrainEM( h1p, obsV, obsN, iterN, kLogScaleHmmFl );
  1208. cmDhmmFree(&h1p);
  1209. cmDhmmFree(&h0p);
  1210. cmCtxFree(&c);
  1211. }
  1212. //------------------------------------------------------------------------------------------------------------
  1213. cmConvolve* cmConvolveAlloc( cmCtx* c, cmConvolve* ap, const cmSample_t* h, unsigned hn, unsigned procSmpCnt )
  1214. {
  1215. cmConvolve* p = cmObjAlloc( cmConvolve, c, ap);
  1216. p->fft = cmFftAllocSR( c,NULL,NULL,0,kNoConvertFftFl);
  1217. p->ifft= cmIFftAllocRS(c,NULL,p->fft->binCnt);
  1218. if( hn > 0 && procSmpCnt > 0 )
  1219. if( cmConvolveInit(p,h,hn,procSmpCnt) != cmOkRC )
  1220. cmObjFree(&p);
  1221. return p;
  1222. }
  1223. cmRC_t cmConvolveFree( cmConvolve** pp )
  1224. {
  1225. cmRC_t rc;
  1226. cmConvolve* p = *pp;
  1227. if( pp == NULL || *pp == NULL )
  1228. return cmOkRC;
  1229. if((rc = cmConvolveFinal(p)) != cmOkRC )
  1230. return cmOkRC;
  1231. cmFftFreeSR(&p->fft);
  1232. cmIFftFreeRS(&p->ifft);
  1233. cmMemPtrFree(&p->H);
  1234. cmMemPtrFree(&p->outV);
  1235. cmObjFree(pp);
  1236. return cmOkRC;
  1237. }
  1238. cmRC_t cmConvolveInit( cmConvolve* p, const cmSample_t* h, unsigned hn, unsigned procSmpCnt )
  1239. {
  1240. cmRC_t rc;
  1241. unsigned i;
  1242. unsigned cn = cmNextPowerOfTwo( hn + procSmpCnt - 1 );
  1243. if((rc = cmConvolveFinal(p)) != cmOkRC )
  1244. return rc;
  1245. cmFftInitSR( p->fft, NULL, cn, kNoConvertFftFl );
  1246. cmIFftInitRS( p->ifft, p->fft->binCnt);
  1247. p->H = cmMemResizeZ( cmComplexR_t,p->H, p->fft->binCnt );
  1248. p->outV = cmMemResizeZ( cmSample_t,p->outV, cn );
  1249. p->olaV = p->outV + procSmpCnt;
  1250. p->outN = procSmpCnt;
  1251. p->hn = hn;
  1252. // take the FFT of the impulse response
  1253. cmFftExecSR( p->fft, h, hn );
  1254. // copy the FFT of the impulse response to p->H[]
  1255. for(i=0; i<p->fft->binCnt; ++i)
  1256. p->H[i] = p->fft->complexV[i] / p->fft->wndSmpCnt;
  1257. return cmOkRC;
  1258. }
  1259. cmRC_t cmConvolveFinal( cmConvolve* p )
  1260. { return cmOkRC; }
  1261. cmRC_t cmConvolveExec( cmConvolve* p, const cmSample_t* x, unsigned xn )
  1262. {
  1263. unsigned i;
  1264. // take FT of input signal
  1265. cmFftExecSR( p->fft, x, xn );
  1266. // multiply the signal spectra of the input signal and impulse response
  1267. for(i=0; i<p->fft->binCnt; ++i)
  1268. p->ifft->complexV[i] = p->H[i] * p->fft->complexV[i];
  1269. // take the IFFT of the convolved spectrum
  1270. cmIFftExecRS(p->ifft,NULL);
  1271. // sum with previous impulse response tail
  1272. cmVOS_AddVVV( p->outV, p->outN-1, p->olaV, p->ifft->outV );
  1273. // first sample of the impulse response tail is complete
  1274. p->outV[p->outN-1] = p->ifft->outV[p->outN-1];
  1275. // store the new impulse response tail
  1276. cmVOS_Copy(p->olaV,p->hn-1,p->ifft->outV + p->outN );
  1277. return cmOkRC;
  1278. }
  1279. cmRC_t cmConvolveSignal( cmCtx* c, const cmSample_t* h, unsigned hn, const cmSample_t* x, unsigned xn, cmSample_t* y, unsigned yn )
  1280. {
  1281. cmConvolve* p = cmConvolveAlloc(c,NULL,h,hn,xn);
  1282. cmConvolveExec(p,x,xn);
  1283. unsigned n = cmMin(p->outN,yn);
  1284. cmVOS_Copy(y,n,p->outV);
  1285. if( yn > p->outN )
  1286. {
  1287. unsigned m = cmMin(yn-p->outN,p->hn-1);
  1288. cmVOS_Copy(y+n,m,p->olaV);
  1289. }
  1290. cmConvolveFree(&p);
  1291. return cmOkRC;
  1292. }
  1293. cmRC_t cmConvolveTest(cmRpt_t* rpt, cmLHeapH_t lhH, cmSymTblH_t stH )
  1294. {
  1295. cmCtx *c = cmCtxAlloc(NULL,rpt,lhH,stH);
  1296. cmSample_t h[] = { 1, .5, .25, 0, 0 };
  1297. unsigned hn = sizeof(h) / sizeof(h[0]);
  1298. cmSample_t x[] = { 1, 0, 0, 0, 1, 0, 0, 0 };
  1299. unsigned xn = sizeof(x) / sizeof(x[0]);
  1300. unsigned yn = xn+hn-1;
  1301. cmSample_t y[yn];
  1302. //cmVOS_Hann(h,5);
  1303. cmConvolve* p = cmConvolveAlloc(c,NULL,h,hn,xn);
  1304. cmConvolveExec(p,x,xn);
  1305. cmVOS_Print( rpt, 1, p->outN, p->outV );
  1306. cmVOS_Print( rpt, 1, p->hn-1, p->olaV );
  1307. cmConvolveFree(&p);
  1308. cmConvolveSignal(c,h,hn,x,xn,y,yn);
  1309. cmVOS_Print( rpt, 1, hn+xn-1, y );
  1310. cmCtxFree(&c);
  1311. return cmOkRC;
  1312. }
  1313. //------------------------------------------------------------------------------------------------------------
  1314. cmBfcc* cmBfccAlloc( cmCtx* ctx, cmBfcc* ap, unsigned bandCnt, unsigned binCnt, double binHz )
  1315. {
  1316. cmBfcc* p = cmObjAlloc( cmBfcc, ctx, ap );
  1317. if( bandCnt > 0 )
  1318. if( cmBfccInit( p, bandCnt, binCnt, binHz ) != cmOkRC )
  1319. cmBfccFree(&p);
  1320. return p;
  1321. }
  1322. cmRC_t cmBfccFree( cmBfcc** pp )
  1323. {
  1324. cmRC_t rc;
  1325. if( pp== NULL || *pp==NULL)
  1326. return cmOkRC;
  1327. cmBfcc* p = *pp;
  1328. if((rc = cmBfccFinal(p)) != cmOkRC )
  1329. return rc;
  1330. cmMemPtrFree(&p->dctMtx);
  1331. cmMemPtrFree(&p->filtMask);
  1332. cmMemPtrFree(&p->outV);
  1333. cmObjFree(pp);
  1334. return rc;
  1335. }
  1336. cmRC_t cmBfccInit( cmBfcc* p, unsigned bandCnt, unsigned binCnt, double binHz )
  1337. {
  1338. cmRC_t rc;
  1339. if((rc = cmBfccFinal(p)) != cmOkRC )
  1340. return rc;
  1341. p->dctMtx = cmMemResizeZ( cmReal_t, p->dctMtx, bandCnt*bandCnt);
  1342. p->filtMask = cmMemResizeZ( cmReal_t, p->filtMask, bandCnt*binCnt);
  1343. p->outV = cmMemResizeZ( cmReal_t, p->outV, bandCnt );
  1344. p->binCnt = binCnt;
  1345. p->bandCnt = bandCnt;
  1346. cmVOR_BarkMask( p->filtMask, bandCnt, binCnt, binHz );
  1347. cmVOR_DctMatrix(p->dctMtx, bandCnt, bandCnt );
  1348. return rc;
  1349. }
  1350. cmRC_t cmBfccFinal( cmBfcc* p )
  1351. { return cmOkRC; }
  1352. cmRC_t cmBfccExec( cmBfcc* p, const cmReal_t* magV, unsigned binCnt )
  1353. {
  1354. assert( binCnt <= p->binCnt );
  1355. cmReal_t t[ p->bandCnt ];
  1356. cmReal_t v[ binCnt ];
  1357. // convert magnitude to power
  1358. cmVOR_PowVVS(v,binCnt,magV,2.0);
  1359. // apply the filter mask to the power spectrum
  1360. cmVOR_MultVMV( t, p->bandCnt, p->filtMask, binCnt, v );
  1361. //cmVOR_PrintL("\t:\n", p->obj.ctx->outFuncPtr, 1, p->bandCnt, t);
  1362. cmVOR_ReplaceLte( t, p->bandCnt, t, 0, 0.1e-5 );
  1363. cmVOR_LogV( t, p->bandCnt, t );
  1364. // decorellate the bands with a DCT
  1365. cmVOR_MultVMV( p->outV, p->bandCnt, p->dctMtx, p->bandCnt, t );
  1366. return cmOkRC;
  1367. }
  1368. void cmBfccTest( cmRpt_t* rpt, cmLHeapH_t lhH, cmSymTblH_t stH )
  1369. {
  1370. double srate = 11025;
  1371. unsigned binCnt = 129;
  1372. double binHz = srate/(binCnt-1);
  1373. unsigned bandCnt = kDefaultBarkBandCnt;
  1374. cmCtx* c = cmCtxAlloc( NULL, rpt, lhH, stH );
  1375. cmBfcc* b = cmBfccAlloc( c, NULL, bandCnt, binCnt, binHz );
  1376. cmReal_t powV[] = {
  1377. 0.8402, 0.3944, 0.7831, 0.7984, 0.9116, 0.1976, 0.3352, 0.7682, 0.2778, 0.5540,
  1378. 0.4774, 0.6289, 0.3648, 0.5134, 0.9522, 0.9162, 0.6357, 0.7173, 0.1416, 0.6070,
  1379. 0.0163, 0.2429, 0.1372, 0.8042, 0.1567, 0.4009, 0.1298, 0.1088, 0.9989, 0.2183,
  1380. 0.5129, 0.8391, 0.6126, 0.2960, 0.6376, 0.5243, 0.4936, 0.9728, 0.2925, 0.7714,
  1381. 0.5267, 0.7699, 0.4002, 0.8915, 0.2833, 0.3525, 0.8077, 0.9190, 0.0698, 0.9493,
  1382. 0.5260, 0.0861, 0.1922, 0.6632, 0.8902, 0.3489, 0.0642, 0.0200, 0.4577, 0.0631,
  1383. 0.2383, 0.9706, 0.9022, 0.8509, 0.2667, 0.5398, 0.3752, 0.7602, 0.5125, 0.6677,
  1384. 0.5316, 0.0393, 0.4376, 0.9318, 0.9308, 0.7210, 0.2843, 0.7385, 0.6400, 0.3540,
  1385. 0.6879, 0.1660, 0.4401, 0.8801, 0.8292, 0.3303, 0.2290, 0.8934, 0.3504, 0.6867,
  1386. 0.9565, 0.5886, 0.6573, 0.8587, 0.4396, 0.9240, 0.3984, 0.8148, 0.6842, 0.9110,
  1387. 0.4825, 0.2158, 0.9503, 0.9201, 0.1477, 0.8811, 0.6411, 0.4320, 0.6196, 0.2811,
  1388. 0.7860, 0.3075, 0.4470, 0.2261, 0.1875, 0.2762, 0.5564, 0.4165, 0.1696, 0.9068,
  1389. 0.1032, 0.1261, 0.4954, 0.7605, 0.9848, 0.9350, 0.6844, 0.3832, 0.7498 };
  1390. //cmVOR_Random(powV, binCnt, 0.0, 1.0 );
  1391. cmBfccExec(b,powV,binCnt);
  1392. //cmVOR_PrintL("\nin:\n", rpt, 1, binCnt, powV);
  1393. //cmVOR_PrintL("\nfilt:\n", rpt, bandCnt, binCnt, b->filtMask);
  1394. //cmVOR_PrintL("\ndct:\n", rpt, bandCnt, bandCnt,b->dctMtx);
  1395. cmVOR_PrintL("\nbfcc:\n", rpt, 1, bandCnt, b->outV);
  1396. cmBfccFree(&b);
  1397. cmCtxFree(&c);
  1398. }
  1399. //------------------------------------------------------------------------------------------------------------
  1400. cmCeps* cmCepsAlloc( cmCtx* ctx, cmCeps* ap, unsigned binCnt, unsigned outN )
  1401. {
  1402. cmCeps* p = cmObjAlloc( cmCeps, ctx, ap );
  1403. //cmIFftAllocRR( ctx, &p->ft, 0 );
  1404. if( binCnt > 0 )
  1405. if( cmCepsInit( p, binCnt, outN ) != cmOkRC )
  1406. cmCepsFree(&p);
  1407. return p;
  1408. }
  1409. cmRC_t cmCepsFree( cmCeps** pp )
  1410. {
  1411. cmRC_t rc;
  1412. if( pp== NULL || *pp==NULL)
  1413. return cmOkRC;
  1414. cmCeps* p = *pp;
  1415. if((rc = cmCepsFinal(p)) != cmOkRC )
  1416. return rc;
  1417. //cmObjFreeStatic( cmIFftFreeRR, cmIFftRR, p->ft );
  1418. cmMemPtrFree(&p->dctM);
  1419. cmMemPtrFree(&p->outV);
  1420. cmObjFree(pp);
  1421. return rc;
  1422. }
  1423. cmRC_t cmCepsInit( cmCeps* p, unsigned binCnt, unsigned outN )
  1424. {
  1425. cmRC_t rc;
  1426. if((rc = cmCepsFinal(p)) != cmOkRC )
  1427. return rc;
  1428. //cmIFftInitRR( &p->ft, binCnt );
  1429. p->dct_cn = (binCnt-1)*2;
  1430. p->dctM = cmMemResize( cmReal_t, p->dctM, outN*p->dct_cn );
  1431. p->outN = outN; //p->ft.outN;
  1432. p->outV = cmMemResizeZ( cmReal_t, p->outV, outN ); //p->ft.outV;
  1433. p->binCnt = binCnt;
  1434. assert( outN <= p->dct_cn );
  1435. cmVOR_DctMatrix( p->dctM, outN, p->dct_cn );
  1436. return rc;
  1437. }
  1438. cmRC_t cmCepsFinal( cmCeps* p )
  1439. { return cmOkRC; }
  1440. cmRC_t cmCepsExec( cmCeps* p, const cmReal_t* magV, const cmReal_t* phsV, unsigned binCnt )
  1441. {
  1442. assert( binCnt == p->binCnt );
  1443. cmReal_t v[ p->dct_cn ];
  1444. // guard against zeros in the magn spectrum
  1445. cmVOR_ReplaceLte(v,binCnt,magV,0.0,0.00001);
  1446. // take the log of the spectrum
  1447. cmVOR_LogV(v,binCnt,v);
  1448. // reconstruct the negative frequencies
  1449. int i,j;
  1450. for(i=1,j=p->dct_cn-1; i<binCnt; ++i,--j)
  1451. v[j] = v[i];
  1452. // take the DCT
  1453. cmVOR_MultVMV( p->outV, p->outN, p->dctM, p->dct_cn, v );
  1454. //cmIFftExecPolarRR( &p->ft, v, phsV );
  1455. return cmOkRC;
  1456. }
  1457. //------------------------------------------------------------------------------------------------------------
  1458. cmOla* cmOlaAlloc( cmCtx* ctx, cmOla* ap, unsigned wndSmpCnt, unsigned hopSmpCnt, unsigned procSmpCnt, unsigned wndTypeId )
  1459. {
  1460. cmOla* p = cmObjAlloc( cmOla, ctx, ap );
  1461. cmWndFuncAlloc( ctx, &p->wf, kHannWndId, wndSmpCnt, 0);
  1462. if( wndSmpCnt > 0 )
  1463. if( cmOlaInit(p,wndSmpCnt,hopSmpCnt,procSmpCnt,wndTypeId) != cmOkRC )
  1464. cmOlaFree(&p);
  1465. return p;
  1466. }
  1467. cmRC_t cmOlaFree( cmOla** pp )
  1468. {
  1469. cmRC_t rc;
  1470. if( pp==NULL || *pp==NULL )
  1471. return cmOkRC;
  1472. cmOla* p = *pp;
  1473. if(( rc = cmOlaFinal(p)) != cmOkRC )
  1474. return rc;
  1475. cmMemPtrFree(&p->bufV);
  1476. cmMemPtrFree(&p->outV);
  1477. cmObjFreeStatic( cmWndFuncFree, cmWndFunc, p->wf );
  1478. cmObjFree(pp);
  1479. return rc;
  1480. }
  1481. cmRC_t cmOlaInit( cmOla* p, unsigned wndSmpCnt, unsigned hopSmpCnt, unsigned procSmpCnt, unsigned wndTypeId )
  1482. {
  1483. cmRC_t rc;
  1484. if((rc = cmOlaFinal(p)) != cmOkRC )
  1485. return rc;
  1486. if((rc = cmWndFuncInit( &p->wf, wndTypeId, wndSmpCnt, 0)) != cmOkRC )
  1487. return rc;
  1488. p->bufV = cmMemResizeZ( cmSample_t, p->bufV, wndSmpCnt );
  1489. p->outV = cmMemResizeZ( cmSample_t, p->outV, hopSmpCnt );
  1490. p->outPtr = p->outV + hopSmpCnt;
  1491. // hopSmpCnt must be an even multiple of procSmpCnt
  1492. assert( hopSmpCnt % procSmpCnt == 0 );
  1493. assert( wndSmpCnt >= hopSmpCnt );
  1494. p->wndSmpCnt = wndSmpCnt;
  1495. p->hopSmpCnt = hopSmpCnt;
  1496. p->procSmpCnt= procSmpCnt;
  1497. p->idx = 0;
  1498. return rc;
  1499. }
  1500. cmRC_t cmOlaFinal( cmOla* p )
  1501. { return cmOkRC; }
  1502. // The incoming buffer and the ola buf (bufV)
  1503. // can be divided into three logical parts:
  1504. //
  1505. // [head][middle][tail]
  1506. //
  1507. // head = hopSmpCnt values
  1508. // tail = hopSmpCnt values
  1509. // middle = wndSmpCnt - (2*hopSmpCnt) values
  1510. //
  1511. // Each exec can be broken into three phases:
  1512. //
  1513. // outV = bufV[tail] + in[head]
  1514. // bufV[middle] += in[middle]
  1515. // bufV[tail] = in[tail]
  1516. //
  1517. cmRC_t cmOlaExecS( cmOla* p, const cmSample_t* sp, unsigned sN )
  1518. {
  1519. assert( sN == p->wndSmpCnt );
  1520. cmRC_t rc = cmOkRC;
  1521. const cmSample_t* ep = sp + sN;
  1522. const cmSample_t* wp = p->wf.wndV;
  1523. int i,j,k,n;
  1524. // [Sum head of incoming samples with tail of ola buf]
  1525. // fill outV with the bufV[idx:idx+hopSmpCnt] + sp[hopSmpCnt]
  1526. for(i=0; i<p->hopSmpCnt; ++i)
  1527. {
  1528. p->outV[i] = p->bufV[p->idx++] + (*sp++ * *wp++);
  1529. if( p->idx == p->wndSmpCnt )
  1530. p->idx = 0;
  1531. }
  1532. // [Sum middle of incoming samples with middle of ola buf]
  1533. // sum next wndSmpCnt - hopSmpCnt samples of sp[] into bufV[]
  1534. n = p->wndSmpCnt - (2*p->hopSmpCnt);
  1535. k = p->idx;
  1536. for(j=0; j<n; ++j)
  1537. {
  1538. p->bufV[k++] += (*sp++ * *wp++);
  1539. if( k == p->wndSmpCnt )
  1540. k = 0;
  1541. }
  1542. // [Assign tail of incoming to tail of ola buf]
  1543. // assign ending samples from sp[] into bufV[]
  1544. while( sp < ep )
  1545. {
  1546. p->bufV[k++] = (*sp++ * *wp++);
  1547. if( k == p->wndSmpCnt )
  1548. k = 0;
  1549. }
  1550. p->outPtr = p->outV;
  1551. return rc;
  1552. }
  1553. cmRC_t cmOlaExecR( cmOla* p, const cmReal_t* sp, unsigned sN )
  1554. {
  1555. assert( sN == p->wndSmpCnt );
  1556. cmRC_t rc = cmOkRC;
  1557. const cmReal_t* ep = sp + sN;
  1558. const cmSample_t* wp = p->wf.wndV;
  1559. int i,j,k,n;
  1560. // fill outV with the bufV[idx:idx+hopSmpCnt] + sp[hopSmpCnt]
  1561. for(i=0; i<p->hopSmpCnt; ++i)
  1562. {
  1563. p->outV[i] = p->bufV[p->idx++] + (*sp++ * *wp++);
  1564. if( p->idx == p->wndSmpCnt )
  1565. p->idx = 0;
  1566. }
  1567. // sum next wndSmpCnt - hopSmpCnt samples of sp[] into bufV[]
  1568. n = p->wndSmpCnt - (2*p->hopSmpCnt);
  1569. k = p->idx;
  1570. for(j=0; j<n; ++j)
  1571. {
  1572. p->bufV[k++] += (*sp++ * *wp++);
  1573. if( k == p->wndSmpCnt )
  1574. k = 0;
  1575. }
  1576. // assign ending samples from sp[] into bufV[]
  1577. while( sp < ep )
  1578. {
  1579. p->bufV[k++] = (*sp++ * *wp++);
  1580. if( k == p->wndSmpCnt )
  1581. k = 0;
  1582. }
  1583. p->outPtr = p->outV;
  1584. return rc;
  1585. }
  1586. const cmSample_t* cmOlaExecOut(cmOla* p)
  1587. {
  1588. const cmSample_t* sp = p->outPtr;
  1589. if( sp >= p->outV + p->hopSmpCnt )
  1590. return NULL;
  1591. p->outPtr += p->procSmpCnt;
  1592. return sp;
  1593. }
  1594. //------------------------------------------------------------------------------------------------------------
  1595. cmPhsToFrq* cmPhsToFrqAlloc( cmCtx* c, cmPhsToFrq* ap, double srate, unsigned binCnt, unsigned hopSmpCnt )
  1596. {
  1597. cmPhsToFrq* p = cmObjAlloc( cmPhsToFrq, c, ap );
  1598. if( srate != 0 )
  1599. if( cmPhsToFrqInit( p, srate, binCnt, hopSmpCnt ) != cmOkRC )
  1600. cmPhsToFrqFree(&p);
  1601. return p;
  1602. }
  1603. cmRC_t cmPhsToFrqFree( cmPhsToFrq** pp )
  1604. {
  1605. cmRC_t rc = cmOkRC;
  1606. cmPhsToFrq* p = *pp;
  1607. if( pp==NULL || *pp== NULL )
  1608. return rc;
  1609. if((rc = cmPhsToFrqFinal(p)) != cmOkRC )
  1610. return rc;
  1611. cmMemPtrFree(&p->hzV);
  1612. cmMemPtrFree(&p->phsV);
  1613. cmMemPtrFree(&p->wV);
  1614. cmObjFree(pp);
  1615. return rc;
  1616. }
  1617. cmRC_t cmPhsToFrqInit( cmPhsToFrq* p, double srate, unsigned binCnt, unsigned hopSmpCnt )
  1618. {
  1619. cmRC_t rc;
  1620. unsigned i;
  1621. if((rc = cmPhsToFrqFinal(p)) != cmOkRC )
  1622. return rc;
  1623. p->hzV = cmMemResizeZ( cmReal_t, p->hzV, binCnt );
  1624. p->phsV = cmMemResizeZ( cmReal_t, p->phsV, binCnt );
  1625. p->wV = cmMemResizeZ( cmReal_t, p->wV, binCnt );
  1626. p->srate = srate;
  1627. p->binCnt = binCnt;
  1628. p->hopSmpCnt = hopSmpCnt;
  1629. for(i=0; i<binCnt; ++i)
  1630. p->wV[i] = M_PI * i * hopSmpCnt / (binCnt-1);
  1631. return rc;
  1632. }
  1633. cmRC_t cmPhsToFrqFinal(cmPhsToFrq* p )
  1634. { return cmOkRC; }
  1635. cmRC_t cmPhsToFrqExec( cmPhsToFrq* p, const cmReal_t* phsV )
  1636. {
  1637. cmRC_t rc = cmOkRC;
  1638. unsigned i;
  1639. double twoPi = 2.0 * M_PI;
  1640. double den = twoPi * p->hopSmpCnt;
  1641. for(i=0; i<p->binCnt; ++i)
  1642. {
  1643. cmReal_t dPhs = phsV[i] - p->phsV[i];
  1644. // unwrap phase - see phase_study.m for explanation
  1645. cmReal_t k = round( (p->wV[i] - dPhs) / twoPi);
  1646. // convert phase change to Hz
  1647. p->hzV[i] = (k * twoPi + dPhs) * p->srate / den;
  1648. // store phase for next iteration
  1649. p->phsV[i] = phsV[i];
  1650. }
  1651. return rc;
  1652. }
  1653. //------------------------------------------------------------------------------------------------------------
  1654. cmPvAnl* cmPvAnlAlloc( cmCtx* ctx, cmPvAnl* ap, unsigned procSmpCnt, double srate, unsigned wndSmpCnt, unsigned hopSmpCnt, unsigned flags )
  1655. {
  1656. cmRC_t rc;
  1657. cmPvAnl* p = cmObjAlloc( cmPvAnl, ctx, ap );
  1658. cmShiftBufAlloc(ctx, &p->sb, procSmpCnt, wndSmpCnt, hopSmpCnt );
  1659. cmWndFuncAlloc( ctx, &p->wf, kHannWndId, wndSmpCnt, 0);
  1660. cmFftAllocSR( ctx, &p->ft, p->wf.outV, wndSmpCnt, kToPolarFftFl);
  1661. cmPhsToFrqAlloc(ctx, &p->pf, srate, p->ft.binCnt, hopSmpCnt );
  1662. if( procSmpCnt > 0 )
  1663. if((rc = cmPvAnlInit(p,procSmpCnt,srate,wndSmpCnt,hopSmpCnt,flags)) != cmOkRC )
  1664. cmPvAnlFree(&p);
  1665. return p;
  1666. }
  1667. cmRC_t cmPvAnlFree( cmPvAnl** pp )
  1668. {
  1669. cmRC_t rc;
  1670. if( pp==NULL || *pp==NULL )
  1671. return cmOkRC;
  1672. cmPvAnl* p = *pp;
  1673. if((rc = cmPvAnlFinal(p) ) != cmOkRC )
  1674. return rc;
  1675. cmObjFreeStatic( cmPhsToFrqFree, cmPhsToFrq, p->pf );
  1676. cmObjFreeStatic( cmFftFreeSR, cmFftSR, p->ft );
  1677. cmObjFreeStatic( cmWndFuncFree, cmWndFunc, p->wf );
  1678. cmObjFreeStatic( cmShiftBufFree, cmShiftBuf, p->sb );
  1679. cmObjFree(pp);
  1680. return rc;
  1681. }
  1682. cmRC_t cmPvAnlInit( cmPvAnl* p, unsigned procSmpCnt, double srate, unsigned wndSmpCnt, unsigned hopSmpCnt, unsigned flags )
  1683. {
  1684. cmRC_t rc;
  1685. if((rc = cmPvAnlFinal(p)) != cmOkRC )
  1686. return rc;
  1687. if((rc = cmShiftBufInit( &p->sb, procSmpCnt, wndSmpCnt, hopSmpCnt )) != cmOkRC )
  1688. return rc;
  1689. if((rc = cmWndFuncInit( &p->wf, kHannWndId | kNormByLengthWndFl, wndSmpCnt, 0)) != cmOkRC )
  1690. return rc;
  1691. if((rc = cmFftInitSR( &p->ft, p->wf.outV, wndSmpCnt, kToPolarFftFl)) != cmOkRC )
  1692. return rc;
  1693. if((rc = cmPhsToFrqInit( &p->pf, srate, p->ft.binCnt, hopSmpCnt)) != cmOkRC )
  1694. return rc;
  1695. // if the window was just initialized
  1696. // divide the window to indirectly apply the magnitude normalization
  1697. //if( p->wndSmpCnt != wndSmpCnt )
  1698. // cmVOS_DivVS( p->wf.wndV, p->wf.outN, wndSmpCnt );
  1699. p->flags = flags;
  1700. p->procSmpCnt = procSmpCnt;
  1701. p->wndSmpCnt = wndSmpCnt;
  1702. p->hopSmpCnt = hopSmpCnt;
  1703. p->binCnt = p->ft.binCnt;
  1704. p->magV = p->ft.magV;
  1705. p->phsV = p->ft.phsV;
  1706. p->hzV = p->pf.hzV;
  1707. return rc;
  1708. }
  1709. cmRC_t cmPvAnlFinal(cmPvAnl* p )
  1710. { return cmOkRC; }
  1711. bool cmPvAnlExec( cmPvAnl* p, const cmSample_t* x, unsigned xN )
  1712. {
  1713. bool fl = false;
  1714. while( cmShiftBufExec(&p->sb,x,xN) )
  1715. {
  1716. cmWndFuncExec(&p->wf, p->sb.outV, p->sb.wndSmpCnt );
  1717. cmFftExecSR(&p->ft,NULL,0);
  1718. if( cmIsFlag(p->flags,kCalcHzPvaFl) )
  1719. cmPhsToFrqExec(&p->pf,p->phsV);
  1720. fl = true;
  1721. }
  1722. return fl;
  1723. }
  1724. //------------------------------------------------------------------------------------------------------------
  1725. cmPvSyn* cmPvSynAlloc( cmCtx* ctx, cmPvSyn* ap, unsigned procSmpCnt, double outSrate, unsigned wndSmpCnt, unsigned hopSmpCnt, unsigned wndTypeId )
  1726. {
  1727. cmRC_t rc;
  1728. cmPvSyn* p = cmObjAlloc( cmPvSyn, ctx, ap );
  1729. cmWndFuncAlloc( ctx, &p->wf, kHannWndId, wndSmpCnt, 0);
  1730. cmIFftAllocRS( ctx, &p->ft, wndSmpCnt/2+1 );
  1731. cmOlaAlloc( ctx, &p->ola, wndSmpCnt, hopSmpCnt, procSmpCnt, wndTypeId );
  1732. if( procSmpCnt )
  1733. if((rc = cmPvSynInit(p,procSmpCnt,outSrate,wndSmpCnt,hopSmpCnt,wndTypeId)) != cmOkRC )
  1734. cmPvSynFree(&p);
  1735. return p;
  1736. }
  1737. cmRC_t cmPvSynFree( cmPvSyn** pp )
  1738. {
  1739. cmRC_t rc;
  1740. if( pp==NULL || *pp==NULL )
  1741. return cmOkRC;
  1742. cmPvSyn* p = *pp;
  1743. if((rc = cmPvSynFinal(p)) != cmOkRC )
  1744. return rc;
  1745. cmMemPtrFree(&p->minRphV);
  1746. cmMemPtrFree(&p->maxRphV);
  1747. cmMemPtrFree(&p->itrV);
  1748. cmMemPtrFree(&p->phs0V);
  1749. cmMemPtrFree(&p->phsV);
  1750. cmMemPtrFree(&p->mag0V);
  1751. cmMemPtrFree(&p->magV);
  1752. cmObjFreeStatic( cmOlaFree, cmOla, p->ola);
  1753. cmObjFreeStatic( cmIFftFreeRS, cmIFftRS, p->ft );
  1754. cmObjFreeStatic( cmWndFuncFree, cmWndFunc, p->wf );
  1755. cmObjFree(pp);
  1756. return cmOkRC;
  1757. }
  1758. cmRC_t cmPvSynInit( cmPvSyn* p, unsigned procSmpCnt, double outSrate, unsigned wndSmpCnt, unsigned hopSmpCnt, unsigned wndTypeId )
  1759. {
  1760. cmRC_t rc;
  1761. int k;
  1762. double twoPi = 2.0 * M_PI;
  1763. bool useHannFl = true;
  1764. int m = useHannFl ? 2 : 1;
  1765. if((rc = cmPvSynFinal(p)) != cmOkRC )
  1766. return rc;
  1767. p->outSrate = outSrate;
  1768. p->procSmpCnt = procSmpCnt;
  1769. p->wndSmpCnt = wndSmpCnt;
  1770. p->hopSmpCnt = hopSmpCnt;
  1771. p->binCnt = wndSmpCnt / 2 + 1;
  1772. p->minRphV = cmMemResizeZ( cmReal_t, p->minRphV, p->binCnt );
  1773. p->maxRphV = cmMemResizeZ( cmReal_t, p->maxRphV, p->binCnt );
  1774. p->itrV = cmMemResizeZ( cmReal_t, p->itrV, p->binCnt );
  1775. p->phs0V = cmMemResizeZ( cmReal_t, p->phs0V, p->binCnt );
  1776. p->phsV = cmMemResizeZ( cmReal_t, p->phsV, p->binCnt );
  1777. p->mag0V = cmMemResizeZ( cmReal_t, p->mag0V, p->binCnt );
  1778. p->magV = cmMemResizeZ( cmReal_t, p->magV, p->binCnt );
  1779. if((rc = cmWndFuncInit( &p->wf, wndTypeId, wndSmpCnt, 0)) != cmOkRC )
  1780. return rc;
  1781. if((rc = cmIFftInitRS( &p->ft, p->binCnt )) != cmOkRC )
  1782. return rc;
  1783. if((rc = cmOlaInit( &p->ola, wndSmpCnt, hopSmpCnt, procSmpCnt, wndTypeId )) != cmOkRC )
  1784. return rc;
  1785. for(k=0; k<p->binCnt; ++k)
  1786. {
  1787. // complete revolutions per hop in radians
  1788. p->itrV[k] = twoPi * floor((double)k * hopSmpCnt / wndSmpCnt );
  1789. p->minRphV[k] = ((cmReal_t)(k-m)) * hopSmpCnt * twoPi / wndSmpCnt;
  1790. p->maxRphV[k] = ((cmReal_t)(k+m)) * hopSmpCnt * twoPi / wndSmpCnt;
  1791. //printf("%f %f %f\n",p->itrV[k],p->minRphV[k],p->maxRphV[k]);
  1792. }
  1793. return rc;
  1794. }
  1795. cmRC_t cmPvSynFinal(cmPvSyn* p )
  1796. { return cmOkRC; }
  1797. cmRC_t cmPvSynExec( cmPvSyn* p, const cmReal_t* magV, const cmReal_t* phsV )
  1798. {
  1799. double twoPi = 2.0 * M_PI;
  1800. unsigned k;
  1801. for(k=0; k<p->binCnt; ++k)
  1802. {
  1803. // phase dist between cur and prv frame
  1804. cmReal_t dp = phsV[k] - p->phs0V[k];
  1805. // dist must be positive (accum phase always increases)
  1806. if( dp < -0.00001 )
  1807. dp += twoPi;
  1808. // add in complete revolutions based on the bin frequency
  1809. // (these would have been lost from 'dp' due to phase wrap)
  1810. dp += p->itrV[k];
  1811. // constrain the phase change to lie within the range of the kth bin
  1812. if( dp < p->minRphV[k] )
  1813. dp += twoPi;
  1814. if( dp > p->maxRphV[k] )
  1815. dp -= twoPi;
  1816. p->phsV[k] = p->phs0V[k] + dp;
  1817. p->magV[k] = p->mag0V[k];
  1818. p->phs0V[k] = phsV[k];
  1819. p->mag0V[k] = magV[k];
  1820. }
  1821. cmIFftExecPolarRS( &p->ft, magV, phsV );
  1822. cmOlaExecS( &p->ola, p->ft.outV, p->ft.outN );
  1823. //printf("%i %i\n",p->binCnt,p->ft.binCnt );
  1824. //cmVOR_Print( p->obj.ctx->outFuncPtr, 1, p->binCnt, magV );
  1825. //cmVOR_Print( p->obj.ctx->outFuncPtr, 1, p->binCnt, p->phsV );
  1826. //cmVOS_Print( p->obj.ctx->outFuncPtr, 1, 10, p->ft.outV );
  1827. return cmOkRC;
  1828. }
  1829. cmRC_t cmPvSynDoIt( cmPvSyn* p, const cmSample_t* v )
  1830. {
  1831. cmOlaExecS( &p->ola, v, p->wndSmpCnt );
  1832. //printf("%f\n",cmVOS_RMS(s,p->wndSmpCnt,p->wndSmpCnt));
  1833. return cmOkRC;
  1834. }
  1835. const cmSample_t* cmPvSynExecOut(cmPvSyn* p )
  1836. { return cmOlaExecOut(&p->ola); }
  1837. //------------------------------------------------------------------------------------------------------------
  1838. cmMidiSynth* cmMidiSynthAlloc( cmCtx* ctx, cmMidiSynth* ap, const cmMidiSynthPgm* pgmArray, unsigned pgmCnt, unsigned voiceCnt, unsigned procSmpCnt, unsigned outChCnt, cmReal_t srate )
  1839. {
  1840. cmMidiSynth* p = cmObjAlloc( cmMidiSynth, ctx, ap );
  1841. if( pgmArray != NULL )
  1842. if( cmMidiSynthInit( p, pgmArray, pgmCnt, voiceCnt, procSmpCnt, outChCnt, srate ) != cmOkRC )
  1843. cmMidiSynthFree(&p);
  1844. return p;
  1845. }
  1846. cmRC_t cmMidiSynthFree( cmMidiSynth** pp )
  1847. {
  1848. cmRC_t rc;
  1849. if( pp==NULL || *pp==NULL)
  1850. return cmOkRC;
  1851. cmMidiSynth* p = *pp;
  1852. if((rc = cmMidiSynthFinal(p)) != cmOkRC )
  1853. return rc;
  1854. cmMemPtrFree(&p->voiceArray);
  1855. cmMemPtrFree(&p->outM);
  1856. cmMemPtrFree(&p->outChArray);
  1857. cmObjFree(pp);
  1858. return cmOkRC;
  1859. }
  1860. cmRC_t cmMidiSynthInit( cmMidiSynth* p, const cmMidiSynthPgm* pgmArray, unsigned pgmCnt, unsigned voiceCnt, unsigned procSmpCnt, unsigned outChCnt, cmReal_t srate )
  1861. {
  1862. // at least one pgm must be given
  1863. assert( pgmCnt > 0 );
  1864. unsigned i;
  1865. cmRC_t rc;
  1866. if((rc = cmMidiSynthFinal(p)) != cmOkRC )
  1867. return rc;
  1868. p->voiceArray = cmMemResizeZ( cmMidiVoice, p->voiceArray, voiceCnt );
  1869. p->outM = cmMemResizeZ( cmSample_t, p->outM, outChCnt * procSmpCnt );
  1870. p->outChArray = cmMemResizeZ( cmSample_t*, p->outChArray, outChCnt );
  1871. p->avail = p->voiceArray;
  1872. p->voiceCnt = voiceCnt;
  1873. p->activeVoiceCnt = 0;
  1874. p->voiceStealCnt = 0;
  1875. p->procSmpCnt = procSmpCnt;
  1876. p->outChCnt = outChCnt;
  1877. p->srate = srate;
  1878. for(i=0; i<outChCnt; ++i)
  1879. p->outChArray[i] = p->outM + (i*procSmpCnt);
  1880. for(i=0; i<kMidiChCnt; ++i)
  1881. {
  1882. p->chArray[i].pgm = 0;
  1883. p->chArray[i].active = NULL;
  1884. p->chArray[i].pitchBend = 0;
  1885. p->chArray[i].synthPtr = p;
  1886. memset(p->chArray[i].midiCtl, 0, kMidiCtlCnt * sizeof(cmMidiByte_t));
  1887. }
  1888. for(i=0; i<voiceCnt; ++i)
  1889. {
  1890. p->voiceArray[i].index = i;
  1891. p->voiceArray[i].flags = 0;
  1892. p->voiceArray[i].pitch = kInvalidMidiPitch;
  1893. p->voiceArray[i].velocity = kInvalidMidiVelocity;
  1894. p->voiceArray[i].pgm.pgm = kInvalidMidiPgm;
  1895. p->voiceArray[i].pgm.cbPtr = NULL;
  1896. p->voiceArray[i].pgm.cbDataPtr = NULL;
  1897. p->voiceArray[i].chPtr = NULL;
  1898. p->voiceArray[i].link = i<voiceCnt-1 ? p->voiceArray + i + 1 : NULL;
  1899. }
  1900. for(i=0; i<pgmCnt; ++i)
  1901. {
  1902. unsigned idx = pgmArray[i].pgm;
  1903. if( idx >= kMidiPgmCnt )
  1904. rc = cmCtxRtCondition( &p->obj, cmArgAssertRC, "MIDI program change values must be less than %i.",kMidiPgmCnt);
  1905. else
  1906. {
  1907. p->pgmArray[ idx ].cbPtr = pgmArray[i].cbPtr;
  1908. p->pgmArray[ idx ].cbDataPtr = pgmArray[i].cbDataPtr;
  1909. p->pgmArray[ idx ].pgm = idx;
  1910. }
  1911. }
  1912. return rc;
  1913. }
  1914. cmRC_t cmMidiSynthFinal( cmMidiSynth* p )
  1915. { return cmOkRC; }
  1916. cmRC_t _cmMidiSynthOnNoteOn( cmMidiSynth* p, cmMidiByte_t ch, cmMidiByte_t pitch, cmMidiByte_t vel )
  1917. {
  1918. assert( ch < kMidiChCnt );
  1919. if( p->activeVoiceCnt == p->voiceCnt )
  1920. {
  1921. ++p->voiceStealCnt;
  1922. return cmOkRC;
  1923. }
  1924. assert( p->avail != NULL );
  1925. cmMidiSynthCh* chPtr = p->chArray + ch;
  1926. cmMidiVoice* vp = p->avail;
  1927. ++p->activeVoiceCnt;
  1928. // update avail
  1929. p->avail = p->avail->link;
  1930. // update active
  1931. vp->flags |= kActiveMsFl | kKeyGateMsFl;
  1932. vp->pitch = pitch;
  1933. vp->velocity = vel;
  1934. vp->pgm = p->pgmArray[ chPtr->pgm ];
  1935. vp->chPtr = chPtr;
  1936. vp->link = chPtr->active;
  1937. chPtr->active = vp;
  1938. vp->pgm.cbPtr( vp, kAttackMsId, NULL, 0 );
  1939. return cmOkRC;
  1940. }
  1941. cmRC_t _cmMidiSynthOnNoteOff( cmMidiSynth* p, cmMidiByte_t ch, cmMidiByte_t pitch, cmMidiByte_t vel )
  1942. {
  1943. assert( ch < kMidiChCnt );
  1944. cmMidiSynthCh* cp = p->chArray + ch;
  1945. cmMidiVoice* vp = cp->active;
  1946. // find the voice for the given pitch
  1947. while( vp != NULL )
  1948. {
  1949. if( (vp->pitch == pitch) && (cmIsFlag(vp->flags,kKeyGateMsFl)==true) )
  1950. break;
  1951. vp = vp->link;
  1952. }
  1953. // if no voice had a key down on this pitch
  1954. if( vp == NULL )
  1955. {
  1956. return cmOkRC;
  1957. }
  1958. // mark the key as 'up'
  1959. vp->flags = cmClrFlag(vp->flags,kKeyGateMsFl);
  1960. // if the sustain pedal is up
  1961. if( cp->midiCtl[ kSustainCtlMdId ] == 0 )
  1962. vp->pgm.cbPtr( vp, kReleaseMsId, NULL, 0 );
  1963. return cmOkRC;
  1964. }
  1965. cmRC_t _cmMidiSynthOnCtl( cmMidiSynth* p, cmMidiByte_t ch, cmMidiByte_t ctlId, cmMidiByte_t ctlValue )
  1966. {
  1967. assert( ch < kMidiChCnt && ctlId < kMidiCtlCnt );
  1968. cmMidiSynthCh* cp = p->chArray + ch;
  1969. cp->midiCtl[ ctlId ] = ctlValue;
  1970. // if the sustain pedal is going up
  1971. if( ctlId == kSustainCtlMdId && ctlValue == 0 )
  1972. {
  1973. cmMidiVoice* vp = cp->active;
  1974. while(vp != NULL)
  1975. {
  1976. if( cmIsFlag(vp->flags,kKeyGateMsFl)==false )
  1977. vp->pgm.cbPtr(vp, kReleaseMsId, NULL, 0 );
  1978. vp = vp->link;
  1979. }
  1980. }
  1981. //printf("%i %i %f\n",ctlId,ctlValue,ctlValue/127.0);
  1982. return cmOkRC;
  1983. }
  1984. cmRC_t cmMidiSynthOnMidi( cmMidiSynth* p, const cmMidiPacket_t* pktArray, unsigned pktCnt )
  1985. {
  1986. unsigned i=0;
  1987. for(i=0; i<pktCnt; ++i)
  1988. if( pktArray[i].msgArray != NULL )
  1989. {
  1990. unsigned j;
  1991. for(j=0; j<pktArray[i].msgCnt; ++j)
  1992. {
  1993. const cmMidiMsg* mp = pktArray[i].msgArray + j;
  1994. cmMidiByte_t ch = mp->status & 0x0f;
  1995. cmMidiByte_t status = mp->status & 0xf0;
  1996. switch( status )
  1997. {
  1998. case kNoteOnMdId:
  1999. if( mp->d1 != 0 )
  2000. {
  2001. _cmMidiSynthOnNoteOn(p,ch,mp->d0,mp->d1);
  2002. break;
  2003. }
  2004. // fall through
  2005. case kNoteOffMdId:
  2006. _cmMidiSynthOnNoteOff(p,ch,mp->d0,mp->d1);
  2007. break;
  2008. case kPolyPresMdId:
  2009. break;
  2010. case kCtlMdId:
  2011. _cmMidiSynthOnCtl( p, ch, mp->d0, mp->d1 );
  2012. break;
  2013. case kPgmMdId:
  2014. break;
  2015. case kChPresMdId:
  2016. break;
  2017. case kPbendMdId:
  2018. break;
  2019. default:
  2020. printf("Unknown MIDI status:%i %i\n",(int)status,(int)mp->status);
  2021. break;
  2022. }
  2023. }
  2024. }
  2025. return cmOkRC;
  2026. }
  2027. cmRC_t cmMidiSynthExec( cmMidiSynth* p, cmSample_t* outChArray[], unsigned outChCnt )
  2028. {
  2029. unsigned i;
  2030. cmSample_t** chArray = outChArray == NULL ? p->outChArray : outChArray;
  2031. unsigned chCnt = outChArray == NULL ? p->outChCnt : outChCnt;
  2032. // FIX: make one active chain attached to cmMidiSynth rather than many
  2033. // active chains attached to each channel - this will avoid the extra
  2034. // iterations below.
  2035. // for each channel
  2036. for(i=0; i<kMidiChCnt; ++i)
  2037. {
  2038. cmMidiVoice* vp = p->chArray[i].active;
  2039. cmMidiVoice* prv = NULL;
  2040. // for each voice assigned to this channel
  2041. while(vp != NULL)
  2042. {
  2043. // tell the voice to perform its DSP function - returns 0 if the voice is no longer active
  2044. if( vp->pgm.cbPtr( vp, kDspMsId, chArray, chCnt ) )
  2045. {
  2046. prv = vp;
  2047. vp = vp->link;
  2048. }
  2049. else
  2050. {
  2051. cmMidiVoice* nvp = vp->link;
  2052. // remove vp from the active chain
  2053. if( prv != NULL )
  2054. prv->link = vp->link;
  2055. else
  2056. {
  2057. assert( vp == p->chArray[i].active );
  2058. // vp is first recd on active chain, nvp becomes first ...
  2059. p->chArray[i].active = vp->link;
  2060. prv = NULL; // ... so prv must be NULL
  2061. }
  2062. // insert this voice on the available chain
  2063. vp->link = p->avail;
  2064. p->avail = vp;
  2065. --p->activeVoiceCnt;
  2066. vp = nvp;
  2067. }
  2068. }
  2069. }
  2070. return cmOkRC;
  2071. }
  2072. //------------------------------------------------------------------------------------------------------------
  2073. cmWtVoice* cmWtVoiceAlloc( cmCtx* ctx, cmWtVoice* ap, unsigned procSmpCnt, cmReal_t hz )
  2074. {
  2075. cmWtVoice* p = cmObjAlloc( cmWtVoice, ctx, ap );
  2076. if( procSmpCnt != 0 )
  2077. if( cmWtVoiceInit( p, procSmpCnt, hz ) != cmOkRC )
  2078. cmWtVoiceFree(&p);
  2079. return p;
  2080. }
  2081. cmRC_t cmWtVoiceFree( cmWtVoice** pp )
  2082. {
  2083. cmRC_t rc = cmOkRC;
  2084. if( pp==NULL || *pp==NULL )
  2085. return cmOkRC;
  2086. cmWtVoice* p = *pp;
  2087. if((rc = cmWtVoiceFinal(p)) != cmOkRC )
  2088. return rc;
  2089. cmMemPtrFree(&p->outV);
  2090. cmObjFree(pp);
  2091. return rc;
  2092. }
  2093. cmRC_t cmWtVoiceInit( cmWtVoice* p, unsigned procSmpCnt, cmReal_t hz )
  2094. {
  2095. p->outV = cmMemResizeZ( cmSample_t, p->outV, procSmpCnt );
  2096. p->outN = procSmpCnt;
  2097. p->hz = hz;
  2098. p->level = 0;
  2099. p->durSmpCnt = 0;
  2100. p->phase = 0;
  2101. p->state = kOffWtId;
  2102. return cmOkRC;
  2103. }
  2104. cmRC_t cmWtVoiceFinal( cmWtVoice* p )
  2105. { return cmOkRC; }
  2106. int cmWtVoiceExec( cmWtVoice* p, struct cmMidiVoice_str* mvp, unsigned sel, cmSample_t* outChArray[], unsigned outChCnt )
  2107. {
  2108. switch( sel )
  2109. {
  2110. case kAttackMsId:
  2111. p->state = kAtkWtId;
  2112. p->hz = (13.75 * pow(2,(-9.0/12.0))) * pow(2,((double)mvp->pitch / 12));
  2113. //printf("%fhz\n",p->hz);
  2114. break;
  2115. case kReleaseMsId:
  2116. p->state = kRlsWtId;
  2117. //printf("rls:%f\n",p->phase);
  2118. break;
  2119. case kDspMsId:
  2120. {
  2121. if( p->state == kRlsWtId )
  2122. {
  2123. p->state = kOffWtId;
  2124. return 0;
  2125. }
  2126. cmMidiSynth* sp = mvp->chPtr->synthPtr;
  2127. cmSample_t* dp = outChCnt == 0 ? p->outV : outChArray[0];
  2128. cmSample_t* ep = dp + p->outN;
  2129. cmReal_t rps = (2.0 * M_PI * p->hz) / sp->srate;
  2130. cmReal_t sum=0;
  2131. unsigned i=0;
  2132. for(; dp < ep; ++dp)
  2133. {
  2134. *dp += (cmSample_t)(0.5 * sin( p->phase ));
  2135. sum += *dp;
  2136. ++i;
  2137. p->phase += rps;
  2138. }
  2139. //printf("(%f %f %i %i %p) ",p->phase,sum,i,p->outN,outChArray[0] );
  2140. }
  2141. break;
  2142. default:
  2143. assert(0);
  2144. break;
  2145. }
  2146. return 1;
  2147. }
  2148. //------------------------------------------------------------------------------------------------------------
  2149. cmWtVoiceBank* cmWtVoiceBankAlloc( cmCtx* ctx, cmWtVoiceBank* ap, double srate, unsigned procSmpCnt, unsigned voiceCnt, unsigned chCnt )
  2150. {
  2151. cmWtVoiceBank* p = cmObjAlloc( cmWtVoiceBank, ctx, ap );
  2152. if( srate != 0 )
  2153. if( cmWtVoiceBankInit( p, srate, procSmpCnt, voiceCnt, chCnt ) != cmOkRC )
  2154. cmWtVoiceBankFree(&p);
  2155. return p;
  2156. }
  2157. cmRC_t cmWtVoiceBankFree( cmWtVoiceBank** pp )
  2158. {
  2159. cmRC_t rc;
  2160. if( pp==NULL || *pp==NULL)
  2161. return cmOkRC;
  2162. cmWtVoiceBank* p = *pp;
  2163. if((rc = cmWtVoiceBankFinal(p)) != cmOkRC )
  2164. return rc;
  2165. cmMemPtrFree(&p->voiceArray);
  2166. cmMemPtrFree(&p->chArray);
  2167. cmMemPtrFree(&p->buf);
  2168. cmObjFree(pp);
  2169. return rc;
  2170. }
  2171. cmRC_t cmWtVoiceBankInit( cmWtVoiceBank* p, double srate, unsigned procSmpCnt, unsigned voiceCnt, unsigned chCnt )
  2172. {
  2173. cmRC_t rc;
  2174. unsigned i;
  2175. if((rc = cmWtVoiceBankFinal(p)) != cmOkRC )
  2176. return rc;
  2177. p->voiceArray = cmMemResizeZ( cmWtVoice*, p->voiceArray, voiceCnt );
  2178. for(i=0; i<voiceCnt; ++i)
  2179. p->voiceArray[i] = cmWtVoiceAlloc(p->obj.ctx,NULL,procSmpCnt,0);
  2180. p->voiceCnt = voiceCnt;
  2181. p->buf = cmMemResizeZ( cmSample_t, p->buf, chCnt * procSmpCnt );
  2182. p->chArray = cmMemResizeZ( cmSample_t*, p->chArray, chCnt );
  2183. for(i=0; i<chCnt; ++i)
  2184. p->chArray[i] = p->buf + (i*procSmpCnt);
  2185. p->chCnt = chCnt;
  2186. p->procSmpCnt = procSmpCnt;
  2187. return cmOkRC;
  2188. }
  2189. cmRC_t cmWtVoiceBankFinal( cmWtVoiceBank* p )
  2190. {
  2191. unsigned i;
  2192. for(i=0; i<p->voiceCnt; ++i)
  2193. cmWtVoiceFree(&p->voiceArray[i]);
  2194. return cmOkRC;
  2195. }
  2196. int cmWtVoiceBankExec( cmWtVoiceBank* p, struct cmMidiVoice_str* voicePtr, unsigned sel, cmSample_t* outChArray[], unsigned outChCnt )
  2197. {
  2198. cmWtVoice* vp = p->voiceArray[ voicePtr->index ];
  2199. bool fl = outChArray==NULL || outChCnt==0;
  2200. cmSample_t** chArray = fl ? p->chArray : outChArray;
  2201. unsigned chCnt = fl ? p->chCnt : outChCnt;
  2202. return cmWtVoiceExec( vp, voicePtr, sel, chArray, chCnt );
  2203. }
  2204. //------------------------------------------------------------------------------------------------------------
  2205. cmAudioFileBuf* cmAudioFileBufAlloc( cmCtx* ctx, cmAudioFileBuf* ap, unsigned procSmpCnt, const char* fn, unsigned audioChIdx, unsigned begSmpIdx, unsigned durSmpCnt )
  2206. {
  2207. cmAudioFileBuf* p = cmObjAlloc( cmAudioFileBuf, ctx, ap );
  2208. if( procSmpCnt != 0 )
  2209. if( cmAudioFileBufInit( p, procSmpCnt, fn, audioChIdx, begSmpIdx, durSmpCnt ) != cmOkRC )
  2210. cmAudioFileBufFree(&p);
  2211. return p;
  2212. }
  2213. cmRC_t cmAudioFileBufFree( cmAudioFileBuf** pp )
  2214. {
  2215. cmRC_t rc;
  2216. if( pp==NULL || *pp==NULL)
  2217. return cmOkRC;
  2218. cmAudioFileBuf* p = *pp;
  2219. if((rc = cmAudioFileBufFinal(p)) != cmOkRC )
  2220. return rc;
  2221. cmMemPtrFree(&p->bufV);
  2222. cmMemPtrFree(&p->fn);
  2223. cmObjFree(pp);
  2224. return rc;
  2225. }
  2226. cmRC_t cmAudioFileBufInit( cmAudioFileBuf* p, unsigned procSmpCnt, const char* fn, unsigned audioChIdx, unsigned begSmpIdx, unsigned durSmpCnt )
  2227. {
  2228. cmAudioFileH_t afH;
  2229. cmRC_t rc;
  2230. if((rc = cmAudioFileBufFinal(p)) != cmOkRC )
  2231. return rc;
  2232. // open the audio file for reading
  2233. if( cmAudioFileIsValid( afH = cmAudioFileNewOpen( fn, &p->info, &rc, p->obj.err.rpt ))==false || rc != kOkAfRC )
  2234. return cmCtxRtCondition(&p->obj, cmArgAssertRC,"The audio file '%s' could not be opend.",fn );
  2235. // validate the audio channel
  2236. if( audioChIdx >= p->info.chCnt )
  2237. return cmCtxRtCondition(&p->obj, cmArgAssertRC,"The audio file channel index %i is out of range for the audio file '%s'.",audioChIdx,fn);
  2238. // validate the start sample index
  2239. if( begSmpIdx > p->info.frameCnt )
  2240. return cmCtxRtCondition(&p->obj, cmOkRC, "The start sample index %i is past the end of the audio file '%s'.",begSmpIdx,fn);
  2241. if( durSmpCnt == cmInvalidCnt )
  2242. durSmpCnt = p->info.frameCnt - begSmpIdx;
  2243. // validate the duration
  2244. if( begSmpIdx + durSmpCnt > p->info.frameCnt )
  2245. {
  2246. unsigned newDurSmpCnt = p->info.frameCnt - begSmpIdx;
  2247. cmCtxRtCondition(&p->obj, cmOkRC, "The selected sample duration %i is past the end of the audio file '%s' and has been shorted to %i samples.",durSmpCnt,fn,newDurSmpCnt);
  2248. durSmpCnt = newDurSmpCnt;
  2249. }
  2250. // seek to the starting sample
  2251. if( cmAudioFileSeek( afH, begSmpIdx ) != kOkAfRC )
  2252. return cmCtxRtCondition(&p->obj, cmArgAssertRC,"Seek to sample index %i failed on the audio file '%s'.",begSmpIdx,fn);
  2253. // allocate the buffer memory
  2254. p->bufV = cmMemResizeZ( cmSample_t, p->bufV, durSmpCnt );
  2255. p->fn = cmMemResize( char, p->fn, strlen(fn)+1 );
  2256. p->bufN = durSmpCnt;
  2257. p->begSmpIdx = begSmpIdx;
  2258. p->chIdx = audioChIdx;
  2259. strcpy(p->fn,fn);
  2260. cmSample_t* outV = p->bufV;
  2261. // read the file into the buffer
  2262. unsigned rdSmpCnt = cmMin(4096,durSmpCnt);
  2263. unsigned cmc = 0;
  2264. while( cmc < durSmpCnt )
  2265. {
  2266. unsigned actualReadCnt = 0;
  2267. unsigned n = rdSmpCnt;
  2268. cmSample_t* chArray[] = {outV};
  2269. if( cmc + n > durSmpCnt )
  2270. n = durSmpCnt - cmc;
  2271. if((rc=cmAudioFileReadSample( afH, n, audioChIdx, 1, chArray, &actualReadCnt)) != kOkAfRC )
  2272. break;
  2273. cmc += actualReadCnt;
  2274. outV += actualReadCnt;
  2275. }
  2276. if( rc==kOkAfRC || (rc != kOkAfRC && cmAudioFileIsEOF(afH)))
  2277. rc = cmOkRC;
  2278. return rc;
  2279. }
  2280. cmRC_t cmAudioFileBufFinal(cmAudioFileBuf* p )
  2281. { return cmOkRC; }
  2282. unsigned cmAudioFileBufExec( cmAudioFileBuf* p, unsigned smpIdx, cmSample_t* outV, unsigned outN, bool sumIntoOutFl )
  2283. {
  2284. if( outV == NULL || outN == 0 || smpIdx >= p->bufN )
  2285. return 0;
  2286. unsigned n = cmMin(outN,p->bufN-smpIdx);
  2287. if( sumIntoOutFl )
  2288. cmVOS_AddVV(outV,n,p->bufV + smpIdx);
  2289. else
  2290. cmVOS_Copy(outV,n,p->bufV + smpIdx );
  2291. if( n < outN )
  2292. memset(outV+n,0,(outN-n)*sizeof(cmSample_t));
  2293. return n;
  2294. }
  2295. //------------------------------------------------------------------------------------------------------------
  2296. cmMDelay* cmMDelayAlloc( cmCtx* ctx, cmMDelay* ap, unsigned procSmpCnt, cmReal_t srate, cmReal_t fbCoeff, unsigned delayCnt, const cmReal_t* delayMsArray, const cmReal_t* delayGainArray )
  2297. {
  2298. cmMDelay* p = cmObjAlloc( cmMDelay, ctx, ap );
  2299. if( procSmpCnt != 0 )
  2300. if( cmMDelayInit( p, procSmpCnt, srate, fbCoeff, delayCnt, delayMsArray, delayGainArray ) != cmOkRC )
  2301. cmMDelayFree(&p);
  2302. return p;
  2303. }
  2304. cmRC_t cmMDelayFree( cmMDelay** pp )
  2305. {
  2306. cmRC_t rc;
  2307. if( pp == NULL || *pp==NULL)
  2308. return cmOkRC;
  2309. cmMDelay* p = *pp;
  2310. if((rc = cmMDelayFinal(p)) != cmOkRC )
  2311. return rc;
  2312. unsigned i;
  2313. for(i=0; i<p->delayCnt; ++i)
  2314. cmMemPtrFree(&p->delayArray[i].delayBuf);
  2315. cmMemPtrFree(&p->delayArray);
  2316. cmMemPtrFree(&p->outV);
  2317. cmObjFree(pp);
  2318. return cmOkRC;
  2319. }
  2320. cmRC_t cmMDelayInit( cmMDelay* p, unsigned procSmpCnt, cmReal_t srate, cmReal_t fbCoeff, unsigned delayCnt, const cmReal_t* delayMsArray, const cmReal_t* delayGainArray )
  2321. {
  2322. cmRC_t rc;
  2323. if((rc = cmMDelayFinal(p)) != cmOkRC )
  2324. return rc;
  2325. if( delayCnt <= 0 )
  2326. return rc;
  2327. p->delayArray = cmMemResizeZ( cmMDelayHead, p->delayArray, delayCnt );
  2328. unsigned i;
  2329. for(i=0; i<delayCnt; ++i)
  2330. {
  2331. p->delayArray[i].delayGain = delayGainArray == NULL ? 1.0 : delayGainArray[i];
  2332. p->delayArray[i].delayMs = delayMsArray[i];
  2333. p->delayArray[i].delaySmpFrac = delayMsArray[i] * srate / 1000.0;
  2334. p->delayArray[i].delayBufSmpCnt = ceil(delayMsArray[i] * srate / 1000)+2;
  2335. p->delayArray[i].delayBuf = cmMemResizeZ( cmSample_t, p->delayArray[i].delayBuf, p->delayArray[i].delayBufSmpCnt );
  2336. p->delayArray[i].inIdx = 0;
  2337. }
  2338. p->delayCnt= delayCnt;
  2339. p->outV = cmMemResizeZ( cmSample_t, p->outV, procSmpCnt );
  2340. p->outN = procSmpCnt;
  2341. p->fbCoeff = fbCoeff;
  2342. p->srate = srate;
  2343. return cmOkRC;
  2344. }
  2345. cmRC_t cmMDelayFinal( cmMDelay* p )
  2346. { return cmOkRC; }
  2347. void _cmMDelayExec( cmMDelay* p, cmMDelayHead* hp, const cmSample_t inV[], cmSample_t outV[], unsigned sigN )
  2348. {
  2349. cmSample_t* dl = hp->delayBuf; // ptr to the base of the delay line
  2350. cmReal_t dfi = (cmReal_t)(hp->inIdx - hp->delaySmpFrac) + hp->delayBufSmpCnt; // fractional delay in samples
  2351. int dii0 = ((int)dfi) % hp->delayBufSmpCnt; // index to the sample just before the delay position
  2352. int dii1 = (dii0 + 1) % hp->delayBufSmpCnt; // index to the sample just after the delay position
  2353. //cmReal_t frac = 0; //dfi - dii0; // interpolation coeff.
  2354. unsigned i;
  2355. for(i=0; i<sigN; i++)
  2356. {
  2357. /*
  2358. outPtr[i] = -(((f+0)*(f-1)*(f-2)/6) * _wtPtr[iPhs0])
  2359. +(((f+1)*(f-1)*(f-2)/2) * _wtPtr[iPhs0+1])
  2360. -(((f+1)*(f-0)*(f-2)/2) * _wtPtr[iPhs0+2])
  2361. +(((f+1)*(f-0)*(f-1)/6) * _wtPtr[iPhs0+3]);
  2362. */
  2363. cmSample_t outSmp = dl[dii0]; // + (frac * (dl[dii1]-dl[dii0]));
  2364. outV[i] += outSmp/p->delayCnt;
  2365. dl[hp->inIdx] = (p->fbCoeff * outSmp) + inV[i];
  2366. hp->inIdx = (hp->inIdx+1) % hp->delayBufSmpCnt;
  2367. dii0 = (dii0+1) % hp->delayBufSmpCnt;
  2368. dii1 = (dii1+1) % hp->delayBufSmpCnt;
  2369. }
  2370. }
  2371. cmRC_t cmMDelayExec( cmMDelay* p, const cmSample_t* inV, cmSample_t* outV, unsigned sigN, bool bypassFl )
  2372. {
  2373. assert( sigN <= p->outN);
  2374. if( outV == NULL )
  2375. {
  2376. outV = p->outV;
  2377. sigN = cmMin(sigN,p->outN);
  2378. cmVOS_Fill(outV,sigN,0);
  2379. }
  2380. else
  2381. {
  2382. cmVOS_Zero(outV,sigN);
  2383. }
  2384. if( inV == NULL )
  2385. return cmOkRC;
  2386. if( bypassFl )
  2387. {
  2388. memcpy(outV,inV,sigN*sizeof(cmSample_t));
  2389. return cmOkRC;
  2390. }
  2391. unsigned di;
  2392. for( di=0; di<p->delayCnt; ++di)
  2393. {
  2394. cmMDelayHead* hp = p->delayArray + di;
  2395. hp->delaySmpFrac = hp->delayMs * p->srate / 1000.0;
  2396. _cmMDelayExec(p,hp,inV,outV,sigN);
  2397. }
  2398. return cmOkRC;
  2399. }
  2400. void cmMDelaySetTapMs( cmMDelay* p, unsigned tapIdx, cmReal_t ms )
  2401. {
  2402. assert( tapIdx < p->delayCnt );
  2403. p->delayArray[tapIdx].delayMs = ms;
  2404. }
  2405. void cmMDelaySetTapGain(cmMDelay* p, unsigned tapIdx, cmReal_t gain )
  2406. {
  2407. assert( tapIdx < p->delayCnt );
  2408. p->delayArray[tapIdx].delayGain = gain;
  2409. }
  2410. void cmMDelayReport( cmMDelay* p, cmRpt_t* rpt )
  2411. {
  2412. cmRptPrintf(rpt,"tap cnt:%i fb:%f sr:%f\n",p->delayCnt,p->fbCoeff,p->srate);
  2413. }
  2414. //------------------------------------------------------------------------------------------------------------
  2415. cmAudioSegPlayer* cmAudioSegPlayerAlloc( cmCtx* ctx, cmAudioSegPlayer* ap, unsigned procSmpCnt, unsigned outChCnt )
  2416. {
  2417. cmAudioSegPlayer* p = cmObjAlloc( cmAudioSegPlayer, ctx, ap );
  2418. if( procSmpCnt != 0 )
  2419. if( cmAudioSegPlayerInit( p, procSmpCnt, outChCnt ) != cmOkRC )
  2420. cmAudioSegPlayerFree(&p);
  2421. return p;
  2422. }
  2423. cmRC_t cmAudioSegPlayerFree( cmAudioSegPlayer** pp )
  2424. {
  2425. if( pp == NULL || *pp == NULL )
  2426. return cmOkRC;
  2427. cmAudioSegPlayer* p = *pp;
  2428. cmMemPtrFree(&p->segArray);
  2429. cmMemPtrFree(&p->outM);
  2430. cmObjFree(pp);
  2431. return cmOkRC;
  2432. }
  2433. cmRC_t cmAudioSegPlayerInit( cmAudioSegPlayer* p, unsigned procSmpCnt, unsigned outChCnt )
  2434. {
  2435. cmRC_t rc = cmOkRC;
  2436. if((rc = cmAudioSegPlayerFinal(p)) != cmOkRC )
  2437. return rc;
  2438. p->procSmpCnt = procSmpCnt;
  2439. p->outChCnt = outChCnt;
  2440. p->segCnt = 0;
  2441. if( outChCnt )
  2442. {
  2443. unsigned i;
  2444. p->outM = cmMemResizeZ( cmSample_t, p->outM, procSmpCnt * outChCnt );
  2445. p->outChArray = cmMemResizeZ( cmSample_t*, p->outChArray, outChCnt );
  2446. for(i=0; i<outChCnt; ++i)
  2447. p->outChArray[i] = p->outM + (i*procSmpCnt);
  2448. }
  2449. return rc;
  2450. }
  2451. cmRC_t cmAudioSegPlayerFinal( cmAudioSegPlayer* p )
  2452. { return cmOkRC; }
  2453. cmRC_t _cmAudioSegPlayerSegSetup( cmAudioSeg* sp, unsigned id, cmAudioFileBuf* bufPtr, unsigned smpIdx, unsigned smpCnt, unsigned outChIdx )
  2454. {
  2455. sp->bufPtr = bufPtr;
  2456. sp->id = id;
  2457. sp->smpIdx = smpIdx;
  2458. sp->smpCnt = smpCnt;
  2459. sp->outChIdx = outChIdx;
  2460. sp->outSmpIdx = 0;
  2461. sp->flags = 0;
  2462. return cmOkRC;
  2463. }
  2464. cmAudioSeg* _cmAudioSegPlayerIdToSegPtr( cmAudioSegPlayer* p, unsigned id, bool ignoreErrFl )
  2465. {
  2466. unsigned i = 0;
  2467. for(i=0; i<p->segCnt; ++i)
  2468. if( p->segArray[i].id == id )
  2469. return p->segArray + i;
  2470. if( !ignoreErrFl )
  2471. cmCtxRtCondition(&p->obj, cmArgAssertRC,"Unable to locate an audio segment with id=%i.",id);
  2472. return NULL;
  2473. }
  2474. cmRC_t cmAudioSegPlayerInsert( cmAudioSegPlayer* p, unsigned id, cmAudioFileBuf* bufPtr, unsigned smpIdx, unsigned smpCnt, unsigned outChIdx )
  2475. {
  2476. cmRC_t rc;
  2477. assert( _cmAudioSegPlayerIdToSegPtr( p, id, true ) == NULL );
  2478. p->segArray = cmMemResizePZ( cmAudioSeg, p->segArray, p->segCnt + 1 );
  2479. cmAudioSeg* sp = p->segArray + p->segCnt;
  2480. if((rc = _cmAudioSegPlayerSegSetup( sp, id, bufPtr, smpIdx, smpCnt, outChIdx )) == cmOkRC )
  2481. ++p->segCnt;
  2482. return rc;
  2483. }
  2484. cmRC_t cmAudioSegPlayerEdit( cmAudioSegPlayer* p, unsigned id, cmAudioFileBuf* bufPtr, unsigned smpIdx, unsigned smpCnt, unsigned outChIdx )
  2485. {
  2486. cmAudioSeg* sp = _cmAudioSegPlayerIdToSegPtr(p,id,false);
  2487. return _cmAudioSegPlayerSegSetup( sp, id, bufPtr, smpIdx, smpCnt, outChIdx );
  2488. }
  2489. cmRC_t cmAudioSegPlayerRemove( cmAudioSegPlayer* p, unsigned id, bool delFl )
  2490. {
  2491. cmAudioSeg* sp = _cmAudioSegPlayerIdToSegPtr(p,id,false);
  2492. if( sp == NULL )
  2493. return cmArgAssertRC;
  2494. sp->flags = cmEnaFlag( sp->flags, kDelAspFl, delFl );
  2495. return cmOkRC;
  2496. }
  2497. cmRC_t cmAudioSegPlayerEnable( cmAudioSegPlayer* p, unsigned id, bool enableFl, unsigned outSmpIdx )
  2498. {
  2499. cmAudioSeg* sp = _cmAudioSegPlayerIdToSegPtr(p,id,false);
  2500. if( sp == NULL )
  2501. return cmArgAssertRC;
  2502. if( outSmpIdx != cmInvalidIdx )
  2503. sp->outSmpIdx = outSmpIdx;
  2504. sp->flags = cmEnaFlag( sp->flags, kEnableAspFl, enableFl );
  2505. return cmOkRC;
  2506. }
  2507. void _cmAudioSegPlayerResetSeg( cmAudioSeg* sp )
  2508. {
  2509. sp->outSmpIdx = 0;
  2510. sp->flags = cmClrFlag(sp->flags, kEnableAspFl );
  2511. }
  2512. cmRC_t cmAudioSegPlayerReset( cmAudioSegPlayer* p )
  2513. {
  2514. unsigned i;
  2515. for(i=0; i<p->segCnt; ++i)
  2516. {
  2517. cmAudioSeg* sp = p->segArray + i;
  2518. _cmAudioSegPlayerResetSeg(sp);
  2519. }
  2520. return cmOkRC;
  2521. }
  2522. cmRC_t cmAudioSegPlayerExec( cmAudioSegPlayer* p, cmSample_t** outChPtr, unsigned outChCnt, unsigned procSmpCnt )
  2523. {
  2524. unsigned i;
  2525. if( outChPtr == NULL || outChCnt == 0 )
  2526. {
  2527. assert( p->outChCnt > 0 );
  2528. outChPtr = p->outChArray;
  2529. outChCnt = p->outChCnt;
  2530. assert( p->procSmpCnt <= procSmpCnt );
  2531. }
  2532. for(i=0; i<p->segCnt; ++i)
  2533. {
  2534. cmAudioSeg* sp = p->segArray + i;
  2535. // if the output channel is valid and the segment is enabled and not deleted
  2536. if( sp->outChIdx < outChCnt && (sp->flags & (kEnableAspFl | kDelAspFl)) == kEnableAspFl )
  2537. {
  2538. unsigned bufSmpIdx = sp->smpIdx + sp->outSmpIdx;
  2539. unsigned bufSmpCnt = 0;
  2540. // if all the samples have been played
  2541. if( sp->bufPtr->bufN <= bufSmpIdx )
  2542. _cmAudioSegPlayerResetSeg(sp);
  2543. else
  2544. {
  2545. // prevent playing past the end of the buffer
  2546. bufSmpCnt = cmMin( procSmpCnt, sp->bufPtr->bufN - bufSmpIdx );
  2547. // limit the number of samples to the segment length
  2548. bufSmpCnt = cmMin( bufSmpCnt, sp->smpCnt - sp->outSmpIdx );
  2549. // sum the samples into the output channel
  2550. cmVOS_AddVV( outChPtr[ sp->outChIdx ], bufSmpCnt, sp->bufPtr->bufV + bufSmpIdx );
  2551. // incr the next output sample index
  2552. sp->outSmpIdx += bufSmpCnt;
  2553. }
  2554. if( bufSmpCnt < procSmpCnt )
  2555. cmVOS_Zero( outChPtr[ sp->outChIdx ] + bufSmpCnt, procSmpCnt - bufSmpCnt );
  2556. }
  2557. }
  2558. return cmOkRC;
  2559. }
  2560. //------------------------------------------------------------------------------------------------------------
  2561. /*
  2562. cmCluster0* cmCluster0Alloc( cmCtx* ctx, cmCluster0* ap, unsigned stateCnt, unsigned binCnt, unsigned flags, cmCluster0DistFunc_t distFunc, void* dstUserPtr )
  2563. {
  2564. cmCluster0* p = cmObjAlloc( cmCluster0, ctx, ap );
  2565. if( stateCnt != 0 )
  2566. if( cmCluster0Init( p, stateCnt, binCnt, flags, distFunc, distUserPtr ) != cmOkRC )
  2567. cmCluster0Free(&p);
  2568. return p;
  2569. }
  2570. cmRC_t cmCluster0Free( cmCluster0** pp )
  2571. {
  2572. if( pp == NULL || *pp == NULL )
  2573. return cmOkRC;
  2574. cmCluster0* p = *pp;
  2575. cmMemPtrFree(&p->oM);
  2576. cmMemPtrFree(&p->tM);
  2577. cmMemPtrFree(&p->dV);
  2578. cmObjFree(pp);
  2579. return cmOkRC;
  2580. }
  2581. cmRC_t cmCluster0Init( cmCluster0* p, unsigned stateCnt, unsigned binCnt, unsigned flags, cmCluster0DistFunc_t distFunc, void* distUserPtr )
  2582. {
  2583. cmRC_t rc;
  2584. if((rc = cmCluster0Final(p)) != cmOkRC )
  2585. return rc;
  2586. p->oM = cmMemResizeZ( cmReal_t, p->oM, binCnt * stateCnt );
  2587. p->tM = cmMemResizeZ( cmReal_t, p->tM, stateCnt * stateCnt );
  2588. p->stateCnt = stateCnt;
  2589. p->binCnt = binCnt;
  2590. p->flags = flags;
  2591. p->distFunc = distFunc;
  2592. p->distUserPtr = distUserPtr;
  2593. p->cnt = 0;
  2594. }
  2595. cmRC_t cmCluster0Final( cmCluster0* p )
  2596. { return cmOkRC; }
  2597. cmRC_t cmCluster0Exec( cmCluster0* p, const cmReal_t* v, unsigned vn )
  2598. {
  2599. assert( vn <= p->binCnt );
  2600. ++cnt;
  2601. if( cnt <= stateCnt )
  2602. {
  2603. cmVOR_Copy( p->oM + ((cnt-1)*binCnt), vn, v );
  2604. return cmOkRC;
  2605. }
  2606. return cmOkRC;
  2607. }
  2608. */
  2609. cmNmf_t* cmNmfAlloc( cmCtx* ctx, cmNmf_t* ap, unsigned n, unsigned m, unsigned r, unsigned maxIterCnt, unsigned convergeCnt )
  2610. {
  2611. cmNmf_t* p = cmObjAlloc( cmNmf_t, ctx, ap );
  2612. if( n != 0 )
  2613. if( cmNmfInit( p, n, m, r, maxIterCnt, convergeCnt ) != cmOkRC )
  2614. cmNmfFree(&p);
  2615. return p;
  2616. }
  2617. cmRC_t cmNmfFree( cmNmf_t** pp )
  2618. {
  2619. if( pp== NULL || *pp == NULL )
  2620. return cmOkRC;
  2621. cmNmf_t* p = *pp;
  2622. cmMemPtrFree(&p->V);
  2623. cmMemPtrFree(&p->W);
  2624. cmMemPtrFree(&p->H);
  2625. cmMemPtrFree(&p->tr);
  2626. cmMemPtrFree(&p->x);
  2627. cmMemPtrFree(&p->t0nm);
  2628. cmMemPtrFree(&p->t1nm);
  2629. cmMemPtrFree(&p->Wt);
  2630. cmMemPtrFree(&p->trm);
  2631. cmMemPtrFree(&p->crm);
  2632. cmMemPtrFree(&p->c0);
  2633. cmMemPtrFree(&p->c1);
  2634. cmMemPtrFree(&p->idxV);
  2635. cmObjFree(pp);
  2636. return cmOkRC;
  2637. }
  2638. cmRC_t cmNmfInit( cmNmf_t* p, unsigned n, unsigned m, unsigned r, unsigned maxIterCnt, unsigned convergeCnt )
  2639. {
  2640. cmRC_t rc;
  2641. if((rc = cmNmfFinal(p)) != cmOkRC )
  2642. return rc;
  2643. p->n = n;
  2644. p->m = m;
  2645. p->r = r;
  2646. p->maxIterCnt = maxIterCnt;
  2647. p->convergeCnt= convergeCnt;
  2648. p->V = cmMemResizeZ(cmReal_t, p->V, n*m );
  2649. p->W = cmMemResize( cmReal_t, p->W, n*r );
  2650. p->H = cmMemResize( cmReal_t, p->H, r*m );
  2651. p->tr = cmMemResize( cmReal_t, p->tr, r );
  2652. p->x = cmMemResize( cmReal_t, p->x, r*cmMax(m,n) );
  2653. p->t0nm = cmMemResize( cmReal_t, p->t0nm, cmMax(r,n)*m );
  2654. p->Ht = p->t0nm;
  2655. p->t1nm = cmMemResize( cmReal_t, p->t1nm, n*m );
  2656. p->Wt = cmMemResize( cmReal_t, p->Wt, r*n );
  2657. p->trm = cmMemResize( cmReal_t, p->trm, r*cmMax(m,n) );
  2658. p->crm = cmMemResizeZ(unsigned, p->crm, r*m);
  2659. p->tnr = p->trm;
  2660. p->c0 = cmMemResizeZ(unsigned, p->c0, m*m);
  2661. p->c1 = cmMemResizeZ(unsigned, p->c1, m*m);
  2662. p->idxV = cmMemResizeZ(unsigned, p->idxV, m );
  2663. p->c0m = p->c0;
  2664. p->c1m = p->c1;
  2665. cmVOR_Random(p->W,n*r,0.0,1.0);
  2666. cmVOR_Random(p->H,r*m,0.0,1.0);
  2667. return rc;
  2668. }
  2669. cmRC_t cmNmfFinal(cmNmf_t* p )
  2670. { return cmOkRC; }
  2671. // NMF base on: Lee and Seung, 2001, Algo's for Non-negative Matrix Fcmtorization
  2672. // Connectivity stopping technique based on: http://www.broadinstitute.org/mpr/publications/projects/NMF/nmf.m
  2673. cmRC_t cmNmfExec( cmNmf_t* p, const cmReal_t* vM, unsigned cn )
  2674. {
  2675. cmRC_t rc = cmOkRC;
  2676. unsigned i,j,k;
  2677. unsigned n = p->n;
  2678. unsigned m = p->m;
  2679. unsigned r = p->r;
  2680. unsigned stopIter = 0;
  2681. assert(cn <= m );
  2682. // shift in the incoming columns of V[]
  2683. if( cn < m )
  2684. cmVOR_Shift(p->V, n*m, n*cn,0);
  2685. cmVOR_Copy( p->V, n*cn,vM );
  2686. // shift H[] by the same amount as V[]
  2687. if( cn < m )
  2688. cmVOR_Shift( p->H, r*m, r*cn,0);
  2689. cmVOR_Random(p->H, r*cn, 0.0, 1.0 );
  2690. cmVOU_Zero( p->c1m, m*m );
  2691. for(i=0,j=0; i<p->maxIterCnt && stopIter<p->convergeCnt; ++i)
  2692. {
  2693. // x[r,m] =repmat(sum(W,1)',1,m);
  2694. cmVOR_SumM( p->W, n, r, p->tr );
  2695. for(j=0; j<m; ++j)
  2696. cmVOR_Copy( p->x + (j*r), r, p->tr );
  2697. cmVOR_Transpose(p->Wt,p->W,n,r);
  2698. //H=H.*(W'*(V./(W*H)))./x;
  2699. cmVOR_MultMMM(p->t0nm,n,m,p->W,p->H,r); // t0nm[n,m] = W*H
  2700. cmVOR_DivVVV( p->t1nm,n*m,p->V,p->t0nm); // t1nm[n,m] = V./(W*H)
  2701. cmVOR_MultMMM(p->trm,r,m,p->Wt,p->t1nm,n); // trm[r,m] = W'*(V./(W*H))
  2702. cmVOR_MultVV(p->H,r*m,p->trm); // H[r,m] = H .* (W'*(V./(W*H)))
  2703. cmVOR_DivVV(p->H,r*m, p->x ); // H[r,m] = (H .* (W'*(V./(W*H)))) ./ x
  2704. // x[n,r]=repmat(sum(H,2)',n,1);
  2705. cmVOR_SumMN(p->H, r, m, p->tr );
  2706. for(j=0; j<n; ++j)
  2707. cmVOR_CopyN(p->x + j, r, n, p->tr, 1 );
  2708. cmVOR_Transpose(p->Ht,p->H,r,m);
  2709. // W=W.*((V./(W*H))*H')./x;
  2710. cmVOR_MultMMM(p->tnr,n,r,p->t1nm,p->Ht,m); // tnr[n,r] = (V./(W*H))*Ht
  2711. cmVOR_MultVV(p->W,n*r,p->tnr); // W[n,r] = W.*(V./(W*H))*Ht
  2712. cmVOR_DivVV(p->W,n*r,p->x); // W[n,r] = W.*(V./(W*H))*Ht ./x
  2713. if( i % 10 == 0 )
  2714. {
  2715. cmVOR_ReplaceLte( p->H, r*m, p->H, 2.2204e-16, 2.2204e-16 );
  2716. cmVOR_ReplaceLte( p->W, n*r, p->W, 2.2204e-16, 2.2204e-16 );
  2717. cmVOR_MaxIndexM( p->idxV, p->H, r, m );
  2718. unsigned mismatchCnt = 0;
  2719. for(j=0; j<m; ++j)
  2720. for(k=0; k<m; ++k)
  2721. {
  2722. unsigned c_idx = (j*m)+k;
  2723. p->c0m[ c_idx ] = p->idxV[j] == p->idxV[k];
  2724. mismatchCnt += p->c0m[ c_idx ] != p->c1m[ c_idx ];
  2725. }
  2726. if( mismatchCnt == 0 )
  2727. ++stopIter;
  2728. else
  2729. stopIter = 0;
  2730. printf("%i %i %i\n",i,stopIter,mismatchCnt);
  2731. fflush(stdout);
  2732. unsigned* tcm = p->c0m;
  2733. p->c0m = p->c1m;
  2734. p->c1m = tcm;
  2735. }
  2736. }
  2737. return rc;
  2738. }
  2739. //------------------------------------------------------------------------------------------------------------
  2740. cmRC_t _cmVectArrayAppend( cmVectArray_t* p, const void* v, unsigned typeByteCnt, unsigned valCnt )
  2741. {
  2742. cmRC_t rc = cmSubSysFailRC;
  2743. cmVectArrayVect_t* ep = NULL;
  2744. unsigned byteCnt = typeByteCnt * valCnt;
  2745. if( byteCnt == 0 || v == NULL )
  2746. return rc;
  2747. // verify that all vectors written to this vector array contain the same data type.
  2748. if( (cmIsFlag(p->flags,kFloatVaFl) && typeByteCnt!=sizeof(float)) || (cmIsFlag(p->flags,kDoubleVaFl) && typeByteCnt!=sizeof(double)))
  2749. return cmCtxRtCondition(&p->obj,cmInvalidArgRC,"All data stored to a cmVectArray_t must be a consistent type.");
  2750. // allocate space for the link record
  2751. if((ep = cmMemAllocZ(cmVectArrayVect_t,1)) == NULL )
  2752. goto errLabel;
  2753. // allocate space for the vector data
  2754. if((ep->u.v = cmMemAlloc(char,typeByteCnt*valCnt)) == NULL )
  2755. goto errLabel;
  2756. // append the link recd to the end of the element list
  2757. if( p->ep != NULL )
  2758. p->ep->link = ep;
  2759. else
  2760. {
  2761. p->bp = ep;
  2762. p->cur = p->bp;
  2763. }
  2764. p->ep = ep;
  2765. // store the length of the vector
  2766. ep->n = valCnt;
  2767. // copy in the vector data
  2768. memcpy(ep->u.v,v,byteCnt);
  2769. // track the number of vectors stored
  2770. p->vectCnt += 1;
  2771. // track the longest data vector
  2772. if( valCnt > p->maxEleCnt )
  2773. p->maxEleCnt = valCnt;
  2774. rc = cmOkRC;
  2775. errLabel:
  2776. if(rc != cmOkRC )
  2777. {
  2778. cmMemFree(ep->u.v);
  2779. cmMemFree(ep);
  2780. }
  2781. return rc;
  2782. }
  2783. cmVectArray_t* cmVectArrayAlloc( cmCtx* ctx, unsigned flags )
  2784. {
  2785. cmRC_t rc = cmOkRC;
  2786. cmVectArray_t* p = cmObjAlloc(cmVectArray_t,ctx,NULL);
  2787. assert(p != NULL);
  2788. switch( flags & (kFloatVaFl | kDoubleVaFl | kSampleVaFl | kRealVaFl ) )
  2789. {
  2790. case kFloatVaFl:
  2791. p->flags |= kFloatVaFl;
  2792. p->typeByteCnt = sizeof(float);
  2793. break;
  2794. case kDoubleVaFl:
  2795. p->flags |= kDoubleVaFl;
  2796. p->typeByteCnt = sizeof(double);
  2797. break;
  2798. case kSampleVaFl:
  2799. if( sizeof(cmSample_t) == sizeof(float) )
  2800. p->flags |= kFloatVaFl;
  2801. else
  2802. {
  2803. if( sizeof(cmSample_t) == sizeof(double))
  2804. p->flags |= kDoubleVaFl;
  2805. else
  2806. rc = cmCtxRtCondition(&p->obj,cmInvalidArgRC,"The size of the cmSample_t is not consistent with float or double.");
  2807. }
  2808. p->typeByteCnt = sizeof(cmSample_t);
  2809. break;
  2810. case kRealVaFl:
  2811. if( sizeof(cmReal_t) == sizeof(float) )
  2812. p->flags |= kFloatVaFl;
  2813. else
  2814. {
  2815. if( sizeof(cmReal_t) == sizeof(double))
  2816. p->flags |= kDoubleVaFl;
  2817. else
  2818. rc = cmCtxRtCondition(&p->obj,cmInvalidArgRC,"The size of the cmReal_t is not consistent with float or double.");
  2819. }
  2820. p->typeByteCnt = sizeof(cmReal_t);
  2821. break;
  2822. default:
  2823. rc = cmCtxRtCondition(&p->obj,cmInvalidArgRC,"The vector array value type flag was not recognized.");
  2824. }
  2825. if(rc != cmOkRC)
  2826. cmVectArrayFree(&p);
  2827. return p;
  2828. }
  2829. cmVectArray_t* cmVectArrayAllocFromFile(cmCtx* ctx, const char* fn )
  2830. {
  2831. cmRC_t rc = cmOkRC;
  2832. FILE* fp = NULL;
  2833. char* buf = NULL;
  2834. cmVectArray_t* p = NULL;
  2835. unsigned hn = 4;
  2836. unsigned hdr[hn];
  2837. // create the file
  2838. if((fp = fopen(fn,"rb")) == NULL )
  2839. {
  2840. rc = cmCtxRtCondition(&ctx->obj,cmSystemErrorRC,"The vector array file '%s' could not be opened.",cmStringNullGuard(fn));
  2841. goto errLabel;
  2842. }
  2843. if( fread(hdr,sizeof(unsigned),hn,fp) != hn )
  2844. {
  2845. rc = cmCtxRtCondition(&ctx->obj,cmSystemErrorRC,"The vector array file header could not be read from '%s'.",cmStringNullGuard(fn));
  2846. goto errLabel;
  2847. }
  2848. unsigned flags = hdr[0];
  2849. unsigned typeByteCnt = hdr[1];
  2850. unsigned vectCnt = hdr[2];
  2851. unsigned maxEleCnt = hdr[3];
  2852. unsigned i;
  2853. buf = cmMemAlloc(char,maxEleCnt*typeByteCnt);
  2854. if((p = cmVectArrayAlloc(ctx, flags )) == NULL )
  2855. goto errLabel;
  2856. for(i=0; i<vectCnt; ++i)
  2857. {
  2858. unsigned vn;
  2859. if( fread(&vn,sizeof(unsigned),1,fp) != 1 )
  2860. {
  2861. rc = cmCtxRtCondition(&p->obj,cmSystemErrorRC,"The vector array file element count read failed on vector index:%i in '%s'.",i,cmStringNullGuard(fn));
  2862. goto errLabel;
  2863. }
  2864. assert( vn <= maxEleCnt );
  2865. if( fread(buf,typeByteCnt,vn,fp) != vn )
  2866. {
  2867. rc = cmCtxRtCondition(&p->obj,cmSystemErrorRC,"The vector array data read failed on vector index:%i in '%s'.",i,cmStringNullGuard(fn));
  2868. goto errLabel;
  2869. }
  2870. if((rc = _cmVectArrayAppend(p,buf, typeByteCnt, vn )) != cmOkRC )
  2871. {
  2872. rc = cmCtxRtCondition(&p->obj,rc,"The vector array data store failed on vector index:%i in '%s'.",i,cmStringNullGuard(fn));
  2873. goto errLabel;
  2874. }
  2875. }
  2876. errLabel:
  2877. if( fp != NULL )
  2878. fclose(fp);
  2879. cmMemFree(buf);
  2880. if(rc != cmOkRC && p != NULL)
  2881. cmVectArrayFree(&p);
  2882. return p;
  2883. }
  2884. cmRC_t cmVectArrayFree( cmVectArray_t** pp )
  2885. {
  2886. cmRC_t rc = cmOkRC;
  2887. if( pp == NULL || *pp == NULL )
  2888. return rc;
  2889. cmVectArray_t* p = *pp;
  2890. if((rc = cmVectArrayClear(p)) != cmOkRC )
  2891. return rc;
  2892. cmMemFree(p->tempV);
  2893. cmObjFree(pp);
  2894. return rc;
  2895. }
  2896. cmRC_t cmVectArrayClear( cmVectArray_t* p )
  2897. {
  2898. cmVectArrayVect_t* ep = p->bp;
  2899. while( ep!=NULL )
  2900. {
  2901. cmVectArrayVect_t* np = ep->link;
  2902. cmMemFree(ep->u.v);
  2903. cmMemFree(ep);
  2904. ep = np;
  2905. }
  2906. p->bp = NULL;
  2907. p->ep = NULL;
  2908. p->maxEleCnt = 0;
  2909. p->vectCnt = 0;
  2910. return cmOkRC;
  2911. }
  2912. unsigned cmVectArrayCount( const cmVectArray_t* p )
  2913. { return p->vectCnt; }
  2914. /*
  2915. unsigned cmVectArrayEleCount( const cmVectArray_t* p )
  2916. {
  2917. cmVectArrayVect_t* ep = p->bp;
  2918. unsigned n = 0;
  2919. for(; ep!=NULL; ep=ep->link )
  2920. n += ep->n;
  2921. return n;
  2922. }
  2923. */
  2924. cmRC_t cmVectArrayAppendS( cmVectArray_t* p, const cmSample_t* v, unsigned vn )
  2925. { return _cmVectArrayAppend(p,v,sizeof(v[0]),vn); }
  2926. cmRC_t cmVectArrayAppendR( cmVectArray_t* p, const cmReal_t* v, unsigned vn )
  2927. { return _cmVectArrayAppend(p,v,sizeof(v[0]),vn); }
  2928. cmRC_t cmVectArrayAppendF( cmVectArray_t* p, const float* v, unsigned vn )
  2929. { return _cmVectArrayAppend(p,v,sizeof(v[0]),vn); }
  2930. cmRC_t cmVectArrayAppendD( cmVectArray_t* p, const double* v, unsigned vn )
  2931. { return _cmVectArrayAppend(p,v,sizeof(v[0]),vn); }
  2932. cmRC_t cmVectArrayAppendI( cmVectArray_t* p, const int* v, unsigned vn )
  2933. {
  2934. p->tempV = cmMemResize(double,p->tempV,vn);
  2935. unsigned i;
  2936. for(i=0; i<vn; ++i)
  2937. p->tempV[i] = v[i];
  2938. cmRC_t rc = cmVectArrayAppendD(p,p->tempV,vn);
  2939. return rc;
  2940. }
  2941. cmRC_t cmVectArrayAppendU( cmVectArray_t* p, const unsigned* v, unsigned vn )
  2942. {
  2943. p->tempV = cmMemResize(double,p->tempV,vn);
  2944. unsigned i;
  2945. for(i=0; i<vn; ++i)
  2946. p->tempV[i] = v[i];
  2947. cmRC_t rc = cmVectArrayAppendD(p,p->tempV,vn);
  2948. return rc;
  2949. }
  2950. cmRC_t cmVectArrayWrite( cmVectArray_t* p, const char* fn )
  2951. {
  2952. cmRC_t rc = cmOkRC;
  2953. FILE* fp = NULL;
  2954. cmVectArrayVect_t* ep;
  2955. unsigned i;
  2956. unsigned hn = 4;
  2957. unsigned hdr[hn];
  2958. hdr[0] = p->flags;
  2959. hdr[1] = p->typeByteCnt;
  2960. hdr[2] = p->vectCnt;
  2961. hdr[3] = p->maxEleCnt;
  2962. // create the file
  2963. if((fp = fopen(fn,"wb")) == NULL )
  2964. return cmCtxRtCondition(&p->obj,cmSystemErrorRC,"The vector array file '%s' could not be created.",cmStringNullGuard(fn));
  2965. // write the header
  2966. if( fwrite(hdr,sizeof(unsigned),hn,fp) != hn )
  2967. {
  2968. rc = cmCtxRtCondition(&p->obj,cmSystemErrorRC,"Vector array file header write failed in '%s'.",cmStringNullGuard(fn));
  2969. goto errLabel;
  2970. }
  2971. // write each vector element
  2972. for(ep=p->bp,i=0; ep!=NULL; ep=ep->link,++i)
  2973. {
  2974. // write the count of data values in the vector
  2975. if( fwrite(&ep->n,sizeof(ep->n),1,fp) != 1 )
  2976. {
  2977. rc = cmCtxRtCondition(&p->obj,cmSystemErrorRC,"Vector array file write failed on element header %i in '%s'.",i,cmStringNullGuard(fn));
  2978. goto errLabel;
  2979. }
  2980. // write the vector
  2981. if(fwrite(ep->u.v,p->typeByteCnt,ep->n,fp) != ep->n )
  2982. {
  2983. rc = cmCtxRtCondition(&p->obj,cmSystemErrorRC,"Vector array file write failed on data vector %i in '%s'.",i,cmStringNullGuard(fn));
  2984. goto errLabel;
  2985. }
  2986. }
  2987. errLabel:
  2988. if( fp != NULL )
  2989. fclose(fp);
  2990. return rc;
  2991. }
  2992. unsigned cmVectArrayForEachS( cmVectArray_t* p, unsigned idx, unsigned cnt, cmVectArrayForEachFuncS_t func, void* arg )
  2993. {
  2994. cmVectArrayVect_t* ep = p->bp;
  2995. unsigned i = 0;
  2996. unsigned n = 0;
  2997. // for each sub-array
  2998. for(; ep!=NULL && n<cnt; ep=ep->link )
  2999. {
  3000. // if the cur sub-array is in the range of idx:idx+cnt
  3001. if( i <= idx && idx < i + ep->n )
  3002. {
  3003. unsigned j = idx - i; // starting idx into cur sub-array
  3004. assert(j<ep->n);
  3005. unsigned m = cmMin(ep->n - j,cnt-n); // cnt of ele's to send from cur sub-array
  3006. // do callback
  3007. if( func(arg, idx, ep->u.sV + j, m ) != cmOkRC )
  3008. break;
  3009. idx += m;
  3010. n += m;
  3011. }
  3012. i += ep->n;
  3013. }
  3014. return n;
  3015. }
  3016. cmRC_t cmVectArrayWriteVectorS( cmCtx* ctx, const char* fn, const cmSample_t* v, unsigned vn )
  3017. {
  3018. cmRC_t rc = cmOkRC;
  3019. cmVectArray_t* p;
  3020. if((p = cmVectArrayAlloc(ctx,kSampleVaFl)) == NULL )
  3021. return cmCtxRtCondition(&ctx->obj,cmSubSysFailRC,"Unable to allocate an cmVectArray_t in cmVectArrayWriteVectorS().");
  3022. if((rc = cmVectArrayAppendS(p,v,vn)) != cmOkRC )
  3023. {
  3024. rc = cmCtxRtCondition(&p->obj,rc,"Vector append failed in cmVectArrayWriteVectorS().");
  3025. goto errLabel;
  3026. }
  3027. if((rc = cmVectArrayWrite(p,fn)) != cmOkRC )
  3028. rc = cmCtxRtCondition(&p->obj,rc,"Vector array write failed in cmVectArrayWriteVectorS().");
  3029. errLabel:
  3030. if((rc = cmVectArrayFree(&p)) != cmOkRC )
  3031. rc = cmCtxRtCondition(&ctx->obj,rc,"Free failed on cmVectArrayFree() in cmVectArrayWriteVectorS().");
  3032. return rc;
  3033. }
  3034. cmRC_t cmVectArrayWriteMatrixS( cmCtx* ctx, const char* fn, const cmSample_t* m, unsigned rn, unsigned cn )
  3035. {
  3036. cmRC_t rc = cmOkRC;
  3037. cmVectArray_t* p;
  3038. unsigned i;
  3039. if((p = cmVectArrayAlloc(ctx,kSampleVaFl)) == NULL )
  3040. return cmCtxRtCondition(&ctx->obj,cmSubSysFailRC,"Unable to allocate an cmVectArray_t in cmVectArrayWriteVectorS().");
  3041. for(i=0; i<cn; ++i)
  3042. {
  3043. if((rc = cmVectArrayAppendS(p,m + (i*rn), rn)) != cmOkRC )
  3044. {
  3045. rc = cmCtxRtCondition(&p->obj,rc,"Vector append failed in cmVectArrayWriteVectorS().");
  3046. goto errLabel;
  3047. }
  3048. }
  3049. if((rc = cmVectArrayWrite(p,fn)) != cmOkRC )
  3050. rc = cmCtxRtCondition(&p->obj,rc,"Vector array write failed in cmVectArrayWriteVectorS().");
  3051. errLabel:
  3052. if((rc = cmVectArrayFree(&p)) != cmOkRC )
  3053. rc = cmCtxRtCondition(&ctx->obj,rc,"Free failed on cmVectArrayFree() in cmVectArrayWriteVectorS().");
  3054. return rc;
  3055. }
  3056. cmRC_t cmVectArrayWriteMatrixR( cmCtx* ctx, const char* fn, const cmReal_t* m, unsigned rn, unsigned cn )
  3057. {
  3058. cmRC_t rc = cmOkRC;
  3059. cmVectArray_t* p;
  3060. unsigned i;
  3061. if((p = cmVectArrayAlloc(ctx,kRealVaFl)) == NULL )
  3062. return cmCtxRtCondition(&ctx->obj,cmSubSysFailRC,"Unable to allocate an cmVectArray_t in cmVectArrayWriteVectorR().");
  3063. for(i=0; i<cn; ++i)
  3064. {
  3065. if((rc = cmVectArrayAppendR(p,m + (i*rn), rn)) != cmOkRC )
  3066. {
  3067. rc = cmCtxRtCondition(&p->obj,rc,"Vector append failed in cmVectArrayWriteVectorR().");
  3068. goto errLabel;
  3069. }
  3070. }
  3071. if((rc = cmVectArrayWrite(p,fn)) != cmOkRC )
  3072. rc = cmCtxRtCondition(&p->obj,rc,"Vector array write failed in cmVectArrayWriteVectorR().");
  3073. errLabel:
  3074. if((rc = cmVectArrayFree(&p)) != cmOkRC )
  3075. rc = cmCtxRtCondition(&ctx->obj,rc,"Free failed on cmVectArrayFree() in cmVectArrayWriteVectorR().");
  3076. return rc;
  3077. }
  3078. cmRC_t cmVectArrayWriteVectorI( cmCtx* ctx, const char* fn, const int* v, unsigned vn )
  3079. {
  3080. cmRC_t rc = cmOkRC;
  3081. cmVectArray_t* p;
  3082. if((p = cmVectArrayAlloc(ctx,kIntVaFl)) == NULL )
  3083. return cmCtxRtCondition(&ctx->obj,cmSubSysFailRC,"Unable to allocate an cmVectArray_t in cmVectArrayWriteVectorS().");
  3084. if((rc = cmVectArrayAppendI(p,v,vn)) != cmOkRC )
  3085. {
  3086. rc = cmCtxRtCondition(&p->obj,rc,"Vector append failed in cmVectArrayWriteVectorS().");
  3087. goto errLabel;
  3088. }
  3089. if((rc = cmVectArrayWrite(p,fn)) != cmOkRC )
  3090. rc = cmCtxRtCondition(&p->obj,rc,"Vector array write failed in cmVectArrayWriteVectorS().");
  3091. errLabel:
  3092. if((rc = cmVectArrayFree(&p)) != cmOkRC )
  3093. rc = cmCtxRtCondition(&ctx->obj,rc,"Free failed on cmVectArrayFree() in cmVectArrayWriteVectorS().");
  3094. return rc;
  3095. }
  3096. cmRC_t cmVectArrayWriteMatrixI( cmCtx* ctx, const char* fn, const int* m, unsigned rn, unsigned cn )
  3097. {
  3098. cmRC_t rc = cmOkRC;
  3099. cmVectArray_t* p;
  3100. unsigned i;
  3101. if((p = cmVectArrayAlloc(ctx,kIntVaFl)) == NULL )
  3102. return cmCtxRtCondition(&ctx->obj,cmSubSysFailRC,"Unable to allocate an cmVectArray_t in cmVectArrayWriteVectorI().");
  3103. for(i=0; i<cn; ++i)
  3104. {
  3105. if((rc = cmVectArrayAppendI(p,m + (i*rn), rn)) != cmOkRC )
  3106. {
  3107. rc = cmCtxRtCondition(&p->obj,rc,"Vector append failed in cmVectArrayWriteVectorI().");
  3108. goto errLabel;
  3109. }
  3110. }
  3111. if((rc = cmVectArrayWrite(p,fn)) != cmOkRC )
  3112. rc = cmCtxRtCondition(&p->obj,rc,"Vector array write failed in cmVectArrayWriteVectorI().");
  3113. errLabel:
  3114. if((rc = cmVectArrayFree(&p)) != cmOkRC )
  3115. rc = cmCtxRtCondition(&ctx->obj,rc,"Free failed on cmVectArrayFree() in cmVectArrayWriteVectorI().");
  3116. return rc;
  3117. }
  3118. cmRC_t cmVectArrayForEachTextFuncS( void* arg, unsigned idx, const cmSample_t* xV, unsigned xN )
  3119. {
  3120. assert(0);
  3121. return cmOkRC;
  3122. }
  3123. cmRC_t cmVectArrayRewind( cmVectArray_t* p )
  3124. {
  3125. p->cur = p->bp;
  3126. return cmOkRC;
  3127. }
  3128. cmRC_t cmVectArrayAdvance( cmVectArray_t* p, unsigned n )
  3129. {
  3130. unsigned i;
  3131. for(i=0; i<n; ++i)
  3132. {
  3133. if( p->cur == NULL )
  3134. break;
  3135. p->cur = p->cur->link;
  3136. }
  3137. return cmOkRC;
  3138. }
  3139. bool cmVectArrayIsEOL( const cmVectArray_t* p )
  3140. { return p->cur == NULL; }
  3141. unsigned cmVectArrayEleCount( const cmVectArray_t* p )
  3142. {
  3143. if( p->cur == NULL )
  3144. return 0;
  3145. return p->cur->n;
  3146. }
  3147. cmRC_t cmVectArrayGetF( cmVectArray_t* p, float* v, unsigned* vnRef )
  3148. {
  3149. assert( cmIsFlag(p->flags,kFloatVaFl) );
  3150. if( cmVectArrayIsEOL(p) )
  3151. return cmCtxRtCondition(&p->obj,cmSubSysFailRC,"VectArray get failed because the state is EOL.");
  3152. unsigned n = cmMin(*vnRef,p->cur->n);
  3153. cmVOF_Copy(v,n,p->cur->u.fV);
  3154. *vnRef = n;
  3155. return cmOkRC;
  3156. }
  3157. cmRC_t cmVectArrayGetD( cmVectArray_t* p, double* v, unsigned* vnRef )
  3158. {
  3159. assert( cmIsFlag(p->flags,kDoubleVaFl) );
  3160. if( cmVectArrayIsEOL(p) )
  3161. return cmCtxRtCondition(&p->obj,cmSubSysFailRC,"VectArray get failed because the state is EOL.");
  3162. unsigned n = cmMin(*vnRef,p->cur->n);
  3163. cmVOD_Copy(v,n,p->cur->u.dV);
  3164. *vnRef = n;
  3165. return cmOkRC;
  3166. }
  3167. cmRC_t cmVectArrayGetI( cmVectArray_t* p, int* v, unsigned* vnRef )
  3168. {
  3169. if( cmVectArrayIsEOL(p) )
  3170. return cmCtxRtCondition(&p->obj,cmSubSysFailRC,"VectArray get failed because the state is EOL.");
  3171. unsigned n = cmMin(*vnRef,p->cur->n);
  3172. unsigned i;
  3173. if( cmIsFlag(p->flags,kDoubleVaFl) )
  3174. {
  3175. for(i=0; i<n; ++i)
  3176. v[i] = (int)(p->cur->u.dV[i]);
  3177. }
  3178. else
  3179. {
  3180. if( cmIsFlag(p->flags,kFloatVaFl) )
  3181. {
  3182. for(i=0; i<n; ++i)
  3183. v[i] = (int)(p->cur->u.fV[i]);
  3184. }
  3185. else
  3186. {
  3187. assert(0);
  3188. }
  3189. }
  3190. *vnRef = n;
  3191. return cmOkRC;
  3192. }
  3193. cmRC_t cmVectArrayGetU( cmVectArray_t* p, unsigned* v, unsigned* vnRef )
  3194. {
  3195. if( cmVectArrayIsEOL(p) )
  3196. return cmCtxRtCondition(&p->obj,cmSubSysFailRC,"VectArray get failed because the state is EOL.");
  3197. unsigned n = cmMin(*vnRef,p->cur->n);
  3198. unsigned i;
  3199. if( cmIsFlag(p->flags,kDoubleVaFl) )
  3200. {
  3201. for(i=0; i<n; ++i)
  3202. v[i] = (unsigned)(p->cur->u.dV[i]);
  3203. }
  3204. else
  3205. {
  3206. if( cmIsFlag(p->flags,kFloatVaFl) )
  3207. {
  3208. for(i=0; i<n; ++i)
  3209. v[i] = (unsigned)(p->cur->u.fV[i]);
  3210. }
  3211. else
  3212. {
  3213. assert(0);
  3214. }
  3215. }
  3216. *vnRef = n;
  3217. return cmOkRC;
  3218. }
  3219. unsigned cmVectArrayVectEleCount( cmVectArray_t* p, unsigned groupIdx, unsigned groupCnt )
  3220. {
  3221. unsigned n = 0;
  3222. cmVectArrayVect_t* pos = p->cur;
  3223. if( cmVectArrayRewind(p) != cmOkRC )
  3224. goto errLabel;
  3225. if( cmVectArrayAdvance(p,groupIdx) != cmOkRC )
  3226. goto errLabel;
  3227. while( !cmVectArrayIsEOL(p) )
  3228. {
  3229. n += cmVectArrayEleCount(p);
  3230. if(cmVectArrayAdvance(p,groupCnt) != cmOkRC )
  3231. goto errLabel;
  3232. }
  3233. errLabel:
  3234. p->cur = pos;
  3235. return n;
  3236. }
  3237. cmRC_t cmVectArrayFormVectF( cmVectArray_t* p, unsigned groupIdx, unsigned groupCnt, float** vRef, unsigned* vnRef )
  3238. {
  3239. cmRC_t rc = cmOkRC;
  3240. *vRef = NULL;
  3241. *vnRef = 0;
  3242. unsigned N = cmVectArrayVectEleCount(p,groupIdx,groupCnt);
  3243. if( N == 0 )
  3244. return rc;
  3245. float* v = cmMemAllocZ(float,N);
  3246. unsigned i = 0;
  3247. cmVectArrayVect_t* pos = p->cur;
  3248. if( cmVectArrayRewind(p) != cmOkRC )
  3249. goto errLabel;
  3250. if( cmVectArrayAdvance(p,groupIdx) != cmOkRC )
  3251. goto errLabel;
  3252. while( !cmVectArrayIsEOL(p) )
  3253. {
  3254. unsigned n = cmVectArrayEleCount(p);
  3255. assert(i+n <= N);
  3256. cmVectArrayGetF(p,v+i,&n);
  3257. i += n;
  3258. cmVectArrayAdvance(p,groupCnt);
  3259. }
  3260. *vRef = v;
  3261. *vnRef = i;
  3262. errLabel:
  3263. p->cur = pos;
  3264. return rc;
  3265. }
  3266. cmRC_t cmVectArrayFormVectColF( cmVectArray_t* p, unsigned groupIdx, unsigned groupCnt, unsigned colIdx, float** vRef, unsigned* vnRef )
  3267. {
  3268. cmRC_t rc = cmOkRC;
  3269. *vRef = NULL;
  3270. *vnRef = 0;
  3271. // assume there will be one output element for each group
  3272. unsigned N = cmVectArrayCount(p)/groupCnt + 1;
  3273. if( N == 0 )
  3274. return rc;
  3275. float* v = cmMemAllocZ(float,N);
  3276. unsigned i = 0;
  3277. cmVectArrayVect_t* pos = p->cur;
  3278. if( cmVectArrayRewind(p) != cmOkRC )
  3279. goto errLabel;
  3280. if( cmVectArrayAdvance(p,groupIdx) != cmOkRC )
  3281. goto errLabel;
  3282. while( i<N && !cmVectArrayIsEOL(p) )
  3283. {
  3284. unsigned tn = cmVectArrayEleCount(p);
  3285. float tv[tn];
  3286. // read the sub-vector
  3287. cmVectArrayGetF(p,tv,&tn);
  3288. // store the output value
  3289. if( colIdx < tn )
  3290. {
  3291. v[i] = tv[colIdx];
  3292. i += 1;
  3293. }
  3294. cmVectArrayAdvance(p,groupCnt);
  3295. }
  3296. *vRef = v;
  3297. *vnRef = i;
  3298. errLabel:
  3299. p->cur = pos;
  3300. return rc;
  3301. }
  3302. cmRC_t cmVectArrayFormVectColU( cmVectArray_t* p, unsigned groupIdx, unsigned groupCnt, unsigned colIdx, unsigned** vRef, unsigned* vnRef )
  3303. {
  3304. cmRC_t rc = cmOkRC;
  3305. *vRef = NULL;
  3306. *vnRef = 0;
  3307. // assume there will be one output element for each group
  3308. unsigned N = cmVectArrayCount(p)/groupCnt + 1;
  3309. if( N == 0 )
  3310. return rc;
  3311. unsigned* v = cmMemAllocZ(unsigned,N);
  3312. unsigned i = 0;
  3313. cmVectArrayVect_t* pos = p->cur;
  3314. if( cmVectArrayRewind(p) != cmOkRC )
  3315. goto errLabel;
  3316. if( cmVectArrayAdvance(p,groupIdx) != cmOkRC )
  3317. goto errLabel;
  3318. while( i<N && !cmVectArrayIsEOL(p) )
  3319. {
  3320. unsigned tn = cmVectArrayEleCount(p);
  3321. unsigned tv[tn];
  3322. // read the sub-vector
  3323. cmVectArrayGetU(p,tv,&tn);
  3324. assert( colIdx < tn );
  3325. // store the output value
  3326. if( colIdx < tn )
  3327. v[i++] = tv[colIdx];
  3328. cmVectArrayAdvance(p,groupCnt);
  3329. }
  3330. *vRef = v;
  3331. *vnRef = i;
  3332. errLabel:
  3333. p->cur = pos;
  3334. return rc;
  3335. }
  3336. cmRC_t cmVectArrayTest( cmCtx* ctx, const char* fn )
  3337. {
  3338. cmRC_t rc = cmOkRC;
  3339. cmVectArray_t* p = NULL;
  3340. unsigned flags = kSampleVaFl;
  3341. cmSample_t v[] = { 0, 1, 2, 3, 4, 5 };
  3342. if( fn == NULL || strlen(fn)==0 )
  3343. return cmCtxRtCondition(&p->obj,cmSubSysFailRC,"Invalid test output file name.");
  3344. if( (p = cmVectArrayAlloc(ctx,flags)) == NULL )
  3345. return cmCtxRtCondition(&p->obj,cmSubSysFailRC,"The vectory array object allocation failed.");
  3346. if( cmVectArrayAppendS(p,v,1) != cmOkRC )
  3347. {
  3348. rc = cmCtxRtCondition(&p->obj,cmSubSysFailRC,"Vector append 1 failed.");
  3349. goto errLabel;
  3350. }
  3351. if( cmVectArrayAppendS(p,v+1,2) != cmOkRC )
  3352. {
  3353. rc = cmCtxRtCondition(&p->obj,cmSubSysFailRC,"Vector append 2 failed.");
  3354. goto errLabel;
  3355. }
  3356. if( cmVectArrayAppendS(p,v+3,3) != cmOkRC )
  3357. {
  3358. rc = cmCtxRtCondition(&p->obj,cmSubSysFailRC,"Vector append 3 failed.");
  3359. goto errLabel;
  3360. }
  3361. if( cmVectArrayWrite(p,fn) != cmOkRC )
  3362. {
  3363. rc = cmCtxRtCondition(&p->obj,cmSubSysFailRC,"Vector array write failed.");
  3364. goto errLabel;
  3365. }
  3366. //cmVectArrayForEachS(p,0,cmVectArrayEleCount(p),cmVectArrayForEachTextFuncS,&ctx->printRpt);
  3367. if( cmVectArrayFree(&p) != cmOkRC )
  3368. {
  3369. rc = cmCtxRtCondition(&p->obj,cmSubSysFailRC,"The vectory array release failed.");
  3370. goto errLabel;
  3371. }
  3372. if((p = cmVectArrayAllocFromFile(ctx, fn )) == NULL )
  3373. {
  3374. rc = cmCtxRtCondition(&p->obj,cmSubSysFailRC,"VectArray alloc from file failed.");
  3375. goto errLabel;
  3376. }
  3377. while(!cmVectArrayIsEOL(p))
  3378. {
  3379. unsigned n = cmVectArrayEleCount(p);
  3380. cmSample_t v[n];
  3381. if( cmVectArrayGetS(p,v,&n) != cmOkRC )
  3382. {
  3383. rc = cmCtxRtCondition(&p->obj,cmSubSysFailRC,"VectArrayGetS() failed.");
  3384. goto errLabel;
  3385. }
  3386. cmVOS_PrintL("v:",NULL,1,n,v);
  3387. cmVectArrayAdvance(p,1);
  3388. }
  3389. errLabel:
  3390. if( cmVectArrayFree(&p) != cmOkRC )
  3391. rc = cmCtxRtCondition(&p->obj,cmSubSysFailRC,"The vectory array release failed.");
  3392. return rc;
  3393. }
  3394. //-----------------------------------------------------------------------------------------------------------------------
  3395. cmWhFilt* cmWhFiltAlloc( cmCtx* c, cmWhFilt* p, unsigned binCnt, cmReal_t binHz, cmReal_t coeff, cmReal_t maxHz )
  3396. {
  3397. cmWhFilt* op = cmObjAlloc(cmWhFilt,c,p);
  3398. if( binCnt > 0 )
  3399. if( cmWhFiltInit(op,binCnt,binHz,coeff,maxHz) != cmOkRC )
  3400. cmWhFiltFree(&op);
  3401. return op;
  3402. }
  3403. cmRC_t cmWhFiltFree( cmWhFilt** pp )
  3404. {
  3405. cmRC_t rc = cmOkRC;
  3406. if( pp==NULL || *pp==NULL )
  3407. return rc;
  3408. cmWhFilt* p = *pp;
  3409. if((rc = cmWhFiltFinal(p)) != cmOkRC )
  3410. return rc;
  3411. cmMemFree(p->whM);
  3412. cmMemFree(p->whiV);
  3413. cmMemFree(p->iV);
  3414. cmObjFree(pp);
  3415. return rc;
  3416. }
  3417. cmRC_t cmWhFiltInit( cmWhFilt* p, unsigned binCnt, cmReal_t binHz, cmReal_t coeff, cmReal_t maxHz )
  3418. {
  3419. cmRC_t rc;
  3420. if((rc = cmWhFiltFinal(p)) != cmOkRC )
  3421. return rc;
  3422. p->binCnt = binCnt;
  3423. p->binHz = binHz;
  3424. p->bandCnt = maxHz == 0 ? 34 : ceil(log10(maxHz/229.0 + 1) * 21.4 - 1)-1;
  3425. if( p->bandCnt <= 0 )
  3426. return cmCtxRtCondition(&p->obj, cmInvalidArgRC, "Max. Hz too low to form any frequency bands.");
  3427. cmReal_t flV[ p->bandCnt ];
  3428. cmReal_t fcV[ p->bandCnt ];
  3429. cmReal_t fhV[ p->bandCnt ];
  3430. int i;
  3431. for(i=0; i<p->bandCnt; ++i)
  3432. {
  3433. fcV[i] = 229.0 * (pow(10.0,(i+2)/21.4) - 1.0);
  3434. flV[i] = i==0 ? 0 : fcV[i-1];
  3435. }
  3436. for(i=0; i<p->bandCnt-1; ++i)
  3437. fhV[i] = fcV[i+1];
  3438. fhV[p->bandCnt-1] = fcV[p->bandCnt-1] + (fcV[p->bandCnt-1] - fcV[p->bandCnt-2]);
  3439. //cmVOR_PrintL("flV",NULL,1,p->bandCnt,flV);
  3440. //cmVOR_PrintL("fcV",NULL,1,p->bandCnt,fcV);
  3441. //cmVOR_PrintL("fhV",NULL,1,p->bandCnt,fhV);
  3442. cmReal_t* tM = cmMemAlloc(cmReal_t,p->bandCnt * p->binCnt);
  3443. p->whM = cmMemResizeZ(cmReal_t,p->whM,p->binCnt * p->bandCnt);
  3444. p->iV = cmMemResizeZ(cmReal_t,p->iV,p->binCnt);
  3445. // generate the bin index values
  3446. for(i=0; i<p->binCnt; ++i)
  3447. p->iV[i] = i;
  3448. cmReal_t stSpread = 0; // set stSpread to 0 to use flV/fhV[]
  3449. cmVOR_TriangleMask(tM, p->bandCnt, p->binCnt, fcV, p->binHz, stSpread, flV, fhV );
  3450. cmVOR_Transpose(p->whM, tM, p->bandCnt, p->binCnt );
  3451. cmMemFree(tM);
  3452. //cmVOR_PrintL("whM",NULL,p->bandCnt,p->binCnt,p->whM);
  3453. //cmVectArrayWriteMatrixR(p->obj.ctx, "/home/kevin/temp/frqtrk/whM.va", p->whM, p->binCnt, p->bandCnt );
  3454. unsigned whiN = p->bandCnt+2;
  3455. p->whiV = cmMemResizeZ(cmReal_t,p->whiV,whiN);
  3456. for(i=0; i<whiN; ++i)
  3457. {
  3458. if( i == 0 )
  3459. p->whiV[i] = 0;
  3460. else
  3461. if( i == whiN-1 )
  3462. p->whiV[i] = fhV[p->bandCnt-1]/binHz;
  3463. else
  3464. p->whiV[i] = fcV[i-1]/binHz;
  3465. }
  3466. //cmVOR_PrintL("whiV",NULL,1,whiN,p->whiV);
  3467. //cmVectArrayWriteMatrixR(p->obj.ctx, "/home/kevin/temp/frqtrk/whiV.va", p->whiV, whiN, 1 );
  3468. return rc;
  3469. }
  3470. cmRC_t cmWhFiltFinal( cmWhFilt* p )
  3471. { return cmOkRC; }
  3472. cmRC_t cmWhFiltExec( cmWhFilt* p, const cmReal_t* xV, cmReal_t* yV, unsigned xyN )
  3473. {
  3474. assert( xyN == p->binCnt);
  3475. cmRC_t rc = cmOkRC;
  3476. unsigned whiN = p->bandCnt + 2;
  3477. unsigned mbi = cmMin(xyN, floor(p->whiV[whiN-1]));
  3478. // calculate the level in each band to form a composite filter
  3479. cmReal_t y0V[ whiN ];
  3480. cmReal_t* b0V = y0V + 1;
  3481. cmVOR_MultVVM(b0V, p->bandCnt, xV, p->binCnt, p->whM );
  3482. //cmVOR_PrintL("b0V",NULL,1,p->bandCnt,b0V);
  3483. // BEWARE: zeros in b0V will generate Inf's when sent
  3484. // through the cmVOR_PowVS() function.
  3485. int i;
  3486. for(i=0; i<p->bandCnt; ++i)
  3487. if( b0V[i] < 0.000001 )
  3488. b0V[i] = 0.000001;
  3489. // apply a non-linear expansion function to each band
  3490. cmVOR_PowVS(b0V,p->bandCnt,p->coeff-1);
  3491. //cmVOR_PrintL("b0V",NULL,1,p->bandCnt,b0V);
  3492. // add edge values to the filter
  3493. y0V[0] = b0V[0];
  3494. y0V[whiN-1] = b0V[p->bandCnt-1];
  3495. //cmVOR_PrintL("y0V",NULL,1,whiN,y0V);
  3496. cmVOR_Interp1(yV,p->iV,p->binCnt,p->whiV,y0V,whiN);
  3497. cmVOR_Fill(yV+mbi,xyN-mbi,1.0);
  3498. //cmVOR_PrintL("yV",NULL,1,p->binCnt,yV);
  3499. cmVOR_MultVV(yV,xyN,xV);
  3500. return rc;
  3501. }
  3502. //-----------------------------------------------------------------------------------------------------------------------
  3503. cmFrqTrk* cmFrqTrkAlloc( cmCtx* c, cmFrqTrk* p, const cmFrqTrkArgs_t* a )
  3504. {
  3505. cmFrqTrk* op = cmObjAlloc(cmFrqTrk,c,p);
  3506. op->logVa = cmVectArrayAlloc(c,kRealVaFl);
  3507. op->levelVa = cmVectArrayAlloc(c,kRealVaFl);
  3508. op->specVa = cmVectArrayAlloc(c,kRealVaFl);
  3509. op->attenVa = cmVectArrayAlloc(c,kRealVaFl);
  3510. op->wf = cmWhFiltAlloc(c,NULL,0,0,0,0);
  3511. if( a != NULL )
  3512. if( cmFrqTrkInit(op,a) != cmOkRC )
  3513. cmFrqTrkFree(&op);
  3514. return op;
  3515. }
  3516. cmRC_t cmFrqTrkFree( cmFrqTrk** pp )
  3517. {
  3518. cmRC_t rc = cmOkRC;
  3519. if( pp==NULL || *pp==NULL )
  3520. return rc;
  3521. cmFrqTrk* p = *pp;
  3522. if((rc = cmFrqTrkFinal(p)) != cmOkRC )
  3523. return rc;
  3524. unsigned i;
  3525. for(i=0; i<p->a.chCnt; ++i)
  3526. {
  3527. cmMemFree(p->ch[i].dbV);
  3528. cmMemFree(p->ch[i].hzV);
  3529. }
  3530. cmMemFree(p->ch);
  3531. cmMemFree(p->dbM);
  3532. cmMemFree(p->pkiV);
  3533. cmMemFree(p->dbV);
  3534. cmMemFree(p->aV);
  3535. cmVectArrayFree(&p->logVa);
  3536. cmVectArrayFree(&p->levelVa);
  3537. cmVectArrayFree(&p->specVa);
  3538. cmVectArrayFree(&p->attenVa);
  3539. cmWhFiltFree(&p->wf);
  3540. cmMemFree(p->logFn);
  3541. cmMemFree(p->levelFn);
  3542. cmMemFree(p->specFn);
  3543. cmObjFree(pp);
  3544. return rc;
  3545. }
  3546. cmRC_t cmFrqTrkInit( cmFrqTrk* p, const cmFrqTrkArgs_t* a )
  3547. {
  3548. cmRC_t rc;
  3549. if((rc = cmFrqTrkFinal(p)) != cmOkRC )
  3550. return rc;
  3551. p->a = *a;
  3552. p->ch = cmMemResizeZ(cmFrqTrkCh_t,p->ch,a->chCnt );
  3553. p->hN = cmMax(1,a->wndSecs * a->srate / a->hopSmpCnt );
  3554. p->sN = 4*p->hN;
  3555. p->binHz = a->srate / ((p->a.binCnt-1)*2);
  3556. p->bN = cmMin( p->a.binCnt, ceil(p->a.pkMaxHz / p->binHz ));
  3557. p->dbM = cmMemResizeZ(cmReal_t,p->dbM,p->hN*p->bN);
  3558. p->hi = 0;
  3559. p->fN = 0;
  3560. p->dbV = cmMemResizeZ(cmReal_t,p->dbV,p->bN);
  3561. p->pkiV = cmMemResizeZ(unsigned,p->pkiV,p->bN);
  3562. p->deadN_max = a->maxTrkDeadSec * a->srate / a->hopSmpCnt;
  3563. p->minTrkN = a->minTrkSec * a->srate / a->hopSmpCnt;
  3564. p->nextTrkId = 1;
  3565. p->aV = cmMemResizeZ(cmReal_t,p->aV,p->a.binCnt);
  3566. p->attenDlyPhsMax = cmMax(3,a->attenDlySec * a->srate / a->hopSmpCnt );
  3567. p->attenPhsMax = cmMax(3,a->attenAtkSec * a->srate / a->hopSmpCnt );
  3568. if( a->logFn != NULL )
  3569. p->logFn = cmMemResizeStr(p->logFn,a->logFn);
  3570. if( a->levelFn != NULL )
  3571. p->levelFn = cmMemResizeStr(p->levelFn,a->levelFn);
  3572. if( a->specFn != NULL )
  3573. p->specFn = cmMemResizeStr(p->specFn,a->specFn);
  3574. if( a->attenFn != NULL )
  3575. p->attenFn = cmMemResizeStr(p->attenFn,a->attenFn);
  3576. if(cmWhFiltInit(p->wf,p->bN,p->binHz,p->a.whFiltCoeff,p->a.pkMaxHz) != cmOkRC )
  3577. cmCtxRtCondition(&p->obj, cmSubSysFailRC, "Whitening filter intitialization failed.");
  3578. unsigned i;
  3579. for(i=0; i<p->a.chCnt; ++i)
  3580. {
  3581. p->ch[i].dbV = cmMemResizeZ(cmReal_t,p->ch[i].dbV,p->sN);
  3582. p->ch[i].hzV = cmMemResizeZ(cmReal_t,p->ch[i].hzV,p->sN);
  3583. }
  3584. return rc;
  3585. }
  3586. cmRC_t cmFrqTrkFinal( cmFrqTrk* p )
  3587. {
  3588. cmRC_t rc = cmOkRC;
  3589. if( p->logFn != NULL )
  3590. cmVectArrayWrite(p->logVa,p->logFn);
  3591. if( p->levelFn != NULL )
  3592. cmVectArrayWrite(p->levelVa,p->levelFn);
  3593. if( p->specFn != NULL )
  3594. cmVectArrayWrite(p->specVa,p->specFn);
  3595. if( p->attenFn != NULL )
  3596. cmVectArrayWrite(p->attenVa,p->attenFn);
  3597. cmWhFiltFinal(p->wf);
  3598. return rc;
  3599. }
  3600. // Return an available channel record or NULL if all channel records are in use.
  3601. cmFrqTrkCh_t* _cmFrqTrkFindAvailCh( cmFrqTrk* p )
  3602. {
  3603. unsigned i;
  3604. for(i=0; i<p->a.chCnt; ++i)
  3605. if( p->ch[i].activeFl == false )
  3606. return p->ch + i;
  3607. return NULL;
  3608. }
  3609. // Estimate the peak frequency by parabolic interpolotion into hzV[p->bN]
  3610. void _cmFrqTrkMagnToHz( cmFrqTrk* p, const cmReal_t* dbV, unsigned* pkiV, unsigned pkN, cmReal_t* hzV )
  3611. {
  3612. unsigned i;
  3613. for(i=0; i<pkN; ++i)
  3614. if( pkiV[i] != cmInvalidIdx )
  3615. {
  3616. unsigned pki = pkiV[i];
  3617. cmReal_t y0 = pki>0 ? dbV[ pki-1 ] : dbV[pki];
  3618. cmReal_t y1 = dbV[ pki ];
  3619. cmReal_t y2 = pki<p->bN-1 ? dbV[ pki+1 ] : dbV[pki];
  3620. cmReal_t den = y0 - (2.*y1) + y2;
  3621. cmReal_t offs = den==0 ? 0 : 0.5 * ((y0 - y2) / den);
  3622. hzV[pki] = p->binHz * (pki+offs);
  3623. //if( hzV[pki] < 0 )
  3624. //{
  3625. // printf("%f : %f %f %f : %f %f\n",hzV[pki],y0,y1,y2,den,offs);
  3626. //}
  3627. }
  3628. }
  3629. unsigned _cmFrqTrkActiveChCount( cmFrqTrk* p )
  3630. {
  3631. unsigned n = 0;
  3632. unsigned i;
  3633. for(i=0; i<p->a.chCnt; ++i)
  3634. if( p->ch[i].activeFl )
  3635. ++n;
  3636. return n;
  3637. }
  3638. void _cmFrqTrkWriteLevel( cmFrqTrk* p, const cmReal_t* dbV, const cmReal_t* hzV, unsigned bN )
  3639. {
  3640. if( p->levelFn != NULL )
  3641. {
  3642. double maxHz = 5000.0;
  3643. unsigned maxBinIdx = cmMin(bN,maxHz / p->binHz);
  3644. unsigned vn = 3;
  3645. cmReal_t v[vn];
  3646. unsigned idx = cmVOR_MaxIndex(dbV,maxBinIdx,1);
  3647. v[0] = cmVOR_Mean(dbV,maxBinIdx);
  3648. v[1] = dbV[idx];
  3649. v[2] = hzV[idx];
  3650. cmVectArrayAppendR(p->levelVa,v,vn);
  3651. }
  3652. }
  3653. void _cmFrqTrkWriteLog( cmFrqTrk* p )
  3654. {
  3655. unsigned n;
  3656. cmReal_t* vb = NULL;
  3657. if( p->logFn == NULL )
  3658. return;
  3659. if((n = _cmFrqTrkActiveChCount(p)) > 0 )
  3660. {
  3661. unsigned i,j;
  3662. // sn = count of elements in the summary sub-vector
  3663. unsigned sn = 3;
  3664. // each active channel will emit 7 values
  3665. unsigned nn = 1 + n*7 + sn;
  3666. // allocate the row vector
  3667. vb = cmMemResize(cmReal_t,vb,nn);
  3668. // row format
  3669. // [ nn idV[n] hzV[n] ... hsV[n] smV[sn] ]
  3670. // n = (nn - (1 + sn)) / 7
  3671. *vb = nn; // the first element in the vector contains the length of the row
  3672. cmReal_t* v = vb + 1;
  3673. // setup the base pointer to each sub-vector
  3674. cmReal_t* idV = v + n * 0;
  3675. cmReal_t* hzV = v + n * 1;
  3676. cmReal_t* dbV = v + n * 2;
  3677. cmReal_t* stV = v + n * 3;
  3678. cmReal_t* dsV = v + n * 4;
  3679. cmReal_t* hsV = v + n * 5;
  3680. cmReal_t* agV = v + n * 6;
  3681. cmReal_t* smV = v + n * 7; // summary information
  3682. smV[0] = p->newTrkCnt;
  3683. smV[1] = p->curTrkCnt;
  3684. smV[2] = p->deadTrkCnt;
  3685. // for each active channel
  3686. for(i=0,j=0; i<p->a.chCnt; ++i)
  3687. if( p->ch[i].activeFl )
  3688. {
  3689. assert(j < n);
  3690. // elements of each sub-vector associated with a given
  3691. // index refer to the same track record - element i therefore
  3692. // refers to active track index i.
  3693. idV[j] = p->ch[i].id;
  3694. hzV[j] = p->ch[i].hz;
  3695. dbV[j] = p->ch[i].db;
  3696. stV[j] = p->ch[i].dN;
  3697. dsV[j] = p->ch[i].db_std;
  3698. hsV[j] = p->ch[i].hz_std;
  3699. agV[j] = p->ch[i].attenGain;
  3700. ++j;
  3701. }
  3702. cmVectArrayAppendR(p->logVa, vb, nn );
  3703. }
  3704. cmMemFree(vb);
  3705. }
  3706. void _cmFrqTrkPrintChs( const cmFrqTrk* p )
  3707. {
  3708. unsigned i;
  3709. for(i=0; i<p->a.chCnt; ++i)
  3710. {
  3711. cmFrqTrkCh_t* c = p->ch + i;
  3712. printf("%i : %i tN:%i hz:%f db:%f\n",i,c->activeFl,c->tN,c->hz,c->db);
  3713. }
  3714. }
  3715. // Used to sort the channels into descending dB order.
  3716. int _cmFrqTrkChCompare( const void* p0, const void* p1 )
  3717. { return ((cmFrqTrkCh_t*)p0)->db - ((cmFrqTrkCh_t*)p1)->db; }
  3718. // Return the index of the peak associated with pkiV[i] which best matches the tracker 'c'
  3719. // or cmInvalidIdx if no valid peaks were found.
  3720. // pkiV[ pkN ] holds the indexes into dbV[] and hzV[] which are peaks.
  3721. // Some elements of pkiV[] may be set to cmInvalidIdx if the associated peak has already
  3722. // been selected by another tracker.
  3723. unsigned _cmFrqTrkFindPeak( cmFrqTrk* p, const cmFrqTrkCh_t* c, const cmReal_t* dbV, const cmReal_t* hzV, unsigned* pkiV, unsigned pkN )
  3724. {
  3725. unsigned i,pki;
  3726. cmReal_t d_max = p->a.pkThreshDb;
  3727. unsigned d_idx = cmInvalidIdx;
  3728. cmReal_t hz_min = c->hz * pow(2,-p->a.stRange/12.0);
  3729. cmReal_t hz_max = c->hz * pow(2, p->a.stRange/12.0);
  3730. // find the peak with the most energy inside the frequency range hz_min to hz_max.
  3731. for(i=0; i<pkN; ++i)
  3732. if( ((pki = pkiV[i]) != cmInvalidIdx) && hz_min <= hzV[pki] && hzV[pki] <= hz_max && dbV[pki]>d_max )
  3733. {
  3734. d_max= dbV[pki];
  3735. d_idx = i;
  3736. }
  3737. return d_idx;
  3738. }
  3739. void _cmFrqTrkScoreChs( cmFrqTrk* p )
  3740. {
  3741. unsigned i;
  3742. for(i=0; i<p->a.chCnt; ++i)
  3743. if( p->ch[i].activeFl )
  3744. {
  3745. cmFrqTrkCh_t* c = p->ch + i;
  3746. c->dbV[ c->si ] = c->db;
  3747. c->hzV[ c->si ] = c->hz;
  3748. c->si = (c->si + 1) % p->sN;
  3749. c->sn += 1;
  3750. unsigned n = cmMin(c->sn,p->sN);
  3751. c->db_mean = cmVOR_Mean(c->dbV,n);
  3752. c->db_std = sqrt(cmVOR_Variance( c->dbV,n,&c->db_mean));
  3753. c->hz_mean = cmVOR_Mean(c->hzV,n);
  3754. c->hz_std = sqrt(cmVOR_Variance( c->hzV,n,&c->hz_mean));
  3755. //c->score = c->db / ((cmMax(0.1,c->db_std) + cmMax(0.1,c->hz_std))/2);
  3756. c->score = c->db - (c->db_std * 5) - (c->hz_std/50);
  3757. //printf("%f %f %f %f %f\n",c->db,cmMin(0.1,c->db_std),c->hz,cmMin(0.1,c->hz_std),c->score);
  3758. }
  3759. }
  3760. // Generate a filter that is wider for higher frequencies than lower frequencies.
  3761. unsigned _cmFrqTrkFillMap( cmFrqTrk* p, cmReal_t* map, unsigned maxN, cmReal_t hz )
  3762. {
  3763. assert( maxN % 2 == 1 );
  3764. unsigned i;
  3765. cmReal_t maxHz = p->a.srate/2;
  3766. unsigned mapN = cmMin(maxN,ceil(hz/maxHz * maxN));
  3767. if( mapN % 2 == 0 )
  3768. mapN += 1;
  3769. mapN = cmMin(maxN,mapN);
  3770. unsigned N = floor(mapN/2);
  3771. double COEFF = 0.3;
  3772. for(i=0; i<N; ++i)
  3773. {
  3774. map[i] = pow(((double)i+1)/(N+1),COEFF);
  3775. map[mapN-(i+1)] = map[i];
  3776. }
  3777. map[N] = 1.0;
  3778. return mapN;
  3779. }
  3780. void _cmFrqTrkApplyAtten( cmFrqTrk* p, cmReal_t* aV, cmReal_t gain, cmReal_t hz )
  3781. {
  3782. int cbi = cmMin(p->a.binCnt,cmMax(0,round(hz/p->binHz)));
  3783. //cmReal_t map[] = { .25, .5, 1, .5, .25 };
  3784. //int mapN = sizeof(map)/sizeof(map[0]);
  3785. unsigned maxN = 30; // must be odd
  3786. cmReal_t map[ maxN ];
  3787. int mapN = _cmFrqTrkFillMap(p, map, maxN, hz );
  3788. int j;
  3789. int ai = cbi - mapN/2;
  3790. for(j=0; j<mapN; ++j,++ai)
  3791. if( 0 <= ai && ai < p->a.binCnt )
  3792. aV[ai] *= 1.0 - (map[j] * gain);
  3793. }
  3794. void _cmFrqTrkUpdateFilter( cmFrqTrk* p )
  3795. {
  3796. unsigned i;
  3797. cmVOR_Fill(p->aV,p->a.binCnt,1.0);
  3798. for(i=0; i<p->a.chCnt; ++i)
  3799. if( p->ch[i].activeFl )
  3800. {
  3801. cmFrqTrkCh_t* c = p->ch + i;
  3802. //
  3803. if( c->score >= p->a.attenThresh && c->state == kNoStateFrqTrkId )
  3804. {
  3805. //printf("%f\n",c->score);
  3806. c->attenPhsIdx = 0;
  3807. c->state = kDlyFrqTrkId;
  3808. }
  3809. switch( c->state )
  3810. {
  3811. case kNoStateFrqTrkId:
  3812. break;
  3813. case kDlyFrqTrkId:
  3814. c->attenPhsIdx += 1;
  3815. if( c->attenPhsIdx >= p->attenDlyPhsMax && c->dN == 0 )
  3816. c->state = kAtkFrqTrkId;
  3817. break;
  3818. case kAtkFrqTrkId:
  3819. if( c->attenPhsIdx < p->attenDlyPhsMax + p->attenPhsMax )
  3820. {
  3821. c->attenGain = cmMin(1.0,p->a.attenGain * c->attenPhsIdx / p->attenPhsMax);
  3822. _cmFrqTrkApplyAtten(p, p->aV, c->attenGain, c->hz);
  3823. }
  3824. c->attenPhsIdx += 1;
  3825. if( c->attenPhsIdx >= p->attenDlyPhsMax + p->attenPhsMax )
  3826. c->state = kSusFrqTrkId;
  3827. break;
  3828. case kSusFrqTrkId:
  3829. if( c->dN > 0 )
  3830. {
  3831. if( c->attenPhsIdx > 0 )
  3832. {
  3833. c->attenPhsIdx -= 1;
  3834. c->attenGain = cmMin(1.0,p->a.attenGain * c->attenPhsIdx / p->attenPhsMax);
  3835. }
  3836. }
  3837. _cmFrqTrkApplyAtten(p,p->aV, c->attenGain, c->hz);
  3838. if( c->dN >= p->deadN_max )
  3839. c->state = kDcyFrqTrkId;
  3840. break;
  3841. case kDcyFrqTrkId:
  3842. if( c->attenPhsIdx > 0 )
  3843. {
  3844. c->attenPhsIdx -= 1;
  3845. c->attenGain = cmMin(1.0,p->a.attenGain * c->attenPhsIdx / p->attenPhsMax);
  3846. _cmFrqTrkApplyAtten(p,p->aV, c->attenGain, c->hz);
  3847. }
  3848. if( c->attenPhsIdx == 0 )
  3849. c->activeFl = false;
  3850. break;
  3851. }
  3852. }
  3853. }
  3854. // Extend the existing trackers
  3855. void _cmFrqTrkExtendChs( cmFrqTrk* p, const cmReal_t* dbV, const cmReal_t* hzV, unsigned* pkiV, unsigned pkN )
  3856. {
  3857. unsigned i;
  3858. p->curTrkCnt = 0;
  3859. p->deadTrkCnt = 0;
  3860. // sort the channels in descending order
  3861. qsort(p->ch,p->a.chCnt,sizeof(cmFrqTrkCh_t),_cmFrqTrkChCompare);
  3862. // for each active channel
  3863. for(i=0; i<p->a.chCnt; ++i)
  3864. {
  3865. cmFrqTrkCh_t* c = p->ch + i;
  3866. if( c->activeFl )
  3867. {
  3868. unsigned pki;
  3869. // find the best peak to extend tracker 'c'.
  3870. if((pki = _cmFrqTrkFindPeak(p,c,dbV,hzV,pkiV,pkN)) == cmInvalidIdx )
  3871. {
  3872. // no valid track was found to extend tracker 'c'
  3873. c->dN += 1;
  3874. c->tN += 1;
  3875. if( c->dN >= p->deadN_max )
  3876. {
  3877. if( c->attenPhsIdx == 0 )
  3878. c->activeFl = false;
  3879. p->deadTrkCnt += 1;
  3880. }
  3881. }
  3882. else // ... update the tracker using the matching peak
  3883. {
  3884. unsigned j = pkiV[pki];
  3885. c->dN = 0;
  3886. c->db = dbV[ j ];
  3887. c->hz = hzV[ j ];
  3888. c->tN += 1;
  3889. pkiV[pki] = cmInvalidIdx; // mark the peak as unavailable.
  3890. p->curTrkCnt += 1;
  3891. }
  3892. }
  3893. }
  3894. }
  3895. // disable peaks which are within 'stRange' semitones of the frequency of active trackers.
  3896. void _cmFrqTrkDisableClosePeaks( cmFrqTrk* p, const cmReal_t* dbV, const cmReal_t* hzV, unsigned* pkiV, unsigned pkN )
  3897. {
  3898. unsigned i;
  3899. for(i=0; i<p->a.chCnt; ++i)
  3900. {
  3901. const cmFrqTrkCh_t* c = p->ch + i;
  3902. if( !c->activeFl )
  3903. continue;
  3904. cmReal_t hz_min = c->hz * pow(2,-p->a.stRange/12.0);
  3905. cmReal_t hz_max = c->hz * pow(2, p->a.stRange/12.0);
  3906. unsigned j;
  3907. // find all peaks within the frequency range hz_min to hz_max.
  3908. for(j=0; j<pkN; ++j)
  3909. if( pkiV[j] != cmInvalidIdx && hz_min <= c->hz && c->hz <= hz_max )
  3910. pkiV[j] = cmInvalidIdx;
  3911. }
  3912. }
  3913. // Return the index into pkiV[] of the maximum energy peak in dbV[]
  3914. // that is also above kAtkThreshDb.
  3915. unsigned _cmFrqTrkMaxEnergyPeakIndex( const cmFrqTrk* p, const cmReal_t* dbV, const cmReal_t* hzV, const unsigned* pkiV, unsigned pkN )
  3916. {
  3917. cmReal_t mv = p->a.pkAtkThreshDb;
  3918. unsigned mi = cmInvalidIdx;
  3919. unsigned i;
  3920. for(i=0; i<pkN; ++i)
  3921. if( pkiV[i] != cmInvalidIdx && dbV[pkiV[i]] >= mv && hzV[pkiV[i]] < p->a.pkMaxHz )
  3922. {
  3923. mi = i;
  3924. mv = dbV[pkiV[i]];
  3925. }
  3926. return mi;
  3927. }
  3928. // start new trackers
  3929. void _cmFrqTrkNewChs( cmFrqTrk* p, const cmReal_t* dbV, const cmReal_t* hzV, unsigned* pkiV, unsigned pkN )
  3930. {
  3931. p->newTrkCnt = 0;
  3932. while(1)
  3933. {
  3934. unsigned db_max_idx;
  3935. cmFrqTrkCh_t* c;
  3936. // find an inactive channel
  3937. if((c = _cmFrqTrkFindAvailCh(p)) == NULL )
  3938. break;
  3939. // find the largest peak that is above pkAtkThreshDb && less than pkAtkHz.
  3940. if((db_max_idx = _cmFrqTrkMaxEnergyPeakIndex(p,dbV,hzV,pkiV,pkN)) == cmInvalidIdx )
  3941. break;
  3942. // activate a new channel
  3943. c->activeFl = true;
  3944. c->tN = 1;
  3945. c->dN = 0;
  3946. c->hz = hzV[ pkiV[ db_max_idx ] ];
  3947. c->db = dbV[ pkiV[ db_max_idx ] ];
  3948. c->id = p->nextTrkId++;
  3949. c->si = 0;
  3950. c->sn = 0;
  3951. c->score = 0;
  3952. c->state = kNoStateFrqTrkId;
  3953. c->attenPhsIdx = cmInvalidIdx;
  3954. c->attenGain = 1.0;
  3955. // mark the peak as unavailable
  3956. pkiV[ db_max_idx ] = cmInvalidIdx;
  3957. p->newTrkCnt += 1;
  3958. }
  3959. }
  3960. void _cmFrqTrkApplyFrqBias( cmFrqTrk* p, cmReal_t* xV )
  3961. {
  3962. // convert to decibel scale (0.0 - 100.0) and then scale to (0.0 to 1.0)
  3963. unsigned i;
  3964. for(i=0; i<p->bN; ++i)
  3965. xV[i] = cmMax(0.0, (20*log10( cmMax(xV[i]/1.5,0.00001)) + 100.0)/100.0);
  3966. }
  3967. cmRC_t cmFrqTrkExec( cmFrqTrk* p, const cmReal_t* magV, const cmReal_t* phsV, const cmReal_t* hertzV )
  3968. {
  3969. cmRC_t rc = cmOkRC;
  3970. cmReal_t hzV[ p->bN ];
  3971. //cmReal_t powV[ p->bN ];
  3972. //cmReal_t yV[ p->bN];
  3973. //cmVOR_MultVVV(powV,p->bN,magV,magV);
  3974. //cmWhFiltExec(p->wf,powV,p->dbV,p->bN);
  3975. // convert magV to Decibels
  3976. //cmVOR_AmplToDbVV(p->dbV,p->bN, magV, -200.0);
  3977. // copy p->dbV to dbM[hi,:]
  3978. //cmVOR_CopyN(p->dbM + p->hi, p->bN, p->hN, p->dbV, 1 );
  3979. //cmVOR_CopyN(p->dbM + p->hi, p->bN, p->hN, whV, 1 );
  3980. if( 1 )
  3981. {
  3982. cmReal_t powV[ p->bN ];
  3983. cmVOR_MultVVV(powV,p->bN,magV,magV);
  3984. cmWhFiltExec(p->wf,powV,p->dbV,p->bN);
  3985. _cmFrqTrkApplyFrqBias(p,p->dbV);
  3986. }
  3987. else
  3988. {
  3989. // convert magV to Decibels
  3990. cmVOR_AmplToDbVV(p->dbV,p->bN, magV, -200.0);
  3991. }
  3992. // copy p->dbV to dbM[hi,:]
  3993. cmVOR_CopyN(p->dbM + p->hi, p->bN, p->hN, p->dbV, 1 );
  3994. // increment hi to next column to fill in dbM[]
  3995. p->hi = (p->hi + 1) % p->hN;
  3996. // Set dbV[] to spectral magnitude profile by taking the mean over time
  3997. // of the last hN magnitude vectors
  3998. cmVOR_MeanM2(p->dbV, p->dbM, p->hN, p->bN, 0, cmMin(p->fN+1,p->hN));
  3999. //cmVOR_MeanM(p->dbV, p->dbM, p->hN, p->bN, 0);
  4000. if( p->fN >= p->hN )
  4001. {
  4002. // set pkiV[] to the indexes of the peaks above pkThreshDb in i0[]
  4003. unsigned pkN = cmVOR_PeakIndexes(p->pkiV, p->bN, p->dbV, p->bN, p->a.pkThreshDb );
  4004. // set hzV[] to the peak frequencies assoc'd with peaks at dbV[ pkiV[] ].
  4005. _cmFrqTrkMagnToHz(p, p->dbV, p->pkiV, pkN, hzV );
  4006. // extend the existing trackers
  4007. _cmFrqTrkExtendChs(p, p->dbV, hzV, p->pkiV, pkN );
  4008. //_cmFrqTrkDisableClosePeaks(p, p->dbV, hzV, p->pkiV, pkN );
  4009. // create new trackers
  4010. _cmFrqTrkNewChs(p,p->dbV,hzV,p->pkiV,pkN);
  4011. //
  4012. _cmFrqTrkScoreChs(p);
  4013. //
  4014. _cmFrqTrkUpdateFilter(p);
  4015. /*
  4016. // write the log file
  4017. _cmFrqTrkWriteLog(p);
  4018. // write the spectrum output file
  4019. if( p->specFn != NULL )
  4020. cmVectArrayAppendR(p->specVa,p->dbV,p->bN);
  4021. // write the atten output file
  4022. if( p->attenFn != NULL )
  4023. cmVectArrayAppendR(p->attenVa,p->aV,p->bN);
  4024. // write the the level file
  4025. _cmFrqTrkWriteLevel(p,p->dbV,hzV,p->bN);
  4026. */
  4027. }
  4028. p->fN += 1;
  4029. return rc;
  4030. }
  4031. void cmFrqTrkPrint( cmFrqTrk* p )
  4032. {
  4033. printf("srate: %f\n",p->a.srate);
  4034. printf("chCnt: %i\n",p->a.chCnt);
  4035. printf("binCnt: %i (bN=%i)\n",p->a.binCnt,p->bN);
  4036. printf("hopSmpCnt: %i\n",p->a.hopSmpCnt);
  4037. printf("stRange: %f\n",p->a.stRange);
  4038. printf("wndSecs: %f (%i)\n",p->a.wndSecs,p->hN);
  4039. printf("minTrkSec: %f (%i)\n",p->a.minTrkSec,p->minTrkN);
  4040. printf("maxTrkDeadSec: %f (%i)\n",p->a.maxTrkDeadSec,p->deadN_max);
  4041. printf("pkThreshDb: %f\n",p->a.pkThreshDb);
  4042. printf("pkAtkThreshDb: %f\n",p->a.pkAtkThreshDb);
  4043. }
  4044. //------------------------------------------------------------------------------------------------------------
  4045. cmFbCtl_t* cmFbCtlAlloc( cmCtx* c, cmFbCtl_t* ap, const cmFbCtlArgs_t* a )
  4046. {
  4047. cmFbCtl_t* p = cmObjAlloc( cmFbCtl_t, c, ap );
  4048. p->sva = cmVectArrayAlloc(c,kRealVaFl);
  4049. p->uva = cmVectArrayAlloc(c,kRealVaFl);
  4050. if( a != NULL )
  4051. {
  4052. if( cmFbCtlInit( p, a ) != cmOkRC )
  4053. cmFbCtlFree(&p);
  4054. }
  4055. return p;
  4056. }
  4057. cmRC_t cmFbCtlFree( cmFbCtl_t** pp )
  4058. {
  4059. if( pp == NULL || *pp == NULL )
  4060. return cmOkRC;
  4061. cmFbCtl_t* p = *pp;
  4062. cmVectArrayWrite(p->sva, "/home/kevin/temp/frqtrk/fb_ctl_s.va");
  4063. cmVectArrayWrite(p->uva, "/home/kevin/temp/frqtrk/fb_ctl_u.va");
  4064. cmMemFree(p->bM);
  4065. cmMemFree(p->rmsV);
  4066. cmVectArrayFree(&p->sva);
  4067. cmVectArrayFree(&p->uva);
  4068. cmObjFree(pp);
  4069. return cmOkRC;
  4070. }
  4071. cmRC_t cmFbCtlInit( cmFbCtl_t* p, const cmFbCtlArgs_t* a )
  4072. {
  4073. cmRC_t rc;
  4074. if((rc = cmFbCtlFinal(p)) != cmOkRC )
  4075. return rc;
  4076. double binHz = a->srate / ((a->binCnt-1)*2);
  4077. p->a = *a;
  4078. p->frmCnt = (a->bufMs * a->srate / 1000.0) /a->hopSmpCnt;
  4079. p->binCnt = cmMin(p->a.binCnt, a->maxHz/binHz);
  4080. p->bM = cmMemResizeZ(cmReal_t, p->bM, p->binCnt*p->frmCnt);
  4081. p->rmsV = cmMemResizeZ(cmReal_t, p->rmsV, p->frmCnt);
  4082. p->sV = cmMemResizeZ(cmReal_t, p->sV, p->binCnt);
  4083. p->uV = cmMemResizeZ(cmReal_t, p->uV, p->binCnt);
  4084. printf("cmFbCtl: frmCnt:%i binCnt:%i \n",p->frmCnt,p->binCnt);
  4085. return rc;
  4086. }
  4087. cmRC_t cmFbCtlFinal(cmFbCtl_t* p )
  4088. { return cmOkRC; }
  4089. cmRC_t cmFbCtlExec( cmFbCtl_t* p, const cmReal_t* x0V )
  4090. {
  4091. unsigned i;
  4092. cmRC_t rc = cmOkRC;
  4093. cmReal_t xV[ p->binCnt ];
  4094. cmVOR_AmplToDbVV(xV, p->binCnt, x0V, -1000.0 );
  4095. cmVOR_Shift( p->rmsV, p->frmCnt, -1, 0 );
  4096. p->rmsV[0] = cmVOR_Mean(xV,p->binCnt);
  4097. cmVOR_CopyN(p->bM + p->bfi, p->binCnt, p->frmCnt, xV, 1 );
  4098. p->bfi = (p->bfi + 1) % p->frmCnt;
  4099. p->bfN = cmMin(p->bfN+1,p->frmCnt);
  4100. for(i=0; i<p->binCnt; ++i)
  4101. {
  4102. const cmReal_t* v = p->bM + i * p->frmCnt;
  4103. cmReal_t u = cmVOR_Mean(v, p->bfN );
  4104. cmReal_t s = sqrt(cmVOR_Variance(v, p->bfN,&u));
  4105. p->sV[i] = (0.0002 - s);
  4106. p->uV[i] = u;
  4107. }
  4108. cmVectArrayAppendR(p->sva,p->sV,p->binCnt);
  4109. cmVectArrayAppendR(p->uva,p->uV,p->binCnt);
  4110. return rc;
  4111. }
  4112. //------------------------------------------------------------------------------------------------------------
  4113. cmSpecDist_t* cmSpecDistAlloc( cmCtx* ctx,cmSpecDist_t* ap, unsigned procSmpCnt, double srate, unsigned wndSmpCnt, unsigned hopFcmt, unsigned olaWndTypeId )
  4114. {
  4115. cmSpecDist_t* p = cmObjAlloc( cmSpecDist_t, ctx, ap );
  4116. p->iSpecVa = cmVectArrayAlloc(ctx,kRealVaFl);
  4117. p->oSpecVa = cmVectArrayAlloc(ctx,kRealVaFl);
  4118. if( procSmpCnt != 0 )
  4119. {
  4120. if( cmSpecDistInit( p, procSmpCnt, srate, wndSmpCnt, hopFcmt, olaWndTypeId ) != cmOkRC )
  4121. cmSpecDistFree(&p);
  4122. }
  4123. return p;
  4124. }
  4125. cmRC_t cmSpecDistFree( cmSpecDist_t** pp )
  4126. {
  4127. if( pp == NULL || *pp == NULL )
  4128. return cmOkRC;
  4129. cmSpecDist_t* p = *pp;
  4130. cmSpecDistFinal(p);
  4131. cmVectArrayFree(&p->iSpecVa);
  4132. cmVectArrayFree(&p->oSpecVa);
  4133. cmMemPtrFree(&p->hzV);
  4134. cmMemPtrFree(&p->iSpecM);
  4135. cmMemPtrFree(&p->oSpecM);
  4136. cmMemPtrFree(&p->iSpecV);
  4137. cmMemPtrFree(&p->oSpecV);
  4138. cmObjFree(pp);
  4139. return cmOkRC;
  4140. }
  4141. cmRC_t cmSpecDistInit( cmSpecDist_t* p, unsigned procSmpCnt, double srate, unsigned wndSmpCnt, unsigned hopFcmt, unsigned olaWndTypeId )
  4142. {
  4143. cmFrqTrkArgs_t fta;
  4144. cmRC_t rc;
  4145. if((rc = cmSpecDistFinal(p)) != cmOkRC )
  4146. return rc;
  4147. unsigned flags = 0;
  4148. p->srate = srate;
  4149. p->wndSmpCnt = wndSmpCnt;
  4150. p->hopSmpCnt = (unsigned)floor(wndSmpCnt/hopFcmt);
  4151. p->procSmpCnt = procSmpCnt;
  4152. p->mode = kBasicModeSdId;
  4153. p->thresh = 60;
  4154. p->offset = 0;
  4155. p->invertFl = false;
  4156. p->uprSlope = 0.0;
  4157. p->lwrSlope = 2.0;
  4158. p->pva = cmPvAnlAlloc( p->obj.ctx, NULL, procSmpCnt, srate, wndSmpCnt, p->hopSmpCnt, flags );
  4159. p->pvs = cmPvSynAlloc( p->obj.ctx, NULL, procSmpCnt, srate, wndSmpCnt, p->hopSmpCnt, olaWndTypeId );
  4160. fta.srate = srate;
  4161. fta.chCnt = 50;
  4162. fta.binCnt = p->pva->binCnt;
  4163. fta.hopSmpCnt = p->pva->hopSmpCnt;
  4164. fta.stRange = 0.25;
  4165. fta.wndSecs = 0.25;
  4166. fta.minTrkSec = 0.25;
  4167. fta.maxTrkDeadSec = 0.25;
  4168. fta.pkThreshDb = 0.1; //-110.0;
  4169. fta.pkAtkThreshDb = 0.4; //-60.0;
  4170. fta.pkMaxHz = 20000;
  4171. fta.whFiltCoeff = 0.33;
  4172. fta.attenThresh = 0.4;
  4173. fta.attenGain = 0.5;
  4174. fta.attenDlySec = 1.0;
  4175. fta.attenAtkSec = 1.0;
  4176. fta.logFn = "/home/kevin/temp/frqtrk/trk_log.va";
  4177. fta.levelFn = "/home/kevin/temp/frqtrk/level.va";
  4178. fta.specFn = "/home/kevin/temp/frqtrk/spec.va";
  4179. fta.attenFn = "/home/kevin/temp/frqtrk/atten.va";
  4180. p->ft = cmFrqTrkAlloc( p->obj.ctx, NULL, &fta );
  4181. cmFrqTrkPrint(p->ft);
  4182. cmFbCtlArgs_t fba;
  4183. fba.srate = srate;
  4184. fba.binCnt = p->pva->binCnt;
  4185. fba.hopSmpCnt = p->hopSmpCnt;
  4186. fba.bufMs = 500;
  4187. fba.maxHz = 5000;
  4188. p->fbc = cmFbCtlAlloc( p->obj.ctx, NULL, &fba );
  4189. p->spcBwHz = cmMin(srate/2,10000);
  4190. p->spcSmArg = 0.05;
  4191. p->spcMin = p->spcBwHz;
  4192. p->spcMax = 0.0;
  4193. p->spcSum = 0.0;
  4194. p->spcCnt = 0;
  4195. double binHz = srate / p->pva->wndSmpCnt;
  4196. p->spcBinCnt = (unsigned)floor(p->spcBwHz / binHz);
  4197. p->hzV = cmMemResizeZ(cmReal_t,p->hzV,p->spcBinCnt);
  4198. cmVOR_Seq( p->hzV, p->spcBinCnt, 0, 1 );
  4199. cmVOR_MultVS( p->hzV, p->spcBinCnt, binHz );
  4200. p->aeUnit = 0;
  4201. p->aeMin = 1000;
  4202. p->aeMax = -1000;
  4203. double histSecs = 0.05;
  4204. p->hN = cmMax(1,histSecs * p->srate / p->hopSmpCnt );
  4205. p->iSpecM = cmMemResizeZ(cmReal_t,p->iSpecM,p->hN*p->pva->binCnt);
  4206. p->oSpecM = cmMemResizeZ(cmReal_t,p->oSpecM,p->hN*p->pva->binCnt);
  4207. p->iSpecV = cmMemResizeZ(cmReal_t,p->iSpecV, p->pva->binCnt);
  4208. p->oSpecV = cmMemResizeZ(cmReal_t,p->oSpecV, p->pva->binCnt);
  4209. p->hi = 0;
  4210. //p->bypOut = cmMemResizeZ(cmSample_t, p->bypOut, procSmpCnt );
  4211. return rc;
  4212. }
  4213. cmRC_t cmSpecDistFinal(cmSpecDist_t* p )
  4214. {
  4215. cmRC_t rc = cmOkRC;
  4216. cmVectArrayWrite(p->iSpecVa, "/home/kevin/temp/frqtrk/iSpec.va");
  4217. cmVectArrayWrite(p->oSpecVa, "/home/kevin/temp/frqtrk/oSpec.va");
  4218. cmPvAnlFree(&p->pva);
  4219. cmPvSynFree(&p->pvs);
  4220. cmFrqTrkFree(&p->ft);
  4221. cmFbCtlFree(&p->fbc);
  4222. return rc;
  4223. }
  4224. void _cmSpecDistBasicMode0(cmSpecDist_t* p, cmReal_t* X1m, unsigned binCnt, cmReal_t thresh )
  4225. {
  4226. // octavez> thresh = 60;
  4227. // octave> X1m = [-62 -61 -60 -59];
  4228. // octave> -abs(abs(X1m+thresh)-(X1m+thresh)) - thresh
  4229. // octave> ans = -64 -62 -60 -60
  4230. unsigned i=0;
  4231. for(i=0; i<binCnt; ++i)
  4232. {
  4233. cmReal_t a = fabs(X1m[i]);
  4234. cmReal_t d = a - thresh;
  4235. X1m[i] = -thresh;
  4236. if( d > 0 )
  4237. X1m[i] -= 2*d;
  4238. }
  4239. }
  4240. void _cmSpecDistBasicMode(cmSpecDist_t* p, cmReal_t* X1m, unsigned binCnt, cmReal_t thresh )
  4241. {
  4242. unsigned i=0;
  4243. if( p->lwrSlope < 0.3 )
  4244. p->lwrSlope = 0.3;
  4245. for(i=0; i<binCnt; ++i)
  4246. {
  4247. cmReal_t a = fabs(X1m[i]);
  4248. cmReal_t d = a - thresh;
  4249. X1m[i] = -thresh;
  4250. if( d > 0 )
  4251. X1m[i] -= (p->lwrSlope*d);
  4252. else
  4253. X1m[i] -= (p->uprSlope*d);
  4254. }
  4255. }
  4256. cmReal_t _cmSpecDistCentMode( cmSpecDist_t* p, cmReal_t* X1m )
  4257. {
  4258. // calc the spectral centroid
  4259. double num = cmVOR_MultSumVV( p->pva->magV, p->hzV, p->spcBinCnt );
  4260. double den = cmVOR_Sum( p->pva->magV, p->spcBinCnt );
  4261. double result = 0;
  4262. if( den != 0 )
  4263. result = num/den;
  4264. // apply smoothing filter to spectral centroid
  4265. p->spc = (result * p->spcSmArg) + (p->spc * (1.0-p->spcSmArg));
  4266. // track spec. cetr. min and max
  4267. p->spcMin = cmMin(p->spcMin,p->spc);
  4268. p->spcMax = cmMax(p->spcMax,p->spc);
  4269. //-----------------------------------------------------
  4270. ++p->spcCnt;
  4271. p->spcSum += p->spc;
  4272. p->spcSqSum += p->spc * p->spc;
  4273. // use the one-pass std-dev calc. trick
  4274. //double mean = p->spcSum / p->spcCnt;
  4275. //double variance = p->spcSqSum / p->spcCnt - mean * mean;
  4276. //double std_dev = sqrt(variance);
  4277. double smin = p->spcMin;
  4278. double smax = p->spcMax;
  4279. //smin = mean - std_dev;
  4280. //smax = mean + std_dev;
  4281. //-----------------------------------------------------
  4282. // convert spec. cent. to unit range
  4283. double spcUnit = (p->spc - smin) / (smax - smin);
  4284. spcUnit = cmMin(1.0,cmMax(0.0,spcUnit));
  4285. if( p->invertFl )
  4286. spcUnit = 1.0 - spcUnit;
  4287. //if( p->spcMin==p->spc || p->spcMax==p->spc )
  4288. // printf("min:%f avg:%f sd:%f max:%f\n",p->spcMin,p->spcSum/p->spcCnt,std_dev,p->spcMax);
  4289. return spcUnit;
  4290. }
  4291. void _cmSpecDistBump( cmSpecDist_t* p, cmReal_t* x, unsigned binCnt, double thresh)
  4292. {
  4293. /*
  4294. thresh *= -1;
  4295. minDb = -100;
  4296. if db < minDb
  4297. db = minDb;
  4298. endif
  4299. if db > thresh
  4300. y = 1;
  4301. else
  4302. x = (minDb - db)/(minDb - thresh);
  4303. y = x + (x - (x.^coeff));
  4304. endif
  4305. y = minDb + abs(minDb) * y;
  4306. */
  4307. unsigned i=0;
  4308. //printf("%f %f %f\n",thresh,p->lwrSlope,x[0]);
  4309. double minDb = -100.0;
  4310. thresh = -thresh;
  4311. for(i=0; i<binCnt; ++i)
  4312. {
  4313. double y;
  4314. if( x[i] < minDb )
  4315. x[i] = minDb;
  4316. if( x[i] > thresh )
  4317. y = 1;
  4318. else
  4319. {
  4320. y = (minDb - x[i])/(minDb - thresh);
  4321. y += y - pow(y,p->lwrSlope);
  4322. }
  4323. x[i] = minDb + (-minDb) * y;
  4324. }
  4325. }
  4326. void _cmSpecDistAmpEnvMode( cmSpecDist_t* p, cmReal_t* X1m )
  4327. {
  4328. cmReal_t smCoeff = 0.1;
  4329. //
  4330. cmReal_t mx = cmVOR_Max(X1m,p->pva->binCnt,1);
  4331. p->aeSmMax = (mx * smCoeff) + (p->aeSmMax * (1.0-smCoeff));
  4332. cmReal_t a = cmVOR_Mean(X1m,p->pva->binCnt);
  4333. p->ae = (a * smCoeff) + (p->ae * (1.0-smCoeff));
  4334. p->aeMin = cmMin(p->ae,p->aeMin);
  4335. p->aeMax = cmMax(p->ae,p->aeMax);
  4336. p->aeUnit = (p->ae - p->aeMin) / (p->aeMax-p->aeMin);
  4337. p->aeUnit = cmMin(1.0,cmMax(0.0,p->aeUnit));
  4338. if( p->invertFl )
  4339. p->aeUnit = 1.0 - p->aeUnit;
  4340. //printf("%f\n",p->aeSmMax);
  4341. }
  4342. void _cmSpecDistPhaseMod( cmSpecDist_t* p, cmReal_t* phsV, unsigned binCnt )
  4343. {
  4344. unsigned i;
  4345. cmReal_t offs = sin( 0.1 * 2.0 * M_PI * (p->phaseModIndex++) / (p->srate/p->hopSmpCnt) );
  4346. //printf("offs %f %i %i %f\n",offs,p->phaseModIndex,p->hopSmpCnt,p->srate);
  4347. cmReal_t new_phs = phsV[0] + offs;
  4348. for(i=0; i<binCnt-1; ++i)
  4349. {
  4350. while( new_phs > M_PI )
  4351. new_phs -= 2.0*M_PI;
  4352. while( new_phs < -M_PI )
  4353. new_phs += 2.0*M_PI;
  4354. cmReal_t d = phsV[i+1] - phsV[i];
  4355. phsV[i] = new_phs;
  4356. new_phs += d;
  4357. }
  4358. }
  4359. cmRC_t cmSpecDistExec( cmSpecDist_t* p, const cmSample_t* sp, unsigned sn )
  4360. {
  4361. assert( sn == p->procSmpCnt );
  4362. bool recordFl = false;
  4363. // cmPvAnlExec() returns true when it calc's a new spectral output frame
  4364. if( cmPvAnlExec( p->pva, sp, sn ) )
  4365. {
  4366. cmReal_t X1m[p->pva->binCnt];
  4367. // take the mean of the the input magntitude spectrum
  4368. cmReal_t u0 = cmVOR_Mean(p->pva->magV,p->pva->binCnt);
  4369. if(recordFl)
  4370. {
  4371. // store a time windowed average of the input spectrum to p->iSpecV
  4372. cmVOR_CopyN(p->iSpecM + p->hi, p->pva->binCnt, p->hN, X1m, 1 );
  4373. cmVOR_MeanM2(p->iSpecV, p->iSpecM, p->hN, p->pva->binCnt, 0, cmMin(p->fi+1,p->hN));
  4374. }
  4375. cmVOR_AmplToDbVV(X1m, p->pva->binCnt, p->pva->magV, -1000.0 );
  4376. //cmVOR_AmplToDbVV(X1m, p->pva->binCnt, X1m, -1000.0 );
  4377. switch( p->mode )
  4378. {
  4379. case kBypassModeSdId:
  4380. break;
  4381. case kBasicModeSdId:
  4382. _cmSpecDistBasicMode(p,X1m,p->pva->binCnt,p->thresh);
  4383. break;
  4384. case kSpecCentSdId:
  4385. {
  4386. _cmSpecDistAmpEnvMode(p,X1m);
  4387. double spcUnit = _cmSpecDistCentMode(p,X1m);
  4388. double thresh = fabs(p->aeSmMax) - (spcUnit*p->offset);
  4389. _cmSpecDistBasicMode(p,X1m,p->pva->binCnt, thresh);
  4390. }
  4391. break;
  4392. case kAmpEnvSdId:
  4393. {
  4394. _cmSpecDistAmpEnvMode(p,X1m);
  4395. //double thresh = fabs(p->aeSmMax) - p->offset;
  4396. double thresh = fabs(p->aeSmMax) - (p->aeUnit*p->offset);
  4397. thresh = fabs(p->thresh) - (p->aeUnit*p->offset);
  4398. _cmSpecDistBasicMode(p,X1m,p->pva->binCnt, thresh);
  4399. }
  4400. break;
  4401. case kBumpSdId:
  4402. _cmSpecDistBump(p,X1m, p->pva->binCnt, p->offset);
  4403. _cmSpecDistBasicMode(p,X1m,p->pva->binCnt,p->thresh);
  4404. break;
  4405. case 5:
  4406. break;
  4407. default:
  4408. break;
  4409. }
  4410. cmVOR_DbToAmplVV(X1m, p->pva->binCnt, X1m );
  4411. // run and apply the tracker/supressor
  4412. cmFrqTrkExec(p->ft, X1m, p->pva->phsV, NULL );
  4413. //cmVOR_MultVV(X1m, p->pva->binCnt,p->ft->aV );
  4414. // convert the mean input magnitude to db
  4415. cmReal_t idb = 20*log10(u0);
  4416. // get the mean output magnitude spectra
  4417. cmReal_t u1 = cmVOR_Mean(X1m,p->pva->binCnt);
  4418. if( idb > -150.0 )
  4419. {
  4420. // set the output gain such that the mean output magnitude
  4421. // will match the mean input magnitude
  4422. p->ogain = u0/u1;
  4423. }
  4424. else
  4425. {
  4426. cmReal_t a0 = 0.9;
  4427. p->ogain *= a0;
  4428. }
  4429. cmVOR_MultVS(X1m,p->pva->binCnt,cmMin(4.0,p->ogain));
  4430. //cmFbCtlExec(p->fbc,X1m);
  4431. //cmReal_t v[ p->pva->binCnt ];
  4432. //cmVOR_Copy(v,p->pva->binCnt,p->pva->phsV);
  4433. //_cmSpecDistPhaseMod(p, v, p->pva->binCnt );
  4434. if(recordFl)
  4435. {
  4436. // store a time windowed average of the output spectrum to p->iSpecV
  4437. cmVOR_CopyN(p->oSpecM + p->hi, p->pva->binCnt, p->hN, X1m, 1 );
  4438. cmVOR_MeanM2(p->oSpecV, p->oSpecM, p->hN, p->pva->binCnt, 0, cmMin(p->fi+1,p->hN));
  4439. // store iSpecV and oSpecV to iSpecVa and oSpecVa to create debugging files
  4440. cmVectArrayAppendR(p->iSpecVa,p->iSpecV,p->pva->binCnt);
  4441. cmVectArrayAppendR(p->oSpecVa,p->oSpecV,p->pva->binCnt);
  4442. p->hi = (p->hi + 1) % p->hN;
  4443. }
  4444. cmPvSynExec(p->pvs, X1m, p->pva->phsV );
  4445. p->fi += 1;
  4446. }
  4447. return cmOkRC;
  4448. }
  4449. const cmSample_t* cmSpecDistOut( cmSpecDist_t* p )
  4450. {
  4451. return cmPvSynExecOut(p->pvs);
  4452. }
  4453. //------------------------------------------------------------------------------------------------------------
  4454. cmRC_t _cmBinMtxFileWriteHdr( cmBinMtxFile_t* p )
  4455. {
  4456. cmFileRC_t fileRC;
  4457. unsigned n = 3;
  4458. unsigned hdr[n];
  4459. hdr[0] = p->rowCnt;
  4460. hdr[1] = p->maxRowEleCnt;
  4461. hdr[2] = p->eleByteCnt;
  4462. if((fileRC = cmFileSeek(p->fh,kBeginFileFl,0)) != kOkFileRC )
  4463. return cmCtxRtCondition(&p->obj, fileRC, "File seek failed on matrix file:'%s'.", cmStringNullGuard(cmFileName(p->fh)));
  4464. if((fileRC = cmFileWriteUInt(p->fh,hdr,n)) != kOkFileRC )
  4465. return cmCtxRtCondition( &p->obj, fileRC, "Header write failed on matrix file:'%s'.", cmStringNullGuard(cmFileName(p->fh)) );
  4466. return cmOkRC;
  4467. }
  4468. cmBinMtxFile_t* cmBinMtxFileAlloc( cmCtx* ctx, cmBinMtxFile_t* ap, const cmChar_t* fn )
  4469. {
  4470. cmBinMtxFile_t* p = cmObjAlloc( cmBinMtxFile_t, ctx, ap );
  4471. if( fn != NULL )
  4472. if( cmBinMtxFileInit( p, fn ) != cmOkRC )
  4473. cmBinMtxFileFree(&p);
  4474. return p;
  4475. }
  4476. cmRC_t cmBinMtxFileFree( cmBinMtxFile_t** pp )
  4477. {
  4478. cmRC_t rc;
  4479. if( pp==NULL || *pp == NULL )
  4480. return cmOkRC;
  4481. cmBinMtxFile_t* p = *pp;
  4482. if((rc = cmBinMtxFileFinal(p)) == cmOkRC )
  4483. {
  4484. cmObjFree(pp);
  4485. }
  4486. return rc;
  4487. }
  4488. cmRC_t cmBinMtxFileInit( cmBinMtxFile_t* p, const cmChar_t* fn )
  4489. {
  4490. cmRC_t rc;
  4491. cmFileRC_t fileRC;
  4492. if((rc = cmBinMtxFileFinal(p)) != cmOkRC )
  4493. return rc;
  4494. // open the output file for writing
  4495. if((fileRC = cmFileOpen(&p->fh,fn,kWriteFileFl | kBinaryFileFl, p->obj.err.rpt)) != kOkFileRC )
  4496. return cmCtxRtCondition( &p->obj, fileRC, "Unable to open the matrix file:'%s'", cmStringNullGuard(fn) );
  4497. // iniitlaize the object
  4498. p->rowCnt = 0;
  4499. p->maxRowEleCnt = 0;
  4500. p->eleByteCnt = 0;
  4501. // write the blank header as place holder
  4502. if((rc = _cmBinMtxFileWriteHdr(p)) != cmOkRC )
  4503. return rc;
  4504. return rc;
  4505. }
  4506. cmRC_t cmBinMtxFileFinal( cmBinMtxFile_t* p )
  4507. {
  4508. cmRC_t rc;
  4509. cmFileRC_t fileRC;
  4510. if( p != NULL && cmFileIsValid(p->fh))
  4511. {
  4512. // re-write the file header
  4513. if((rc = _cmBinMtxFileWriteHdr(p)) != cmOkRC )
  4514. return rc;
  4515. // close the file
  4516. if((fileRC = cmFileClose(&p->fh)) != kOkFileRC )
  4517. return cmCtxRtCondition(&p->obj, fileRC, "Matrix file close failed on:'%s'",cmStringNullGuard(cmFileName(p->fh)));
  4518. }
  4519. return cmOkRC;
  4520. }
  4521. bool cmBinMtxFileIsValid( cmBinMtxFile_t* p )
  4522. { return p != NULL && cmFileIsValid(p->fh); }
  4523. cmRC_t _cmBinMtxFileWriteRow( cmBinMtxFile_t* p, const void* buf, unsigned eleCnt, unsigned eleByteCnt )
  4524. {
  4525. cmFileRC_t fileRC;
  4526. if((fileRC = cmFileWrite(p->fh,&eleCnt,sizeof(eleCnt))) != kOkFileRC )
  4527. return cmCtxRtCondition(&p->obj, fileRC, "Matrix file row at index %i element count write failed on '%s'.", p->rowCnt, cmStringNullGuard(cmFileName(p->fh)));
  4528. if((fileRC = cmFileWrite(p->fh,buf,eleCnt*eleByteCnt)) != kOkFileRC )
  4529. return cmCtxRtCondition(&p->obj, fileRC, "Matrix file row at index %i data write failed on '%s'.", p->rowCnt, cmStringNullGuard(cmFileName(p->fh)));
  4530. if( eleCnt > p->maxRowEleCnt )
  4531. p->maxRowEleCnt = eleCnt;
  4532. ++p->rowCnt;
  4533. return cmOkRC;
  4534. }
  4535. cmRC_t cmBinMtxFileExecS( cmBinMtxFile_t* p, const cmSample_t* x, unsigned xn )
  4536. {
  4537. // verify that all rows are written as cmSample_t
  4538. assert( p->eleByteCnt == 0 || p->eleByteCnt == sizeof(cmSample_t));
  4539. p->eleByteCnt = sizeof(cmSample_t);
  4540. return _cmBinMtxFileWriteRow(p,x,xn,p->eleByteCnt);
  4541. }
  4542. cmRC_t cmBinMtxFileExecR( cmBinMtxFile_t* p, const cmReal_t* x, unsigned xn )
  4543. {
  4544. // verify that all rows are written as cmReal_t
  4545. assert( p->eleByteCnt == 0 || p->eleByteCnt == sizeof(cmReal_t));
  4546. p->eleByteCnt = sizeof(cmReal_t);
  4547. return _cmBinMtxFileWriteRow(p,x,xn,p->eleByteCnt);
  4548. }
  4549. cmRC_t cmBinMtxFileWrite( const cmChar_t* fn, unsigned rowCnt, unsigned colCnt, const cmSample_t* sp, const cmReal_t* rp, cmCtx* ctx, cmRpt_t* rpt )
  4550. {
  4551. assert( sp == NULL || rp == NULL );
  4552. cmCtx* ctxp = NULL;
  4553. cmBinMtxFile_t* bp = NULL;
  4554. if( ctx == NULL )
  4555. ctx = ctxp = cmCtxAlloc(NULL,rpt,cmLHeapNullHandle,cmSymTblNullHandle);
  4556. if((bp = cmBinMtxFileAlloc(ctx,NULL,fn)) != NULL )
  4557. {
  4558. unsigned i = 0;
  4559. cmSample_t* sbp = sp == NULL ? NULL : cmMemAlloc(cmSample_t,colCnt);
  4560. cmReal_t* rbp = rp == NULL ? NULL : cmMemAlloc(cmReal_t,colCnt);
  4561. for(i=0; i<rowCnt; ++i)
  4562. {
  4563. if( sp!=NULL )
  4564. {
  4565. cmVOS_CopyN(sbp,colCnt,1,sp+i,rowCnt);
  4566. cmBinMtxFileExecS(bp,sbp,colCnt);
  4567. }
  4568. if( rp!=NULL )
  4569. {
  4570. cmVOR_CopyN(rbp,colCnt,1,rp+i,rowCnt);
  4571. cmBinMtxFileExecR(bp,rbp,colCnt);
  4572. }
  4573. }
  4574. cmMemPtrFree(&sbp);
  4575. cmMemPtrFree(&rbp);
  4576. cmBinMtxFileFree(&bp);
  4577. }
  4578. if( ctxp != NULL )
  4579. cmCtxFree(&ctxp);
  4580. return cmOkRC;
  4581. }
  4582. cmRC_t _cmBinMtxFileReadHdr( cmCtx_t* ctx, cmFileH_t h, unsigned* rowCntPtr, unsigned* colCntPtr, unsigned* eleByteCntPtr, const cmChar_t* fn )
  4583. {
  4584. cmRC_t rc = cmOkRC;
  4585. unsigned hdr[3];
  4586. if( cmFileRead(h,&hdr,sizeof(hdr)) != kOkFileRC )
  4587. {
  4588. rc = cmErrMsg(&ctx->err,cmSubSysFailRC,"Binary matrix file header read failed on '%s'.",cmStringNullGuard(fn));
  4589. goto errLabel;
  4590. }
  4591. if( rowCntPtr != NULL )
  4592. *rowCntPtr = hdr[0];
  4593. if( colCntPtr != NULL )
  4594. *colCntPtr = hdr[1];
  4595. if( eleByteCntPtr != NULL )
  4596. *eleByteCntPtr = hdr[2];
  4597. errLabel:
  4598. return rc;
  4599. }
  4600. cmRC_t cmBinMtxFileSize( cmCtx_t* ctx, const cmChar_t* fn, unsigned* rowCntPtr, unsigned* colCntPtr, unsigned* eleByteCntPtr )
  4601. {
  4602. cmFileH_t h = cmFileNullHandle;
  4603. cmRC_t rc = cmOkRC;
  4604. if(cmFileOpen(&h,fn,kReadFileFl | kBinaryFileFl, ctx->err.rpt) != kOkFileRC )
  4605. {
  4606. rc = cmErrMsg(&ctx->err,cmSubSysFailRC,"Binary matrix file:%s open failed.",cmStringNullGuard(fn));
  4607. goto errLabel;
  4608. }
  4609. rc = _cmBinMtxFileReadHdr(ctx,h,rowCntPtr,colCntPtr,eleByteCntPtr,fn);
  4610. errLabel:
  4611. cmFileClose(&h);
  4612. return rc;
  4613. }
  4614. cmRC_t cmBinMtxFileRead( cmCtx_t* ctx, const cmChar_t* fn, unsigned mRowCnt, unsigned mColCnt, unsigned mEleByteCnt, void* retBuf, unsigned* colCntV )
  4615. {
  4616. cmFileH_t h = cmFileNullHandle;
  4617. cmRC_t rc = cmOkRC;
  4618. char* rowBuf = NULL;
  4619. unsigned rowCnt,colCnt,eleByteCnt,i;
  4620. cmErr_t err;
  4621. cmErrSetup(&err,ctx->err.rpt,"Binary Matrix File Reader");
  4622. if(cmFileOpen(&h,fn,kReadFileFl | kBinaryFileFl, err.rpt) != kOkFileRC )
  4623. {
  4624. rc = cmErrMsg(&err,cmSubSysFailRC,"Binary matrix file:%s open failed.",cmStringNullGuard(fn));
  4625. goto errLabel;
  4626. }
  4627. if((rc = _cmBinMtxFileReadHdr(ctx,h,&rowCnt,&colCnt,&eleByteCnt,fn)) != cmOkRC )
  4628. goto errLabel;
  4629. if( mRowCnt != rowCnt )
  4630. rc = cmErrMsg(&err,cmArgAssertRC,"The binary matrix file row count and the return buffer row count are not the same.");
  4631. if( mColCnt != colCnt )
  4632. rc = cmErrMsg(&err,cmArgAssertRC,"The binary matrix file column count and the return buffer column count are not the same.");
  4633. if( mEleByteCnt != eleByteCnt )
  4634. rc = cmErrMsg(&err,cmArgAssertRC,"The binary matrix file element byte count and the return buffer element byte count are not the same.");
  4635. if( rc == cmOkRC )
  4636. {
  4637. rowBuf = cmMemAllocZ(char,colCnt*eleByteCnt);
  4638. for(i=0; i<rowCnt; ++i)
  4639. {
  4640. unsigned cn;
  4641. // read the row length
  4642. if( cmFileReadUInt(h,&cn,1) != kOkFileRC )
  4643. {
  4644. rc = cmErrMsg(&err,cmSubSysFailRC,"Error reading row length at row index:%i.",i);
  4645. goto errLabel;
  4646. }
  4647. if( colCntV != NULL )
  4648. colCntV[i] = cn;
  4649. // verify the actual col count does not exceed the max col count
  4650. if( cn > colCnt )
  4651. {
  4652. rc = cmErrMsg(&err,cmSubSysFailRC,"The actual column count:%i exceeds the max column count:%i.",cn,colCnt);
  4653. goto errLabel;
  4654. }
  4655. //read the row data
  4656. if( cmFileReadChar(h,rowBuf,cn*eleByteCnt) != kOkFileRC )
  4657. {
  4658. rc = cmErrMsg(&err,cmSubSysFailRC,"File read failed at row index:%i.",i);
  4659. goto errLabel;
  4660. }
  4661. char* dp = ((char*)retBuf) + i * eleByteCnt;
  4662. // the data is read in row-major order but the matrix must be
  4663. // returned on col major order - rearrange the columns here.
  4664. switch(eleByteCnt)
  4665. {
  4666. case sizeof(cmSample_t):
  4667. cmVOS_CopyN(((cmSample_t*)dp), cn, rowCnt, (cmSample_t*)rowBuf, 1 );
  4668. break;
  4669. case sizeof(cmReal_t):
  4670. cmVOR_CopyN(((cmReal_t*)dp), cn, rowCnt, (cmReal_t*)rowBuf, 1 );
  4671. break;
  4672. default:
  4673. rc = cmErrMsg(&err,cmSubSysFailRC,"Invalid element byte count:%i.",eleByteCnt);
  4674. goto errLabel;
  4675. }
  4676. }
  4677. }
  4678. errLabel:
  4679. cmMemPtrFree(&rowBuf);
  4680. cmFileClose(&h);
  4681. return rc;
  4682. }