util.c 147 KB

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