util.c 125 KB

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