util.c 149 KB

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