util.c 142 KB

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