util.c 122 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423
  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. #ifndef OPENBSD
  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. /** Return a time_t given a struct tm. The result is given in GMT, and
  1222. * does not account for leap seconds.
  1223. */
  1224. time_t
  1225. tor_timegm(struct tm *tm)
  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. log_warn(LD_BUG, "Out-of-range argument to tor_timegm");
  1235. return -1;
  1236. }
  1237. tor_assert(year < INT_MAX);
  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. return seconds;
  1248. }
  1249. /* strftime is locale-specific, so we need to replace those parts */
  1250. /** A c-locale array of 3-letter names of weekdays, starting with Sun. */
  1251. static const char *WEEKDAY_NAMES[] =
  1252. { "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" };
  1253. /** A c-locale array of 3-letter names of months, starting with Jan. */
  1254. static const char *MONTH_NAMES[] =
  1255. { "Jan", "Feb", "Mar", "Apr", "May", "Jun",
  1256. "Jul", "Aug", "Sep", "Oct", "Nov", "Dec" };
  1257. /** Set <b>buf</b> to the RFC1123 encoding of the GMT value of <b>t</b>.
  1258. * The buffer must be at least RFC1123_TIME_LEN+1 bytes long.
  1259. *
  1260. * (RFC1123 format is Fri, 29 Sep 2006 15:54:20 GMT)
  1261. */
  1262. void
  1263. format_rfc1123_time(char *buf, time_t t)
  1264. {
  1265. struct tm tm;
  1266. tor_gmtime_r(&t, &tm);
  1267. strftime(buf, RFC1123_TIME_LEN+1, "___, %d ___ %Y %H:%M:%S GMT", &tm);
  1268. tor_assert(tm.tm_wday >= 0);
  1269. tor_assert(tm.tm_wday <= 6);
  1270. memcpy(buf, WEEKDAY_NAMES[tm.tm_wday], 3);
  1271. tor_assert(tm.tm_mon >= 0);
  1272. tor_assert(tm.tm_mon <= 11);
  1273. memcpy(buf+8, MONTH_NAMES[tm.tm_mon], 3);
  1274. }
  1275. /** Parse the RFC1123 encoding of some time (in GMT) from <b>buf</b>,
  1276. * and store the result in *<b>t</b>.
  1277. *
  1278. * Return 0 on success, -1 on failure.
  1279. */
  1280. int
  1281. parse_rfc1123_time(const char *buf, time_t *t)
  1282. {
  1283. struct tm tm;
  1284. char month[4];
  1285. char weekday[4];
  1286. int i, m;
  1287. unsigned tm_mday, tm_year, tm_hour, tm_min, tm_sec;
  1288. if (strlen(buf) != RFC1123_TIME_LEN)
  1289. return -1;
  1290. memset(&tm, 0, sizeof(tm));
  1291. if (tor_sscanf(buf, "%3s, %2u %3s %u %2u:%2u:%2u GMT", weekday,
  1292. &tm_mday, month, &tm_year, &tm_hour,
  1293. &tm_min, &tm_sec) < 7) {
  1294. char *esc = esc_for_log(buf);
  1295. log_warn(LD_GENERAL, "Got invalid RFC1123 time %s", esc);
  1296. tor_free(esc);
  1297. return -1;
  1298. }
  1299. if (tm_mday < 1 || tm_mday > 31 || tm_hour > 23 || tm_min > 59 ||
  1300. tm_sec > 60) {
  1301. char *esc = esc_for_log(buf);
  1302. log_warn(LD_GENERAL, "Got invalid RFC1123 time %s", esc);
  1303. tor_free(esc);
  1304. return -1;
  1305. }
  1306. tm.tm_mday = (int)tm_mday;
  1307. tm.tm_year = (int)tm_year;
  1308. tm.tm_hour = (int)tm_hour;
  1309. tm.tm_min = (int)tm_min;
  1310. tm.tm_sec = (int)tm_sec;
  1311. m = -1;
  1312. for (i = 0; i < 12; ++i) {
  1313. if (!strcmp(month, MONTH_NAMES[i])) {
  1314. m = i;
  1315. break;
  1316. }
  1317. }
  1318. if (m<0) {
  1319. char *esc = esc_for_log(buf);
  1320. log_warn(LD_GENERAL, "Got invalid RFC1123 time %s: No such month", esc);
  1321. tor_free(esc);
  1322. return -1;
  1323. }
  1324. tm.tm_mon = m;
  1325. if (tm.tm_year < 1970) {
  1326. char *esc = esc_for_log(buf);
  1327. log_warn(LD_GENERAL,
  1328. "Got invalid RFC1123 time %s. (Before 1970)", esc);
  1329. tor_free(esc);
  1330. return -1;
  1331. }
  1332. tm.tm_year -= 1900;
  1333. *t = tor_timegm(&tm);
  1334. return 0;
  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) {
  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 = 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. *t = tor_timegm(&st_tm);
  1410. return 0;
  1411. }
  1412. /** Given a <b>date</b> in one of the three formats allowed by HTTP (ugh),
  1413. * parse it into <b>tm</b>. Return 0 on success, negative on failure. */
  1414. int
  1415. parse_http_time(const char *date, struct tm *tm)
  1416. {
  1417. const char *cp;
  1418. char month[4];
  1419. char wkday[4];
  1420. int i;
  1421. unsigned tm_mday, tm_year, tm_hour, tm_min, tm_sec;
  1422. tor_assert(tm);
  1423. memset(tm, 0, sizeof(*tm));
  1424. /* First, try RFC1123 or RFC850 format: skip the weekday. */
  1425. if ((cp = strchr(date, ','))) {
  1426. ++cp;
  1427. if (*cp != ' ')
  1428. return -1;
  1429. ++cp;
  1430. if (tor_sscanf(cp, "%2u %3s %4u %2u:%2u:%2u GMT",
  1431. &tm_mday, month, &tm_year,
  1432. &tm_hour, &tm_min, &tm_sec) == 6) {
  1433. /* rfc1123-date */
  1434. tm_year -= 1900;
  1435. } else if (tor_sscanf(cp, "%2u-%3s-%2u %2u:%2u:%2u GMT",
  1436. &tm_mday, month, &tm_year,
  1437. &tm_hour, &tm_min, &tm_sec) == 6) {
  1438. /* rfc850-date */
  1439. } else {
  1440. return -1;
  1441. }
  1442. } else {
  1443. /* No comma; possibly asctime() format. */
  1444. if (tor_sscanf(date, "%3s %3s %2u %2u:%2u:%2u %4u",
  1445. wkday, month, &tm_mday,
  1446. &tm_hour, &tm_min, &tm_sec, &tm_year) == 7) {
  1447. tm_year -= 1900;
  1448. } else {
  1449. return -1;
  1450. }
  1451. }
  1452. tm->tm_mday = (int)tm_mday;
  1453. tm->tm_year = (int)tm_year;
  1454. tm->tm_hour = (int)tm_hour;
  1455. tm->tm_min = (int)tm_min;
  1456. tm->tm_sec = (int)tm_sec;
  1457. month[3] = '\0';
  1458. /* Okay, now decode the month. */
  1459. /* set tm->tm_mon to dummy value so the check below fails. */
  1460. tm->tm_mon = -1;
  1461. for (i = 0; i < 12; ++i) {
  1462. if (!strcasecmp(MONTH_NAMES[i], month)) {
  1463. tm->tm_mon = i;
  1464. }
  1465. }
  1466. if (tm->tm_year < 0 ||
  1467. tm->tm_mon < 0 || tm->tm_mon > 11 ||
  1468. tm->tm_mday < 1 || tm->tm_mday > 31 ||
  1469. tm->tm_hour < 0 || tm->tm_hour > 23 ||
  1470. tm->tm_min < 0 || tm->tm_min > 59 ||
  1471. tm->tm_sec < 0 || tm->tm_sec > 60)
  1472. return -1; /* Out of range, or bad month. */
  1473. return 0;
  1474. }
  1475. /** Given an <b>interval</b> in seconds, try to write it to the
  1476. * <b>out_len</b>-byte buffer in <b>out</b> in a human-readable form.
  1477. * Return 0 on success, -1 on failure.
  1478. */
  1479. int
  1480. format_time_interval(char *out, size_t out_len, long interval)
  1481. {
  1482. /* We only report seconds if there's no hours. */
  1483. long sec = 0, min = 0, hour = 0, day = 0;
  1484. if (interval < 0)
  1485. interval = -interval;
  1486. if (interval >= 86400) {
  1487. day = interval / 86400;
  1488. interval %= 86400;
  1489. }
  1490. if (interval >= 3600) {
  1491. hour = interval / 3600;
  1492. interval %= 3600;
  1493. }
  1494. if (interval >= 60) {
  1495. min = interval / 60;
  1496. interval %= 60;
  1497. }
  1498. sec = interval;
  1499. if (day) {
  1500. return tor_snprintf(out, out_len, "%ld days, %ld hours, %ld minutes",
  1501. day, hour, min);
  1502. } else if (hour) {
  1503. return tor_snprintf(out, out_len, "%ld hours, %ld minutes", hour, min);
  1504. } else if (min) {
  1505. return tor_snprintf(out, out_len, "%ld minutes, %ld seconds", min, sec);
  1506. } else {
  1507. return tor_snprintf(out, out_len, "%ld seconds", sec);
  1508. }
  1509. }
  1510. /* =====
  1511. * Cached time
  1512. * ===== */
  1513. #ifndef TIME_IS_FAST
  1514. /** Cached estimate of the current time. Updated around once per second;
  1515. * may be a few seconds off if we are really busy. This is a hack to avoid
  1516. * calling time(NULL) (which not everybody has optimized) on critical paths.
  1517. */
  1518. static time_t cached_approx_time = 0;
  1519. /** Return a cached estimate of the current time from when
  1520. * update_approx_time() was last called. This is a hack to avoid calling
  1521. * time(NULL) on critical paths: please do not even think of calling it
  1522. * anywhere else. */
  1523. time_t
  1524. approx_time(void)
  1525. {
  1526. return cached_approx_time;
  1527. }
  1528. /** Update the cached estimate of the current time. This function SHOULD be
  1529. * called once per second, and MUST be called before the first call to
  1530. * get_approx_time. */
  1531. void
  1532. update_approx_time(time_t now)
  1533. {
  1534. cached_approx_time = now;
  1535. }
  1536. #endif
  1537. /* =====
  1538. * Rate limiting
  1539. * ===== */
  1540. /** If the rate-limiter <b>lim</b> is ready at <b>now</b>, return the number
  1541. * of calls to rate_limit_is_ready (including this one!) since the last time
  1542. * rate_limit_is_ready returned nonzero. Otherwise return 0. */
  1543. static int
  1544. rate_limit_is_ready(ratelim_t *lim, time_t now)
  1545. {
  1546. if (lim->rate + lim->last_allowed <= now) {
  1547. int res = lim->n_calls_since_last_time + 1;
  1548. lim->last_allowed = now;
  1549. lim->n_calls_since_last_time = 0;
  1550. return res;
  1551. } else {
  1552. ++lim->n_calls_since_last_time;
  1553. return 0;
  1554. }
  1555. }
  1556. /** If the rate-limiter <b>lim</b> is ready at <b>now</b>, return a newly
  1557. * allocated string indicating how many messages were suppressed, suitable to
  1558. * append to a log message. Otherwise return NULL. */
  1559. char *
  1560. rate_limit_log(ratelim_t *lim, time_t now)
  1561. {
  1562. int n;
  1563. if ((n = rate_limit_is_ready(lim, now))) {
  1564. if (n == 1) {
  1565. return tor_strdup("");
  1566. } else {
  1567. char *cp=NULL;
  1568. tor_asprintf(&cp,
  1569. " [%d similar message(s) suppressed in last %d seconds]",
  1570. n-1, lim->rate);
  1571. return cp;
  1572. }
  1573. } else {
  1574. return NULL;
  1575. }
  1576. }
  1577. /* =====
  1578. * File helpers
  1579. * ===== */
  1580. /** Write <b>count</b> bytes from <b>buf</b> to <b>fd</b>. <b>isSocket</b>
  1581. * must be 1 if fd was returned by socket() or accept(), and 0 if fd
  1582. * was returned by open(). Return the number of bytes written, or -1
  1583. * on error. Only use if fd is a blocking fd. */
  1584. ssize_t
  1585. write_all(tor_socket_t fd, const char *buf, size_t count, int isSocket)
  1586. {
  1587. size_t written = 0;
  1588. ssize_t result;
  1589. tor_assert(count < SSIZE_T_MAX);
  1590. while (written != count) {
  1591. if (isSocket)
  1592. result = tor_socket_send(fd, buf+written, count-written, 0);
  1593. else
  1594. result = write((int)fd, buf+written, count-written);
  1595. if (result<0)
  1596. return -1;
  1597. written += result;
  1598. }
  1599. return (ssize_t)count;
  1600. }
  1601. /** Read from <b>fd</b> to <b>buf</b>, until we get <b>count</b> bytes
  1602. * or reach the end of the file. <b>isSocket</b> must be 1 if fd
  1603. * was returned by socket() or accept(), and 0 if fd was returned by
  1604. * open(). Return the number of bytes read, or -1 on error. Only use
  1605. * if fd is a blocking fd. */
  1606. ssize_t
  1607. read_all(tor_socket_t fd, char *buf, size_t count, int isSocket)
  1608. {
  1609. size_t numread = 0;
  1610. ssize_t result;
  1611. if (count > SIZE_T_CEILING || count > SSIZE_T_MAX)
  1612. return -1;
  1613. while (numread != count) {
  1614. if (isSocket)
  1615. result = tor_socket_recv(fd, buf+numread, count-numread, 0);
  1616. else
  1617. result = read((int)fd, buf+numread, count-numread);
  1618. if (result<0)
  1619. return -1;
  1620. else if (result == 0)
  1621. break;
  1622. numread += result;
  1623. }
  1624. return (ssize_t)numread;
  1625. }
  1626. /*
  1627. * Filesystem operations.
  1628. */
  1629. /** Clean up <b>name</b> so that we can use it in a call to "stat". On Unix,
  1630. * we do nothing. On Windows, we remove a trailing slash, unless the path is
  1631. * the root of a disk. */
  1632. static void
  1633. clean_name_for_stat(char *name)
  1634. {
  1635. #ifdef _WIN32
  1636. size_t len = strlen(name);
  1637. if (!len)
  1638. return;
  1639. if (name[len-1]=='\\' || name[len-1]=='/') {
  1640. if (len == 1 || (len==3 && name[1]==':'))
  1641. return;
  1642. name[len-1]='\0';
  1643. }
  1644. #else
  1645. (void)name;
  1646. #endif
  1647. }
  1648. /** Return FN_ERROR if filename can't be read, FN_NOENT if it doesn't
  1649. * exist, FN_FILE if it is a regular file, or FN_DIR if it's a
  1650. * directory. On FN_ERROR, sets errno. */
  1651. file_status_t
  1652. file_status(const char *fname)
  1653. {
  1654. struct stat st;
  1655. char *f;
  1656. int r;
  1657. f = tor_strdup(fname);
  1658. clean_name_for_stat(f);
  1659. r = stat(f, &st);
  1660. tor_free(f);
  1661. if (r) {
  1662. if (errno == ENOENT) {
  1663. return FN_NOENT;
  1664. }
  1665. return FN_ERROR;
  1666. }
  1667. if (st.st_mode & S_IFDIR)
  1668. return FN_DIR;
  1669. else if (st.st_mode & S_IFREG)
  1670. return FN_FILE;
  1671. else
  1672. return FN_ERROR;
  1673. }
  1674. /** Check whether <b>dirname</b> exists and is private. If yes return 0. If
  1675. * it does not exist, and <b>check</b>&CPD_CREATE is set, try to create it
  1676. * and return 0 on success. If it does not exist, and
  1677. * <b>check</b>&CPD_CHECK, and we think we can create it, return 0. Else
  1678. * return -1. If CPD_GROUP_OK is set, then it's okay if the directory
  1679. * is group-readable, but in all cases we create the directory mode 0700.
  1680. * If CPD_CHECK_MODE_ONLY is set, then we don't alter the directory permissions
  1681. * if they are too permissive: we just return -1.
  1682. * When effective_user is not NULL, check permissions against the given user
  1683. * and its primary group.
  1684. */
  1685. int
  1686. check_private_dir(const char *dirname, cpd_check_t check,
  1687. const char *effective_user)
  1688. {
  1689. int r;
  1690. struct stat st;
  1691. char *f;
  1692. #ifndef _WIN32
  1693. int mask;
  1694. struct passwd *pw = NULL;
  1695. uid_t running_uid;
  1696. gid_t running_gid;
  1697. #else
  1698. (void)effective_user;
  1699. #endif
  1700. tor_assert(dirname);
  1701. f = tor_strdup(dirname);
  1702. clean_name_for_stat(f);
  1703. r = stat(f, &st);
  1704. tor_free(f);
  1705. if (r) {
  1706. if (errno != ENOENT) {
  1707. log_warn(LD_FS, "Directory %s cannot be read: %s", dirname,
  1708. strerror(errno));
  1709. return -1;
  1710. }
  1711. if (check & CPD_CREATE) {
  1712. log_info(LD_GENERAL, "Creating directory %s", dirname);
  1713. #if defined (_WIN32) && !defined (WINCE)
  1714. r = mkdir(dirname);
  1715. #else
  1716. r = mkdir(dirname, 0700);
  1717. #endif
  1718. if (r) {
  1719. log_warn(LD_FS, "Error creating directory %s: %s", dirname,
  1720. strerror(errno));
  1721. return -1;
  1722. }
  1723. } else if (!(check & CPD_CHECK)) {
  1724. log_warn(LD_FS, "Directory %s does not exist.", dirname);
  1725. return -1;
  1726. }
  1727. /* XXXX In the case where check==CPD_CHECK, we should look at the
  1728. * parent directory a little harder. */
  1729. return 0;
  1730. }
  1731. if (!(st.st_mode & S_IFDIR)) {
  1732. log_warn(LD_FS, "%s is not a directory", dirname);
  1733. return -1;
  1734. }
  1735. #ifndef _WIN32
  1736. if (effective_user) {
  1737. /* Look up the user and group information.
  1738. * If we have a problem, bail out. */
  1739. pw = getpwnam(effective_user);
  1740. if (pw == NULL) {
  1741. log_warn(LD_CONFIG, "Error setting configured user: %s not found",
  1742. effective_user);
  1743. return -1;
  1744. }
  1745. running_uid = pw->pw_uid;
  1746. running_gid = pw->pw_gid;
  1747. } else {
  1748. running_uid = getuid();
  1749. running_gid = getgid();
  1750. }
  1751. if (st.st_uid != running_uid) {
  1752. struct passwd *pw = NULL;
  1753. char *process_ownername = NULL;
  1754. pw = getpwuid(running_uid);
  1755. process_ownername = pw ? tor_strdup(pw->pw_name) : tor_strdup("<unknown>");
  1756. pw = getpwuid(st.st_uid);
  1757. log_warn(LD_FS, "%s is not owned by this user (%s, %d) but by "
  1758. "%s (%d). Perhaps you are running Tor as the wrong user?",
  1759. dirname, process_ownername, (int)running_uid,
  1760. pw ? pw->pw_name : "<unknown>", (int)st.st_uid);
  1761. tor_free(process_ownername);
  1762. return -1;
  1763. }
  1764. if ((check & CPD_GROUP_OK) && st.st_gid != running_gid) {
  1765. struct group *gr;
  1766. char *process_groupname = NULL;
  1767. gr = getgrgid(running_gid);
  1768. process_groupname = gr ? tor_strdup(gr->gr_name) : tor_strdup("<unknown>");
  1769. gr = getgrgid(st.st_gid);
  1770. log_warn(LD_FS, "%s is not owned by this group (%s, %d) but by group "
  1771. "%s (%d). Are you running Tor as the wrong user?",
  1772. dirname, process_groupname, (int)running_gid,
  1773. gr ? gr->gr_name : "<unknown>", (int)st.st_gid);
  1774. tor_free(process_groupname);
  1775. return -1;
  1776. }
  1777. if (check & CPD_GROUP_OK) {
  1778. mask = 0027;
  1779. } else {
  1780. mask = 0077;
  1781. }
  1782. if (st.st_mode & mask) {
  1783. unsigned new_mode;
  1784. if (check & CPD_CHECK_MODE_ONLY) {
  1785. log_warn(LD_FS, "Permissions on directory %s are too permissive.",
  1786. dirname);
  1787. return -1;
  1788. }
  1789. log_warn(LD_FS, "Fixing permissions on directory %s", dirname);
  1790. new_mode = st.st_mode;
  1791. new_mode |= 0700; /* Owner should have rwx */
  1792. new_mode &= ~mask; /* Clear the other bits that we didn't want set...*/
  1793. if (chmod(dirname, new_mode)) {
  1794. log_warn(LD_FS, "Could not chmod directory %s: %s", dirname,
  1795. strerror(errno));
  1796. return -1;
  1797. } else {
  1798. return 0;
  1799. }
  1800. }
  1801. #endif
  1802. return 0;
  1803. }
  1804. /** Create a file named <b>fname</b> with the contents <b>str</b>. Overwrite
  1805. * the previous <b>fname</b> if possible. Return 0 on success, -1 on failure.
  1806. *
  1807. * This function replaces the old file atomically, if possible. This
  1808. * function, and all other functions in util.c that create files, create them
  1809. * with mode 0600.
  1810. */
  1811. int
  1812. write_str_to_file(const char *fname, const char *str, int bin)
  1813. {
  1814. #ifdef _WIN32
  1815. if (!bin && strchr(str, '\r')) {
  1816. log_warn(LD_BUG,
  1817. "We're writing a text string that already contains a CR.");
  1818. }
  1819. #endif
  1820. return write_bytes_to_file(fname, str, strlen(str), bin);
  1821. }
  1822. /** Represents a file that we're writing to, with support for atomic commit:
  1823. * we can write into a temporary file, and either remove the file on
  1824. * failure, or replace the original file on success. */
  1825. struct open_file_t {
  1826. char *tempname; /**< Name of the temporary file. */
  1827. char *filename; /**< Name of the original file. */
  1828. unsigned rename_on_close:1; /**< Are we using the temporary file or not? */
  1829. unsigned binary:1; /**< Did we open in binary mode? */
  1830. int fd; /**< fd for the open file. */
  1831. FILE *stdio_file; /**< stdio wrapper for <b>fd</b>. */
  1832. };
  1833. /** Try to start writing to the file in <b>fname</b>, passing the flags
  1834. * <b>open_flags</b> to the open() syscall, creating the file (if needed) with
  1835. * access value <b>mode</b>. If the O_APPEND flag is set, we append to the
  1836. * original file. Otherwise, we open a new temporary file in the same
  1837. * directory, and either replace the original or remove the temporary file
  1838. * when we're done.
  1839. *
  1840. * Return the fd for the newly opened file, and store working data in
  1841. * *<b>data_out</b>. The caller should not close the fd manually:
  1842. * instead, call finish_writing_to_file() or abort_writing_to_file().
  1843. * Returns -1 on failure.
  1844. *
  1845. * NOTE: When not appending, the flags O_CREAT and O_TRUNC are treated
  1846. * as true and the flag O_EXCL is treated as false.
  1847. *
  1848. * NOTE: Ordinarily, O_APPEND means "seek to the end of the file before each
  1849. * write()". We don't do that.
  1850. */
  1851. int
  1852. start_writing_to_file(const char *fname, int open_flags, int mode,
  1853. open_file_t **data_out)
  1854. {
  1855. open_file_t *new_file = tor_malloc_zero(sizeof(open_file_t));
  1856. const char *open_name;
  1857. int append = 0;
  1858. tor_assert(fname);
  1859. tor_assert(data_out);
  1860. #if (O_BINARY != 0 && O_TEXT != 0)
  1861. tor_assert((open_flags & (O_BINARY|O_TEXT)) != 0);
  1862. #endif
  1863. new_file->fd = -1;
  1864. new_file->filename = tor_strdup(fname);
  1865. if (open_flags & O_APPEND) {
  1866. open_name = fname;
  1867. new_file->rename_on_close = 0;
  1868. append = 1;
  1869. open_flags &= ~O_APPEND;
  1870. } else {
  1871. tor_asprintf(&new_file->tempname, "%s.tmp", fname);
  1872. open_name = new_file->tempname;
  1873. /* We always replace an existing temporary file if there is one. */
  1874. open_flags |= O_CREAT|O_TRUNC;
  1875. open_flags &= ~O_EXCL;
  1876. new_file->rename_on_close = 1;
  1877. }
  1878. if (open_flags & O_BINARY)
  1879. new_file->binary = 1;
  1880. new_file->fd = tor_open_cloexec(open_name, open_flags, mode);
  1881. if (new_file->fd < 0) {
  1882. log_warn(LD_FS, "Couldn't open \"%s\" (%s) for writing: %s",
  1883. open_name, fname, strerror(errno));
  1884. goto err;
  1885. }
  1886. if (append) {
  1887. if (tor_fd_seekend(new_file->fd) < 0) {
  1888. log_warn(LD_FS, "Couldn't seek to end of file \"%s\": %s", open_name,
  1889. strerror(errno));
  1890. goto err;
  1891. }
  1892. }
  1893. *data_out = new_file;
  1894. return new_file->fd;
  1895. err:
  1896. if (new_file->fd >= 0)
  1897. close(new_file->fd);
  1898. *data_out = NULL;
  1899. tor_free(new_file->filename);
  1900. tor_free(new_file->tempname);
  1901. tor_free(new_file);
  1902. return -1;
  1903. }
  1904. /** Given <b>file_data</b> from start_writing_to_file(), return a stdio FILE*
  1905. * that can be used to write to the same file. The caller should not mix
  1906. * stdio calls with non-stdio calls. */
  1907. FILE *
  1908. fdopen_file(open_file_t *file_data)
  1909. {
  1910. tor_assert(file_data);
  1911. if (file_data->stdio_file)
  1912. return file_data->stdio_file;
  1913. tor_assert(file_data->fd >= 0);
  1914. if (!(file_data->stdio_file = fdopen(file_data->fd,
  1915. file_data->binary?"ab":"a"))) {
  1916. log_warn(LD_FS, "Couldn't fdopen \"%s\" [%d]: %s", file_data->filename,
  1917. file_data->fd, strerror(errno));
  1918. }
  1919. return file_data->stdio_file;
  1920. }
  1921. /** Combines start_writing_to_file with fdopen_file(): arguments are as
  1922. * for start_writing_to_file, but */
  1923. FILE *
  1924. start_writing_to_stdio_file(const char *fname, int open_flags, int mode,
  1925. open_file_t **data_out)
  1926. {
  1927. FILE *res;
  1928. if (start_writing_to_file(fname, open_flags, mode, data_out)<0)
  1929. return NULL;
  1930. if (!(res = fdopen_file(*data_out))) {
  1931. abort_writing_to_file(*data_out);
  1932. *data_out = NULL;
  1933. }
  1934. return res;
  1935. }
  1936. /** Helper function: close and free the underlying file and memory in
  1937. * <b>file_data</b>. If we were writing into a temporary file, then delete
  1938. * that file (if abort_write is true) or replaces the target file with
  1939. * the temporary file (if abort_write is false). */
  1940. static int
  1941. finish_writing_to_file_impl(open_file_t *file_data, int abort_write)
  1942. {
  1943. int r = 0;
  1944. tor_assert(file_data && file_data->filename);
  1945. if (file_data->stdio_file) {
  1946. if (fclose(file_data->stdio_file)) {
  1947. log_warn(LD_FS, "Error closing \"%s\": %s", file_data->filename,
  1948. strerror(errno));
  1949. abort_write = r = -1;
  1950. }
  1951. } else if (file_data->fd >= 0 && close(file_data->fd) < 0) {
  1952. log_warn(LD_FS, "Error flushing \"%s\": %s", file_data->filename,
  1953. strerror(errno));
  1954. abort_write = r = -1;
  1955. }
  1956. if (file_data->rename_on_close) {
  1957. tor_assert(file_data->tempname && file_data->filename);
  1958. if (abort_write) {
  1959. unlink(file_data->tempname);
  1960. } else {
  1961. tor_assert(strcmp(file_data->filename, file_data->tempname));
  1962. if (replace_file(file_data->tempname, file_data->filename)) {
  1963. log_warn(LD_FS, "Error replacing \"%s\": %s", file_data->filename,
  1964. strerror(errno));
  1965. r = -1;
  1966. }
  1967. }
  1968. }
  1969. tor_free(file_data->filename);
  1970. tor_free(file_data->tempname);
  1971. tor_free(file_data);
  1972. return r;
  1973. }
  1974. /** Finish writing to <b>file_data</b>: close the file handle, free memory as
  1975. * needed, and if using a temporary file, replace the original file with
  1976. * the temporary file. */
  1977. int
  1978. finish_writing_to_file(open_file_t *file_data)
  1979. {
  1980. return finish_writing_to_file_impl(file_data, 0);
  1981. }
  1982. /** Finish writing to <b>file_data</b>: close the file handle, free memory as
  1983. * needed, and if using a temporary file, delete it. */
  1984. int
  1985. abort_writing_to_file(open_file_t *file_data)
  1986. {
  1987. return finish_writing_to_file_impl(file_data, 1);
  1988. }
  1989. /** Helper: given a set of flags as passed to open(2), open the file
  1990. * <b>fname</b> and write all the sized_chunk_t structs in <b>chunks</b> to
  1991. * the file. Do so as atomically as possible e.g. by opening temp files and
  1992. * renaming. */
  1993. static int
  1994. write_chunks_to_file_impl(const char *fname, const smartlist_t *chunks,
  1995. int open_flags)
  1996. {
  1997. open_file_t *file = NULL;
  1998. int fd;
  1999. ssize_t result;
  2000. fd = start_writing_to_file(fname, open_flags, 0600, &file);
  2001. if (fd<0)
  2002. return -1;
  2003. SMARTLIST_FOREACH(chunks, sized_chunk_t *, chunk,
  2004. {
  2005. result = write_all(fd, chunk->bytes, chunk->len, 0);
  2006. if (result < 0) {
  2007. log_warn(LD_FS, "Error writing to \"%s\": %s", fname,
  2008. strerror(errno));
  2009. goto err;
  2010. }
  2011. tor_assert((size_t)result == chunk->len);
  2012. });
  2013. return finish_writing_to_file(file);
  2014. err:
  2015. abort_writing_to_file(file);
  2016. return -1;
  2017. }
  2018. /** Given a smartlist of sized_chunk_t, write them atomically to a file
  2019. * <b>fname</b>, overwriting or creating the file as necessary. */
  2020. int
  2021. write_chunks_to_file(const char *fname, const smartlist_t *chunks, int bin)
  2022. {
  2023. int flags = OPEN_FLAGS_REPLACE|(bin?O_BINARY:O_TEXT);
  2024. return write_chunks_to_file_impl(fname, chunks, flags);
  2025. }
  2026. /** Write <b>len</b> bytes, starting at <b>str</b>, to <b>fname</b>
  2027. using the open() flags passed in <b>flags</b>. */
  2028. static int
  2029. write_bytes_to_file_impl(const char *fname, const char *str, size_t len,
  2030. int flags)
  2031. {
  2032. int r;
  2033. sized_chunk_t c = { str, len };
  2034. smartlist_t *chunks = smartlist_new();
  2035. smartlist_add(chunks, &c);
  2036. r = write_chunks_to_file_impl(fname, chunks, flags);
  2037. smartlist_free(chunks);
  2038. return r;
  2039. }
  2040. /** As write_str_to_file, but does not assume a NUL-terminated
  2041. * string. Instead, we write <b>len</b> bytes, starting at <b>str</b>. */
  2042. int
  2043. write_bytes_to_file(const char *fname, const char *str, size_t len,
  2044. int bin)
  2045. {
  2046. return write_bytes_to_file_impl(fname, str, len,
  2047. OPEN_FLAGS_REPLACE|(bin?O_BINARY:O_TEXT));
  2048. }
  2049. /** As write_bytes_to_file, but if the file already exists, append the bytes
  2050. * to the end of the file instead of overwriting it. */
  2051. int
  2052. append_bytes_to_file(const char *fname, const char *str, size_t len,
  2053. int bin)
  2054. {
  2055. return write_bytes_to_file_impl(fname, str, len,
  2056. OPEN_FLAGS_APPEND|(bin?O_BINARY:O_TEXT));
  2057. }
  2058. /** Like write_str_to_file(), but also return -1 if there was a file
  2059. already residing in <b>fname</b>. */
  2060. int
  2061. write_bytes_to_new_file(const char *fname, const char *str, size_t len,
  2062. int bin)
  2063. {
  2064. return write_bytes_to_file_impl(fname, str, len,
  2065. OPEN_FLAGS_DONT_REPLACE|
  2066. (bin?O_BINARY:O_TEXT));
  2067. }
  2068. /** Read the contents of <b>filename</b> into a newly allocated
  2069. * string; return the string on success or NULL on failure.
  2070. *
  2071. * If <b>stat_out</b> is provided, store the result of stat()ing the
  2072. * file into <b>stat_out</b>.
  2073. *
  2074. * If <b>flags</b> &amp; RFTS_BIN, open the file in binary mode.
  2075. * If <b>flags</b> &amp; RFTS_IGNORE_MISSING, don't warn if the file
  2076. * doesn't exist.
  2077. */
  2078. /*
  2079. * This function <em>may</em> return an erroneous result if the file
  2080. * is modified while it is running, but must not crash or overflow.
  2081. * Right now, the error case occurs when the file length grows between
  2082. * the call to stat and the call to read_all: the resulting string will
  2083. * be truncated.
  2084. */
  2085. char *
  2086. read_file_to_str(const char *filename, int flags, struct stat *stat_out)
  2087. {
  2088. int fd; /* router file */
  2089. struct stat statbuf;
  2090. char *string;
  2091. ssize_t r;
  2092. int bin = flags & RFTS_BIN;
  2093. tor_assert(filename);
  2094. fd = tor_open_cloexec(filename,O_RDONLY|(bin?O_BINARY:O_TEXT),0);
  2095. if (fd<0) {
  2096. int severity = LOG_WARN;
  2097. int save_errno = errno;
  2098. if (errno == ENOENT && (flags & RFTS_IGNORE_MISSING))
  2099. severity = LOG_INFO;
  2100. log_fn(severity, LD_FS,"Could not open \"%s\": %s",filename,
  2101. strerror(errno));
  2102. errno = save_errno;
  2103. return NULL;
  2104. }
  2105. if (fstat(fd, &statbuf)<0) {
  2106. int save_errno = errno;
  2107. close(fd);
  2108. log_warn(LD_FS,"Could not fstat \"%s\".",filename);
  2109. errno = save_errno;
  2110. return NULL;
  2111. }
  2112. if ((uint64_t)(statbuf.st_size)+1 >= SIZE_T_CEILING)
  2113. return NULL;
  2114. string = tor_malloc((size_t)(statbuf.st_size+1));
  2115. r = read_all(fd,string,(size_t)statbuf.st_size,0);
  2116. if (r<0) {
  2117. int save_errno = errno;
  2118. log_warn(LD_FS,"Error reading from file \"%s\": %s", filename,
  2119. strerror(errno));
  2120. tor_free(string);
  2121. close(fd);
  2122. errno = save_errno;
  2123. return NULL;
  2124. }
  2125. string[r] = '\0'; /* NUL-terminate the result. */
  2126. #ifdef _WIN32
  2127. if (!bin && strchr(string, '\r')) {
  2128. log_debug(LD_FS, "We didn't convert CRLF to LF as well as we hoped "
  2129. "when reading %s. Coping.",
  2130. filename);
  2131. tor_strstrip(string, "\r");
  2132. r = strlen(string);
  2133. }
  2134. if (!bin) {
  2135. statbuf.st_size = (size_t) r;
  2136. } else
  2137. #endif
  2138. if (r != statbuf.st_size) {
  2139. /* Unless we're using text mode on win32, we'd better have an exact
  2140. * match for size. */
  2141. int save_errno = errno;
  2142. log_warn(LD_FS,"Could read only %d of %ld bytes of file \"%s\".",
  2143. (int)r, (long)statbuf.st_size,filename);
  2144. tor_free(string);
  2145. close(fd);
  2146. errno = save_errno;
  2147. return NULL;
  2148. }
  2149. close(fd);
  2150. if (stat_out) {
  2151. memcpy(stat_out, &statbuf, sizeof(struct stat));
  2152. }
  2153. return string;
  2154. }
  2155. #define TOR_ISODIGIT(c) ('0' <= (c) && (c) <= '7')
  2156. /** Given a c-style double-quoted escaped string in <b>s</b>, extract and
  2157. * decode its contents into a newly allocated string. On success, assign this
  2158. * string to *<b>result</b>, assign its length to <b>size_out</b> (if
  2159. * provided), and return a pointer to the position in <b>s</b> immediately
  2160. * after the string. On failure, return NULL.
  2161. */
  2162. static const char *
  2163. unescape_string(const char *s, char **result, size_t *size_out)
  2164. {
  2165. const char *cp;
  2166. char *out;
  2167. if (s[0] != '\"')
  2168. return NULL;
  2169. cp = s+1;
  2170. while (1) {
  2171. switch (*cp) {
  2172. case '\0':
  2173. case '\n':
  2174. return NULL;
  2175. case '\"':
  2176. goto end_of_loop;
  2177. case '\\':
  2178. if (cp[1] == 'x' || cp[1] == 'X') {
  2179. if (!(TOR_ISXDIGIT(cp[2]) && TOR_ISXDIGIT(cp[3])))
  2180. return NULL;
  2181. cp += 4;
  2182. } else if (TOR_ISODIGIT(cp[1])) {
  2183. cp += 2;
  2184. if (TOR_ISODIGIT(*cp)) ++cp;
  2185. if (TOR_ISODIGIT(*cp)) ++cp;
  2186. } else if (cp[1] == 'n' || cp[1] == 'r' || cp[1] == 't' || cp[1] == '"'
  2187. || cp[1] == '\\' || cp[1] == '\'') {
  2188. cp += 2;
  2189. } else {
  2190. return NULL;
  2191. }
  2192. break;
  2193. default:
  2194. ++cp;
  2195. break;
  2196. }
  2197. }
  2198. end_of_loop:
  2199. out = *result = tor_malloc(cp-s + 1);
  2200. cp = s+1;
  2201. while (1) {
  2202. switch (*cp)
  2203. {
  2204. case '\"':
  2205. *out = '\0';
  2206. if (size_out) *size_out = out - *result;
  2207. return cp+1;
  2208. case '\0':
  2209. tor_fragile_assert();
  2210. tor_free(*result);
  2211. return NULL;
  2212. case '\\':
  2213. switch (cp[1])
  2214. {
  2215. case 'n': *out++ = '\n'; cp += 2; break;
  2216. case 'r': *out++ = '\r'; cp += 2; break;
  2217. case 't': *out++ = '\t'; cp += 2; break;
  2218. case 'x': case 'X':
  2219. {
  2220. int x1, x2;
  2221. x1 = hex_decode_digit(cp[2]);
  2222. x2 = hex_decode_digit(cp[3]);
  2223. if (x1 == -1 || x2 == -1) {
  2224. tor_free(*result);
  2225. return NULL;
  2226. }
  2227. *out++ = ((x1<<4) + x2);
  2228. cp += 4;
  2229. }
  2230. break;
  2231. case '0': case '1': case '2': case '3': case '4': case '5':
  2232. case '6': case '7':
  2233. {
  2234. int n = cp[1]-'0';
  2235. cp += 2;
  2236. if (TOR_ISODIGIT(*cp)) { n = n*8 + *cp-'0'; cp++; }
  2237. if (TOR_ISODIGIT(*cp)) { n = n*8 + *cp-'0'; cp++; }
  2238. if (n > 255) { tor_free(*result); return NULL; }
  2239. *out++ = (char)n;
  2240. }
  2241. break;
  2242. case '\'':
  2243. case '\"':
  2244. case '\\':
  2245. case '\?':
  2246. *out++ = cp[1];
  2247. cp += 2;
  2248. break;
  2249. default:
  2250. tor_free(*result); return NULL;
  2251. }
  2252. break;
  2253. default:
  2254. *out++ = *cp++;
  2255. }
  2256. }
  2257. }
  2258. /** Given a string containing part of a configuration file or similar format,
  2259. * advance past comments and whitespace and try to parse a single line. If we
  2260. * parse a line successfully, set *<b>key_out</b> to a new string holding the
  2261. * key portion and *<b>value_out</b> to a new string holding the value portion
  2262. * of the line, and return a pointer to the start of the next line. If we run
  2263. * out of data, return a pointer to the end of the string. If we encounter an
  2264. * error, return NULL.
  2265. */
  2266. const char *
  2267. parse_config_line_from_str(const char *line, char **key_out, char **value_out)
  2268. {
  2269. /* I believe the file format here is supposed to be:
  2270. FILE = (EMPTYLINE | LINE)* (EMPTYLASTLINE | LASTLINE)?
  2271. EMPTYLASTLINE = SPACE* | COMMENT
  2272. EMPTYLINE = EMPTYLASTLINE NL
  2273. SPACE = ' ' | '\r' | '\t'
  2274. COMMENT = '#' NOT-NL*
  2275. NOT-NL = Any character except '\n'
  2276. NL = '\n'
  2277. LASTLINE = SPACE* KEY SPACE* VALUES
  2278. LINE = LASTLINE NL
  2279. KEY = KEYCHAR+
  2280. KEYCHAR = Any character except ' ', '\r', '\n', '\t', '#', "\"
  2281. VALUES = QUOTEDVALUE | NORMALVALUE
  2282. QUOTEDVALUE = QUOTE QVCHAR* QUOTE EOLSPACE?
  2283. QUOTE = '"'
  2284. QVCHAR = KEYCHAR | ESC ('n' | 't' | 'r' | '"' | ESC |'\'' | OCTAL | HEX)
  2285. ESC = "\\"
  2286. OCTAL = ODIGIT (ODIGIT ODIGIT?)?
  2287. HEX = ('x' | 'X') HEXDIGIT HEXDIGIT
  2288. ODIGIT = '0' .. '7'
  2289. HEXDIGIT = '0'..'9' | 'a' .. 'f' | 'A' .. 'F'
  2290. EOLSPACE = SPACE* COMMENT?
  2291. NORMALVALUE = (VALCHAR | ESC ESC_IGNORE | CONTINUATION)* EOLSPACE?
  2292. VALCHAR = Any character except ESC, '#', and '\n'
  2293. ESC_IGNORE = Any character except '#' or '\n'
  2294. CONTINUATION = ESC NL ( COMMENT NL )*
  2295. */
  2296. const char *key, *val, *cp;
  2297. int continuation = 0;
  2298. tor_assert(key_out);
  2299. tor_assert(value_out);
  2300. *key_out = *value_out = NULL;
  2301. key = val = NULL;
  2302. /* Skip until the first keyword. */
  2303. while (1) {
  2304. while (TOR_ISSPACE(*line))
  2305. ++line;
  2306. if (*line == '#') {
  2307. while (*line && *line != '\n')
  2308. ++line;
  2309. } else {
  2310. break;
  2311. }
  2312. }
  2313. if (!*line) { /* End of string? */
  2314. *key_out = *value_out = NULL;
  2315. return line;
  2316. }
  2317. /* Skip until the next space or \ followed by newline. */
  2318. key = line;
  2319. while (*line && !TOR_ISSPACE(*line) && *line != '#' &&
  2320. ! (line[0] == '\\' && line[1] == '\n'))
  2321. ++line;
  2322. *key_out = tor_strndup(key, line-key);
  2323. /* Skip until the value. */
  2324. while (*line == ' ' || *line == '\t')
  2325. ++line;
  2326. val = line;
  2327. /* Find the end of the line. */
  2328. if (*line == '\"') { // XXX No continuation handling is done here
  2329. if (!(line = unescape_string(line, value_out, NULL)))
  2330. return NULL;
  2331. while (*line == ' ' || *line == '\t')
  2332. ++line;
  2333. if (*line && *line != '#' && *line != '\n')
  2334. return NULL;
  2335. } else {
  2336. /* Look for the end of the line. */
  2337. while (*line && *line != '\n' && (*line != '#' || continuation)) {
  2338. if (*line == '\\' && line[1] == '\n') {
  2339. continuation = 1;
  2340. line += 2;
  2341. } else if (*line == '#') {
  2342. do {
  2343. ++line;
  2344. } while (*line && *line != '\n');
  2345. if (*line == '\n')
  2346. ++line;
  2347. } else {
  2348. ++line;
  2349. }
  2350. }
  2351. if (*line == '\n') {
  2352. cp = line++;
  2353. } else {
  2354. cp = line;
  2355. }
  2356. /* Now back cp up to be the last nonspace character */
  2357. while (cp>val && TOR_ISSPACE(*(cp-1)))
  2358. --cp;
  2359. tor_assert(cp >= val);
  2360. /* Now copy out and decode the value. */
  2361. *value_out = tor_strndup(val, cp-val);
  2362. if (continuation) {
  2363. char *v_out, *v_in;
  2364. v_out = v_in = *value_out;
  2365. while (*v_in) {
  2366. if (*v_in == '#') {
  2367. do {
  2368. ++v_in;
  2369. } while (*v_in && *v_in != '\n');
  2370. if (*v_in == '\n')
  2371. ++v_in;
  2372. } else if (v_in[0] == '\\' && v_in[1] == '\n') {
  2373. v_in += 2;
  2374. } else {
  2375. *v_out++ = *v_in++;
  2376. }
  2377. }
  2378. *v_out = '\0';
  2379. }
  2380. }
  2381. if (*line == '#') {
  2382. do {
  2383. ++line;
  2384. } while (*line && *line != '\n');
  2385. }
  2386. while (TOR_ISSPACE(*line)) ++line;
  2387. return line;
  2388. }
  2389. /** Expand any homedir prefix on <b>filename</b>; return a newly allocated
  2390. * string. */
  2391. char *
  2392. expand_filename(const char *filename)
  2393. {
  2394. tor_assert(filename);
  2395. #ifdef _WIN32
  2396. return tor_strdup(filename);
  2397. #else
  2398. if (*filename == '~') {
  2399. char *home, *result=NULL;
  2400. const char *rest;
  2401. if (filename[1] == '/' || filename[1] == '\0') {
  2402. home = getenv("HOME");
  2403. if (!home) {
  2404. log_warn(LD_CONFIG, "Couldn't find $HOME environment variable while "
  2405. "expanding \"%s\"; defaulting to \"\".", filename);
  2406. home = tor_strdup("");
  2407. } else {
  2408. home = tor_strdup(home);
  2409. }
  2410. rest = strlen(filename)>=2?(filename+2):"";
  2411. } else {
  2412. #ifdef HAVE_PWD_H
  2413. char *username, *slash;
  2414. slash = strchr(filename, '/');
  2415. if (slash)
  2416. username = tor_strndup(filename+1,slash-filename-1);
  2417. else
  2418. username = tor_strdup(filename+1);
  2419. if (!(home = get_user_homedir(username))) {
  2420. log_warn(LD_CONFIG,"Couldn't get homedir for \"%s\"",username);
  2421. tor_free(username);
  2422. return NULL;
  2423. }
  2424. tor_free(username);
  2425. rest = slash ? (slash+1) : "";
  2426. #else
  2427. log_warn(LD_CONFIG, "Couldn't expend homedir on system without pwd.h");
  2428. return tor_strdup(filename);
  2429. #endif
  2430. }
  2431. tor_assert(home);
  2432. /* Remove trailing slash. */
  2433. if (strlen(home)>1 && !strcmpend(home,PATH_SEPARATOR)) {
  2434. home[strlen(home)-1] = '\0';
  2435. }
  2436. tor_asprintf(&result,"%s"PATH_SEPARATOR"%s",home,rest);
  2437. tor_free(home);
  2438. return result;
  2439. } else {
  2440. return tor_strdup(filename);
  2441. }
  2442. #endif
  2443. }
  2444. #define MAX_SCANF_WIDTH 9999
  2445. /** Helper: given an ASCII-encoded decimal digit, return its numeric value.
  2446. * NOTE: requires that its input be in-bounds. */
  2447. static int
  2448. digit_to_num(char d)
  2449. {
  2450. int num = ((int)d) - (int)'0';
  2451. tor_assert(num <= 9 && num >= 0);
  2452. return num;
  2453. }
  2454. /** Helper: Read an unsigned int from *<b>bufp</b> of up to <b>width</b>
  2455. * characters. (Handle arbitrary width if <b>width</b> is less than 0.) On
  2456. * success, store the result in <b>out</b>, advance bufp to the next
  2457. * character, and return 0. On failure, return -1. */
  2458. static int
  2459. scan_unsigned(const char **bufp, unsigned *out, int width, int base)
  2460. {
  2461. unsigned result = 0;
  2462. int scanned_so_far = 0;
  2463. const int hex = base==16;
  2464. tor_assert(base == 10 || base == 16);
  2465. if (!bufp || !*bufp || !out)
  2466. return -1;
  2467. if (width<0)
  2468. width=MAX_SCANF_WIDTH;
  2469. while (**bufp && (hex?TOR_ISXDIGIT(**bufp):TOR_ISDIGIT(**bufp))
  2470. && scanned_so_far < width) {
  2471. int digit = hex?hex_decode_digit(*(*bufp)++):digit_to_num(*(*bufp)++);
  2472. unsigned new_result = result * base + digit;
  2473. if (new_result > UINT32_MAX || new_result < result)
  2474. return -1; /* over/underflow. */
  2475. result = new_result;
  2476. ++scanned_so_far;
  2477. }
  2478. if (!scanned_so_far) /* No actual digits scanned */
  2479. return -1;
  2480. *out = result;
  2481. return 0;
  2482. }
  2483. /** Helper: copy up to <b>width</b> non-space characters from <b>bufp</b> to
  2484. * <b>out</b>. Make sure <b>out</b> is nul-terminated. Advance <b>bufp</b>
  2485. * to the next non-space character or the EOS. */
  2486. static int
  2487. scan_string(const char **bufp, char *out, int width)
  2488. {
  2489. int scanned_so_far = 0;
  2490. if (!bufp || !out || width < 0)
  2491. return -1;
  2492. while (**bufp && ! TOR_ISSPACE(**bufp) && scanned_so_far < width) {
  2493. *out++ = *(*bufp)++;
  2494. ++scanned_so_far;
  2495. }
  2496. *out = '\0';
  2497. return 0;
  2498. }
  2499. /** Locale-independent, minimal, no-surprises scanf variant, accepting only a
  2500. * restricted pattern format. For more info on what it supports, see
  2501. * tor_sscanf() documentation. */
  2502. int
  2503. tor_vsscanf(const char *buf, const char *pattern, va_list ap)
  2504. {
  2505. int n_matched = 0;
  2506. while (*pattern) {
  2507. if (*pattern != '%') {
  2508. if (*buf == *pattern) {
  2509. ++buf;
  2510. ++pattern;
  2511. continue;
  2512. } else {
  2513. return n_matched;
  2514. }
  2515. } else {
  2516. int width = -1;
  2517. ++pattern;
  2518. if (TOR_ISDIGIT(*pattern)) {
  2519. width = digit_to_num(*pattern++);
  2520. while (TOR_ISDIGIT(*pattern)) {
  2521. width *= 10;
  2522. width += digit_to_num(*pattern++);
  2523. if (width > MAX_SCANF_WIDTH)
  2524. return -1;
  2525. }
  2526. if (!width) /* No zero-width things. */
  2527. return -1;
  2528. }
  2529. if (*pattern == 'u' || *pattern == 'x') {
  2530. unsigned *u = va_arg(ap, unsigned *);
  2531. const int base = (*pattern == 'u') ? 10 : 16;
  2532. if (!*buf)
  2533. return n_matched;
  2534. if (scan_unsigned(&buf, u, width, base)<0)
  2535. return n_matched;
  2536. ++pattern;
  2537. ++n_matched;
  2538. } else if (*pattern == 's') {
  2539. char *s = va_arg(ap, char *);
  2540. if (width < 0)
  2541. return -1;
  2542. if (scan_string(&buf, s, width)<0)
  2543. return n_matched;
  2544. ++pattern;
  2545. ++n_matched;
  2546. } else if (*pattern == 'c') {
  2547. char *ch = va_arg(ap, char *);
  2548. if (width != -1)
  2549. return -1;
  2550. if (!*buf)
  2551. return n_matched;
  2552. *ch = *buf++;
  2553. ++pattern;
  2554. ++n_matched;
  2555. } else if (*pattern == '%') {
  2556. if (*buf != '%')
  2557. return n_matched;
  2558. ++buf;
  2559. ++pattern;
  2560. } else {
  2561. return -1; /* Unrecognized pattern component. */
  2562. }
  2563. }
  2564. }
  2565. return n_matched;
  2566. }
  2567. /** Minimal sscanf replacement: parse <b>buf</b> according to <b>pattern</b>
  2568. * and store the results in the corresponding argument fields. Differs from
  2569. * sscanf in that it: Only handles %u, %x, %c and %Ns. Does not handle
  2570. * arbitrarily long widths. %u and %x do not consume any space. Is
  2571. * locale-independent. Returns -1 on malformed patterns.
  2572. *
  2573. * (As with other locale-independent functions, we need this to parse data that
  2574. * is in ASCII without worrying that the C library's locale-handling will make
  2575. * miscellaneous characters look like numbers, spaces, and so on.)
  2576. */
  2577. int
  2578. tor_sscanf(const char *buf, const char *pattern, ...)
  2579. {
  2580. int r;
  2581. va_list ap;
  2582. va_start(ap, pattern);
  2583. r = tor_vsscanf(buf, pattern, ap);
  2584. va_end(ap);
  2585. return r;
  2586. }
  2587. /** Append the string produced by tor_asprintf(<b>pattern</b>, <b>...</b>)
  2588. * to <b>sl</b>. */
  2589. void
  2590. smartlist_add_asprintf(struct smartlist_t *sl, const char *pattern, ...)
  2591. {
  2592. va_list ap;
  2593. va_start(ap, pattern);
  2594. smartlist_add_vasprintf(sl, pattern, ap);
  2595. va_end(ap);
  2596. }
  2597. /** va_list-based backend of smartlist_add_asprintf. */
  2598. void
  2599. smartlist_add_vasprintf(struct smartlist_t *sl, const char *pattern,
  2600. va_list args)
  2601. {
  2602. char *str = NULL;
  2603. tor_vasprintf(&str, pattern, args);
  2604. tor_assert(str != NULL);
  2605. smartlist_add(sl, str);
  2606. }
  2607. /** Return a new list containing the filenames in the directory <b>dirname</b>.
  2608. * Return NULL on error or if <b>dirname</b> is not a directory.
  2609. */
  2610. smartlist_t *
  2611. tor_listdir(const char *dirname)
  2612. {
  2613. smartlist_t *result;
  2614. #ifdef _WIN32
  2615. char *pattern=NULL;
  2616. TCHAR tpattern[MAX_PATH] = {0};
  2617. char name[MAX_PATH] = {0};
  2618. HANDLE handle;
  2619. WIN32_FIND_DATA findData;
  2620. tor_asprintf(&pattern, "%s\\*", dirname);
  2621. #ifdef UNICODE
  2622. mbstowcs(tpattern,pattern,MAX_PATH);
  2623. #else
  2624. strlcpy(tpattern, pattern, MAX_PATH);
  2625. #endif
  2626. if (INVALID_HANDLE_VALUE == (handle = FindFirstFile(tpattern, &findData))) {
  2627. tor_free(pattern);
  2628. return NULL;
  2629. }
  2630. result = smartlist_new();
  2631. while (1) {
  2632. #ifdef UNICODE
  2633. wcstombs(name,findData.cFileName,MAX_PATH);
  2634. #else
  2635. strlcpy(name,findData.cFileName,sizeof(name));
  2636. #endif
  2637. if (strcmp(name, ".") &&
  2638. strcmp(name, "..")) {
  2639. smartlist_add(result, tor_strdup(name));
  2640. }
  2641. if (!FindNextFile(handle, &findData)) {
  2642. DWORD err;
  2643. if ((err = GetLastError()) != ERROR_NO_MORE_FILES) {
  2644. char *errstr = format_win32_error(err);
  2645. log_warn(LD_FS, "Error reading directory '%s': %s", dirname, errstr);
  2646. tor_free(errstr);
  2647. }
  2648. break;
  2649. }
  2650. }
  2651. FindClose(handle);
  2652. tor_free(pattern);
  2653. #else
  2654. DIR *d;
  2655. struct dirent *de;
  2656. if (!(d = opendir(dirname)))
  2657. return NULL;
  2658. result = smartlist_new();
  2659. while ((de = readdir(d))) {
  2660. if (!strcmp(de->d_name, ".") ||
  2661. !strcmp(de->d_name, ".."))
  2662. continue;
  2663. smartlist_add(result, tor_strdup(de->d_name));
  2664. }
  2665. closedir(d);
  2666. #endif
  2667. return result;
  2668. }
  2669. /** Return true iff <b>filename</b> is a relative path. */
  2670. int
  2671. path_is_relative(const char *filename)
  2672. {
  2673. if (filename && filename[0] == '/')
  2674. return 0;
  2675. #ifdef _WIN32
  2676. else if (filename && filename[0] == '\\')
  2677. return 0;
  2678. else if (filename && strlen(filename)>3 && TOR_ISALPHA(filename[0]) &&
  2679. filename[1] == ':' && filename[2] == '\\')
  2680. return 0;
  2681. #endif
  2682. else
  2683. return 1;
  2684. }
  2685. /* =====
  2686. * Process helpers
  2687. * ===== */
  2688. #ifndef _WIN32
  2689. /* Based on code contributed by christian grothoff */
  2690. /** True iff we've called start_daemon(). */
  2691. static int start_daemon_called = 0;
  2692. /** True iff we've called finish_daemon(). */
  2693. static int finish_daemon_called = 0;
  2694. /** Socketpair used to communicate between parent and child process while
  2695. * daemonizing. */
  2696. static int daemon_filedes[2];
  2697. /** Start putting the process into daemon mode: fork and drop all resources
  2698. * except standard fds. The parent process never returns, but stays around
  2699. * until finish_daemon is called. (Note: it's safe to call this more
  2700. * than once: calls after the first are ignored.)
  2701. */
  2702. void
  2703. start_daemon(void)
  2704. {
  2705. pid_t pid;
  2706. if (start_daemon_called)
  2707. return;
  2708. start_daemon_called = 1;
  2709. if (pipe(daemon_filedes)) {
  2710. log_err(LD_GENERAL,"pipe failed; exiting. Error was %s", strerror(errno));
  2711. exit(1);
  2712. }
  2713. pid = fork();
  2714. if (pid < 0) {
  2715. log_err(LD_GENERAL,"fork failed. Exiting.");
  2716. exit(1);
  2717. }
  2718. if (pid) { /* Parent */
  2719. int ok;
  2720. char c;
  2721. close(daemon_filedes[1]); /* we only read */
  2722. ok = -1;
  2723. while (0 < read(daemon_filedes[0], &c, sizeof(char))) {
  2724. if (c == '.')
  2725. ok = 1;
  2726. }
  2727. fflush(stdout);
  2728. if (ok == 1)
  2729. exit(0);
  2730. else
  2731. exit(1); /* child reported error */
  2732. } else { /* Child */
  2733. close(daemon_filedes[0]); /* we only write */
  2734. pid = setsid(); /* Detach from controlling terminal */
  2735. /*
  2736. * Fork one more time, so the parent (the session group leader) can exit.
  2737. * This means that we, as a non-session group leader, can never regain a
  2738. * controlling terminal. This part is recommended by Stevens's
  2739. * _Advanced Programming in the Unix Environment_.
  2740. */
  2741. if (fork() != 0) {
  2742. exit(0);
  2743. }
  2744. set_main_thread(); /* We are now the main thread. */
  2745. return;
  2746. }
  2747. }
  2748. /** Finish putting the process into daemon mode: drop standard fds, and tell
  2749. * the parent process to exit. (Note: it's safe to call this more than once:
  2750. * calls after the first are ignored. Calls start_daemon first if it hasn't
  2751. * been called already.)
  2752. */
  2753. void
  2754. finish_daemon(const char *desired_cwd)
  2755. {
  2756. int nullfd;
  2757. char c = '.';
  2758. if (finish_daemon_called)
  2759. return;
  2760. if (!start_daemon_called)
  2761. start_daemon();
  2762. finish_daemon_called = 1;
  2763. if (!desired_cwd)
  2764. desired_cwd = "/";
  2765. /* Don't hold the wrong FS mounted */
  2766. if (chdir(desired_cwd) < 0) {
  2767. log_err(LD_GENERAL,"chdir to \"%s\" failed. Exiting.",desired_cwd);
  2768. exit(1);
  2769. }
  2770. nullfd = tor_open_cloexec("/dev/null", O_RDWR, 0);
  2771. if (nullfd < 0) {
  2772. log_err(LD_GENERAL,"/dev/null can't be opened. Exiting.");
  2773. exit(1);
  2774. }
  2775. /* close fds linking to invoking terminal, but
  2776. * close usual incoming fds, but redirect them somewhere
  2777. * useful so the fds don't get reallocated elsewhere.
  2778. */
  2779. if (dup2(nullfd,0) < 0 ||
  2780. dup2(nullfd,1) < 0 ||
  2781. dup2(nullfd,2) < 0) {
  2782. log_err(LD_GENERAL,"dup2 failed. Exiting.");
  2783. exit(1);
  2784. }
  2785. if (nullfd > 2)
  2786. close(nullfd);
  2787. /* signal success */
  2788. if (write(daemon_filedes[1], &c, sizeof(char)) != sizeof(char)) {
  2789. log_err(LD_GENERAL,"write failed. Exiting.");
  2790. }
  2791. close(daemon_filedes[1]);
  2792. }
  2793. #else
  2794. /* defined(_WIN32) */
  2795. void
  2796. start_daemon(void)
  2797. {
  2798. }
  2799. void
  2800. finish_daemon(const char *cp)
  2801. {
  2802. (void)cp;
  2803. }
  2804. #endif
  2805. /** Write the current process ID, followed by NL, into <b>filename</b>.
  2806. */
  2807. void
  2808. write_pidfile(char *filename)
  2809. {
  2810. FILE *pidfile;
  2811. if ((pidfile = fopen(filename, "w")) == NULL) {
  2812. log_warn(LD_FS, "Unable to open \"%s\" for writing: %s", filename,
  2813. strerror(errno));
  2814. } else {
  2815. #ifdef _WIN32
  2816. fprintf(pidfile, "%d\n", (int)_getpid());
  2817. #else
  2818. fprintf(pidfile, "%d\n", (int)getpid());
  2819. #endif
  2820. fclose(pidfile);
  2821. }
  2822. }
  2823. #ifdef _WIN32
  2824. HANDLE
  2825. load_windows_system_library(const TCHAR *library_name)
  2826. {
  2827. TCHAR path[MAX_PATH];
  2828. unsigned n;
  2829. n = GetSystemDirectory(path, MAX_PATH);
  2830. if (n == 0 || n + _tcslen(library_name) + 2 >= MAX_PATH)
  2831. return 0;
  2832. _tcscat(path, TEXT("\\"));
  2833. _tcscat(path, library_name);
  2834. return LoadLibrary(path);
  2835. }
  2836. #endif
  2837. /** Format a single argument for being put on a Windows command line.
  2838. * Returns a newly allocated string */
  2839. static char *
  2840. format_win_cmdline_argument(const char *arg)
  2841. {
  2842. char *formatted_arg;
  2843. char need_quotes;
  2844. const char *c;
  2845. int i;
  2846. int bs_counter = 0;
  2847. /* Backslash we can point to when one is inserted into the string */
  2848. const char backslash = '\\';
  2849. /* Smartlist of *char */
  2850. smartlist_t *arg_chars;
  2851. arg_chars = smartlist_new();
  2852. /* Quote string if it contains whitespace or is empty */
  2853. need_quotes = (strchr(arg, ' ') || strchr(arg, '\t') || '\0' == arg[0]);
  2854. /* Build up smartlist of *chars */
  2855. for (c=arg; *c != '\0'; c++) {
  2856. if ('"' == *c) {
  2857. /* Double up backslashes preceding a quote */
  2858. for (i=0; i<(bs_counter*2); i++)
  2859. smartlist_add(arg_chars, (void*)&backslash);
  2860. bs_counter = 0;
  2861. /* Escape the quote */
  2862. smartlist_add(arg_chars, (void*)&backslash);
  2863. smartlist_add(arg_chars, (void*)c);
  2864. } else if ('\\' == *c) {
  2865. /* Count backslashes until we know whether to double up */
  2866. bs_counter++;
  2867. } else {
  2868. /* Don't double up slashes preceding a non-quote */
  2869. for (i=0; i<bs_counter; i++)
  2870. smartlist_add(arg_chars, (void*)&backslash);
  2871. bs_counter = 0;
  2872. smartlist_add(arg_chars, (void*)c);
  2873. }
  2874. }
  2875. /* Don't double up trailing backslashes */
  2876. for (i=0; i<bs_counter; i++)
  2877. smartlist_add(arg_chars, (void*)&backslash);
  2878. /* Allocate space for argument, quotes (if needed), and terminator */
  2879. formatted_arg = tor_malloc(sizeof(char) *
  2880. (smartlist_len(arg_chars) + (need_quotes?2:0) + 1));
  2881. /* Add leading quote */
  2882. i=0;
  2883. if (need_quotes)
  2884. formatted_arg[i++] = '"';
  2885. /* Add characters */
  2886. SMARTLIST_FOREACH(arg_chars, char*, c,
  2887. {
  2888. formatted_arg[i++] = *c;
  2889. });
  2890. /* Add trailing quote */
  2891. if (need_quotes)
  2892. formatted_arg[i++] = '"';
  2893. formatted_arg[i] = '\0';
  2894. smartlist_free(arg_chars);
  2895. return formatted_arg;
  2896. }
  2897. /** Format a command line for use on Windows, which takes the command as a
  2898. * string rather than string array. Follows the rules from "Parsing C++
  2899. * Command-Line Arguments" in MSDN. Algorithm based on list2cmdline in the
  2900. * Python subprocess module. Returns a newly allocated string */
  2901. char *
  2902. tor_join_win_cmdline(const char *argv[])
  2903. {
  2904. smartlist_t *argv_list;
  2905. char *joined_argv;
  2906. int i;
  2907. /* Format each argument and put the result in a smartlist */
  2908. argv_list = smartlist_new();
  2909. for (i=0; argv[i] != NULL; i++) {
  2910. smartlist_add(argv_list, (void *)format_win_cmdline_argument(argv[i]));
  2911. }
  2912. /* Join the arguments with whitespace */
  2913. joined_argv = smartlist_join_strings(argv_list, " ", 0, NULL);
  2914. /* Free the newly allocated arguments, and the smartlist */
  2915. SMARTLIST_FOREACH(argv_list, char *, arg,
  2916. {
  2917. tor_free(arg);
  2918. });
  2919. smartlist_free(argv_list);
  2920. return joined_argv;
  2921. }
  2922. /** Format <b>child_state</b> and <b>saved_errno</b> as a hex string placed in
  2923. * <b>hex_errno</b>. Called between fork and _exit, so must be signal-handler
  2924. * safe.
  2925. *
  2926. * <b>hex_errno</b> must have at least HEX_ERRNO_SIZE bytes available.
  2927. *
  2928. * The format of <b>hex_errno</b> is: "CHILD_STATE/ERRNO\n", left-padded
  2929. * with spaces. Note that there is no trailing \0. CHILD_STATE indicates where
  2930. * in the processs of starting the child process did the failure occur (see
  2931. * CHILD_STATE_* macros for definition), and SAVED_ERRNO is the value of
  2932. * errno when the failure occurred.
  2933. */
  2934. void
  2935. format_helper_exit_status(unsigned char child_state, int saved_errno,
  2936. char *hex_errno)
  2937. {
  2938. unsigned int unsigned_errno;
  2939. char *cur;
  2940. size_t i;
  2941. /* Fill hex_errno with spaces, and a trailing newline (memset may
  2942. not be signal handler safe, so we can't use it) */
  2943. for (i = 0; i < (HEX_ERRNO_SIZE - 1); i++)
  2944. hex_errno[i] = ' ';
  2945. hex_errno[HEX_ERRNO_SIZE - 1] = '\n';
  2946. /* Convert errno to be unsigned for hex conversion */
  2947. if (saved_errno < 0) {
  2948. unsigned_errno = (unsigned int) -saved_errno;
  2949. } else {
  2950. unsigned_errno = (unsigned int) saved_errno;
  2951. }
  2952. /* Convert errno to hex (start before \n) */
  2953. cur = hex_errno + HEX_ERRNO_SIZE - 2;
  2954. /* Check for overflow on first iteration of the loop */
  2955. if (cur < hex_errno)
  2956. return;
  2957. do {
  2958. *cur-- = "0123456789ABCDEF"[unsigned_errno % 16];
  2959. unsigned_errno /= 16;
  2960. } while (unsigned_errno != 0 && cur >= hex_errno);
  2961. /* Prepend the minus sign if errno was negative */
  2962. if (saved_errno < 0 && cur >= hex_errno)
  2963. *cur-- = '-';
  2964. /* Leave a gap */
  2965. if (cur >= hex_errno)
  2966. *cur-- = '/';
  2967. /* Check for overflow on first iteration of the loop */
  2968. if (cur < hex_errno)
  2969. return;
  2970. /* Convert child_state to hex */
  2971. do {
  2972. *cur-- = "0123456789ABCDEF"[child_state % 16];
  2973. child_state /= 16;
  2974. } while (child_state != 0 && cur >= hex_errno);
  2975. }
  2976. /* Maximum number of file descriptors, if we cannot get it via sysconf() */
  2977. #define DEFAULT_MAX_FD 256
  2978. /** Terminate the process of <b>process_handle</b>.
  2979. * Code borrowed from Python's os.kill. */
  2980. int
  2981. tor_terminate_process(process_handle_t *process_handle)
  2982. {
  2983. #ifdef _WIN32
  2984. if (tor_get_exit_code(process_handle, 0, NULL) == PROCESS_EXIT_RUNNING) {
  2985. HANDLE handle;
  2986. /* If the signal is outside of what GenerateConsoleCtrlEvent can use,
  2987. attempt to open and terminate the process. */
  2988. handle = OpenProcess(PROCESS_ALL_ACCESS, FALSE,
  2989. process_handle->pid.dwProcessId);
  2990. if (!handle)
  2991. return -1;
  2992. if (!TerminateProcess(handle, 0))
  2993. return -1;
  2994. else
  2995. return 0;
  2996. }
  2997. #else /* Unix */
  2998. return kill(process_handle->pid, SIGTERM);
  2999. #endif
  3000. return -1;
  3001. }
  3002. /** Return the Process ID of <b>process_handle</b>. */
  3003. int
  3004. tor_process_get_pid(process_handle_t *process_handle)
  3005. {
  3006. #ifdef _WIN32
  3007. return (int) process_handle->pid.dwProcessId;
  3008. #else
  3009. return (int) process_handle->pid;
  3010. #endif
  3011. }
  3012. #ifdef _WIN32
  3013. HANDLE
  3014. tor_process_get_stdout_pipe(process_handle_t *process_handle)
  3015. {
  3016. return process_handle->stdout_pipe;
  3017. }
  3018. #else
  3019. /* DOCDOC tor_process_get_stdout_pipe */
  3020. FILE *
  3021. tor_process_get_stdout_pipe(process_handle_t *process_handle)
  3022. {
  3023. return process_handle->stdout_handle;
  3024. }
  3025. #endif
  3026. /* DOCDOC process_handle_new */
  3027. static process_handle_t *
  3028. process_handle_new(void)
  3029. {
  3030. process_handle_t *out = tor_malloc_zero(sizeof(process_handle_t));
  3031. #ifndef _WIN32
  3032. out->stdout_pipe = -1;
  3033. out->stderr_pipe = -1;
  3034. #endif
  3035. return out;
  3036. }
  3037. /**
  3038. * @name child-process states
  3039. *
  3040. * Each of these values represents a possible state that a child process can
  3041. * be in. They're used to determine what to say when telling the parent how
  3042. * far along we were before failure.
  3043. *
  3044. * @{
  3045. */
  3046. #define CHILD_STATE_INIT 0
  3047. #define CHILD_STATE_PIPE 1
  3048. #define CHILD_STATE_MAXFD 2
  3049. #define CHILD_STATE_FORK 3
  3050. #define CHILD_STATE_DUPOUT 4
  3051. #define CHILD_STATE_DUPERR 5
  3052. #define CHILD_STATE_REDIRECT 6
  3053. #define CHILD_STATE_CLOSEFD 7
  3054. #define CHILD_STATE_EXEC 8
  3055. #define CHILD_STATE_FAILEXEC 9
  3056. /** @} */
  3057. /** Start a program in the background. If <b>filename</b> contains a '/', then
  3058. * it will be treated as an absolute or relative path. Otherwise, on
  3059. * non-Windows systems, the system path will be searched for <b>filename</b>.
  3060. * On Windows, only the current directory will be searched. Here, to search the
  3061. * system path (as well as the application directory, current working
  3062. * directory, and system directories), set filename to NULL.
  3063. *
  3064. * The strings in <b>argv</b> will be passed as the command line arguments of
  3065. * the child program (following convention, argv[0] should normally be the
  3066. * filename of the executable, and this must be the case if <b>filename</b> is
  3067. * NULL). The last element of argv must be NULL. A handle to the child process
  3068. * will be returned in process_handle (which must be non-NULL). Read
  3069. * process_handle.status to find out if the process was successfully launched.
  3070. * For convenience, process_handle.status is returned by this function.
  3071. *
  3072. * Some parts of this code are based on the POSIX subprocess module from
  3073. * Python, and example code from
  3074. * http://msdn.microsoft.com/en-us/library/ms682499%28v=vs.85%29.aspx.
  3075. */
  3076. int
  3077. tor_spawn_background(const char *const filename, const char **argv,
  3078. process_environment_t *env,
  3079. process_handle_t **process_handle_out)
  3080. {
  3081. #ifdef _WIN32
  3082. HANDLE stdout_pipe_read = NULL;
  3083. HANDLE stdout_pipe_write = NULL;
  3084. HANDLE stderr_pipe_read = NULL;
  3085. HANDLE stderr_pipe_write = NULL;
  3086. process_handle_t *process_handle;
  3087. int status;
  3088. STARTUPINFO siStartInfo;
  3089. BOOL retval = FALSE;
  3090. SECURITY_ATTRIBUTES saAttr;
  3091. char *joined_argv;
  3092. saAttr.nLength = sizeof(SECURITY_ATTRIBUTES);
  3093. saAttr.bInheritHandle = TRUE;
  3094. /* TODO: should we set explicit security attributes? (#2046, comment 5) */
  3095. saAttr.lpSecurityDescriptor = NULL;
  3096. /* Assume failure to start process */
  3097. status = PROCESS_STATUS_ERROR;
  3098. /* Set up pipe for stdout */
  3099. if (!CreatePipe(&stdout_pipe_read, &stdout_pipe_write, &saAttr, 0)) {
  3100. log_warn(LD_GENERAL,
  3101. "Failed to create pipe for stdout communication with child process: %s",
  3102. format_win32_error(GetLastError()));
  3103. return status;
  3104. }
  3105. if (!SetHandleInformation(stdout_pipe_read, HANDLE_FLAG_INHERIT, 0)) {
  3106. log_warn(LD_GENERAL,
  3107. "Failed to configure pipe for stdout communication with child "
  3108. "process: %s", format_win32_error(GetLastError()));
  3109. return status;
  3110. }
  3111. /* Set up pipe for stderr */
  3112. if (!CreatePipe(&stderr_pipe_read, &stderr_pipe_write, &saAttr, 0)) {
  3113. log_warn(LD_GENERAL,
  3114. "Failed to create pipe for stderr communication with child process: %s",
  3115. format_win32_error(GetLastError()));
  3116. return status;
  3117. }
  3118. if (!SetHandleInformation(stderr_pipe_read, HANDLE_FLAG_INHERIT, 0)) {
  3119. log_warn(LD_GENERAL,
  3120. "Failed to configure pipe for stderr communication with child "
  3121. "process: %s", format_win32_error(GetLastError()));
  3122. return status;
  3123. }
  3124. /* Create the child process */
  3125. /* Windows expects argv to be a whitespace delimited string, so join argv up
  3126. */
  3127. joined_argv = tor_join_win_cmdline(argv);
  3128. process_handle = process_handle_new();
  3129. process_handle->status = status;
  3130. ZeroMemory(&(process_handle->pid), sizeof(PROCESS_INFORMATION));
  3131. ZeroMemory(&siStartInfo, sizeof(STARTUPINFO));
  3132. siStartInfo.cb = sizeof(STARTUPINFO);
  3133. siStartInfo.hStdError = stderr_pipe_write;
  3134. siStartInfo.hStdOutput = stdout_pipe_write;
  3135. siStartInfo.hStdInput = NULL;
  3136. siStartInfo.dwFlags |= STARTF_USESTDHANDLES;
  3137. /* Create the child process */
  3138. retval = CreateProcess(filename, // module name
  3139. joined_argv, // command line
  3140. /* TODO: should we set explicit security attributes? (#2046, comment 5) */
  3141. NULL, // process security attributes
  3142. NULL, // primary thread security attributes
  3143. TRUE, // handles are inherited
  3144. /*(TODO: set CREATE_NEW CONSOLE/PROCESS_GROUP to make GetExitCodeProcess()
  3145. * work?) */
  3146. 0, // creation flags
  3147. (env==NULL) ? NULL : env->windows_environment_block,
  3148. NULL, // use parent's current directory
  3149. &siStartInfo, // STARTUPINFO pointer
  3150. &(process_handle->pid)); // receives PROCESS_INFORMATION
  3151. tor_free(joined_argv);
  3152. if (!retval) {
  3153. log_warn(LD_GENERAL,
  3154. "Failed to create child process %s: %s", filename?filename:argv[0],
  3155. format_win32_error(GetLastError()));
  3156. tor_free(process_handle);
  3157. } else {
  3158. /* TODO: Close hProcess and hThread in process_handle->pid? */
  3159. process_handle->stdout_pipe = stdout_pipe_read;
  3160. process_handle->stderr_pipe = stderr_pipe_read;
  3161. status = process_handle->status = PROCESS_STATUS_RUNNING;
  3162. }
  3163. /* TODO: Close pipes on exit */
  3164. *process_handle_out = process_handle;
  3165. return status;
  3166. #else // _WIN32
  3167. pid_t pid;
  3168. int stdout_pipe[2];
  3169. int stderr_pipe[2];
  3170. int fd, retval;
  3171. ssize_t nbytes;
  3172. process_handle_t *process_handle;
  3173. int status;
  3174. const char *error_message = SPAWN_ERROR_MESSAGE;
  3175. size_t error_message_length;
  3176. /* Represents where in the process of spawning the program is;
  3177. this is used for printing out the error message */
  3178. unsigned char child_state = CHILD_STATE_INIT;
  3179. char hex_errno[HEX_ERRNO_SIZE];
  3180. static int max_fd = -1;
  3181. status = PROCESS_STATUS_ERROR;
  3182. /* We do the strlen here because strlen() is not signal handler safe,
  3183. and we are not allowed to use unsafe functions between fork and exec */
  3184. error_message_length = strlen(error_message);
  3185. child_state = CHILD_STATE_PIPE;
  3186. /* Set up pipe for redirecting stdout and stderr of child */
  3187. retval = pipe(stdout_pipe);
  3188. if (-1 == retval) {
  3189. log_warn(LD_GENERAL,
  3190. "Failed to set up pipe for stdout communication with child process: %s",
  3191. strerror(errno));
  3192. return status;
  3193. }
  3194. retval = pipe(stderr_pipe);
  3195. if (-1 == retval) {
  3196. log_warn(LD_GENERAL,
  3197. "Failed to set up pipe for stderr communication with child process: %s",
  3198. strerror(errno));
  3199. close(stdout_pipe[0]);
  3200. close(stdout_pipe[1]);
  3201. return status;
  3202. }
  3203. child_state = CHILD_STATE_MAXFD;
  3204. #ifdef _SC_OPEN_MAX
  3205. if (-1 != max_fd) {
  3206. max_fd = (int) sysconf(_SC_OPEN_MAX);
  3207. if (max_fd == -1)
  3208. max_fd = DEFAULT_MAX_FD;
  3209. log_warn(LD_GENERAL,
  3210. "Cannot find maximum file descriptor, assuming %d", max_fd);
  3211. }
  3212. #else
  3213. max_fd = DEFAULT_MAX_FD;
  3214. #endif
  3215. child_state = CHILD_STATE_FORK;
  3216. pid = fork();
  3217. if (0 == pid) {
  3218. /* In child */
  3219. child_state = CHILD_STATE_DUPOUT;
  3220. /* Link child stdout to the write end of the pipe */
  3221. retval = dup2(stdout_pipe[1], STDOUT_FILENO);
  3222. if (-1 == retval)
  3223. goto error;
  3224. child_state = CHILD_STATE_DUPERR;
  3225. /* Link child stderr to the write end of the pipe */
  3226. retval = dup2(stderr_pipe[1], STDERR_FILENO);
  3227. if (-1 == retval)
  3228. goto error;
  3229. child_state = CHILD_STATE_REDIRECT;
  3230. /* Link stdin to /dev/null */
  3231. fd = open("/dev/null", O_RDONLY); /* NOT cloexec, obviously. */
  3232. if (fd != -1)
  3233. dup2(fd, STDIN_FILENO);
  3234. else
  3235. goto error;
  3236. child_state = CHILD_STATE_CLOSEFD;
  3237. close(stderr_pipe[0]);
  3238. close(stderr_pipe[1]);
  3239. close(stdout_pipe[0]);
  3240. close(stdout_pipe[1]);
  3241. close(fd);
  3242. /* Close all other fds, including the read end of the pipe */
  3243. /* XXX: We should now be doing enough FD_CLOEXEC setting to make
  3244. * this needless. */
  3245. for (fd = STDERR_FILENO + 1; fd < max_fd; fd++) {
  3246. close(fd);
  3247. }
  3248. child_state = CHILD_STATE_EXEC;
  3249. /* Call the requested program. We need the cast because
  3250. execvp doesn't define argv as const, even though it
  3251. does not modify the arguments */
  3252. if (env)
  3253. execve(filename, (char *const *) argv, env->unixoid_environment_block);
  3254. else
  3255. execvp(filename, (char *const *) argv);
  3256. /* If we got here, the exec or open(/dev/null) failed */
  3257. child_state = CHILD_STATE_FAILEXEC;
  3258. error:
  3259. /* XXX: are we leaking fds from the pipe? */
  3260. format_helper_exit_status(child_state, errno, hex_errno);
  3261. /* Write the error message. GCC requires that we check the return
  3262. value, but there is nothing we can do if it fails */
  3263. /* TODO: Don't use STDOUT, use a pipe set up just for this purpose */
  3264. nbytes = write(STDOUT_FILENO, error_message, error_message_length);
  3265. nbytes = write(STDOUT_FILENO, hex_errno, sizeof(hex_errno));
  3266. (void) nbytes;
  3267. _exit(255);
  3268. /* Never reached, but avoids compiler warning */
  3269. return status;
  3270. }
  3271. /* In parent */
  3272. if (-1 == pid) {
  3273. log_warn(LD_GENERAL, "Failed to fork child process: %s", strerror(errno));
  3274. close(stdout_pipe[0]);
  3275. close(stdout_pipe[1]);
  3276. close(stderr_pipe[0]);
  3277. close(stderr_pipe[1]);
  3278. return status;
  3279. }
  3280. process_handle = process_handle_new();
  3281. process_handle->status = status;
  3282. process_handle->pid = pid;
  3283. /* TODO: If the child process forked but failed to exec, waitpid it */
  3284. /* Return read end of the pipes to caller, and close write end */
  3285. process_handle->stdout_pipe = stdout_pipe[0];
  3286. retval = close(stdout_pipe[1]);
  3287. if (-1 == retval) {
  3288. log_warn(LD_GENERAL,
  3289. "Failed to close write end of stdout pipe in parent process: %s",
  3290. strerror(errno));
  3291. }
  3292. process_handle->stderr_pipe = stderr_pipe[0];
  3293. retval = close(stderr_pipe[1]);
  3294. if (-1 == retval) {
  3295. log_warn(LD_GENERAL,
  3296. "Failed to close write end of stderr pipe in parent process: %s",
  3297. strerror(errno));
  3298. }
  3299. status = process_handle->status = PROCESS_STATUS_RUNNING;
  3300. /* Set stdout/stderr pipes to be non-blocking */
  3301. fcntl(process_handle->stdout_pipe, F_SETFL, O_NONBLOCK);
  3302. fcntl(process_handle->stderr_pipe, F_SETFL, O_NONBLOCK);
  3303. /* Open the buffered IO streams */
  3304. process_handle->stdout_handle = fdopen(process_handle->stdout_pipe, "r");
  3305. process_handle->stderr_handle = fdopen(process_handle->stderr_pipe, "r");
  3306. *process_handle_out = process_handle;
  3307. return process_handle->status;
  3308. #endif // _WIN32
  3309. }
  3310. /** Destroy all resources allocated by the process handle in
  3311. * <b>process_handle</b>.
  3312. * If <b>also_terminate_process</b> is true, also terminate the
  3313. * process of the process handle. */
  3314. void
  3315. tor_process_handle_destroy(process_handle_t *process_handle,
  3316. int also_terminate_process)
  3317. {
  3318. if (!process_handle)
  3319. return;
  3320. if (also_terminate_process) {
  3321. if (tor_terminate_process(process_handle) < 0) {
  3322. log_notice(LD_GENERAL, "Failed to terminate process with PID '%d'",
  3323. tor_process_get_pid(process_handle));
  3324. } else {
  3325. log_info(LD_GENERAL, "Terminated process with PID '%d'",
  3326. tor_process_get_pid(process_handle));
  3327. }
  3328. }
  3329. process_handle->status = PROCESS_STATUS_NOTRUNNING;
  3330. #ifdef _WIN32
  3331. if (process_handle->stdout_pipe)
  3332. CloseHandle(process_handle->stdout_pipe);
  3333. if (process_handle->stderr_pipe)
  3334. CloseHandle(process_handle->stderr_pipe);
  3335. #else
  3336. if (process_handle->stdout_handle)
  3337. fclose(process_handle->stdout_handle);
  3338. if (process_handle->stderr_handle)
  3339. fclose(process_handle->stderr_handle);
  3340. #endif
  3341. memset(process_handle, 0x0f, sizeof(process_handle_t));
  3342. tor_free(process_handle);
  3343. }
  3344. /** Get the exit code of a process specified by <b>process_handle</b> and store
  3345. * it in <b>exit_code</b>, if set to a non-NULL value. If <b>block</b> is set
  3346. * to true, the call will block until the process has exited. Otherwise if
  3347. * the process is still running, the function will return
  3348. * PROCESS_EXIT_RUNNING, and exit_code will be left unchanged. Returns
  3349. * PROCESS_EXIT_EXITED if the process did exit. If there is a failure,
  3350. * PROCESS_EXIT_ERROR will be returned and the contents of exit_code (if
  3351. * non-NULL) will be undefined. N.B. Under *nix operating systems, this will
  3352. * probably not work in Tor, because waitpid() is called in main.c to reap any
  3353. * terminated child processes.*/
  3354. int
  3355. tor_get_exit_code(const process_handle_t *process_handle,
  3356. int block, int *exit_code)
  3357. {
  3358. #ifdef _WIN32
  3359. DWORD retval;
  3360. BOOL success;
  3361. if (block) {
  3362. /* Wait for the process to exit */
  3363. retval = WaitForSingleObject(process_handle->pid.hProcess, INFINITE);
  3364. if (retval != WAIT_OBJECT_0) {
  3365. log_warn(LD_GENERAL, "WaitForSingleObject() failed (%d): %s",
  3366. (int)retval, format_win32_error(GetLastError()));
  3367. return PROCESS_EXIT_ERROR;
  3368. }
  3369. } else {
  3370. retval = WaitForSingleObject(process_handle->pid.hProcess, 0);
  3371. if (WAIT_TIMEOUT == retval) {
  3372. /* Process has not exited */
  3373. return PROCESS_EXIT_RUNNING;
  3374. } else if (retval != WAIT_OBJECT_0) {
  3375. log_warn(LD_GENERAL, "WaitForSingleObject() failed (%d): %s",
  3376. (int)retval, format_win32_error(GetLastError()));
  3377. return PROCESS_EXIT_ERROR;
  3378. }
  3379. }
  3380. if (exit_code != NULL) {
  3381. success = GetExitCodeProcess(process_handle->pid.hProcess,
  3382. (PDWORD)exit_code);
  3383. if (!success) {
  3384. log_warn(LD_GENERAL, "GetExitCodeProcess() failed: %s",
  3385. format_win32_error(GetLastError()));
  3386. return PROCESS_EXIT_ERROR;
  3387. }
  3388. }
  3389. #else
  3390. int stat_loc;
  3391. int retval;
  3392. retval = waitpid(process_handle->pid, &stat_loc, block?0:WNOHANG);
  3393. if (!block && 0 == retval) {
  3394. /* Process has not exited */
  3395. return PROCESS_EXIT_RUNNING;
  3396. } else if (retval != process_handle->pid) {
  3397. log_warn(LD_GENERAL, "waitpid() failed for PID %d: %s",
  3398. process_handle->pid, strerror(errno));
  3399. return PROCESS_EXIT_ERROR;
  3400. }
  3401. if (!WIFEXITED(stat_loc)) {
  3402. log_warn(LD_GENERAL, "Process %d did not exit normally",
  3403. process_handle->pid);
  3404. return PROCESS_EXIT_ERROR;
  3405. }
  3406. if (exit_code != NULL)
  3407. *exit_code = WEXITSTATUS(stat_loc);
  3408. #endif // _WIN32
  3409. return PROCESS_EXIT_EXITED;
  3410. }
  3411. /** Return non-zero iff getenv would consider <b>s1</b> and <b>s2</b>
  3412. * to have the same name as strings in a process's environment. */
  3413. int
  3414. environment_variable_names_equal(const char *s1, const char *s2)
  3415. {
  3416. size_t s1_name_len = strcspn(s1, "=");
  3417. size_t s2_name_len = strcspn(s2, "=");
  3418. return (s1_name_len == s2_name_len &&
  3419. tor_memeq(s1, s2, s1_name_len));
  3420. }
  3421. /** Free <b>env</b> (assuming it was produced by
  3422. * process_environment_make). */
  3423. void
  3424. process_environment_free(process_environment_t *env)
  3425. {
  3426. if (env == NULL) return;
  3427. /* As both an optimization hack to reduce consing on Unixoid systems
  3428. * and a nice way to ensure that some otherwise-Windows-specific
  3429. * code will always get tested before changes to it get merged, the
  3430. * strings which env->unixoid_environment_block points to are packed
  3431. * into env->windows_environment_block. */
  3432. tor_free(env->unixoid_environment_block);
  3433. tor_free(env->windows_environment_block);
  3434. tor_free(env);
  3435. }
  3436. /** Make a process_environment_t containing the environment variables
  3437. * specified in <b>env_vars</b> (as C strings of the form
  3438. * "NAME=VALUE"). */
  3439. process_environment_t *
  3440. process_environment_make(struct smartlist_t *env_vars)
  3441. {
  3442. process_environment_t *env = tor_malloc_zero(sizeof(process_environment_t));
  3443. size_t n_env_vars = smartlist_len(env_vars);
  3444. size_t i;
  3445. size_t total_env_length;
  3446. smartlist_t *env_vars_sorted;
  3447. tor_assert(n_env_vars + 1 != 0);
  3448. env->unixoid_environment_block = tor_calloc(n_env_vars + 1, sizeof(char *));
  3449. /* env->unixoid_environment_block is already NULL-terminated,
  3450. * because we assume that NULL == 0 (and check that during compilation). */
  3451. total_env_length = 1; /* terminating NUL of terminating empty string */
  3452. for (i = 0; i < n_env_vars; ++i) {
  3453. const char *s = smartlist_get(env_vars, i);
  3454. size_t slen = strlen(s);
  3455. tor_assert(slen + 1 != 0);
  3456. tor_assert(slen + 1 < SIZE_MAX - total_env_length);
  3457. total_env_length += slen + 1;
  3458. }
  3459. env->windows_environment_block = tor_malloc_zero(total_env_length);
  3460. /* env->windows_environment_block is already
  3461. * (NUL-terminated-empty-string)-terminated. */
  3462. /* Some versions of Windows supposedly require that environment
  3463. * blocks be sorted. Or maybe some Windows programs (or their
  3464. * runtime libraries) fail to look up strings in non-sorted
  3465. * environment blocks.
  3466. *
  3467. * Also, sorting strings makes it easy to find duplicate environment
  3468. * variables and environment-variable strings without an '=' on all
  3469. * OSes, and they can cause badness. Let's complain about those. */
  3470. env_vars_sorted = smartlist_new();
  3471. smartlist_add_all(env_vars_sorted, env_vars);
  3472. smartlist_sort_strings(env_vars_sorted);
  3473. /* Now copy the strings into the environment blocks. */
  3474. {
  3475. char *cp = env->windows_environment_block;
  3476. const char *prev_env_var = NULL;
  3477. for (i = 0; i < n_env_vars; ++i) {
  3478. const char *s = smartlist_get(env_vars_sorted, i);
  3479. size_t slen = strlen(s);
  3480. size_t s_name_len = strcspn(s, "=");
  3481. if (s_name_len == slen) {
  3482. log_warn(LD_GENERAL,
  3483. "Preparing an environment containing a variable "
  3484. "without a value: %s",
  3485. s);
  3486. }
  3487. if (prev_env_var != NULL &&
  3488. environment_variable_names_equal(s, prev_env_var)) {
  3489. log_warn(LD_GENERAL,
  3490. "Preparing an environment containing two variables "
  3491. "with the same name: %s and %s",
  3492. prev_env_var, s);
  3493. }
  3494. prev_env_var = s;
  3495. /* Actually copy the string into the environment. */
  3496. memcpy(cp, s, slen+1);
  3497. env->unixoid_environment_block[i] = cp;
  3498. cp += slen+1;
  3499. }
  3500. tor_assert(cp == env->windows_environment_block + total_env_length - 1);
  3501. }
  3502. smartlist_free(env_vars_sorted);
  3503. return env;
  3504. }
  3505. /** Return a newly allocated smartlist containing every variable in
  3506. * this process's environment, as a NUL-terminated string of the form
  3507. * "NAME=VALUE". Note that on some/many/most/all OSes, the parent
  3508. * process can put strings not of that form in our environment;
  3509. * callers should try to not get crashed by that.
  3510. *
  3511. * The returned strings are heap-allocated, and must be freed by the
  3512. * caller. */
  3513. struct smartlist_t *
  3514. get_current_process_environment_variables(void)
  3515. {
  3516. smartlist_t *sl = smartlist_new();
  3517. char **environ_tmp; /* Not const char ** ? Really? */
  3518. for (environ_tmp = get_environment(); *environ_tmp; ++environ_tmp) {
  3519. smartlist_add(sl, tor_strdup(*environ_tmp));
  3520. }
  3521. return sl;
  3522. }
  3523. /** For each string s in <b>env_vars</b> such that
  3524. * environment_variable_names_equal(s, <b>new_var</b>), remove it; if
  3525. * <b>free_p</b> is non-zero, call <b>free_old</b>(s). If
  3526. * <b>new_var</b> contains '=', insert it into <b>env_vars</b>. */
  3527. void
  3528. set_environment_variable_in_smartlist(struct smartlist_t *env_vars,
  3529. const char *new_var,
  3530. void (*free_old)(void*),
  3531. int free_p)
  3532. {
  3533. SMARTLIST_FOREACH_BEGIN(env_vars, const char *, s) {
  3534. if (environment_variable_names_equal(s, new_var)) {
  3535. SMARTLIST_DEL_CURRENT(env_vars, s);
  3536. if (free_p) {
  3537. free_old((void *)s);
  3538. }
  3539. }
  3540. } SMARTLIST_FOREACH_END(s);
  3541. if (strchr(new_var, '=') != NULL) {
  3542. smartlist_add(env_vars, (void *)new_var);
  3543. }
  3544. }
  3545. #ifdef _WIN32
  3546. /** Read from a handle <b>h</b> into <b>buf</b>, up to <b>count</b> bytes. If
  3547. * <b>hProcess</b> is NULL, the function will return immediately if there is
  3548. * nothing more to read. Otherwise <b>hProcess</b> should be set to the handle
  3549. * to the process owning the <b>h</b>. In this case, the function will exit
  3550. * only once the process has exited, or <b>count</b> bytes are read. Returns
  3551. * the number of bytes read, or -1 on error. */
  3552. ssize_t
  3553. tor_read_all_handle(HANDLE h, char *buf, size_t count,
  3554. const process_handle_t *process)
  3555. {
  3556. size_t numread = 0;
  3557. BOOL retval;
  3558. DWORD byte_count;
  3559. BOOL process_exited = FALSE;
  3560. if (count > SIZE_T_CEILING || count > SSIZE_T_MAX)
  3561. return -1;
  3562. while (numread != count) {
  3563. /* Check if there is anything to read */
  3564. retval = PeekNamedPipe(h, NULL, 0, NULL, &byte_count, NULL);
  3565. if (!retval) {
  3566. log_warn(LD_GENERAL,
  3567. "Failed to peek from handle: %s",
  3568. format_win32_error(GetLastError()));
  3569. return -1;
  3570. } else if (0 == byte_count) {
  3571. /* Nothing available: process exited or it is busy */
  3572. /* Exit if we don't know whether the process is running */
  3573. if (NULL == process)
  3574. break;
  3575. /* The process exited and there's nothing left to read from it */
  3576. if (process_exited)
  3577. break;
  3578. /* If process is not running, check for output one more time in case
  3579. it wrote something after the peek was performed. Otherwise keep on
  3580. waiting for output */
  3581. tor_assert(process != NULL);
  3582. byte_count = WaitForSingleObject(process->pid.hProcess, 0);
  3583. if (WAIT_TIMEOUT != byte_count)
  3584. process_exited = TRUE;
  3585. continue;
  3586. }
  3587. /* There is data to read; read it */
  3588. retval = ReadFile(h, buf+numread, count-numread, &byte_count, NULL);
  3589. tor_assert(byte_count + numread <= count);
  3590. if (!retval) {
  3591. log_warn(LD_GENERAL, "Failed to read from handle: %s",
  3592. format_win32_error(GetLastError()));
  3593. return -1;
  3594. } else if (0 == byte_count) {
  3595. /* End of file */
  3596. break;
  3597. }
  3598. numread += byte_count;
  3599. }
  3600. return (ssize_t)numread;
  3601. }
  3602. #else
  3603. /** Read from a handle <b>h</b> into <b>buf</b>, up to <b>count</b> bytes. If
  3604. * <b>process</b> is NULL, the function will return immediately if there is
  3605. * nothing more to read. Otherwise data will be read until end of file, or
  3606. * <b>count</b> bytes are read. Returns the number of bytes read, or -1 on
  3607. * error. Sets <b>eof</b> to true if <b>eof</b> is not NULL and the end of the
  3608. * file has been reached. */
  3609. ssize_t
  3610. tor_read_all_handle(FILE *h, char *buf, size_t count,
  3611. const process_handle_t *process,
  3612. int *eof)
  3613. {
  3614. size_t numread = 0;
  3615. char *retval;
  3616. if (eof)
  3617. *eof = 0;
  3618. if (count > SIZE_T_CEILING || count > SSIZE_T_MAX)
  3619. return -1;
  3620. while (numread != count) {
  3621. /* Use fgets because that is what we use in log_from_pipe() */
  3622. retval = fgets(buf+numread, (int)(count-numread), h);
  3623. if (NULL == retval) {
  3624. if (feof(h)) {
  3625. log_debug(LD_GENERAL, "fgets() reached end of file");
  3626. if (eof)
  3627. *eof = 1;
  3628. break;
  3629. } else {
  3630. if (EAGAIN == errno) {
  3631. if (process)
  3632. continue;
  3633. else
  3634. break;
  3635. } else {
  3636. log_warn(LD_GENERAL, "fgets() from handle failed: %s",
  3637. strerror(errno));
  3638. return -1;
  3639. }
  3640. }
  3641. }
  3642. tor_assert(retval != NULL);
  3643. tor_assert(strlen(retval) + numread <= count);
  3644. numread += strlen(retval);
  3645. }
  3646. log_debug(LD_GENERAL, "fgets() read %d bytes from handle", (int)numread);
  3647. return (ssize_t)numread;
  3648. }
  3649. #endif
  3650. /** Read from stdout of a process until the process exits. */
  3651. ssize_t
  3652. tor_read_all_from_process_stdout(const process_handle_t *process_handle,
  3653. char *buf, size_t count)
  3654. {
  3655. #ifdef _WIN32
  3656. return tor_read_all_handle(process_handle->stdout_pipe, buf, count,
  3657. process_handle);
  3658. #else
  3659. return tor_read_all_handle(process_handle->stdout_handle, buf, count,
  3660. process_handle, NULL);
  3661. #endif
  3662. }
  3663. /** Read from stdout of a process until the process exits. */
  3664. ssize_t
  3665. tor_read_all_from_process_stderr(const process_handle_t *process_handle,
  3666. char *buf, size_t count)
  3667. {
  3668. #ifdef _WIN32
  3669. return tor_read_all_handle(process_handle->stderr_pipe, buf, count,
  3670. process_handle);
  3671. #else
  3672. return tor_read_all_handle(process_handle->stderr_handle, buf, count,
  3673. process_handle, NULL);
  3674. #endif
  3675. }
  3676. /** Split buf into lines, and add to smartlist. The buffer <b>buf</b> will be
  3677. * modified. The resulting smartlist will consist of pointers to buf, so there
  3678. * is no need to free the contents of sl. <b>buf</b> must be a NUL-terminated
  3679. * string. <b>len</b> should be set to the length of the buffer excluding the
  3680. * NUL. Non-printable characters (including NUL) will be replaced with "." */
  3681. int
  3682. tor_split_lines(smartlist_t *sl, char *buf, int len)
  3683. {
  3684. /* Index in buf of the start of the current line */
  3685. int start = 0;
  3686. /* Index in buf of the current character being processed */
  3687. int cur = 0;
  3688. /* Are we currently in a line */
  3689. char in_line = 0;
  3690. /* Loop over string */
  3691. while (cur < len) {
  3692. /* Loop until end of line or end of string */
  3693. for (; cur < len; cur++) {
  3694. if (in_line) {
  3695. if ('\r' == buf[cur] || '\n' == buf[cur]) {
  3696. /* End of line */
  3697. buf[cur] = '\0';
  3698. /* Point cur to the next line */
  3699. cur++;
  3700. /* Line starts at start and ends with a nul */
  3701. break;
  3702. } else {
  3703. if (!TOR_ISPRINT(buf[cur]))
  3704. buf[cur] = '.';
  3705. }
  3706. } else {
  3707. if ('\r' == buf[cur] || '\n' == buf[cur]) {
  3708. /* Skip leading vertical space */
  3709. ;
  3710. } else {
  3711. in_line = 1;
  3712. start = cur;
  3713. if (!TOR_ISPRINT(buf[cur]))
  3714. buf[cur] = '.';
  3715. }
  3716. }
  3717. }
  3718. /* We are at the end of the line or end of string. If in_line is true there
  3719. * is a line which starts at buf+start and ends at a NUL. cur points to
  3720. * the character after the NUL. */
  3721. if (in_line)
  3722. smartlist_add(sl, (void *)(buf+start));
  3723. in_line = 0;
  3724. }
  3725. return smartlist_len(sl);
  3726. }
  3727. #ifdef _WIN32
  3728. /** Read from stream, and send lines to log at the specified log level.
  3729. * Returns -1 if there is a error reading, and 0 otherwise.
  3730. * If the generated stream is flushed more often than on new lines, or
  3731. * a read exceeds 256 bytes, lines will be truncated. This should be fixed,
  3732. * along with the corresponding problem on *nix (see bug #2045).
  3733. */
  3734. static int
  3735. log_from_handle(HANDLE *pipe, int severity)
  3736. {
  3737. char buf[256];
  3738. int pos;
  3739. smartlist_t *lines;
  3740. pos = tor_read_all_handle(pipe, buf, sizeof(buf) - 1, NULL);
  3741. if (pos < 0) {
  3742. /* Error */
  3743. log_warn(LD_GENERAL, "Failed to read data from subprocess");
  3744. return -1;
  3745. }
  3746. if (0 == pos) {
  3747. /* There's nothing to read (process is busy or has exited) */
  3748. log_debug(LD_GENERAL, "Subprocess had nothing to say");
  3749. return 0;
  3750. }
  3751. /* End with a null even if there isn't a \r\n at the end */
  3752. /* TODO: What if this is a partial line? */
  3753. buf[pos] = '\0';
  3754. log_debug(LD_GENERAL, "Subprocess had %d bytes to say", pos);
  3755. /* Split up the buffer */
  3756. lines = smartlist_new();
  3757. tor_split_lines(lines, buf, pos);
  3758. /* Log each line */
  3759. SMARTLIST_FOREACH(lines, char *, line,
  3760. {
  3761. log_fn(severity, LD_GENERAL, "Port forwarding helper says: %s", line);
  3762. });
  3763. smartlist_free(lines);
  3764. return 0;
  3765. }
  3766. #else
  3767. /** Read from stream, and send lines to log at the specified log level.
  3768. * Returns 1 if stream is closed normally, -1 if there is a error reading, and
  3769. * 0 otherwise. Handles lines from tor-fw-helper and
  3770. * tor_spawn_background() specially.
  3771. */
  3772. static int
  3773. log_from_pipe(FILE *stream, int severity, const char *executable,
  3774. int *child_status)
  3775. {
  3776. char buf[256];
  3777. enum stream_status r;
  3778. for (;;) {
  3779. r = get_string_from_pipe(stream, buf, sizeof(buf) - 1);
  3780. if (r == IO_STREAM_CLOSED) {
  3781. return 1;
  3782. } else if (r == IO_STREAM_EAGAIN) {
  3783. return 0;
  3784. } else if (r == IO_STREAM_TERM) {
  3785. return -1;
  3786. }
  3787. tor_assert(r == IO_STREAM_OKAY);
  3788. /* Check if buf starts with SPAWN_ERROR_MESSAGE */
  3789. if (strcmpstart(buf, SPAWN_ERROR_MESSAGE) == 0) {
  3790. /* Parse error message */
  3791. int retval, child_state, saved_errno;
  3792. retval = tor_sscanf(buf, SPAWN_ERROR_MESSAGE "%x/%x",
  3793. &child_state, &saved_errno);
  3794. if (retval == 2) {
  3795. log_warn(LD_GENERAL,
  3796. "Failed to start child process \"%s\" in state %d: %s",
  3797. executable, child_state, strerror(saved_errno));
  3798. if (child_status)
  3799. *child_status = 1;
  3800. } else {
  3801. /* Failed to parse message from child process, log it as a
  3802. warning */
  3803. log_warn(LD_GENERAL,
  3804. "Unexpected message from port forwarding helper \"%s\": %s",
  3805. executable, buf);
  3806. }
  3807. } else {
  3808. log_fn(severity, LD_GENERAL, "Port forwarding helper says: %s", buf);
  3809. }
  3810. }
  3811. /* We should never get here */
  3812. return -1;
  3813. }
  3814. #endif
  3815. /** Reads from <b>stream</b> and stores input in <b>buf_out</b> making
  3816. * sure it's below <b>count</b> bytes.
  3817. * If the string has a trailing newline, we strip it off.
  3818. *
  3819. * This function is specifically created to handle input from managed
  3820. * proxies, according to the pluggable transports spec. Make sure it
  3821. * fits your needs before using it.
  3822. *
  3823. * Returns:
  3824. * IO_STREAM_CLOSED: If the stream is closed.
  3825. * IO_STREAM_EAGAIN: If there is nothing to read and we should check back
  3826. * later.
  3827. * IO_STREAM_TERM: If something is wrong with the stream.
  3828. * IO_STREAM_OKAY: If everything went okay and we got a string
  3829. * in <b>buf_out</b>. */
  3830. enum stream_status
  3831. get_string_from_pipe(FILE *stream, char *buf_out, size_t count)
  3832. {
  3833. char *retval;
  3834. size_t len;
  3835. tor_assert(count <= INT_MAX);
  3836. retval = fgets(buf_out, (int)count, stream);
  3837. if (!retval) {
  3838. if (feof(stream)) {
  3839. /* Program has closed stream (probably it exited) */
  3840. /* TODO: check error */
  3841. return IO_STREAM_CLOSED;
  3842. } else {
  3843. if (EAGAIN == errno) {
  3844. /* Nothing more to read, try again next time */
  3845. return IO_STREAM_EAGAIN;
  3846. } else {
  3847. /* There was a problem, abandon this child process */
  3848. return IO_STREAM_TERM;
  3849. }
  3850. }
  3851. } else {
  3852. len = strlen(buf_out);
  3853. tor_assert(len>0);
  3854. if (buf_out[len - 1] == '\n') {
  3855. /* Remove the trailing newline */
  3856. buf_out[len - 1] = '\0';
  3857. } else {
  3858. /* No newline; check whether we overflowed the buffer */
  3859. if (!feof(stream))
  3860. log_info(LD_GENERAL,
  3861. "Line from stream was truncated: %s", buf_out);
  3862. /* TODO: What to do with this error? */
  3863. }
  3864. return IO_STREAM_OKAY;
  3865. }
  3866. /* We should never get here */
  3867. return IO_STREAM_TERM;
  3868. }
  3869. /* DOCDOC tor_check_port_forwarding */
  3870. void
  3871. tor_check_port_forwarding(const char *filename, int dir_port, int or_port,
  3872. time_t now)
  3873. {
  3874. /* When fw-helper succeeds, how long do we wait until running it again */
  3875. #define TIME_TO_EXEC_FWHELPER_SUCCESS 300
  3876. /* When fw-helper failed to start, how long do we wait until running it again
  3877. */
  3878. #define TIME_TO_EXEC_FWHELPER_FAIL 60
  3879. /* Static variables are initialized to zero, so child_handle.status=0
  3880. * which corresponds to it not running on startup */
  3881. static process_handle_t *child_handle=NULL;
  3882. static time_t time_to_run_helper = 0;
  3883. int stdout_status, stderr_status, retval;
  3884. const char *argv[10];
  3885. char s_dirport[6], s_orport[6];
  3886. tor_assert(filename);
  3887. /* Set up command line for tor-fw-helper */
  3888. snprintf(s_dirport, sizeof s_dirport, "%d", dir_port);
  3889. snprintf(s_orport, sizeof s_orport, "%d", or_port);
  3890. /* TODO: Allow different internal and external ports */
  3891. argv[0] = filename;
  3892. argv[1] = "--internal-or-port";
  3893. argv[2] = s_orport;
  3894. argv[3] = "--external-or-port";
  3895. argv[4] = s_orport;
  3896. argv[5] = "--internal-dir-port";
  3897. argv[6] = s_dirport;
  3898. argv[7] = "--external-dir-port";
  3899. argv[8] = s_dirport;
  3900. argv[9] = NULL;
  3901. /* Start the child, if it is not already running */
  3902. if ((!child_handle || child_handle->status != PROCESS_STATUS_RUNNING) &&
  3903. time_to_run_helper < now) {
  3904. int status;
  3905. /* Assume tor-fw-helper will succeed, start it later*/
  3906. time_to_run_helper = now + TIME_TO_EXEC_FWHELPER_SUCCESS;
  3907. if (child_handle) {
  3908. tor_process_handle_destroy(child_handle, 1);
  3909. child_handle = NULL;
  3910. }
  3911. #ifdef _WIN32
  3912. /* Passing NULL as lpApplicationName makes Windows search for the .exe */
  3913. status = tor_spawn_background(NULL, argv, NULL, &child_handle);
  3914. #else
  3915. status = tor_spawn_background(filename, argv, NULL, &child_handle);
  3916. #endif
  3917. if (PROCESS_STATUS_ERROR == status) {
  3918. log_warn(LD_GENERAL, "Failed to start port forwarding helper %s",
  3919. filename);
  3920. time_to_run_helper = now + TIME_TO_EXEC_FWHELPER_FAIL;
  3921. return;
  3922. }
  3923. log_info(LD_GENERAL,
  3924. "Started port forwarding helper (%s) with pid '%d'",
  3925. filename, tor_process_get_pid(child_handle));
  3926. }
  3927. /* If child is running, read from its stdout and stderr) */
  3928. if (child_handle && PROCESS_STATUS_RUNNING == child_handle->status) {
  3929. /* Read from stdout/stderr and log result */
  3930. retval = 0;
  3931. #ifdef _WIN32
  3932. stdout_status = log_from_handle(child_handle->stdout_pipe, LOG_INFO);
  3933. stderr_status = log_from_handle(child_handle->stderr_pipe, LOG_WARN);
  3934. /* If we got this far (on Windows), the process started */
  3935. retval = 0;
  3936. #else
  3937. stdout_status = log_from_pipe(child_handle->stdout_handle,
  3938. LOG_INFO, filename, &retval);
  3939. stderr_status = log_from_pipe(child_handle->stderr_handle,
  3940. LOG_WARN, filename, &retval);
  3941. #endif
  3942. if (retval) {
  3943. /* There was a problem in the child process */
  3944. time_to_run_helper = now + TIME_TO_EXEC_FWHELPER_FAIL;
  3945. }
  3946. /* Combine the two statuses in order of severity */
  3947. if (-1 == stdout_status || -1 == stderr_status)
  3948. /* There was a failure */
  3949. retval = -1;
  3950. #ifdef _WIN32
  3951. else if (!child_handle || tor_get_exit_code(child_handle, 0, NULL) !=
  3952. PROCESS_EXIT_RUNNING) {
  3953. /* process has exited or there was an error */
  3954. /* TODO: Do something with the process return value */
  3955. /* TODO: What if the process output something since
  3956. * between log_from_handle and tor_get_exit_code? */
  3957. retval = 1;
  3958. }
  3959. #else
  3960. else if (1 == stdout_status || 1 == stderr_status)
  3961. /* stdout or stderr was closed, the process probably
  3962. * exited. It will be reaped by waitpid() in main.c */
  3963. /* TODO: Do something with the process return value */
  3964. retval = 1;
  3965. #endif
  3966. else
  3967. /* Both are fine */
  3968. retval = 0;
  3969. /* If either pipe indicates a failure, act on it */
  3970. if (0 != retval) {
  3971. if (1 == retval) {
  3972. log_info(LD_GENERAL, "Port forwarding helper terminated");
  3973. child_handle->status = PROCESS_STATUS_NOTRUNNING;
  3974. } else {
  3975. log_warn(LD_GENERAL, "Failed to read from port forwarding helper");
  3976. child_handle->status = PROCESS_STATUS_ERROR;
  3977. }
  3978. /* TODO: The child might not actually be finished (maybe it failed or
  3979. closed stdout/stderr), so maybe we shouldn't start another? */
  3980. }
  3981. }
  3982. }