util.c 136 KB

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