util.c 156 KB

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