1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860 |
- /*******************************************************************************
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 1998-2001,2003-2011,2013 Stewart Heitmann
- * <sheitmann@users.sourceforge.net>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #define ARG_AMALGAMATION
- /*******************************************************************************
- * argtable3_private: Declares private types, constants, and interfaces
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 2013-2019 Tom G. Huang
- * <tomghuang@gmail.com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #ifndef ARG_UTILS_H
- #define ARG_UTILS_H
- #include <stdlib.h>
- #define ARG_ENABLE_TRACE 0
- #define ARG_ENABLE_LOG 1
- #ifdef __cplusplus
- extern "C" {
- #endif
- enum { ARG_ERR_MINCOUNT = 1, ARG_ERR_MAXCOUNT, ARG_ERR_BADINT, ARG_ERR_OVERFLOW, ARG_ERR_BADDOUBLE, ARG_ERR_BADDATE, ARG_ERR_REGNOMATCH };
- typedef void(arg_panicfn)(const char* fmt, ...);
- #if defined(_MSC_VER)
- #define ARG_TRACE(x) \
- __pragma(warning(push)) __pragma(warning(disable : 4127)) do { \
- if (ARG_ENABLE_TRACE) \
- dbg_printf x; \
- } \
- while (0) \
- __pragma(warning(pop))
- #define ARG_LOG(x) \
- __pragma(warning(push)) __pragma(warning(disable : 4127)) do { \
- if (ARG_ENABLE_LOG) \
- dbg_printf x; \
- } \
- while (0) \
- __pragma(warning(pop))
- #else
- #define ARG_TRACE(x) \
- do { \
- if (ARG_ENABLE_TRACE) \
- dbg_printf x; \
- } while (0)
- #define ARG_LOG(x) \
- do { \
- if (ARG_ENABLE_LOG) \
- dbg_printf x; \
- } while (0)
- #endif
- extern void dbg_printf(const char* fmt, ...);
- extern void arg_set_panic(arg_panicfn* proc);
- extern void* xmalloc(size_t size);
- extern void* xcalloc(size_t count, size_t size);
- extern void* xrealloc(void* ptr, size_t size);
- extern void xfree(void* ptr);
- struct arg_hashtable_entry {
- void *k, *v;
- unsigned int h;
- struct arg_hashtable_entry* next;
- };
- typedef struct arg_hashtable {
- unsigned int tablelength;
- struct arg_hashtable_entry** table;
- unsigned int entrycount;
- unsigned int loadlimit;
- unsigned int primeindex;
- unsigned int (*hashfn)(const void* k);
- int (*eqfn)(const void* k1, const void* k2);
- } arg_hashtable_t;
- /**
- * @brief Create a hash table.
- *
- * @param minsize minimum initial size of hash table
- * @param hashfn function for hashing keys
- * @param eqfn function for determining key equality
- * @return newly created hash table or NULL on failure
- */
- arg_hashtable_t* arg_hashtable_create(unsigned int minsize, unsigned int (*hashfn)(const void*), int (*eqfn)(const void*, const void*));
- /**
- * @brief This function will cause the table to expand if the insertion would take
- * the ratio of entries to table size over the maximum load factor.
- *
- * This function does not check for repeated insertions with a duplicate key.
- * The value returned when using a duplicate key is undefined -- when
- * the hash table changes size, the order of retrieval of duplicate key
- * entries is reversed.
- * If in doubt, remove before insert.
- *
- * @param h the hash table to insert into
- * @param k the key - hash table claims ownership and will free on removal
- * @param v the value - does not claim ownership
- * @return non-zero for successful insertion
- */
- void arg_hashtable_insert(arg_hashtable_t* h, void* k, void* v);
- #define ARG_DEFINE_HASHTABLE_INSERT(fnname, keytype, valuetype) \
- int fnname(arg_hashtable_t* h, keytype* k, valuetype* v) { return arg_hashtable_insert(h, k, v); }
- /**
- * @brief Search the specified key in the hash table.
- *
- * @param h the hash table to search
- * @param k the key to search for - does not claim ownership
- * @return the value associated with the key, or NULL if none found
- */
- void* arg_hashtable_search(arg_hashtable_t* h, const void* k);
- #define ARG_DEFINE_HASHTABLE_SEARCH(fnname, keytype, valuetype) \
- valuetype* fnname(arg_hashtable_t* h, keytype* k) { return (valuetype*)(arg_hashtable_search(h, k)); }
- /**
- * @brief Remove the specified key from the hash table.
- *
- * @param h the hash table to remove the item from
- * @param k the key to search for - does not claim ownership
- */
- void arg_hashtable_remove(arg_hashtable_t* h, const void* k);
- #define ARG_DEFINE_HASHTABLE_REMOVE(fnname, keytype, valuetype) \
- valuetype* fnname(arg_hashtable_t* h, keytype* k) { return (valuetype*)(arg_hashtable_remove(h, k)); }
- /**
- * @brief Return the number of keys in the hash table.
- *
- * @param h the hash table
- * @return the number of items stored in the hash table
- */
- unsigned int arg_hashtable_count(arg_hashtable_t* h);
- /**
- * @brief Change the value associated with the key.
- *
- * function to change the value associated with a key, where there already
- * exists a value bound to the key in the hash table.
- * Source due to Holger Schemel.
- *
- * @name hashtable_change
- * @param h the hash table
- * @param key
- * @param value
- */
- int arg_hashtable_change(arg_hashtable_t* h, void* k, void* v);
- /**
- * @brief Free the hash table and the memory allocated for each key-value pair.
- *
- * @param h the hash table
- * @param free_values whether to call 'free' on the remaining values
- */
- void arg_hashtable_destroy(arg_hashtable_t* h, int free_values);
- typedef struct arg_hashtable_itr {
- arg_hashtable_t* h;
- struct arg_hashtable_entry* e;
- struct arg_hashtable_entry* parent;
- unsigned int index;
- } arg_hashtable_itr_t;
- arg_hashtable_itr_t* arg_hashtable_itr_create(arg_hashtable_t* h);
- void arg_hashtable_itr_destroy(arg_hashtable_itr_t* itr);
- /**
- * @brief Return the value of the (key,value) pair at the current position.
- */
- extern void* arg_hashtable_itr_key(arg_hashtable_itr_t* i);
- /**
- * @brief Return the value of the (key,value) pair at the current position.
- */
- extern void* arg_hashtable_itr_value(arg_hashtable_itr_t* i);
- /**
- * @brief Advance the iterator to the next element. Returns zero if advanced to end of table.
- */
- int arg_hashtable_itr_advance(arg_hashtable_itr_t* itr);
- /**
- * @brief Remove current element and advance the iterator to the next element.
- */
- int arg_hashtable_itr_remove(arg_hashtable_itr_t* itr);
- /**
- * @brief Search and overwrite the supplied iterator, to point to the entry matching the supplied key.
- *
- * @return Zero if not found.
- */
- int arg_hashtable_itr_search(arg_hashtable_itr_t* itr, arg_hashtable_t* h, void* k);
- #define ARG_DEFINE_HASHTABLE_ITERATOR_SEARCH(fnname, keytype) \
- int fnname(arg_hashtable_itr_t* i, arg_hashtable_t* h, keytype* k) { return (arg_hashtable_iterator_search(i, h, k)); }
- #ifdef __cplusplus
- }
- #endif
- #endif
- /*******************************************************************************
- * arg_utils: Implements memory, panic, and other utility functions
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 2013-2019 Tom G. Huang
- * <tomghuang@gmail.com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <stdarg.h>
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- static void panic(const char* fmt, ...);
- static arg_panicfn* s_panic = panic;
- void dbg_printf(const char* fmt, ...) {
- va_list args;
- va_start(args, fmt);
- vfprintf(stderr, fmt, args);
- va_end(args);
- }
- static void panic(const char* fmt, ...) {
- va_list args;
- char* s;
- va_start(args, fmt);
- vfprintf(stderr, fmt, args);
- va_end(args);
- #if defined(_MSC_VER)
- #pragma warning(push)
- #pragma warning(disable : 4996)
- #endif
- s = getenv("EF_DUMPCORE");
- #if defined(_MSC_VER)
- #pragma warning(pop)
- #endif
- if (s != NULL && *s != '\0') {
- abort();
- } else {
- exit(EXIT_FAILURE);
- }
- }
- void arg_set_panic(arg_panicfn* proc) {
- s_panic = proc;
- }
- void* xmalloc(size_t size) {
- void* ret = malloc(size);
- if (!ret) {
- s_panic("Out of memory!\n");
- }
- return ret;
- }
- void* xcalloc(size_t count, size_t size) {
- size_t allocated_count = count && size ? count : 1;
- size_t allocated_size = count && size ? size : 1;
- void* ret = calloc(allocated_count, allocated_size);
- if (!ret) {
- s_panic("Out of memory!\n");
- }
- return ret;
- }
- void* xrealloc(void* ptr, size_t size) {
- size_t allocated_size = size ? size : 1;
- void* ret = realloc(ptr, allocated_size);
- if (!ret) {
- s_panic("Out of memory!\n");
- }
- return ret;
- }
- void xfree(void* ptr) {
- free(ptr);
- }
- static void merge(void* data, int esize, int i, int j, int k, arg_comparefn* comparefn) {
- char* a = (char*)data;
- char* m;
- int ipos, jpos, mpos;
- /* Initialize the counters used in merging. */
- ipos = i;
- jpos = j + 1;
- mpos = 0;
- /* Allocate storage for the merged elements. */
- m = (char*)xmalloc(esize * ((k - i) + 1));
- /* Continue while either division has elements to merge. */
- while (ipos <= j || jpos <= k) {
- if (ipos > j) {
- /* The left division has no more elements to merge. */
- while (jpos <= k) {
- memcpy(&m[mpos * esize], &a[jpos * esize], esize);
- jpos++;
- mpos++;
- }
- continue;
- } else if (jpos > k) {
- /* The right division has no more elements to merge. */
- while (ipos <= j) {
- memcpy(&m[mpos * esize], &a[ipos * esize], esize);
- ipos++;
- mpos++;
- }
- continue;
- }
- /* Append the next ordered element to the merged elements. */
- if (comparefn(&a[ipos * esize], &a[jpos * esize]) < 0) {
- memcpy(&m[mpos * esize], &a[ipos * esize], esize);
- ipos++;
- mpos++;
- } else {
- memcpy(&m[mpos * esize], &a[jpos * esize], esize);
- jpos++;
- mpos++;
- }
- }
- /* Prepare to pass back the merged data. */
- memcpy(&a[i * esize], m, esize * ((k - i) + 1));
- xfree(m);
- }
- void arg_mgsort(void* data, int size, int esize, int i, int k, arg_comparefn* comparefn) {
- int j;
- /* Stop the recursion when no more divisions can be made. */
- if (i < k) {
- /* Determine where to divide the elements. */
- j = (int)(((i + k - 1)) / 2);
- /* Recursively sort the two divisions. */
- arg_mgsort(data, size, esize, i, j, comparefn);
- arg_mgsort(data, size, esize, j + 1, k, comparefn);
- merge(data, esize, i, j, k, comparefn);
- }
- }
- /*******************************************************************************
- * arg_hashtable: Implements the hash table utilities
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 2013-2019 Tom G. Huang
- * <tomghuang@gmail.com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <math.h>
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- /*
- * This hash table module is adapted from the C hash table implementation by
- * Christopher Clark. Here is the copyright notice from the library:
- *
- * Copyright (c) 2002, Christopher Clark
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- *
- * * Neither the name of the original author; nor the names of any contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
- * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
- * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
- /*
- * Credit for primes table: Aaron Krowne
- * http://br.endernet.org/~akrowne/
- * http://planetmath.org/encyclopedia/GoodHashTablePrimes.html
- */
- static const unsigned int primes[] = {53, 97, 193, 389, 769, 1543, 3079, 6151, 12289,
- 24593, 49157, 98317, 196613, 393241, 786433, 1572869, 3145739, 6291469,
- 12582917, 25165843, 50331653, 100663319, 201326611, 402653189, 805306457, 1610612741};
- const unsigned int prime_table_length = sizeof(primes) / sizeof(primes[0]);
- const float max_load_factor = (float)0.65;
- static unsigned int enhanced_hash(arg_hashtable_t* h, const void* k) {
- /*
- * Aim to protect against poor hash functions by adding logic here.
- * The logic is taken from Java 1.4 hash table source.
- */
- unsigned int i = h->hashfn(k);
- i += ~(i << 9);
- i ^= ((i >> 14) | (i << 18)); /* >>> */
- i += (i << 4);
- i ^= ((i >> 10) | (i << 22)); /* >>> */
- return i;
- }
- static unsigned int index_for(unsigned int tablelength, unsigned int hashvalue) {
- return (hashvalue % tablelength);
- }
- arg_hashtable_t* arg_hashtable_create(unsigned int minsize, unsigned int (*hashfn)(const void*), int (*eqfn)(const void*, const void*)) {
- arg_hashtable_t* h;
- unsigned int pindex;
- unsigned int size = primes[0];
- /* Check requested hash table isn't too large */
- if (minsize > (1u << 30))
- return NULL;
- /*
- * Enforce size as prime. The reason is to avoid clustering of values
- * into a small number of buckets (yes, distribution). A more even
- * distributed hash table will perform more consistently.
- */
- for (pindex = 0; pindex < prime_table_length; pindex++) {
- if (primes[pindex] > minsize) {
- size = primes[pindex];
- break;
- }
- }
- h = (arg_hashtable_t*)xmalloc(sizeof(arg_hashtable_t));
- h->table = (struct arg_hashtable_entry**)xmalloc(sizeof(struct arg_hashtable_entry*) * size);
- memset(h->table, 0, size * sizeof(struct arg_hashtable_entry*));
- h->tablelength = size;
- h->primeindex = pindex;
- h->entrycount = 0;
- h->hashfn = hashfn;
- h->eqfn = eqfn;
- h->loadlimit = (unsigned int)ceil(size * max_load_factor);
- return h;
- }
- static int arg_hashtable_expand(arg_hashtable_t* h) {
- /* Double the size of the table to accommodate more entries */
- struct arg_hashtable_entry** newtable;
- struct arg_hashtable_entry* e;
- unsigned int newsize;
- unsigned int i;
- unsigned int index;
- /* Check we're not hitting max capacity */
- if (h->primeindex == (prime_table_length - 1))
- return 0;
- newsize = primes[++(h->primeindex)];
- newtable = (struct arg_hashtable_entry**)xmalloc(sizeof(struct arg_hashtable_entry*) * newsize);
- memset(newtable, 0, newsize * sizeof(struct arg_hashtable_entry*));
- /*
- * This algorithm is not 'stable': it reverses the list
- * when it transfers entries between the tables
- */
- for (i = 0; i < h->tablelength; i++) {
- while (NULL != (e = h->table[i])) {
- h->table[i] = e->next;
- index = index_for(newsize, e->h);
- e->next = newtable[index];
- newtable[index] = e;
- }
- }
- xfree(h->table);
- h->table = newtable;
- h->tablelength = newsize;
- h->loadlimit = (unsigned int)ceil(newsize * max_load_factor);
- return -1;
- }
- unsigned int arg_hashtable_count(arg_hashtable_t* h) {
- return h->entrycount;
- }
- void arg_hashtable_insert(arg_hashtable_t* h, void* k, void* v) {
- /* This method allows duplicate keys - but they shouldn't be used */
- unsigned int index;
- struct arg_hashtable_entry* e;
- if ((h->entrycount + 1) > h->loadlimit) {
- /*
- * Ignore the return value. If expand fails, we should
- * still try cramming just this value into the existing table
- * -- we may not have memory for a larger table, but one more
- * element may be ok. Next time we insert, we'll try expanding again.
- */
- arg_hashtable_expand(h);
- }
- e = (struct arg_hashtable_entry*)xmalloc(sizeof(struct arg_hashtable_entry));
- e->h = enhanced_hash(h, k);
- index = index_for(h->tablelength, e->h);
- e->k = k;
- e->v = v;
- e->next = h->table[index];
- h->table[index] = e;
- h->entrycount++;
- }
- void* arg_hashtable_search(arg_hashtable_t* h, const void* k) {
- struct arg_hashtable_entry* e;
- unsigned int hashvalue;
- unsigned int index;
- hashvalue = enhanced_hash(h, k);
- index = index_for(h->tablelength, hashvalue);
- e = h->table[index];
- while (e != NULL) {
- /* Check hash value to short circuit heavier comparison */
- if ((hashvalue == e->h) && (h->eqfn(k, e->k)))
- return e->v;
- e = e->next;
- }
- return NULL;
- }
- void arg_hashtable_remove(arg_hashtable_t* h, const void* k) {
- /*
- * TODO: consider compacting the table when the load factor drops enough,
- * or provide a 'compact' method.
- */
- struct arg_hashtable_entry* e;
- struct arg_hashtable_entry** pE;
- unsigned int hashvalue;
- unsigned int index;
- hashvalue = enhanced_hash(h, k);
- index = index_for(h->tablelength, hashvalue);
- pE = &(h->table[index]);
- e = *pE;
- while (NULL != e) {
- /* Check hash value to short circuit heavier comparison */
- if ((hashvalue == e->h) && (h->eqfn(k, e->k))) {
- *pE = e->next;
- h->entrycount--;
- xfree(e->k);
- xfree(e->v);
- xfree(e);
- return;
- }
- pE = &(e->next);
- e = e->next;
- }
- }
- void arg_hashtable_destroy(arg_hashtable_t* h, int free_values) {
- unsigned int i;
- struct arg_hashtable_entry *e, *f;
- struct arg_hashtable_entry** table = h->table;
- if (free_values) {
- for (i = 0; i < h->tablelength; i++) {
- e = table[i];
- while (NULL != e) {
- f = e;
- e = e->next;
- xfree(f->k);
- xfree(f->v);
- xfree(f);
- }
- }
- } else {
- for (i = 0; i < h->tablelength; i++) {
- e = table[i];
- while (NULL != e) {
- f = e;
- e = e->next;
- xfree(f->k);
- xfree(f);
- }
- }
- }
- xfree(h->table);
- xfree(h);
- }
- arg_hashtable_itr_t* arg_hashtable_itr_create(arg_hashtable_t* h) {
- unsigned int i;
- unsigned int tablelength;
- arg_hashtable_itr_t* itr = (arg_hashtable_itr_t*)xmalloc(sizeof(arg_hashtable_itr_t));
- itr->h = h;
- itr->e = NULL;
- itr->parent = NULL;
- tablelength = h->tablelength;
- itr->index = tablelength;
- if (0 == h->entrycount)
- return itr;
- for (i = 0; i < tablelength; i++) {
- if (h->table[i] != NULL) {
- itr->e = h->table[i];
- itr->index = i;
- break;
- }
- }
- return itr;
- }
- void arg_hashtable_itr_destroy(arg_hashtable_itr_t* itr) {
- xfree(itr);
- }
- void* arg_hashtable_itr_key(arg_hashtable_itr_t* i) {
- return i->e->k;
- }
- void* arg_hashtable_itr_value(arg_hashtable_itr_t* i) {
- return i->e->v;
- }
- int arg_hashtable_itr_advance(arg_hashtable_itr_t* itr) {
- unsigned int j;
- unsigned int tablelength;
- struct arg_hashtable_entry** table;
- struct arg_hashtable_entry* next;
- if (itr->e == NULL)
- return 0; /* stupidity check */
- next = itr->e->next;
- if (NULL != next) {
- itr->parent = itr->e;
- itr->e = next;
- return -1;
- }
- tablelength = itr->h->tablelength;
- itr->parent = NULL;
- if (tablelength <= (j = ++(itr->index))) {
- itr->e = NULL;
- return 0;
- }
- table = itr->h->table;
- while (NULL == (next = table[j])) {
- if (++j >= tablelength) {
- itr->index = tablelength;
- itr->e = NULL;
- return 0;
- }
- }
- itr->index = j;
- itr->e = next;
- return -1;
- }
- int arg_hashtable_itr_remove(arg_hashtable_itr_t* itr) {
- struct arg_hashtable_entry* remember_e;
- struct arg_hashtable_entry* remember_parent;
- int ret;
- /* Do the removal */
- if ((itr->parent) == NULL) {
- /* element is head of a chain */
- itr->h->table[itr->index] = itr->e->next;
- } else {
- /* element is mid-chain */
- itr->parent->next = itr->e->next;
- }
- /* itr->e is now outside the hashtable */
- remember_e = itr->e;
- itr->h->entrycount--;
- xfree(remember_e->k);
- xfree(remember_e->v);
- /* Advance the iterator, correcting the parent */
- remember_parent = itr->parent;
- ret = arg_hashtable_itr_advance(itr);
- if (itr->parent == remember_e) {
- itr->parent = remember_parent;
- }
- xfree(remember_e);
- return ret;
- }
- int arg_hashtable_itr_search(arg_hashtable_itr_t* itr, arg_hashtable_t* h, void* k) {
- struct arg_hashtable_entry* e;
- struct arg_hashtable_entry* parent;
- unsigned int hashvalue;
- unsigned int index;
- hashvalue = enhanced_hash(h, k);
- index = index_for(h->tablelength, hashvalue);
- e = h->table[index];
- parent = NULL;
- while (e != NULL) {
- /* Check hash value to short circuit heavier comparison */
- if ((hashvalue == e->h) && (h->eqfn(k, e->k))) {
- itr->index = index;
- itr->e = e;
- itr->parent = parent;
- itr->h = h;
- return -1;
- }
- parent = e;
- e = e->next;
- }
- return 0;
- }
- int arg_hashtable_change(arg_hashtable_t* h, void* k, void* v) {
- struct arg_hashtable_entry* e;
- unsigned int hashvalue;
- unsigned int index;
- hashvalue = enhanced_hash(h, k);
- index = index_for(h->tablelength, hashvalue);
- e = h->table[index];
- while (e != NULL) {
- /* Check hash value to short circuit heavier comparison */
- if ((hashvalue == e->h) && (h->eqfn(k, e->k))) {
- xfree(e->v);
- e->v = v;
- return -1;
- }
- e = e->next;
- }
- return 0;
- }
- /*******************************************************************************
- * arg_dstr: Implements the dynamic string utilities
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 2013-2019 Tom G. Huang
- * <tomghuang@gmail.com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <stdarg.h>
- #include <stdlib.h>
- #include <string.h>
- #if defined(_MSC_VER)
- #pragma warning(push)
- #pragma warning(disable : 4996)
- #endif
- #define START_VSNBUFF 16
- /*
- * This dynamic string module is adapted from TclResult.c in the Tcl library.
- * Here is the copyright notice from the library:
- *
- * This software is copyrighted by the Regents of the University of
- * California, Sun Microsystems, Inc., Scriptics Corporation, ActiveState
- * Corporation and other parties. The following terms apply to all files
- * associated with the software unless explicitly disclaimed in
- * individual files.
- *
- * The authors hereby grant permission to use, copy, modify, distribute,
- * and license this software and its documentation for any purpose, provided
- * that existing copyright notices are retained in all copies and that this
- * notice is included verbatim in any distributions. No written agreement,
- * license, or royalty fee is required for any of the authorized uses.
- * Modifications to this software may be copyrighted by their authors
- * and need not follow the licensing terms described here, provided that
- * the new terms are clearly indicated on the first page of each file where
- * they apply.
- *
- * IN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY
- * FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
- * ARISING OUT OF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY
- * DERIVATIVES THEREOF, EVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- *
- * THE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES,
- * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE, AND NON-INFRINGEMENT. THIS SOFTWARE
- * IS PROVIDED ON AN "AS IS" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE
- * NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR
- * MODIFICATIONS.
- *
- * GOVERNMENT USE: If you are acquiring this software on behalf of the
- * U.S. government, the Government shall have only "Restricted Rights"
- * in the software and related documentation as defined in the Federal
- * Acquisition Regulations (FARs) in Clause 52.227.19 (c) (2). If you
- * are acquiring the software on behalf of the Department of Defense, the
- * software shall be classified as "Commercial Computer Software" and the
- * Government shall have only "Restricted Rights" as defined in Clause
- * 252.227-7014 (b) (3) of DFARs. Notwithstanding the foregoing, the
- * authors grant the U.S. Government and others acting in its behalf
- * permission to use and distribute the software in accordance with the
- * terms specified in this license.
- */
- typedef struct _internal_arg_dstr {
- char* data;
- arg_dstr_freefn* free_proc;
- char sbuf[ARG_DSTR_SIZE + 1];
- char* append_data;
- int append_data_size;
- int append_used;
- } _internal_arg_dstr_t;
- static void setup_append_buf(arg_dstr_t res, int newSpace);
- arg_dstr_t arg_dstr_create(void) {
- _internal_arg_dstr_t* h = (_internal_arg_dstr_t*)xmalloc(sizeof(_internal_arg_dstr_t));
- memset(h, 0, sizeof(_internal_arg_dstr_t));
- h->sbuf[0] = 0;
- h->data = h->sbuf;
- h->free_proc = ARG_DSTR_STATIC;
- return h;
- }
- void arg_dstr_destroy(arg_dstr_t ds) {
- if (ds == NULL)
- return;
- arg_dstr_reset(ds);
- xfree(ds);
- return;
- }
- void arg_dstr_set(arg_dstr_t ds, char* str, arg_dstr_freefn* free_proc) {
- int length;
- register arg_dstr_freefn* old_free_proc = ds->free_proc;
- char* old_result = ds->data;
- if (str == NULL) {
- ds->sbuf[0] = 0;
- ds->data = ds->sbuf;
- ds->free_proc = ARG_DSTR_STATIC;
- } else if (free_proc == ARG_DSTR_VOLATILE) {
- length = (int)strlen(str);
- if (length > ARG_DSTR_SIZE) {
- ds->data = (char*)xmalloc((unsigned)length + 1);
- ds->free_proc = ARG_DSTR_DYNAMIC;
- } else {
- ds->data = ds->sbuf;
- ds->free_proc = ARG_DSTR_STATIC;
- }
- strcpy(ds->data, str);
- } else {
- ds->data = str;
- ds->free_proc = free_proc;
- }
- /*
- * If the old result was dynamically-allocated, free it up. Do it here,
- * rather than at the beginning, in case the new result value was part of
- * the old result value.
- */
- if ((old_free_proc != 0) && (old_result != ds->data)) {
- if (old_free_proc == ARG_DSTR_DYNAMIC) {
- xfree(old_result);
- } else {
- (*old_free_proc)(old_result);
- }
- }
- if ((ds->append_data != NULL) && (ds->append_data_size > 0)) {
- xfree(ds->append_data);
- ds->append_data = NULL;
- ds->append_data_size = 0;
- }
- }
- char* arg_dstr_cstr(arg_dstr_t ds) /* Interpreter whose result to return. */
- {
- return ds->data;
- }
- void arg_dstr_cat(arg_dstr_t ds, const char* str) {
- setup_append_buf(ds, (int)strlen(str) + 1);
- memcpy(ds->data + strlen(ds->data), str, strlen(str));
- }
- void arg_dstr_catc(arg_dstr_t ds, char c) {
- setup_append_buf(ds, 2);
- memcpy(ds->data + strlen(ds->data), &c, 1);
- }
- /*
- * The logic of the `arg_dstr_catf` function is adapted from the `bformat`
- * function in The Better String Library by Paul Hsieh. Here is the copyright
- * notice from the library:
- *
- * Copyright (c) 2014, Paul Hsieh
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- * * Redistributions of source code must retain the above copyright notice, this
- * list of conditions and the following disclaimer.
- *
- * * Redistributions in binary form must reproduce the above copyright notice,
- * this list of conditions and the following disclaimer in the documentation
- * and/or other materials provided with the distribution.
- *
- * * Neither the name of bstrlib nor the names of its
- * contributors may be used to endorse or promote products derived from
- * this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
- * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
- * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
- * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
- void arg_dstr_catf(arg_dstr_t ds, const char* fmt, ...) {
- va_list arglist;
- char* buff;
- int n, r;
- size_t slen;
- if (fmt == NULL)
- return;
- /* Since the length is not determinable beforehand, a search is
- performed using the truncating "vsnprintf" call (to avoid buffer
- overflows) on increasing potential sizes for the output result. */
- if ((n = (int)(2 * strlen(fmt))) < START_VSNBUFF)
- n = START_VSNBUFF;
- buff = (char*)xmalloc(n + 2);
- memset(buff, 0, n + 2);
- for (;;) {
- va_start(arglist, fmt);
- r = vsnprintf(buff, n + 1, fmt, arglist);
- va_end(arglist);
- slen = strlen(buff);
- if (slen < (size_t)n)
- break;
- if (r > n)
- n = r;
- else
- n += n;
- xfree(buff);
- buff = (char*)xmalloc(n + 2);
- memset(buff, 0, n + 2);
- }
- arg_dstr_cat(ds, buff);
- xfree(buff);
- }
- static void setup_append_buf(arg_dstr_t ds, int new_space) {
- int total_space;
- /*
- * Make the append buffer larger, if that's necessary, then copy the
- * data into the append buffer and make the append buffer the official
- * data.
- */
- if (ds->data != ds->append_data) {
- /*
- * If the buffer is too big, then free it up so we go back to a
- * smaller buffer. This avoids tying up memory forever after a large
- * operation.
- */
- if (ds->append_data_size > 500) {
- xfree(ds->append_data);
- ds->append_data = NULL;
- ds->append_data_size = 0;
- }
- ds->append_used = (int)strlen(ds->data);
- } else if (ds->data[ds->append_used] != 0) {
- /*
- * Most likely someone has modified a result created by
- * arg_dstr_cat et al. so that it has a different size. Just
- * recompute the size.
- */
- ds->append_used = (int)strlen(ds->data);
- }
- total_space = new_space + ds->append_used;
- if (total_space >= ds->append_data_size) {
- char* newbuf;
- if (total_space < 100) {
- total_space = 200;
- } else {
- total_space *= 2;
- }
- newbuf = (char*)xmalloc((unsigned)total_space);
- memset(newbuf, 0, total_space);
- strcpy(newbuf, ds->data);
- if (ds->append_data != NULL) {
- xfree(ds->append_data);
- }
- ds->append_data = newbuf;
- ds->append_data_size = total_space;
- } else if (ds->data != ds->append_data) {
- strcpy(ds->append_data, ds->data);
- }
- arg_dstr_free(ds);
- ds->data = ds->append_data;
- }
- void arg_dstr_free(arg_dstr_t ds) {
- if (ds->free_proc != NULL) {
- if (ds->free_proc == ARG_DSTR_DYNAMIC) {
- xfree(ds->data);
- } else {
- (*ds->free_proc)(ds->data);
- }
- ds->free_proc = NULL;
- }
- }
- void arg_dstr_reset(arg_dstr_t ds) {
- arg_dstr_free(ds);
- if ((ds->append_data != NULL) && (ds->append_data_size > 0)) {
- xfree(ds->append_data);
- ds->append_data = NULL;
- ds->append_data_size = 0;
- }
- ds->data = ds->sbuf;
- ds->sbuf[0] = 0;
- }
- #if defined(_MSC_VER)
- #pragma warning(pop)
- #endif
- /* $Id: getopt.h,v 1.1 2009/10/16 19:50:28 rodney Exp rodney $ */
- /* $OpenBSD: getopt.h,v 1.1 2002/12/03 20:24:29 millert Exp $ */
- /* $NetBSD: getopt.h,v 1.4 2000/07/07 10:43:54 ad Exp $ */
- /*
- * Copyright (c) 2000 The NetBSD Foundation, Inc.
- * All rights reserved.
- *
- * This code is derived from software contributed to The NetBSD Foundation
- * by Dieter Baron and Thomas Klausner.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- * must display the following acknowledgment:
- * This product includes software developed by the NetBSD
- * Foundation, Inc. and its contributors.
- * 4. Neither the name of The NetBSD Foundation nor the names of its
- * contributors may be used to endorse or promote products derived
- * from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
- * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
- * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
- * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
- #if ARG_REPLACE_GETOPT == 1
- #ifndef _GETOPT_H_
- #define _GETOPT_H_
- /*
- * GNU-like getopt_long() and 4.4BSD getsubopt()/optreset extensions
- */
- #define no_argument 0
- #define required_argument 1
- #define optional_argument 2
- struct option {
- /* name of long option */
- const char* name;
- /*
- * one of no_argument, required_argument, and optional_argument:
- * whether option takes an argument
- */
- int has_arg;
- /* if not NULL, set *flag to val when option found */
- int* flag;
- /* if flag not NULL, value to set *flag to; else return value */
- int val;
- };
- #ifdef __cplusplus
- extern "C" {
- #endif
- int getopt_long(int, char* const*, const char*, const struct option*, int*);
- int getopt_long_only(int, char* const*, const char*, const struct option*, int*);
- #ifndef _GETOPT_DEFINED
- #define _GETOPT_DEFINED
- int getopt(int, char* const*, const char*);
- int getsubopt(char**, char* const*, char**);
- extern char* optarg; /* getopt(3) external variables */
- extern int opterr;
- extern int optind;
- extern int optopt;
- extern int optreset;
- extern char* suboptarg; /* getsubopt(3) external variable */
- #endif /* _GETOPT_DEFINED */
- #ifdef __cplusplus
- }
- #endif
- #endif /* !_GETOPT_H_ */
- #else
- #include <getopt.h>
- #endif /* ARG_REPLACE_GETOPT */
- /* $Id: getopt_long.c,v 1.1 2009/10/16 19:50:28 rodney Exp rodney $ */
- /* $OpenBSD: getopt_long.c,v 1.23 2007/10/31 12:34:57 chl Exp $ */
- /* $NetBSD: getopt_long.c,v 1.15 2002/01/31 22:43:40 tv Exp $ */
- /*
- * Copyright (c) 2002 Todd C. Miller <Todd.Miller@courtesan.com>
- *
- * Permission to use, copy, modify, and distribute this software for any
- * purpose with or without fee is hereby granted, provided that the above
- * copyright notice and this permission notice appear in all copies.
- *
- * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
- * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
- * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
- * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
- * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
- * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
- * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
- *
- * Sponsored in part by the Defense Advanced Research Projects
- * Agency (DARPA) and Air Force Research Laboratory, Air Force
- * Materiel Command, USAF, under agreement number F39502-99-1-0512.
- */
- /*
- * Copyright (c) 2000 The NetBSD Foundation, Inc.
- * All rights reserved.
- *
- * This code is derived from software contributed to The NetBSD Foundation
- * by Dieter Baron and Thomas Klausner.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
- * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
- * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
- * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "getopt.h"
- #endif
- #include <errno.h>
- #include <stdlib.h>
- #include <string.h>
- #if ARG_REPLACE_GETOPT == 1
- int opterr = 1; /* if error message should be printed */
- int optind = 1; /* index into parent argv vector */
- int optopt = '?'; /* character checked for validity */
- int optreset; /* reset getopt */
- char* optarg; /* argument associated with option */
- #endif /* ARG_REPLACE_GETOPT */
- #define PRINT_ERROR ((opterr) && (*options != ':'))
- #define FLAG_PERMUTE 0x01 /* permute non-options to the end of argv */
- #define FLAG_ALLARGS 0x02 /* treat non-options as args to option "-1" */
- #define FLAG_LONGONLY 0x04 /* operate as getopt_long_only */
- /* return values */
- #define BADCH (int)'?'
- #define BADARG ((*options == ':') ? (int)':' : (int)'?')
- #define INORDER (int)1
- #define EMSG ""
- #if ARG_REPLACE_GETOPT == 1
- static int getopt_internal(int, char* const*, const char*, const struct option*, int*, int);
- #endif /* ARG_REPLACE_GETOPT */
- static int parse_long_options(char* const*, const char*, const struct option*, int*, int);
- static int gcd(int, int);
- static void permute_args(int, int, int, char* const*);
- static char* place = EMSG; /* option letter processing */
- /* XXX: set optreset to 1 rather than these two */
- static int nonopt_start = -1; /* first non option argument (for permute) */
- static int nonopt_end = -1; /* first option after non options (for permute) */
- /* Error messages */
- static const char recargchar[] = "option requires an argument -- %c";
- static const char recargstring[] = "option requires an argument -- %s";
- static const char ambig[] = "ambiguous option -- %.*s";
- static const char noarg[] = "option doesn't take an argument -- %.*s";
- static const char illoptchar[] = "unknown option -- %c";
- static const char illoptstring[] = "unknown option -- %s";
- #ifdef _WIN32
- /*
- * Windows needs warnx(). We change the definition though:
- * 1. (another) global is defined, opterrmsg, which holds the error message
- * 2. errors are always printed out on stderr w/o the program name
- * Note that opterrmsg always gets set no matter what opterr is set to. The
- * error message will not be printed if opterr is 0 as usual.
- */
- #include <stdarg.h>
- #include <stdio.h>
- #define MAX_OPTERRMSG_SIZE 128
- extern char opterrmsg[MAX_OPTERRMSG_SIZE];
- char opterrmsg[MAX_OPTERRMSG_SIZE]; /* buffer for the last error message */
- static void warnx(const char* fmt, ...) {
- va_list ap;
- va_start(ap, fmt);
- /*
- * Make sure opterrmsg is always zero-terminated despite the _vsnprintf()
- * implementation specifics and manually suppress the warning.
- */
- memset(opterrmsg, 0, sizeof(opterrmsg));
- if (fmt != NULL)
- #if (defined(__STDC_LIB_EXT1__) && defined(__STDC_WANT_LIB_EXT1__)) || (defined(__STDC_SECURE_LIB__) && defined(__STDC_WANT_SECURE_LIB__))
- _vsnprintf_s(opterrmsg, sizeof(opterrmsg), sizeof(opterrmsg) - 1, fmt, ap);
- #else
- _vsnprintf(opterrmsg, sizeof(opterrmsg) - 1, fmt, ap);
- #endif
- va_end(ap);
- #ifdef _MSC_VER
- #pragma warning(suppress : 6053)
- #endif
- fprintf(stderr, "%s\n", opterrmsg);
- }
- #else
- #include <err.h>
- #endif /*_WIN32*/
- /*
- * Compute the greatest common divisor of a and b.
- */
- static int gcd(int a, int b) {
- int c;
- c = a % b;
- while (c != 0) {
- a = b;
- b = c;
- c = a % b;
- }
- return (b);
- }
- /*
- * Exchange the block from nonopt_start to nonopt_end with the block
- * from nonopt_end to opt_end (keeping the same order of arguments
- * in each block).
- */
- static void permute_args(int panonopt_start, int panonopt_end, int opt_end, char* const* nargv) {
- int cstart, cyclelen, i, j, ncycle, nnonopts, nopts, pos;
- char* swap;
- /*
- * compute lengths of blocks and number and size of cycles
- */
- nnonopts = panonopt_end - panonopt_start;
- nopts = opt_end - panonopt_end;
- ncycle = gcd(nnonopts, nopts);
- cyclelen = (opt_end - panonopt_start) / ncycle;
- for (i = 0; i < ncycle; i++) {
- cstart = panonopt_end + i;
- pos = cstart;
- for (j = 0; j < cyclelen; j++) {
- if (pos >= panonopt_end)
- pos -= nnonopts;
- else
- pos += nopts;
- swap = nargv[pos];
- /* LINTED const cast */
- ((char**)nargv)[pos] = nargv[cstart];
- /* LINTED const cast */
- ((char**)nargv)[cstart] = swap;
- }
- }
- }
- /*
- * parse_long_options --
- * Parse long options in argc/argv argument vector.
- * Returns -1 if short_too is set and the option does not match long_options.
- */
- static int parse_long_options(char* const* nargv, const char* options, const struct option* long_options, int* idx, int short_too) {
- char *current_argv, *has_equal;
- size_t current_argv_len;
- int i, match;
- current_argv = place;
- match = -1;
- optind++;
- if ((has_equal = strchr(current_argv, '=')) != NULL) {
- /* argument found (--option=arg) */
- current_argv_len = has_equal - current_argv;
- has_equal++;
- } else
- current_argv_len = strlen(current_argv);
- for (i = 0; long_options[i].name; i++) {
- /* find matching long option */
- if (strncmp(current_argv, long_options[i].name, current_argv_len))
- continue;
- if (strlen(long_options[i].name) == current_argv_len) {
- /* exact match */
- match = i;
- break;
- }
- /*
- * If this is a known short option, don't allow
- * a partial match of a single character.
- */
- if (short_too && current_argv_len == 1)
- continue;
- if (match == -1) /* partial match */
- match = i;
- else {
- /* ambiguous abbreviation */
- if (PRINT_ERROR)
- warnx(ambig, (int)current_argv_len, current_argv);
- optopt = 0;
- return (BADCH);
- }
- }
- if (match != -1) { /* option found */
- if (long_options[match].has_arg == no_argument && has_equal) {
- if (PRINT_ERROR)
- warnx(noarg, (int)current_argv_len, current_argv);
- /*
- * XXX: GNU sets optopt to val regardless of flag
- */
- if (long_options[match].flag == NULL)
- optopt = long_options[match].val;
- else
- optopt = 0;
- return (BADARG);
- }
- if (long_options[match].has_arg == required_argument || long_options[match].has_arg == optional_argument) {
- if (has_equal)
- optarg = has_equal;
- else if (long_options[match].has_arg == required_argument) {
- /*
- * optional argument doesn't use next nargv
- */
- optarg = nargv[optind++];
- }
- }
- if ((long_options[match].has_arg == required_argument) && (optarg == NULL)) {
- /*
- * Missing argument; leading ':' indicates no error
- * should be generated.
- */
- if (PRINT_ERROR)
- warnx(recargstring, current_argv);
- /*
- * XXX: GNU sets optopt to val regardless of flag
- */
- if (long_options[match].flag == NULL)
- optopt = long_options[match].val;
- else
- optopt = 0;
- --optind;
- return (BADARG);
- }
- } else { /* unknown option */
- if (short_too) {
- --optind;
- return (-1);
- }
- if (PRINT_ERROR)
- warnx(illoptstring, current_argv);
- optopt = 0;
- return (BADCH);
- }
- if (idx)
- *idx = match;
- if (long_options[match].flag) {
- *long_options[match].flag = long_options[match].val;
- return (0);
- } else
- return (long_options[match].val);
- }
- #if ARG_REPLACE_GETOPT == 1
- /*
- * getopt_internal --
- * Parse argc/argv argument vector. Called by user level routines.
- */
- static int getopt_internal(int nargc, char* const* nargv, const char* options, const struct option* long_options, int* idx, int flags) {
- char* oli; /* option letter list index */
- int optchar, short_too;
- static int posixly_correct = -1;
- if (options == NULL)
- return (-1);
- /*
- * Disable GNU extensions if POSIXLY_CORRECT is set or options
- * string begins with a '+'.
- */
- if (posixly_correct == -1)
- #if defined(_MSC_VER)
- #pragma warning(push)
- #pragma warning(disable : 4996)
- #endif
- posixly_correct = (getenv("POSIXLY_CORRECT") != NULL);
- #if defined(_MSC_VER)
- #pragma warning(pop)
- #endif
- if (posixly_correct || *options == '+')
- flags &= ~FLAG_PERMUTE;
- else if (*options == '-')
- flags |= FLAG_ALLARGS;
- if (*options == '+' || *options == '-')
- options++;
- /*
- * XXX Some GNU programs (like cvs) set optind to 0 instead of
- * XXX using optreset. Work around this braindamage.
- */
- if (optind == 0)
- optind = optreset = 1;
- optarg = NULL;
- if (optreset)
- nonopt_start = nonopt_end = -1;
- start:
- if (optreset || !*place) { /* update scanning pointer */
- optreset = 0;
- if (optind >= nargc) { /* end of argument vector */
- place = EMSG;
- if (nonopt_end != -1) {
- /* do permutation, if we have to */
- permute_args(nonopt_start, nonopt_end, optind, nargv);
- optind -= nonopt_end - nonopt_start;
- } else if (nonopt_start != -1) {
- /*
- * If we skipped non-options, set optind
- * to the first of them.
- */
- optind = nonopt_start;
- }
- nonopt_start = nonopt_end = -1;
- return (-1);
- }
- if (*(place = nargv[optind]) != '-' || (place[1] == '\0' && strchr(options, '-') == NULL)) {
- place = EMSG; /* found non-option */
- if (flags & FLAG_ALLARGS) {
- /*
- * GNU extension:
- * return non-option as argument to option 1
- */
- optarg = nargv[optind++];
- return (INORDER);
- }
- if (!(flags & FLAG_PERMUTE)) {
- /*
- * If no permutation wanted, stop parsing
- * at first non-option.
- */
- return (-1);
- }
- /* do permutation */
- if (nonopt_start == -1)
- nonopt_start = optind;
- else if (nonopt_end != -1) {
- permute_args(nonopt_start, nonopt_end, optind, nargv);
- nonopt_start = optind - (nonopt_end - nonopt_start);
- nonopt_end = -1;
- }
- optind++;
- /* process next argument */
- goto start;
- }
- if (nonopt_start != -1 && nonopt_end == -1)
- nonopt_end = optind;
- /*
- * If we have "-" do nothing, if "--" we are done.
- */
- if (place[1] != '\0' && *++place == '-' && place[1] == '\0') {
- optind++;
- place = EMSG;
- /*
- * We found an option (--), so if we skipped
- * non-options, we have to permute.
- */
- if (nonopt_end != -1) {
- permute_args(nonopt_start, nonopt_end, optind, nargv);
- optind -= nonopt_end - nonopt_start;
- }
- nonopt_start = nonopt_end = -1;
- return (-1);
- }
- }
- /*
- * Check long options if:
- * 1) we were passed some
- * 2) the arg is not just "-"
- * 3) either the arg starts with -- we are getopt_long_only()
- */
- if (long_options != NULL && place != nargv[optind] && (*place == '-' || (flags & FLAG_LONGONLY))) {
- short_too = 0;
- if (*place == '-')
- place++; /* --foo long option */
- else if (*place != ':' && strchr(options, *place) != NULL)
- short_too = 1; /* could be short option too */
- optchar = parse_long_options(nargv, options, long_options, idx, short_too);
- if (optchar != -1) {
- place = EMSG;
- return (optchar);
- }
- }
- if ((optchar = (int)*place++) == (int)':' || (optchar == (int)'-' && *place != '\0') || (oli = strchr(options, optchar)) == NULL) {
- /*
- * If the user specified "-" and '-' isn't listed in
- * options, return -1 (non-option) as per POSIX.
- * Otherwise, it is an unknown option character (or ':').
- */
- if (optchar == (int)'-' && *place == '\0')
- return (-1);
- if (!*place)
- ++optind;
- if (PRINT_ERROR)
- warnx(illoptchar, optchar);
- optopt = optchar;
- return (BADCH);
- }
- if (long_options != NULL && optchar == 'W' && oli[1] == ';') {
- /* -W long-option */
- if (*place) /* no space */
- /* NOTHING */;
- else if (++optind >= nargc) { /* no arg */
- place = EMSG;
- if (PRINT_ERROR)
- warnx(recargchar, optchar);
- optopt = optchar;
- return (BADARG);
- } else /* white space */
- place = nargv[optind];
- optchar = parse_long_options(nargv, options, long_options, idx, 0);
- place = EMSG;
- return (optchar);
- }
- if (*++oli != ':') { /* doesn't take argument */
- if (!*place)
- ++optind;
- } else { /* takes (optional) argument */
- optarg = NULL;
- if (*place) /* no white space */
- optarg = place;
- else if (oli[1] != ':') { /* arg not optional */
- if (++optind >= nargc) { /* no arg */
- place = EMSG;
- if (PRINT_ERROR)
- warnx(recargchar, optchar);
- optopt = optchar;
- return (BADARG);
- } else
- optarg = nargv[optind];
- }
- place = EMSG;
- ++optind;
- }
- /* dump back option letter */
- return (optchar);
- }
- /*
- * getopt --
- * Parse argc/argv argument vector.
- *
- * [eventually this will replace the BSD getopt]
- */
- int getopt(int nargc, char* const* nargv, const char* options) {
- /*
- * We don't pass FLAG_PERMUTE to getopt_internal() since
- * the BSD getopt(3) (unlike GNU) has never done this.
- *
- * Furthermore, since many privileged programs call getopt()
- * before dropping privileges it makes sense to keep things
- * as simple (and bug-free) as possible.
- */
- return (getopt_internal(nargc, nargv, options, NULL, NULL, 0));
- }
- #endif /* ARG_REPLACE_GETOPT */
- /*
- * getopt_long --
- * Parse argc/argv argument vector.
- */
- int getopt_long(int nargc, char* const* nargv, const char* options, const struct option* long_options, int* idx) {
- return (getopt_internal(nargc, nargv, options, long_options, idx, FLAG_PERMUTE));
- }
- /*
- * getopt_long_only --
- * Parse argc/argv argument vector.
- */
- int getopt_long_only(int nargc, char* const* nargv, const char* options, const struct option* long_options, int* idx) {
- return (getopt_internal(nargc, nargv, options, long_options, idx, FLAG_PERMUTE | FLAG_LONGONLY));
- }
- /*******************************************************************************
- * arg_date: Implements the date command-line option
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 1998-2001,2003-2011,2013 Stewart Heitmann
- * <sheitmann@users.sourceforge.net>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <stdlib.h>
- #include <string.h>
- char* arg_strptime(const char* buf, const char* fmt, struct tm* tm);
- static void arg_date_resetfn(struct arg_date* parent) {
- ARG_TRACE(("%s:resetfn(%p)\n", __FILE__, parent));
- parent->count = 0;
- }
- static int arg_date_scanfn(struct arg_date* parent, const char* argval) {
- int errorcode = 0;
- if (parent->count == parent->hdr.maxcount) {
- errorcode = ARG_ERR_MAXCOUNT;
- } else if (!argval) {
- /* no argument value was given, leave parent->tmval[] unaltered but still count it */
- parent->count++;
- } else {
- const char* pend;
- struct tm tm = parent->tmval[parent->count];
- /* parse the given argument value, store result in parent->tmval[] */
- pend = arg_strptime(argval, parent->format, &tm);
- if (pend && pend[0] == '\0')
- parent->tmval[parent->count++] = tm;
- else
- errorcode = ARG_ERR_BADDATE;
- }
- ARG_TRACE(("%s:scanfn(%p) returns %d\n", __FILE__, parent, errorcode));
- return errorcode;
- }
- static int arg_date_checkfn(struct arg_date* parent) {
- int errorcode = (parent->count < parent->hdr.mincount) ? ARG_ERR_MINCOUNT : 0;
- ARG_TRACE(("%s:checkfn(%p) returns %d\n", __FILE__, parent, errorcode));
- return errorcode;
- }
- static void arg_date_errorfn(struct arg_date* parent, arg_dstr_t ds, int errorcode, const char* argval, const char* progname) {
- const char* shortopts = parent->hdr.shortopts;
- const char* longopts = parent->hdr.longopts;
- const char* datatype = parent->hdr.datatype;
- /* make argval NULL safe */
- argval = argval ? argval : "";
- arg_dstr_catf(ds, "%s: ", progname);
- switch (errorcode) {
- case ARG_ERR_MINCOUNT:
- arg_dstr_cat(ds, "missing option ");
- arg_print_option_ds(ds, shortopts, longopts, datatype, "\n");
- break;
- case ARG_ERR_MAXCOUNT:
- arg_dstr_cat(ds, "excess option ");
- arg_print_option_ds(ds, shortopts, longopts, argval, "\n");
- break;
- case ARG_ERR_BADDATE: {
- struct tm tm;
- char buff[200];
- arg_dstr_catf(ds, "illegal timestamp format \"%s\"\n", argval);
- memset(&tm, 0, sizeof(tm));
- arg_strptime("1999-12-31 23:59:59", "%F %H:%M:%S", &tm);
- strftime(buff, sizeof(buff), parent->format, &tm);
- arg_dstr_catf(ds, "correct format is \"%s\"\n", buff);
- break;
- }
- }
- }
- struct arg_date* arg_date0(const char* shortopts, const char* longopts, const char* format, const char* datatype, const char* glossary) {
- return arg_daten(shortopts, longopts, format, datatype, 0, 1, glossary);
- }
- struct arg_date* arg_date1(const char* shortopts, const char* longopts, const char* format, const char* datatype, const char* glossary) {
- return arg_daten(shortopts, longopts, format, datatype, 1, 1, glossary);
- }
- struct arg_date*
- arg_daten(const char* shortopts, const char* longopts, const char* format, const char* datatype, int mincount, int maxcount, const char* glossary) {
- size_t nbytes;
- struct arg_date* result;
- /* foolproof things by ensuring maxcount is not less than mincount */
- maxcount = (maxcount < mincount) ? mincount : maxcount;
- /* default time format is the national date format for the locale */
- if (!format)
- format = "%x";
- nbytes = sizeof(struct arg_date) /* storage for struct arg_date */
- + maxcount * sizeof(struct tm); /* storage for tmval[maxcount] array */
- /* allocate storage for the arg_date struct + tmval[] array. */
- /* we use calloc because we want the tmval[] array zero filled. */
- result = (struct arg_date*)xcalloc(1, nbytes);
- /* init the arg_hdr struct */
- result->hdr.flag = ARG_HASVALUE;
- result->hdr.shortopts = shortopts;
- result->hdr.longopts = longopts;
- result->hdr.datatype = datatype ? datatype : format;
- result->hdr.glossary = glossary;
- result->hdr.mincount = mincount;
- result->hdr.maxcount = maxcount;
- result->hdr.parent = result;
- result->hdr.resetfn = (arg_resetfn*)arg_date_resetfn;
- result->hdr.scanfn = (arg_scanfn*)arg_date_scanfn;
- result->hdr.checkfn = (arg_checkfn*)arg_date_checkfn;
- result->hdr.errorfn = (arg_errorfn*)arg_date_errorfn;
- /* store the tmval[maxcount] array immediately after the arg_date struct */
- result->tmval = (struct tm*)(result + 1);
- /* init the remaining arg_date member variables */
- result->count = 0;
- result->format = format;
- ARG_TRACE(("arg_daten() returns %p\n", result));
- return result;
- }
- /*-
- * Copyright (c) 1997, 1998, 2005, 2008 The NetBSD Foundation, Inc.
- * All rights reserved.
- *
- * This code was contributed to The NetBSD Foundation by Klaus Klein.
- * Heavily optimised by David Laight
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
- * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
- * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
- * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
- #include <ctype.h>
- #include <string.h>
- #include <time.h>
- /*
- * We do not implement alternate representations. However, we always
- * check whether a given modifier is allowed for a certain conversion.
- */
- #define ALT_E 0x01
- #define ALT_O 0x02
- #define LEGAL_ALT(x) \
- { \
- if (alt_format & ~(x)) \
- return (0); \
- }
- #define TM_YEAR_BASE (1900)
- static int conv_num(const char**, int*, int, int);
- static const char* day[7] = {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};
- static const char* abday[7] = {"Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"};
- static const char* mon[12] = {"January", "February", "March", "April", "May", "June",
- "July", "August", "September", "October", "November", "December"};
- static const char* abmon[12] = {"Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"};
- static const char* am_pm[2] = {"AM", "PM"};
- static int arg_strcasecmp(const char* s1, const char* s2) {
- const unsigned char* us1 = (const unsigned char*)s1;
- const unsigned char* us2 = (const unsigned char*)s2;
- while (tolower(*us1) == tolower(*us2++))
- if (*us1++ == '\0')
- return 0;
- return tolower(*us1) - tolower(*--us2);
- }
- static int arg_strncasecmp(const char* s1, const char* s2, size_t n) {
- if (n != 0) {
- const unsigned char* us1 = (const unsigned char*)s1;
- const unsigned char* us2 = (const unsigned char*)s2;
- do {
- if (tolower(*us1) != tolower(*us2++))
- return tolower(*us1) - tolower(*--us2);
- if (*us1++ == '\0')
- break;
- } while (--n != 0);
- }
- return 0;
- }
- char* arg_strptime(const char* buf, const char* fmt, struct tm* tm) {
- char c;
- const char* bp;
- size_t len = 0;
- int alt_format, i, split_year = 0;
- bp = buf;
- while ((c = *fmt) != '\0') {
- /* Clear `alternate' modifier prior to new conversion. */
- alt_format = 0;
- /* Eat up white-space. */
- if (isspace(c)) {
- while (isspace(*bp))
- bp++;
- fmt++;
- continue;
- }
- if ((c = *fmt++) != '%')
- goto literal;
- again:
- switch (c = *fmt++) {
- case '%': /* "%%" is converted to "%". */
- literal:
- if (c != *bp++)
- return (0);
- break;
- /*
- * "Alternative" modifiers. Just set the appropriate flag
- * and start over again.
- */
- case 'E': /* "%E?" alternative conversion modifier. */
- LEGAL_ALT(0);
- alt_format |= ALT_E;
- goto again;
- case 'O': /* "%O?" alternative conversion modifier. */
- LEGAL_ALT(0);
- alt_format |= ALT_O;
- goto again;
- /*
- * "Complex" conversion rules, implemented through recursion.
- */
- case 'c': /* Date and time, using the locale's format. */
- LEGAL_ALT(ALT_E);
- bp = arg_strptime(bp, "%x %X", tm);
- if (!bp)
- return (0);
- break;
- case 'D': /* The date as "%m/%d/%y". */
- LEGAL_ALT(0);
- bp = arg_strptime(bp, "%m/%d/%y", tm);
- if (!bp)
- return (0);
- break;
- case 'R': /* The time as "%H:%M". */
- LEGAL_ALT(0);
- bp = arg_strptime(bp, "%H:%M", tm);
- if (!bp)
- return (0);
- break;
- case 'r': /* The time in 12-hour clock representation. */
- LEGAL_ALT(0);
- bp = arg_strptime(bp, "%I:%M:%S %p", tm);
- if (!bp)
- return (0);
- break;
- case 'T': /* The time as "%H:%M:%S". */
- LEGAL_ALT(0);
- bp = arg_strptime(bp, "%H:%M:%S", tm);
- if (!bp)
- return (0);
- break;
- case 'X': /* The time, using the locale's format. */
- LEGAL_ALT(ALT_E);
- bp = arg_strptime(bp, "%H:%M:%S", tm);
- if (!bp)
- return (0);
- break;
- case 'x': /* The date, using the locale's format. */
- LEGAL_ALT(ALT_E);
- bp = arg_strptime(bp, "%m/%d/%y", tm);
- if (!bp)
- return (0);
- break;
- /*
- * "Elementary" conversion rules.
- */
- case 'A': /* The day of week, using the locale's form. */
- case 'a':
- LEGAL_ALT(0);
- for (i = 0; i < 7; i++) {
- /* Full name. */
- len = strlen(day[i]);
- if (arg_strncasecmp(day[i], bp, len) == 0)
- break;
- /* Abbreviated name. */
- len = strlen(abday[i]);
- if (arg_strncasecmp(abday[i], bp, len) == 0)
- break;
- }
- /* Nothing matched. */
- if (i == 7)
- return (0);
- tm->tm_wday = i;
- bp += len;
- break;
- case 'B': /* The month, using the locale's form. */
- case 'b':
- case 'h':
- LEGAL_ALT(0);
- for (i = 0; i < 12; i++) {
- /* Full name. */
- len = strlen(mon[i]);
- if (arg_strncasecmp(mon[i], bp, len) == 0)
- break;
- /* Abbreviated name. */
- len = strlen(abmon[i]);
- if (arg_strncasecmp(abmon[i], bp, len) == 0)
- break;
- }
- /* Nothing matched. */
- if (i == 12)
- return (0);
- tm->tm_mon = i;
- bp += len;
- break;
- case 'C': /* The century number. */
- LEGAL_ALT(ALT_E);
- if (!(conv_num(&bp, &i, 0, 99)))
- return (0);
- if (split_year) {
- tm->tm_year = (tm->tm_year % 100) + (i * 100);
- } else {
- tm->tm_year = i * 100;
- split_year = 1;
- }
- break;
- case 'd': /* The day of month. */
- case 'e':
- LEGAL_ALT(ALT_O);
- if (!(conv_num(&bp, &tm->tm_mday, 1, 31)))
- return (0);
- break;
- case 'k': /* The hour (24-hour clock representation). */
- LEGAL_ALT(0);
- /* FALLTHROUGH */
- case 'H':
- LEGAL_ALT(ALT_O);
- if (!(conv_num(&bp, &tm->tm_hour, 0, 23)))
- return (0);
- break;
- case 'l': /* The hour (12-hour clock representation). */
- LEGAL_ALT(0);
- /* FALLTHROUGH */
- case 'I':
- LEGAL_ALT(ALT_O);
- if (!(conv_num(&bp, &tm->tm_hour, 1, 12)))
- return (0);
- if (tm->tm_hour == 12)
- tm->tm_hour = 0;
- break;
- case 'j': /* The day of year. */
- LEGAL_ALT(0);
- if (!(conv_num(&bp, &i, 1, 366)))
- return (0);
- tm->tm_yday = i - 1;
- break;
- case 'M': /* The minute. */
- LEGAL_ALT(ALT_O);
- if (!(conv_num(&bp, &tm->tm_min, 0, 59)))
- return (0);
- break;
- case 'm': /* The month. */
- LEGAL_ALT(ALT_O);
- if (!(conv_num(&bp, &i, 1, 12)))
- return (0);
- tm->tm_mon = i - 1;
- break;
- case 'p': /* The locale's equivalent of AM/PM. */
- LEGAL_ALT(0);
- /* AM? */
- if (arg_strcasecmp(am_pm[0], bp) == 0) {
- if (tm->tm_hour > 11)
- return (0);
- bp += strlen(am_pm[0]);
- break;
- }
- /* PM? */
- else if (arg_strcasecmp(am_pm[1], bp) == 0) {
- if (tm->tm_hour > 11)
- return (0);
- tm->tm_hour += 12;
- bp += strlen(am_pm[1]);
- break;
- }
- /* Nothing matched. */
- return (0);
- case 'S': /* The seconds. */
- LEGAL_ALT(ALT_O);
- if (!(conv_num(&bp, &tm->tm_sec, 0, 61)))
- return (0);
- break;
- case 'U': /* The week of year, beginning on sunday. */
- case 'W': /* The week of year, beginning on monday. */
- LEGAL_ALT(ALT_O);
- /*
- * XXX This is bogus, as we can not assume any valid
- * information present in the tm structure at this
- * point to calculate a real value, so just check the
- * range for now.
- */
- if (!(conv_num(&bp, &i, 0, 53)))
- return (0);
- break;
- case 'w': /* The day of week, beginning on sunday. */
- LEGAL_ALT(ALT_O);
- if (!(conv_num(&bp, &tm->tm_wday, 0, 6)))
- return (0);
- break;
- case 'Y': /* The year. */
- LEGAL_ALT(ALT_E);
- if (!(conv_num(&bp, &i, 0, 9999)))
- return (0);
- tm->tm_year = i - TM_YEAR_BASE;
- break;
- case 'y': /* The year within 100 years of the epoch. */
- LEGAL_ALT(ALT_E | ALT_O);
- if (!(conv_num(&bp, &i, 0, 99)))
- return (0);
- if (split_year) {
- tm->tm_year = ((tm->tm_year / 100) * 100) + i;
- break;
- }
- split_year = 1;
- if (i <= 68)
- tm->tm_year = i + 2000 - TM_YEAR_BASE;
- else
- tm->tm_year = i + 1900 - TM_YEAR_BASE;
- break;
- /*
- * Miscellaneous conversions.
- */
- case 'n': /* Any kind of white-space. */
- case 't':
- LEGAL_ALT(0);
- while (isspace(*bp))
- bp++;
- break;
- default: /* Unknown/unsupported conversion. */
- return (0);
- }
- }
- /* LINTED functional specification */
- return ((char*)bp);
- }
- static int conv_num(const char** buf, int* dest, int llim, int ulim) {
- int result = 0;
- /* The limit also determines the number of valid digits. */
- int rulim = ulim;
- if (**buf < '0' || **buf > '9')
- return (0);
- do {
- result *= 10;
- result += *(*buf)++ - '0';
- rulim /= 10;
- } while ((result * 10 <= ulim) && rulim && **buf >= '0' && **buf <= '9');
- if (result < llim || result > ulim)
- return (0);
- *dest = result;
- return (1);
- }
- /*******************************************************************************
- * arg_dbl: Implements the double command-line option
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 1998-2001,2003-2011,2013 Stewart Heitmann
- * <sheitmann@users.sourceforge.net>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <stdlib.h>
- static void arg_dbl_resetfn(struct arg_dbl* parent) {
- ARG_TRACE(("%s:resetfn(%p)\n", __FILE__, parent));
- parent->count = 0;
- }
- static int arg_dbl_scanfn(struct arg_dbl* parent, const char* argval) {
- int errorcode = 0;
- if (parent->count == parent->hdr.maxcount) {
- /* maximum number of arguments exceeded */
- errorcode = ARG_ERR_MAXCOUNT;
- } else if (!argval) {
- /* a valid argument with no argument value was given. */
- /* This happens when an optional argument value was invoked. */
- /* leave parent argument value unaltered but still count the argument. */
- parent->count++;
- } else {
- double val;
- char* end;
- /* extract double from argval into val */
- val = strtod(argval, &end);
- /* if success then store result in parent->dval[] array otherwise return error*/
- if (*end == 0)
- parent->dval[parent->count++] = val;
- else
- errorcode = ARG_ERR_BADDOUBLE;
- }
- ARG_TRACE(("%s:scanfn(%p) returns %d\n", __FILE__, parent, errorcode));
- return errorcode;
- }
- static int arg_dbl_checkfn(struct arg_dbl* parent) {
- int errorcode = (parent->count < parent->hdr.mincount) ? ARG_ERR_MINCOUNT : 0;
- ARG_TRACE(("%s:checkfn(%p) returns %d\n", __FILE__, parent, errorcode));
- return errorcode;
- }
- static void arg_dbl_errorfn(struct arg_dbl* parent, arg_dstr_t ds, int errorcode, const char* argval, const char* progname) {
- const char* shortopts = parent->hdr.shortopts;
- const char* longopts = parent->hdr.longopts;
- const char* datatype = parent->hdr.datatype;
- /* make argval NULL safe */
- argval = argval ? argval : "";
- arg_dstr_catf(ds, "%s: ", progname);
- switch (errorcode) {
- case ARG_ERR_MINCOUNT:
- arg_dstr_cat(ds, "missing option ");
- arg_print_option_ds(ds, shortopts, longopts, datatype, "\n");
- break;
- case ARG_ERR_MAXCOUNT:
- arg_dstr_cat(ds, "excess option ");
- arg_print_option_ds(ds, shortopts, longopts, argval, "\n");
- break;
- case ARG_ERR_BADDOUBLE:
- arg_dstr_catf(ds, "invalid argument \"%s\" to option ", argval);
- arg_print_option_ds(ds, shortopts, longopts, datatype, "\n");
- break;
- }
- }
- struct arg_dbl* arg_dbl0(const char* shortopts, const char* longopts, const char* datatype, const char* glossary) {
- return arg_dbln(shortopts, longopts, datatype, 0, 1, glossary);
- }
- struct arg_dbl* arg_dbl1(const char* shortopts, const char* longopts, const char* datatype, const char* glossary) {
- return arg_dbln(shortopts, longopts, datatype, 1, 1, glossary);
- }
- struct arg_dbl* arg_dbln(const char* shortopts, const char* longopts, const char* datatype, int mincount, int maxcount, const char* glossary) {
- size_t nbytes;
- struct arg_dbl* result;
- size_t addr;
- size_t rem;
- /* foolproof things by ensuring maxcount is not less than mincount */
- maxcount = (maxcount < mincount) ? mincount : maxcount;
- nbytes = sizeof(struct arg_dbl) /* storage for struct arg_dbl */
- + (maxcount + 1) * sizeof(double); /* storage for dval[maxcount] array plus one extra for padding to memory boundary */
- result = (struct arg_dbl*)xmalloc(nbytes);
- /* init the arg_hdr struct */
- result->hdr.flag = ARG_HASVALUE;
- result->hdr.shortopts = shortopts;
- result->hdr.longopts = longopts;
- result->hdr.datatype = datatype ? datatype : "<double>";
- result->hdr.glossary = glossary;
- result->hdr.mincount = mincount;
- result->hdr.maxcount = maxcount;
- result->hdr.parent = result;
- result->hdr.resetfn = (arg_resetfn*)arg_dbl_resetfn;
- result->hdr.scanfn = (arg_scanfn*)arg_dbl_scanfn;
- result->hdr.checkfn = (arg_checkfn*)arg_dbl_checkfn;
- result->hdr.errorfn = (arg_errorfn*)arg_dbl_errorfn;
- /* Store the dval[maxcount] array on the first double boundary that
- * immediately follows the arg_dbl struct. We do the memory alignment
- * purely for SPARC and Motorola systems. They require floats and
- * doubles to be aligned on natural boundaries.
- */
- addr = (size_t)(result + 1);
- rem = addr % sizeof(double);
- result->dval = (double*)(addr + sizeof(double) - rem);
- ARG_TRACE(("addr=%p, dval=%p, sizeof(double)=%d rem=%d\n", addr, result->dval, (int)sizeof(double), (int)rem));
- result->count = 0;
- ARG_TRACE(("arg_dbln() returns %p\n", result));
- return result;
- }
- /*******************************************************************************
- * arg_end: Implements the error handling utilities
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 1998-2001,2003-2011,2013 Stewart Heitmann
- * <sheitmann@users.sourceforge.net>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <stdlib.h>
- static void arg_end_resetfn(struct arg_end* parent) {
- ARG_TRACE(("%s:resetfn(%p)\n", __FILE__, parent));
- parent->count = 0;
- }
- static void arg_end_errorfn(void* parent, arg_dstr_t ds, int error, const char* argval, const char* progname) {
- /* suppress unreferenced formal parameter warning */
- (void)parent;
- progname = progname ? progname : "";
- argval = argval ? argval : "";
- arg_dstr_catf(ds, "%s: ", progname);
- switch (error) {
- case ARG_ELIMIT:
- arg_dstr_cat(ds, "too many errors to display");
- break;
- case ARG_EMALLOC:
- arg_dstr_cat(ds, "insufficient memory");
- break;
- case ARG_ENOMATCH:
- arg_dstr_catf(ds, "unexpected argument \"%s\"", argval);
- break;
- case ARG_EMISSARG:
- arg_dstr_catf(ds, "option \"%s\" requires an argument", argval);
- break;
- case ARG_ELONGOPT:
- arg_dstr_catf(ds, "invalid option \"%s\"", argval);
- break;
- default:
- arg_dstr_catf(ds, "invalid option \"-%c\"", error);
- break;
- }
- arg_dstr_cat(ds, "\n");
- }
- struct arg_end* arg_end(int maxcount) {
- size_t nbytes;
- struct arg_end* result;
- nbytes = sizeof(struct arg_end) + maxcount * sizeof(int) /* storage for int error[maxcount] array*/
- + maxcount * sizeof(void*) /* storage for void* parent[maxcount] array */
- + maxcount * sizeof(char*); /* storage for char* argval[maxcount] array */
- result = (struct arg_end*)xmalloc(nbytes);
- /* init the arg_hdr struct */
- result->hdr.flag = ARG_TERMINATOR;
- result->hdr.shortopts = NULL;
- result->hdr.longopts = NULL;
- result->hdr.datatype = NULL;
- result->hdr.glossary = NULL;
- result->hdr.mincount = 1;
- result->hdr.maxcount = maxcount;
- result->hdr.parent = result;
- result->hdr.resetfn = (arg_resetfn*)arg_end_resetfn;
- result->hdr.scanfn = NULL;
- result->hdr.checkfn = NULL;
- result->hdr.errorfn = (arg_errorfn*)arg_end_errorfn;
- /* store error[maxcount] array immediately after struct arg_end */
- result->error = (int*)(result + 1);
- /* store parent[maxcount] array immediately after error[] array */
- result->parent = (void**)(result->error + maxcount);
- /* store argval[maxcount] array immediately after parent[] array */
- result->argval = (const char**)(result->parent + maxcount);
- ARG_TRACE(("arg_end(%d) returns %p\n", maxcount, result));
- return result;
- }
- void arg_print_errors_ds(arg_dstr_t ds, struct arg_end* end, const char* progname) {
- int i;
- ARG_TRACE(("arg_errors()\n"));
- for (i = 0; i < end->count; i++) {
- struct arg_hdr* errorparent = (struct arg_hdr*)(end->parent[i]);
- if (errorparent->errorfn)
- errorparent->errorfn(end->parent[i], ds, end->error[i], end->argval[i], progname);
- }
- }
- void arg_print_errors(FILE* fp, struct arg_end* end, const char* progname) {
- arg_dstr_t ds = arg_dstr_create();
- arg_print_errors_ds(ds, end, progname);
- fputs(arg_dstr_cstr(ds), fp);
- arg_dstr_destroy(ds);
- }
- /*******************************************************************************
- * arg_file: Implements the file command-line option
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 1998-2001,2003-2011,2013 Stewart Heitmann
- * <sheitmann@users.sourceforge.net>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <stdlib.h>
- #include <string.h>
- #ifdef WIN32
- #define FILESEPARATOR1 '\\'
- #define FILESEPARATOR2 '/'
- #else
- #define FILESEPARATOR1 '/'
- #define FILESEPARATOR2 '/'
- #endif
- static void arg_file_resetfn(struct arg_file* parent) {
- ARG_TRACE(("%s:resetfn(%p)\n", __FILE__, parent));
- parent->count = 0;
- }
- /* Returns ptr to the base filename within *filename */
- static const char* arg_basename(const char* filename) {
- const char *result = NULL, *result1, *result2;
- /* Find the last occurrence of eother file separator character. */
- /* Two alternative file separator chars are supported as legal */
- /* file separators but not both together in the same filename. */
- result1 = (filename ? strrchr(filename, FILESEPARATOR1) : NULL);
- result2 = (filename ? strrchr(filename, FILESEPARATOR2) : NULL);
- if (result2)
- result = result2 + 1; /* using FILESEPARATOR2 (the alternative file separator) */
- if (result1)
- result = result1 + 1; /* using FILESEPARATOR1 (the preferred file separator) */
- if (!result)
- result = filename; /* neither file separator was found so basename is the whole filename */
- /* special cases of "." and ".." are not considered basenames */
- if (result && (strcmp(".", result) == 0 || strcmp("..", result) == 0))
- result = filename + strlen(filename);
- return result;
- }
- /* Returns ptr to the file extension within *basename */
- static const char* arg_extension(const char* basename) {
- /* find the last occurrence of '.' in basename */
- const char* result = (basename ? strrchr(basename, '.') : NULL);
- /* if no '.' was found then return pointer to end of basename */
- if (basename && !result)
- result = basename + strlen(basename);
- /* special case: basenames with a single leading dot (eg ".foo") are not considered as true extensions */
- if (basename && result == basename)
- result = basename + strlen(basename);
- /* special case: empty extensions (eg "foo.","foo..") are not considered as true extensions */
- if (basename && result && result[1] == '\0')
- result = basename + strlen(basename);
- return result;
- }
- static int arg_file_scanfn(struct arg_file* parent, const char* argval) {
- int errorcode = 0;
- if (parent->count == parent->hdr.maxcount) {
- /* maximum number of arguments exceeded */
- errorcode = ARG_ERR_MAXCOUNT;
- } else if (!argval) {
- /* a valid argument with no argument value was given. */
- /* This happens when an optional argument value was invoked. */
- /* leave parent arguiment value unaltered but still count the argument. */
- parent->count++;
- } else {
- parent->filename[parent->count] = argval;
- parent->basename[parent->count] = arg_basename(argval);
- parent->extension[parent->count] =
- arg_extension(parent->basename[parent->count]); /* only seek extensions within the basename (not the file path)*/
- parent->count++;
- }
- ARG_TRACE(("%s4:scanfn(%p) returns %d\n", __FILE__, parent, errorcode));
- return errorcode;
- }
- static int arg_file_checkfn(struct arg_file* parent) {
- int errorcode = (parent->count < parent->hdr.mincount) ? ARG_ERR_MINCOUNT : 0;
- ARG_TRACE(("%s:checkfn(%p) returns %d\n", __FILE__, parent, errorcode));
- return errorcode;
- }
- static void arg_file_errorfn(struct arg_file* parent, arg_dstr_t ds, int errorcode, const char* argval, const char* progname) {
- const char* shortopts = parent->hdr.shortopts;
- const char* longopts = parent->hdr.longopts;
- const char* datatype = parent->hdr.datatype;
- /* make argval NULL safe */
- argval = argval ? argval : "";
- arg_dstr_catf(ds, "%s: ", progname);
- switch (errorcode) {
- case ARG_ERR_MINCOUNT:
- arg_dstr_cat(ds, "missing option ");
- arg_print_option_ds(ds, shortopts, longopts, datatype, "\n");
- break;
- case ARG_ERR_MAXCOUNT:
- arg_dstr_cat(ds, "excess option ");
- arg_print_option_ds(ds, shortopts, longopts, argval, "\n");
- break;
- default:
- arg_dstr_catf(ds, "unknown error at \"%s\"\n", argval);
- }
- }
- struct arg_file* arg_file0(const char* shortopts, const char* longopts, const char* datatype, const char* glossary) {
- return arg_filen(shortopts, longopts, datatype, 0, 1, glossary);
- }
- struct arg_file* arg_file1(const char* shortopts, const char* longopts, const char* datatype, const char* glossary) {
- return arg_filen(shortopts, longopts, datatype, 1, 1, glossary);
- }
- struct arg_file* arg_filen(const char* shortopts, const char* longopts, const char* datatype, int mincount, int maxcount, const char* glossary) {
- size_t nbytes;
- struct arg_file* result;
- int i;
- /* foolproof things by ensuring maxcount is not less than mincount */
- maxcount = (maxcount < mincount) ? mincount : maxcount;
- nbytes = sizeof(struct arg_file) /* storage for struct arg_file */
- + sizeof(char*) * maxcount /* storage for filename[maxcount] array */
- + sizeof(char*) * maxcount /* storage for basename[maxcount] array */
- + sizeof(char*) * maxcount; /* storage for extension[maxcount] array */
- result = (struct arg_file*)xmalloc(nbytes);
- /* init the arg_hdr struct */
- result->hdr.flag = ARG_HASVALUE;
- result->hdr.shortopts = shortopts;
- result->hdr.longopts = longopts;
- result->hdr.glossary = glossary;
- result->hdr.datatype = datatype ? datatype : "<file>";
- result->hdr.mincount = mincount;
- result->hdr.maxcount = maxcount;
- result->hdr.parent = result;
- result->hdr.resetfn = (arg_resetfn*)arg_file_resetfn;
- result->hdr.scanfn = (arg_scanfn*)arg_file_scanfn;
- result->hdr.checkfn = (arg_checkfn*)arg_file_checkfn;
- result->hdr.errorfn = (arg_errorfn*)arg_file_errorfn;
- /* store the filename,basename,extension arrays immediately after the arg_file struct */
- result->filename = (const char**)(result + 1);
- result->basename = result->filename + maxcount;
- result->extension = result->basename + maxcount;
- result->count = 0;
- /* foolproof the string pointers by initialising them with empty strings */
- for (i = 0; i < maxcount; i++) {
- result->filename[i] = "";
- result->basename[i] = "";
- result->extension[i] = "";
- }
- ARG_TRACE(("arg_filen() returns %p\n", result));
- return result;
- }
- /*******************************************************************************
- * arg_int: Implements the int command-line option
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 1998-2001,2003-2011,2013 Stewart Heitmann
- * <sheitmann@users.sourceforge.net>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <ctype.h>
- #include <limits.h>
- #include <stdlib.h>
- static void arg_int_resetfn(struct arg_int* parent) {
- ARG_TRACE(("%s:resetfn(%p)\n", __FILE__, parent));
- parent->count = 0;
- }
- /* strtol0x() is like strtol() except that the numeric string is */
- /* expected to be prefixed by "0X" where X is a user supplied char. */
- /* The string may optionally be prefixed by white space and + or - */
- /* as in +0X123 or -0X123. */
- /* Once the prefix has been scanned, the remainder of the numeric */
- /* string is converted using strtol() with the given base. */
- /* eg: to parse hex str="-0X12324", specify X='X' and base=16. */
- /* eg: to parse oct str="+0o12324", specify X='O' and base=8. */
- /* eg: to parse bin str="-0B01010", specify X='B' and base=2. */
- /* Failure of conversion is indicated by result where *endptr==str. */
- static long int strtol0X(const char* str, const char** endptr, char X, int base) {
- long int val; /* stores result */
- int s = 1; /* sign is +1 or -1 */
- const char* ptr = str; /* ptr to current position in str */
- /* skip leading whitespace */
- while (isspace(*ptr))
- ptr++;
- /* printf("1) %s\n",ptr); */
- /* scan optional sign character */
- switch (*ptr) {
- case '+':
- ptr++;
- s = 1;
- break;
- case '-':
- ptr++;
- s = -1;
- break;
- default:
- s = 1;
- break;
- }
- /* printf("2) %s\n",ptr); */
- /* '0X' prefix */
- if ((*ptr++) != '0') {
- /* printf("failed to detect '0'\n"); */
- *endptr = str;
- return 0;
- }
- /* printf("3) %s\n",ptr); */
- if (toupper(*ptr++) != toupper(X)) {
- /* printf("failed to detect '%c'\n",X); */
- *endptr = str;
- return 0;
- }
- /* printf("4) %s\n",ptr); */
- /* attempt conversion on remainder of string using strtol() */
- val = strtol(ptr, (char**)endptr, base);
- if (*endptr == ptr) {
- /* conversion failed */
- *endptr = str;
- return 0;
- }
- /* success */
- return s * val;
- }
- /* Returns 1 if str matches suffix (case insensitive). */
- /* Str may contain trailing whitespace, but nothing else. */
- static int detectsuffix(const char* str, const char* suffix) {
- /* scan pairwise through strings until mismatch detected */
- while (toupper(*str) == toupper(*suffix)) {
- /* printf("'%c' '%c'\n", *str, *suffix); */
- /* return 1 (success) if match persists until the string terminator */
- if (*str == '\0')
- return 1;
- /* next chars */
- str++;
- suffix++;
- }
- /* printf("'%c' '%c' mismatch\n", *str, *suffix); */
- /* return 0 (fail) if the matching did not consume the entire suffix */
- if (*suffix != 0)
- return 0; /* failed to consume entire suffix */
- /* skip any remaining whitespace in str */
- while (isspace(*str))
- str++;
- /* return 1 (success) if we have reached end of str else return 0 (fail) */
- return (*str == '\0') ? 1 : 0;
- }
- static int arg_int_scanfn(struct arg_int* parent, const char* argval) {
- int errorcode = 0;
- if (parent->count == parent->hdr.maxcount) {
- /* maximum number of arguments exceeded */
- errorcode = ARG_ERR_MAXCOUNT;
- } else if (!argval) {
- /* a valid argument with no argument value was given. */
- /* This happens when an optional argument value was invoked. */
- /* leave parent arguiment value unaltered but still count the argument. */
- parent->count++;
- } else {
- long int val;
- const char* end;
- /* attempt to extract hex integer (eg: +0x123) from argval into val conversion */
- val = strtol0X(argval, &end, 'X', 16);
- if (end == argval) {
- /* hex failed, attempt octal conversion (eg +0o123) */
- val = strtol0X(argval, &end, 'O', 8);
- if (end == argval) {
- /* octal failed, attempt binary conversion (eg +0B101) */
- val = strtol0X(argval, &end, 'B', 2);
- if (end == argval) {
- /* binary failed, attempt decimal conversion with no prefix (eg 1234) */
- val = strtol(argval, (char**)&end, 10);
- if (end == argval) {
- /* all supported number formats failed */
- return ARG_ERR_BADINT;
- }
- }
- }
- }
- /* Safety check for integer overflow. WARNING: this check */
- /* achieves nothing on machines where size(int)==size(long). */
- if (val > INT_MAX || val < INT_MIN)
- errorcode = ARG_ERR_OVERFLOW;
- /* Detect any suffixes (KB,MB,GB) and multiply argument value appropriately. */
- /* We need to be mindful of integer overflows when using such big numbers. */
- if (detectsuffix(end, "KB")) /* kilobytes */
- {
- if (val > (INT_MAX / 1024) || val < (INT_MIN / 1024))
- errorcode = ARG_ERR_OVERFLOW; /* Overflow would occur if we proceed */
- else
- val *= 1024; /* 1KB = 1024 */
- } else if (detectsuffix(end, "MB")) /* megabytes */
- {
- if (val > (INT_MAX / 1048576) || val < (INT_MIN / 1048576))
- errorcode = ARG_ERR_OVERFLOW; /* Overflow would occur if we proceed */
- else
- val *= 1048576; /* 1MB = 1024*1024 */
- } else if (detectsuffix(end, "GB")) /* gigabytes */
- {
- if (val > (INT_MAX / 1073741824) || val < (INT_MIN / 1073741824))
- errorcode = ARG_ERR_OVERFLOW; /* Overflow would occur if we proceed */
- else
- val *= 1073741824; /* 1GB = 1024*1024*1024 */
- } else if (!detectsuffix(end, ""))
- errorcode = ARG_ERR_BADINT; /* invalid suffix detected */
- /* if success then store result in parent->ival[] array */
- if (errorcode == 0)
- parent->ival[parent->count++] = (int)val;
- }
- /* printf("%s:scanfn(%p,%p) returns %d\n",__FILE__,parent,argval,errorcode); */
- return errorcode;
- }
- static int arg_int_checkfn(struct arg_int* parent) {
- int errorcode = (parent->count < parent->hdr.mincount) ? ARG_ERR_MINCOUNT : 0;
- /*printf("%s:checkfn(%p) returns %d\n",__FILE__,parent,errorcode);*/
- return errorcode;
- }
- static void arg_int_errorfn(struct arg_int* parent, arg_dstr_t ds, int errorcode, const char* argval, const char* progname) {
- const char* shortopts = parent->hdr.shortopts;
- const char* longopts = parent->hdr.longopts;
- const char* datatype = parent->hdr.datatype;
- /* make argval NULL safe */
- argval = argval ? argval : "";
- arg_dstr_catf(ds, "%s: ", progname);
- switch (errorcode) {
- case ARG_ERR_MINCOUNT:
- arg_dstr_cat(ds, "missing option ");
- arg_print_option_ds(ds, shortopts, longopts, datatype, "\n");
- break;
- case ARG_ERR_MAXCOUNT:
- arg_dstr_cat(ds, "excess option ");
- arg_print_option_ds(ds, shortopts, longopts, argval, "\n");
- break;
- case ARG_ERR_BADINT:
- arg_dstr_catf(ds, "invalid argument \"%s\" to option ", argval);
- arg_print_option_ds(ds, shortopts, longopts, datatype, "\n");
- break;
- case ARG_ERR_OVERFLOW:
- arg_dstr_cat(ds, "integer overflow at option ");
- arg_print_option_ds(ds, shortopts, longopts, datatype, " ");
- arg_dstr_catf(ds, "(%s is too large)\n", argval);
- break;
- }
- }
- struct arg_int* arg_int0(const char* shortopts, const char* longopts, const char* datatype, const char* glossary) {
- return arg_intn(shortopts, longopts, datatype, 0, 1, glossary);
- }
- struct arg_int* arg_int1(const char* shortopts, const char* longopts, const char* datatype, const char* glossary) {
- return arg_intn(shortopts, longopts, datatype, 1, 1, glossary);
- }
- struct arg_int* arg_intn(const char* shortopts, const char* longopts, const char* datatype, int mincount, int maxcount, const char* glossary) {
- size_t nbytes;
- struct arg_int* result;
- /* foolproof things by ensuring maxcount is not less than mincount */
- maxcount = (maxcount < mincount) ? mincount : maxcount;
- nbytes = sizeof(struct arg_int) /* storage for struct arg_int */
- + maxcount * sizeof(int); /* storage for ival[maxcount] array */
- result = (struct arg_int*)xmalloc(nbytes);
- /* init the arg_hdr struct */
- result->hdr.flag = ARG_HASVALUE;
- result->hdr.shortopts = shortopts;
- result->hdr.longopts = longopts;
- result->hdr.datatype = datatype ? datatype : "<int>";
- result->hdr.glossary = glossary;
- result->hdr.mincount = mincount;
- result->hdr.maxcount = maxcount;
- result->hdr.parent = result;
- result->hdr.resetfn = (arg_resetfn*)arg_int_resetfn;
- result->hdr.scanfn = (arg_scanfn*)arg_int_scanfn;
- result->hdr.checkfn = (arg_checkfn*)arg_int_checkfn;
- result->hdr.errorfn = (arg_errorfn*)arg_int_errorfn;
- /* store the ival[maxcount] array immediately after the arg_int struct */
- result->ival = (int*)(result + 1);
- result->count = 0;
- ARG_TRACE(("arg_intn() returns %p\n", result));
- return result;
- }
- /*******************************************************************************
- * arg_lit: Implements the literature command-line option
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 1998-2001,2003-2011,2013 Stewart Heitmann
- * <sheitmann@users.sourceforge.net>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <stdlib.h>
- static void arg_lit_resetfn(struct arg_lit* parent) {
- ARG_TRACE(("%s:resetfn(%p)\n", __FILE__, parent));
- parent->count = 0;
- }
- static int arg_lit_scanfn(struct arg_lit* parent, const char* argval) {
- int errorcode = 0;
- if (parent->count < parent->hdr.maxcount)
- parent->count++;
- else
- errorcode = ARG_ERR_MAXCOUNT;
- ARG_TRACE(("%s:scanfn(%p,%s) returns %d\n", __FILE__, parent, argval, errorcode));
- return errorcode;
- }
- static int arg_lit_checkfn(struct arg_lit* parent) {
- int errorcode = (parent->count < parent->hdr.mincount) ? ARG_ERR_MINCOUNT : 0;
- ARG_TRACE(("%s:checkfn(%p) returns %d\n", __FILE__, parent, errorcode));
- return errorcode;
- }
- static void arg_lit_errorfn(struct arg_lit* parent, arg_dstr_t ds, int errorcode, const char* argval, const char* progname) {
- const char* shortopts = parent->hdr.shortopts;
- const char* longopts = parent->hdr.longopts;
- const char* datatype = parent->hdr.datatype;
- switch (errorcode) {
- case ARG_ERR_MINCOUNT:
- arg_dstr_catf(ds, "%s: missing option ", progname);
- arg_print_option_ds(ds, shortopts, longopts, datatype, "\n");
- arg_dstr_cat(ds, "\n");
- break;
- case ARG_ERR_MAXCOUNT:
- arg_dstr_catf(ds, "%s: extraneous option ", progname);
- arg_print_option_ds(ds, shortopts, longopts, datatype, "\n");
- break;
- }
- ARG_TRACE(("%s:errorfn(%p, %p, %d, %s, %s)\n", __FILE__, parent, ds, errorcode, argval, progname));
- }
- struct arg_lit* arg_lit0(const char* shortopts, const char* longopts, const char* glossary) {
- return arg_litn(shortopts, longopts, 0, 1, glossary);
- }
- struct arg_lit* arg_lit1(const char* shortopts, const char* longopts, const char* glossary) {
- return arg_litn(shortopts, longopts, 1, 1, glossary);
- }
- struct arg_lit* arg_litn(const char* shortopts, const char* longopts, int mincount, int maxcount, const char* glossary) {
- struct arg_lit* result;
- /* foolproof things by ensuring maxcount is not less than mincount */
- maxcount = (maxcount < mincount) ? mincount : maxcount;
- result = (struct arg_lit*)xmalloc(sizeof(struct arg_lit));
- /* init the arg_hdr struct */
- result->hdr.flag = 0;
- result->hdr.shortopts = shortopts;
- result->hdr.longopts = longopts;
- result->hdr.datatype = NULL;
- result->hdr.glossary = glossary;
- result->hdr.mincount = mincount;
- result->hdr.maxcount = maxcount;
- result->hdr.parent = result;
- result->hdr.resetfn = (arg_resetfn*)arg_lit_resetfn;
- result->hdr.scanfn = (arg_scanfn*)arg_lit_scanfn;
- result->hdr.checkfn = (arg_checkfn*)arg_lit_checkfn;
- result->hdr.errorfn = (arg_errorfn*)arg_lit_errorfn;
- /* init local variables */
- result->count = 0;
- ARG_TRACE(("arg_litn() returns %p\n", result));
- return result;
- }
- /*******************************************************************************
- * arg_rem: Implements the rem command-line option
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 1998-2001,2003-2011,2013 Stewart Heitmann
- * <sheitmann@users.sourceforge.net>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <stdlib.h>
- struct arg_rem* arg_rem(const char* datatype, const char* glossary) {
- struct arg_rem* result = (struct arg_rem*)xmalloc(sizeof(struct arg_rem));
- result->hdr.flag = 0;
- result->hdr.shortopts = NULL;
- result->hdr.longopts = NULL;
- result->hdr.datatype = datatype;
- result->hdr.glossary = glossary;
- result->hdr.mincount = 1;
- result->hdr.maxcount = 1;
- result->hdr.parent = result;
- result->hdr.resetfn = NULL;
- result->hdr.scanfn = NULL;
- result->hdr.checkfn = NULL;
- result->hdr.errorfn = NULL;
- ARG_TRACE(("arg_rem() returns %p\n", result));
- return result;
- }
- /*******************************************************************************
- * arg_rex: Implements the regex command-line option
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 1998-2001,2003-2011,2013 Stewart Heitmann
- * <sheitmann@users.sourceforge.net>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <stdlib.h>
- #include <string.h>
- #ifndef _TREX_H_
- #define _TREX_H_
- /*
- * This module uses the T-Rex regular expression library to implement the regex
- * logic. Here is the copyright notice of the library:
- *
- * Copyright (C) 2003-2006 Alberto Demichelis
- *
- * This software is provided 'as-is', without any express
- * or implied warranty. In no event will the authors be held
- * liable for any damages arising from the use of this software.
- *
- * Permission is granted to anyone to use this software for
- * any purpose, including commercial applications, and to alter
- * it and redistribute it freely, subject to the following restrictions:
- *
- * 1. The origin of this software must not be misrepresented;
- * you must not claim that you wrote the original software.
- * If you use this software in a product, an acknowledgment
- * in the product documentation would be appreciated but
- * is not required.
- *
- * 2. Altered source versions must be plainly marked as such,
- * and must not be misrepresented as being the original software.
- *
- * 3. This notice may not be removed or altered from any
- * source distribution.
- */
- #ifdef __cplusplus
- extern "C" {
- #endif
- #define TRexChar char
- #define MAX_CHAR 0xFF
- #define _TREXC(c) (c)
- #define trex_strlen strlen
- #define trex_printf printf
- #ifndef TREX_API
- #define TREX_API extern
- #endif
- #define TRex_True 1
- #define TRex_False 0
- #define TREX_ICASE ARG_REX_ICASE
- typedef unsigned int TRexBool;
- typedef struct TRex TRex;
- typedef struct {
- const TRexChar* begin;
- int len;
- } TRexMatch;
- TREX_API TRex* trex_compile(const TRexChar* pattern, const TRexChar** error, int flags);
- TREX_API void trex_free(TRex* exp);
- TREX_API TRexBool trex_match(TRex* exp, const TRexChar* text);
- TREX_API TRexBool trex_search(TRex* exp, const TRexChar* text, const TRexChar** out_begin, const TRexChar** out_end);
- TREX_API TRexBool
- trex_searchrange(TRex* exp, const TRexChar* text_begin, const TRexChar* text_end, const TRexChar** out_begin, const TRexChar** out_end);
- TREX_API int trex_getsubexpcount(TRex* exp);
- TREX_API TRexBool trex_getsubexp(TRex* exp, int n, TRexMatch* subexp);
- #ifdef __cplusplus
- }
- #endif
- #endif
- struct privhdr {
- const char* pattern;
- int flags;
- };
- static void arg_rex_resetfn(struct arg_rex* parent) {
- ARG_TRACE(("%s:resetfn(%p)\n", __FILE__, parent));
- parent->count = 0;
- }
- static int arg_rex_scanfn(struct arg_rex* parent, const char* argval) {
- int errorcode = 0;
- const TRexChar* error = NULL;
- TRex* rex = NULL;
- TRexBool is_match = TRex_False;
- if (parent->count == parent->hdr.maxcount) {
- /* maximum number of arguments exceeded */
- errorcode = ARG_ERR_MAXCOUNT;
- } else if (!argval) {
- /* a valid argument with no argument value was given. */
- /* This happens when an optional argument value was invoked. */
- /* leave parent argument value unaltered but still count the argument. */
- parent->count++;
- } else {
- struct privhdr* priv = (struct privhdr*)parent->hdr.priv;
- /* test the current argument value for a match with the regular expression */
- /* if a match is detected, record the argument value in the arg_rex struct */
- rex = trex_compile(priv->pattern, &error, priv->flags);
- is_match = trex_match(rex, argval);
- if (!is_match)
- errorcode = ARG_ERR_REGNOMATCH;
- else
- parent->sval[parent->count++] = argval;
- trex_free(rex);
- }
- ARG_TRACE(("%s:scanfn(%p) returns %d\n", __FILE__, parent, errorcode));
- return errorcode;
- }
- static int arg_rex_checkfn(struct arg_rex* parent) {
- int errorcode = (parent->count < parent->hdr.mincount) ? ARG_ERR_MINCOUNT : 0;
- #if 0
- struct privhdr *priv = (struct privhdr*)parent->hdr.priv;
- /* free the regex "program" we constructed in resetfn */
- regfree(&(priv->regex));
- /*printf("%s:checkfn(%p) returns %d\n",__FILE__,parent,errorcode);*/
- #endif
- return errorcode;
- }
- static void arg_rex_errorfn(struct arg_rex* parent, arg_dstr_t ds, int errorcode, const char* argval, const char* progname) {
- const char* shortopts = parent->hdr.shortopts;
- const char* longopts = parent->hdr.longopts;
- const char* datatype = parent->hdr.datatype;
- /* make argval NULL safe */
- argval = argval ? argval : "";
- arg_dstr_catf(ds, "%s: ", progname);
- switch (errorcode) {
- case ARG_ERR_MINCOUNT:
- arg_dstr_cat(ds, "missing option ");
- arg_print_option_ds(ds, shortopts, longopts, datatype, "\n");
- break;
- case ARG_ERR_MAXCOUNT:
- arg_dstr_cat(ds, "excess option ");
- arg_print_option_ds(ds, shortopts, longopts, argval, "\n");
- break;
- case ARG_ERR_REGNOMATCH:
- arg_dstr_cat(ds, "illegal value ");
- arg_print_option_ds(ds, shortopts, longopts, argval, "\n");
- break;
- default: {
- #if 0
- char errbuff[256];
- regerror(errorcode, NULL, errbuff, sizeof(errbuff));
- printf("%s\n", errbuff);
- #endif
- } break;
- }
- }
- struct arg_rex* arg_rex0(const char* shortopts, const char* longopts, const char* pattern, const char* datatype, int flags, const char* glossary) {
- return arg_rexn(shortopts, longopts, pattern, datatype, 0, 1, flags, glossary);
- }
- struct arg_rex* arg_rex1(const char* shortopts, const char* longopts, const char* pattern, const char* datatype, int flags, const char* glossary) {
- return arg_rexn(shortopts, longopts, pattern, datatype, 1, 1, flags, glossary);
- }
- struct arg_rex* arg_rexn(const char* shortopts,
- const char* longopts,
- const char* pattern,
- const char* datatype,
- int mincount,
- int maxcount,
- int flags,
- const char* glossary) {
- size_t nbytes;
- struct arg_rex* result;
- struct privhdr* priv;
- int i;
- const TRexChar* error = NULL;
- TRex* rex = NULL;
- if (!pattern) {
- printf("argtable: ERROR - illegal regular expression pattern \"(NULL)\"\n");
- printf("argtable: Bad argument table.\n");
- return NULL;
- }
- /* foolproof things by ensuring maxcount is not less than mincount */
- maxcount = (maxcount < mincount) ? mincount : maxcount;
- nbytes = sizeof(struct arg_rex) /* storage for struct arg_rex */
- + sizeof(struct privhdr) /* storage for private arg_rex data */
- + maxcount * sizeof(char*); /* storage for sval[maxcount] array */
- /* init the arg_hdr struct */
- result = (struct arg_rex*)xmalloc(nbytes);
- result->hdr.flag = ARG_HASVALUE;
- result->hdr.shortopts = shortopts;
- result->hdr.longopts = longopts;
- result->hdr.datatype = datatype ? datatype : pattern;
- result->hdr.glossary = glossary;
- result->hdr.mincount = mincount;
- result->hdr.maxcount = maxcount;
- result->hdr.parent = result;
- result->hdr.resetfn = (arg_resetfn*)arg_rex_resetfn;
- result->hdr.scanfn = (arg_scanfn*)arg_rex_scanfn;
- result->hdr.checkfn = (arg_checkfn*)arg_rex_checkfn;
- result->hdr.errorfn = (arg_errorfn*)arg_rex_errorfn;
- /* store the arg_rex_priv struct immediately after the arg_rex struct */
- result->hdr.priv = result + 1;
- priv = (struct privhdr*)(result->hdr.priv);
- priv->pattern = pattern;
- priv->flags = flags;
- /* store the sval[maxcount] array immediately after the arg_rex_priv struct */
- result->sval = (const char**)(priv + 1);
- result->count = 0;
- /* foolproof the string pointers by initializing them to reference empty strings */
- for (i = 0; i < maxcount; i++)
- result->sval[i] = "";
- /* here we construct and destroy a regex representation of the regular
- * expression for no other reason than to force any regex errors to be
- * trapped now rather than later. If we don't, then errors may go undetected
- * until an argument is actually parsed.
- */
- rex = trex_compile(priv->pattern, &error, priv->flags);
- if (rex == NULL) {
- ARG_LOG(("argtable: %s \"%s\"\n", error ? error : _TREXC("undefined"), priv->pattern));
- ARG_LOG(("argtable: Bad argument table.\n"));
- }
- trex_free(rex);
- ARG_TRACE(("arg_rexn() returns %p\n", result));
- return result;
- }
- /* see copyright notice in trex.h */
- #include <ctype.h>
- #include <setjmp.h>
- #include <stdlib.h>
- #include <string.h>
- #ifdef _UINCODE
- #define scisprint iswprint
- #define scstrlen wcslen
- #define scprintf wprintf
- #define _SC(x) L(x)
- #else
- #define scisprint isprint
- #define scstrlen strlen
- #define scprintf printf
- #define _SC(x) (x)
- #endif
- #ifdef _DEBUG
- #include <stdio.h>
- static const TRexChar* g_nnames[] = {_SC("NONE"), _SC("OP_GREEDY"), _SC("OP_OR"), _SC("OP_EXPR"), _SC("OP_NOCAPEXPR"),
- _SC("OP_DOT"), _SC("OP_CLASS"), _SC("OP_CCLASS"), _SC("OP_NCLASS"), _SC("OP_RANGE"),
- _SC("OP_CHAR"), _SC("OP_EOL"), _SC("OP_BOL"), _SC("OP_WB")};
- #endif
- #define OP_GREEDY (MAX_CHAR + 1) /* * + ? {n} */
- #define OP_OR (MAX_CHAR + 2)
- #define OP_EXPR (MAX_CHAR + 3) /* parentesis () */
- #define OP_NOCAPEXPR (MAX_CHAR + 4) /* parentesis (?:) */
- #define OP_DOT (MAX_CHAR + 5)
- #define OP_CLASS (MAX_CHAR + 6)
- #define OP_CCLASS (MAX_CHAR + 7)
- #define OP_NCLASS (MAX_CHAR + 8) /* negates class the [^ */
- #define OP_RANGE (MAX_CHAR + 9)
- #define OP_CHAR (MAX_CHAR + 10)
- #define OP_EOL (MAX_CHAR + 11)
- #define OP_BOL (MAX_CHAR + 12)
- #define OP_WB (MAX_CHAR + 13)
- #define TREX_SYMBOL_ANY_CHAR ('.')
- #define TREX_SYMBOL_GREEDY_ONE_OR_MORE ('+')
- #define TREX_SYMBOL_GREEDY_ZERO_OR_MORE ('*')
- #define TREX_SYMBOL_GREEDY_ZERO_OR_ONE ('?')
- #define TREX_SYMBOL_BRANCH ('|')
- #define TREX_SYMBOL_END_OF_STRING ('$')
- #define TREX_SYMBOL_BEGINNING_OF_STRING ('^')
- #define TREX_SYMBOL_ESCAPE_CHAR ('\\')
- typedef int TRexNodeType;
- typedef struct tagTRexNode {
- TRexNodeType type;
- int left;
- int right;
- int next;
- } TRexNode;
- struct TRex {
- const TRexChar* _eol;
- const TRexChar* _bol;
- const TRexChar* _p;
- int _first;
- int _op;
- TRexNode* _nodes;
- int _nallocated;
- int _nsize;
- int _nsubexpr;
- TRexMatch* _matches;
- int _currsubexp;
- void* _jmpbuf;
- const TRexChar** _error;
- int _flags;
- };
- static int trex_list(TRex* exp);
- static int trex_newnode(TRex* exp, TRexNodeType type) {
- TRexNode n;
- int newid;
- n.type = type;
- n.next = n.right = n.left = -1;
- if (type == OP_EXPR)
- n.right = exp->_nsubexpr++;
- if (exp->_nallocated < (exp->_nsize + 1)) {
- exp->_nallocated *= 2;
- exp->_nodes = (TRexNode*)xrealloc(exp->_nodes, exp->_nallocated * sizeof(TRexNode));
- }
- exp->_nodes[exp->_nsize++] = n;
- newid = exp->_nsize - 1;
- return (int)newid;
- }
- static void trex_error(TRex* exp, const TRexChar* error) {
- if (exp->_error)
- *exp->_error = error;
- longjmp(*((jmp_buf*)exp->_jmpbuf), -1);
- }
- static void trex_expect(TRex* exp, int n) {
- if ((*exp->_p) != n)
- trex_error(exp, _SC("expected paren"));
- exp->_p++;
- }
- static TRexChar trex_escapechar(TRex* exp) {
- if (*exp->_p == TREX_SYMBOL_ESCAPE_CHAR) {
- exp->_p++;
- switch (*exp->_p) {
- case 'v':
- exp->_p++;
- return '\v';
- case 'n':
- exp->_p++;
- return '\n';
- case 't':
- exp->_p++;
- return '\t';
- case 'r':
- exp->_p++;
- return '\r';
- case 'f':
- exp->_p++;
- return '\f';
- default:
- return (*exp->_p++);
- }
- } else if (!scisprint(*exp->_p))
- trex_error(exp, _SC("letter expected"));
- return (*exp->_p++);
- }
- static int trex_charclass(TRex* exp, int classid) {
- int n = trex_newnode(exp, OP_CCLASS);
- exp->_nodes[n].left = classid;
- return n;
- }
- static int trex_charnode(TRex* exp, TRexBool isclass) {
- TRexChar t;
- if (*exp->_p == TREX_SYMBOL_ESCAPE_CHAR) {
- exp->_p++;
- switch (*exp->_p) {
- case 'n':
- exp->_p++;
- return trex_newnode(exp, '\n');
- case 't':
- exp->_p++;
- return trex_newnode(exp, '\t');
- case 'r':
- exp->_p++;
- return trex_newnode(exp, '\r');
- case 'f':
- exp->_p++;
- return trex_newnode(exp, '\f');
- case 'v':
- exp->_p++;
- return trex_newnode(exp, '\v');
- case 'a':
- case 'A':
- case 'w':
- case 'W':
- case 's':
- case 'S':
- case 'd':
- case 'D':
- case 'x':
- case 'X':
- case 'c':
- case 'C':
- case 'p':
- case 'P':
- case 'l':
- case 'u': {
- t = *exp->_p;
- exp->_p++;
- return trex_charclass(exp, t);
- }
- case 'b':
- case 'B':
- if (!isclass) {
- int node = trex_newnode(exp, OP_WB);
- exp->_nodes[node].left = *exp->_p;
- exp->_p++;
- return node;
- }
- /* fall through */
- default:
- t = *exp->_p;
- exp->_p++;
- return trex_newnode(exp, t);
- }
- } else if (!scisprint(*exp->_p)) {
- trex_error(exp, _SC("letter expected"));
- }
- t = *exp->_p;
- exp->_p++;
- return trex_newnode(exp, t);
- }
- static int trex_class(TRex* exp) {
- int ret = -1;
- int first = -1, chain;
- if (*exp->_p == TREX_SYMBOL_BEGINNING_OF_STRING) {
- ret = trex_newnode(exp, OP_NCLASS);
- exp->_p++;
- } else
- ret = trex_newnode(exp, OP_CLASS);
- if (*exp->_p == ']')
- trex_error(exp, _SC("empty class"));
- chain = ret;
- while (*exp->_p != ']' && exp->_p != exp->_eol) {
- if (*exp->_p == '-' && first != -1) {
- int r, t;
- if (*exp->_p++ == ']')
- trex_error(exp, _SC("unfinished range"));
- r = trex_newnode(exp, OP_RANGE);
- if (first > *exp->_p)
- trex_error(exp, _SC("invalid range"));
- if (exp->_nodes[first].type == OP_CCLASS)
- trex_error(exp, _SC("cannot use character classes in ranges"));
- exp->_nodes[r].left = exp->_nodes[first].type;
- t = trex_escapechar(exp);
- exp->_nodes[r].right = t;
- exp->_nodes[chain].next = r;
- chain = r;
- first = -1;
- } else {
- if (first != -1) {
- int c = first;
- exp->_nodes[chain].next = c;
- chain = c;
- first = trex_charnode(exp, TRex_True);
- } else {
- first = trex_charnode(exp, TRex_True);
- }
- }
- }
- if (first != -1) {
- int c = first;
- exp->_nodes[chain].next = c;
- chain = c;
- first = -1;
- }
- /* hack? */
- exp->_nodes[ret].left = exp->_nodes[ret].next;
- exp->_nodes[ret].next = -1;
- return ret;
- }
- static int trex_parsenumber(TRex* exp) {
- int ret = *exp->_p - '0';
- int positions = 10;
- exp->_p++;
- while (isdigit(*exp->_p)) {
- ret = ret * 10 + (*exp->_p++ - '0');
- if (positions == 1000000000)
- trex_error(exp, _SC("overflow in numeric constant"));
- positions *= 10;
- };
- return ret;
- }
- static int trex_element(TRex* exp) {
- int ret = -1;
- switch (*exp->_p) {
- case '(': {
- int expr, newn;
- exp->_p++;
- if (*exp->_p == '?') {
- exp->_p++;
- trex_expect(exp, ':');
- expr = trex_newnode(exp, OP_NOCAPEXPR);
- } else
- expr = trex_newnode(exp, OP_EXPR);
- newn = trex_list(exp);
- exp->_nodes[expr].left = newn;
- ret = expr;
- trex_expect(exp, ')');
- } break;
- case '[':
- exp->_p++;
- ret = trex_class(exp);
- trex_expect(exp, ']');
- break;
- case TREX_SYMBOL_END_OF_STRING:
- exp->_p++;
- ret = trex_newnode(exp, OP_EOL);
- break;
- case TREX_SYMBOL_ANY_CHAR:
- exp->_p++;
- ret = trex_newnode(exp, OP_DOT);
- break;
- default:
- ret = trex_charnode(exp, TRex_False);
- break;
- }
- {
- TRexBool isgreedy = TRex_False;
- unsigned short p0 = 0, p1 = 0;
- switch (*exp->_p) {
- case TREX_SYMBOL_GREEDY_ZERO_OR_MORE:
- p0 = 0;
- p1 = 0xFFFF;
- exp->_p++;
- isgreedy = TRex_True;
- break;
- case TREX_SYMBOL_GREEDY_ONE_OR_MORE:
- p0 = 1;
- p1 = 0xFFFF;
- exp->_p++;
- isgreedy = TRex_True;
- break;
- case TREX_SYMBOL_GREEDY_ZERO_OR_ONE:
- p0 = 0;
- p1 = 1;
- exp->_p++;
- isgreedy = TRex_True;
- break;
- case '{':
- exp->_p++;
- if (!isdigit(*exp->_p))
- trex_error(exp, _SC("number expected"));
- p0 = (unsigned short)trex_parsenumber(exp);
- /*******************************/
- switch (*exp->_p) {
- case '}':
- p1 = p0;
- exp->_p++;
- break;
- case ',':
- exp->_p++;
- p1 = 0xFFFF;
- if (isdigit(*exp->_p)) {
- p1 = (unsigned short)trex_parsenumber(exp);
- }
- trex_expect(exp, '}');
- break;
- default:
- trex_error(exp, _SC(", or } expected"));
- }
- /*******************************/
- isgreedy = TRex_True;
- break;
- }
- if (isgreedy) {
- int nnode = trex_newnode(exp, OP_GREEDY);
- exp->_nodes[nnode].left = ret;
- exp->_nodes[nnode].right = ((p0) << 16) | p1;
- ret = nnode;
- }
- }
- if ((*exp->_p != TREX_SYMBOL_BRANCH) && (*exp->_p != ')') && (*exp->_p != TREX_SYMBOL_GREEDY_ZERO_OR_MORE) &&
- (*exp->_p != TREX_SYMBOL_GREEDY_ONE_OR_MORE) && (*exp->_p != '\0')) {
- int nnode = trex_element(exp);
- exp->_nodes[ret].next = nnode;
- }
- return ret;
- }
- static int trex_list(TRex* exp) {
- int ret = -1, e;
- if (*exp->_p == TREX_SYMBOL_BEGINNING_OF_STRING) {
- exp->_p++;
- ret = trex_newnode(exp, OP_BOL);
- }
- e = trex_element(exp);
- if (ret != -1) {
- exp->_nodes[ret].next = e;
- } else
- ret = e;
- if (*exp->_p == TREX_SYMBOL_BRANCH) {
- int temp, tright;
- exp->_p++;
- temp = trex_newnode(exp, OP_OR);
- exp->_nodes[temp].left = ret;
- tright = trex_list(exp);
- exp->_nodes[temp].right = tright;
- ret = temp;
- }
- return ret;
- }
- static TRexBool trex_matchcclass(int cclass, TRexChar c) {
- switch (cclass) {
- case 'a':
- return isalpha(c) ? TRex_True : TRex_False;
- case 'A':
- return !isalpha(c) ? TRex_True : TRex_False;
- case 'w':
- return (isalnum(c) || c == '_') ? TRex_True : TRex_False;
- case 'W':
- return (!isalnum(c) && c != '_') ? TRex_True : TRex_False;
- case 's':
- return isspace(c) ? TRex_True : TRex_False;
- case 'S':
- return !isspace(c) ? TRex_True : TRex_False;
- case 'd':
- return isdigit(c) ? TRex_True : TRex_False;
- case 'D':
- return !isdigit(c) ? TRex_True : TRex_False;
- case 'x':
- return isxdigit(c) ? TRex_True : TRex_False;
- case 'X':
- return !isxdigit(c) ? TRex_True : TRex_False;
- case 'c':
- return iscntrl(c) ? TRex_True : TRex_False;
- case 'C':
- return !iscntrl(c) ? TRex_True : TRex_False;
- case 'p':
- return ispunct(c) ? TRex_True : TRex_False;
- case 'P':
- return !ispunct(c) ? TRex_True : TRex_False;
- case 'l':
- return islower(c) ? TRex_True : TRex_False;
- case 'u':
- return isupper(c) ? TRex_True : TRex_False;
- }
- return TRex_False; /*cannot happen*/
- }
- static TRexBool trex_matchclass(TRex* exp, TRexNode* node, TRexChar c) {
- do {
- switch (node->type) {
- case OP_RANGE:
- if (exp->_flags & TREX_ICASE) {
- if (c >= toupper(node->left) && c <= toupper(node->right))
- return TRex_True;
- if (c >= tolower(node->left) && c <= tolower(node->right))
- return TRex_True;
- } else {
- if (c >= node->left && c <= node->right)
- return TRex_True;
- }
- break;
- case OP_CCLASS:
- if (trex_matchcclass(node->left, c))
- return TRex_True;
- break;
- default:
- if (exp->_flags & TREX_ICASE) {
- if (c == tolower(node->type) || c == toupper(node->type))
- return TRex_True;
- } else {
- if (c == node->type)
- return TRex_True;
- }
- }
- } while ((node->next != -1) && ((node = &exp->_nodes[node->next]) != NULL));
- return TRex_False;
- }
- static const TRexChar* trex_matchnode(TRex* exp, TRexNode* node, const TRexChar* str, TRexNode* next) {
- TRexNodeType type = node->type;
- switch (type) {
- case OP_GREEDY: {
- /* TRexNode *greedystop = (node->next != -1) ? &exp->_nodes[node->next] : NULL; */
- TRexNode* greedystop = NULL;
- int p0 = (node->right >> 16) & 0x0000FFFF, p1 = node->right & 0x0000FFFF, nmaches = 0;
- const TRexChar *s = str, *good = str;
- if (node->next != -1) {
- greedystop = &exp->_nodes[node->next];
- } else {
- greedystop = next;
- }
- while ((nmaches == 0xFFFF || nmaches < p1)) {
- const TRexChar* stop;
- if ((s = trex_matchnode(exp, &exp->_nodes[node->left], s, greedystop)) == NULL)
- break;
- nmaches++;
- good = s;
- if (greedystop) {
- /* checks that 0 matches satisfy the expression(if so skips) */
- /* if not would always stop(for instance if is a '?') */
- if (greedystop->type != OP_GREEDY || (greedystop->type == OP_GREEDY && ((greedystop->right >> 16) & 0x0000FFFF) != 0)) {
- TRexNode* gnext = NULL;
- if (greedystop->next != -1) {
- gnext = &exp->_nodes[greedystop->next];
- } else if (next && next->next != -1) {
- gnext = &exp->_nodes[next->next];
- }
- stop = trex_matchnode(exp, greedystop, s, gnext);
- if (stop) {
- /* if satisfied stop it */
- if (p0 == p1 && p0 == nmaches)
- break;
- else if (nmaches >= p0 && p1 == 0xFFFF)
- break;
- else if (nmaches >= p0 && nmaches <= p1)
- break;
- }
- }
- }
- if (s >= exp->_eol)
- break;
- }
- if (p0 == p1 && p0 == nmaches)
- return good;
- else if (nmaches >= p0 && p1 == 0xFFFF)
- return good;
- else if (nmaches >= p0 && nmaches <= p1)
- return good;
- return NULL;
- }
- case OP_OR: {
- const TRexChar* asd = str;
- TRexNode* temp = &exp->_nodes[node->left];
- while ((asd = trex_matchnode(exp, temp, asd, NULL)) != NULL) {
- if (temp->next != -1)
- temp = &exp->_nodes[temp->next];
- else
- return asd;
- }
- asd = str;
- temp = &exp->_nodes[node->right];
- while ((asd = trex_matchnode(exp, temp, asd, NULL)) != NULL) {
- if (temp->next != -1)
- temp = &exp->_nodes[temp->next];
- else
- return asd;
- }
- return NULL;
- break;
- }
- case OP_EXPR:
- case OP_NOCAPEXPR: {
- TRexNode* n = &exp->_nodes[node->left];
- const TRexChar* cur = str;
- int capture = -1;
- if (node->type != OP_NOCAPEXPR && node->right == exp->_currsubexp) {
- capture = exp->_currsubexp;
- exp->_matches[capture].begin = cur;
- exp->_currsubexp++;
- }
- do {
- TRexNode* subnext = NULL;
- if (n->next != -1) {
- subnext = &exp->_nodes[n->next];
- } else {
- subnext = next;
- }
- if ((cur = trex_matchnode(exp, n, cur, subnext)) == NULL) {
- if (capture != -1) {
- exp->_matches[capture].begin = 0;
- exp->_matches[capture].len = 0;
- }
- return NULL;
- }
- } while ((n->next != -1) && ((n = &exp->_nodes[n->next]) != NULL));
- if (capture != -1)
- exp->_matches[capture].len = (int)(cur - exp->_matches[capture].begin);
- return cur;
- }
- case OP_WB:
- if ((str == exp->_bol && !isspace(*str)) || (str == exp->_eol && !isspace(*(str - 1))) || (!isspace(*str) && isspace(*(str + 1))) ||
- (isspace(*str) && !isspace(*(str + 1)))) {
- return (node->left == 'b') ? str : NULL;
- }
- return (node->left == 'b') ? NULL : str;
- case OP_BOL:
- if (str == exp->_bol)
- return str;
- return NULL;
- case OP_EOL:
- if (str == exp->_eol)
- return str;
- return NULL;
- case OP_DOT: {
- str++;
- }
- return str;
- case OP_NCLASS:
- case OP_CLASS:
- if (trex_matchclass(exp, &exp->_nodes[node->left], *str) ? (type == OP_CLASS ? TRex_True : TRex_False)
- : (type == OP_NCLASS ? TRex_True : TRex_False)) {
- str++;
- return str;
- }
- return NULL;
- case OP_CCLASS:
- if (trex_matchcclass(node->left, *str)) {
- str++;
- return str;
- }
- return NULL;
- default: /* char */
- if (exp->_flags & TREX_ICASE) {
- if (*str != tolower(node->type) && *str != toupper(node->type))
- return NULL;
- } else {
- if (*str != node->type)
- return NULL;
- }
- str++;
- return str;
- }
- }
- /* public api */
- TRex* trex_compile(const TRexChar* pattern, const TRexChar** error, int flags) {
- TRex* exp = (TRex*)xmalloc(sizeof(TRex));
- exp->_eol = exp->_bol = NULL;
- exp->_p = pattern;
- exp->_nallocated = (int)scstrlen(pattern) * sizeof(TRexChar);
- exp->_nodes = (TRexNode*)xmalloc(exp->_nallocated * sizeof(TRexNode));
- exp->_nsize = 0;
- exp->_matches = 0;
- exp->_nsubexpr = 0;
- exp->_first = trex_newnode(exp, OP_EXPR);
- exp->_error = error;
- exp->_jmpbuf = xmalloc(sizeof(jmp_buf));
- exp->_flags = flags;
- if (setjmp(*((jmp_buf*)exp->_jmpbuf)) == 0) {
- int res = trex_list(exp);
- exp->_nodes[exp->_first].left = res;
- if (*exp->_p != '\0')
- trex_error(exp, _SC("unexpected character"));
- #ifdef _DEBUG
- {
- int nsize, i;
- TRexNode* t;
- nsize = exp->_nsize;
- t = &exp->_nodes[0];
- scprintf(_SC("\n"));
- for (i = 0; i < nsize; i++) {
- if (exp->_nodes[i].type > MAX_CHAR)
- scprintf(_SC("[%02d] %10s "), i, g_nnames[exp->_nodes[i].type - MAX_CHAR]);
- else
- scprintf(_SC("[%02d] %10c "), i, exp->_nodes[i].type);
- scprintf(_SC("left %02d right %02d next %02d\n"), exp->_nodes[i].left, exp->_nodes[i].right, exp->_nodes[i].next);
- }
- scprintf(_SC("\n"));
- }
- #endif
- exp->_matches = (TRexMatch*)xmalloc(exp->_nsubexpr * sizeof(TRexMatch));
- memset(exp->_matches, 0, exp->_nsubexpr * sizeof(TRexMatch));
- } else {
- trex_free(exp);
- return NULL;
- }
- return exp;
- }
- void trex_free(TRex* exp) {
- if (exp) {
- xfree(exp->_nodes);
- xfree(exp->_jmpbuf);
- xfree(exp->_matches);
- xfree(exp);
- }
- }
- TRexBool trex_match(TRex* exp, const TRexChar* text) {
- const TRexChar* res = NULL;
- exp->_bol = text;
- exp->_eol = text + scstrlen(text);
- exp->_currsubexp = 0;
- res = trex_matchnode(exp, exp->_nodes, text, NULL);
- if (res == NULL || res != exp->_eol)
- return TRex_False;
- return TRex_True;
- }
- TRexBool trex_searchrange(TRex* exp, const TRexChar* text_begin, const TRexChar* text_end, const TRexChar** out_begin, const TRexChar** out_end) {
- const TRexChar* cur = NULL;
- int node = exp->_first;
- if (text_begin >= text_end)
- return TRex_False;
- exp->_bol = text_begin;
- exp->_eol = text_end;
- do {
- cur = text_begin;
- while (node != -1) {
- exp->_currsubexp = 0;
- cur = trex_matchnode(exp, &exp->_nodes[node], cur, NULL);
- if (!cur)
- break;
- node = exp->_nodes[node].next;
- }
- text_begin++;
- } while (cur == NULL && text_begin != text_end);
- if (cur == NULL)
- return TRex_False;
- --text_begin;
- if (out_begin)
- *out_begin = text_begin;
- if (out_end)
- *out_end = cur;
- return TRex_True;
- }
- TRexBool trex_search(TRex* exp, const TRexChar* text, const TRexChar** out_begin, const TRexChar** out_end) {
- return trex_searchrange(exp, text, text + scstrlen(text), out_begin, out_end);
- }
- int trex_getsubexpcount(TRex* exp) {
- return exp->_nsubexpr;
- }
- TRexBool trex_getsubexp(TRex* exp, int n, TRexMatch* subexp) {
- if (n < 0 || n >= exp->_nsubexpr)
- return TRex_False;
- *subexp = exp->_matches[n];
- return TRex_True;
- }
- /*******************************************************************************
- * arg_str: Implements the str command-line option
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 1998-2001,2003-2011,2013 Stewart Heitmann
- * <sheitmann@users.sourceforge.net>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <stdlib.h>
- static void arg_str_resetfn(struct arg_str* parent) {
- int i;
-
- ARG_TRACE(("%s:resetfn(%p)\n", __FILE__, parent));
- for (i = 0; i < parent->count; i++) {
- parent->sval[i] = "";
- }
- parent->count = 0;
- }
- static int arg_str_scanfn(struct arg_str* parent, const char* argval) {
- int errorcode = 0;
- if (parent->count == parent->hdr.maxcount) {
- /* maximum number of arguments exceeded */
- errorcode = ARG_ERR_MAXCOUNT;
- } else if (!argval) {
- /* a valid argument with no argument value was given. */
- /* This happens when an optional argument value was invoked. */
- /* leave parent argument value unaltered but still count the argument. */
- parent->count++;
- } else {
- parent->sval[parent->count++] = argval;
- }
- ARG_TRACE(("%s:scanfn(%p) returns %d\n", __FILE__, parent, errorcode));
- return errorcode;
- }
- static int arg_str_checkfn(struct arg_str* parent) {
- int errorcode = (parent->count < parent->hdr.mincount) ? ARG_ERR_MINCOUNT : 0;
- ARG_TRACE(("%s:checkfn(%p) returns %d\n", __FILE__, parent, errorcode));
- return errorcode;
- }
- static void arg_str_errorfn(struct arg_str* parent, arg_dstr_t ds, int errorcode, const char* argval, const char* progname) {
- const char* shortopts = parent->hdr.shortopts;
- const char* longopts = parent->hdr.longopts;
- const char* datatype = parent->hdr.datatype;
- /* make argval NULL safe */
- argval = argval ? argval : "";
- arg_dstr_catf(ds, "%s: ", progname);
- switch (errorcode) {
- case ARG_ERR_MINCOUNT:
- arg_dstr_cat(ds, "missing option ");
- arg_print_option_ds(ds, shortopts, longopts, datatype, "\n");
- break;
- case ARG_ERR_MAXCOUNT:
- arg_dstr_cat(ds, "excess option ");
- arg_print_option_ds(ds, shortopts, longopts, argval, "\n");
- break;
- }
- }
- struct arg_str* arg_str0(const char* shortopts, const char* longopts, const char* datatype, const char* glossary) {
- return arg_strn(shortopts, longopts, datatype, 0, 1, glossary);
- }
- struct arg_str* arg_str1(const char* shortopts, const char* longopts, const char* datatype, const char* glossary) {
- return arg_strn(shortopts, longopts, datatype, 1, 1, glossary);
- }
- struct arg_str* arg_strn(const char* shortopts, const char* longopts, const char* datatype, int mincount, int maxcount, const char* glossary) {
- size_t nbytes;
- struct arg_str* result;
- int i;
- /* should not allow this stupid error */
- /* we should return an error code warning this logic error */
- /* foolproof things by ensuring maxcount is not less than mincount */
- maxcount = (maxcount < mincount) ? mincount : maxcount;
- nbytes = sizeof(struct arg_str) /* storage for struct arg_str */
- + maxcount * sizeof(char*); /* storage for sval[maxcount] array */
- result = (struct arg_str*)xmalloc(nbytes);
- /* init the arg_hdr struct */
- result->hdr.flag = ARG_HASVALUE;
- result->hdr.shortopts = shortopts;
- result->hdr.longopts = longopts;
- result->hdr.datatype = datatype ? datatype : "<string>";
- result->hdr.glossary = glossary;
- result->hdr.mincount = mincount;
- result->hdr.maxcount = maxcount;
- result->hdr.parent = result;
- result->hdr.resetfn = (arg_resetfn*)arg_str_resetfn;
- result->hdr.scanfn = (arg_scanfn*)arg_str_scanfn;
- result->hdr.checkfn = (arg_checkfn*)arg_str_checkfn;
- result->hdr.errorfn = (arg_errorfn*)arg_str_errorfn;
- /* store the sval[maxcount] array immediately after the arg_str struct */
- result->sval = (const char**)(result + 1);
- result->count = 0;
- /* foolproof the string pointers by initializing them to reference empty strings */
- for (i = 0; i < maxcount; i++)
- result->sval[i] = "";
- ARG_TRACE(("arg_strn() returns %p\n", result));
- return result;
- }
- /*******************************************************************************
- * arg_cmd: Provides the sub-command mechanism
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 2013-2019 Tom G. Huang
- * <tomghuang@gmail.com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #endif
- #include <assert.h>
- #include <stdlib.h>
- #include <string.h>
- #define MAX_MODULE_VERSION_SIZE 128
- static arg_hashtable_t* s_hashtable = NULL;
- static char* s_module_name = NULL;
- static int s_mod_ver_major = 0;
- static int s_mod_ver_minor = 0;
- static int s_mod_ver_patch = 0;
- static char* s_mod_ver_tag = NULL;
- static char* s_mod_ver = NULL;
- void arg_set_module_name(const char* name) {
- size_t slen;
- xfree(s_module_name);
- slen = strlen(name);
- s_module_name = (char*)xmalloc(slen + 1);
- memset(s_module_name, 0, slen + 1);
- #if (defined(__STDC_LIB_EXT1__) && defined(__STDC_WANT_LIB_EXT1__)) || (defined(__STDC_SECURE_LIB__) && defined(__STDC_WANT_SECURE_LIB__))
- strncpy_s(s_module_name, slen + 1, name, slen);
- #else
- memcpy(s_module_name, name, slen);
- #endif
- }
- void arg_set_module_version(int major, int minor, int patch, const char* tag) {
- size_t slen_tag, slen_ds;
- arg_dstr_t ds;
- s_mod_ver_major = major;
- s_mod_ver_minor = minor;
- s_mod_ver_patch = patch;
- xfree(s_mod_ver_tag);
- slen_tag = strlen(tag);
- s_mod_ver_tag = (char*)xmalloc(slen_tag + 1);
- memset(s_mod_ver_tag, 0, slen_tag + 1);
- #if (defined(__STDC_LIB_EXT1__) && defined(__STDC_WANT_LIB_EXT1__)) || (defined(__STDC_SECURE_LIB__) && defined(__STDC_WANT_SECURE_LIB__))
- strncpy_s(s_mod_ver_tag, slen_tag + 1, tag, slen_tag);
- #else
- memcpy(s_mod_ver_tag, tag, slen_tag);
- #endif
- ds = arg_dstr_create();
- arg_dstr_catf(ds, "%d.", s_mod_ver_major);
- arg_dstr_catf(ds, "%d.", s_mod_ver_minor);
- arg_dstr_catf(ds, "%d.", s_mod_ver_patch);
- arg_dstr_cat(ds, s_mod_ver_tag);
- xfree(s_mod_ver);
- slen_ds = strlen(arg_dstr_cstr(ds));
- s_mod_ver = (char*)xmalloc(slen_ds + 1);
- memset(s_mod_ver, 0, slen_ds + 1);
- #if (defined(__STDC_LIB_EXT1__) && defined(__STDC_WANT_LIB_EXT1__)) || (defined(__STDC_SECURE_LIB__) && defined(__STDC_WANT_SECURE_LIB__))
- strncpy_s(s_mod_ver, slen_ds + 1, arg_dstr_cstr(ds), slen_ds);
- #else
- memcpy(s_mod_ver, arg_dstr_cstr(ds), slen_ds);
- #endif
- arg_dstr_destroy(ds);
- }
- static unsigned int hash_key(const void* key) {
- const char* str = (const char*)key;
- int c;
- unsigned int hash = 5381;
- while ((c = *str++) != 0)
- hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
- return hash;
- }
- static int equal_keys(const void* key1, const void* key2) {
- char* k1 = (char*)key1;
- char* k2 = (char*)key2;
- return (0 == strcmp(k1, k2));
- }
- void arg_cmd_init(void) {
- s_hashtable = arg_hashtable_create(32, hash_key, equal_keys);
- }
- void arg_cmd_uninit(void) {
- arg_hashtable_destroy(s_hashtable, 1);
- }
- void arg_cmd_register(const char* name, arg_cmdfn* proc, const char* description) {
- arg_cmd_info_t* cmd_info;
- size_t slen_name;
- void* k;
- assert(strlen(name) < ARG_CMD_NAME_LEN);
- assert(strlen(description) < ARG_CMD_DESCRIPTION_LEN);
- /* Check if the command already exists. */
- /* If the command exists, replace the existing command. */
- /* If the command doesn't exist, insert the command. */
- cmd_info = (arg_cmd_info_t*)arg_hashtable_search(s_hashtable, name);
- if (cmd_info) {
- arg_hashtable_remove(s_hashtable, name);
- cmd_info = NULL;
- }
- cmd_info = (arg_cmd_info_t*)xmalloc(sizeof(arg_cmd_info_t));
- memset(cmd_info, 0, sizeof(arg_cmd_info_t));
- #if (defined(__STDC_LIB_EXT1__) && defined(__STDC_WANT_LIB_EXT1__)) || (defined(__STDC_SECURE_LIB__) && defined(__STDC_WANT_SECURE_LIB__))
- strncpy_s(cmd_info->name, ARG_CMD_NAME_LEN, name, strlen(name));
- strncpy_s(cmd_info->description, ARG_CMD_DESCRIPTION_LEN, description, strlen(description));
- #else
- memcpy(cmd_info->name, name, strlen(name));
- memcpy(cmd_info->description, description, strlen(description));
- #endif
- cmd_info->proc = proc;
- slen_name = strlen(name);
- k = xmalloc(slen_name + 1);
- memset(k, 0, slen_name + 1);
- #if (defined(__STDC_LIB_EXT1__) && defined(__STDC_WANT_LIB_EXT1__)) || (defined(__STDC_SECURE_LIB__) && defined(__STDC_WANT_SECURE_LIB__))
- strncpy_s((char*)k, slen_name + 1, name, slen_name);
- #else
- memcpy((char*)k, name, slen_name);
- #endif
- arg_hashtable_insert(s_hashtable, k, cmd_info);
- }
- void arg_cmd_unregister(const char* name) {
- arg_hashtable_remove(s_hashtable, name);
- }
- int arg_cmd_dispatch(const char* name, int argc, char* argv[], arg_dstr_t res) {
- arg_cmd_info_t* cmd_info = arg_cmd_info(name);
- assert(cmd_info != NULL);
- assert(cmd_info->proc != NULL);
- return cmd_info->proc(argc, argv, res);
- }
- arg_cmd_info_t* arg_cmd_info(const char* name) {
- return (arg_cmd_info_t*)arg_hashtable_search(s_hashtable, name);
- }
- unsigned int arg_cmd_count(void) {
- return arg_hashtable_count(s_hashtable);
- }
- arg_cmd_itr_t arg_cmd_itr_create(void) {
- return (arg_cmd_itr_t)arg_hashtable_itr_create(s_hashtable);
- }
- int arg_cmd_itr_advance(arg_cmd_itr_t itr) {
- return arg_hashtable_itr_advance((arg_hashtable_itr_t*)itr);
- }
- char* arg_cmd_itr_key(arg_cmd_itr_t itr) {
- return (char*)arg_hashtable_itr_key((arg_hashtable_itr_t*)itr);
- }
- arg_cmd_info_t* arg_cmd_itr_value(arg_cmd_itr_t itr) {
- return (arg_cmd_info_t*)arg_hashtable_itr_value((arg_hashtable_itr_t*)itr);
- }
- void arg_cmd_itr_destroy(arg_cmd_itr_t itr) {
- arg_hashtable_itr_destroy((arg_hashtable_itr_t*)itr);
- }
- int arg_cmd_itr_search(arg_cmd_itr_t itr, void* k) {
- return arg_hashtable_itr_search((arg_hashtable_itr_t*)itr, s_hashtable, k);
- }
- static const char* module_name(void) {
- if (s_module_name == NULL || strlen(s_module_name) == 0)
- return "<name>";
- return s_module_name;
- }
- static const char* module_version(void) {
- if (s_mod_ver == NULL || strlen(s_mod_ver) == 0)
- return "0.0.0.0";
- return s_mod_ver;
- }
- void arg_make_get_help_msg(arg_dstr_t res) {
- arg_dstr_catf(res, "%s v%s\n", module_name(), module_version());
- arg_dstr_catf(res, "Please type '%s help' to get more information.\n", module_name());
- }
- void arg_make_help_msg(arg_dstr_t ds, char* cmd_name, void** argtable) {
- arg_cmd_info_t* cmd_info = (arg_cmd_info_t*)arg_hashtable_search(s_hashtable, cmd_name);
- if (cmd_info) {
- arg_dstr_catf(ds, "%s: %s\n", cmd_name, cmd_info->description);
- }
- arg_dstr_cat(ds, "Usage:\n");
- arg_dstr_catf(ds, " %s", module_name());
- arg_print_syntaxv_ds(ds, argtable, "\n \nAvailable options:\n");
- arg_print_glossary_ds(ds, argtable, " %-23s %s\n");
- arg_dstr_cat(ds, "\n");
- }
- void arg_make_syntax_err_msg(arg_dstr_t ds, void** argtable, struct arg_end* end) {
- arg_print_errors_ds(ds, end, module_name());
- arg_dstr_cat(ds, "Usage: \n");
- arg_dstr_catf(ds, " %s", module_name());
- arg_print_syntaxv_ds(ds, argtable, "\n");
- arg_dstr_cat(ds, "\n");
- }
- int arg_make_syntax_err_help_msg(arg_dstr_t ds, char* name, int help, int nerrors, void** argtable, struct arg_end* end, int* exitcode) {
- /* help handling
- * note: '-h|--help' takes precedence over error reporting
- */
- if (help > 0) {
- arg_make_help_msg(ds, name, argtable);
- *exitcode = EXIT_SUCCESS;
- return 1;
- }
- /* syntax error handling */
- if (nerrors > 0) {
- arg_make_syntax_err_msg(ds, argtable, end);
- *exitcode = EXIT_FAILURE;
- return 1;
- }
- return 0;
- }
- /*******************************************************************************
- * argtable3: Implements the main interfaces of the library
- *
- * This file is part of the argtable3 library.
- *
- * Copyright (C) 1998-2001,2003-2011,2013 Stewart Heitmann
- * <sheitmann@users.sourceforge.net>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the name of STEWART HEITMANN nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL STEWART HEITMANN BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- ******************************************************************************/
- #include "argtable3.h"
- #ifndef ARG_AMALGAMATION
- #include "argtable3_private.h"
- #include "getopt.h"
- #endif
- #ifdef _WIN32
- #define WIN32_LEAN_AND_MEAN
- #include <windows.h>
- #undef WIN32_LEAN_AND_MEAN
- #endif
- #include <assert.h>
- #include <ctype.h>
- #include <limits.h>
- #include <stdlib.h>
- #include <string.h>
- static void arg_register_error(struct arg_end* end, void* parent, int error, const char* argval) {
- /* printf("arg_register_error(%p,%p,%d,%s)\n",end,parent,error,argval); */
- if (end->count < end->hdr.maxcount) {
- end->error[end->count] = error;
- end->parent[end->count] = parent;
- end->argval[end->count] = argval;
- end->count++;
- } else {
- end->error[end->hdr.maxcount - 1] = ARG_ELIMIT;
- end->parent[end->hdr.maxcount - 1] = end;
- end->argval[end->hdr.maxcount - 1] = NULL;
- }
- }
- /*
- * Return index of first table entry with a matching short option
- * or -1 if no match was found.
- */
- static int find_shortoption(struct arg_hdr** table, char shortopt) {
- int tabindex;
- for (tabindex = 0; !(table[tabindex]->flag & ARG_TERMINATOR); tabindex++) {
- if (table[tabindex]->shortopts && strchr(table[tabindex]->shortopts, shortopt))
- return tabindex;
- }
- return -1;
- }
- struct longoptions {
- int getoptval;
- int noptions;
- struct option* options;
- };
- #if 0
- static
- void dump_longoptions(struct longoptions * longoptions)
- {
- int i;
- printf("getoptval = %d\n", longoptions->getoptval);
- printf("noptions = %d\n", longoptions->noptions);
- for (i = 0; i < longoptions->noptions; i++)
- {
- printf("options[%d].name = \"%s\"\n",
- i,
- longoptions->options[i].name);
- printf("options[%d].has_arg = %d\n", i, longoptions->options[i].has_arg);
- printf("options[%d].flag = %p\n", i, longoptions->options[i].flag);
- printf("options[%d].val = %d\n", i, longoptions->options[i].val);
- }
- }
- #endif
- static struct longoptions* alloc_longoptions(struct arg_hdr** table) {
- struct longoptions* result;
- size_t nbytes;
- int noptions = 1;
- size_t longoptlen = 0;
- int tabindex;
- int option_index = 0;
- char* store;
- /*
- * Determine the total number of option structs required
- * by counting the number of comma separated long options
- * in all table entries and return the count in noptions.
- * note: noptions starts at 1 not 0 because we getoptlong
- * requires a NULL option entry to terminate the option array.
- * While we are at it, count the number of chars required
- * to store private copies of all the longoption strings
- * and return that count in logoptlen.
- */
- tabindex = 0;
- do {
- const char* longopts = table[tabindex]->longopts;
- longoptlen += (longopts ? strlen(longopts) : 0) + 1;
- while (longopts) {
- noptions++;
- longopts = strchr(longopts + 1, ',');
- }
- } while (!(table[tabindex++]->flag & ARG_TERMINATOR));
- /*printf("%d long options consuming %d chars in total\n",noptions,longoptlen);*/
- /* allocate storage for return data structure as: */
- /* (struct longoptions) + (struct options)[noptions] + char[longoptlen] */
- nbytes = sizeof(struct longoptions) + sizeof(struct option) * noptions + longoptlen;
- result = (struct longoptions*)xmalloc(nbytes);
- result->getoptval = 0;
- result->noptions = noptions;
- result->options = (struct option*)(result + 1);
- store = (char*)(result->options + noptions);
- for (tabindex = 0; !(table[tabindex]->flag & ARG_TERMINATOR); tabindex++) {
- const char* longopts = table[tabindex]->longopts;
- while (longopts && *longopts) {
- char* storestart = store;
- /* copy progressive longopt strings into the store */
- while (*longopts != 0 && *longopts != ',')
- *store++ = *longopts++;
- *store++ = 0;
- if (*longopts == ',')
- longopts++;
- /*fprintf(stderr,"storestart=\"%s\"\n",storestart);*/
- result->options[option_index].name = storestart;
- result->options[option_index].flag = &(result->getoptval);
- result->options[option_index].val = tabindex;
- if (table[tabindex]->flag & ARG_HASOPTVALUE)
- result->options[option_index].has_arg = 2;
- else if (table[tabindex]->flag & ARG_HASVALUE)
- result->options[option_index].has_arg = 1;
- else
- result->options[option_index].has_arg = 0;
- option_index++;
- }
- }
- /* terminate the options array with a zero-filled entry */
- result->options[option_index].name = 0;
- result->options[option_index].has_arg = 0;
- result->options[option_index].flag = 0;
- result->options[option_index].val = 0;
- /*dump_longoptions(result);*/
- return result;
- }
- static char* alloc_shortoptions(struct arg_hdr** table) {
- char* result;
- size_t len = 2;
- int tabindex;
- char* res;
- /* determine the total number of option chars required */
- for (tabindex = 0; !(table[tabindex]->flag & ARG_TERMINATOR); tabindex++) {
- struct arg_hdr* hdr = table[tabindex];
- len += 3 * (hdr->shortopts ? strlen(hdr->shortopts) : 0);
- }
- result = xmalloc(len);
- res = result;
- /* add a leading ':' so getopt return codes distinguish */
- /* unrecognised option and options missing argument values */
- *res++ = ':';
- for (tabindex = 0; !(table[tabindex]->flag & ARG_TERMINATOR); tabindex++) {
- struct arg_hdr* hdr = table[tabindex];
- const char* shortopts = hdr->shortopts;
- while (shortopts && *shortopts) {
- *res++ = *shortopts++;
- if (hdr->flag & ARG_HASVALUE)
- *res++ = ':';
- if (hdr->flag & ARG_HASOPTVALUE)
- *res++ = ':';
- }
- }
- /* null terminate the string */
- *res = 0;
- /*printf("alloc_shortoptions() returns \"%s\"\n",(result?result:"NULL"));*/
- return result;
- }
- /* return index of the table terminator entry */
- static int arg_endindex(struct arg_hdr** table) {
- int tabindex = 0;
- while (!(table[tabindex]->flag & ARG_TERMINATOR))
- tabindex++;
- return tabindex;
- }
- static void arg_parse_tagged(int argc, char** argv, struct arg_hdr** table, struct arg_end* endtable) {
- struct longoptions* longoptions;
- char* shortoptions;
- int copt;
- /*printf("arg_parse_tagged(%d,%p,%p,%p)\n",argc,argv,table,endtable);*/
- /* allocate short and long option arrays for the given opttable[]. */
- /* if the allocs fail then put an error msg in the last table entry. */
- longoptions = alloc_longoptions(table);
- shortoptions = alloc_shortoptions(table);
- /*dump_longoptions(longoptions);*/
- /* reset getopts internal option-index to zero, and disable error reporting */
- optind = 0;
- opterr = 0;
- /* fetch and process args using getopt_long */
- while ((copt = getopt_long(argc, argv, shortoptions, longoptions->options, NULL)) != -1) {
- /*
- printf("optarg='%s'\n",optarg);
- printf("optind=%d\n",optind);
- printf("copt=%c\n",(char)copt);
- printf("optopt=%c (%d)\n",optopt, (int)(optopt));
- */
- switch (copt) {
- case 0: {
- int tabindex = longoptions->getoptval;
- void* parent = table[tabindex]->parent;
- /*printf("long option detected from argtable[%d]\n", tabindex);*/
- if (optarg && optarg[0] == 0 && (table[tabindex]->flag & ARG_HASVALUE)) {
- /* printf(": long option %s requires an argument\n",argv[optind-1]); */
- arg_register_error(endtable, endtable, ARG_EMISSARG, argv[optind - 1]);
- /* continue to scan the (empty) argument value to enforce argument count checking */
- }
- if (table[tabindex]->scanfn) {
- int errorcode = table[tabindex]->scanfn(parent, optarg);
- if (errorcode != 0)
- arg_register_error(endtable, parent, errorcode, optarg);
- }
- } break;
- case '?':
- /*
- * getopt_long() found an unrecognised short option.
- * if it was a short option its value is in optopt
- * if it was a long option then optopt=0
- */
- switch (optopt) {
- case 0:
- /*printf("?0 unrecognised long option %s\n",argv[optind-1]);*/
- arg_register_error(endtable, endtable, ARG_ELONGOPT, argv[optind - 1]);
- break;
- default:
- /*printf("?* unrecognised short option '%c'\n",optopt);*/
- arg_register_error(endtable, endtable, optopt, NULL);
- break;
- }
- break;
- case ':':
- /*
- * getopt_long() found an option with its argument missing.
- */
- /*printf(": option %s requires an argument\n",argv[optind-1]); */
- arg_register_error(endtable, endtable, ARG_EMISSARG, argv[optind - 1]);
- break;
- default: {
- /* getopt_long() found a valid short option */
- int tabindex = find_shortoption(table, (char)copt);
- /*printf("short option detected from argtable[%d]\n", tabindex);*/
- if (tabindex == -1) {
- /* should never get here - but handle it just in case */
- /*printf("unrecognised short option %d\n",copt);*/
- arg_register_error(endtable, endtable, copt, NULL);
- } else {
- if (table[tabindex]->scanfn) {
- void* parent = table[tabindex]->parent;
- int errorcode = table[tabindex]->scanfn(parent, optarg);
- if (errorcode != 0)
- arg_register_error(endtable, parent, errorcode, optarg);
- }
- }
- break;
- }
- }
- }
- xfree(shortoptions);
- xfree(longoptions);
- }
- static void arg_parse_untagged(int argc, char** argv, struct arg_hdr** table, struct arg_end* endtable) {
- int tabindex = 0;
- int errorlast = 0;
- const char* optarglast = NULL;
- void* parentlast = NULL;
- /*printf("arg_parse_untagged(%d,%p,%p,%p)\n",argc,argv,table,endtable);*/
- while (!(table[tabindex]->flag & ARG_TERMINATOR)) {
- void* parent;
- int errorcode;
- /* if we have exhausted our argv[optind] entries then we have finished */
- if (optind >= argc) {
- /*printf("arg_parse_untagged(): argv[] exhausted\n");*/
- return;
- }
- /* skip table entries with non-null long or short options (they are not untagged entries) */
- if (table[tabindex]->longopts || table[tabindex]->shortopts) {
- /*printf("arg_parse_untagged(): skipping argtable[%d] (tagged argument)\n",tabindex);*/
- tabindex++;
- continue;
- }
- /* skip table entries with NULL scanfn */
- if (!(table[tabindex]->scanfn)) {
- /*printf("arg_parse_untagged(): skipping argtable[%d] (NULL scanfn)\n",tabindex);*/
- tabindex++;
- continue;
- }
- /* attempt to scan the current argv[optind] with the current */
- /* table[tabindex] entry. If it succeeds then keep it, otherwise */
- /* try again with the next table[] entry. */
- parent = table[tabindex]->parent;
- errorcode = table[tabindex]->scanfn(parent, argv[optind]);
- if (errorcode == 0) {
- /* success, move onto next argv[optind] but stay with same table[tabindex] */
- /*printf("arg_parse_untagged(): argtable[%d] successfully matched\n",tabindex);*/
- optind++;
- /* clear the last tentative error */
- errorlast = 0;
- } else {
- /* failure, try same argv[optind] with next table[tabindex] entry */
- /*printf("arg_parse_untagged(): argtable[%d] failed match\n",tabindex);*/
- tabindex++;
- /* remember this as a tentative error we may wish to reinstate later */
- errorlast = errorcode;
- optarglast = argv[optind];
- parentlast = parent;
- }
- }
- /* if a tenative error still remains at this point then register it as a proper error */
- if (errorlast) {
- arg_register_error(endtable, parentlast, errorlast, optarglast);
- optind++;
- }
- /* only get here when not all argv[] entries were consumed */
- /* register an error for each unused argv[] entry */
- while (optind < argc) {
- /*printf("arg_parse_untagged(): argv[%d]=\"%s\" not consumed\n",optind,argv[optind]);*/
- arg_register_error(endtable, endtable, ARG_ENOMATCH, argv[optind++]);
- }
- return;
- }
- static void arg_parse_check(struct arg_hdr** table, struct arg_end* endtable) {
- int tabindex = 0;
- /* printf("arg_parse_check()\n"); */
- do {
- if (table[tabindex]->checkfn) {
- void* parent = table[tabindex]->parent;
- int errorcode = table[tabindex]->checkfn(parent);
- if (errorcode != 0)
- arg_register_error(endtable, parent, errorcode, NULL);
- }
- } while (!(table[tabindex++]->flag & ARG_TERMINATOR));
- }
- static void arg_reset(void** argtable) {
- struct arg_hdr** table = (struct arg_hdr**)argtable;
- int tabindex = 0;
- /*printf("arg_reset(%p)\n",argtable);*/
- do {
- if (table[tabindex]->resetfn)
- table[tabindex]->resetfn(table[tabindex]->parent);
- } while (!(table[tabindex++]->flag & ARG_TERMINATOR));
- }
- int arg_parse(int argc, char** argv, void** argtable) {
- struct arg_hdr** table = (struct arg_hdr**)argtable;
- struct arg_end* endtable;
- int endindex;
- char** argvcopy = NULL;
- int i;
- /*printf("arg_parse(%d,%p,%p)\n",argc,argv,argtable);*/
- /* reset any argtable data from previous invocations */
- arg_reset(argtable);
- /* locate the first end-of-table marker within the array */
- endindex = arg_endindex(table);
- endtable = (struct arg_end*)table[endindex];
- /* Special case of argc==0. This can occur on Texas Instruments DSP. */
- /* Failure to trap this case results in an unwanted NULL result from */
- /* the malloc for argvcopy (next code block). */
- if (argc == 0) {
- /* We must still perform post-parse checks despite the absence of command line arguments */
- arg_parse_check(table, endtable);
- /* Now we are finished */
- return endtable->count;
- }
- argvcopy = (char**)xmalloc(sizeof(char*) * (argc + 1));
- /*
- Fill in the local copy of argv[]. We need a local copy
- because getopt rearranges argv[] which adversely affects
- susbsequent parsing attempts.
- */
- for (i = 0; i < argc; i++)
- argvcopy[i] = argv[i];
- argvcopy[argc] = NULL;
- /* parse the command line (local copy) for tagged options */
- arg_parse_tagged(argc, argvcopy, table, endtable);
- /* parse the command line (local copy) for untagged options */
- arg_parse_untagged(argc, argvcopy, table, endtable);
- /* if no errors so far then perform post-parse checks otherwise dont bother */
- if (endtable->count == 0)
- arg_parse_check(table, endtable);
- /* release the local copt of argv[] */
- xfree(argvcopy);
- return endtable->count;
- }
- /*
- * Concatenate contents of src[] string onto *pdest[] string.
- * The *pdest pointer is altered to point to the end of the
- * target string and *pndest is decremented by the same number
- * of chars.
- * Does not append more than *pndest chars into *pdest[]
- * so as to prevent buffer overruns.
- * Its something like strncat() but more efficient for repeated
- * calls on the same destination string.
- * Example of use:
- * char dest[30] = "good"
- * size_t ndest = sizeof(dest);
- * char *pdest = dest;
- * arg_char(&pdest,"bye ",&ndest);
- * arg_char(&pdest,"cruel ",&ndest);
- * arg_char(&pdest,"world!",&ndest);
- * Results in:
- * dest[] == "goodbye cruel world!"
- * ndest == 10
- */
- static void arg_cat(char** pdest, const char* src, size_t* pndest) {
- char* dest = *pdest;
- char* end = dest + *pndest;
- /*locate null terminator of dest string */
- while (dest < end && *dest != 0)
- dest++;
- /* concat src string to dest string */
- while (dest < end && *src != 0)
- *dest++ = *src++;
- /* null terminate dest string */
- *dest = 0;
- /* update *pdest and *pndest */
- *pndest = end - dest;
- *pdest = dest;
- }
- static void arg_cat_option(char* dest, size_t ndest, const char* shortopts, const char* longopts, const char* datatype, int optvalue) {
- if (shortopts) {
- char option[3];
- /* note: option array[] is initialiazed dynamically here to satisfy */
- /* a deficiency in the watcom compiler wrt static array initializers. */
- option[0] = '-';
- option[1] = shortopts[0];
- option[2] = 0;
- arg_cat(&dest, option, &ndest);
- if (datatype) {
- arg_cat(&dest, " ", &ndest);
- if (optvalue) {
- arg_cat(&dest, "[", &ndest);
- arg_cat(&dest, datatype, &ndest);
- arg_cat(&dest, "]", &ndest);
- } else
- arg_cat(&dest, datatype, &ndest);
- }
- } else if (longopts) {
- size_t ncspn;
- /* add "--" tag prefix */
- arg_cat(&dest, "--", &ndest);
- /* add comma separated option tag */
- ncspn = strcspn(longopts, ",");
- #if (defined(__STDC_LIB_EXT1__) && defined(__STDC_WANT_LIB_EXT1__)) || (defined(__STDC_SECURE_LIB__) && defined(__STDC_WANT_SECURE_LIB__))
- strncat_s(dest, ndest, longopts, (ncspn < ndest) ? ncspn : ndest);
- #else
- strncat(dest, longopts, (ncspn < ndest) ? ncspn : ndest);
- #endif
- if (datatype) {
- arg_cat(&dest, "=", &ndest);
- if (optvalue) {
- arg_cat(&dest, "[", &ndest);
- arg_cat(&dest, datatype, &ndest);
- arg_cat(&dest, "]", &ndest);
- } else
- arg_cat(&dest, datatype, &ndest);
- }
- } else if (datatype) {
- if (optvalue) {
- arg_cat(&dest, "[", &ndest);
- arg_cat(&dest, datatype, &ndest);
- arg_cat(&dest, "]", &ndest);
- } else
- arg_cat(&dest, datatype, &ndest);
- }
- }
- static void
- arg_cat_optionv(char* dest, size_t ndest, const char* shortopts, const char* longopts, const char* datatype, int optvalue, const char* separator) {
- separator = separator ? separator : "";
- if (shortopts) {
- const char* c = shortopts;
- while (*c) {
- /* "-a|-b|-c" */
- char shortopt[3];
- /* note: shortopt array[] is initialiazed dynamically here to satisfy */
- /* a deficiency in the watcom compiler wrt static array initializers. */
- shortopt[0] = '-';
- shortopt[1] = *c;
- shortopt[2] = 0;
- arg_cat(&dest, shortopt, &ndest);
- if (*++c)
- arg_cat(&dest, separator, &ndest);
- }
- }
- /* put separator between long opts and short opts */
- if (shortopts && longopts)
- arg_cat(&dest, separator, &ndest);
- if (longopts) {
- const char* c = longopts;
- while (*c) {
- size_t ncspn;
- /* add "--" tag prefix */
- arg_cat(&dest, "--", &ndest);
- /* add comma separated option tag */
- ncspn = strcspn(c, ",");
- #if (defined(__STDC_LIB_EXT1__) && defined(__STDC_WANT_LIB_EXT1__)) || (defined(__STDC_SECURE_LIB__) && defined(__STDC_WANT_SECURE_LIB__))
- strncat_s(dest, ndest, c, (ncspn < ndest) ? ncspn : ndest);
- #else
- strncat(dest, c, (ncspn < ndest) ? ncspn : ndest);
- #endif
- c += ncspn;
- /* add given separator in place of comma */
- if (*c == ',') {
- arg_cat(&dest, separator, &ndest);
- c++;
- }
- }
- }
- if (datatype) {
- if (longopts)
- arg_cat(&dest, "=", &ndest);
- else if (shortopts)
- arg_cat(&dest, " ", &ndest);
- if (optvalue) {
- arg_cat(&dest, "[", &ndest);
- arg_cat(&dest, datatype, &ndest);
- arg_cat(&dest, "]", &ndest);
- } else
- arg_cat(&dest, datatype, &ndest);
- }
- }
- void arg_print_option_ds(arg_dstr_t ds, const char* shortopts, const char* longopts, const char* datatype, const char* suffix) {
- char syntax[200] = "";
- suffix = suffix ? suffix : "";
- /* there is no way of passing the proper optvalue for optional argument values here, so we must ignore it */
- arg_cat_optionv(syntax, sizeof(syntax), shortopts, longopts, datatype, 0, "|");
- arg_dstr_cat(ds, syntax);
- arg_dstr_cat(ds, (char*)suffix);
- }
- /* this function should be deprecated because it doesn't consider optional argument values (ARG_HASOPTVALUE) */
- void arg_print_option(FILE* fp, const char* shortopts, const char* longopts, const char* datatype, const char* suffix) {
- arg_dstr_t ds = arg_dstr_create();
- arg_print_option_ds(ds, shortopts, longopts, datatype, suffix);
- fputs(arg_dstr_cstr(ds), fp);
- arg_dstr_destroy(ds);
- }
- /*
- * Print a GNU style [OPTION] string in which all short options that
- * do not take argument values are presented in abbreviated form, as
- * in: -xvfsd, or -xvf[sd], or [-xvsfd]
- */
- static void arg_print_gnuswitch_ds(arg_dstr_t ds, struct arg_hdr** table) {
- int tabindex;
- char* format1 = " -%c";
- char* format2 = " [-%c";
- char* suffix = "";
- /* print all mandatory switches that are without argument values */
- for (tabindex = 0; table[tabindex] && !(table[tabindex]->flag & ARG_TERMINATOR); tabindex++) {
- /* skip optional options */
- if (table[tabindex]->mincount < 1)
- continue;
- /* skip non-short options */
- if (table[tabindex]->shortopts == NULL)
- continue;
- /* skip options that take argument values */
- if (table[tabindex]->flag & ARG_HASVALUE)
- continue;
- /* print the short option (only the first short option char, ignore multiple choices)*/
- arg_dstr_catf(ds, format1, table[tabindex]->shortopts[0]);
- format1 = "%c";
- format2 = "[%c";
- }
- /* print all optional switches that are without argument values */
- for (tabindex = 0; table[tabindex] && !(table[tabindex]->flag & ARG_TERMINATOR); tabindex++) {
- /* skip mandatory args */
- if (table[tabindex]->mincount > 0)
- continue;
- /* skip args without short options */
- if (table[tabindex]->shortopts == NULL)
- continue;
- /* skip args with values */
- if (table[tabindex]->flag & ARG_HASVALUE)
- continue;
- /* print first short option */
- arg_dstr_catf(ds, format2, table[tabindex]->shortopts[0]);
- format2 = "%c";
- suffix = "]";
- }
- arg_dstr_catf(ds, "%s", suffix);
- }
- void arg_print_syntax_ds(arg_dstr_t ds, void** argtable, const char* suffix) {
- struct arg_hdr** table = (struct arg_hdr**)argtable;
- int i, tabindex;
- /* print GNU style [OPTION] string */
- arg_print_gnuswitch_ds(ds, table);
- /* print remaining options in abbreviated style */
- for (tabindex = 0; table[tabindex] && !(table[tabindex]->flag & ARG_TERMINATOR); tabindex++) {
- char syntax[200] = "";
- const char *shortopts, *longopts, *datatype;
- /* skip short options without arg values (they were printed by arg_print_gnu_switch) */
- if (table[tabindex]->shortopts && !(table[tabindex]->flag & ARG_HASVALUE))
- continue;
- shortopts = table[tabindex]->shortopts;
- longopts = table[tabindex]->longopts;
- datatype = table[tabindex]->datatype;
- arg_cat_option(syntax, sizeof(syntax), shortopts, longopts, datatype, table[tabindex]->flag & ARG_HASOPTVALUE);
- if (strlen(syntax) > 0) {
- /* print mandatory instances of this option */
- for (i = 0; i < table[tabindex]->mincount; i++) {
- arg_dstr_cat(ds, " ");
- arg_dstr_cat(ds, syntax);
- }
- /* print optional instances enclosed in "[..]" */
- switch (table[tabindex]->maxcount - table[tabindex]->mincount) {
- case 0:
- break;
- case 1:
- arg_dstr_cat(ds, " [");
- arg_dstr_cat(ds, syntax);
- arg_dstr_cat(ds, "]");
- break;
- case 2:
- arg_dstr_cat(ds, " [");
- arg_dstr_cat(ds, syntax);
- arg_dstr_cat(ds, "]");
- arg_dstr_cat(ds, " [");
- arg_dstr_cat(ds, syntax);
- arg_dstr_cat(ds, "]");
- break;
- default:
- arg_dstr_cat(ds, " [");
- arg_dstr_cat(ds, syntax);
- arg_dstr_cat(ds, "]...");
- break;
- }
- }
- }
- if (suffix) {
- arg_dstr_cat(ds, (char*)suffix);
- }
- }
- void arg_print_syntax(FILE* fp, void** argtable, const char* suffix) {
- arg_dstr_t ds = arg_dstr_create();
- arg_print_syntax_ds(ds, argtable, suffix);
- fputs(arg_dstr_cstr(ds), fp);
- arg_dstr_destroy(ds);
- }
- void arg_print_syntaxv_ds(arg_dstr_t ds, void** argtable, const char* suffix) {
- struct arg_hdr** table = (struct arg_hdr**)argtable;
- int i, tabindex;
- /* print remaining options in abbreviated style */
- for (tabindex = 0; table[tabindex] && !(table[tabindex]->flag & ARG_TERMINATOR); tabindex++) {
- char syntax[200] = "";
- const char *shortopts, *longopts, *datatype;
- shortopts = table[tabindex]->shortopts;
- longopts = table[tabindex]->longopts;
- datatype = table[tabindex]->datatype;
- arg_cat_optionv(syntax, sizeof(syntax), shortopts, longopts, datatype, table[tabindex]->flag & ARG_HASOPTVALUE, "|");
- /* print mandatory options */
- for (i = 0; i < table[tabindex]->mincount; i++) {
- arg_dstr_cat(ds, " ");
- arg_dstr_cat(ds, syntax);
- }
- /* print optional args enclosed in "[..]" */
- switch (table[tabindex]->maxcount - table[tabindex]->mincount) {
- case 0:
- break;
- case 1:
- arg_dstr_cat(ds, " [");
- arg_dstr_cat(ds, syntax);
- arg_dstr_cat(ds, "]");
- break;
- case 2:
- arg_dstr_cat(ds, " [");
- arg_dstr_cat(ds, syntax);
- arg_dstr_cat(ds, "]");
- arg_dstr_cat(ds, " [");
- arg_dstr_cat(ds, syntax);
- arg_dstr_cat(ds, "]");
- break;
- default:
- arg_dstr_cat(ds, " [");
- arg_dstr_cat(ds, syntax);
- arg_dstr_cat(ds, "]...");
- break;
- }
- }
- if (suffix) {
- arg_dstr_cat(ds, (char*)suffix);
- }
- }
- void arg_print_syntaxv(FILE* fp, void** argtable, const char* suffix) {
- arg_dstr_t ds = arg_dstr_create();
- arg_print_syntaxv_ds(ds, argtable, suffix);
- fputs(arg_dstr_cstr(ds), fp);
- arg_dstr_destroy(ds);
- }
- void arg_print_glossary_ds(arg_dstr_t ds, void** argtable, const char* format) {
- struct arg_hdr** table = (struct arg_hdr**)argtable;
- int tabindex;
- format = format ? format : " %-20s %s\n";
- for (tabindex = 0; !(table[tabindex]->flag & ARG_TERMINATOR); tabindex++) {
- if (table[tabindex]->glossary) {
- char syntax[200] = "";
- const char* shortopts = table[tabindex]->shortopts;
- const char* longopts = table[tabindex]->longopts;
- const char* datatype = table[tabindex]->datatype;
- const char* glossary = table[tabindex]->glossary;
- arg_cat_optionv(syntax, sizeof(syntax), shortopts, longopts, datatype, table[tabindex]->flag & ARG_HASOPTVALUE, ", ");
- arg_dstr_catf(ds, format, syntax, glossary);
- }
- }
- }
- void arg_print_glossary(FILE* fp, void** argtable, const char* format) {
- arg_dstr_t ds = arg_dstr_create();
- arg_print_glossary_ds(ds, argtable, format);
- fputs(arg_dstr_cstr(ds), fp);
- arg_dstr_destroy(ds);
- }
- /**
- * Print a piece of text formatted, which means in a column with a
- * left and a right margin. The lines are wrapped at whitspaces next
- * to right margin. The function does not indent the first line, but
- * only the following ones.
- *
- * Example:
- * arg_print_formatted( fp, 0, 5, "Some text that doesn't fit." )
- * will result in the following output:
- *
- * Some
- * text
- * that
- * doesn'
- * t fit.
- *
- * Too long lines will be wrapped in the middle of a word.
- *
- * arg_print_formatted( fp, 2, 7, "Some text that doesn't fit." )
- * will result in the following output:
- *
- * Some
- * text
- * that
- * doesn'
- * t fit.
- *
- * As you see, the first line is not indented. This enables output of
- * lines, which start in a line where output already happened.
- *
- * Author: Uli Fouquet
- */
- static void arg_print_formatted_ds(arg_dstr_t ds, const unsigned lmargin, const unsigned rmargin, const char* text) {
- const unsigned int textlen = (unsigned int)strlen(text);
- unsigned int line_start = 0;
- unsigned int line_end = textlen;
- const unsigned int colwidth = (rmargin - lmargin) + 1;
- assert(strlen(text) < UINT_MAX);
- /* Someone doesn't like us... */
- if (line_end < line_start) {
- arg_dstr_catf(ds, "%s\n", text);
- }
- while (line_end > line_start) {
- /* Eat leading white spaces. This is essential because while
- wrapping lines, there will often be a whitespace at beginning
- of line */
- while (isspace(*(text + line_start))) {
- line_start++;
- }
- /* Find last whitespace, that fits into line */
- if (line_end - line_start > colwidth) {
- line_end = line_start + colwidth;
- while ((line_end > line_start) && !isspace(*(text + line_end))) {
- line_end--;
- }
- /* Consume trailing spaces */
- while ((line_end > line_start) && isspace(*(text + line_end))) {
- line_end--;
- }
- /* Restore the last non-space character */
- line_end++;
- }
- /* Output line of text */
- while (line_start < line_end) {
- char c = *(text + line_start);
- arg_dstr_catc(ds, c);
- line_start++;
- }
- arg_dstr_cat(ds, "\n");
- /* Initialize another line */
- if (line_end < textlen) {
- unsigned i;
- for (i = 0; i < lmargin; i++) {
- arg_dstr_cat(ds, " ");
- }
- line_end = textlen;
- }
- } /* lines of text */
- }
- /**
- * Prints the glossary in strict GNU format.
- * Differences to arg_print_glossary() are:
- * - wraps lines after 80 chars
- * - indents lines without shortops
- * - does not accept formatstrings
- *
- * Contributed by Uli Fouquet
- */
- void arg_print_glossary_gnu_ds(arg_dstr_t ds, void** argtable) {
- struct arg_hdr** table = (struct arg_hdr**)argtable;
- int tabindex;
- for (tabindex = 0; !(table[tabindex]->flag & ARG_TERMINATOR); tabindex++) {
- if (table[tabindex]->glossary) {
- char syntax[200] = "";
- const char* shortopts = table[tabindex]->shortopts;
- const char* longopts = table[tabindex]->longopts;
- const char* datatype = table[tabindex]->datatype;
- const char* glossary = table[tabindex]->glossary;
- if (!shortopts && longopts) {
- /* Indent trailing line by 4 spaces... */
- memset(syntax, ' ', 4);
- *(syntax + 4) = '\0';
- }
- arg_cat_optionv(syntax, sizeof(syntax), shortopts, longopts, datatype, table[tabindex]->flag & ARG_HASOPTVALUE, ", ");
- /* If syntax fits not into column, print glossary in new line... */
- if (strlen(syntax) > 25) {
- arg_dstr_catf(ds, " %-25s %s\n", syntax, "");
- *syntax = '\0';
- }
- arg_dstr_catf(ds, " %-25s ", syntax);
- arg_print_formatted_ds(ds, 28, 79, glossary);
- }
- } /* for each table entry */
- arg_dstr_cat(ds, "\n");
- }
- void arg_print_glossary_gnu(FILE* fp, void** argtable) {
- arg_dstr_t ds = arg_dstr_create();
- arg_print_glossary_gnu_ds(ds, argtable);
- fputs(arg_dstr_cstr(ds), fp);
- arg_dstr_destroy(ds);
- }
- /**
- * Checks the argtable[] array for NULL entries and returns 1
- * if any are found, zero otherwise.
- */
- int arg_nullcheck(void** argtable) {
- struct arg_hdr** table = (struct arg_hdr**)argtable;
- int tabindex;
- /*printf("arg_nullcheck(%p)\n",argtable);*/
- if (!table)
- return 1;
- tabindex = 0;
- do {
- /*printf("argtable[%d]=%p\n",tabindex,argtable[tabindex]);*/
- if (!table[tabindex])
- return 1;
- } while (!(table[tabindex++]->flag & ARG_TERMINATOR));
- return 0;
- }
- /*
- * arg_free() is deprecated in favour of arg_freetable() due to a flaw in its design.
- * The flaw results in memory leak in the (very rare) case that an intermediate
- * entry in the argtable array failed its memory allocation while others following
- * that entry were still allocated ok. Those subsequent allocations will not be
- * deallocated by arg_free().
- * Despite the unlikeliness of the problem occurring, and the even unlikelier event
- * that it has any deliterious effect, it is fixed regardless by replacing arg_free()
- * with the newer arg_freetable() function.
- * We still keep arg_free() for backwards compatibility.
- */
- void arg_free(void** argtable) {
- struct arg_hdr** table = (struct arg_hdr**)argtable;
- int tabindex = 0;
- int flag;
- /*printf("arg_free(%p)\n",argtable);*/
- do {
- /*
- if we encounter a NULL entry then somewhat incorrectly we presume
- we have come to the end of the array. It isnt strictly true because
- an intermediate entry could be NULL with other non-NULL entries to follow.
- The subsequent argtable entries would then not be freed as they should.
- */
- if (table[tabindex] == NULL)
- break;
- flag = table[tabindex]->flag;
- xfree(table[tabindex]);
- table[tabindex++] = NULL;
- } while (!(flag & ARG_TERMINATOR));
- }
- /* frees each non-NULL element of argtable[], where n is the size of the number of entries in the array */
- void arg_freetable(void** argtable, size_t n) {
- struct arg_hdr** table = (struct arg_hdr**)argtable;
- size_t tabindex = 0;
- /*printf("arg_freetable(%p)\n",argtable);*/
- for (tabindex = 0; tabindex < n; tabindex++) {
- if (table[tabindex] == NULL)
- continue;
- xfree(table[tabindex]);
- table[tabindex] = NULL;
- };
- }
- #ifdef _WIN32
- BOOL WINAPI DllMain(HINSTANCE hinstDLL, DWORD fdwReason, LPVOID lpvReserved) {
- return TRUE;
- UNREFERENCED_PARAMETER(hinstDLL);
- UNREFERENCED_PARAMETER(fdwReason);
- UNREFERENCED_PARAMETER(lpvReserved);
- }
- #endif
|