util.c 154 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529
  1. /* Copyright (c) 2003, Roger Dingledine
  2. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  3. * Copyright (c) 2007-2016, The Tor Project, Inc. */
  4. /* See LICENSE for licensing information */
  5. /**
  6. * \file util.c
  7. * \brief Common functions for strings, IO, network, data structures,
  8. * process control.
  9. **/
  10. /* This is required on rh7 to make strptime not complain.
  11. */
  12. #define _GNU_SOURCE
  13. #include "orconfig.h"
  14. #ifdef HAVE_FCNTL_H
  15. #include <fcntl.h>
  16. #endif
  17. #define UTIL_PRIVATE
  18. #include "util.h"
  19. #include "torlog.h"
  20. #include "crypto.h"
  21. #include "torint.h"
  22. #include "container.h"
  23. #include "address.h"
  24. #include "sandbox.h"
  25. #include "backtrace.h"
  26. #include "util_process.h"
  27. #include "util_format.h"
  28. #ifdef _WIN32
  29. #include <io.h>
  30. #include <direct.h>
  31. #include <process.h>
  32. #include <tchar.h>
  33. #include <winbase.h>
  34. #else
  35. #include <dirent.h>
  36. #include <pwd.h>
  37. #include <grp.h>
  38. #endif
  39. /* math.h needs this on Linux */
  40. #ifndef _USE_ISOC99_
  41. #define _USE_ISOC99_ 1
  42. #endif
  43. #include <math.h>
  44. #include <stdlib.h>
  45. #include <stdio.h>
  46. #include <string.h>
  47. #include <assert.h>
  48. #include <signal.h>
  49. #ifdef HAVE_NETINET_IN_H
  50. #include <netinet/in.h>
  51. #endif
  52. #ifdef HAVE_ARPA_INET_H
  53. #include <arpa/inet.h>
  54. #endif
  55. #ifdef HAVE_ERRNO_H
  56. #include <errno.h>
  57. #endif
  58. #ifdef HAVE_SYS_SOCKET_H
  59. #include <sys/socket.h>
  60. #endif
  61. #ifdef HAVE_SYS_TIME_H
  62. #include <sys/time.h>
  63. #endif
  64. #ifdef HAVE_UNISTD_H
  65. #include <unistd.h>
  66. #endif
  67. #ifdef HAVE_SYS_STAT_H
  68. #include <sys/stat.h>
  69. #endif
  70. #ifdef HAVE_SYS_FCNTL_H
  71. #include <sys/fcntl.h>
  72. #endif
  73. #ifdef HAVE_TIME_H
  74. #include <time.h>
  75. #endif
  76. #ifdef HAVE_MALLOC_MALLOC_H
  77. #include <malloc/malloc.h>
  78. #endif
  79. #ifdef HAVE_MALLOC_H
  80. #if !defined(OPENBSD) && !defined(__FreeBSD__)
  81. /* OpenBSD has a malloc.h, but for our purposes, it only exists in order to
  82. * scold us for being so stupid as to autodetect its presence. To be fair,
  83. * they've done this since 1996, when autoconf was only 5 years old. */
  84. #include <malloc.h>
  85. #endif
  86. #endif
  87. #ifdef HAVE_MALLOC_NP_H
  88. #include <malloc_np.h>
  89. #endif
  90. #ifdef HAVE_SYS_WAIT_H
  91. #include <sys/wait.h>
  92. #endif
  93. #if defined(HAVE_SYS_PRCTL_H) && defined(__linux__)
  94. #include <sys/prctl.h>
  95. #endif
  96. #ifdef __clang_analyzer__
  97. #undef MALLOC_ZERO_WORKS
  98. #endif
  99. /* =====
  100. * Assertion helper.
  101. * ===== */
  102. /** Helper for tor_assert: report the assertion failure. */
  103. void
  104. tor_assertion_failed_(const char *fname, unsigned int line,
  105. const char *func, const char *expr)
  106. {
  107. char buf[256];
  108. log_err(LD_BUG, "%s:%u: %s: Assertion %s failed; aborting.",
  109. fname, line, func, expr);
  110. tor_snprintf(buf, sizeof(buf),
  111. "Assertion %s failed in %s at %s:%u",
  112. expr, func, fname, line);
  113. log_backtrace(LOG_ERR, LD_BUG, buf);
  114. }
  115. /* =====
  116. * Memory management
  117. * ===== */
  118. #ifdef USE_DMALLOC
  119. #undef strndup
  120. #include <dmalloc.h>
  121. /* Macro to pass the extra dmalloc args to another function. */
  122. #define DMALLOC_FN_ARGS , file, line
  123. #if defined(HAVE_DMALLOC_STRDUP)
  124. /* the dmalloc_strdup should be fine as defined */
  125. #elif defined(HAVE_DMALLOC_STRNDUP)
  126. #define dmalloc_strdup(file, line, string, xalloc_b) \
  127. dmalloc_strndup(file, line, (string), -1, xalloc_b)
  128. #else
  129. #error "No dmalloc_strdup or equivalent"
  130. #endif
  131. #else /* not using dmalloc */
  132. #define DMALLOC_FN_ARGS
  133. #endif
  134. /** Allocate a chunk of <b>size</b> bytes of memory, and return a pointer to
  135. * result. On error, log and terminate the process. (Same as malloc(size),
  136. * but never returns NULL.)
  137. *
  138. * <b>file</b> and <b>line</b> are used if dmalloc is enabled, and
  139. * ignored otherwise.
  140. */
  141. void *
  142. tor_malloc_(size_t size DMALLOC_PARAMS)
  143. {
  144. void *result;
  145. tor_assert(size < SIZE_T_CEILING);
  146. #ifndef MALLOC_ZERO_WORKS
  147. /* Some libc mallocs don't work when size==0. Override them. */
  148. if (size==0) {
  149. size=1;
  150. }
  151. #endif
  152. #ifdef USE_DMALLOC
  153. result = dmalloc_malloc(file, line, size, DMALLOC_FUNC_MALLOC, 0, 0);
  154. #else
  155. result = malloc(size);
  156. #endif
  157. if (PREDICT_UNLIKELY(result == NULL)) {
  158. log_err(LD_MM,"Out of memory on malloc(). Dying.");
  159. /* If these functions die within a worker process, they won't call
  160. * spawn_exit, but that's ok, since the parent will run out of memory soon
  161. * anyway. */
  162. exit(1);
  163. }
  164. return result;
  165. }
  166. /** Allocate a chunk of <b>size</b> bytes of memory, fill the memory with
  167. * zero bytes, and return a pointer to the result. Log and terminate
  168. * the process on error. (Same as calloc(size,1), but never returns NULL.)
  169. */
  170. void *
  171. tor_malloc_zero_(size_t size DMALLOC_PARAMS)
  172. {
  173. /* You may ask yourself, "wouldn't it be smart to use calloc instead of
  174. * malloc+memset? Perhaps libc's calloc knows some nifty optimization trick
  175. * we don't!" Indeed it does, but its optimizations are only a big win when
  176. * we're allocating something very big (it knows if it just got the memory
  177. * from the OS in a pre-zeroed state). We don't want to use tor_malloc_zero
  178. * for big stuff, so we don't bother with calloc. */
  179. void *result = tor_malloc_(size DMALLOC_FN_ARGS);
  180. memset(result, 0, size);
  181. return result;
  182. }
  183. /* The square root of SIZE_MAX + 1. If a is less than this, and b is less
  184. * than this, then a*b is less than SIZE_MAX. (For example, if size_t is
  185. * 32 bits, then SIZE_MAX is 0xffffffff and this value is 0x10000. If a and
  186. * b are less than this, then their product is at most (65535*65535) ==
  187. * 0xfffe0001. */
  188. #define SQRT_SIZE_MAX_P1 (((size_t)1) << (sizeof(size_t)*4))
  189. /** Return non-zero if and only if the product of the arguments is exact. */
  190. static inline int
  191. size_mul_check(const size_t x, const size_t y)
  192. {
  193. /* This first check is equivalent to
  194. (x < SQRT_SIZE_MAX_P1 && y < SQRT_SIZE_MAX_P1)
  195. Rationale: if either one of x or y is >= SQRT_SIZE_MAX_P1, then it
  196. will have some bit set in its most significant half.
  197. */
  198. return ((x|y) < SQRT_SIZE_MAX_P1 ||
  199. y == 0 ||
  200. x <= SIZE_MAX / y);
  201. }
  202. /** Allocate a chunk of <b>nmemb</b>*<b>size</b> bytes of memory, fill
  203. * the memory with zero bytes, and return a pointer to the result.
  204. * Log and terminate the process on error. (Same as
  205. * calloc(<b>nmemb</b>,<b>size</b>), but never returns NULL.)
  206. * The second argument (<b>size</b>) should preferably be non-zero
  207. * and a compile-time constant.
  208. */
  209. void *
  210. tor_calloc_(size_t nmemb, size_t size DMALLOC_PARAMS)
  211. {
  212. tor_assert(size_mul_check(nmemb, size));
  213. return tor_malloc_zero_((nmemb * size) DMALLOC_FN_ARGS);
  214. }
  215. /** Change the size of the memory block pointed to by <b>ptr</b> to <b>size</b>
  216. * bytes long; return the new memory block. On error, log and
  217. * terminate. (Like realloc(ptr,size), but never returns NULL.)
  218. */
  219. void *
  220. tor_realloc_(void *ptr, size_t size DMALLOC_PARAMS)
  221. {
  222. void *result;
  223. tor_assert(size < SIZE_T_CEILING);
  224. #ifndef MALLOC_ZERO_WORKS
  225. /* Some libc mallocs don't work when size==0. Override them. */
  226. if (size==0) {
  227. size=1;
  228. }
  229. #endif
  230. #ifdef USE_DMALLOC
  231. result = dmalloc_realloc(file, line, ptr, size, DMALLOC_FUNC_REALLOC, 0);
  232. #else
  233. result = realloc(ptr, size);
  234. #endif
  235. if (PREDICT_UNLIKELY(result == NULL)) {
  236. log_err(LD_MM,"Out of memory on realloc(). Dying.");
  237. exit(1);
  238. }
  239. return result;
  240. }
  241. /**
  242. * Try to realloc <b>ptr</b> so that it takes up sz1 * sz2 bytes. Check for
  243. * overflow. Unlike other allocation functions, return NULL on overflow.
  244. */
  245. void *
  246. tor_reallocarray_(void *ptr, size_t sz1, size_t sz2 DMALLOC_PARAMS)
  247. {
  248. /* XXXX we can make this return 0, but we would need to check all the
  249. * reallocarray users. */
  250. tor_assert(size_mul_check(sz1, sz2));
  251. return tor_realloc(ptr, (sz1 * sz2) DMALLOC_FN_ARGS);
  252. }
  253. /** Return a newly allocated copy of the NUL-terminated string s. On
  254. * error, log and terminate. (Like strdup(s), but never returns
  255. * NULL.)
  256. */
  257. char *
  258. tor_strdup_(const char *s DMALLOC_PARAMS)
  259. {
  260. char *dup;
  261. tor_assert(s);
  262. #ifdef USE_DMALLOC
  263. dup = dmalloc_strdup(file, line, s, 0);
  264. #else
  265. dup = strdup(s);
  266. #endif
  267. if (PREDICT_UNLIKELY(dup == NULL)) {
  268. log_err(LD_MM,"Out of memory on strdup(). Dying.");
  269. exit(1);
  270. }
  271. return dup;
  272. }
  273. /** Allocate and return a new string containing the first <b>n</b>
  274. * characters of <b>s</b>. If <b>s</b> is longer than <b>n</b>
  275. * characters, only the first <b>n</b> are copied. The result is
  276. * always NUL-terminated. (Like strndup(s,n), but never returns
  277. * NULL.)
  278. */
  279. char *
  280. tor_strndup_(const char *s, size_t n DMALLOC_PARAMS)
  281. {
  282. char *dup;
  283. tor_assert(s);
  284. tor_assert(n < SIZE_T_CEILING);
  285. dup = tor_malloc_((n+1) DMALLOC_FN_ARGS);
  286. /* Performance note: Ordinarily we prefer strlcpy to strncpy. But
  287. * this function gets called a whole lot, and platform strncpy is
  288. * much faster than strlcpy when strlen(s) is much longer than n.
  289. */
  290. strncpy(dup, s, n);
  291. dup[n]='\0';
  292. return dup;
  293. }
  294. /** Allocate a chunk of <b>len</b> bytes, with the same contents as the
  295. * <b>len</b> bytes starting at <b>mem</b>. */
  296. void *
  297. tor_memdup_(const void *mem, size_t len DMALLOC_PARAMS)
  298. {
  299. char *dup;
  300. tor_assert(len < SIZE_T_CEILING);
  301. tor_assert(mem);
  302. dup = tor_malloc_(len DMALLOC_FN_ARGS);
  303. memcpy(dup, mem, len);
  304. return dup;
  305. }
  306. /** As tor_memdup(), but add an extra 0 byte at the end of the resulting
  307. * memory. */
  308. void *
  309. tor_memdup_nulterm_(const void *mem, size_t len DMALLOC_PARAMS)
  310. {
  311. char *dup;
  312. tor_assert(len < SIZE_T_CEILING+1);
  313. tor_assert(mem);
  314. dup = tor_malloc_(len+1 DMALLOC_FN_ARGS);
  315. memcpy(dup, mem, len);
  316. dup[len] = '\0';
  317. return dup;
  318. }
  319. /** Helper for places that need to take a function pointer to the right
  320. * spelling of "free()". */
  321. void
  322. tor_free_(void *mem)
  323. {
  324. tor_free(mem);
  325. }
  326. /** Call the platform malloc info function, and dump the results to the log at
  327. * level <b>severity</b>. If no such function exists, do nothing. */
  328. void
  329. tor_log_mallinfo(int severity)
  330. {
  331. #ifdef HAVE_MALLINFO
  332. struct mallinfo mi;
  333. memset(&mi, 0, sizeof(mi));
  334. mi = mallinfo();
  335. tor_log(severity, LD_MM,
  336. "mallinfo() said: arena=%d, ordblks=%d, smblks=%d, hblks=%d, "
  337. "hblkhd=%d, usmblks=%d, fsmblks=%d, uordblks=%d, fordblks=%d, "
  338. "keepcost=%d",
  339. mi.arena, mi.ordblks, mi.smblks, mi.hblks,
  340. mi.hblkhd, mi.usmblks, mi.fsmblks, mi.uordblks, mi.fordblks,
  341. mi.keepcost);
  342. #else
  343. (void)severity;
  344. #endif
  345. #ifdef USE_DMALLOC
  346. dmalloc_log_changed(0, /* Since the program started. */
  347. 1, /* Log info about non-freed pointers. */
  348. 0, /* Do not log info about freed pointers. */
  349. 0 /* Do not log individual pointers. */
  350. );
  351. #endif
  352. }
  353. /* =====
  354. * Math
  355. * ===== */
  356. /**
  357. * Returns the natural logarithm of d base e. We defined this wrapper here so
  358. * to avoid conflicts with old versions of tor_log(), which were named log().
  359. */
  360. double
  361. tor_mathlog(double d)
  362. {
  363. return log(d);
  364. }
  365. /** Return the long integer closest to <b>d</b>. We define this wrapper
  366. * here so that not all users of math.h need to use the right incantations
  367. * to get the c99 functions. */
  368. long
  369. tor_lround(double d)
  370. {
  371. #if defined(HAVE_LROUND)
  372. return lround(d);
  373. #elif defined(HAVE_RINT)
  374. return (long)rint(d);
  375. #else
  376. return (long)(d > 0 ? d + 0.5 : ceil(d - 0.5));
  377. #endif
  378. }
  379. /** Return the 64-bit integer closest to d. We define this wrapper here so
  380. * that not all users of math.h need to use the right incantations to get the
  381. * c99 functions. */
  382. int64_t
  383. tor_llround(double d)
  384. {
  385. #if defined(HAVE_LLROUND)
  386. return (int64_t)llround(d);
  387. #elif defined(HAVE_RINT)
  388. return (int64_t)rint(d);
  389. #else
  390. return (int64_t)(d > 0 ? d + 0.5 : ceil(d - 0.5));
  391. #endif
  392. }
  393. /** Returns floor(log2(u64)). If u64 is 0, (incorrectly) returns 0. */
  394. int
  395. tor_log2(uint64_t u64)
  396. {
  397. int r = 0;
  398. if (u64 >= (U64_LITERAL(1)<<32)) {
  399. u64 >>= 32;
  400. r = 32;
  401. }
  402. if (u64 >= (U64_LITERAL(1)<<16)) {
  403. u64 >>= 16;
  404. r += 16;
  405. }
  406. if (u64 >= (U64_LITERAL(1)<<8)) {
  407. u64 >>= 8;
  408. r += 8;
  409. }
  410. if (u64 >= (U64_LITERAL(1)<<4)) {
  411. u64 >>= 4;
  412. r += 4;
  413. }
  414. if (u64 >= (U64_LITERAL(1)<<2)) {
  415. u64 >>= 2;
  416. r += 2;
  417. }
  418. if (u64 >= (U64_LITERAL(1)<<1)) {
  419. u64 >>= 1;
  420. r += 1;
  421. }
  422. return r;
  423. }
  424. /** Return the power of 2 in range [1,UINT64_MAX] closest to <b>u64</b>. If
  425. * there are two powers of 2 equally close, round down. */
  426. uint64_t
  427. round_to_power_of_2(uint64_t u64)
  428. {
  429. int lg2;
  430. uint64_t low;
  431. uint64_t high;
  432. if (u64 == 0)
  433. return 1;
  434. lg2 = tor_log2(u64);
  435. low = U64_LITERAL(1) << lg2;
  436. if (lg2 == 63)
  437. return low;
  438. high = U64_LITERAL(1) << (lg2+1);
  439. if (high - u64 < u64 - low)
  440. return high;
  441. else
  442. return low;
  443. }
  444. /** Return the lowest x such that x is at least <b>number</b>, and x modulo
  445. * <b>divisor</b> == 0. If no such x can be expressed as an unsigned, return
  446. * UINT_MAX */
  447. unsigned
  448. round_to_next_multiple_of(unsigned number, unsigned divisor)
  449. {
  450. tor_assert(divisor > 0);
  451. if (UINT_MAX - divisor + 1 < number)
  452. return UINT_MAX;
  453. number += divisor - 1;
  454. number -= number % divisor;
  455. return number;
  456. }
  457. /** Return the lowest x such that x is at least <b>number</b>, and x modulo
  458. * <b>divisor</b> == 0. If no such x can be expressed as a uint32_t, return
  459. * UINT32_MAX */
  460. uint32_t
  461. round_uint32_to_next_multiple_of(uint32_t number, uint32_t divisor)
  462. {
  463. tor_assert(divisor > 0);
  464. if (UINT32_MAX - divisor + 1 < number)
  465. return UINT32_MAX;
  466. number += divisor - 1;
  467. number -= number % divisor;
  468. return number;
  469. }
  470. /** Return the lowest x such that x is at least <b>number</b>, and x modulo
  471. * <b>divisor</b> == 0. If no such x can be expressed as a uint64_t, return
  472. * UINT64_MAX */
  473. uint64_t
  474. round_uint64_to_next_multiple_of(uint64_t number, uint64_t divisor)
  475. {
  476. tor_assert(divisor > 0);
  477. if (UINT64_MAX - divisor + 1 < number)
  478. return UINT64_MAX;
  479. number += divisor - 1;
  480. number -= number % divisor;
  481. return number;
  482. }
  483. /** Return the lowest x in [INT64_MIN, INT64_MAX] such that x is at least
  484. * <b>number</b>, and x modulo <b>divisor</b> == 0. If no such x can be
  485. * expressed as an int64_t, return INT64_MAX */
  486. int64_t
  487. round_int64_to_next_multiple_of(int64_t number, int64_t divisor)
  488. {
  489. tor_assert(divisor > 0);
  490. if (INT64_MAX - divisor + 1 < number)
  491. return INT64_MAX;
  492. if (number >= 0)
  493. number += divisor - 1;
  494. number -= number % divisor;
  495. return number;
  496. }
  497. /** Transform a random value <b>p</b> from the uniform distribution in
  498. * [0.0, 1.0[ into a Laplace distributed value with location parameter
  499. * <b>mu</b> and scale parameter <b>b</b>. Truncate the final result
  500. * to be an integer in [INT64_MIN, INT64_MAX]. */
  501. int64_t
  502. sample_laplace_distribution(double mu, double b, double p)
  503. {
  504. double result;
  505. tor_assert(p >= 0.0 && p < 1.0);
  506. /* This is the "inverse cumulative distribution function" from:
  507. * http://en.wikipedia.org/wiki/Laplace_distribution */
  508. if (p <= 0.0) {
  509. /* Avoid taking log(0.0) == -INFINITY, as some processors or compiler
  510. * options can cause the program to trap. */
  511. return INT64_MIN;
  512. }
  513. result = mu - b * (p > 0.5 ? 1.0 : -1.0)
  514. * tor_mathlog(1.0 - 2.0 * fabs(p - 0.5));
  515. return clamp_double_to_int64(result);
  516. }
  517. /** Add random noise between INT64_MIN and INT64_MAX coming from a Laplace
  518. * distribution with mu = 0 and b = <b>delta_f</b>/<b>epsilon</b> to
  519. * <b>signal</b> based on the provided <b>random</b> value in [0.0, 1.0[.
  520. * The epsilon value must be between ]0.0, 1.0]. delta_f must be greater
  521. * than 0. */
  522. int64_t
  523. add_laplace_noise(int64_t signal, double random, double delta_f,
  524. double epsilon)
  525. {
  526. int64_t noise;
  527. /* epsilon MUST be between ]0.0, 1.0] */
  528. tor_assert(epsilon > 0.0 && epsilon <= 1.0);
  529. /* delta_f MUST be greater than 0. */
  530. tor_assert(delta_f > 0.0);
  531. /* Just add noise, no further signal */
  532. noise = sample_laplace_distribution(0.0,
  533. delta_f / epsilon,
  534. random);
  535. /* Clip (signal + noise) to [INT64_MIN, INT64_MAX] */
  536. if (noise > 0 && INT64_MAX - noise < signal)
  537. return INT64_MAX;
  538. else if (noise < 0 && INT64_MIN - noise > signal)
  539. return INT64_MIN;
  540. else
  541. return signal + noise;
  542. }
  543. /** Return the number of bits set in <b>v</b>. */
  544. int
  545. n_bits_set_u8(uint8_t v)
  546. {
  547. static const int nybble_table[] = {
  548. 0, /* 0000 */
  549. 1, /* 0001 */
  550. 1, /* 0010 */
  551. 2, /* 0011 */
  552. 1, /* 0100 */
  553. 2, /* 0101 */
  554. 2, /* 0110 */
  555. 3, /* 0111 */
  556. 1, /* 1000 */
  557. 2, /* 1001 */
  558. 2, /* 1010 */
  559. 3, /* 1011 */
  560. 2, /* 1100 */
  561. 3, /* 1101 */
  562. 3, /* 1110 */
  563. 4, /* 1111 */
  564. };
  565. return nybble_table[v & 15] + nybble_table[v>>4];
  566. }
  567. /* =====
  568. * String manipulation
  569. * ===== */
  570. /** Remove from the string <b>s</b> every character which appears in
  571. * <b>strip</b>. */
  572. void
  573. tor_strstrip(char *s, const char *strip)
  574. {
  575. char *read = s;
  576. while (*read) {
  577. if (strchr(strip, *read)) {
  578. ++read;
  579. } else {
  580. *s++ = *read++;
  581. }
  582. }
  583. *s = '\0';
  584. }
  585. /** Return a pointer to a NUL-terminated hexadecimal string encoding
  586. * the first <b>fromlen</b> bytes of <b>from</b>. (fromlen must be \<= 32.) The
  587. * result does not need to be deallocated, but repeated calls to
  588. * hex_str will trash old results.
  589. */
  590. const char *
  591. hex_str(const char *from, size_t fromlen)
  592. {
  593. static char buf[65];
  594. if (fromlen>(sizeof(buf)-1)/2)
  595. fromlen = (sizeof(buf)-1)/2;
  596. base16_encode(buf,sizeof(buf),from,fromlen);
  597. return buf;
  598. }
  599. /** Convert all alphabetic characters in the nul-terminated string <b>s</b> to
  600. * lowercase. */
  601. void
  602. tor_strlower(char *s)
  603. {
  604. while (*s) {
  605. *s = TOR_TOLOWER(*s);
  606. ++s;
  607. }
  608. }
  609. /** Convert all alphabetic characters in the nul-terminated string <b>s</b> to
  610. * lowercase. */
  611. void
  612. tor_strupper(char *s)
  613. {
  614. while (*s) {
  615. *s = TOR_TOUPPER(*s);
  616. ++s;
  617. }
  618. }
  619. /** Return 1 if every character in <b>s</b> is printable, else return 0.
  620. */
  621. int
  622. tor_strisprint(const char *s)
  623. {
  624. while (*s) {
  625. if (!TOR_ISPRINT(*s))
  626. return 0;
  627. s++;
  628. }
  629. return 1;
  630. }
  631. /** Return 1 if no character in <b>s</b> is uppercase, else return 0.
  632. */
  633. int
  634. tor_strisnonupper(const char *s)
  635. {
  636. while (*s) {
  637. if (TOR_ISUPPER(*s))
  638. return 0;
  639. s++;
  640. }
  641. return 1;
  642. }
  643. /** As strcmp, except that either string may be NULL. The NULL string is
  644. * considered to be before any non-NULL string. */
  645. int
  646. strcmp_opt(const char *s1, const char *s2)
  647. {
  648. if (!s1) {
  649. if (!s2)
  650. return 0;
  651. else
  652. return -1;
  653. } else if (!s2) {
  654. return 1;
  655. } else {
  656. return strcmp(s1, s2);
  657. }
  658. }
  659. /** Compares the first strlen(s2) characters of s1 with s2. Returns as for
  660. * strcmp.
  661. */
  662. int
  663. strcmpstart(const char *s1, const char *s2)
  664. {
  665. size_t n = strlen(s2);
  666. return strncmp(s1, s2, n);
  667. }
  668. /** Compare the s1_len-byte string <b>s1</b> with <b>s2</b>,
  669. * without depending on a terminating nul in s1. Sorting order is first by
  670. * length, then lexically; return values are as for strcmp.
  671. */
  672. int
  673. strcmp_len(const char *s1, const char *s2, size_t s1_len)
  674. {
  675. size_t s2_len = strlen(s2);
  676. if (s1_len < s2_len)
  677. return -1;
  678. if (s1_len > s2_len)
  679. return 1;
  680. return fast_memcmp(s1, s2, s2_len);
  681. }
  682. /** Compares the first strlen(s2) characters of s1 with s2. Returns as for
  683. * strcasecmp.
  684. */
  685. int
  686. strcasecmpstart(const char *s1, const char *s2)
  687. {
  688. size_t n = strlen(s2);
  689. return strncasecmp(s1, s2, n);
  690. }
  691. /** Compares the last strlen(s2) characters of s1 with s2. Returns as for
  692. * strcmp.
  693. */
  694. int
  695. strcmpend(const char *s1, const char *s2)
  696. {
  697. size_t n1 = strlen(s1), n2 = strlen(s2);
  698. if (n2>n1)
  699. return strcmp(s1,s2);
  700. else
  701. return strncmp(s1+(n1-n2), s2, n2);
  702. }
  703. /** Compares the last strlen(s2) characters of s1 with s2. Returns as for
  704. * strcasecmp.
  705. */
  706. int
  707. strcasecmpend(const char *s1, const char *s2)
  708. {
  709. size_t n1 = strlen(s1), n2 = strlen(s2);
  710. if (n2>n1) /* then they can't be the same; figure out which is bigger */
  711. return strcasecmp(s1,s2);
  712. else
  713. return strncasecmp(s1+(n1-n2), s2, n2);
  714. }
  715. /** Compare the value of the string <b>prefix</b> with the start of the
  716. * <b>memlen</b>-byte memory chunk at <b>mem</b>. Return as for strcmp.
  717. *
  718. * [As fast_memcmp(mem, prefix, strlen(prefix)) but returns -1 if memlen is
  719. * less than strlen(prefix).]
  720. */
  721. int
  722. fast_memcmpstart(const void *mem, size_t memlen,
  723. const char *prefix)
  724. {
  725. size_t plen = strlen(prefix);
  726. if (memlen < plen)
  727. return -1;
  728. return fast_memcmp(mem, prefix, plen);
  729. }
  730. /** Return a pointer to the first char of s that is not whitespace and
  731. * not a comment, or to the terminating NUL if no such character exists.
  732. */
  733. const char *
  734. eat_whitespace(const char *s)
  735. {
  736. tor_assert(s);
  737. while (1) {
  738. switch (*s) {
  739. case '\0':
  740. default:
  741. return s;
  742. case ' ':
  743. case '\t':
  744. case '\n':
  745. case '\r':
  746. ++s;
  747. break;
  748. case '#':
  749. ++s;
  750. while (*s && *s != '\n')
  751. ++s;
  752. }
  753. }
  754. }
  755. /** Return a pointer to the first char of s that is not whitespace and
  756. * not a comment, or to the terminating NUL if no such character exists.
  757. */
  758. const char *
  759. eat_whitespace_eos(const char *s, const char *eos)
  760. {
  761. tor_assert(s);
  762. tor_assert(eos && s <= eos);
  763. while (s < eos) {
  764. switch (*s) {
  765. case '\0':
  766. default:
  767. return s;
  768. case ' ':
  769. case '\t':
  770. case '\n':
  771. case '\r':
  772. ++s;
  773. break;
  774. case '#':
  775. ++s;
  776. while (s < eos && *s && *s != '\n')
  777. ++s;
  778. }
  779. }
  780. return s;
  781. }
  782. /** Return a pointer to the first char of s that is not a space or a tab
  783. * or a \\r, or to the terminating NUL if no such character exists. */
  784. const char *
  785. eat_whitespace_no_nl(const char *s)
  786. {
  787. while (*s == ' ' || *s == '\t' || *s == '\r')
  788. ++s;
  789. return s;
  790. }
  791. /** As eat_whitespace_no_nl, but stop at <b>eos</b> whether we have
  792. * found a non-whitespace character or not. */
  793. const char *
  794. eat_whitespace_eos_no_nl(const char *s, const char *eos)
  795. {
  796. while (s < eos && (*s == ' ' || *s == '\t' || *s == '\r'))
  797. ++s;
  798. return s;
  799. }
  800. /** Return a pointer to the first char of s that is whitespace or <b>#</b>,
  801. * or to the terminating NUL if no such character exists.
  802. */
  803. const char *
  804. find_whitespace(const char *s)
  805. {
  806. /* tor_assert(s); */
  807. while (1) {
  808. switch (*s)
  809. {
  810. case '\0':
  811. case '#':
  812. case ' ':
  813. case '\r':
  814. case '\n':
  815. case '\t':
  816. return s;
  817. default:
  818. ++s;
  819. }
  820. }
  821. }
  822. /** As find_whitespace, but stop at <b>eos</b> whether we have found a
  823. * whitespace or not. */
  824. const char *
  825. find_whitespace_eos(const char *s, const char *eos)
  826. {
  827. /* tor_assert(s); */
  828. while (s < eos) {
  829. switch (*s)
  830. {
  831. case '\0':
  832. case '#':
  833. case ' ':
  834. case '\r':
  835. case '\n':
  836. case '\t':
  837. return s;
  838. default:
  839. ++s;
  840. }
  841. }
  842. return s;
  843. }
  844. /** Return the first occurrence of <b>needle</b> in <b>haystack</b> that
  845. * occurs at the start of a line (that is, at the beginning of <b>haystack</b>
  846. * or immediately after a newline). Return NULL if no such string is found.
  847. */
  848. const char *
  849. find_str_at_start_of_line(const char *haystack, const char *needle)
  850. {
  851. size_t needle_len = strlen(needle);
  852. do {
  853. if (!strncmp(haystack, needle, needle_len))
  854. return haystack;
  855. haystack = strchr(haystack, '\n');
  856. if (!haystack)
  857. return NULL;
  858. else
  859. ++haystack;
  860. } while (*haystack);
  861. return NULL;
  862. }
  863. /** Returns true if <b>string</b> could be a C identifier.
  864. A C identifier must begin with a letter or an underscore and the
  865. rest of its characters can be letters, numbers or underscores. No
  866. length limit is imposed. */
  867. int
  868. string_is_C_identifier(const char *string)
  869. {
  870. size_t iter;
  871. size_t length = strlen(string);
  872. if (!length)
  873. return 0;
  874. for (iter = 0; iter < length ; iter++) {
  875. if (iter == 0) {
  876. if (!(TOR_ISALPHA(string[iter]) ||
  877. string[iter] == '_'))
  878. return 0;
  879. } else {
  880. if (!(TOR_ISALPHA(string[iter]) ||
  881. TOR_ISDIGIT(string[iter]) ||
  882. string[iter] == '_'))
  883. return 0;
  884. }
  885. }
  886. return 1;
  887. }
  888. /** Return true iff the 'len' bytes at 'mem' are all zero. */
  889. int
  890. tor_mem_is_zero(const char *mem, size_t len)
  891. {
  892. static const char ZERO[] = {
  893. 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0,
  894. };
  895. while (len >= sizeof(ZERO)) {
  896. /* It's safe to use fast_memcmp here, since the very worst thing an
  897. * attacker could learn is how many initial bytes of a secret were zero */
  898. if (fast_memcmp(mem, ZERO, sizeof(ZERO)))
  899. return 0;
  900. len -= sizeof(ZERO);
  901. mem += sizeof(ZERO);
  902. }
  903. /* Deal with leftover bytes. */
  904. if (len)
  905. return fast_memeq(mem, ZERO, len);
  906. return 1;
  907. }
  908. /** Return true iff the DIGEST_LEN bytes in digest are all zero. */
  909. int
  910. tor_digest_is_zero(const char *digest)
  911. {
  912. static const uint8_t ZERO_DIGEST[] = {
  913. 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0
  914. };
  915. return tor_memeq(digest, ZERO_DIGEST, DIGEST_LEN);
  916. }
  917. /** Return true if <b>string</b> is a valid 'key=[value]' string.
  918. * "value" is optional, to indicate the empty string. Log at logging
  919. * <b>severity</b> if something ugly happens. */
  920. int
  921. string_is_key_value(int severity, const char *string)
  922. {
  923. /* position of equal sign in string */
  924. const char *equal_sign_pos = NULL;
  925. tor_assert(string);
  926. if (strlen(string) < 2) { /* "x=" is shortest args string */
  927. tor_log(severity, LD_GENERAL, "'%s' is too short to be a k=v value.",
  928. escaped(string));
  929. return 0;
  930. }
  931. equal_sign_pos = strchr(string, '=');
  932. if (!equal_sign_pos) {
  933. tor_log(severity, LD_GENERAL, "'%s' is not a k=v value.", escaped(string));
  934. return 0;
  935. }
  936. /* validate that the '=' is not in the beginning of the string. */
  937. if (equal_sign_pos == string) {
  938. tor_log(severity, LD_GENERAL, "'%s' is not a valid k=v value.",
  939. escaped(string));
  940. return 0;
  941. }
  942. return 1;
  943. }
  944. /** Return true if <b>string</b> represents a valid IPv4 adddress in
  945. * 'a.b.c.d' form.
  946. */
  947. int
  948. string_is_valid_ipv4_address(const char *string)
  949. {
  950. struct in_addr addr;
  951. return (tor_inet_pton(AF_INET,string,&addr) == 1);
  952. }
  953. /** Return true if <b>string</b> represents a valid IPv6 address in
  954. * a form that inet_pton() can parse.
  955. */
  956. int
  957. string_is_valid_ipv6_address(const char *string)
  958. {
  959. struct in6_addr addr;
  960. return (tor_inet_pton(AF_INET6,string,&addr) == 1);
  961. }
  962. /** Return true iff <b>string</b> matches a pattern of DNS names
  963. * that we allow Tor clients to connect to.
  964. *
  965. * Note: This allows certain technically invalid characters ('_') to cope
  966. * with misconfigured zones that have been encountered in the wild.
  967. */
  968. int
  969. string_is_valid_hostname(const char *string)
  970. {
  971. int result = 1;
  972. smartlist_t *components;
  973. components = smartlist_new();
  974. smartlist_split_string(components,string,".",0,0);
  975. SMARTLIST_FOREACH_BEGIN(components, char *, c) {
  976. if ((c[0] == '-') || (*c == '_')) {
  977. result = 0;
  978. break;
  979. }
  980. /* Allow a single terminating '.' used rarely to indicate domains
  981. * are FQDNs rather than relative. */
  982. if ((c_sl_idx > 0) && (c_sl_idx + 1 == c_sl_len) && !*c) {
  983. continue;
  984. }
  985. do {
  986. if ((*c >= 'a' && *c <= 'z') ||
  987. (*c >= 'A' && *c <= 'Z') ||
  988. (*c >= '0' && *c <= '9') ||
  989. (*c == '-') || (*c == '_'))
  990. c++;
  991. else
  992. result = 0;
  993. } while (result && *c);
  994. } SMARTLIST_FOREACH_END(c);
  995. SMARTLIST_FOREACH_BEGIN(components, char *, c) {
  996. tor_free(c);
  997. } SMARTLIST_FOREACH_END(c);
  998. smartlist_free(components);
  999. return result;
  1000. }
  1001. /** Return true iff the DIGEST256_LEN bytes in digest are all zero. */
  1002. int
  1003. tor_digest256_is_zero(const char *digest)
  1004. {
  1005. return tor_mem_is_zero(digest, DIGEST256_LEN);
  1006. }
  1007. /* Helper: common code to check whether the result of a strtol or strtoul or
  1008. * strtoll is correct. */
  1009. #define CHECK_STRTOX_RESULT() \
  1010. /* Did an overflow occur? */ \
  1011. if (errno == ERANGE) \
  1012. goto err; \
  1013. /* Was at least one character converted? */ \
  1014. if (endptr == s) \
  1015. goto err; \
  1016. /* Were there unexpected unconverted characters? */ \
  1017. if (!next && *endptr) \
  1018. goto err; \
  1019. /* Is r within limits? */ \
  1020. if (r < min || r > max) \
  1021. goto err; \
  1022. if (ok) *ok = 1; \
  1023. if (next) *next = endptr; \
  1024. return r; \
  1025. err: \
  1026. if (ok) *ok = 0; \
  1027. if (next) *next = endptr; \
  1028. return 0
  1029. /** Extract a long from the start of <b>s</b>, in the given numeric
  1030. * <b>base</b>. If <b>base</b> is 0, <b>s</b> is parsed as a decimal,
  1031. * octal, or hex number in the syntax of a C integer literal. If
  1032. * there is unconverted data and <b>next</b> is provided, set
  1033. * *<b>next</b> to the first unconverted character. An error has
  1034. * occurred if no characters are converted; or if there are
  1035. * unconverted characters and <b>next</b> is NULL; or if the parsed
  1036. * value is not between <b>min</b> and <b>max</b>. When no error
  1037. * occurs, return the parsed value and set *<b>ok</b> (if provided) to
  1038. * 1. When an error occurs, return 0 and set *<b>ok</b> (if provided)
  1039. * to 0.
  1040. */
  1041. long
  1042. tor_parse_long(const char *s, int base, long min, long max,
  1043. int *ok, char **next)
  1044. {
  1045. char *endptr;
  1046. long r;
  1047. if (base < 0) {
  1048. if (ok)
  1049. *ok = 0;
  1050. return 0;
  1051. }
  1052. errno = 0;
  1053. r = strtol(s, &endptr, base);
  1054. CHECK_STRTOX_RESULT();
  1055. }
  1056. /** As tor_parse_long(), but return an unsigned long. */
  1057. unsigned long
  1058. tor_parse_ulong(const char *s, int base, unsigned long min,
  1059. unsigned long max, int *ok, char **next)
  1060. {
  1061. char *endptr;
  1062. unsigned long r;
  1063. if (base < 0) {
  1064. if (ok)
  1065. *ok = 0;
  1066. return 0;
  1067. }
  1068. errno = 0;
  1069. r = strtoul(s, &endptr, base);
  1070. CHECK_STRTOX_RESULT();
  1071. }
  1072. /** As tor_parse_long(), but return a double. */
  1073. double
  1074. tor_parse_double(const char *s, double min, double max, int *ok, char **next)
  1075. {
  1076. char *endptr;
  1077. double r;
  1078. errno = 0;
  1079. r = strtod(s, &endptr);
  1080. CHECK_STRTOX_RESULT();
  1081. }
  1082. /** As tor_parse_long, but return a uint64_t. Only base 10 is guaranteed to
  1083. * work for now. */
  1084. uint64_t
  1085. tor_parse_uint64(const char *s, int base, uint64_t min,
  1086. uint64_t max, int *ok, char **next)
  1087. {
  1088. char *endptr;
  1089. uint64_t r;
  1090. if (base < 0) {
  1091. if (ok)
  1092. *ok = 0;
  1093. return 0;
  1094. }
  1095. errno = 0;
  1096. #ifdef HAVE_STRTOULL
  1097. r = (uint64_t)strtoull(s, &endptr, base);
  1098. #elif defined(_WIN32)
  1099. #if defined(_MSC_VER) && _MSC_VER < 1300
  1100. tor_assert(base <= 10);
  1101. r = (uint64_t)_atoi64(s);
  1102. endptr = (char*)s;
  1103. while (TOR_ISSPACE(*endptr)) endptr++;
  1104. while (TOR_ISDIGIT(*endptr)) endptr++;
  1105. #else
  1106. r = (uint64_t)_strtoui64(s, &endptr, base);
  1107. #endif
  1108. #elif SIZEOF_LONG == 8
  1109. r = (uint64_t)strtoul(s, &endptr, base);
  1110. #else
  1111. #error "I don't know how to parse 64-bit numbers."
  1112. #endif
  1113. CHECK_STRTOX_RESULT();
  1114. }
  1115. /** Allocate and return a new string representing the contents of <b>s</b>,
  1116. * surrounded by quotes and using standard C escapes.
  1117. *
  1118. * Generally, we use this for logging values that come in over the network to
  1119. * keep them from tricking users, and for sending certain values to the
  1120. * controller.
  1121. *
  1122. * We trust values from the resolver, OS, configuration file, and command line
  1123. * to not be maliciously ill-formed. We validate incoming routerdescs and
  1124. * SOCKS requests and addresses from BEGIN cells as they're parsed;
  1125. * afterwards, we trust them as non-malicious.
  1126. */
  1127. char *
  1128. esc_for_log(const char *s)
  1129. {
  1130. const char *cp;
  1131. char *result, *outp;
  1132. size_t len = 3;
  1133. if (!s) {
  1134. return tor_strdup("(null)");
  1135. }
  1136. for (cp = s; *cp; ++cp) {
  1137. switch (*cp) {
  1138. case '\\':
  1139. case '\"':
  1140. case '\'':
  1141. case '\r':
  1142. case '\n':
  1143. case '\t':
  1144. len += 2;
  1145. break;
  1146. default:
  1147. if (TOR_ISPRINT(*cp) && ((uint8_t)*cp)<127)
  1148. ++len;
  1149. else
  1150. len += 4;
  1151. break;
  1152. }
  1153. }
  1154. tor_assert(len <= SSIZE_MAX);
  1155. result = outp = tor_malloc(len);
  1156. *outp++ = '\"';
  1157. for (cp = s; *cp; ++cp) {
  1158. /* This assertion should always succeed, since we will write at least
  1159. * one char here, and two chars for closing quote and nul later */
  1160. tor_assert((outp-result) < (ssize_t)len-2);
  1161. switch (*cp) {
  1162. case '\\':
  1163. case '\"':
  1164. case '\'':
  1165. *outp++ = '\\';
  1166. *outp++ = *cp;
  1167. break;
  1168. case '\n':
  1169. *outp++ = '\\';
  1170. *outp++ = 'n';
  1171. break;
  1172. case '\t':
  1173. *outp++ = '\\';
  1174. *outp++ = 't';
  1175. break;
  1176. case '\r':
  1177. *outp++ = '\\';
  1178. *outp++ = 'r';
  1179. break;
  1180. default:
  1181. if (TOR_ISPRINT(*cp) && ((uint8_t)*cp)<127) {
  1182. *outp++ = *cp;
  1183. } else {
  1184. tor_assert((outp-result) < (ssize_t)len-4);
  1185. tor_snprintf(outp, 5, "\\%03o", (int)(uint8_t) *cp);
  1186. outp += 4;
  1187. }
  1188. break;
  1189. }
  1190. }
  1191. tor_assert((outp-result) <= (ssize_t)len-2);
  1192. *outp++ = '\"';
  1193. *outp++ = 0;
  1194. return result;
  1195. }
  1196. /** Similar to esc_for_log. Allocate and return a new string representing
  1197. * the first n characters in <b>chars</b>, surround by quotes and using
  1198. * standard C escapes. If a NUL character is encountered in <b>chars</b>,
  1199. * the resulting string will be terminated there.
  1200. */
  1201. char *
  1202. esc_for_log_len(const char *chars, size_t n)
  1203. {
  1204. char *string = tor_strndup(chars, n);
  1205. char *string_escaped = esc_for_log(string);
  1206. tor_free(string);
  1207. return string_escaped;
  1208. }
  1209. /** Allocate and return a new string representing the contents of <b>s</b>,
  1210. * surrounded by quotes and using standard C escapes.
  1211. *
  1212. * THIS FUNCTION IS NOT REENTRANT. Don't call it from outside the main
  1213. * thread. Also, each call invalidates the last-returned value, so don't
  1214. * try log_warn(LD_GENERAL, "%s %s", escaped(a), escaped(b));
  1215. */
  1216. const char *
  1217. escaped(const char *s)
  1218. {
  1219. static char *escaped_val_ = NULL;
  1220. tor_free(escaped_val_);
  1221. if (s)
  1222. escaped_val_ = esc_for_log(s);
  1223. else
  1224. escaped_val_ = NULL;
  1225. return escaped_val_;
  1226. }
  1227. /** Return a newly allocated string equal to <b>string</b>, except that every
  1228. * character in <b>chars_to_escape</b> is preceded by a backslash. */
  1229. char *
  1230. tor_escape_str_for_pt_args(const char *string, const char *chars_to_escape)
  1231. {
  1232. char *new_string = NULL;
  1233. char *new_cp = NULL;
  1234. size_t length, new_length;
  1235. tor_assert(string);
  1236. length = strlen(string);
  1237. if (!length) /* If we were given the empty string, return the same. */
  1238. return tor_strdup("");
  1239. /* (new_length > SIZE_MAX) => ((length * 2) + 1 > SIZE_MAX) =>
  1240. (length*2 > SIZE_MAX - 1) => (length > (SIZE_MAX - 1)/2) */
  1241. if (length > (SIZE_MAX - 1)/2) /* check for overflow */
  1242. return NULL;
  1243. /* this should be enough even if all characters must be escaped */
  1244. new_length = (length * 2) + 1;
  1245. new_string = new_cp = tor_malloc(new_length);
  1246. while (*string) {
  1247. if (strchr(chars_to_escape, *string))
  1248. *new_cp++ = '\\';
  1249. *new_cp++ = *string++;
  1250. }
  1251. *new_cp = '\0'; /* NUL-terminate the new string */
  1252. return new_string;
  1253. }
  1254. /* =====
  1255. * Time
  1256. * ===== */
  1257. /** Return the number of microseconds elapsed between *start and *end.
  1258. */
  1259. long
  1260. tv_udiff(const struct timeval *start, const struct timeval *end)
  1261. {
  1262. long udiff;
  1263. long secdiff = end->tv_sec - start->tv_sec;
  1264. if (labs(secdiff+1) > LONG_MAX/1000000) {
  1265. log_warn(LD_GENERAL, "comparing times on microsecond detail too far "
  1266. "apart: %ld seconds", secdiff);
  1267. return LONG_MAX;
  1268. }
  1269. udiff = secdiff*1000000L + (end->tv_usec - start->tv_usec);
  1270. return udiff;
  1271. }
  1272. /** Return the number of milliseconds elapsed between *start and *end.
  1273. */
  1274. long
  1275. tv_mdiff(const struct timeval *start, const struct timeval *end)
  1276. {
  1277. long mdiff;
  1278. long secdiff = end->tv_sec - start->tv_sec;
  1279. if (labs(secdiff+1) > LONG_MAX/1000) {
  1280. log_warn(LD_GENERAL, "comparing times on millisecond detail too far "
  1281. "apart: %ld seconds", secdiff);
  1282. return LONG_MAX;
  1283. }
  1284. /* Subtract and round */
  1285. mdiff = secdiff*1000L +
  1286. ((long)end->tv_usec - (long)start->tv_usec + 500L) / 1000L;
  1287. return mdiff;
  1288. }
  1289. /**
  1290. * Converts timeval to milliseconds.
  1291. */
  1292. int64_t
  1293. tv_to_msec(const struct timeval *tv)
  1294. {
  1295. int64_t conv = ((int64_t)tv->tv_sec)*1000L;
  1296. /* Round ghetto-style */
  1297. conv += ((int64_t)tv->tv_usec+500)/1000L;
  1298. return conv;
  1299. }
  1300. /** Yield true iff <b>y</b> is a leap-year. */
  1301. #define IS_LEAPYEAR(y) (!(y % 4) && ((y % 100) || !(y % 400)))
  1302. /** Helper: Return the number of leap-days between Jan 1, y1 and Jan 1, y2. */
  1303. static int
  1304. n_leapdays(int y1, int y2)
  1305. {
  1306. --y1;
  1307. --y2;
  1308. return (y2/4 - y1/4) - (y2/100 - y1/100) + (y2/400 - y1/400);
  1309. }
  1310. /** Number of days per month in non-leap year; used by tor_timegm and
  1311. * parse_rfc1123_time. */
  1312. static const int days_per_month[] =
  1313. { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
  1314. /** Compute a time_t given a struct tm. The result is given in UTC, and
  1315. * does not account for leap seconds. Return 0 on success, -1 on failure.
  1316. */
  1317. int
  1318. tor_timegm(const struct tm *tm, time_t *time_out)
  1319. {
  1320. /* This is a pretty ironclad timegm implementation, snarfed from Python2.2.
  1321. * It's way more brute-force than fiddling with tzset().
  1322. */
  1323. time_t year, days, hours, minutes, seconds;
  1324. int i, invalid_year, dpm;
  1325. /* avoid int overflow on addition */
  1326. if (tm->tm_year < INT32_MAX-1900) {
  1327. year = tm->tm_year + 1900;
  1328. } else {
  1329. /* clamp year */
  1330. year = INT32_MAX;
  1331. }
  1332. invalid_year = (year < 1970 || tm->tm_year >= INT32_MAX-1900);
  1333. if (tm->tm_mon >= 0 && tm->tm_mon <= 11) {
  1334. dpm = days_per_month[tm->tm_mon];
  1335. if (tm->tm_mon == 1 && !invalid_year && IS_LEAPYEAR(tm->tm_year)) {
  1336. dpm = 29;
  1337. }
  1338. } else {
  1339. /* invalid month - default to 0 days per month */
  1340. dpm = 0;
  1341. }
  1342. if (invalid_year ||
  1343. tm->tm_mon < 0 || tm->tm_mon > 11 ||
  1344. tm->tm_mday < 1 || tm->tm_mday > dpm ||
  1345. tm->tm_hour < 0 || tm->tm_hour > 23 ||
  1346. tm->tm_min < 0 || tm->tm_min > 59 ||
  1347. tm->tm_sec < 0 || tm->tm_sec > 60) {
  1348. log_warn(LD_BUG, "Out-of-range argument to tor_timegm");
  1349. return -1;
  1350. }
  1351. days = 365 * (year-1970) + n_leapdays(1970,(int)year);
  1352. for (i = 0; i < tm->tm_mon; ++i)
  1353. days += days_per_month[i];
  1354. if (tm->tm_mon > 1 && IS_LEAPYEAR(year))
  1355. ++days;
  1356. days += tm->tm_mday - 1;
  1357. hours = days*24 + tm->tm_hour;
  1358. minutes = hours*60 + tm->tm_min;
  1359. seconds = minutes*60 + tm->tm_sec;
  1360. *time_out = seconds;
  1361. return 0;
  1362. }
  1363. /* strftime is locale-specific, so we need to replace those parts */
  1364. /** A c-locale array of 3-letter names of weekdays, starting with Sun. */
  1365. static const char *WEEKDAY_NAMES[] =
  1366. { "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" };
  1367. /** A c-locale array of 3-letter names of months, starting with Jan. */
  1368. static const char *MONTH_NAMES[] =
  1369. { "Jan", "Feb", "Mar", "Apr", "May", "Jun",
  1370. "Jul", "Aug", "Sep", "Oct", "Nov", "Dec" };
  1371. /** Set <b>buf</b> to the RFC1123 encoding of the UTC value of <b>t</b>.
  1372. * The buffer must be at least RFC1123_TIME_LEN+1 bytes long.
  1373. *
  1374. * (RFC1123 format is "Fri, 29 Sep 2006 15:54:20 GMT". Note the "GMT"
  1375. * rather than "UTC".)
  1376. */
  1377. void
  1378. format_rfc1123_time(char *buf, time_t t)
  1379. {
  1380. struct tm tm;
  1381. tor_gmtime_r(&t, &tm);
  1382. strftime(buf, RFC1123_TIME_LEN+1, "___, %d ___ %Y %H:%M:%S GMT", &tm);
  1383. tor_assert(tm.tm_wday >= 0);
  1384. tor_assert(tm.tm_wday <= 6);
  1385. memcpy(buf, WEEKDAY_NAMES[tm.tm_wday], 3);
  1386. tor_assert(tm.tm_mon >= 0);
  1387. tor_assert(tm.tm_mon <= 11);
  1388. memcpy(buf+8, MONTH_NAMES[tm.tm_mon], 3);
  1389. }
  1390. /** Parse the (a subset of) the RFC1123 encoding of some time (in UTC) from
  1391. * <b>buf</b>, and store the result in *<b>t</b>.
  1392. *
  1393. * Note that we only accept the subset generated by format_rfc1123_time above,
  1394. * not the full range of formats suggested by RFC 1123.
  1395. *
  1396. * Return 0 on success, -1 on failure.
  1397. */
  1398. int
  1399. parse_rfc1123_time(const char *buf, time_t *t)
  1400. {
  1401. struct tm tm;
  1402. char month[4];
  1403. char weekday[4];
  1404. int i, m, invalid_year;
  1405. unsigned tm_mday, tm_year, tm_hour, tm_min, tm_sec;
  1406. unsigned dpm;
  1407. if (strlen(buf) != RFC1123_TIME_LEN)
  1408. return -1;
  1409. memset(&tm, 0, sizeof(tm));
  1410. if (tor_sscanf(buf, "%3s, %2u %3s %u %2u:%2u:%2u GMT", weekday,
  1411. &tm_mday, month, &tm_year, &tm_hour,
  1412. &tm_min, &tm_sec) < 7) {
  1413. char *esc = esc_for_log(buf);
  1414. log_warn(LD_GENERAL, "Got invalid RFC1123 time %s", esc);
  1415. tor_free(esc);
  1416. return -1;
  1417. }
  1418. m = -1;
  1419. for (i = 0; i < 12; ++i) {
  1420. if (!strcmp(month, MONTH_NAMES[i])) {
  1421. m = i;
  1422. break;
  1423. }
  1424. }
  1425. if (m<0) {
  1426. char *esc = esc_for_log(buf);
  1427. log_warn(LD_GENERAL, "Got invalid RFC1123 time %s: No such month", esc);
  1428. tor_free(esc);
  1429. return -1;
  1430. }
  1431. tm.tm_mon = m;
  1432. invalid_year = (tm_year >= INT32_MAX || tm_year < 1970);
  1433. tor_assert(m >= 0 && m <= 11);
  1434. dpm = days_per_month[m];
  1435. if (m == 1 && !invalid_year && IS_LEAPYEAR(tm_year)) {
  1436. dpm = 29;
  1437. }
  1438. if (invalid_year || tm_mday < 1 || tm_mday > dpm ||
  1439. tm_hour > 23 || tm_min > 59 || tm_sec > 60) {
  1440. char *esc = esc_for_log(buf);
  1441. log_warn(LD_GENERAL, "Got invalid RFC1123 time %s", esc);
  1442. tor_free(esc);
  1443. return -1;
  1444. }
  1445. tm.tm_mday = (int)tm_mday;
  1446. tm.tm_year = (int)tm_year;
  1447. tm.tm_hour = (int)tm_hour;
  1448. tm.tm_min = (int)tm_min;
  1449. tm.tm_sec = (int)tm_sec;
  1450. if (tm.tm_year < 1970) {
  1451. char *esc = esc_for_log(buf);
  1452. log_warn(LD_GENERAL,
  1453. "Got invalid RFC1123 time %s. (Before 1970)", esc);
  1454. tor_free(esc);
  1455. return -1;
  1456. }
  1457. tm.tm_year -= 1900;
  1458. return tor_timegm(&tm, t);
  1459. }
  1460. /** Set <b>buf</b> to the ISO8601 encoding of the local value of <b>t</b>.
  1461. * The buffer must be at least ISO_TIME_LEN+1 bytes long.
  1462. *
  1463. * (ISO8601 format is 2006-10-29 10:57:20)
  1464. */
  1465. void
  1466. format_local_iso_time(char *buf, time_t t)
  1467. {
  1468. struct tm tm;
  1469. strftime(buf, ISO_TIME_LEN+1, "%Y-%m-%d %H:%M:%S", tor_localtime_r(&t, &tm));
  1470. }
  1471. /** Set <b>buf</b> to the ISO8601 encoding of the GMT value of <b>t</b>.
  1472. * The buffer must be at least ISO_TIME_LEN+1 bytes long.
  1473. */
  1474. void
  1475. format_iso_time(char *buf, time_t t)
  1476. {
  1477. struct tm tm;
  1478. strftime(buf, ISO_TIME_LEN+1, "%Y-%m-%d %H:%M:%S", tor_gmtime_r(&t, &tm));
  1479. }
  1480. /** As format_iso_time, but use the yyyy-mm-ddThh:mm:ss format to avoid
  1481. * embedding an internal space. */
  1482. void
  1483. format_iso_time_nospace(char *buf, time_t t)
  1484. {
  1485. format_iso_time(buf, t);
  1486. buf[10] = 'T';
  1487. }
  1488. /** As format_iso_time_nospace, but include microseconds in decimal
  1489. * fixed-point format. Requires that buf be at least ISO_TIME_USEC_LEN+1
  1490. * bytes long. */
  1491. void
  1492. format_iso_time_nospace_usec(char *buf, const struct timeval *tv)
  1493. {
  1494. tor_assert(tv);
  1495. format_iso_time_nospace(buf, (time_t)tv->tv_sec);
  1496. tor_snprintf(buf+ISO_TIME_LEN, 8, ".%06d", (int)tv->tv_usec);
  1497. }
  1498. /** Given an ISO-formatted UTC time value (after the epoch) in <b>cp</b>,
  1499. * parse it and store its value in *<b>t</b>. Return 0 on success, -1 on
  1500. * failure. Ignore extraneous stuff in <b>cp</b> after the end of the time
  1501. * string, unless <b>strict</b> is set. */
  1502. int
  1503. parse_iso_time_(const char *cp, time_t *t, int strict)
  1504. {
  1505. struct tm st_tm;
  1506. unsigned int year=0, month=0, day=0, hour=0, minute=0, second=0;
  1507. int n_fields;
  1508. char extra_char;
  1509. n_fields = tor_sscanf(cp, "%u-%2u-%2u %2u:%2u:%2u%c", &year, &month,
  1510. &day, &hour, &minute, &second, &extra_char);
  1511. if (strict ? (n_fields != 6) : (n_fields < 6)) {
  1512. char *esc = esc_for_log(cp);
  1513. log_warn(LD_GENERAL, "ISO time %s was unparseable", esc);
  1514. tor_free(esc);
  1515. return -1;
  1516. }
  1517. if (year < 1970 || month < 1 || month > 12 || day < 1 || day > 31 ||
  1518. hour > 23 || minute > 59 || second > 60 || year >= INT32_MAX) {
  1519. char *esc = esc_for_log(cp);
  1520. log_warn(LD_GENERAL, "ISO time %s was nonsensical", esc);
  1521. tor_free(esc);
  1522. return -1;
  1523. }
  1524. st_tm.tm_year = (int)year-1900;
  1525. st_tm.tm_mon = month-1;
  1526. st_tm.tm_mday = day;
  1527. st_tm.tm_hour = hour;
  1528. st_tm.tm_min = minute;
  1529. st_tm.tm_sec = second;
  1530. if (st_tm.tm_year < 70) {
  1531. char *esc = esc_for_log(cp);
  1532. log_warn(LD_GENERAL, "Got invalid ISO time %s. (Before 1970)", esc);
  1533. tor_free(esc);
  1534. return -1;
  1535. }
  1536. return tor_timegm(&st_tm, t);
  1537. }
  1538. /** Given an ISO-formatted UTC time value (after the epoch) in <b>cp</b>,
  1539. * parse it and store its value in *<b>t</b>. Return 0 on success, -1 on
  1540. * failure. Reject the string if any characters are present after the time.
  1541. */
  1542. int
  1543. parse_iso_time(const char *cp, time_t *t)
  1544. {
  1545. return parse_iso_time_(cp, t, 1);
  1546. }
  1547. /** Given a <b>date</b> in one of the three formats allowed by HTTP (ugh),
  1548. * parse it into <b>tm</b>. Return 0 on success, negative on failure. */
  1549. int
  1550. parse_http_time(const char *date, struct tm *tm)
  1551. {
  1552. const char *cp;
  1553. char month[4];
  1554. char wkday[4];
  1555. int i;
  1556. unsigned tm_mday, tm_year, tm_hour, tm_min, tm_sec;
  1557. tor_assert(tm);
  1558. memset(tm, 0, sizeof(*tm));
  1559. /* First, try RFC1123 or RFC850 format: skip the weekday. */
  1560. if ((cp = strchr(date, ','))) {
  1561. ++cp;
  1562. if (*cp != ' ')
  1563. return -1;
  1564. ++cp;
  1565. if (tor_sscanf(cp, "%2u %3s %4u %2u:%2u:%2u GMT",
  1566. &tm_mday, month, &tm_year,
  1567. &tm_hour, &tm_min, &tm_sec) == 6) {
  1568. /* rfc1123-date */
  1569. tm_year -= 1900;
  1570. } else if (tor_sscanf(cp, "%2u-%3s-%2u %2u:%2u:%2u GMT",
  1571. &tm_mday, month, &tm_year,
  1572. &tm_hour, &tm_min, &tm_sec) == 6) {
  1573. /* rfc850-date */
  1574. } else {
  1575. return -1;
  1576. }
  1577. } else {
  1578. /* No comma; possibly asctime() format. */
  1579. if (tor_sscanf(date, "%3s %3s %2u %2u:%2u:%2u %4u",
  1580. wkday, month, &tm_mday,
  1581. &tm_hour, &tm_min, &tm_sec, &tm_year) == 7) {
  1582. tm_year -= 1900;
  1583. } else {
  1584. return -1;
  1585. }
  1586. }
  1587. tm->tm_mday = (int)tm_mday;
  1588. tm->tm_year = (int)tm_year;
  1589. tm->tm_hour = (int)tm_hour;
  1590. tm->tm_min = (int)tm_min;
  1591. tm->tm_sec = (int)tm_sec;
  1592. month[3] = '\0';
  1593. /* Okay, now decode the month. */
  1594. /* set tm->tm_mon to dummy value so the check below fails. */
  1595. tm->tm_mon = -1;
  1596. for (i = 0; i < 12; ++i) {
  1597. if (!strcasecmp(MONTH_NAMES[i], month)) {
  1598. tm->tm_mon = i;
  1599. }
  1600. }
  1601. if (tm->tm_year < 0 ||
  1602. tm->tm_mon < 0 || tm->tm_mon > 11 ||
  1603. tm->tm_mday < 1 || tm->tm_mday > 31 ||
  1604. tm->tm_hour < 0 || tm->tm_hour > 23 ||
  1605. tm->tm_min < 0 || tm->tm_min > 59 ||
  1606. tm->tm_sec < 0 || tm->tm_sec > 60)
  1607. return -1; /* Out of range, or bad month. */
  1608. return 0;
  1609. }
  1610. /** Given an <b>interval</b> in seconds, try to write it to the
  1611. * <b>out_len</b>-byte buffer in <b>out</b> in a human-readable form.
  1612. * Return 0 on success, -1 on failure.
  1613. */
  1614. int
  1615. format_time_interval(char *out, size_t out_len, long interval)
  1616. {
  1617. /* We only report seconds if there's no hours. */
  1618. long sec = 0, min = 0, hour = 0, day = 0;
  1619. /* -LONG_MIN is LONG_MAX + 1, which causes signed overflow */
  1620. if (interval < -LONG_MAX)
  1621. interval = LONG_MAX;
  1622. else if (interval < 0)
  1623. interval = -interval;
  1624. if (interval >= 86400) {
  1625. day = interval / 86400;
  1626. interval %= 86400;
  1627. }
  1628. if (interval >= 3600) {
  1629. hour = interval / 3600;
  1630. interval %= 3600;
  1631. }
  1632. if (interval >= 60) {
  1633. min = interval / 60;
  1634. interval %= 60;
  1635. }
  1636. sec = interval;
  1637. if (day) {
  1638. return tor_snprintf(out, out_len, "%ld days, %ld hours, %ld minutes",
  1639. day, hour, min);
  1640. } else if (hour) {
  1641. return tor_snprintf(out, out_len, "%ld hours, %ld minutes", hour, min);
  1642. } else if (min) {
  1643. return tor_snprintf(out, out_len, "%ld minutes, %ld seconds", min, sec);
  1644. } else {
  1645. return tor_snprintf(out, out_len, "%ld seconds", sec);
  1646. }
  1647. }
  1648. /* =====
  1649. * Cached time
  1650. * ===== */
  1651. #ifndef TIME_IS_FAST
  1652. /** Cached estimate of the current time. Updated around once per second;
  1653. * may be a few seconds off if we are really busy. This is a hack to avoid
  1654. * calling time(NULL) (which not everybody has optimized) on critical paths.
  1655. */
  1656. static time_t cached_approx_time = 0;
  1657. /** Return a cached estimate of the current time from when
  1658. * update_approx_time() was last called. This is a hack to avoid calling
  1659. * time(NULL) on critical paths: please do not even think of calling it
  1660. * anywhere else. */
  1661. time_t
  1662. approx_time(void)
  1663. {
  1664. return cached_approx_time;
  1665. }
  1666. /** Update the cached estimate of the current time. This function SHOULD be
  1667. * called once per second, and MUST be called before the first call to
  1668. * get_approx_time. */
  1669. void
  1670. update_approx_time(time_t now)
  1671. {
  1672. cached_approx_time = now;
  1673. }
  1674. #endif
  1675. /* =====
  1676. * Rate limiting
  1677. * ===== */
  1678. /** If the rate-limiter <b>lim</b> is ready at <b>now</b>, return the number
  1679. * of calls to rate_limit_is_ready (including this one!) since the last time
  1680. * rate_limit_is_ready returned nonzero. Otherwise return 0. */
  1681. static int
  1682. rate_limit_is_ready(ratelim_t *lim, time_t now)
  1683. {
  1684. if (lim->rate + lim->last_allowed <= now) {
  1685. int res = lim->n_calls_since_last_time + 1;
  1686. lim->last_allowed = now;
  1687. lim->n_calls_since_last_time = 0;
  1688. return res;
  1689. } else {
  1690. ++lim->n_calls_since_last_time;
  1691. return 0;
  1692. }
  1693. }
  1694. /** If the rate-limiter <b>lim</b> is ready at <b>now</b>, return a newly
  1695. * allocated string indicating how many messages were suppressed, suitable to
  1696. * append to a log message. Otherwise return NULL. */
  1697. char *
  1698. rate_limit_log(ratelim_t *lim, time_t now)
  1699. {
  1700. int n;
  1701. if ((n = rate_limit_is_ready(lim, now))) {
  1702. if (n == 1) {
  1703. return tor_strdup("");
  1704. } else {
  1705. char *cp=NULL;
  1706. tor_asprintf(&cp,
  1707. " [%d similar message(s) suppressed in last %d seconds]",
  1708. n-1, lim->rate);
  1709. return cp;
  1710. }
  1711. } else {
  1712. return NULL;
  1713. }
  1714. }
  1715. /* =====
  1716. * File helpers
  1717. * ===== */
  1718. /** Write <b>count</b> bytes from <b>buf</b> to <b>fd</b>. <b>isSocket</b>
  1719. * must be 1 if fd was returned by socket() or accept(), and 0 if fd
  1720. * was returned by open(). Return the number of bytes written, or -1
  1721. * on error. Only use if fd is a blocking fd. */
  1722. ssize_t
  1723. write_all(tor_socket_t fd, const char *buf, size_t count, int isSocket)
  1724. {
  1725. size_t written = 0;
  1726. ssize_t result;
  1727. tor_assert(count < SSIZE_MAX);
  1728. while (written != count) {
  1729. if (isSocket)
  1730. result = tor_socket_send(fd, buf+written, count-written, 0);
  1731. else
  1732. result = write((int)fd, buf+written, count-written);
  1733. if (result<0)
  1734. return -1;
  1735. written += result;
  1736. }
  1737. return (ssize_t)count;
  1738. }
  1739. /** Read from <b>fd</b> to <b>buf</b>, until we get <b>count</b> bytes
  1740. * or reach the end of the file. <b>isSocket</b> must be 1 if fd
  1741. * was returned by socket() or accept(), and 0 if fd was returned by
  1742. * open(). Return the number of bytes read, or -1 on error. Only use
  1743. * if fd is a blocking fd. */
  1744. ssize_t
  1745. read_all(tor_socket_t fd, char *buf, size_t count, int isSocket)
  1746. {
  1747. size_t numread = 0;
  1748. ssize_t result;
  1749. if (count > SIZE_T_CEILING || count > SSIZE_MAX) {
  1750. errno = EINVAL;
  1751. return -1;
  1752. }
  1753. while (numread != count) {
  1754. if (isSocket)
  1755. result = tor_socket_recv(fd, buf+numread, count-numread, 0);
  1756. else
  1757. result = read((int)fd, buf+numread, count-numread);
  1758. if (result<0)
  1759. return -1;
  1760. else if (result == 0)
  1761. break;
  1762. numread += result;
  1763. }
  1764. return (ssize_t)numread;
  1765. }
  1766. /*
  1767. * Filesystem operations.
  1768. */
  1769. /** Clean up <b>name</b> so that we can use it in a call to "stat". On Unix,
  1770. * we do nothing. On Windows, we remove a trailing slash, unless the path is
  1771. * the root of a disk. */
  1772. static void
  1773. clean_name_for_stat(char *name)
  1774. {
  1775. #ifdef _WIN32
  1776. size_t len = strlen(name);
  1777. if (!len)
  1778. return;
  1779. if (name[len-1]=='\\' || name[len-1]=='/') {
  1780. if (len == 1 || (len==3 && name[1]==':'))
  1781. return;
  1782. name[len-1]='\0';
  1783. }
  1784. #else
  1785. (void)name;
  1786. #endif
  1787. }
  1788. /** Return:
  1789. * FN_ERROR if filename can't be read, is NULL, or is zero-length,
  1790. * FN_NOENT if it doesn't exist,
  1791. * FN_FILE if it is a non-empty regular file, or a FIFO on unix-like systems,
  1792. * FN_EMPTY for zero-byte regular files,
  1793. * FN_DIR if it's a directory, and
  1794. * FN_ERROR for any other file type.
  1795. * On FN_ERROR and FN_NOENT, sets errno. (errno is not set when FN_ERROR
  1796. * is returned due to an unhandled file type.) */
  1797. file_status_t
  1798. file_status(const char *fname)
  1799. {
  1800. struct stat st;
  1801. char *f;
  1802. int r;
  1803. if (!fname || strlen(fname) == 0) {
  1804. return FN_ERROR;
  1805. }
  1806. f = tor_strdup(fname);
  1807. clean_name_for_stat(f);
  1808. log_debug(LD_FS, "stat()ing %s", f);
  1809. r = stat(sandbox_intern_string(f), &st);
  1810. tor_free(f);
  1811. if (r) {
  1812. if (errno == ENOENT) {
  1813. return FN_NOENT;
  1814. }
  1815. return FN_ERROR;
  1816. }
  1817. if (st.st_mode & S_IFDIR) {
  1818. return FN_DIR;
  1819. } else if (st.st_mode & S_IFREG) {
  1820. if (st.st_size > 0) {
  1821. return FN_FILE;
  1822. } else if (st.st_size == 0) {
  1823. return FN_EMPTY;
  1824. } else {
  1825. return FN_ERROR;
  1826. }
  1827. #ifndef _WIN32
  1828. } else if (st.st_mode & S_IFIFO) {
  1829. return FN_FILE;
  1830. #endif
  1831. } else {
  1832. return FN_ERROR;
  1833. }
  1834. }
  1835. /** Check whether <b>dirname</b> exists and is private. If yes return 0. If
  1836. * it does not exist, and <b>check</b>&CPD_CREATE is set, try to create it
  1837. * and return 0 on success. If it does not exist, and
  1838. * <b>check</b>&CPD_CHECK, and we think we can create it, return 0. Else
  1839. * return -1. If CPD_GROUP_OK is set, then it's okay if the directory
  1840. * is group-readable, but in all cases we create the directory mode 0700.
  1841. * If CPD_GROUP_READ is set, existing directory behaves as CPD_GROUP_OK and
  1842. * if the directory is created it will use mode 0750 with group read
  1843. * permission. Group read privileges also assume execute permission
  1844. * as norm for directories. If CPD_CHECK_MODE_ONLY is set, then we don't
  1845. * alter the directory permissions if they are too permissive:
  1846. * we just return -1.
  1847. * When effective_user is not NULL, check permissions against the given user
  1848. * and its primary group.
  1849. */
  1850. int
  1851. check_private_dir(const char *dirname, cpd_check_t check,
  1852. const char *effective_user)
  1853. {
  1854. int r;
  1855. struct stat st;
  1856. tor_assert(dirname);
  1857. #ifndef _WIN32
  1858. int fd;
  1859. unsigned unwanted_bits = 0;
  1860. const struct passwd *pw = NULL;
  1861. uid_t running_uid;
  1862. gid_t running_gid;
  1863. /*
  1864. * Goal is to harden the implementation by removing any
  1865. * potential for race between stat() and chmod().
  1866. * chmod() accepts filename as argument. If an attacker can move
  1867. * the file between stat() and chmod(), a potential race exists.
  1868. *
  1869. * Several suggestions taken from:
  1870. * https://developer.apple.com/library/mac/documentation/Security/Conceptual/SecureCodingGuide/Articles/RaceConditions.html
  1871. */
  1872. /* Open directory.
  1873. * O_NOFOLLOW to ensure that it does not follow symbolic links */
  1874. fd = open(sandbox_intern_string(dirname), O_NOFOLLOW);
  1875. /* Was there an error? Maybe the directory does not exist? */
  1876. if (fd == -1) {
  1877. if (errno != ENOENT) {
  1878. /* Other directory error */
  1879. log_warn(LD_FS, "Directory %s cannot be read: %s", dirname,
  1880. strerror(errno));
  1881. return -1;
  1882. }
  1883. /* Received ENOENT: Directory does not exist */
  1884. /* Should we create the directory? */
  1885. if (check & CPD_CREATE) {
  1886. log_info(LD_GENERAL, "Creating directory %s", dirname);
  1887. if (check & CPD_GROUP_READ) {
  1888. r = mkdir(dirname, 0750);
  1889. } else {
  1890. r = mkdir(dirname, 0700);
  1891. }
  1892. /* check for mkdir() error */
  1893. if (r) {
  1894. log_warn(LD_FS, "Error creating directory %s: %s", dirname,
  1895. strerror(errno));
  1896. return -1;
  1897. }
  1898. /* we just created the directory. try to open it again.
  1899. * permissions on the directory will be checked again below.*/
  1900. fd = open(sandbox_intern_string(dirname), O_NOFOLLOW);
  1901. if ( fd == -1 ) return -1;
  1902. } else if (!(check & CPD_CHECK)) {
  1903. log_warn(LD_FS, "Directory %s does not exist.", dirname);
  1904. return -1;
  1905. }
  1906. /* XXXX In the case where check==CPD_CHECK, we should look at the
  1907. * parent directory a little harder. */
  1908. return 0;
  1909. }
  1910. tor_assert(fd);
  1911. //f = tor_strdup(dirname);
  1912. //clean_name_for_stat(f);
  1913. log_debug(LD_FS, "stat()ing %s", dirname);
  1914. //r = stat(sandbox_intern_string(f), &st);
  1915. r = fstat(fd, &st);
  1916. if (r == -1) {
  1917. log_warn(LD_FS, "fstat() on directory %s failed.", dirname);
  1918. close(fd);
  1919. return -1;
  1920. }
  1921. //tor_free(f);
  1922. /* check that dirname is a directory */
  1923. if (!(st.st_mode & S_IFDIR)) {
  1924. log_warn(LD_FS, "%s is not a directory", dirname);
  1925. close(fd);
  1926. return -1;
  1927. }
  1928. if (effective_user) {
  1929. /* Look up the user and group information.
  1930. * If we have a problem, bail out. */
  1931. pw = tor_getpwnam(effective_user);
  1932. if (pw == NULL) {
  1933. log_warn(LD_CONFIG, "Error setting configured user: %s not found",
  1934. effective_user);
  1935. return -1;
  1936. }
  1937. running_uid = pw->pw_uid;
  1938. running_gid = pw->pw_gid;
  1939. } else {
  1940. running_uid = getuid();
  1941. running_gid = getgid();
  1942. }
  1943. if (st.st_uid != running_uid) {
  1944. const struct passwd *pw = NULL;
  1945. char *process_ownername = NULL;
  1946. pw = tor_getpwuid(running_uid);
  1947. process_ownername = pw ? tor_strdup(pw->pw_name) : tor_strdup("<unknown>");
  1948. pw = tor_getpwuid(st.st_uid);
  1949. log_warn(LD_FS, "%s is not owned by this user (%s, %d) but by "
  1950. "%s (%d). Perhaps you are running Tor as the wrong user?",
  1951. dirname, process_ownername, (int)running_uid,
  1952. pw ? pw->pw_name : "<unknown>", (int)st.st_uid);
  1953. tor_free(process_ownername);
  1954. close(fd);
  1955. return -1;
  1956. }
  1957. if ( (check & (CPD_GROUP_OK|CPD_GROUP_READ))
  1958. && (st.st_gid != running_gid) && (st.st_gid != 0)) {
  1959. struct group *gr;
  1960. char *process_groupname = NULL;
  1961. gr = getgrgid(running_gid);
  1962. process_groupname = gr ? tor_strdup(gr->gr_name) : tor_strdup("<unknown>");
  1963. gr = getgrgid(st.st_gid);
  1964. log_warn(LD_FS, "%s is not owned by this group (%s, %d) but by group "
  1965. "%s (%d). Are you running Tor as the wrong user?",
  1966. dirname, process_groupname, (int)running_gid,
  1967. gr ? gr->gr_name : "<unknown>", (int)st.st_gid);
  1968. tor_free(process_groupname);
  1969. close(fd);
  1970. return -1;
  1971. }
  1972. if (check & (CPD_GROUP_OK|CPD_GROUP_READ)) {
  1973. unwanted_bits = 0027;
  1974. } else {
  1975. unwanted_bits = 0077;
  1976. }
  1977. if ((st.st_mode & unwanted_bits) != 0) {
  1978. unsigned new_mode;
  1979. if (check & CPD_CHECK_MODE_ONLY) {
  1980. log_warn(LD_FS, "Permissions on directory %s are too permissive.",
  1981. dirname);
  1982. close(fd);
  1983. return -1;
  1984. }
  1985. log_warn(LD_FS, "Fixing permissions on directory %s", dirname);
  1986. new_mode = st.st_mode;
  1987. new_mode |= 0700; /* Owner should have rwx */
  1988. if (check & CPD_GROUP_READ) {
  1989. new_mode |= 0050; /* Group should have rx */
  1990. }
  1991. new_mode &= ~unwanted_bits; /* Clear the bits that we didn't want set...*/
  1992. if (fchmod(fd, new_mode)) {
  1993. log_warn(LD_FS, "Could not chmod directory %s: %s", dirname,
  1994. strerror(errno));
  1995. close(fd);
  1996. return -1;
  1997. } else {
  1998. close(fd);
  1999. return 0;
  2000. }
  2001. }
  2002. close(fd);
  2003. #else
  2004. /* Win32 case: we can't open() a directory. */
  2005. (void)effective_user;
  2006. char *f = tor_strdup(dirname);
  2007. clean_name_for_stat(f);
  2008. log_debug(LD_FS, "stat()ing %s", f);
  2009. r = stat(sandbox_intern_string(f), &st);
  2010. tor_free(f);
  2011. if (r) {
  2012. if (errno != ENOENT) {
  2013. log_warn(LD_FS, "Directory %s cannot be read: %s", dirname,
  2014. strerror(errno));
  2015. return -1;
  2016. }
  2017. if (check & CPD_CREATE) {
  2018. log_info(LD_GENERAL, "Creating directory %s", dirname);
  2019. r = mkdir(dirname);
  2020. if (r) {
  2021. log_warn(LD_FS, "Error creating directory %s: %s", dirname,
  2022. strerror(errno));
  2023. return -1;
  2024. }
  2025. } else if (!(check & CPD_CHECK)) {
  2026. log_warn(LD_FS, "Directory %s does not exist.", dirname);
  2027. return -1;
  2028. }
  2029. return 0;
  2030. }
  2031. if (!(st.st_mode & S_IFDIR)) {
  2032. log_warn(LD_FS, "%s is not a directory", dirname);
  2033. return -1;
  2034. }
  2035. #endif
  2036. return 0;
  2037. }
  2038. /** Create a file named <b>fname</b> with the contents <b>str</b>. Overwrite
  2039. * the previous <b>fname</b> if possible. Return 0 on success, -1 on failure.
  2040. *
  2041. * This function replaces the old file atomically, if possible. This
  2042. * function, and all other functions in util.c that create files, create them
  2043. * with mode 0600.
  2044. */
  2045. int
  2046. write_str_to_file(const char *fname, const char *str, int bin)
  2047. {
  2048. #ifdef _WIN32
  2049. if (!bin && strchr(str, '\r')) {
  2050. log_warn(LD_BUG,
  2051. "We're writing a text string that already contains a CR to %s",
  2052. escaped(fname));
  2053. }
  2054. #endif
  2055. return write_bytes_to_file(fname, str, strlen(str), bin);
  2056. }
  2057. /** Represents a file that we're writing to, with support for atomic commit:
  2058. * we can write into a temporary file, and either remove the file on
  2059. * failure, or replace the original file on success. */
  2060. struct open_file_t {
  2061. char *tempname; /**< Name of the temporary file. */
  2062. char *filename; /**< Name of the original file. */
  2063. unsigned rename_on_close:1; /**< Are we using the temporary file or not? */
  2064. unsigned binary:1; /**< Did we open in binary mode? */
  2065. int fd; /**< fd for the open file. */
  2066. FILE *stdio_file; /**< stdio wrapper for <b>fd</b>. */
  2067. };
  2068. /** Try to start writing to the file in <b>fname</b>, passing the flags
  2069. * <b>open_flags</b> to the open() syscall, creating the file (if needed) with
  2070. * access value <b>mode</b>. If the O_APPEND flag is set, we append to the
  2071. * original file. Otherwise, we open a new temporary file in the same
  2072. * directory, and either replace the original or remove the temporary file
  2073. * when we're done.
  2074. *
  2075. * Return the fd for the newly opened file, and store working data in
  2076. * *<b>data_out</b>. The caller should not close the fd manually:
  2077. * instead, call finish_writing_to_file() or abort_writing_to_file().
  2078. * Returns -1 on failure.
  2079. *
  2080. * NOTE: When not appending, the flags O_CREAT and O_TRUNC are treated
  2081. * as true and the flag O_EXCL is treated as false.
  2082. *
  2083. * NOTE: Ordinarily, O_APPEND means "seek to the end of the file before each
  2084. * write()". We don't do that.
  2085. */
  2086. int
  2087. start_writing_to_file(const char *fname, int open_flags, int mode,
  2088. open_file_t **data_out)
  2089. {
  2090. open_file_t *new_file = tor_malloc_zero(sizeof(open_file_t));
  2091. const char *open_name;
  2092. int append = 0;
  2093. tor_assert(fname);
  2094. tor_assert(data_out);
  2095. #if (O_BINARY != 0 && O_TEXT != 0)
  2096. tor_assert((open_flags & (O_BINARY|O_TEXT)) != 0);
  2097. #endif
  2098. new_file->fd = -1;
  2099. new_file->filename = tor_strdup(fname);
  2100. if (open_flags & O_APPEND) {
  2101. open_name = fname;
  2102. new_file->rename_on_close = 0;
  2103. append = 1;
  2104. open_flags &= ~O_APPEND;
  2105. } else {
  2106. tor_asprintf(&new_file->tempname, "%s.tmp", fname);
  2107. open_name = new_file->tempname;
  2108. /* We always replace an existing temporary file if there is one. */
  2109. open_flags |= O_CREAT|O_TRUNC;
  2110. open_flags &= ~O_EXCL;
  2111. new_file->rename_on_close = 1;
  2112. }
  2113. #if O_BINARY != 0
  2114. if (open_flags & O_BINARY)
  2115. new_file->binary = 1;
  2116. #endif
  2117. new_file->fd = tor_open_cloexec(open_name, open_flags, mode);
  2118. if (new_file->fd < 0) {
  2119. log_warn(LD_FS, "Couldn't open \"%s\" (%s) for writing: %s",
  2120. open_name, fname, strerror(errno));
  2121. goto err;
  2122. }
  2123. if (append) {
  2124. if (tor_fd_seekend(new_file->fd) < 0) {
  2125. log_warn(LD_FS, "Couldn't seek to end of file \"%s\": %s", open_name,
  2126. strerror(errno));
  2127. goto err;
  2128. }
  2129. }
  2130. *data_out = new_file;
  2131. return new_file->fd;
  2132. err:
  2133. if (new_file->fd >= 0)
  2134. close(new_file->fd);
  2135. *data_out = NULL;
  2136. tor_free(new_file->filename);
  2137. tor_free(new_file->tempname);
  2138. tor_free(new_file);
  2139. return -1;
  2140. }
  2141. /** Given <b>file_data</b> from start_writing_to_file(), return a stdio FILE*
  2142. * that can be used to write to the same file. The caller should not mix
  2143. * stdio calls with non-stdio calls. */
  2144. FILE *
  2145. fdopen_file(open_file_t *file_data)
  2146. {
  2147. tor_assert(file_data);
  2148. if (file_data->stdio_file)
  2149. return file_data->stdio_file;
  2150. tor_assert(file_data->fd >= 0);
  2151. if (!(file_data->stdio_file = fdopen(file_data->fd,
  2152. file_data->binary?"ab":"a"))) {
  2153. log_warn(LD_FS, "Couldn't fdopen \"%s\" [%d]: %s", file_data->filename,
  2154. file_data->fd, strerror(errno));
  2155. }
  2156. return file_data->stdio_file;
  2157. }
  2158. /** Combines start_writing_to_file with fdopen_file(): arguments are as
  2159. * for start_writing_to_file, but */
  2160. FILE *
  2161. start_writing_to_stdio_file(const char *fname, int open_flags, int mode,
  2162. open_file_t **data_out)
  2163. {
  2164. FILE *res;
  2165. if (start_writing_to_file(fname, open_flags, mode, data_out)<0)
  2166. return NULL;
  2167. if (!(res = fdopen_file(*data_out))) {
  2168. abort_writing_to_file(*data_out);
  2169. *data_out = NULL;
  2170. }
  2171. return res;
  2172. }
  2173. /** Helper function: close and free the underlying file and memory in
  2174. * <b>file_data</b>. If we were writing into a temporary file, then delete
  2175. * that file (if abort_write is true) or replaces the target file with
  2176. * the temporary file (if abort_write is false). */
  2177. static int
  2178. finish_writing_to_file_impl(open_file_t *file_data, int abort_write)
  2179. {
  2180. int r = 0;
  2181. tor_assert(file_data && file_data->filename);
  2182. if (file_data->stdio_file) {
  2183. if (fclose(file_data->stdio_file)) {
  2184. log_warn(LD_FS, "Error closing \"%s\": %s", file_data->filename,
  2185. strerror(errno));
  2186. abort_write = r = -1;
  2187. }
  2188. } else if (file_data->fd >= 0 && close(file_data->fd) < 0) {
  2189. log_warn(LD_FS, "Error flushing \"%s\": %s", file_data->filename,
  2190. strerror(errno));
  2191. abort_write = r = -1;
  2192. }
  2193. if (file_data->rename_on_close) {
  2194. tor_assert(file_data->tempname && file_data->filename);
  2195. if (abort_write) {
  2196. int res = unlink(file_data->tempname);
  2197. if (res != 0) {
  2198. /* We couldn't unlink and we'll leave a mess behind */
  2199. log_warn(LD_FS, "Failed to unlink %s: %s",
  2200. file_data->tempname, strerror(errno));
  2201. r = -1;
  2202. }
  2203. } else {
  2204. tor_assert(strcmp(file_data->filename, file_data->tempname));
  2205. if (replace_file(file_data->tempname, file_data->filename)) {
  2206. log_warn(LD_FS, "Error replacing \"%s\": %s", file_data->filename,
  2207. strerror(errno));
  2208. r = -1;
  2209. }
  2210. }
  2211. }
  2212. tor_free(file_data->filename);
  2213. tor_free(file_data->tempname);
  2214. tor_free(file_data);
  2215. return r;
  2216. }
  2217. /** Finish writing to <b>file_data</b>: close the file handle, free memory as
  2218. * needed, and if using a temporary file, replace the original file with
  2219. * the temporary file. */
  2220. int
  2221. finish_writing_to_file(open_file_t *file_data)
  2222. {
  2223. return finish_writing_to_file_impl(file_data, 0);
  2224. }
  2225. /** Finish writing to <b>file_data</b>: close the file handle, free memory as
  2226. * needed, and if using a temporary file, delete it. */
  2227. int
  2228. abort_writing_to_file(open_file_t *file_data)
  2229. {
  2230. return finish_writing_to_file_impl(file_data, 1);
  2231. }
  2232. /** Helper: given a set of flags as passed to open(2), open the file
  2233. * <b>fname</b> and write all the sized_chunk_t structs in <b>chunks</b> to
  2234. * the file. Do so as atomically as possible e.g. by opening temp files and
  2235. * renaming. */
  2236. static int
  2237. write_chunks_to_file_impl(const char *fname, const smartlist_t *chunks,
  2238. int open_flags)
  2239. {
  2240. open_file_t *file = NULL;
  2241. int fd;
  2242. ssize_t result;
  2243. fd = start_writing_to_file(fname, open_flags, 0600, &file);
  2244. if (fd<0)
  2245. return -1;
  2246. SMARTLIST_FOREACH(chunks, sized_chunk_t *, chunk,
  2247. {
  2248. result = write_all(fd, chunk->bytes, chunk->len, 0);
  2249. if (result < 0) {
  2250. log_warn(LD_FS, "Error writing to \"%s\": %s", fname,
  2251. strerror(errno));
  2252. goto err;
  2253. }
  2254. tor_assert((size_t)result == chunk->len);
  2255. });
  2256. return finish_writing_to_file(file);
  2257. err:
  2258. abort_writing_to_file(file);
  2259. return -1;
  2260. }
  2261. /** Given a smartlist of sized_chunk_t, write them to a file
  2262. * <b>fname</b>, overwriting or creating the file as necessary.
  2263. * If <b>no_tempfile</b> is 0 then the file will be written
  2264. * atomically. */
  2265. int
  2266. write_chunks_to_file(const char *fname, const smartlist_t *chunks, int bin,
  2267. int no_tempfile)
  2268. {
  2269. int flags = OPEN_FLAGS_REPLACE|(bin?O_BINARY:O_TEXT);
  2270. if (no_tempfile) {
  2271. /* O_APPEND stops write_chunks_to_file from using tempfiles */
  2272. flags |= O_APPEND;
  2273. }
  2274. return write_chunks_to_file_impl(fname, chunks, flags);
  2275. }
  2276. /** Write <b>len</b> bytes, starting at <b>str</b>, to <b>fname</b>
  2277. using the open() flags passed in <b>flags</b>. */
  2278. static int
  2279. write_bytes_to_file_impl(const char *fname, const char *str, size_t len,
  2280. int flags)
  2281. {
  2282. int r;
  2283. sized_chunk_t c = { str, len };
  2284. smartlist_t *chunks = smartlist_new();
  2285. smartlist_add(chunks, &c);
  2286. r = write_chunks_to_file_impl(fname, chunks, flags);
  2287. smartlist_free(chunks);
  2288. return r;
  2289. }
  2290. /** As write_str_to_file, but does not assume a NUL-terminated
  2291. * string. Instead, we write <b>len</b> bytes, starting at <b>str</b>. */
  2292. MOCK_IMPL(int,
  2293. write_bytes_to_file,(const char *fname, const char *str, size_t len,
  2294. int bin))
  2295. {
  2296. return write_bytes_to_file_impl(fname, str, len,
  2297. OPEN_FLAGS_REPLACE|(bin?O_BINARY:O_TEXT));
  2298. }
  2299. /** As write_bytes_to_file, but if the file already exists, append the bytes
  2300. * to the end of the file instead of overwriting it. */
  2301. int
  2302. append_bytes_to_file(const char *fname, const char *str, size_t len,
  2303. int bin)
  2304. {
  2305. return write_bytes_to_file_impl(fname, str, len,
  2306. OPEN_FLAGS_APPEND|(bin?O_BINARY:O_TEXT));
  2307. }
  2308. /** Like write_str_to_file(), but also return -1 if there was a file
  2309. already residing in <b>fname</b>. */
  2310. int
  2311. write_bytes_to_new_file(const char *fname, const char *str, size_t len,
  2312. int bin)
  2313. {
  2314. return write_bytes_to_file_impl(fname, str, len,
  2315. OPEN_FLAGS_DONT_REPLACE|
  2316. (bin?O_BINARY:O_TEXT));
  2317. }
  2318. /**
  2319. * Read the contents of the open file <b>fd</b> presuming it is a FIFO
  2320. * (or similar) file descriptor for which the size of the file isn't
  2321. * known ahead of time. Return NULL on failure, and a NUL-terminated
  2322. * string on success. On success, set <b>sz_out</b> to the number of
  2323. * bytes read.
  2324. */
  2325. char *
  2326. read_file_to_str_until_eof(int fd, size_t max_bytes_to_read, size_t *sz_out)
  2327. {
  2328. ssize_t r;
  2329. size_t pos = 0;
  2330. char *string = NULL;
  2331. size_t string_max = 0;
  2332. if (max_bytes_to_read+1 >= SIZE_T_CEILING) {
  2333. errno = EINVAL;
  2334. return NULL;
  2335. }
  2336. do {
  2337. /* XXXX This "add 1K" approach is a little goofy; if we care about
  2338. * performance here, we should be doubling. But in practice we shouldn't
  2339. * be using this function on big files anyway. */
  2340. string_max = pos + 1024;
  2341. if (string_max > max_bytes_to_read)
  2342. string_max = max_bytes_to_read + 1;
  2343. string = tor_realloc(string, string_max);
  2344. r = read(fd, string + pos, string_max - pos - 1);
  2345. if (r < 0) {
  2346. int save_errno = errno;
  2347. tor_free(string);
  2348. errno = save_errno;
  2349. return NULL;
  2350. }
  2351. pos += r;
  2352. } while (r > 0 && pos < max_bytes_to_read);
  2353. tor_assert(pos < string_max);
  2354. *sz_out = pos;
  2355. string[pos] = '\0';
  2356. return string;
  2357. }
  2358. /** Read the contents of <b>filename</b> into a newly allocated
  2359. * string; return the string on success or NULL on failure.
  2360. *
  2361. * If <b>stat_out</b> is provided, store the result of stat()ing the
  2362. * file into <b>stat_out</b>.
  2363. *
  2364. * If <b>flags</b> &amp; RFTS_BIN, open the file in binary mode.
  2365. * If <b>flags</b> &amp; RFTS_IGNORE_MISSING, don't warn if the file
  2366. * doesn't exist.
  2367. */
  2368. /*
  2369. * This function <em>may</em> return an erroneous result if the file
  2370. * is modified while it is running, but must not crash or overflow.
  2371. * Right now, the error case occurs when the file length grows between
  2372. * the call to stat and the call to read_all: the resulting string will
  2373. * be truncated.
  2374. */
  2375. char *
  2376. read_file_to_str(const char *filename, int flags, struct stat *stat_out)
  2377. {
  2378. int fd; /* router file */
  2379. struct stat statbuf;
  2380. char *string;
  2381. ssize_t r;
  2382. int bin = flags & RFTS_BIN;
  2383. tor_assert(filename);
  2384. fd = tor_open_cloexec(filename,O_RDONLY|(bin?O_BINARY:O_TEXT),0);
  2385. if (fd<0) {
  2386. int severity = LOG_WARN;
  2387. int save_errno = errno;
  2388. if (errno == ENOENT && (flags & RFTS_IGNORE_MISSING))
  2389. severity = LOG_INFO;
  2390. log_fn(severity, LD_FS,"Could not open \"%s\": %s",filename,
  2391. strerror(errno));
  2392. errno = save_errno;
  2393. return NULL;
  2394. }
  2395. if (fstat(fd, &statbuf)<0) {
  2396. int save_errno = errno;
  2397. close(fd);
  2398. log_warn(LD_FS,"Could not fstat \"%s\".",filename);
  2399. errno = save_errno;
  2400. return NULL;
  2401. }
  2402. #ifndef _WIN32
  2403. /** When we detect that we're reading from a FIFO, don't read more than
  2404. * this many bytes. It's insane overkill for most uses. */
  2405. #define FIFO_READ_MAX (1024*1024)
  2406. if (S_ISFIFO(statbuf.st_mode)) {
  2407. size_t sz = 0;
  2408. string = read_file_to_str_until_eof(fd, FIFO_READ_MAX, &sz);
  2409. int save_errno = errno;
  2410. if (string && stat_out) {
  2411. statbuf.st_size = sz;
  2412. memcpy(stat_out, &statbuf, sizeof(struct stat));
  2413. }
  2414. close(fd);
  2415. if (!string)
  2416. errno = save_errno;
  2417. return string;
  2418. }
  2419. #endif
  2420. if ((uint64_t)(statbuf.st_size)+1 >= SIZE_T_CEILING) {
  2421. close(fd);
  2422. errno = EINVAL;
  2423. return NULL;
  2424. }
  2425. string = tor_malloc((size_t)(statbuf.st_size+1));
  2426. r = read_all(fd,string,(size_t)statbuf.st_size,0);
  2427. if (r<0) {
  2428. int save_errno = errno;
  2429. log_warn(LD_FS,"Error reading from file \"%s\": %s", filename,
  2430. strerror(errno));
  2431. tor_free(string);
  2432. close(fd);
  2433. errno = save_errno;
  2434. return NULL;
  2435. }
  2436. string[r] = '\0'; /* NUL-terminate the result. */
  2437. #if defined(_WIN32) || defined(__CYGWIN__)
  2438. if (!bin && strchr(string, '\r')) {
  2439. log_debug(LD_FS, "We didn't convert CRLF to LF as well as we hoped "
  2440. "when reading %s. Coping.",
  2441. filename);
  2442. tor_strstrip(string, "\r");
  2443. r = strlen(string);
  2444. }
  2445. if (!bin) {
  2446. statbuf.st_size = (size_t) r;
  2447. } else
  2448. #endif
  2449. if (r != statbuf.st_size) {
  2450. /* Unless we're using text mode on win32, we'd better have an exact
  2451. * match for size. */
  2452. int save_errno = errno;
  2453. log_warn(LD_FS,"Could read only %d of %ld bytes of file \"%s\".",
  2454. (int)r, (long)statbuf.st_size,filename);
  2455. tor_free(string);
  2456. close(fd);
  2457. errno = save_errno;
  2458. return NULL;
  2459. }
  2460. close(fd);
  2461. if (stat_out) {
  2462. memcpy(stat_out, &statbuf, sizeof(struct stat));
  2463. }
  2464. return string;
  2465. }
  2466. #define TOR_ISODIGIT(c) ('0' <= (c) && (c) <= '7')
  2467. /** Given a c-style double-quoted escaped string in <b>s</b>, extract and
  2468. * decode its contents into a newly allocated string. On success, assign this
  2469. * string to *<b>result</b>, assign its length to <b>size_out</b> (if
  2470. * provided), and return a pointer to the position in <b>s</b> immediately
  2471. * after the string. On failure, return NULL.
  2472. */
  2473. static const char *
  2474. unescape_string(const char *s, char **result, size_t *size_out)
  2475. {
  2476. const char *cp;
  2477. char *out;
  2478. if (s[0] != '\"')
  2479. return NULL;
  2480. cp = s+1;
  2481. while (1) {
  2482. switch (*cp) {
  2483. case '\0':
  2484. case '\n':
  2485. return NULL;
  2486. case '\"':
  2487. goto end_of_loop;
  2488. case '\\':
  2489. if (cp[1] == 'x' || cp[1] == 'X') {
  2490. if (!(TOR_ISXDIGIT(cp[2]) && TOR_ISXDIGIT(cp[3])))
  2491. return NULL;
  2492. cp += 4;
  2493. } else if (TOR_ISODIGIT(cp[1])) {
  2494. cp += 2;
  2495. if (TOR_ISODIGIT(*cp)) ++cp;
  2496. if (TOR_ISODIGIT(*cp)) ++cp;
  2497. } else if (cp[1] == 'n' || cp[1] == 'r' || cp[1] == 't' || cp[1] == '"'
  2498. || cp[1] == '\\' || cp[1] == '\'') {
  2499. cp += 2;
  2500. } else {
  2501. return NULL;
  2502. }
  2503. break;
  2504. default:
  2505. ++cp;
  2506. break;
  2507. }
  2508. }
  2509. end_of_loop:
  2510. out = *result = tor_malloc(cp-s + 1);
  2511. cp = s+1;
  2512. while (1) {
  2513. switch (*cp)
  2514. {
  2515. case '\"':
  2516. *out = '\0';
  2517. if (size_out) *size_out = out - *result;
  2518. return cp+1;
  2519. case '\0':
  2520. tor_fragile_assert();
  2521. tor_free(*result);
  2522. return NULL;
  2523. case '\\':
  2524. switch (cp[1])
  2525. {
  2526. case 'n': *out++ = '\n'; cp += 2; break;
  2527. case 'r': *out++ = '\r'; cp += 2; break;
  2528. case 't': *out++ = '\t'; cp += 2; break;
  2529. case 'x': case 'X':
  2530. {
  2531. int x1, x2;
  2532. x1 = hex_decode_digit(cp[2]);
  2533. x2 = hex_decode_digit(cp[3]);
  2534. if (x1 == -1 || x2 == -1) {
  2535. tor_free(*result);
  2536. return NULL;
  2537. }
  2538. *out++ = ((x1<<4) + x2);
  2539. cp += 4;
  2540. }
  2541. break;
  2542. case '0': case '1': case '2': case '3': case '4': case '5':
  2543. case '6': case '7':
  2544. {
  2545. int n = cp[1]-'0';
  2546. cp += 2;
  2547. if (TOR_ISODIGIT(*cp)) { n = n*8 + *cp-'0'; cp++; }
  2548. if (TOR_ISODIGIT(*cp)) { n = n*8 + *cp-'0'; cp++; }
  2549. if (n > 255) { tor_free(*result); return NULL; }
  2550. *out++ = (char)n;
  2551. }
  2552. break;
  2553. case '\'':
  2554. case '\"':
  2555. case '\\':
  2556. case '\?':
  2557. *out++ = cp[1];
  2558. cp += 2;
  2559. break;
  2560. default:
  2561. tor_free(*result); return NULL;
  2562. }
  2563. break;
  2564. default:
  2565. *out++ = *cp++;
  2566. }
  2567. }
  2568. }
  2569. /** Given a string containing part of a configuration file or similar format,
  2570. * advance past comments and whitespace and try to parse a single line. If we
  2571. * parse a line successfully, set *<b>key_out</b> to a new string holding the
  2572. * key portion and *<b>value_out</b> to a new string holding the value portion
  2573. * of the line, and return a pointer to the start of the next line. If we run
  2574. * out of data, return a pointer to the end of the string. If we encounter an
  2575. * error, return NULL and set *<b>err_out</b> (if provided) to an error
  2576. * message.
  2577. */
  2578. const char *
  2579. parse_config_line_from_str_verbose(const char *line, char **key_out,
  2580. char **value_out,
  2581. const char **err_out)
  2582. {
  2583. /*
  2584. See torrc_format.txt for a description of the (silly) format this parses.
  2585. */
  2586. const char *key, *val, *cp;
  2587. int continuation = 0;
  2588. tor_assert(key_out);
  2589. tor_assert(value_out);
  2590. *key_out = *value_out = NULL;
  2591. key = val = NULL;
  2592. /* Skip until the first keyword. */
  2593. while (1) {
  2594. while (TOR_ISSPACE(*line))
  2595. ++line;
  2596. if (*line == '#') {
  2597. while (*line && *line != '\n')
  2598. ++line;
  2599. } else {
  2600. break;
  2601. }
  2602. }
  2603. if (!*line) { /* End of string? */
  2604. *key_out = *value_out = NULL;
  2605. return line;
  2606. }
  2607. /* Skip until the next space or \ followed by newline. */
  2608. key = line;
  2609. while (*line && !TOR_ISSPACE(*line) && *line != '#' &&
  2610. ! (line[0] == '\\' && line[1] == '\n'))
  2611. ++line;
  2612. *key_out = tor_strndup(key, line-key);
  2613. /* Skip until the value. */
  2614. while (*line == ' ' || *line == '\t')
  2615. ++line;
  2616. val = line;
  2617. /* Find the end of the line. */
  2618. if (*line == '\"') { // XXX No continuation handling is done here
  2619. if (!(line = unescape_string(line, value_out, NULL))) {
  2620. if (err_out)
  2621. *err_out = "Invalid escape sequence in quoted string";
  2622. return NULL;
  2623. }
  2624. while (*line == ' ' || *line == '\t')
  2625. ++line;
  2626. if (*line && *line != '#' && *line != '\n') {
  2627. if (err_out)
  2628. *err_out = "Excess data after quoted string";
  2629. return NULL;
  2630. }
  2631. } else {
  2632. /* Look for the end of the line. */
  2633. while (*line && *line != '\n' && (*line != '#' || continuation)) {
  2634. if (*line == '\\' && line[1] == '\n') {
  2635. continuation = 1;
  2636. line += 2;
  2637. } else if (*line == '#') {
  2638. do {
  2639. ++line;
  2640. } while (*line && *line != '\n');
  2641. if (*line == '\n')
  2642. ++line;
  2643. } else {
  2644. ++line;
  2645. }
  2646. }
  2647. if (*line == '\n') {
  2648. cp = line++;
  2649. } else {
  2650. cp = line;
  2651. }
  2652. /* Now back cp up to be the last nonspace character */
  2653. while (cp>val && TOR_ISSPACE(*(cp-1)))
  2654. --cp;
  2655. tor_assert(cp >= val);
  2656. /* Now copy out and decode the value. */
  2657. *value_out = tor_strndup(val, cp-val);
  2658. if (continuation) {
  2659. char *v_out, *v_in;
  2660. v_out = v_in = *value_out;
  2661. while (*v_in) {
  2662. if (*v_in == '#') {
  2663. do {
  2664. ++v_in;
  2665. } while (*v_in && *v_in != '\n');
  2666. if (*v_in == '\n')
  2667. ++v_in;
  2668. } else if (v_in[0] == '\\' && v_in[1] == '\n') {
  2669. v_in += 2;
  2670. } else {
  2671. *v_out++ = *v_in++;
  2672. }
  2673. }
  2674. *v_out = '\0';
  2675. }
  2676. }
  2677. if (*line == '#') {
  2678. do {
  2679. ++line;
  2680. } while (*line && *line != '\n');
  2681. }
  2682. while (TOR_ISSPACE(*line)) ++line;
  2683. return line;
  2684. }
  2685. /** Expand any homedir prefix on <b>filename</b>; return a newly allocated
  2686. * string. */
  2687. char *
  2688. expand_filename(const char *filename)
  2689. {
  2690. tor_assert(filename);
  2691. #ifdef _WIN32
  2692. /* Might consider using GetFullPathName() as described here:
  2693. * http://etutorials.org/Programming/secure+programming/Chapter+3.+Input+Validation/3.7+Validating+Filenames+and+Paths/
  2694. */
  2695. return tor_strdup(filename);
  2696. #else
  2697. if (*filename == '~') {
  2698. char *home, *result=NULL;
  2699. const char *rest;
  2700. if (filename[1] == '/' || filename[1] == '\0') {
  2701. home = getenv("HOME");
  2702. if (!home) {
  2703. log_warn(LD_CONFIG, "Couldn't find $HOME environment variable while "
  2704. "expanding \"%s\"; defaulting to \"\".", filename);
  2705. home = tor_strdup("");
  2706. } else {
  2707. home = tor_strdup(home);
  2708. }
  2709. rest = strlen(filename)>=2?(filename+2):"";
  2710. } else {
  2711. #ifdef HAVE_PWD_H
  2712. char *username, *slash;
  2713. slash = strchr(filename, '/');
  2714. if (slash)
  2715. username = tor_strndup(filename+1,slash-filename-1);
  2716. else
  2717. username = tor_strdup(filename+1);
  2718. if (!(home = get_user_homedir(username))) {
  2719. log_warn(LD_CONFIG,"Couldn't get homedir for \"%s\"",username);
  2720. tor_free(username);
  2721. return NULL;
  2722. }
  2723. tor_free(username);
  2724. rest = slash ? (slash+1) : "";
  2725. #else
  2726. log_warn(LD_CONFIG, "Couldn't expand homedir on system without pwd.h");
  2727. return tor_strdup(filename);
  2728. #endif
  2729. }
  2730. tor_assert(home);
  2731. /* Remove trailing slash. */
  2732. if (strlen(home)>1 && !strcmpend(home,PATH_SEPARATOR)) {
  2733. home[strlen(home)-1] = '\0';
  2734. }
  2735. tor_asprintf(&result,"%s"PATH_SEPARATOR"%s",home,rest);
  2736. tor_free(home);
  2737. return result;
  2738. } else {
  2739. return tor_strdup(filename);
  2740. }
  2741. #endif
  2742. }
  2743. #define MAX_SCANF_WIDTH 9999
  2744. /** Helper: given an ASCII-encoded decimal digit, return its numeric value.
  2745. * NOTE: requires that its input be in-bounds. */
  2746. static int
  2747. digit_to_num(char d)
  2748. {
  2749. int num = ((int)d) - (int)'0';
  2750. tor_assert(num <= 9 && num >= 0);
  2751. return num;
  2752. }
  2753. /** Helper: Read an unsigned int from *<b>bufp</b> of up to <b>width</b>
  2754. * characters. (Handle arbitrary width if <b>width</b> is less than 0.) On
  2755. * success, store the result in <b>out</b>, advance bufp to the next
  2756. * character, and return 0. On failure, return -1. */
  2757. static int
  2758. scan_unsigned(const char **bufp, unsigned long *out, int width, int base)
  2759. {
  2760. unsigned long result = 0;
  2761. int scanned_so_far = 0;
  2762. const int hex = base==16;
  2763. tor_assert(base == 10 || base == 16);
  2764. if (!bufp || !*bufp || !out)
  2765. return -1;
  2766. if (width<0)
  2767. width=MAX_SCANF_WIDTH;
  2768. while (**bufp && (hex?TOR_ISXDIGIT(**bufp):TOR_ISDIGIT(**bufp))
  2769. && scanned_so_far < width) {
  2770. int digit = hex?hex_decode_digit(*(*bufp)++):digit_to_num(*(*bufp)++);
  2771. // Check for overflow beforehand, without actually causing any overflow
  2772. // This preserves functionality on compilers that don't wrap overflow
  2773. // (i.e. that trap or optimise away overflow)
  2774. // result * base + digit > ULONG_MAX
  2775. // result * base > ULONG_MAX - digit
  2776. if (result > (ULONG_MAX - digit)/base)
  2777. return -1; /* Processing this digit would overflow */
  2778. result = result * base + digit;
  2779. ++scanned_so_far;
  2780. }
  2781. if (!scanned_so_far) /* No actual digits scanned */
  2782. return -1;
  2783. *out = result;
  2784. return 0;
  2785. }
  2786. /** Helper: Read an signed int from *<b>bufp</b> of up to <b>width</b>
  2787. * characters. (Handle arbitrary width if <b>width</b> is less than 0.) On
  2788. * success, store the result in <b>out</b>, advance bufp to the next
  2789. * character, and return 0. On failure, return -1. */
  2790. static int
  2791. scan_signed(const char **bufp, long *out, int width)
  2792. {
  2793. int neg = 0;
  2794. unsigned long result = 0;
  2795. if (!bufp || !*bufp || !out)
  2796. return -1;
  2797. if (width<0)
  2798. width=MAX_SCANF_WIDTH;
  2799. if (**bufp == '-') {
  2800. neg = 1;
  2801. ++*bufp;
  2802. --width;
  2803. }
  2804. if (scan_unsigned(bufp, &result, width, 10) < 0)
  2805. return -1;
  2806. if (neg && result > 0) {
  2807. if (result > ((unsigned long)LONG_MAX) + 1)
  2808. return -1; /* Underflow */
  2809. // Avoid overflow on the cast to signed long when result is LONG_MIN
  2810. // by subtracting 1 from the unsigned long positive value,
  2811. // then, after it has been cast to signed and negated,
  2812. // subtracting the original 1 (the double-subtraction is intentional).
  2813. // Otherwise, the cast to signed could cause a temporary long
  2814. // to equal LONG_MAX + 1, which is undefined.
  2815. // We avoid underflow on the subtraction by treating -0 as positive.
  2816. *out = (-(long)(result - 1)) - 1;
  2817. } else {
  2818. if (result > LONG_MAX)
  2819. return -1; /* Overflow */
  2820. *out = (long)result;
  2821. }
  2822. return 0;
  2823. }
  2824. /** Helper: Read a decimal-formatted double from *<b>bufp</b> of up to
  2825. * <b>width</b> characters. (Handle arbitrary width if <b>width</b> is less
  2826. * than 0.) On success, store the result in <b>out</b>, advance bufp to the
  2827. * next character, and return 0. On failure, return -1. */
  2828. static int
  2829. scan_double(const char **bufp, double *out, int width)
  2830. {
  2831. int neg = 0;
  2832. double result = 0;
  2833. int scanned_so_far = 0;
  2834. if (!bufp || !*bufp || !out)
  2835. return -1;
  2836. if (width<0)
  2837. width=MAX_SCANF_WIDTH;
  2838. if (**bufp == '-') {
  2839. neg = 1;
  2840. ++*bufp;
  2841. }
  2842. while (**bufp && TOR_ISDIGIT(**bufp) && scanned_so_far < width) {
  2843. const int digit = digit_to_num(*(*bufp)++);
  2844. result = result * 10 + digit;
  2845. ++scanned_so_far;
  2846. }
  2847. if (**bufp == '.') {
  2848. double fracval = 0, denominator = 1;
  2849. ++*bufp;
  2850. ++scanned_so_far;
  2851. while (**bufp && TOR_ISDIGIT(**bufp) && scanned_so_far < width) {
  2852. const int digit = digit_to_num(*(*bufp)++);
  2853. fracval = fracval * 10 + digit;
  2854. denominator *= 10;
  2855. ++scanned_so_far;
  2856. }
  2857. result += fracval / denominator;
  2858. }
  2859. if (!scanned_so_far) /* No actual digits scanned */
  2860. return -1;
  2861. *out = neg ? -result : result;
  2862. return 0;
  2863. }
  2864. /** Helper: copy up to <b>width</b> non-space characters from <b>bufp</b> to
  2865. * <b>out</b>. Make sure <b>out</b> is nul-terminated. Advance <b>bufp</b>
  2866. * to the next non-space character or the EOS. */
  2867. static int
  2868. scan_string(const char **bufp, char *out, int width)
  2869. {
  2870. int scanned_so_far = 0;
  2871. if (!bufp || !out || width < 0)
  2872. return -1;
  2873. while (**bufp && ! TOR_ISSPACE(**bufp) && scanned_so_far < width) {
  2874. *out++ = *(*bufp)++;
  2875. ++scanned_so_far;
  2876. }
  2877. *out = '\0';
  2878. return 0;
  2879. }
  2880. /** Locale-independent, minimal, no-surprises scanf variant, accepting only a
  2881. * restricted pattern format. For more info on what it supports, see
  2882. * tor_sscanf() documentation. */
  2883. int
  2884. tor_vsscanf(const char *buf, const char *pattern, va_list ap)
  2885. {
  2886. int n_matched = 0;
  2887. while (*pattern) {
  2888. if (*pattern != '%') {
  2889. if (*buf == *pattern) {
  2890. ++buf;
  2891. ++pattern;
  2892. continue;
  2893. } else {
  2894. return n_matched;
  2895. }
  2896. } else {
  2897. int width = -1;
  2898. int longmod = 0;
  2899. ++pattern;
  2900. if (TOR_ISDIGIT(*pattern)) {
  2901. width = digit_to_num(*pattern++);
  2902. while (TOR_ISDIGIT(*pattern)) {
  2903. width *= 10;
  2904. width += digit_to_num(*pattern++);
  2905. if (width > MAX_SCANF_WIDTH)
  2906. return -1;
  2907. }
  2908. if (!width) /* No zero-width things. */
  2909. return -1;
  2910. }
  2911. if (*pattern == 'l') {
  2912. longmod = 1;
  2913. ++pattern;
  2914. }
  2915. if (*pattern == 'u' || *pattern == 'x') {
  2916. unsigned long u;
  2917. const int base = (*pattern == 'u') ? 10 : 16;
  2918. if (!*buf)
  2919. return n_matched;
  2920. if (scan_unsigned(&buf, &u, width, base)<0)
  2921. return n_matched;
  2922. if (longmod) {
  2923. unsigned long *out = va_arg(ap, unsigned long *);
  2924. *out = u;
  2925. } else {
  2926. unsigned *out = va_arg(ap, unsigned *);
  2927. if (u > UINT_MAX)
  2928. return n_matched;
  2929. *out = (unsigned) u;
  2930. }
  2931. ++pattern;
  2932. ++n_matched;
  2933. } else if (*pattern == 'f') {
  2934. double *d = va_arg(ap, double *);
  2935. if (!longmod)
  2936. return -1; /* float not supported */
  2937. if (!*buf)
  2938. return n_matched;
  2939. if (scan_double(&buf, d, width)<0)
  2940. return n_matched;
  2941. ++pattern;
  2942. ++n_matched;
  2943. } else if (*pattern == 'd') {
  2944. long lng=0;
  2945. if (scan_signed(&buf, &lng, width)<0)
  2946. return n_matched;
  2947. if (longmod) {
  2948. long *out = va_arg(ap, long *);
  2949. *out = lng;
  2950. } else {
  2951. int *out = va_arg(ap, int *);
  2952. if (lng < INT_MIN || lng > INT_MAX)
  2953. return n_matched;
  2954. *out = (int)lng;
  2955. }
  2956. ++pattern;
  2957. ++n_matched;
  2958. } else if (*pattern == 's') {
  2959. char *s = va_arg(ap, char *);
  2960. if (longmod)
  2961. return -1;
  2962. if (width < 0)
  2963. return -1;
  2964. if (scan_string(&buf, s, width)<0)
  2965. return n_matched;
  2966. ++pattern;
  2967. ++n_matched;
  2968. } else if (*pattern == 'c') {
  2969. char *ch = va_arg(ap, char *);
  2970. if (longmod)
  2971. return -1;
  2972. if (width != -1)
  2973. return -1;
  2974. if (!*buf)
  2975. return n_matched;
  2976. *ch = *buf++;
  2977. ++pattern;
  2978. ++n_matched;
  2979. } else if (*pattern == '%') {
  2980. if (*buf != '%')
  2981. return n_matched;
  2982. if (longmod)
  2983. return -1;
  2984. ++buf;
  2985. ++pattern;
  2986. } else {
  2987. return -1; /* Unrecognized pattern component. */
  2988. }
  2989. }
  2990. }
  2991. return n_matched;
  2992. }
  2993. /** Minimal sscanf replacement: parse <b>buf</b> according to <b>pattern</b>
  2994. * and store the results in the corresponding argument fields. Differs from
  2995. * sscanf in that:
  2996. * <ul><li>It only handles %u, %lu, %x, %lx, %[NUM]s, %d, %ld, %lf, and %c.
  2997. * <li>It only handles decimal inputs for %lf. (12.3, not 1.23e1)
  2998. * <li>It does not handle arbitrarily long widths.
  2999. * <li>Numbers do not consume any space characters.
  3000. * <li>It is locale-independent.
  3001. * <li>%u and %x do not consume any space.
  3002. * <li>It returns -1 on malformed patterns.</ul>
  3003. *
  3004. * (As with other locale-independent functions, we need this to parse data that
  3005. * is in ASCII without worrying that the C library's locale-handling will make
  3006. * miscellaneous characters look like numbers, spaces, and so on.)
  3007. */
  3008. int
  3009. tor_sscanf(const char *buf, const char *pattern, ...)
  3010. {
  3011. int r;
  3012. va_list ap;
  3013. va_start(ap, pattern);
  3014. r = tor_vsscanf(buf, pattern, ap);
  3015. va_end(ap);
  3016. return r;
  3017. }
  3018. /** Append the string produced by tor_asprintf(<b>pattern</b>, <b>...</b>)
  3019. * to <b>sl</b>. */
  3020. void
  3021. smartlist_add_asprintf(struct smartlist_t *sl, const char *pattern, ...)
  3022. {
  3023. va_list ap;
  3024. va_start(ap, pattern);
  3025. smartlist_add_vasprintf(sl, pattern, ap);
  3026. va_end(ap);
  3027. }
  3028. /** va_list-based backend of smartlist_add_asprintf. */
  3029. void
  3030. smartlist_add_vasprintf(struct smartlist_t *sl, const char *pattern,
  3031. va_list args)
  3032. {
  3033. char *str = NULL;
  3034. tor_vasprintf(&str, pattern, args);
  3035. tor_assert(str != NULL);
  3036. smartlist_add(sl, str);
  3037. }
  3038. /** Return a new list containing the filenames in the directory <b>dirname</b>.
  3039. * Return NULL on error or if <b>dirname</b> is not a directory.
  3040. */
  3041. smartlist_t *
  3042. tor_listdir(const char *dirname)
  3043. {
  3044. smartlist_t *result;
  3045. #ifdef _WIN32
  3046. char *pattern=NULL;
  3047. TCHAR tpattern[MAX_PATH] = {0};
  3048. char name[MAX_PATH*2+1] = {0};
  3049. HANDLE handle;
  3050. WIN32_FIND_DATA findData;
  3051. tor_asprintf(&pattern, "%s\\*", dirname);
  3052. #ifdef UNICODE
  3053. mbstowcs(tpattern,pattern,MAX_PATH);
  3054. #else
  3055. strlcpy(tpattern, pattern, MAX_PATH);
  3056. #endif
  3057. if (INVALID_HANDLE_VALUE == (handle = FindFirstFile(tpattern, &findData))) {
  3058. tor_free(pattern);
  3059. return NULL;
  3060. }
  3061. result = smartlist_new();
  3062. while (1) {
  3063. #ifdef UNICODE
  3064. wcstombs(name,findData.cFileName,MAX_PATH);
  3065. name[sizeof(name)-1] = '\0';
  3066. #else
  3067. strlcpy(name,findData.cFileName,sizeof(name));
  3068. #endif
  3069. if (strcmp(name, ".") &&
  3070. strcmp(name, "..")) {
  3071. smartlist_add(result, tor_strdup(name));
  3072. }
  3073. if (!FindNextFile(handle, &findData)) {
  3074. DWORD err;
  3075. if ((err = GetLastError()) != ERROR_NO_MORE_FILES) {
  3076. char *errstr = format_win32_error(err);
  3077. log_warn(LD_FS, "Error reading directory '%s': %s", dirname, errstr);
  3078. tor_free(errstr);
  3079. }
  3080. break;
  3081. }
  3082. }
  3083. FindClose(handle);
  3084. tor_free(pattern);
  3085. #else
  3086. const char *prot_dname = sandbox_intern_string(dirname);
  3087. DIR *d;
  3088. struct dirent *de;
  3089. if (!(d = opendir(prot_dname)))
  3090. return NULL;
  3091. result = smartlist_new();
  3092. while ((de = readdir(d))) {
  3093. if (!strcmp(de->d_name, ".") ||
  3094. !strcmp(de->d_name, ".."))
  3095. continue;
  3096. smartlist_add(result, tor_strdup(de->d_name));
  3097. }
  3098. closedir(d);
  3099. #endif
  3100. return result;
  3101. }
  3102. /** Return true iff <b>filename</b> is a relative path. */
  3103. int
  3104. path_is_relative(const char *filename)
  3105. {
  3106. if (filename && filename[0] == '/')
  3107. return 0;
  3108. #ifdef _WIN32
  3109. else if (filename && filename[0] == '\\')
  3110. return 0;
  3111. else if (filename && strlen(filename)>3 && TOR_ISALPHA(filename[0]) &&
  3112. filename[1] == ':' && filename[2] == '\\')
  3113. return 0;
  3114. #endif
  3115. else
  3116. return 1;
  3117. }
  3118. /* =====
  3119. * Process helpers
  3120. * ===== */
  3121. #ifndef _WIN32
  3122. /* Based on code contributed by christian grothoff */
  3123. /** True iff we've called start_daemon(). */
  3124. static int start_daemon_called = 0;
  3125. /** True iff we've called finish_daemon(). */
  3126. static int finish_daemon_called = 0;
  3127. /** Socketpair used to communicate between parent and child process while
  3128. * daemonizing. */
  3129. static int daemon_filedes[2];
  3130. /** Start putting the process into daemon mode: fork and drop all resources
  3131. * except standard fds. The parent process never returns, but stays around
  3132. * until finish_daemon is called. (Note: it's safe to call this more
  3133. * than once: calls after the first are ignored.)
  3134. */
  3135. void
  3136. start_daemon(void)
  3137. {
  3138. pid_t pid;
  3139. if (start_daemon_called)
  3140. return;
  3141. start_daemon_called = 1;
  3142. if (pipe(daemon_filedes)) {
  3143. log_err(LD_GENERAL,"pipe failed; exiting. Error was %s", strerror(errno));
  3144. exit(1);
  3145. }
  3146. pid = fork();
  3147. if (pid < 0) {
  3148. log_err(LD_GENERAL,"fork failed. Exiting.");
  3149. exit(1);
  3150. }
  3151. if (pid) { /* Parent */
  3152. int ok;
  3153. char c;
  3154. close(daemon_filedes[1]); /* we only read */
  3155. ok = -1;
  3156. while (0 < read(daemon_filedes[0], &c, sizeof(char))) {
  3157. if (c == '.')
  3158. ok = 1;
  3159. }
  3160. fflush(stdout);
  3161. if (ok == 1)
  3162. exit(0);
  3163. else
  3164. exit(1); /* child reported error */
  3165. } else { /* Child */
  3166. close(daemon_filedes[0]); /* we only write */
  3167. pid = setsid(); /* Detach from controlling terminal */
  3168. /*
  3169. * Fork one more time, so the parent (the session group leader) can exit.
  3170. * This means that we, as a non-session group leader, can never regain a
  3171. * controlling terminal. This part is recommended by Stevens's
  3172. * _Advanced Programming in the Unix Environment_.
  3173. */
  3174. if (fork() != 0) {
  3175. exit(0);
  3176. }
  3177. set_main_thread(); /* We are now the main thread. */
  3178. return;
  3179. }
  3180. }
  3181. /** Finish putting the process into daemon mode: drop standard fds, and tell
  3182. * the parent process to exit. (Note: it's safe to call this more than once:
  3183. * calls after the first are ignored. Calls start_daemon first if it hasn't
  3184. * been called already.)
  3185. */
  3186. void
  3187. finish_daemon(const char *desired_cwd)
  3188. {
  3189. int nullfd;
  3190. char c = '.';
  3191. if (finish_daemon_called)
  3192. return;
  3193. if (!start_daemon_called)
  3194. start_daemon();
  3195. finish_daemon_called = 1;
  3196. if (!desired_cwd)
  3197. desired_cwd = "/";
  3198. /* Don't hold the wrong FS mounted */
  3199. if (chdir(desired_cwd) < 0) {
  3200. log_err(LD_GENERAL,"chdir to \"%s\" failed. Exiting.",desired_cwd);
  3201. exit(1);
  3202. }
  3203. nullfd = tor_open_cloexec("/dev/null", O_RDWR, 0);
  3204. if (nullfd < 0) {
  3205. log_err(LD_GENERAL,"/dev/null can't be opened. Exiting.");
  3206. exit(1);
  3207. }
  3208. /* close fds linking to invoking terminal, but
  3209. * close usual incoming fds, but redirect them somewhere
  3210. * useful so the fds don't get reallocated elsewhere.
  3211. */
  3212. if (dup2(nullfd,0) < 0 ||
  3213. dup2(nullfd,1) < 0 ||
  3214. dup2(nullfd,2) < 0) {
  3215. log_err(LD_GENERAL,"dup2 failed. Exiting.");
  3216. exit(1);
  3217. }
  3218. if (nullfd > 2)
  3219. close(nullfd);
  3220. /* signal success */
  3221. if (write(daemon_filedes[1], &c, sizeof(char)) != sizeof(char)) {
  3222. log_err(LD_GENERAL,"write failed. Exiting.");
  3223. }
  3224. close(daemon_filedes[1]);
  3225. }
  3226. #else
  3227. /* defined(_WIN32) */
  3228. void
  3229. start_daemon(void)
  3230. {
  3231. }
  3232. void
  3233. finish_daemon(const char *cp)
  3234. {
  3235. (void)cp;
  3236. }
  3237. #endif
  3238. /** Write the current process ID, followed by NL, into <b>filename</b>.
  3239. */
  3240. void
  3241. write_pidfile(const char *filename)
  3242. {
  3243. FILE *pidfile;
  3244. if ((pidfile = fopen(filename, "w")) == NULL) {
  3245. log_warn(LD_FS, "Unable to open \"%s\" for writing: %s", filename,
  3246. strerror(errno));
  3247. } else {
  3248. #ifdef _WIN32
  3249. fprintf(pidfile, "%d\n", (int)_getpid());
  3250. #else
  3251. fprintf(pidfile, "%d\n", (int)getpid());
  3252. #endif
  3253. fclose(pidfile);
  3254. }
  3255. }
  3256. #ifdef _WIN32
  3257. HANDLE
  3258. load_windows_system_library(const TCHAR *library_name)
  3259. {
  3260. TCHAR path[MAX_PATH];
  3261. unsigned n;
  3262. n = GetSystemDirectory(path, MAX_PATH);
  3263. if (n == 0 || n + _tcslen(library_name) + 2 >= MAX_PATH)
  3264. return 0;
  3265. _tcscat(path, TEXT("\\"));
  3266. _tcscat(path, library_name);
  3267. return LoadLibrary(path);
  3268. }
  3269. #endif
  3270. /** Format a single argument for being put on a Windows command line.
  3271. * Returns a newly allocated string */
  3272. static char *
  3273. format_win_cmdline_argument(const char *arg)
  3274. {
  3275. char *formatted_arg;
  3276. char need_quotes;
  3277. const char *c;
  3278. int i;
  3279. int bs_counter = 0;
  3280. /* Backslash we can point to when one is inserted into the string */
  3281. const char backslash = '\\';
  3282. /* Smartlist of *char */
  3283. smartlist_t *arg_chars;
  3284. arg_chars = smartlist_new();
  3285. /* Quote string if it contains whitespace or is empty */
  3286. need_quotes = (strchr(arg, ' ') || strchr(arg, '\t') || '\0' == arg[0]);
  3287. /* Build up smartlist of *chars */
  3288. for (c=arg; *c != '\0'; c++) {
  3289. if ('"' == *c) {
  3290. /* Double up backslashes preceding a quote */
  3291. for (i=0; i<(bs_counter*2); i++)
  3292. smartlist_add(arg_chars, (void*)&backslash);
  3293. bs_counter = 0;
  3294. /* Escape the quote */
  3295. smartlist_add(arg_chars, (void*)&backslash);
  3296. smartlist_add(arg_chars, (void*)c);
  3297. } else if ('\\' == *c) {
  3298. /* Count backslashes until we know whether to double up */
  3299. bs_counter++;
  3300. } else {
  3301. /* Don't double up slashes preceding a non-quote */
  3302. for (i=0; i<bs_counter; i++)
  3303. smartlist_add(arg_chars, (void*)&backslash);
  3304. bs_counter = 0;
  3305. smartlist_add(arg_chars, (void*)c);
  3306. }
  3307. }
  3308. /* Don't double up trailing backslashes */
  3309. for (i=0; i<bs_counter; i++)
  3310. smartlist_add(arg_chars, (void*)&backslash);
  3311. /* Allocate space for argument, quotes (if needed), and terminator */
  3312. const size_t formatted_arg_len = smartlist_len(arg_chars) +
  3313. (need_quotes ? 2 : 0) + 1;
  3314. formatted_arg = tor_malloc_zero(formatted_arg_len);
  3315. /* Add leading quote */
  3316. i=0;
  3317. if (need_quotes)
  3318. formatted_arg[i++] = '"';
  3319. /* Add characters */
  3320. SMARTLIST_FOREACH(arg_chars, char*, c,
  3321. {
  3322. formatted_arg[i++] = *c;
  3323. });
  3324. /* Add trailing quote */
  3325. if (need_quotes)
  3326. formatted_arg[i++] = '"';
  3327. formatted_arg[i] = '\0';
  3328. smartlist_free(arg_chars);
  3329. return formatted_arg;
  3330. }
  3331. /** Format a command line for use on Windows, which takes the command as a
  3332. * string rather than string array. Follows the rules from "Parsing C++
  3333. * Command-Line Arguments" in MSDN. Algorithm based on list2cmdline in the
  3334. * Python subprocess module. Returns a newly allocated string */
  3335. char *
  3336. tor_join_win_cmdline(const char *argv[])
  3337. {
  3338. smartlist_t *argv_list;
  3339. char *joined_argv;
  3340. int i;
  3341. /* Format each argument and put the result in a smartlist */
  3342. argv_list = smartlist_new();
  3343. for (i=0; argv[i] != NULL; i++) {
  3344. smartlist_add(argv_list, (void *)format_win_cmdline_argument(argv[i]));
  3345. }
  3346. /* Join the arguments with whitespace */
  3347. joined_argv = smartlist_join_strings(argv_list, " ", 0, NULL);
  3348. /* Free the newly allocated arguments, and the smartlist */
  3349. SMARTLIST_FOREACH(argv_list, char *, arg,
  3350. {
  3351. tor_free(arg);
  3352. });
  3353. smartlist_free(argv_list);
  3354. return joined_argv;
  3355. }
  3356. /* As format_{hex,dex}_number_sigsafe, but takes a <b>radix</b> argument
  3357. * in range 2..16 inclusive. */
  3358. static int
  3359. format_number_sigsafe(unsigned long x, char *buf, int buf_len,
  3360. unsigned int radix)
  3361. {
  3362. unsigned long tmp;
  3363. int len;
  3364. char *cp;
  3365. /* NOT tor_assert. This needs to be safe to run from within a signal handler,
  3366. * and from within the 'tor_assert() has failed' code. */
  3367. if (radix < 2 || radix > 16)
  3368. return 0;
  3369. /* Count how many digits we need. */
  3370. tmp = x;
  3371. len = 1;
  3372. while (tmp >= radix) {
  3373. tmp /= radix;
  3374. ++len;
  3375. }
  3376. /* Not long enough */
  3377. if (!buf || len >= buf_len)
  3378. return 0;
  3379. cp = buf + len;
  3380. *cp = '\0';
  3381. do {
  3382. unsigned digit = (unsigned) (x % radix);
  3383. tor_assert(cp > buf);
  3384. --cp;
  3385. *cp = "0123456789ABCDEF"[digit];
  3386. x /= radix;
  3387. } while (x);
  3388. /* NOT tor_assert; see above. */
  3389. if (cp != buf) {
  3390. abort();
  3391. }
  3392. return len;
  3393. }
  3394. /**
  3395. * Helper function to output hex numbers from within a signal handler.
  3396. *
  3397. * Writes the nul-terminated hexadecimal digits of <b>x</b> into a buffer
  3398. * <b>buf</b> of size <b>buf_len</b>, and return the actual number of digits
  3399. * written, not counting the terminal NUL.
  3400. *
  3401. * If there is insufficient space, write nothing and return 0.
  3402. *
  3403. * This accepts an unsigned int because format_helper_exit_status() needs to
  3404. * call it with a signed int and an unsigned char, and since the C standard
  3405. * does not guarantee that an int is wider than a char (an int must be at
  3406. * least 16 bits but it is permitted for a char to be that wide as well), we
  3407. * can't assume a signed int is sufficient to accomodate an unsigned char.
  3408. * Thus, format_helper_exit_status() will still need to emit any require '-'
  3409. * on its own.
  3410. *
  3411. * For most purposes, you'd want to use tor_snprintf("%x") instead of this
  3412. * function; it's designed to be used in code paths where you can't call
  3413. * arbitrary C functions.
  3414. */
  3415. int
  3416. format_hex_number_sigsafe(unsigned long x, char *buf, int buf_len)
  3417. {
  3418. return format_number_sigsafe(x, buf, buf_len, 16);
  3419. }
  3420. /** As format_hex_number_sigsafe, but format the number in base 10. */
  3421. int
  3422. format_dec_number_sigsafe(unsigned long x, char *buf, int buf_len)
  3423. {
  3424. return format_number_sigsafe(x, buf, buf_len, 10);
  3425. }
  3426. #ifndef _WIN32
  3427. /** Format <b>child_state</b> and <b>saved_errno</b> as a hex string placed in
  3428. * <b>hex_errno</b>. Called between fork and _exit, so must be signal-handler
  3429. * safe.
  3430. *
  3431. * <b>hex_errno</b> must have at least HEX_ERRNO_SIZE+1 bytes available.
  3432. *
  3433. * The format of <b>hex_errno</b> is: "CHILD_STATE/ERRNO\n", left-padded
  3434. * with spaces. CHILD_STATE indicates where
  3435. * in the processs of starting the child process did the failure occur (see
  3436. * CHILD_STATE_* macros for definition), and SAVED_ERRNO is the value of
  3437. * errno when the failure occurred.
  3438. *
  3439. * On success return the number of characters added to hex_errno, not counting
  3440. * the terminating NUL; return -1 on error.
  3441. */
  3442. STATIC int
  3443. format_helper_exit_status(unsigned char child_state, int saved_errno,
  3444. char *hex_errno)
  3445. {
  3446. unsigned int unsigned_errno;
  3447. int written, left;
  3448. char *cur;
  3449. size_t i;
  3450. int res = -1;
  3451. /* Fill hex_errno with spaces, and a trailing newline (memset may
  3452. not be signal handler safe, so we can't use it) */
  3453. for (i = 0; i < (HEX_ERRNO_SIZE - 1); i++)
  3454. hex_errno[i] = ' ';
  3455. hex_errno[HEX_ERRNO_SIZE - 1] = '\n';
  3456. /* Convert errno to be unsigned for hex conversion */
  3457. if (saved_errno < 0) {
  3458. // Avoid overflow on the cast to unsigned int when result is INT_MIN
  3459. // by adding 1 to the signed int negative value,
  3460. // then, after it has been negated and cast to unsigned,
  3461. // adding the original 1 back (the double-addition is intentional).
  3462. // Otherwise, the cast to signed could cause a temporary int
  3463. // to equal INT_MAX + 1, which is undefined.
  3464. unsigned_errno = ((unsigned int) -(saved_errno + 1)) + 1;
  3465. } else {
  3466. unsigned_errno = (unsigned int) saved_errno;
  3467. }
  3468. /*
  3469. * Count how many chars of space we have left, and keep a pointer into the
  3470. * current point in the buffer.
  3471. */
  3472. left = HEX_ERRNO_SIZE+1;
  3473. cur = hex_errno;
  3474. /* Emit child_state */
  3475. written = format_hex_number_sigsafe(child_state, cur, left);
  3476. if (written <= 0)
  3477. goto err;
  3478. /* Adjust left and cur */
  3479. left -= written;
  3480. cur += written;
  3481. if (left <= 0)
  3482. goto err;
  3483. /* Now the '/' */
  3484. *cur = '/';
  3485. /* Adjust left and cur */
  3486. ++cur;
  3487. --left;
  3488. if (left <= 0)
  3489. goto err;
  3490. /* Need minus? */
  3491. if (saved_errno < 0) {
  3492. *cur = '-';
  3493. ++cur;
  3494. --left;
  3495. if (left <= 0)
  3496. goto err;
  3497. }
  3498. /* Emit unsigned_errno */
  3499. written = format_hex_number_sigsafe(unsigned_errno, cur, left);
  3500. if (written <= 0)
  3501. goto err;
  3502. /* Adjust left and cur */
  3503. left -= written;
  3504. cur += written;
  3505. /* Check that we have enough space left for a newline and a NUL */
  3506. if (left <= 1)
  3507. goto err;
  3508. /* Emit the newline and NUL */
  3509. *cur++ = '\n';
  3510. *cur++ = '\0';
  3511. res = (int)(cur - hex_errno - 1);
  3512. goto done;
  3513. err:
  3514. /*
  3515. * In error exit, just write a '\0' in the first char so whatever called
  3516. * this at least won't fall off the end.
  3517. */
  3518. *hex_errno = '\0';
  3519. done:
  3520. return res;
  3521. }
  3522. #endif
  3523. /* Maximum number of file descriptors, if we cannot get it via sysconf() */
  3524. #define DEFAULT_MAX_FD 256
  3525. /** Terminate the process of <b>process_handle</b>.
  3526. * Code borrowed from Python's os.kill. */
  3527. int
  3528. tor_terminate_process(process_handle_t *process_handle)
  3529. {
  3530. #ifdef _WIN32
  3531. if (tor_get_exit_code(process_handle, 0, NULL) == PROCESS_EXIT_RUNNING) {
  3532. HANDLE handle = process_handle->pid.hProcess;
  3533. if (!TerminateProcess(handle, 0))
  3534. return -1;
  3535. else
  3536. return 0;
  3537. }
  3538. #else /* Unix */
  3539. if (process_handle->waitpid_cb) {
  3540. /* We haven't got a waitpid yet, so we can just kill off the process. */
  3541. return kill(process_handle->pid, SIGTERM);
  3542. }
  3543. #endif
  3544. return -1;
  3545. }
  3546. /** Return the Process ID of <b>process_handle</b>. */
  3547. int
  3548. tor_process_get_pid(process_handle_t *process_handle)
  3549. {
  3550. #ifdef _WIN32
  3551. return (int) process_handle->pid.dwProcessId;
  3552. #else
  3553. return (int) process_handle->pid;
  3554. #endif
  3555. }
  3556. #ifdef _WIN32
  3557. HANDLE
  3558. tor_process_get_stdout_pipe(process_handle_t *process_handle)
  3559. {
  3560. return process_handle->stdout_pipe;
  3561. }
  3562. #else
  3563. /* DOCDOC tor_process_get_stdout_pipe */
  3564. FILE *
  3565. tor_process_get_stdout_pipe(process_handle_t *process_handle)
  3566. {
  3567. return process_handle->stdout_handle;
  3568. }
  3569. #endif
  3570. /* DOCDOC process_handle_new */
  3571. static process_handle_t *
  3572. process_handle_new(void)
  3573. {
  3574. process_handle_t *out = tor_malloc_zero(sizeof(process_handle_t));
  3575. #ifdef _WIN32
  3576. out->stdin_pipe = INVALID_HANDLE_VALUE;
  3577. out->stdout_pipe = INVALID_HANDLE_VALUE;
  3578. out->stderr_pipe = INVALID_HANDLE_VALUE;
  3579. #else
  3580. out->stdin_pipe = -1;
  3581. out->stdout_pipe = -1;
  3582. out->stderr_pipe = -1;
  3583. #endif
  3584. return out;
  3585. }
  3586. #ifndef _WIN32
  3587. /** Invoked when a process that we've launched via tor_spawn_background() has
  3588. * been found to have terminated.
  3589. */
  3590. static void
  3591. process_handle_waitpid_cb(int status, void *arg)
  3592. {
  3593. process_handle_t *process_handle = arg;
  3594. process_handle->waitpid_exit_status = status;
  3595. clear_waitpid_callback(process_handle->waitpid_cb);
  3596. if (process_handle->status == PROCESS_STATUS_RUNNING)
  3597. process_handle->status = PROCESS_STATUS_NOTRUNNING;
  3598. process_handle->waitpid_cb = 0;
  3599. }
  3600. #endif
  3601. /**
  3602. * @name child-process states
  3603. *
  3604. * Each of these values represents a possible state that a child process can
  3605. * be in. They're used to determine what to say when telling the parent how
  3606. * far along we were before failure.
  3607. *
  3608. * @{
  3609. */
  3610. #define CHILD_STATE_INIT 0
  3611. #define CHILD_STATE_PIPE 1
  3612. #define CHILD_STATE_MAXFD 2
  3613. #define CHILD_STATE_FORK 3
  3614. #define CHILD_STATE_DUPOUT 4
  3615. #define CHILD_STATE_DUPERR 5
  3616. #define CHILD_STATE_DUPIN 6
  3617. #define CHILD_STATE_CLOSEFD 7
  3618. #define CHILD_STATE_EXEC 8
  3619. #define CHILD_STATE_FAILEXEC 9
  3620. /** @} */
  3621. /** Start a program in the background. If <b>filename</b> contains a '/', then
  3622. * it will be treated as an absolute or relative path. Otherwise, on
  3623. * non-Windows systems, the system path will be searched for <b>filename</b>.
  3624. * On Windows, only the current directory will be searched. Here, to search the
  3625. * system path (as well as the application directory, current working
  3626. * directory, and system directories), set filename to NULL.
  3627. *
  3628. * The strings in <b>argv</b> will be passed as the command line arguments of
  3629. * the child program (following convention, argv[0] should normally be the
  3630. * filename of the executable, and this must be the case if <b>filename</b> is
  3631. * NULL). The last element of argv must be NULL. A handle to the child process
  3632. * will be returned in process_handle (which must be non-NULL). Read
  3633. * process_handle.status to find out if the process was successfully launched.
  3634. * For convenience, process_handle.status is returned by this function.
  3635. *
  3636. * Some parts of this code are based on the POSIX subprocess module from
  3637. * Python, and example code from
  3638. * http://msdn.microsoft.com/en-us/library/ms682499%28v=vs.85%29.aspx.
  3639. */
  3640. int
  3641. tor_spawn_background(const char *const filename, const char **argv,
  3642. process_environment_t *env,
  3643. process_handle_t **process_handle_out)
  3644. {
  3645. #ifdef _WIN32
  3646. HANDLE stdout_pipe_read = NULL;
  3647. HANDLE stdout_pipe_write = NULL;
  3648. HANDLE stderr_pipe_read = NULL;
  3649. HANDLE stderr_pipe_write = NULL;
  3650. HANDLE stdin_pipe_read = NULL;
  3651. HANDLE stdin_pipe_write = NULL;
  3652. process_handle_t *process_handle;
  3653. int status;
  3654. STARTUPINFOA siStartInfo;
  3655. BOOL retval = FALSE;
  3656. SECURITY_ATTRIBUTES saAttr;
  3657. char *joined_argv;
  3658. saAttr.nLength = sizeof(SECURITY_ATTRIBUTES);
  3659. saAttr.bInheritHandle = TRUE;
  3660. /* TODO: should we set explicit security attributes? (#2046, comment 5) */
  3661. saAttr.lpSecurityDescriptor = NULL;
  3662. /* Assume failure to start process */
  3663. status = PROCESS_STATUS_ERROR;
  3664. /* Set up pipe for stdout */
  3665. if (!CreatePipe(&stdout_pipe_read, &stdout_pipe_write, &saAttr, 0)) {
  3666. log_warn(LD_GENERAL,
  3667. "Failed to create pipe for stdout communication with child process: %s",
  3668. format_win32_error(GetLastError()));
  3669. return status;
  3670. }
  3671. if (!SetHandleInformation(stdout_pipe_read, HANDLE_FLAG_INHERIT, 0)) {
  3672. log_warn(LD_GENERAL,
  3673. "Failed to configure pipe for stdout communication with child "
  3674. "process: %s", format_win32_error(GetLastError()));
  3675. return status;
  3676. }
  3677. /* Set up pipe for stderr */
  3678. if (!CreatePipe(&stderr_pipe_read, &stderr_pipe_write, &saAttr, 0)) {
  3679. log_warn(LD_GENERAL,
  3680. "Failed to create pipe for stderr communication with child process: %s",
  3681. format_win32_error(GetLastError()));
  3682. return status;
  3683. }
  3684. if (!SetHandleInformation(stderr_pipe_read, HANDLE_FLAG_INHERIT, 0)) {
  3685. log_warn(LD_GENERAL,
  3686. "Failed to configure pipe for stderr communication with child "
  3687. "process: %s", format_win32_error(GetLastError()));
  3688. return status;
  3689. }
  3690. /* Set up pipe for stdin */
  3691. if (!CreatePipe(&stdin_pipe_read, &stdin_pipe_write, &saAttr, 0)) {
  3692. log_warn(LD_GENERAL,
  3693. "Failed to create pipe for stdin communication with child process: %s",
  3694. format_win32_error(GetLastError()));
  3695. return status;
  3696. }
  3697. if (!SetHandleInformation(stdin_pipe_write, HANDLE_FLAG_INHERIT, 0)) {
  3698. log_warn(LD_GENERAL,
  3699. "Failed to configure pipe for stdin communication with child "
  3700. "process: %s", format_win32_error(GetLastError()));
  3701. return status;
  3702. }
  3703. /* Create the child process */
  3704. /* Windows expects argv to be a whitespace delimited string, so join argv up
  3705. */
  3706. joined_argv = tor_join_win_cmdline(argv);
  3707. process_handle = process_handle_new();
  3708. process_handle->status = status;
  3709. ZeroMemory(&(process_handle->pid), sizeof(PROCESS_INFORMATION));
  3710. ZeroMemory(&siStartInfo, sizeof(STARTUPINFO));
  3711. siStartInfo.cb = sizeof(STARTUPINFO);
  3712. siStartInfo.hStdError = stderr_pipe_write;
  3713. siStartInfo.hStdOutput = stdout_pipe_write;
  3714. siStartInfo.hStdInput = stdin_pipe_read;
  3715. siStartInfo.dwFlags |= STARTF_USESTDHANDLES;
  3716. /* Create the child process */
  3717. retval = CreateProcessA(filename, // module name
  3718. joined_argv, // command line
  3719. /* TODO: should we set explicit security attributes? (#2046, comment 5) */
  3720. NULL, // process security attributes
  3721. NULL, // primary thread security attributes
  3722. TRUE, // handles are inherited
  3723. /*(TODO: set CREATE_NEW CONSOLE/PROCESS_GROUP to make GetExitCodeProcess()
  3724. * work?) */
  3725. CREATE_NO_WINDOW, // creation flags
  3726. (env==NULL) ? NULL : env->windows_environment_block,
  3727. NULL, // use parent's current directory
  3728. &siStartInfo, // STARTUPINFO pointer
  3729. &(process_handle->pid)); // receives PROCESS_INFORMATION
  3730. tor_free(joined_argv);
  3731. if (!retval) {
  3732. log_warn(LD_GENERAL,
  3733. "Failed to create child process %s: %s", filename?filename:argv[0],
  3734. format_win32_error(GetLastError()));
  3735. tor_free(process_handle);
  3736. } else {
  3737. /* TODO: Close hProcess and hThread in process_handle->pid? */
  3738. process_handle->stdout_pipe = stdout_pipe_read;
  3739. process_handle->stderr_pipe = stderr_pipe_read;
  3740. process_handle->stdin_pipe = stdin_pipe_write;
  3741. status = process_handle->status = PROCESS_STATUS_RUNNING;
  3742. }
  3743. /* TODO: Close pipes on exit */
  3744. *process_handle_out = process_handle;
  3745. return status;
  3746. #else // _WIN32
  3747. pid_t pid;
  3748. int stdout_pipe[2];
  3749. int stderr_pipe[2];
  3750. int stdin_pipe[2];
  3751. int fd, retval;
  3752. ssize_t nbytes;
  3753. process_handle_t *process_handle;
  3754. int status;
  3755. const char *error_message = SPAWN_ERROR_MESSAGE;
  3756. size_t error_message_length;
  3757. /* Represents where in the process of spawning the program is;
  3758. this is used for printing out the error message */
  3759. unsigned char child_state = CHILD_STATE_INIT;
  3760. char hex_errno[HEX_ERRNO_SIZE + 2]; /* + 1 should be sufficient actually */
  3761. static int max_fd = -1;
  3762. status = PROCESS_STATUS_ERROR;
  3763. /* We do the strlen here because strlen() is not signal handler safe,
  3764. and we are not allowed to use unsafe functions between fork and exec */
  3765. error_message_length = strlen(error_message);
  3766. child_state = CHILD_STATE_PIPE;
  3767. /* Set up pipe for redirecting stdout, stderr, and stdin of child */
  3768. retval = pipe(stdout_pipe);
  3769. if (-1 == retval) {
  3770. log_warn(LD_GENERAL,
  3771. "Failed to set up pipe for stdout communication with child process: %s",
  3772. strerror(errno));
  3773. return status;
  3774. }
  3775. retval = pipe(stderr_pipe);
  3776. if (-1 == retval) {
  3777. log_warn(LD_GENERAL,
  3778. "Failed to set up pipe for stderr communication with child process: %s",
  3779. strerror(errno));
  3780. close(stdout_pipe[0]);
  3781. close(stdout_pipe[1]);
  3782. return status;
  3783. }
  3784. retval = pipe(stdin_pipe);
  3785. if (-1 == retval) {
  3786. log_warn(LD_GENERAL,
  3787. "Failed to set up pipe for stdin communication with child process: %s",
  3788. strerror(errno));
  3789. close(stdout_pipe[0]);
  3790. close(stdout_pipe[1]);
  3791. close(stderr_pipe[0]);
  3792. close(stderr_pipe[1]);
  3793. return status;
  3794. }
  3795. child_state = CHILD_STATE_MAXFD;
  3796. #ifdef _SC_OPEN_MAX
  3797. if (-1 == max_fd) {
  3798. max_fd = (int) sysconf(_SC_OPEN_MAX);
  3799. if (max_fd == -1) {
  3800. max_fd = DEFAULT_MAX_FD;
  3801. log_warn(LD_GENERAL,
  3802. "Cannot find maximum file descriptor, assuming %d", max_fd);
  3803. }
  3804. }
  3805. #else
  3806. max_fd = DEFAULT_MAX_FD;
  3807. #endif
  3808. child_state = CHILD_STATE_FORK;
  3809. pid = fork();
  3810. if (0 == pid) {
  3811. /* In child */
  3812. #if defined(HAVE_SYS_PRCTL_H) && defined(__linux__)
  3813. /* Attempt to have the kernel issue a SIGTERM if the parent
  3814. * goes away. Certain attributes of the binary being execve()ed
  3815. * will clear this during the execve() call, but it's better
  3816. * than nothing.
  3817. */
  3818. prctl(PR_SET_PDEATHSIG, SIGTERM);
  3819. #endif
  3820. child_state = CHILD_STATE_DUPOUT;
  3821. /* Link child stdout to the write end of the pipe */
  3822. retval = dup2(stdout_pipe[1], STDOUT_FILENO);
  3823. if (-1 == retval)
  3824. goto error;
  3825. child_state = CHILD_STATE_DUPERR;
  3826. /* Link child stderr to the write end of the pipe */
  3827. retval = dup2(stderr_pipe[1], STDERR_FILENO);
  3828. if (-1 == retval)
  3829. goto error;
  3830. child_state = CHILD_STATE_DUPIN;
  3831. /* Link child stdin to the read end of the pipe */
  3832. retval = dup2(stdin_pipe[0], STDIN_FILENO);
  3833. if (-1 == retval)
  3834. goto error;
  3835. child_state = CHILD_STATE_CLOSEFD;
  3836. close(stderr_pipe[0]);
  3837. close(stderr_pipe[1]);
  3838. close(stdout_pipe[0]);
  3839. close(stdout_pipe[1]);
  3840. close(stdin_pipe[0]);
  3841. close(stdin_pipe[1]);
  3842. /* Close all other fds, including the read end of the pipe */
  3843. /* XXX: We should now be doing enough FD_CLOEXEC setting to make
  3844. * this needless. */
  3845. for (fd = STDERR_FILENO + 1; fd < max_fd; fd++) {
  3846. close(fd);
  3847. }
  3848. child_state = CHILD_STATE_EXEC;
  3849. /* Call the requested program. We need the cast because
  3850. execvp doesn't define argv as const, even though it
  3851. does not modify the arguments */
  3852. if (env)
  3853. execve(filename, (char *const *) argv, env->unixoid_environment_block);
  3854. else {
  3855. static char *new_env[] = { NULL };
  3856. execve(filename, (char *const *) argv, new_env);
  3857. }
  3858. /* If we got here, the exec or open(/dev/null) failed */
  3859. child_state = CHILD_STATE_FAILEXEC;
  3860. error:
  3861. {
  3862. /* XXX: are we leaking fds from the pipe? */
  3863. int n;
  3864. n = format_helper_exit_status(child_state, errno, hex_errno);
  3865. if (n >= 0) {
  3866. /* Write the error message. GCC requires that we check the return
  3867. value, but there is nothing we can do if it fails */
  3868. /* TODO: Don't use STDOUT, use a pipe set up just for this purpose */
  3869. nbytes = write(STDOUT_FILENO, error_message, error_message_length);
  3870. nbytes = write(STDOUT_FILENO, hex_errno, n);
  3871. }
  3872. }
  3873. (void) nbytes;
  3874. _exit(255);
  3875. /* Never reached, but avoids compiler warning */
  3876. return status;
  3877. }
  3878. /* In parent */
  3879. if (-1 == pid) {
  3880. log_warn(LD_GENERAL, "Failed to fork child process: %s", strerror(errno));
  3881. close(stdin_pipe[0]);
  3882. close(stdin_pipe[1]);
  3883. close(stdout_pipe[0]);
  3884. close(stdout_pipe[1]);
  3885. close(stderr_pipe[0]);
  3886. close(stderr_pipe[1]);
  3887. return status;
  3888. }
  3889. process_handle = process_handle_new();
  3890. process_handle->status = status;
  3891. process_handle->pid = pid;
  3892. /* TODO: If the child process forked but failed to exec, waitpid it */
  3893. /* Return read end of the pipes to caller, and close write end */
  3894. process_handle->stdout_pipe = stdout_pipe[0];
  3895. retval = close(stdout_pipe[1]);
  3896. if (-1 == retval) {
  3897. log_warn(LD_GENERAL,
  3898. "Failed to close write end of stdout pipe in parent process: %s",
  3899. strerror(errno));
  3900. }
  3901. process_handle->waitpid_cb = set_waitpid_callback(pid,
  3902. process_handle_waitpid_cb,
  3903. process_handle);
  3904. process_handle->stderr_pipe = stderr_pipe[0];
  3905. retval = close(stderr_pipe[1]);
  3906. if (-1 == retval) {
  3907. log_warn(LD_GENERAL,
  3908. "Failed to close write end of stderr pipe in parent process: %s",
  3909. strerror(errno));
  3910. }
  3911. /* Return write end of the stdin pipe to caller, and close the read end */
  3912. process_handle->stdin_pipe = stdin_pipe[1];
  3913. retval = close(stdin_pipe[0]);
  3914. if (-1 == retval) {
  3915. log_warn(LD_GENERAL,
  3916. "Failed to close read end of stdin pipe in parent process: %s",
  3917. strerror(errno));
  3918. }
  3919. status = process_handle->status = PROCESS_STATUS_RUNNING;
  3920. /* Set stdin/stdout/stderr pipes to be non-blocking */
  3921. if (fcntl(process_handle->stdout_pipe, F_SETFL, O_NONBLOCK) < 0 ||
  3922. fcntl(process_handle->stderr_pipe, F_SETFL, O_NONBLOCK) < 0 ||
  3923. fcntl(process_handle->stdin_pipe, F_SETFL, O_NONBLOCK) < 0) {
  3924. log_warn(LD_GENERAL, "Failed to set stderror/stdout/stdin pipes "
  3925. "nonblocking in parent process: %s", strerror(errno));
  3926. }
  3927. /* Open the buffered IO streams */
  3928. process_handle->stdout_handle = fdopen(process_handle->stdout_pipe, "r");
  3929. process_handle->stderr_handle = fdopen(process_handle->stderr_pipe, "r");
  3930. process_handle->stdin_handle = fdopen(process_handle->stdin_pipe, "r");
  3931. *process_handle_out = process_handle;
  3932. return process_handle->status;
  3933. #endif // _WIN32
  3934. }
  3935. /** Destroy all resources allocated by the process handle in
  3936. * <b>process_handle</b>.
  3937. * If <b>also_terminate_process</b> is true, also terminate the
  3938. * process of the process handle. */
  3939. MOCK_IMPL(void,
  3940. tor_process_handle_destroy,(process_handle_t *process_handle,
  3941. int also_terminate_process))
  3942. {
  3943. if (!process_handle)
  3944. return;
  3945. if (also_terminate_process) {
  3946. if (tor_terminate_process(process_handle) < 0) {
  3947. const char *errstr =
  3948. #ifdef _WIN32
  3949. format_win32_error(GetLastError());
  3950. #else
  3951. strerror(errno);
  3952. #endif
  3953. log_notice(LD_GENERAL, "Failed to terminate process with "
  3954. "PID '%d' ('%s').", tor_process_get_pid(process_handle),
  3955. errstr);
  3956. } else {
  3957. log_info(LD_GENERAL, "Terminated process with PID '%d'.",
  3958. tor_process_get_pid(process_handle));
  3959. }
  3960. }
  3961. process_handle->status = PROCESS_STATUS_NOTRUNNING;
  3962. #ifdef _WIN32
  3963. if (process_handle->stdout_pipe)
  3964. CloseHandle(process_handle->stdout_pipe);
  3965. if (process_handle->stderr_pipe)
  3966. CloseHandle(process_handle->stderr_pipe);
  3967. if (process_handle->stdin_pipe)
  3968. CloseHandle(process_handle->stdin_pipe);
  3969. #else
  3970. if (process_handle->stdout_handle)
  3971. fclose(process_handle->stdout_handle);
  3972. if (process_handle->stderr_handle)
  3973. fclose(process_handle->stderr_handle);
  3974. if (process_handle->stdin_handle)
  3975. fclose(process_handle->stdin_handle);
  3976. clear_waitpid_callback(process_handle->waitpid_cb);
  3977. #endif
  3978. memset(process_handle, 0x0f, sizeof(process_handle_t));
  3979. tor_free(process_handle);
  3980. }
  3981. /** Get the exit code of a process specified by <b>process_handle</b> and store
  3982. * it in <b>exit_code</b>, if set to a non-NULL value. If <b>block</b> is set
  3983. * to true, the call will block until the process has exited. Otherwise if
  3984. * the process is still running, the function will return
  3985. * PROCESS_EXIT_RUNNING, and exit_code will be left unchanged. Returns
  3986. * PROCESS_EXIT_EXITED if the process did exit. If there is a failure,
  3987. * PROCESS_EXIT_ERROR will be returned and the contents of exit_code (if
  3988. * non-NULL) will be undefined. N.B. Under *nix operating systems, this will
  3989. * probably not work in Tor, because waitpid() is called in main.c to reap any
  3990. * terminated child processes.*/
  3991. int
  3992. tor_get_exit_code(process_handle_t *process_handle,
  3993. int block, int *exit_code)
  3994. {
  3995. #ifdef _WIN32
  3996. DWORD retval;
  3997. BOOL success;
  3998. if (block) {
  3999. /* Wait for the process to exit */
  4000. retval = WaitForSingleObject(process_handle->pid.hProcess, INFINITE);
  4001. if (retval != WAIT_OBJECT_0) {
  4002. log_warn(LD_GENERAL, "WaitForSingleObject() failed (%d): %s",
  4003. (int)retval, format_win32_error(GetLastError()));
  4004. return PROCESS_EXIT_ERROR;
  4005. }
  4006. } else {
  4007. retval = WaitForSingleObject(process_handle->pid.hProcess, 0);
  4008. if (WAIT_TIMEOUT == retval) {
  4009. /* Process has not exited */
  4010. return PROCESS_EXIT_RUNNING;
  4011. } else if (retval != WAIT_OBJECT_0) {
  4012. log_warn(LD_GENERAL, "WaitForSingleObject() failed (%d): %s",
  4013. (int)retval, format_win32_error(GetLastError()));
  4014. return PROCESS_EXIT_ERROR;
  4015. }
  4016. }
  4017. if (exit_code != NULL) {
  4018. success = GetExitCodeProcess(process_handle->pid.hProcess,
  4019. (PDWORD)exit_code);
  4020. if (!success) {
  4021. log_warn(LD_GENERAL, "GetExitCodeProcess() failed: %s",
  4022. format_win32_error(GetLastError()));
  4023. return PROCESS_EXIT_ERROR;
  4024. }
  4025. }
  4026. #else
  4027. int stat_loc;
  4028. int retval;
  4029. if (process_handle->waitpid_cb) {
  4030. /* We haven't processed a SIGCHLD yet. */
  4031. retval = waitpid(process_handle->pid, &stat_loc, block?0:WNOHANG);
  4032. if (retval == process_handle->pid) {
  4033. clear_waitpid_callback(process_handle->waitpid_cb);
  4034. process_handle->waitpid_cb = NULL;
  4035. process_handle->waitpid_exit_status = stat_loc;
  4036. }
  4037. } else {
  4038. /* We already got a SIGCHLD for this process, and handled it. */
  4039. retval = process_handle->pid;
  4040. stat_loc = process_handle->waitpid_exit_status;
  4041. }
  4042. if (!block && 0 == retval) {
  4043. /* Process has not exited */
  4044. return PROCESS_EXIT_RUNNING;
  4045. } else if (retval != process_handle->pid) {
  4046. log_warn(LD_GENERAL, "waitpid() failed for PID %d: %s",
  4047. process_handle->pid, strerror(errno));
  4048. return PROCESS_EXIT_ERROR;
  4049. }
  4050. if (!WIFEXITED(stat_loc)) {
  4051. log_warn(LD_GENERAL, "Process %d did not exit normally",
  4052. process_handle->pid);
  4053. return PROCESS_EXIT_ERROR;
  4054. }
  4055. if (exit_code != NULL)
  4056. *exit_code = WEXITSTATUS(stat_loc);
  4057. #endif // _WIN32
  4058. return PROCESS_EXIT_EXITED;
  4059. }
  4060. /** Helper: return the number of characters in <b>s</b> preceding the first
  4061. * occurrence of <b>ch</b>. If <b>ch</b> does not occur in <b>s</b>, return
  4062. * the length of <b>s</b>. Should be equivalent to strspn(s, "ch"). */
  4063. static inline size_t
  4064. str_num_before(const char *s, char ch)
  4065. {
  4066. const char *cp = strchr(s, ch);
  4067. if (cp)
  4068. return cp - s;
  4069. else
  4070. return strlen(s);
  4071. }
  4072. /** Return non-zero iff getenv would consider <b>s1</b> and <b>s2</b>
  4073. * to have the same name as strings in a process's environment. */
  4074. int
  4075. environment_variable_names_equal(const char *s1, const char *s2)
  4076. {
  4077. size_t s1_name_len = str_num_before(s1, '=');
  4078. size_t s2_name_len = str_num_before(s2, '=');
  4079. return (s1_name_len == s2_name_len &&
  4080. tor_memeq(s1, s2, s1_name_len));
  4081. }
  4082. /** Free <b>env</b> (assuming it was produced by
  4083. * process_environment_make). */
  4084. void
  4085. process_environment_free(process_environment_t *env)
  4086. {
  4087. if (env == NULL) return;
  4088. /* As both an optimization hack to reduce consing on Unixoid systems
  4089. * and a nice way to ensure that some otherwise-Windows-specific
  4090. * code will always get tested before changes to it get merged, the
  4091. * strings which env->unixoid_environment_block points to are packed
  4092. * into env->windows_environment_block. */
  4093. tor_free(env->unixoid_environment_block);
  4094. tor_free(env->windows_environment_block);
  4095. tor_free(env);
  4096. }
  4097. /** Make a process_environment_t containing the environment variables
  4098. * specified in <b>env_vars</b> (as C strings of the form
  4099. * "NAME=VALUE"). */
  4100. process_environment_t *
  4101. process_environment_make(struct smartlist_t *env_vars)
  4102. {
  4103. process_environment_t *env = tor_malloc_zero(sizeof(process_environment_t));
  4104. size_t n_env_vars = smartlist_len(env_vars);
  4105. size_t i;
  4106. size_t total_env_length;
  4107. smartlist_t *env_vars_sorted;
  4108. tor_assert(n_env_vars + 1 != 0);
  4109. env->unixoid_environment_block = tor_calloc(n_env_vars + 1, sizeof(char *));
  4110. /* env->unixoid_environment_block is already NULL-terminated,
  4111. * because we assume that NULL == 0 (and check that during compilation). */
  4112. total_env_length = 1; /* terminating NUL of terminating empty string */
  4113. for (i = 0; i < n_env_vars; ++i) {
  4114. const char *s = smartlist_get(env_vars, i);
  4115. size_t slen = strlen(s);
  4116. tor_assert(slen + 1 != 0);
  4117. tor_assert(slen + 1 < SIZE_MAX - total_env_length);
  4118. total_env_length += slen + 1;
  4119. }
  4120. env->windows_environment_block = tor_malloc_zero(total_env_length);
  4121. /* env->windows_environment_block is already
  4122. * (NUL-terminated-empty-string)-terminated. */
  4123. /* Some versions of Windows supposedly require that environment
  4124. * blocks be sorted. Or maybe some Windows programs (or their
  4125. * runtime libraries) fail to look up strings in non-sorted
  4126. * environment blocks.
  4127. *
  4128. * Also, sorting strings makes it easy to find duplicate environment
  4129. * variables and environment-variable strings without an '=' on all
  4130. * OSes, and they can cause badness. Let's complain about those. */
  4131. env_vars_sorted = smartlist_new();
  4132. smartlist_add_all(env_vars_sorted, env_vars);
  4133. smartlist_sort_strings(env_vars_sorted);
  4134. /* Now copy the strings into the environment blocks. */
  4135. {
  4136. char *cp = env->windows_environment_block;
  4137. const char *prev_env_var = NULL;
  4138. for (i = 0; i < n_env_vars; ++i) {
  4139. const char *s = smartlist_get(env_vars_sorted, i);
  4140. size_t slen = strlen(s);
  4141. size_t s_name_len = str_num_before(s, '=');
  4142. if (s_name_len == slen) {
  4143. log_warn(LD_GENERAL,
  4144. "Preparing an environment containing a variable "
  4145. "without a value: %s",
  4146. s);
  4147. }
  4148. if (prev_env_var != NULL &&
  4149. environment_variable_names_equal(s, prev_env_var)) {
  4150. log_warn(LD_GENERAL,
  4151. "Preparing an environment containing two variables "
  4152. "with the same name: %s and %s",
  4153. prev_env_var, s);
  4154. }
  4155. prev_env_var = s;
  4156. /* Actually copy the string into the environment. */
  4157. memcpy(cp, s, slen+1);
  4158. env->unixoid_environment_block[i] = cp;
  4159. cp += slen+1;
  4160. }
  4161. tor_assert(cp == env->windows_environment_block + total_env_length - 1);
  4162. }
  4163. smartlist_free(env_vars_sorted);
  4164. return env;
  4165. }
  4166. /** Return a newly allocated smartlist containing every variable in
  4167. * this process's environment, as a NUL-terminated string of the form
  4168. * "NAME=VALUE". Note that on some/many/most/all OSes, the parent
  4169. * process can put strings not of that form in our environment;
  4170. * callers should try to not get crashed by that.
  4171. *
  4172. * The returned strings are heap-allocated, and must be freed by the
  4173. * caller. */
  4174. struct smartlist_t *
  4175. get_current_process_environment_variables(void)
  4176. {
  4177. smartlist_t *sl = smartlist_new();
  4178. char **environ_tmp; /* Not const char ** ? Really? */
  4179. for (environ_tmp = get_environment(); *environ_tmp; ++environ_tmp) {
  4180. smartlist_add(sl, tor_strdup(*environ_tmp));
  4181. }
  4182. return sl;
  4183. }
  4184. /** For each string s in <b>env_vars</b> such that
  4185. * environment_variable_names_equal(s, <b>new_var</b>), remove it; if
  4186. * <b>free_p</b> is non-zero, call <b>free_old</b>(s). If
  4187. * <b>new_var</b> contains '=', insert it into <b>env_vars</b>. */
  4188. void
  4189. set_environment_variable_in_smartlist(struct smartlist_t *env_vars,
  4190. const char *new_var,
  4191. void (*free_old)(void*),
  4192. int free_p)
  4193. {
  4194. SMARTLIST_FOREACH_BEGIN(env_vars, const char *, s) {
  4195. if (environment_variable_names_equal(s, new_var)) {
  4196. SMARTLIST_DEL_CURRENT(env_vars, s);
  4197. if (free_p) {
  4198. free_old((void *)s);
  4199. }
  4200. }
  4201. } SMARTLIST_FOREACH_END(s);
  4202. if (strchr(new_var, '=') != NULL) {
  4203. smartlist_add(env_vars, (void *)new_var);
  4204. }
  4205. }
  4206. #ifdef _WIN32
  4207. /** Read from a handle <b>h</b> into <b>buf</b>, up to <b>count</b> bytes. If
  4208. * <b>hProcess</b> is NULL, the function will return immediately if there is
  4209. * nothing more to read. Otherwise <b>hProcess</b> should be set to the handle
  4210. * to the process owning the <b>h</b>. In this case, the function will exit
  4211. * only once the process has exited, or <b>count</b> bytes are read. Returns
  4212. * the number of bytes read, or -1 on error. */
  4213. ssize_t
  4214. tor_read_all_handle(HANDLE h, char *buf, size_t count,
  4215. const process_handle_t *process)
  4216. {
  4217. size_t numread = 0;
  4218. BOOL retval;
  4219. DWORD byte_count;
  4220. BOOL process_exited = FALSE;
  4221. if (count > SIZE_T_CEILING || count > SSIZE_MAX)
  4222. return -1;
  4223. while (numread != count) {
  4224. /* Check if there is anything to read */
  4225. retval = PeekNamedPipe(h, NULL, 0, NULL, &byte_count, NULL);
  4226. if (!retval) {
  4227. log_warn(LD_GENERAL,
  4228. "Failed to peek from handle: %s",
  4229. format_win32_error(GetLastError()));
  4230. return -1;
  4231. } else if (0 == byte_count) {
  4232. /* Nothing available: process exited or it is busy */
  4233. /* Exit if we don't know whether the process is running */
  4234. if (NULL == process)
  4235. break;
  4236. /* The process exited and there's nothing left to read from it */
  4237. if (process_exited)
  4238. break;
  4239. /* If process is not running, check for output one more time in case
  4240. it wrote something after the peek was performed. Otherwise keep on
  4241. waiting for output */
  4242. tor_assert(process != NULL);
  4243. byte_count = WaitForSingleObject(process->pid.hProcess, 0);
  4244. if (WAIT_TIMEOUT != byte_count)
  4245. process_exited = TRUE;
  4246. continue;
  4247. }
  4248. /* There is data to read; read it */
  4249. retval = ReadFile(h, buf+numread, count-numread, &byte_count, NULL);
  4250. tor_assert(byte_count + numread <= count);
  4251. if (!retval) {
  4252. log_warn(LD_GENERAL, "Failed to read from handle: %s",
  4253. format_win32_error(GetLastError()));
  4254. return -1;
  4255. } else if (0 == byte_count) {
  4256. /* End of file */
  4257. break;
  4258. }
  4259. numread += byte_count;
  4260. }
  4261. return (ssize_t)numread;
  4262. }
  4263. #else
  4264. /** Read from a handle <b>h</b> into <b>buf</b>, up to <b>count</b> bytes. If
  4265. * <b>process</b> is NULL, the function will return immediately if there is
  4266. * nothing more to read. Otherwise data will be read until end of file, or
  4267. * <b>count</b> bytes are read. Returns the number of bytes read, or -1 on
  4268. * error. Sets <b>eof</b> to true if <b>eof</b> is not NULL and the end of the
  4269. * file has been reached. */
  4270. ssize_t
  4271. tor_read_all_handle(FILE *h, char *buf, size_t count,
  4272. const process_handle_t *process,
  4273. int *eof)
  4274. {
  4275. size_t numread = 0;
  4276. char *retval;
  4277. if (eof)
  4278. *eof = 0;
  4279. if (count > SIZE_T_CEILING || count > SSIZE_MAX)
  4280. return -1;
  4281. while (numread != count) {
  4282. /* Use fgets because that is what we use in log_from_pipe() */
  4283. retval = fgets(buf+numread, (int)(count-numread), h);
  4284. if (NULL == retval) {
  4285. if (feof(h)) {
  4286. log_debug(LD_GENERAL, "fgets() reached end of file");
  4287. if (eof)
  4288. *eof = 1;
  4289. break;
  4290. } else {
  4291. if (EAGAIN == errno) {
  4292. if (process)
  4293. continue;
  4294. else
  4295. break;
  4296. } else {
  4297. log_warn(LD_GENERAL, "fgets() from handle failed: %s",
  4298. strerror(errno));
  4299. return -1;
  4300. }
  4301. }
  4302. }
  4303. tor_assert(retval != NULL);
  4304. tor_assert(strlen(retval) + numread <= count);
  4305. numread += strlen(retval);
  4306. }
  4307. log_debug(LD_GENERAL, "fgets() read %d bytes from handle", (int)numread);
  4308. return (ssize_t)numread;
  4309. }
  4310. #endif
  4311. /** Read from stdout of a process until the process exits. */
  4312. ssize_t
  4313. tor_read_all_from_process_stdout(const process_handle_t *process_handle,
  4314. char *buf, size_t count)
  4315. {
  4316. #ifdef _WIN32
  4317. return tor_read_all_handle(process_handle->stdout_pipe, buf, count,
  4318. process_handle);
  4319. #else
  4320. return tor_read_all_handle(process_handle->stdout_handle, buf, count,
  4321. process_handle, NULL);
  4322. #endif
  4323. }
  4324. /** Read from stdout of a process until the process exits. */
  4325. ssize_t
  4326. tor_read_all_from_process_stderr(const process_handle_t *process_handle,
  4327. char *buf, size_t count)
  4328. {
  4329. #ifdef _WIN32
  4330. return tor_read_all_handle(process_handle->stderr_pipe, buf, count,
  4331. process_handle);
  4332. #else
  4333. return tor_read_all_handle(process_handle->stderr_handle, buf, count,
  4334. process_handle, NULL);
  4335. #endif
  4336. }
  4337. /** Split buf into lines, and add to smartlist. The buffer <b>buf</b> will be
  4338. * modified. The resulting smartlist will consist of pointers to buf, so there
  4339. * is no need to free the contents of sl. <b>buf</b> must be a NUL-terminated
  4340. * string. <b>len</b> should be set to the length of the buffer excluding the
  4341. * NUL. Non-printable characters (including NUL) will be replaced with "." */
  4342. int
  4343. tor_split_lines(smartlist_t *sl, char *buf, int len)
  4344. {
  4345. /* Index in buf of the start of the current line */
  4346. int start = 0;
  4347. /* Index in buf of the current character being processed */
  4348. int cur = 0;
  4349. /* Are we currently in a line */
  4350. char in_line = 0;
  4351. /* Loop over string */
  4352. while (cur < len) {
  4353. /* Loop until end of line or end of string */
  4354. for (; cur < len; cur++) {
  4355. if (in_line) {
  4356. if ('\r' == buf[cur] || '\n' == buf[cur]) {
  4357. /* End of line */
  4358. buf[cur] = '\0';
  4359. /* Point cur to the next line */
  4360. cur++;
  4361. /* Line starts at start and ends with a nul */
  4362. break;
  4363. } else {
  4364. if (!TOR_ISPRINT(buf[cur]))
  4365. buf[cur] = '.';
  4366. }
  4367. } else {
  4368. if ('\r' == buf[cur] || '\n' == buf[cur]) {
  4369. /* Skip leading vertical space */
  4370. ;
  4371. } else {
  4372. in_line = 1;
  4373. start = cur;
  4374. if (!TOR_ISPRINT(buf[cur]))
  4375. buf[cur] = '.';
  4376. }
  4377. }
  4378. }
  4379. /* We are at the end of the line or end of string. If in_line is true there
  4380. * is a line which starts at buf+start and ends at a NUL. cur points to
  4381. * the character after the NUL. */
  4382. if (in_line)
  4383. smartlist_add(sl, (void *)(buf+start));
  4384. in_line = 0;
  4385. }
  4386. return smartlist_len(sl);
  4387. }
  4388. /** Return a string corresponding to <b>stream_status</b>. */
  4389. const char *
  4390. stream_status_to_string(enum stream_status stream_status)
  4391. {
  4392. switch (stream_status) {
  4393. case IO_STREAM_OKAY:
  4394. return "okay";
  4395. case IO_STREAM_EAGAIN:
  4396. return "temporarily unavailable";
  4397. case IO_STREAM_TERM:
  4398. return "terminated";
  4399. case IO_STREAM_CLOSED:
  4400. return "closed";
  4401. default:
  4402. tor_fragile_assert();
  4403. return "unknown";
  4404. }
  4405. }
  4406. /* DOCDOC */
  4407. static void
  4408. log_portfw_spawn_error_message(const char *buf,
  4409. const char *executable, int *child_status)
  4410. {
  4411. /* Parse error message */
  4412. int retval, child_state, saved_errno;
  4413. retval = tor_sscanf(buf, SPAWN_ERROR_MESSAGE "%x/%x",
  4414. &child_state, &saved_errno);
  4415. if (retval == 2) {
  4416. log_warn(LD_GENERAL,
  4417. "Failed to start child process \"%s\" in state %d: %s",
  4418. executable, child_state, strerror(saved_errno));
  4419. if (child_status)
  4420. *child_status = 1;
  4421. } else {
  4422. /* Failed to parse message from child process, log it as a
  4423. warning */
  4424. log_warn(LD_GENERAL,
  4425. "Unexpected message from port forwarding helper \"%s\": %s",
  4426. executable, buf);
  4427. }
  4428. }
  4429. #ifdef _WIN32
  4430. /** Return a smartlist containing lines outputted from
  4431. * <b>handle</b>. Return NULL on error, and set
  4432. * <b>stream_status_out</b> appropriately. */
  4433. MOCK_IMPL(smartlist_t *,
  4434. tor_get_lines_from_handle, (HANDLE *handle,
  4435. enum stream_status *stream_status_out))
  4436. {
  4437. int pos;
  4438. char stdout_buf[600] = {0};
  4439. smartlist_t *lines = NULL;
  4440. tor_assert(stream_status_out);
  4441. *stream_status_out = IO_STREAM_TERM;
  4442. pos = tor_read_all_handle(handle, stdout_buf, sizeof(stdout_buf) - 1, NULL);
  4443. if (pos < 0) {
  4444. *stream_status_out = IO_STREAM_TERM;
  4445. return NULL;
  4446. }
  4447. if (pos == 0) {
  4448. *stream_status_out = IO_STREAM_EAGAIN;
  4449. return NULL;
  4450. }
  4451. /* End with a null even if there isn't a \r\n at the end */
  4452. /* TODO: What if this is a partial line? */
  4453. stdout_buf[pos] = '\0';
  4454. /* Split up the buffer */
  4455. lines = smartlist_new();
  4456. tor_split_lines(lines, stdout_buf, pos);
  4457. /* Currently 'lines' is populated with strings residing on the
  4458. stack. Replace them with their exact copies on the heap: */
  4459. SMARTLIST_FOREACH(lines, char *, line,
  4460. SMARTLIST_REPLACE_CURRENT(lines, line, tor_strdup(line)));
  4461. *stream_status_out = IO_STREAM_OKAY;
  4462. return lines;
  4463. }
  4464. /** Read from stream, and send lines to log at the specified log level.
  4465. * Returns -1 if there is a error reading, and 0 otherwise.
  4466. * If the generated stream is flushed more often than on new lines, or
  4467. * a read exceeds 256 bytes, lines will be truncated. This should be fixed,
  4468. * along with the corresponding problem on *nix (see bug #2045).
  4469. */
  4470. static int
  4471. log_from_handle(HANDLE *pipe, int severity)
  4472. {
  4473. char buf[256];
  4474. int pos;
  4475. smartlist_t *lines;
  4476. pos = tor_read_all_handle(pipe, buf, sizeof(buf) - 1, NULL);
  4477. if (pos < 0) {
  4478. /* Error */
  4479. log_warn(LD_GENERAL, "Failed to read data from subprocess");
  4480. return -1;
  4481. }
  4482. if (0 == pos) {
  4483. /* There's nothing to read (process is busy or has exited) */
  4484. log_debug(LD_GENERAL, "Subprocess had nothing to say");
  4485. return 0;
  4486. }
  4487. /* End with a null even if there isn't a \r\n at the end */
  4488. /* TODO: What if this is a partial line? */
  4489. buf[pos] = '\0';
  4490. log_debug(LD_GENERAL, "Subprocess had %d bytes to say", pos);
  4491. /* Split up the buffer */
  4492. lines = smartlist_new();
  4493. tor_split_lines(lines, buf, pos);
  4494. /* Log each line */
  4495. SMARTLIST_FOREACH(lines, char *, line,
  4496. {
  4497. log_fn(severity, LD_GENERAL, "Port forwarding helper says: %s", line);
  4498. });
  4499. smartlist_free(lines);
  4500. return 0;
  4501. }
  4502. #else
  4503. /** Return a smartlist containing lines outputted from
  4504. * <b>handle</b>. Return NULL on error, and set
  4505. * <b>stream_status_out</b> appropriately. */
  4506. MOCK_IMPL(smartlist_t *,
  4507. tor_get_lines_from_handle, (FILE *handle,
  4508. enum stream_status *stream_status_out))
  4509. {
  4510. enum stream_status stream_status;
  4511. char stdout_buf[400];
  4512. smartlist_t *lines = NULL;
  4513. while (1) {
  4514. memset(stdout_buf, 0, sizeof(stdout_buf));
  4515. stream_status = get_string_from_pipe(handle,
  4516. stdout_buf, sizeof(stdout_buf) - 1);
  4517. if (stream_status != IO_STREAM_OKAY)
  4518. goto done;
  4519. if (!lines) lines = smartlist_new();
  4520. smartlist_add(lines, tor_strdup(stdout_buf));
  4521. }
  4522. done:
  4523. *stream_status_out = stream_status;
  4524. return lines;
  4525. }
  4526. /** Read from stream, and send lines to log at the specified log level.
  4527. * Returns 1 if stream is closed normally, -1 if there is a error reading, and
  4528. * 0 otherwise. Handles lines from tor-fw-helper and
  4529. * tor_spawn_background() specially.
  4530. */
  4531. static int
  4532. log_from_pipe(FILE *stream, int severity, const char *executable,
  4533. int *child_status)
  4534. {
  4535. char buf[256];
  4536. enum stream_status r;
  4537. for (;;) {
  4538. r = get_string_from_pipe(stream, buf, sizeof(buf) - 1);
  4539. if (r == IO_STREAM_CLOSED) {
  4540. return 1;
  4541. } else if (r == IO_STREAM_EAGAIN) {
  4542. return 0;
  4543. } else if (r == IO_STREAM_TERM) {
  4544. return -1;
  4545. }
  4546. tor_assert(r == IO_STREAM_OKAY);
  4547. /* Check if buf starts with SPAWN_ERROR_MESSAGE */
  4548. if (strcmpstart(buf, SPAWN_ERROR_MESSAGE) == 0) {
  4549. log_portfw_spawn_error_message(buf, executable, child_status);
  4550. } else {
  4551. log_fn(severity, LD_GENERAL, "Port forwarding helper says: %s", buf);
  4552. }
  4553. }
  4554. /* We should never get here */
  4555. return -1;
  4556. }
  4557. #endif
  4558. /** Reads from <b>stream</b> and stores input in <b>buf_out</b> making
  4559. * sure it's below <b>count</b> bytes.
  4560. * If the string has a trailing newline, we strip it off.
  4561. *
  4562. * This function is specifically created to handle input from managed
  4563. * proxies, according to the pluggable transports spec. Make sure it
  4564. * fits your needs before using it.
  4565. *
  4566. * Returns:
  4567. * IO_STREAM_CLOSED: If the stream is closed.
  4568. * IO_STREAM_EAGAIN: If there is nothing to read and we should check back
  4569. * later.
  4570. * IO_STREAM_TERM: If something is wrong with the stream.
  4571. * IO_STREAM_OKAY: If everything went okay and we got a string
  4572. * in <b>buf_out</b>. */
  4573. enum stream_status
  4574. get_string_from_pipe(FILE *stream, char *buf_out, size_t count)
  4575. {
  4576. char *retval;
  4577. size_t len;
  4578. tor_assert(count <= INT_MAX);
  4579. retval = fgets(buf_out, (int)count, stream);
  4580. if (!retval) {
  4581. if (feof(stream)) {
  4582. /* Program has closed stream (probably it exited) */
  4583. /* TODO: check error */
  4584. return IO_STREAM_CLOSED;
  4585. } else {
  4586. if (EAGAIN == errno) {
  4587. /* Nothing more to read, try again next time */
  4588. return IO_STREAM_EAGAIN;
  4589. } else {
  4590. /* There was a problem, abandon this child process */
  4591. return IO_STREAM_TERM;
  4592. }
  4593. }
  4594. } else {
  4595. len = strlen(buf_out);
  4596. if (len == 0) {
  4597. /* this probably means we got a NUL at the start of the string. */
  4598. return IO_STREAM_EAGAIN;
  4599. }
  4600. if (buf_out[len - 1] == '\n') {
  4601. /* Remove the trailing newline */
  4602. buf_out[len - 1] = '\0';
  4603. } else {
  4604. /* No newline; check whether we overflowed the buffer */
  4605. if (!feof(stream))
  4606. log_info(LD_GENERAL,
  4607. "Line from stream was truncated: %s", buf_out);
  4608. /* TODO: What to do with this error? */
  4609. }
  4610. return IO_STREAM_OKAY;
  4611. }
  4612. /* We should never get here */
  4613. return IO_STREAM_TERM;
  4614. }
  4615. /** Parse a <b>line</b> from tor-fw-helper and issue an appropriate
  4616. * log message to our user. */
  4617. static void
  4618. handle_fw_helper_line(const char *executable, const char *line)
  4619. {
  4620. smartlist_t *tokens = smartlist_new();
  4621. char *message = NULL;
  4622. char *message_for_log = NULL;
  4623. const char *external_port = NULL;
  4624. const char *internal_port = NULL;
  4625. const char *result = NULL;
  4626. int port = 0;
  4627. int success = 0;
  4628. if (strcmpstart(line, SPAWN_ERROR_MESSAGE) == 0) {
  4629. /* We need to check for SPAWN_ERROR_MESSAGE again here, since it's
  4630. * possible that it got sent after we tried to read it in log_from_pipe.
  4631. *
  4632. * XXX Ideally, we should be using one of stdout/stderr for the real
  4633. * output, and one for the output of the startup code. We used to do that
  4634. * before cd05f35d2c.
  4635. */
  4636. int child_status;
  4637. log_portfw_spawn_error_message(line, executable, &child_status);
  4638. goto done;
  4639. }
  4640. smartlist_split_string(tokens, line, NULL,
  4641. SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, -1);
  4642. if (smartlist_len(tokens) < 5)
  4643. goto err;
  4644. if (strcmp(smartlist_get(tokens, 0), "tor-fw-helper") ||
  4645. strcmp(smartlist_get(tokens, 1), "tcp-forward"))
  4646. goto err;
  4647. external_port = smartlist_get(tokens, 2);
  4648. internal_port = smartlist_get(tokens, 3);
  4649. result = smartlist_get(tokens, 4);
  4650. if (smartlist_len(tokens) > 5) {
  4651. /* If there are more than 5 tokens, they are part of [<message>].
  4652. Let's use a second smartlist to form the whole message;
  4653. strncat loops suck. */
  4654. int i;
  4655. int message_words_n = smartlist_len(tokens) - 5;
  4656. smartlist_t *message_sl = smartlist_new();
  4657. for (i = 0; i < message_words_n; i++)
  4658. smartlist_add(message_sl, smartlist_get(tokens, 5+i));
  4659. tor_assert(smartlist_len(message_sl) > 0);
  4660. message = smartlist_join_strings(message_sl, " ", 0, NULL);
  4661. /* wrap the message in log-friendly wrapping */
  4662. tor_asprintf(&message_for_log, " ('%s')", message);
  4663. smartlist_free(message_sl);
  4664. }
  4665. port = atoi(external_port);
  4666. if (port < 1 || port > 65535)
  4667. goto err;
  4668. port = atoi(internal_port);
  4669. if (port < 1 || port > 65535)
  4670. goto err;
  4671. if (!strcmp(result, "SUCCESS"))
  4672. success = 1;
  4673. else if (!strcmp(result, "FAIL"))
  4674. success = 0;
  4675. else
  4676. goto err;
  4677. if (!success) {
  4678. log_warn(LD_GENERAL, "Tor was unable to forward TCP port '%s' to '%s'%s. "
  4679. "Please make sure that your router supports port "
  4680. "forwarding protocols (like NAT-PMP). Note that if '%s' is "
  4681. "your ORPort, your relay will be unable to receive inbound "
  4682. "traffic.", external_port, internal_port,
  4683. message_for_log ? message_for_log : "",
  4684. internal_port);
  4685. } else {
  4686. log_info(LD_GENERAL,
  4687. "Tor successfully forwarded TCP port '%s' to '%s'%s.",
  4688. external_port, internal_port,
  4689. message_for_log ? message_for_log : "");
  4690. }
  4691. goto done;
  4692. err:
  4693. log_warn(LD_GENERAL, "tor-fw-helper sent us a string we could not "
  4694. "parse (%s).", line);
  4695. done:
  4696. SMARTLIST_FOREACH(tokens, char *, cp, tor_free(cp));
  4697. smartlist_free(tokens);
  4698. tor_free(message);
  4699. tor_free(message_for_log);
  4700. }
  4701. /** Read what tor-fw-helper has to say in its stdout and handle it
  4702. * appropriately */
  4703. static int
  4704. handle_fw_helper_output(const char *executable,
  4705. process_handle_t *process_handle)
  4706. {
  4707. smartlist_t *fw_helper_output = NULL;
  4708. enum stream_status stream_status = 0;
  4709. fw_helper_output =
  4710. tor_get_lines_from_handle(tor_process_get_stdout_pipe(process_handle),
  4711. &stream_status);
  4712. if (!fw_helper_output) { /* didn't get any output from tor-fw-helper */
  4713. /* if EAGAIN we should retry in the future */
  4714. return (stream_status == IO_STREAM_EAGAIN) ? 0 : -1;
  4715. }
  4716. /* Handle the lines we got: */
  4717. SMARTLIST_FOREACH_BEGIN(fw_helper_output, char *, line) {
  4718. handle_fw_helper_line(executable, line);
  4719. tor_free(line);
  4720. } SMARTLIST_FOREACH_END(line);
  4721. smartlist_free(fw_helper_output);
  4722. return 0;
  4723. }
  4724. /** Spawn tor-fw-helper and ask it to forward the ports in
  4725. * <b>ports_to_forward</b>. <b>ports_to_forward</b> contains strings
  4726. * of the form "<external port>:<internal port>", which is the format
  4727. * that tor-fw-helper expects. */
  4728. void
  4729. tor_check_port_forwarding(const char *filename,
  4730. smartlist_t *ports_to_forward,
  4731. time_t now)
  4732. {
  4733. /* When fw-helper succeeds, how long do we wait until running it again */
  4734. #define TIME_TO_EXEC_FWHELPER_SUCCESS 300
  4735. /* When fw-helper failed to start, how long do we wait until running it again
  4736. */
  4737. #define TIME_TO_EXEC_FWHELPER_FAIL 60
  4738. /* Static variables are initialized to zero, so child_handle.status=0
  4739. * which corresponds to it not running on startup */
  4740. static process_handle_t *child_handle=NULL;
  4741. static time_t time_to_run_helper = 0;
  4742. int stderr_status, retval;
  4743. int stdout_status = 0;
  4744. tor_assert(filename);
  4745. /* Start the child, if it is not already running */
  4746. if ((!child_handle || child_handle->status != PROCESS_STATUS_RUNNING) &&
  4747. time_to_run_helper < now) {
  4748. /*tor-fw-helper cli looks like this: tor_fw_helper -p :5555 -p 4555:1111 */
  4749. const char **argv; /* cli arguments */
  4750. int args_n, status;
  4751. int argv_index = 0; /* index inside 'argv' */
  4752. tor_assert(smartlist_len(ports_to_forward) > 0);
  4753. /* check for overflow during 'argv' allocation:
  4754. (len(ports_to_forward)*2 + 2)*sizeof(char*) > SIZE_MAX ==
  4755. len(ports_to_forward) > (((SIZE_MAX/sizeof(char*)) - 2)/2) */
  4756. if ((size_t) smartlist_len(ports_to_forward) >
  4757. (((SIZE_MAX/sizeof(char*)) - 2)/2)) {
  4758. log_warn(LD_GENERAL,
  4759. "Overflow during argv allocation. This shouldn't happen.");
  4760. return;
  4761. }
  4762. /* check for overflow during 'argv_index' increase:
  4763. ((len(ports_to_forward)*2 + 2) > INT_MAX) ==
  4764. len(ports_to_forward) > (INT_MAX - 2)/2 */
  4765. if (smartlist_len(ports_to_forward) > (INT_MAX - 2)/2) {
  4766. log_warn(LD_GENERAL,
  4767. "Overflow during argv_index increase. This shouldn't happen.");
  4768. return;
  4769. }
  4770. /* Calculate number of cli arguments: one for the filename, two
  4771. for each smartlist element (one for "-p" and one for the
  4772. ports), and one for the final NULL. */
  4773. args_n = 1 + 2*smartlist_len(ports_to_forward) + 1;
  4774. argv = tor_calloc(args_n, sizeof(char *));
  4775. argv[argv_index++] = filename;
  4776. SMARTLIST_FOREACH_BEGIN(ports_to_forward, const char *, port) {
  4777. argv[argv_index++] = "-p";
  4778. argv[argv_index++] = port;
  4779. } SMARTLIST_FOREACH_END(port);
  4780. argv[argv_index] = NULL;
  4781. /* Assume tor-fw-helper will succeed, start it later*/
  4782. time_to_run_helper = now + TIME_TO_EXEC_FWHELPER_SUCCESS;
  4783. if (child_handle) {
  4784. tor_process_handle_destroy(child_handle, 1);
  4785. child_handle = NULL;
  4786. }
  4787. #ifdef _WIN32
  4788. /* Passing NULL as lpApplicationName makes Windows search for the .exe */
  4789. status = tor_spawn_background(NULL, argv, NULL, &child_handle);
  4790. #else
  4791. status = tor_spawn_background(filename, argv, NULL, &child_handle);
  4792. #endif
  4793. tor_free_((void*)argv);
  4794. argv=NULL;
  4795. if (PROCESS_STATUS_ERROR == status) {
  4796. log_warn(LD_GENERAL, "Failed to start port forwarding helper %s",
  4797. filename);
  4798. time_to_run_helper = now + TIME_TO_EXEC_FWHELPER_FAIL;
  4799. return;
  4800. }
  4801. log_info(LD_GENERAL,
  4802. "Started port forwarding helper (%s) with pid '%d'",
  4803. filename, tor_process_get_pid(child_handle));
  4804. }
  4805. /* If child is running, read from its stdout and stderr) */
  4806. if (child_handle && PROCESS_STATUS_RUNNING == child_handle->status) {
  4807. /* Read from stdout/stderr and log result */
  4808. retval = 0;
  4809. #ifdef _WIN32
  4810. stderr_status = log_from_handle(child_handle->stderr_pipe, LOG_INFO);
  4811. #else
  4812. stderr_status = log_from_pipe(child_handle->stderr_handle,
  4813. LOG_INFO, filename, &retval);
  4814. #endif
  4815. if (handle_fw_helper_output(filename, child_handle) < 0) {
  4816. log_warn(LD_GENERAL, "Failed to handle fw helper output.");
  4817. stdout_status = -1;
  4818. retval = -1;
  4819. }
  4820. if (retval) {
  4821. /* There was a problem in the child process */
  4822. time_to_run_helper = now + TIME_TO_EXEC_FWHELPER_FAIL;
  4823. }
  4824. /* Combine the two statuses in order of severity */
  4825. if (-1 == stdout_status || -1 == stderr_status)
  4826. /* There was a failure */
  4827. retval = -1;
  4828. #ifdef _WIN32
  4829. else if (!child_handle || tor_get_exit_code(child_handle, 0, NULL) !=
  4830. PROCESS_EXIT_RUNNING) {
  4831. /* process has exited or there was an error */
  4832. /* TODO: Do something with the process return value */
  4833. /* TODO: What if the process output something since
  4834. * between log_from_handle and tor_get_exit_code? */
  4835. retval = 1;
  4836. }
  4837. #else
  4838. else if (1 == stdout_status || 1 == stderr_status)
  4839. /* stdout or stderr was closed, the process probably
  4840. * exited. It will be reaped by waitpid() in main.c */
  4841. /* TODO: Do something with the process return value */
  4842. retval = 1;
  4843. #endif
  4844. else
  4845. /* Both are fine */
  4846. retval = 0;
  4847. /* If either pipe indicates a failure, act on it */
  4848. if (0 != retval) {
  4849. if (1 == retval) {
  4850. log_info(LD_GENERAL, "Port forwarding helper terminated");
  4851. child_handle->status = PROCESS_STATUS_NOTRUNNING;
  4852. } else {
  4853. log_warn(LD_GENERAL, "Failed to read from port forwarding helper");
  4854. child_handle->status = PROCESS_STATUS_ERROR;
  4855. }
  4856. /* TODO: The child might not actually be finished (maybe it failed or
  4857. closed stdout/stderr), so maybe we shouldn't start another? */
  4858. }
  4859. }
  4860. }
  4861. /** Initialize the insecure RNG <b>rng</b> from a seed value <b>seed</b>. */
  4862. void
  4863. tor_init_weak_random(tor_weak_rng_t *rng, unsigned seed)
  4864. {
  4865. rng->state = (uint32_t)(seed & 0x7fffffff);
  4866. }
  4867. /** Return a randomly chosen value in the range 0..TOR_WEAK_RANDOM_MAX based
  4868. * on the RNG state of <b>rng</b>. This entropy will not be cryptographically
  4869. * strong; do not rely on it for anything an adversary should not be able to
  4870. * predict. */
  4871. int32_t
  4872. tor_weak_random(tor_weak_rng_t *rng)
  4873. {
  4874. /* Here's a linear congruential generator. OpenBSD and glibc use these
  4875. * parameters; they aren't too bad, and should have maximal period over the
  4876. * range 0..INT32_MAX. We don't want to use the platform rand() or random(),
  4877. * since some platforms have bad weak RNGs that only return values in the
  4878. * range 0..INT16_MAX, which just isn't enough. */
  4879. rng->state = (rng->state * 1103515245 + 12345) & 0x7fffffff;
  4880. return (int32_t) rng->state;
  4881. }
  4882. /** Return a random number in the range [0 , <b>top</b>). {That is, the range
  4883. * of integers i such that 0 <= i < top.} Chooses uniformly. Requires that
  4884. * top is greater than 0. This randomness is not cryptographically strong; do
  4885. * not rely on it for anything an adversary should not be able to predict. */
  4886. int32_t
  4887. tor_weak_random_range(tor_weak_rng_t *rng, int32_t top)
  4888. {
  4889. /* We don't want to just do tor_weak_random() % top, since random() is often
  4890. * implemented with an LCG whose modulus is a power of 2, and those are
  4891. * cyclic in their low-order bits. */
  4892. int divisor, result;
  4893. tor_assert(top > 0);
  4894. divisor = TOR_WEAK_RANDOM_MAX / top;
  4895. do {
  4896. result = (int32_t)(tor_weak_random(rng) / divisor);
  4897. } while (result >= top);
  4898. return result;
  4899. }
  4900. /** Cast a given double value to a int64_t. Return 0 if number is NaN.
  4901. * Returns either INT64_MIN or INT64_MAX if number is outside of the int64_t
  4902. * range. */
  4903. int64_t
  4904. clamp_double_to_int64(double number)
  4905. {
  4906. int exp;
  4907. /* NaN is a special case that can't be used with the logic below. */
  4908. if (isnan(number)) {
  4909. return 0;
  4910. }
  4911. /* Time to validate if result can overflows a int64_t value. Fun with
  4912. * float! Find that exponent exp such that
  4913. * number == x * 2^exp
  4914. * for some x with abs(x) in [0.5, 1.0). Note that this implies that the
  4915. * magnitude of number is strictly less than 2^exp.
  4916. *
  4917. * If number is infinite, the call to frexp is legal but the contents of
  4918. * exp are unspecified. */
  4919. frexp(number, &exp);
  4920. /* If the magnitude of number is strictly less than 2^63, the truncated
  4921. * version of number is guaranteed to be representable. The only
  4922. * representable integer for which this is not the case is INT64_MIN, but
  4923. * it is covered by the logic below. */
  4924. if (isfinite(number) && exp <= 63) {
  4925. return number;
  4926. }
  4927. /* Handle infinities and finite numbers with magnitude >= 2^63. */
  4928. return signbit(number) ? INT64_MIN : INT64_MAX;
  4929. }