util.c 161 KB

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