util.c 125 KB

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