channel.c 113 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087
  1. /* * Copyright (c) 2012, The Tor Project, Inc. */
  2. /* See LICENSE for licensing information */
  3. /**
  4. * \file channel.c
  5. * \brief OR-to-OR channel abstraction layer
  6. **/
  7. /*
  8. * Define this so channel.h gives us things only channel_t subclasses
  9. * should touch.
  10. */
  11. #define _TOR_CHANNEL_INTERNAL
  12. #include "or.h"
  13. #include "channel.h"
  14. #include "channeltls.h"
  15. #include "circuitbuild.h"
  16. #include "circuitlist.h"
  17. #include "connection_or.h" /* For var_cell_free() */
  18. #include "circuitmux.h"
  19. #include "geoip.h"
  20. #include "nodelist.h"
  21. #include "relay.h"
  22. #include "rephist.h"
  23. #include "router.h"
  24. #include "routerlist.h"
  25. /* Cell queue structure */
  26. typedef struct cell_queue_entry_s cell_queue_entry_t;
  27. struct cell_queue_entry_s {
  28. enum {
  29. CELL_QUEUE_FIXED,
  30. CELL_QUEUE_VAR,
  31. CELL_QUEUE_PACKED
  32. } type;
  33. union {
  34. struct {
  35. cell_t *cell;
  36. } fixed;
  37. struct {
  38. var_cell_t *var_cell;
  39. } var;
  40. struct {
  41. packed_cell_t *packed_cell;
  42. } packed;
  43. } u;
  44. };
  45. /* Global lists of channels */
  46. /* All channel_t instances */
  47. static smartlist_t *all_channels = NULL;
  48. /* All channel_t instances not in ERROR or CLOSED states */
  49. static smartlist_t *active_channels = NULL;
  50. /* All channel_t instances in ERROR or CLOSED states */
  51. static smartlist_t *finished_channels = NULL;
  52. /* All channel_listener_t instances */
  53. static smartlist_t *all_listeners = NULL;
  54. /* All channel_listener_t instances in LISTENING state */
  55. static smartlist_t *active_listeners = NULL;
  56. /* All channel_listener_t instances in LISTENING state */
  57. static smartlist_t *finished_listeners = NULL;
  58. /* Counter for ID numbers */
  59. static uint64_t n_channels_allocated = 0;
  60. /* Digest->channel map
  61. *
  62. * Similar to the one used in connection_or.c, this maps from the identity
  63. * digest of a remote endpoint to a channel_t to that endpoint. Channels
  64. * should be placed here when registered and removed when they close or error.
  65. * If more than one channel exists, follow the next_with_same_id pointer
  66. * as a linked list.
  67. */
  68. static digestmap_t *channel_identity_map = NULL;
  69. static cell_queue_entry_t * cell_queue_entry_dup(cell_queue_entry_t *q);
  70. static void cell_queue_entry_free(cell_queue_entry_t *q, int handed_off);
  71. static int cell_queue_entry_is_padding(cell_queue_entry_t *q);
  72. static cell_queue_entry_t *
  73. cell_queue_entry_new_fixed(cell_t *cell);
  74. static cell_queue_entry_t *
  75. cell_queue_entry_new_var(var_cell_t *var_cell);
  76. /* Functions to maintain the digest map */
  77. static void channel_add_to_digest_map(channel_t *chan);
  78. static void channel_remove_from_digest_map(channel_t *chan);
  79. /*
  80. * Flush cells from just the outgoing queue without trying to get them
  81. * from circuits; used internall by channel_flush_some_cells().
  82. */
  83. static ssize_t
  84. channel_flush_some_cells_from_outgoing_queue(channel_t *chan,
  85. ssize_t num_cells);
  86. static void channel_force_free(channel_t *chan);
  87. static void
  88. channel_free_list(smartlist_t *channels, int mark_for_close);
  89. static void
  90. channel_listener_free_list(smartlist_t *channels, int mark_for_close);
  91. static void channel_listener_force_free(channel_listener_t *chan_l);
  92. static void
  93. channel_write_cell_queue_entry(channel_t *chan, cell_queue_entry_t *q);
  94. /***********************************
  95. * Channel state utility functions *
  96. **********************************/
  97. /**
  98. * Indicate whether a given channel state is valid
  99. */
  100. int
  101. channel_state_is_valid(channel_state_t state)
  102. {
  103. int is_valid;
  104. switch (state) {
  105. case CHANNEL_STATE_CLOSED:
  106. case CHANNEL_STATE_CLOSING:
  107. case CHANNEL_STATE_ERROR:
  108. case CHANNEL_STATE_MAINT:
  109. case CHANNEL_STATE_OPENING:
  110. case CHANNEL_STATE_OPEN:
  111. is_valid = 1;
  112. break;
  113. case CHANNEL_STATE_LAST:
  114. default:
  115. is_valid = 0;
  116. }
  117. return is_valid;
  118. }
  119. /**
  120. * Indicate whether a given channel listener state is valid
  121. */
  122. int
  123. channel_listener_state_is_valid(channel_listener_state_t state)
  124. {
  125. int is_valid;
  126. switch (state) {
  127. case CHANNEL_LISTENER_STATE_CLOSED:
  128. case CHANNEL_LISTENER_STATE_LISTENING:
  129. case CHANNEL_LISTENER_STATE_CLOSING:
  130. case CHANNEL_LISTENER_STATE_ERROR:
  131. is_valid = 1;
  132. break;
  133. case CHANNEL_LISTENER_STATE_LAST:
  134. default:
  135. is_valid = 0;
  136. }
  137. return is_valid;
  138. }
  139. /**
  140. * Indicate whether a channel state transition is valid
  141. *
  142. * This function takes two channel states and indicates whether a
  143. * transition between them is permitted (see the state definitions and
  144. * transition table in or.h at the channel_state_t typedef).
  145. */
  146. int
  147. channel_state_can_transition(channel_state_t from, channel_state_t to)
  148. {
  149. int is_valid;
  150. switch (from) {
  151. case CHANNEL_STATE_CLOSED:
  152. is_valid = (to == CHANNEL_STATE_OPENING);
  153. break;
  154. case CHANNEL_STATE_CLOSING:
  155. is_valid = (to == CHANNEL_STATE_CLOSED ||
  156. to == CHANNEL_STATE_ERROR);
  157. break;
  158. case CHANNEL_STATE_ERROR:
  159. is_valid = 0;
  160. break;
  161. case CHANNEL_STATE_MAINT:
  162. is_valid = (to == CHANNEL_STATE_CLOSING ||
  163. to == CHANNEL_STATE_ERROR ||
  164. to == CHANNEL_STATE_OPEN);
  165. break;
  166. case CHANNEL_STATE_OPENING:
  167. is_valid = (to == CHANNEL_STATE_CLOSING ||
  168. to == CHANNEL_STATE_ERROR ||
  169. to == CHANNEL_STATE_OPEN);
  170. break;
  171. case CHANNEL_STATE_OPEN:
  172. is_valid = (to == CHANNEL_STATE_CLOSING ||
  173. to == CHANNEL_STATE_ERROR ||
  174. to == CHANNEL_STATE_MAINT);
  175. break;
  176. case CHANNEL_STATE_LAST:
  177. default:
  178. is_valid = 0;
  179. }
  180. return is_valid;
  181. }
  182. /**
  183. * Indicate whether a channel listener state transition is valid
  184. *
  185. * This function takes two channel listener states and indicates whether a
  186. * transition between them is permitted (see the state definitions and
  187. * transition table in or.h at the channel_listener_state_t typedef).
  188. */
  189. int
  190. channel_listener_state_can_transition(channel_listener_state_t from,
  191. channel_listener_state_t to)
  192. {
  193. int is_valid;
  194. switch (from) {
  195. case CHANNEL_LISTENER_STATE_CLOSED:
  196. is_valid = (to == CHANNEL_LISTENER_STATE_LISTENING);
  197. break;
  198. case CHANNEL_LISTENER_STATE_CLOSING:
  199. is_valid = (to == CHANNEL_LISTENER_STATE_CLOSED ||
  200. to == CHANNEL_LISTENER_STATE_ERROR);
  201. break;
  202. case CHANNEL_LISTENER_STATE_ERROR:
  203. is_valid = 0;
  204. break;
  205. case CHANNEL_LISTENER_STATE_LISTENING:
  206. is_valid = (to == CHANNEL_LISTENER_STATE_CLOSING ||
  207. to == CHANNEL_LISTENER_STATE_ERROR);
  208. break;
  209. case CHANNEL_LISTENER_STATE_LAST:
  210. default:
  211. is_valid = 0;
  212. }
  213. return is_valid;
  214. }
  215. /**
  216. * Return a human-readable description for a channel state
  217. */
  218. const char *
  219. channel_state_to_string(channel_state_t state)
  220. {
  221. const char *descr;
  222. switch (state) {
  223. case CHANNEL_STATE_CLOSED:
  224. descr = "closed";
  225. break;
  226. case CHANNEL_STATE_CLOSING:
  227. descr = "closing";
  228. break;
  229. case CHANNEL_STATE_ERROR:
  230. descr = "channel error";
  231. break;
  232. case CHANNEL_STATE_MAINT:
  233. descr = "temporarily suspended for maintenance";
  234. break;
  235. case CHANNEL_STATE_OPENING:
  236. descr = "opening";
  237. break;
  238. case CHANNEL_STATE_OPEN:
  239. descr = "open";
  240. break;
  241. case CHANNEL_STATE_LAST:
  242. default:
  243. descr = "unknown or invalid channel state";
  244. }
  245. return descr;
  246. }
  247. /**
  248. * Return a human-readable description for a channel listenier state
  249. */
  250. const char *
  251. channel_listener_state_to_string(channel_listener_state_t state)
  252. {
  253. const char *descr;
  254. switch (state) {
  255. case CHANNEL_LISTENER_STATE_CLOSED:
  256. descr = "closed";
  257. break;
  258. case CHANNEL_LISTENER_STATE_CLOSING:
  259. descr = "closing";
  260. break;
  261. case CHANNEL_LISTENER_STATE_ERROR:
  262. descr = "channel listener error";
  263. break;
  264. case CHANNEL_LISTENER_STATE_LISTENING:
  265. descr = "listening";
  266. break;
  267. case CHANNEL_LISTENER_STATE_LAST:
  268. default:
  269. descr = "unknown or invalid channel listener state";
  270. }
  271. return descr;
  272. }
  273. /***************************************
  274. * Channel registration/unregistration *
  275. ***************************************/
  276. /**
  277. * Register a channel
  278. *
  279. * This function registers a newly created channel in the global lists/maps
  280. * of active channels.
  281. */
  282. void
  283. channel_register(channel_t *chan)
  284. {
  285. tor_assert(chan);
  286. /* No-op if already registered */
  287. if (chan->registered) return;
  288. log_debug(LD_CHANNEL,
  289. "Registering channel %p (ID " U64_FORMAT ") "
  290. "in state %s (%d) with digest %s",
  291. chan, U64_PRINTF_ARG(chan->global_identifier),
  292. channel_state_to_string(chan->state), chan->state,
  293. hex_str(chan->identity_digest, DIGEST_LEN));
  294. /* Make sure we have all_channels, then add it */
  295. if (!all_channels) all_channels = smartlist_new();
  296. smartlist_add(all_channels, chan);
  297. /* Is it finished? */
  298. if (chan->state == CHANNEL_STATE_CLOSED ||
  299. chan->state == CHANNEL_STATE_ERROR) {
  300. /* Put it in the finished list, creating it if necessary */
  301. if (!finished_channels) finished_channels = smartlist_new();
  302. smartlist_add(finished_channels, chan);
  303. } else {
  304. /* Put it in the active list, creating it if necessary */
  305. if (!active_channels) active_channels = smartlist_new();
  306. smartlist_add(active_channels, chan);
  307. if (chan->state != CHANNEL_STATE_CLOSING) {
  308. /* It should have a digest set */
  309. if (!tor_digest_is_zero(chan->identity_digest)) {
  310. /* Yeah, we're good, add it to the map */
  311. channel_add_to_digest_map(chan);
  312. } else {
  313. log_info(LD_CHANNEL,
  314. "Channel %p (global ID " U64_FORMAT ") "
  315. "in state %s (%d) registered with no identity digest",
  316. chan, U64_PRINTF_ARG(chan->global_identifier),
  317. channel_state_to_string(chan->state), chan->state);
  318. }
  319. }
  320. }
  321. /* Mark it as registered */
  322. chan->registered = 1;
  323. }
  324. /**
  325. * Unregister a channel
  326. *
  327. * This function removes a channel from the global lists and maps and is used
  328. * when freeing a closed/errored channel.
  329. */
  330. void
  331. channel_unregister(channel_t *chan)
  332. {
  333. tor_assert(chan);
  334. /* No-op if not registered */
  335. if (!(chan->registered)) return;
  336. /* Is it finished? */
  337. if (chan->state == CHANNEL_STATE_CLOSED ||
  338. chan->state == CHANNEL_STATE_ERROR) {
  339. /* Get it out of the finished list */
  340. if (finished_channels) smartlist_remove(finished_channels, chan);
  341. } else {
  342. /* Get it out of the active list */
  343. if (active_channels) smartlist_remove(active_channels, chan);
  344. }
  345. /* Get it out of all_channels */
  346. if (all_channels) smartlist_remove(all_channels, chan);
  347. /* Mark it as unregistered */
  348. chan->registered = 0;
  349. /* Should it be in the digest map? */
  350. if (!tor_digest_is_zero(chan->identity_digest) &&
  351. !(chan->state == CHANNEL_STATE_CLOSING ||
  352. chan->state == CHANNEL_STATE_CLOSED ||
  353. chan->state == CHANNEL_STATE_ERROR)) {
  354. /* Remove it */
  355. channel_remove_from_digest_map(chan);
  356. }
  357. }
  358. /**
  359. * Register a channel listener
  360. *
  361. * This function registers a newly created channel listner in the global
  362. * lists/maps of active channel listeners.
  363. */
  364. void
  365. channel_listener_register(channel_listener_t *chan_l)
  366. {
  367. tor_assert(chan_l);
  368. /* No-op if already registered */
  369. if (chan_l->registered) return;
  370. log_debug(LD_CHANNEL,
  371. "Registering channel listener %p (ID " U64_FORMAT ") "
  372. "in state %s (%d)",
  373. chan_l, U64_PRINTF_ARG(chan_l->global_identifier),
  374. channel_listener_state_to_string(chan_l->state),
  375. chan_l->state);
  376. /* Make sure we have all_channels, then add it */
  377. if (!all_listeners) all_listeners = smartlist_new();
  378. smartlist_add(all_listeners, chan_l);
  379. /* Is it finished? */
  380. if (chan_l->state == CHANNEL_LISTENER_STATE_CLOSED ||
  381. chan_l->state == CHANNEL_LISTENER_STATE_ERROR) {
  382. /* Put it in the finished list, creating it if necessary */
  383. if (!finished_listeners) finished_listeners = smartlist_new();
  384. smartlist_add(finished_listeners, chan_l);
  385. } else {
  386. /* Put it in the active list, creating it if necessary */
  387. if (!active_listeners) active_listeners = smartlist_new();
  388. smartlist_add(active_listeners, chan_l);
  389. }
  390. /* Mark it as registered */
  391. chan_l->registered = 1;
  392. }
  393. /**
  394. * Unregister a channel listener
  395. *
  396. * This function removes a channel listener from the global lists and maps
  397. * and is used when freeing a closed/errored channel listener.
  398. */
  399. void
  400. channel_listener_unregister(channel_listener_t *chan_l)
  401. {
  402. tor_assert(chan_l);
  403. /* No-op if not registered */
  404. if (!(chan_l->registered)) return;
  405. /* Is it finished? */
  406. if (chan_l->state == CHANNEL_LISTENER_STATE_CLOSED ||
  407. chan_l->state == CHANNEL_LISTENER_STATE_ERROR) {
  408. /* Get it out of the finished list */
  409. if (finished_listeners) smartlist_remove(finished_listeners, chan_l);
  410. } else {
  411. /* Get it out of the active list */
  412. if (active_listeners) smartlist_remove(active_listeners, chan_l);
  413. }
  414. /* Get it out of all_channels */
  415. if (all_listeners) smartlist_remove(all_listeners, chan_l);
  416. /* Mark it as unregistered */
  417. chan_l->registered = 0;
  418. }
  419. /*********************************
  420. * Channel digest map maintenance
  421. *********************************/
  422. /**
  423. * Add a channel to the digest map
  424. *
  425. * This function adds a channel to the digest map and inserts it into the
  426. * correct linked list if channels with that remote endpoint identity digest
  427. * already exist.
  428. */
  429. static void
  430. channel_add_to_digest_map(channel_t *chan)
  431. {
  432. channel_t *tmp;
  433. tor_assert(chan);
  434. /* Assert that the state makes sense */
  435. tor_assert(!(chan->state == CHANNEL_STATE_CLOSING ||
  436. chan->state == CHANNEL_STATE_CLOSED ||
  437. chan->state == CHANNEL_STATE_ERROR));
  438. /* Assert that there is a digest */
  439. tor_assert(!tor_digest_is_zero(chan->identity_digest));
  440. /* Allocate the identity map if we have to */
  441. if (!channel_identity_map) channel_identity_map = digestmap_new();
  442. /* Insert it */
  443. tmp = digestmap_set(channel_identity_map,
  444. chan->identity_digest,
  445. chan);
  446. if (tmp) {
  447. /* There already was one, this goes at the head of the list */
  448. chan->next_with_same_id = tmp;
  449. chan->prev_with_same_id = NULL;
  450. tmp->prev_with_same_id = chan;
  451. } else {
  452. /* First with this digest */
  453. chan->next_with_same_id = NULL;
  454. chan->prev_with_same_id = NULL;
  455. }
  456. log_debug(LD_CHANNEL,
  457. "Added channel %p (global ID " U64_FORMAT ") "
  458. "to identity map in state %s (%d) with digest %s",
  459. chan, U64_PRINTF_ARG(chan->global_identifier),
  460. channel_state_to_string(chan->state), chan->state,
  461. hex_str(chan->identity_digest, DIGEST_LEN));
  462. }
  463. /**
  464. * Remove a channel from the digest map
  465. *
  466. * This function removes a channel from the digest map and the linked list of
  467. * channels for that digest if more than one exists.
  468. */
  469. static void
  470. channel_remove_from_digest_map(channel_t *chan)
  471. {
  472. channel_t *tmp, *head;
  473. tor_assert(chan);
  474. /* Assert that there is a digest */
  475. tor_assert(!tor_digest_is_zero(chan->identity_digest));
  476. /* Make sure we have a map */
  477. if (!channel_identity_map) {
  478. /*
  479. * No identity map, so we can't find it by definition. This
  480. * case is similar to digestmap_get() failing below.
  481. */
  482. log_warn(LD_BUG,
  483. "Trying to remove channel %p (global ID " U64_FORMAT ") "
  484. "with digest %s from identity map, but didn't have any identity "
  485. "map",
  486. chan, U64_PRINTF_ARG(chan->global_identifier),
  487. hex_str(chan->identity_digest, DIGEST_LEN));
  488. /* Clear out its next/prev pointers */
  489. if (chan->next_with_same_id) {
  490. chan->next_with_same_id->prev_with_same_id = chan->prev_with_same_id;
  491. }
  492. if (chan->prev_with_same_id) {
  493. chan->prev_with_same_id->next_with_same_id = chan->next_with_same_id;
  494. }
  495. chan->next_with_same_id = NULL;
  496. chan->prev_with_same_id = NULL;
  497. return;
  498. }
  499. /* Look for it in the map */
  500. tmp = digestmap_get(channel_identity_map, chan->identity_digest);
  501. if (tmp) {
  502. /* Okay, it's here */
  503. head = tmp; /* Keep track of list head */
  504. /* Look for this channel */
  505. while (tmp && tmp != chan) {
  506. tmp = tmp->next_with_same_id;
  507. }
  508. if (tmp == chan) {
  509. /* Found it, good */
  510. if (chan->next_with_same_id) {
  511. chan->next_with_same_id->prev_with_same_id = chan->prev_with_same_id;
  512. }
  513. /* else we're the tail of the list */
  514. if (chan->prev_with_same_id) {
  515. /* We're not the head of the list, so we can *just* unlink */
  516. chan->prev_with_same_id->next_with_same_id = chan->next_with_same_id;
  517. } else {
  518. /* We're the head, so we have to point the digest map entry at our
  519. * next if we have one, or remove it if we're also the tail */
  520. if (chan->next_with_same_id) {
  521. digestmap_set(channel_identity_map,
  522. chan->identity_digest,
  523. chan->next_with_same_id);
  524. } else {
  525. digestmap_remove(channel_identity_map,
  526. chan->identity_digest);
  527. }
  528. }
  529. /* NULL out its next/prev pointers, and we're finished */
  530. chan->next_with_same_id = NULL;
  531. chan->prev_with_same_id = NULL;
  532. log_debug(LD_CHANNEL,
  533. "Removed channel %p (global ID " U64_FORMAT ") from "
  534. "identity map in state %s (%d) with digest %s",
  535. chan, U64_PRINTF_ARG(chan->global_identifier),
  536. channel_state_to_string(chan->state), chan->state,
  537. hex_str(chan->identity_digest, DIGEST_LEN));
  538. } else {
  539. /* This is not good */
  540. log_warn(LD_BUG,
  541. "Trying to remove channel %p (global ID " U64_FORMAT ") "
  542. "with digest %s from identity map, but couldn't find it in "
  543. "the list for that digest",
  544. chan, U64_PRINTF_ARG(chan->global_identifier),
  545. hex_str(chan->identity_digest, DIGEST_LEN));
  546. /* Unlink it and hope for the best */
  547. if (chan->next_with_same_id) {
  548. chan->next_with_same_id->prev_with_same_id = chan->prev_with_same_id;
  549. }
  550. if (chan->prev_with_same_id) {
  551. chan->prev_with_same_id->next_with_same_id = chan->next_with_same_id;
  552. }
  553. chan->next_with_same_id = NULL;
  554. chan->prev_with_same_id = NULL;
  555. }
  556. } else {
  557. /* Shouldn't happen */
  558. log_warn(LD_BUG,
  559. "Trying to remove channel %p (global ID " U64_FORMAT ") with "
  560. "digest %s from identity map, but couldn't find any with "
  561. "that digest",
  562. chan, U64_PRINTF_ARG(chan->global_identifier),
  563. hex_str(chan->identity_digest, DIGEST_LEN));
  564. /* Clear out its next/prev pointers */
  565. if (chan->next_with_same_id) {
  566. chan->next_with_same_id->prev_with_same_id = chan->prev_with_same_id;
  567. }
  568. if (chan->prev_with_same_id) {
  569. chan->prev_with_same_id->next_with_same_id = chan->next_with_same_id;
  570. }
  571. chan->next_with_same_id = NULL;
  572. chan->prev_with_same_id = NULL;
  573. }
  574. }
  575. /****************************
  576. * Channel lookup functions *
  577. ***************************/
  578. /**
  579. * Find channel by global ID
  580. *
  581. * This function searches for a channel by the global_identifier assigned
  582. * at initialization time. This identifier is unique for the lifetime of the
  583. * Tor process.
  584. */
  585. channel_t *
  586. channel_find_by_global_id(uint64_t global_identifier)
  587. {
  588. channel_t *rv = NULL;
  589. if (all_channels && smartlist_len(all_channels) > 0) {
  590. SMARTLIST_FOREACH_BEGIN(all_channels, channel_t *, curr) {
  591. if (curr->global_identifier == global_identifier) {
  592. rv = curr;
  593. break;
  594. }
  595. } SMARTLIST_FOREACH_END(curr);
  596. }
  597. return rv;
  598. }
  599. /**
  600. * Find channel by digest of the remote endpoint
  601. *
  602. * This function looks up a channel by the digest of its remote endpoint in
  603. * the channel digest map. It's possible that more than one channel to a
  604. * given endpoint exists. Use channel_next_with_digest() and
  605. * channel_prev_with_digest() to walk the list.
  606. */
  607. channel_t *
  608. channel_find_by_remote_digest(const char *identity_digest)
  609. {
  610. channel_t *rv = NULL;
  611. tor_assert(identity_digest);
  612. /* Search for it in the identity map */
  613. if (channel_identity_map) {
  614. rv = digestmap_get(channel_identity_map, identity_digest);
  615. }
  616. return rv;
  617. }
  618. /**
  619. * Get next channel with digest
  620. *
  621. * This function takes a channel and finds the next channel in the list
  622. * with the same digest.
  623. */
  624. channel_t *
  625. channel_next_with_digest(channel_t *chan)
  626. {
  627. tor_assert(chan);
  628. return chan->next_with_same_id;
  629. }
  630. /**
  631. * Get previous channel with digest
  632. *
  633. * This function takes a channel and finds the previos channel in the list
  634. * with the same digest.
  635. */
  636. channel_t *
  637. channel_prev_with_digest(channel_t *chan)
  638. {
  639. tor_assert(chan);
  640. return chan->prev_with_same_id;
  641. }
  642. /**
  643. * Initialize a channel
  644. *
  645. * This function should be called by subclasses to set up some per-channel
  646. * variables. I.e., this is the superclass constructor. Before this, the
  647. * channel should be allocated with tor_malloc_zero().
  648. */
  649. void
  650. channel_init(channel_t *chan)
  651. {
  652. tor_assert(chan);
  653. /* Assign an ID and bump the counter */
  654. chan->global_identifier = n_channels_allocated++;
  655. /* Init timestamp */
  656. chan->timestamp_last_added_nonpadding = time(NULL);
  657. /* Init next_circ_id */
  658. chan->next_circ_id = crypto_rand_int(1 << 15);
  659. /* Timestamp it */
  660. channel_timestamp_created(chan);
  661. }
  662. /**
  663. * Initialize a channel listener
  664. *
  665. * This function should be called by subclasses to set up some per-channel
  666. * variables. I.e., this is the superclass constructor. Before this, the
  667. * channel listener should be allocated with tor_malloc_zero().
  668. */
  669. void
  670. channel_init_listener(channel_listener_t *chan_l)
  671. {
  672. tor_assert(chan_l);
  673. /* Assign an ID and bump the counter */
  674. chan_l->global_identifier = n_channels_allocated++;
  675. /* Timestamp it */
  676. channel_listener_timestamp_created(chan_l);
  677. }
  678. /**
  679. * Free a channel; nothing outside of channel.c and subclasses should call
  680. * this - it frees channels after they have closed and been unregistered.
  681. */
  682. void
  683. channel_free(channel_t *chan)
  684. {
  685. if (!chan) return;
  686. /* It must be closed or errored */
  687. tor_assert(chan->state == CHANNEL_STATE_CLOSED ||
  688. chan->state == CHANNEL_STATE_ERROR);
  689. /* It must be deregistered */
  690. tor_assert(!(chan->registered));
  691. /* Call a free method if there is one */
  692. if (chan->free) chan->free(chan);
  693. channel_clear_remote_end(chan);
  694. if (chan->cmux) {
  695. circuitmux_detach_all_circuits(chan->cmux);
  696. circuitmux_free(chan->cmux);
  697. chan->cmux = NULL;
  698. }
  699. /* We're in CLOSED or ERROR, so the cell queue is already empty */
  700. tor_free(chan);
  701. }
  702. /**
  703. * Free a channel listener; nothing outside of channel.c and subclasses
  704. * should call this - it frees channel listeners after they have closed and
  705. * been unregistered.
  706. */
  707. void
  708. channel_listener_free(channel_listener_t *chan_l)
  709. {
  710. if (!chan_l) return;
  711. /* It must be closed or errored */
  712. tor_assert(chan_l->state == CHANNEL_LISTENER_STATE_CLOSED ||
  713. chan_l->state == CHANNEL_LISTENER_STATE_ERROR);
  714. /* It must be deregistered */
  715. tor_assert(!(chan_l->registered));
  716. /* Call a free method if there is one */
  717. if (chan_l->free) chan_l->free(chan_l);
  718. /*
  719. * We're in CLOSED or ERROR, so the incoming channel queue is already
  720. * empty.
  721. */
  722. tor_free(chan_l);
  723. }
  724. /**
  725. * Free a channel and skip the state/registration asserts; this internal-
  726. * use-only function should be called only from channel_free_all() when
  727. * shutting down the Tor process.
  728. */
  729. static void
  730. channel_force_free(channel_t *chan)
  731. {
  732. tor_assert(chan);
  733. /* Call a free method if there is one */
  734. if (chan->free) chan->free(chan);
  735. channel_clear_remote_end(chan);
  736. /* We might still have a cell queue; kill it */
  737. if (chan->incoming_queue) {
  738. SMARTLIST_FOREACH_BEGIN(chan->incoming_queue,
  739. cell_queue_entry_t *, q) {
  740. cell_queue_entry_free(q, 0);
  741. } SMARTLIST_FOREACH_END(q);
  742. smartlist_free(chan->incoming_queue);
  743. chan->incoming_queue = NULL;
  744. }
  745. /* Outgoing cell queue is similar, but we can have to free packed cells */
  746. if (chan->outgoing_queue) {
  747. SMARTLIST_FOREACH_BEGIN(chan->outgoing_queue,
  748. cell_queue_entry_t *, q) {
  749. cell_queue_entry_free(q, 0);
  750. } SMARTLIST_FOREACH_END(q);
  751. smartlist_free(chan->outgoing_queue);
  752. chan->outgoing_queue = NULL;
  753. }
  754. tor_free(chan);
  755. }
  756. /**
  757. * Free a channel listener and skip the state/reigstration asserts; this
  758. * internal-use-only function should be called only from channel_free_all()
  759. * when shutting down the Tor process.
  760. */
  761. static void
  762. channel_listener_force_free(channel_listener_t *chan_l)
  763. {
  764. tor_assert(chan_l);
  765. /* Call a free method if there is one */
  766. if (chan_l->free) chan_l->free(chan_l);
  767. /*
  768. * The incoming list just gets emptied and freed; we request close on
  769. * any channels we find there, but since we got called while shutting
  770. * down they will get deregistered and freed elsewhere anyway.
  771. */
  772. if (chan_l->incoming_list) {
  773. SMARTLIST_FOREACH_BEGIN(chan_l->incoming_list,
  774. channel_t *, qchan) {
  775. channel_mark_for_close(qchan);
  776. } SMARTLIST_FOREACH_END(qchan);
  777. smartlist_free(chan_l->incoming_list);
  778. chan_l->incoming_list = NULL;
  779. }
  780. tor_free(chan_l);
  781. }
  782. /**
  783. * Return the current registered listener for a channel listener
  784. *
  785. * This function returns a function pointer to the current registered
  786. * handler for new incoming channels on a channel listener.
  787. */
  788. channel_listener_fn_ptr
  789. channel_listener_get_listener_fn(channel_listener_t *chan_l)
  790. {
  791. tor_assert(chan_l);
  792. if (chan_l->state == CHANNEL_LISTENER_STATE_LISTENING)
  793. return chan_l->listener;
  794. return NULL;
  795. }
  796. /**
  797. * Set the listener for a channel listener
  798. *
  799. * This function sets the handler for new incoming channels on a channel
  800. * listener.
  801. */
  802. void
  803. channel_listener_set_listener_fn(channel_listener_t *chan_l,
  804. channel_listener_fn_ptr listener)
  805. {
  806. tor_assert(chan_l);
  807. tor_assert(chan_l->state == CHANNEL_LISTENER_STATE_LISTENING);
  808. log_debug(LD_CHANNEL,
  809. "Setting listener callback for channel listener %p "
  810. "(global ID " U64_FORMAT ") to %p",
  811. chan_l, U64_PRINTF_ARG(chan_l->global_identifier),
  812. listener);
  813. chan_l->listener = listener;
  814. if (chan_l->listener) channel_listener_process_incoming(chan_l);
  815. }
  816. /**
  817. * Return the fixed-length cell handler for a channel
  818. *
  819. * This function gets the handler for incoming fixed-length cells installed
  820. * on a channel.
  821. */
  822. channel_cell_handler_fn_ptr
  823. channel_get_cell_handler(channel_t *chan)
  824. {
  825. tor_assert(chan);
  826. if (chan->state == CHANNEL_STATE_OPENING ||
  827. chan->state == CHANNEL_STATE_OPEN ||
  828. chan->state == CHANNEL_STATE_MAINT)
  829. return chan->cell_handler;
  830. return NULL;
  831. }
  832. /**
  833. * Return the variable-length cell handler for a channel
  834. *
  835. * This function gets the handler for incoming variable-length cells
  836. * installed on a channel.
  837. */
  838. channel_var_cell_handler_fn_ptr
  839. channel_get_var_cell_handler(channel_t *chan)
  840. {
  841. tor_assert(chan);
  842. if (chan->state == CHANNEL_STATE_OPENING ||
  843. chan->state == CHANNEL_STATE_OPEN ||
  844. chan->state == CHANNEL_STATE_MAINT)
  845. return chan->var_cell_handler;
  846. return NULL;
  847. }
  848. /**
  849. * Set both cell handlers for a channel
  850. *
  851. * This function sets both the fixed-length and variable length cell handlers
  852. * for a channel and processes any incoming cells that had been blocked in the
  853. * queue because none were available.
  854. */
  855. void
  856. channel_set_cell_handlers(channel_t *chan,
  857. channel_cell_handler_fn_ptr cell_handler,
  858. channel_var_cell_handler_fn_ptr
  859. var_cell_handler)
  860. {
  861. int try_again = 0;
  862. tor_assert(chan);
  863. tor_assert(chan->state == CHANNEL_STATE_OPENING ||
  864. chan->state == CHANNEL_STATE_OPEN ||
  865. chan->state == CHANNEL_STATE_MAINT);
  866. log_debug(LD_CHANNEL,
  867. "Setting cell_handler callback for channel %p to %p",
  868. chan, cell_handler);
  869. log_debug(LD_CHANNEL,
  870. "Setting var_cell_handler callback for channel %p to %p",
  871. chan, var_cell_handler);
  872. /* Should we try the queue? */
  873. if (cell_handler &&
  874. cell_handler != chan->cell_handler) try_again = 1;
  875. if (var_cell_handler &&
  876. var_cell_handler != chan->var_cell_handler) try_again = 1;
  877. /* Change them */
  878. chan->cell_handler = cell_handler;
  879. chan->var_cell_handler = var_cell_handler;
  880. /* Re-run the queue if we have one and there's any reason to */
  881. if (chan->incoming_queue &&
  882. (smartlist_len(chan->incoming_queue) > 0) &&
  883. try_again &&
  884. (chan->cell_handler ||
  885. chan->var_cell_handler)) channel_process_cells(chan);
  886. }
  887. /**
  888. * Mark a channel for closure
  889. *
  890. * This function tries to close a channel_t; it will go into the CLOSING
  891. * state, and eventually the lower layer should put it into the CLOSED or
  892. * ERROR state. Then, channel_run_cleanup() will eventually free it.
  893. */
  894. void
  895. channel_mark_for_close(channel_t *chan)
  896. {
  897. tor_assert(chan != NULL);
  898. tor_assert(chan->close != NULL);
  899. /* If it's already in CLOSING, CLOSED or ERROR, this is a no-op */
  900. if (chan->state == CHANNEL_STATE_CLOSING ||
  901. chan->state == CHANNEL_STATE_CLOSED ||
  902. chan->state == CHANNEL_STATE_ERROR) return;
  903. log_debug(LD_CHANNEL,
  904. "Closing channel %p (global ID " U64_FORMAT ") "
  905. "by request",
  906. chan, U64_PRINTF_ARG(chan->global_identifier));
  907. /* Note closing by request from above */
  908. chan->reason_for_closing = CHANNEL_CLOSE_REQUESTED;
  909. /* Change state to CLOSING */
  910. channel_change_state(chan, CHANNEL_STATE_CLOSING);
  911. /* Tell the lower layer */
  912. chan->close(chan);
  913. /*
  914. * It's up to the lower layer to change state to CLOSED or ERROR when we're
  915. * ready; we'll try to free channels that are in the finished list from
  916. * channel_run_cleanup(). The lower layer should do this by calling
  917. * channel_closed().
  918. */
  919. }
  920. /**
  921. * Mark a channel listener for closure
  922. *
  923. * This function tries to close a channel_listener_t; it will go into the
  924. * CLOSING state, and eventually the lower layer should put it into the CLOSED
  925. * or ERROR state. Then, channel_run_cleanup() will eventually free it.
  926. */
  927. void
  928. channel_listener_mark_for_close(channel_listener_t *chan_l)
  929. {
  930. tor_assert(chan_l != NULL);
  931. tor_assert(chan_l->close != NULL);
  932. /* If it's already in CLOSING, CLOSED or ERROR, this is a no-op */
  933. if (chan_l->state == CHANNEL_LISTENER_STATE_CLOSING ||
  934. chan_l->state == CHANNEL_LISTENER_STATE_CLOSED ||
  935. chan_l->state == CHANNEL_LISTENER_STATE_ERROR) return;
  936. log_debug(LD_CHANNEL,
  937. "Closing channel listener %p (global ID " U64_FORMAT ") "
  938. "by request",
  939. chan_l, U64_PRINTF_ARG(chan_l->global_identifier));
  940. /* Note closing by request from above */
  941. chan_l->reason_for_closing = CHANNEL_LISTENER_CLOSE_REQUESTED;
  942. /* Change state to CLOSING */
  943. channel_listener_change_state(chan_l, CHANNEL_LISTENER_STATE_CLOSING);
  944. /* Tell the lower layer */
  945. chan_l->close(chan_l);
  946. /*
  947. * It's up to the lower layer to change state to CLOSED or ERROR when we're
  948. * ready; we'll try to free channels that are in the finished list from
  949. * channel_run_cleanup(). The lower layer should do this by calling
  950. * channel_listener_closed().
  951. */
  952. }
  953. /**
  954. * Close a channel from the lower layer
  955. *
  956. * Notify the channel code that the channel is being closed due to a non-error
  957. * condition in the lower layer. This does not call the close() method, since
  958. * the lower layer already knows.
  959. */
  960. void
  961. channel_close_from_lower_layer(channel_t *chan)
  962. {
  963. tor_assert(chan != NULL);
  964. /* If it's already in CLOSING, CLOSED or ERROR, this is a no-op */
  965. if (chan->state == CHANNEL_STATE_CLOSING ||
  966. chan->state == CHANNEL_STATE_CLOSED ||
  967. chan->state == CHANNEL_STATE_ERROR) return;
  968. log_debug(LD_CHANNEL,
  969. "Closing channel %p (global ID " U64_FORMAT ") "
  970. "due to lower-layer event",
  971. chan, U64_PRINTF_ARG(chan->global_identifier));
  972. /* Note closing by event from below */
  973. chan->reason_for_closing = CHANNEL_CLOSE_FROM_BELOW;
  974. /* Change state to CLOSING */
  975. channel_change_state(chan, CHANNEL_STATE_CLOSING);
  976. }
  977. /**
  978. * Close a channel listener from the lower layer
  979. *
  980. * Notify the channel code that the channel listener is being closed due to a
  981. * non-error condition in the lower layer. This does not call the close()
  982. * method, since the lower layer already knows.
  983. */
  984. void
  985. channel_listener_close_from_lower_layer(channel_listener_t *chan_l)
  986. {
  987. tor_assert(chan_l != NULL);
  988. /* If it's already in CLOSING, CLOSED or ERROR, this is a no-op */
  989. if (chan_l->state == CHANNEL_LISTENER_STATE_CLOSING ||
  990. chan_l->state == CHANNEL_LISTENER_STATE_CLOSED ||
  991. chan_l->state == CHANNEL_LISTENER_STATE_ERROR) return;
  992. log_debug(LD_CHANNEL,
  993. "Closing channel listener %p (global ID " U64_FORMAT ") "
  994. "due to lower-layer event",
  995. chan_l, U64_PRINTF_ARG(chan_l->global_identifier));
  996. /* Note closing by event from below */
  997. chan_l->reason_for_closing = CHANNEL_LISTENER_CLOSE_FROM_BELOW;
  998. /* Change state to CLOSING */
  999. channel_listener_change_state(chan_l, CHANNEL_LISTENER_STATE_CLOSING);
  1000. }
  1001. /**
  1002. * Notify that the channel is being closed due to an error condition
  1003. *
  1004. * This function is called by the lower layer implementing the transport
  1005. * when a channel must be closed due to an error condition. This does not
  1006. * call the channel's close method, since the lower layer already knows.
  1007. */
  1008. void
  1009. channel_close_for_error(channel_t *chan)
  1010. {
  1011. tor_assert(chan != NULL);
  1012. /* If it's already in CLOSING, CLOSED or ERROR, this is a no-op */
  1013. if (chan->state == CHANNEL_STATE_CLOSING ||
  1014. chan->state == CHANNEL_STATE_CLOSED ||
  1015. chan->state == CHANNEL_STATE_ERROR) return;
  1016. log_debug(LD_CHANNEL,
  1017. "Closing channel %p due to lower-layer error",
  1018. chan);
  1019. /* Note closing by event from below */
  1020. chan->reason_for_closing = CHANNEL_CLOSE_FOR_ERROR;
  1021. /* Change state to CLOSING */
  1022. channel_change_state(chan, CHANNEL_STATE_CLOSING);
  1023. }
  1024. /**
  1025. * Notify that the channel listener is being closed due to an error condition
  1026. *
  1027. * This function is called by the lower layer implementing the transport
  1028. * when a channel listener must be closed due to an error condition. This
  1029. * does not call the channel listener's close method, since the lower layer
  1030. * already knows.
  1031. */
  1032. void
  1033. channel_listener_close_for_error(channel_listener_t *chan_l)
  1034. {
  1035. tor_assert(chan_l != NULL);
  1036. /* If it's already in CLOSING, CLOSED or ERROR, this is a no-op */
  1037. if (chan_l->state == CHANNEL_LISTENER_STATE_CLOSING ||
  1038. chan_l->state == CHANNEL_LISTENER_STATE_CLOSED ||
  1039. chan_l->state == CHANNEL_LISTENER_STATE_ERROR) return;
  1040. log_debug(LD_CHANNEL,
  1041. "Closing channel listener %p (global ID " U64_FORMAT ") "
  1042. "due to lower-layer error",
  1043. chan_l, U64_PRINTF_ARG(chan_l->global_identifier));
  1044. /* Note closing by event from below */
  1045. chan_l->reason_for_closing = CHANNEL_LISTENER_CLOSE_FOR_ERROR;
  1046. /* Change state to CLOSING */
  1047. channel_listener_change_state(chan_l, CHANNEL_LISTENER_STATE_CLOSING);
  1048. }
  1049. /**
  1050. * Notify that the lower layer is finished closing the channel
  1051. *
  1052. * This function should be called by the lower layer when a channel
  1053. * is finished closing and it should be regarded as inactive and
  1054. * freed by the channel code.
  1055. */
  1056. void
  1057. channel_closed(channel_t *chan)
  1058. {
  1059. tor_assert(chan);
  1060. tor_assert(chan->state == CHANNEL_STATE_CLOSING ||
  1061. chan->state == CHANNEL_STATE_CLOSED ||
  1062. chan->state == CHANNEL_STATE_ERROR);
  1063. /* No-op if already inactive */
  1064. if (chan->state == CHANNEL_STATE_CLOSED ||
  1065. chan->state == CHANNEL_STATE_ERROR) return;
  1066. if (chan->reason_for_closing == CHANNEL_CLOSE_FOR_ERROR) {
  1067. /* Inform any pending (not attached) circs that they should
  1068. * give up. */
  1069. circuit_n_chan_done(chan, 0);
  1070. }
  1071. /* Now close all the attached circuits on it. */
  1072. circuit_unlink_all_from_channel(chan, END_CIRC_REASON_CHANNEL_CLOSED);
  1073. if (chan->reason_for_closing != CHANNEL_CLOSE_FOR_ERROR) {
  1074. channel_change_state(chan, CHANNEL_STATE_CLOSED);
  1075. } else {
  1076. channel_change_state(chan, CHANNEL_STATE_ERROR);
  1077. }
  1078. }
  1079. /**
  1080. * Notify that the lower layer is finished closing the channel listener
  1081. *
  1082. * This function should be called by the lower layer when a channel listener
  1083. * is finished closing and it should be regarded as inactive and
  1084. * freed by the channel code.
  1085. */
  1086. void
  1087. channel_listener_closed(channel_listener_t *chan_l)
  1088. {
  1089. tor_assert(chan_l);
  1090. tor_assert(chan_l->state == CHANNEL_LISTENER_STATE_CLOSING ||
  1091. chan_l->state == CHANNEL_LISTENER_STATE_CLOSED ||
  1092. chan_l->state == CHANNEL_LISTENER_STATE_ERROR);
  1093. /* No-op if already inactive */
  1094. if (chan_l->state == CHANNEL_LISTENER_STATE_CLOSED ||
  1095. chan_l->state == CHANNEL_LISTENER_STATE_ERROR) return;
  1096. if (chan_l->reason_for_closing != CHANNEL_LISTENER_CLOSE_FOR_ERROR) {
  1097. channel_listener_change_state(chan_l, CHANNEL_LISTENER_STATE_CLOSED);
  1098. } else {
  1099. channel_listener_change_state(chan_l, CHANNEL_LISTENER_STATE_ERROR);
  1100. }
  1101. }
  1102. /**
  1103. * Clear the identity_digest of a channel
  1104. *
  1105. * This function clears the identity digest of the remote endpoint for a
  1106. * channel; this is intended for use by the lower layer.
  1107. */
  1108. void
  1109. channel_clear_identity_digest(channel_t *chan)
  1110. {
  1111. int state_not_in_map;
  1112. tor_assert(chan);
  1113. log_debug(LD_CHANNEL,
  1114. "Clearing remote endpoint digest on channel %p with "
  1115. "global ID " U64_FORMAT,
  1116. chan, U64_PRINTF_ARG(chan->global_identifier));
  1117. state_not_in_map =
  1118. (chan->state == CHANNEL_STATE_CLOSING ||
  1119. chan->state == CHANNEL_STATE_CLOSED ||
  1120. chan->state == CHANNEL_STATE_ERROR);
  1121. if (!state_not_in_map && chan->registered &&
  1122. !tor_digest_is_zero(chan->identity_digest))
  1123. /* if it's registered get it out of the digest map */
  1124. channel_remove_from_digest_map(chan);
  1125. memset(chan->identity_digest, 0,
  1126. sizeof(chan->identity_digest));
  1127. }
  1128. /**
  1129. * Set the identity_digest of a channel
  1130. *
  1131. * This function sets the identity digest of the remote endpoint for a
  1132. * channel; this is intended for use by the lower layer.
  1133. */
  1134. void
  1135. channel_set_identity_digest(channel_t *chan,
  1136. const char *identity_digest)
  1137. {
  1138. int was_in_digest_map, should_be_in_digest_map, state_not_in_map;
  1139. tor_assert(chan);
  1140. log_debug(LD_CHANNEL,
  1141. "Setting remote endpoint digest on channel %p with "
  1142. "global ID " U64_FORMAT " to digest %s",
  1143. chan, U64_PRINTF_ARG(chan->global_identifier),
  1144. identity_digest ?
  1145. hex_str(identity_digest, DIGEST_LEN) : "(null)");
  1146. state_not_in_map =
  1147. (chan->state == CHANNEL_STATE_CLOSING ||
  1148. chan->state == CHANNEL_STATE_CLOSED ||
  1149. chan->state == CHANNEL_STATE_ERROR);
  1150. was_in_digest_map =
  1151. !state_not_in_map &&
  1152. chan->registered &&
  1153. !tor_digest_is_zero(chan->identity_digest);
  1154. should_be_in_digest_map =
  1155. !state_not_in_map &&
  1156. chan->registered &&
  1157. (identity_digest &&
  1158. !tor_digest_is_zero(identity_digest));
  1159. if (was_in_digest_map)
  1160. /* We should always remove it; we'll add it back if we're writing
  1161. * in a new digest.
  1162. */
  1163. channel_remove_from_digest_map(chan);
  1164. if (identity_digest) {
  1165. memcpy(chan->identity_digest,
  1166. identity_digest,
  1167. sizeof(chan->identity_digest));
  1168. } else {
  1169. memset(chan->identity_digest, 0,
  1170. sizeof(chan->identity_digest));
  1171. }
  1172. /* Put it in the digest map if we should */
  1173. if (should_be_in_digest_map)
  1174. channel_add_to_digest_map(chan);
  1175. }
  1176. /**
  1177. * Clear the remote end metadata (identity_digest/nickname) of a channel
  1178. *
  1179. * This function clears all the remote end info from a channel; this is
  1180. * intended for use by the lower layer.
  1181. */
  1182. void
  1183. channel_clear_remote_end(channel_t *chan)
  1184. {
  1185. int state_not_in_map;
  1186. tor_assert(chan);
  1187. log_debug(LD_CHANNEL,
  1188. "Clearing remote endpoint identity on channel %p with "
  1189. "global ID " U64_FORMAT,
  1190. chan, U64_PRINTF_ARG(chan->global_identifier));
  1191. state_not_in_map =
  1192. (chan->state == CHANNEL_STATE_CLOSING ||
  1193. chan->state == CHANNEL_STATE_CLOSED ||
  1194. chan->state == CHANNEL_STATE_ERROR);
  1195. if (!state_not_in_map && chan->registered &&
  1196. !tor_digest_is_zero(chan->identity_digest))
  1197. /* if it's registered get it out of the digest map */
  1198. channel_remove_from_digest_map(chan);
  1199. memset(chan->identity_digest, 0,
  1200. sizeof(chan->identity_digest));
  1201. tor_free(chan->nickname);
  1202. }
  1203. /**
  1204. * Set the remote end metadata (identity_digest/nickname) of a channel
  1205. *
  1206. * This function sets new remote end info on a channel; this is intended
  1207. * for use by the lower layer.
  1208. */
  1209. void
  1210. channel_set_remote_end(channel_t *chan,
  1211. const char *identity_digest,
  1212. const char *nickname)
  1213. {
  1214. int was_in_digest_map, should_be_in_digest_map, state_not_in_map;
  1215. tor_assert(chan);
  1216. log_debug(LD_CHANNEL,
  1217. "Setting remote endpoint identity on channel %p with "
  1218. "global ID " U64_FORMAT " to nickname %s, digest %s",
  1219. chan, U64_PRINTF_ARG(chan->global_identifier),
  1220. nickname ? nickname : "(null)",
  1221. identity_digest ?
  1222. hex_str(identity_digest, DIGEST_LEN) : "(null)");
  1223. state_not_in_map =
  1224. (chan->state == CHANNEL_STATE_CLOSING ||
  1225. chan->state == CHANNEL_STATE_CLOSED ||
  1226. chan->state == CHANNEL_STATE_ERROR);
  1227. was_in_digest_map =
  1228. !state_not_in_map &&
  1229. chan->registered &&
  1230. !tor_digest_is_zero(chan->identity_digest);
  1231. should_be_in_digest_map =
  1232. !state_not_in_map &&
  1233. chan->registered &&
  1234. (identity_digest &&
  1235. !tor_digest_is_zero(identity_digest));
  1236. if (was_in_digest_map)
  1237. /* We should always remove it; we'll add it back if we're writing
  1238. * in a new digest.
  1239. */
  1240. channel_remove_from_digest_map(chan);
  1241. if (identity_digest) {
  1242. memcpy(chan->identity_digest,
  1243. identity_digest,
  1244. sizeof(chan->identity_digest));
  1245. } else {
  1246. memset(chan->identity_digest, 0,
  1247. sizeof(chan->identity_digest));
  1248. }
  1249. tor_free(chan->nickname);
  1250. if (nickname)
  1251. chan->nickname = tor_strdup(nickname);
  1252. /* Put it in the digest map if we should */
  1253. if (should_be_in_digest_map)
  1254. channel_add_to_digest_map(chan);
  1255. }
  1256. /**
  1257. * Duplicate a cell queue entry; this is a shallow copy intended for use
  1258. * in channel_write_cell_queue_entry().
  1259. */
  1260. static cell_queue_entry_t *
  1261. cell_queue_entry_dup(cell_queue_entry_t *q)
  1262. {
  1263. cell_queue_entry_t *rv = NULL;
  1264. tor_assert(q);
  1265. rv = tor_malloc(sizeof(*rv));
  1266. memcpy(rv, q, sizeof(*rv));
  1267. return rv;
  1268. }
  1269. /**
  1270. * Free a cell_queue_entry_t; the handed_off parameter indicates whether
  1271. * the contents were passed to the lower layer (it is responsible for
  1272. * them) or not (we should free).
  1273. */
  1274. static void
  1275. cell_queue_entry_free(cell_queue_entry_t *q, int handed_off)
  1276. {
  1277. if (!q) return;
  1278. if (!handed_off) {
  1279. /*
  1280. * If we handed it off, the recipient becomes responsible (or
  1281. * with packed cells the channel_t subclass calls packed_cell
  1282. * free after writing out its contents; see, e.g.,
  1283. * channel_tls_write_packed_cell_method(). Otherwise, we have
  1284. * to take care of it here if possible.
  1285. */
  1286. switch (q->type) {
  1287. case CELL_QUEUE_FIXED:
  1288. if (q->u.fixed.cell) {
  1289. /*
  1290. * There doesn't seem to be a cell_free() function anywhere in the
  1291. * pre-channel code; just use tor_free()
  1292. */
  1293. tor_free(q->u.fixed.cell);
  1294. }
  1295. break;
  1296. case CELL_QUEUE_PACKED:
  1297. if (q->u.packed.packed_cell) {
  1298. packed_cell_free(q->u.packed.packed_cell);
  1299. }
  1300. break;
  1301. case CELL_QUEUE_VAR:
  1302. if (q->u.var.var_cell) {
  1303. /*
  1304. * This one's in connection_or.c; it'd be nice to figure out the
  1305. * whole flow of cells from one end to the other and factor the
  1306. * cell memory management functions like this out of the specific
  1307. * TLS lower layer.
  1308. */
  1309. var_cell_free(q->u.var.var_cell);
  1310. }
  1311. break;
  1312. default:
  1313. /*
  1314. * Nothing we can do if we don't know the type; this will
  1315. * have been warned about elsewhere.
  1316. */
  1317. break;
  1318. }
  1319. }
  1320. tor_free(q);
  1321. }
  1322. /**
  1323. * Check whether a cell queue entry is padding; this is a helper function
  1324. * for channel_write_cell_queue_entry()
  1325. */
  1326. static int
  1327. cell_queue_entry_is_padding(cell_queue_entry_t *q)
  1328. {
  1329. tor_assert(q);
  1330. if (q->type == CELL_QUEUE_FIXED) {
  1331. if (q->u.fixed.cell) {
  1332. if (q->u.fixed.cell->command == CELL_PADDING ||
  1333. q->u.fixed.cell->command == CELL_VPADDING) {
  1334. return 1;
  1335. }
  1336. }
  1337. } else if (q->type == CELL_QUEUE_VAR) {
  1338. if (q->u.var.var_cell) {
  1339. if (q->u.var.var_cell->command == CELL_PADDING ||
  1340. q->u.var.var_cell->command == CELL_VPADDING) {
  1341. return 1;
  1342. }
  1343. }
  1344. }
  1345. return 0;
  1346. }
  1347. /**
  1348. * Allocate a new cell queue entry for a fixed-size cell
  1349. */
  1350. static cell_queue_entry_t *
  1351. cell_queue_entry_new_fixed(cell_t *cell)
  1352. {
  1353. cell_queue_entry_t *q = NULL;
  1354. tor_assert(cell);
  1355. q = tor_malloc(sizeof(*q));
  1356. q->type = CELL_QUEUE_FIXED;
  1357. q->u.fixed.cell = cell;
  1358. return q;
  1359. }
  1360. /**
  1361. * Allocate a new cell queue entry for a variable-size cell
  1362. */
  1363. static cell_queue_entry_t *
  1364. cell_queue_entry_new_var(var_cell_t *var_cell)
  1365. {
  1366. cell_queue_entry_t *q = NULL;
  1367. tor_assert(var_cell);
  1368. q = tor_malloc(sizeof(*q));
  1369. q->type = CELL_QUEUE_VAR;
  1370. q->u.var.var_cell = var_cell;
  1371. return q;
  1372. }
  1373. /**
  1374. * Write to a channel based on a cell_queue_entry_t
  1375. *
  1376. * Given a cell_queue_entry_t filled out by the caller, try to send the cell
  1377. * and queue it if we can't.
  1378. */
  1379. static void
  1380. channel_write_cell_queue_entry(channel_t *chan, cell_queue_entry_t *q)
  1381. {
  1382. int result = 0, sent = 0;
  1383. cell_queue_entry_t *tmp = NULL;
  1384. tor_assert(chan);
  1385. tor_assert(q);
  1386. /* Assert that the state makes sense for a cell write */
  1387. tor_assert(chan->state == CHANNEL_STATE_OPENING ||
  1388. chan->state == CHANNEL_STATE_OPEN ||
  1389. chan->state == CHANNEL_STATE_MAINT);
  1390. /* Increment the timestamp unless it's padding */
  1391. if (!cell_queue_entry_is_padding(q)) {
  1392. chan->timestamp_last_added_nonpadding = approx_time();
  1393. }
  1394. /* Can we send it right out? If so, try */
  1395. if (!(chan->outgoing_queue &&
  1396. (smartlist_len(chan->outgoing_queue) > 0)) &&
  1397. chan->state == CHANNEL_STATE_OPEN) {
  1398. /* Pick the right write function for this cell type and save the result */
  1399. switch (q->type) {
  1400. case CELL_QUEUE_FIXED:
  1401. tor_assert(chan->write_cell);
  1402. tor_assert(q->u.fixed.cell);
  1403. result = chan->write_cell(chan, q->u.fixed.cell);
  1404. break;
  1405. case CELL_QUEUE_PACKED:
  1406. tor_assert(chan->write_packed_cell);
  1407. tor_assert(q->u.packed.packed_cell);
  1408. result = chan->write_packed_cell(chan, q->u.packed.packed_cell);
  1409. break;
  1410. case CELL_QUEUE_VAR:
  1411. tor_assert(chan->write_var_cell);
  1412. tor_assert(q->u.var.var_cell);
  1413. result = chan->write_var_cell(chan, q->u.var.var_cell);
  1414. break;
  1415. default:
  1416. tor_assert(1);
  1417. }
  1418. /* Check if we got it out */
  1419. if (result > 0) {
  1420. sent = 1;
  1421. /* Timestamp for transmission */
  1422. channel_timestamp_xmit(chan);
  1423. /* If we're here the queue is empty, so it's drained too */
  1424. channel_timestamp_drained(chan);
  1425. /* Update the counter */
  1426. ++(chan->n_cells_xmitted);
  1427. }
  1428. }
  1429. if (!sent) {
  1430. /* Not sent, queue it */
  1431. if (!(chan->outgoing_queue))
  1432. chan->outgoing_queue = smartlist_new();
  1433. /*
  1434. * We have to copy the queue entry passed in, since the caller probably
  1435. * used the stack.
  1436. */
  1437. tmp = cell_queue_entry_dup(q);
  1438. smartlist_add(chan->outgoing_queue, tmp);
  1439. /* Try to process the queue? */
  1440. if (chan->state == CHANNEL_STATE_OPEN) channel_flush_cells(chan);
  1441. }
  1442. }
  1443. /**
  1444. * Write a cell to a channel
  1445. *
  1446. * Write a fixed-length cell to a channel using the write_cell() method.
  1447. * This is equivalent to the pre-channels connection_or_write_cell_to_buf();
  1448. * it is called by the transport-independent code to deliver a cell to a
  1449. * channel for transmission.
  1450. */
  1451. void
  1452. channel_write_cell(channel_t *chan, cell_t *cell)
  1453. {
  1454. cell_queue_entry_t q;
  1455. tor_assert(chan);
  1456. tor_assert(cell);
  1457. log_debug(LD_CHANNEL,
  1458. "Writing cell_t %p to channel %p with global ID "
  1459. U64_FORMAT,
  1460. cell, chan, U64_PRINTF_ARG(chan->global_identifier));
  1461. q.type = CELL_QUEUE_FIXED;
  1462. q.u.fixed.cell = cell;
  1463. channel_write_cell_queue_entry(chan, &q);
  1464. }
  1465. /**
  1466. * Write a packed cell to a channel
  1467. *
  1468. * Write a packed cell to a channel using the write_cell() method. This is
  1469. * called by the transport-independent code to deliver a packed cell to a
  1470. * channel for transmission.
  1471. */
  1472. void
  1473. channel_write_packed_cell(channel_t *chan, packed_cell_t *packed_cell)
  1474. {
  1475. cell_queue_entry_t q;
  1476. tor_assert(chan);
  1477. tor_assert(packed_cell);
  1478. log_debug(LD_CHANNEL,
  1479. "Writing packed_cell_t %p to channel %p with global ID "
  1480. U64_FORMAT,
  1481. packed_cell, chan,
  1482. U64_PRINTF_ARG(chan->global_identifier));
  1483. q.type = CELL_QUEUE_PACKED;
  1484. q.u.packed.packed_cell = packed_cell;
  1485. channel_write_cell_queue_entry(chan, &q);
  1486. }
  1487. /**
  1488. * Write a variable-length cell to a channel
  1489. *
  1490. * Write a variable-length cell to a channel using the write_cell() method.
  1491. * This is equivalent to the pre-channels
  1492. * connection_or_write_var_cell_to_buf(); it's called by the transport-
  1493. * independent code to deliver a var_cell to a channel for transmission.
  1494. */
  1495. void
  1496. channel_write_var_cell(channel_t *chan, var_cell_t *var_cell)
  1497. {
  1498. cell_queue_entry_t q;
  1499. tor_assert(chan);
  1500. tor_assert(var_cell);
  1501. log_debug(LD_CHANNEL,
  1502. "Writing var_cell_t %p to channel %p with global ID "
  1503. U64_FORMAT,
  1504. var_cell, chan,
  1505. U64_PRINTF_ARG(chan->global_identifier));
  1506. q.type = CELL_QUEUE_VAR;
  1507. q.u.var.var_cell = var_cell;
  1508. channel_write_cell_queue_entry(chan, &q);
  1509. }
  1510. /**
  1511. * Change channel state
  1512. *
  1513. * This internal and subclass use only function is used to change channel
  1514. * state, performing all transition validity checks and whatever actions
  1515. * are appropriate to the state transition in question.
  1516. */
  1517. void
  1518. channel_change_state(channel_t *chan, channel_state_t to_state)
  1519. {
  1520. channel_state_t from_state;
  1521. unsigned char was_active, is_active;
  1522. unsigned char was_in_id_map, is_in_id_map;
  1523. tor_assert(chan);
  1524. from_state = chan->state;
  1525. tor_assert(channel_state_is_valid(from_state));
  1526. tor_assert(channel_state_is_valid(to_state));
  1527. tor_assert(channel_state_can_transition(chan->state, to_state));
  1528. /* Check for no-op transitions */
  1529. if (from_state == to_state) {
  1530. log_debug(LD_CHANNEL,
  1531. "Got no-op transition from \"%s\" to itself on channel %p"
  1532. "(global ID " U64_FORMAT ")",
  1533. channel_state_to_string(to_state),
  1534. chan, U64_PRINTF_ARG(chan->global_identifier));
  1535. return;
  1536. }
  1537. /* If we're going to a closing or closed state, we must have a reason set */
  1538. if (to_state == CHANNEL_STATE_CLOSING ||
  1539. to_state == CHANNEL_STATE_CLOSED ||
  1540. to_state == CHANNEL_STATE_ERROR) {
  1541. tor_assert(chan->reason_for_closing != CHANNEL_NOT_CLOSING);
  1542. }
  1543. /*
  1544. * We need to maintain the queues here for some transitions:
  1545. * when we enter CHANNEL_STATE_OPEN (especially from CHANNEL_STATE_MAINT)
  1546. * we may have a backlog of cells to transmit, so drain the queues in
  1547. * that case, and when going to CHANNEL_STATE_CLOSED the subclass
  1548. * should have made sure to finish sending things (or gone to
  1549. * CHANNEL_STATE_ERROR if not possible), so we assert for that here.
  1550. */
  1551. log_debug(LD_CHANNEL,
  1552. "Changing state of channel %p (global ID " U64_FORMAT
  1553. ") from \"%s\" to \"%s\"",
  1554. chan,
  1555. U64_PRINTF_ARG(chan->global_identifier),
  1556. channel_state_to_string(chan->state),
  1557. channel_state_to_string(to_state));
  1558. chan->state = to_state;
  1559. /* Need to add to the right lists if the channel is registered */
  1560. if (chan->registered) {
  1561. was_active = !(from_state == CHANNEL_STATE_CLOSED ||
  1562. from_state == CHANNEL_STATE_ERROR);
  1563. is_active = !(to_state == CHANNEL_STATE_CLOSED ||
  1564. to_state == CHANNEL_STATE_ERROR);
  1565. /* Need to take off active list and put on finished list? */
  1566. if (was_active && !is_active) {
  1567. if (active_channels) smartlist_remove(active_channels, chan);
  1568. if (!finished_channels) finished_channels = smartlist_new();
  1569. smartlist_add(finished_channels, chan);
  1570. }
  1571. /* Need to put on active list? */
  1572. else if (!was_active && is_active) {
  1573. if (finished_channels) smartlist_remove(finished_channels, chan);
  1574. if (!active_channels) active_channels = smartlist_new();
  1575. smartlist_add(active_channels, chan);
  1576. }
  1577. if (!tor_digest_is_zero(chan->identity_digest)) {
  1578. /* Now we need to handle the identity map */
  1579. was_in_id_map = !(from_state == CHANNEL_STATE_CLOSING ||
  1580. from_state == CHANNEL_STATE_CLOSED ||
  1581. from_state == CHANNEL_STATE_ERROR);
  1582. is_in_id_map = !(to_state == CHANNEL_STATE_CLOSING ||
  1583. to_state == CHANNEL_STATE_CLOSED ||
  1584. to_state == CHANNEL_STATE_ERROR);
  1585. if (!was_in_id_map && is_in_id_map) channel_add_to_digest_map(chan);
  1586. else if (was_in_id_map && !is_in_id_map)
  1587. channel_remove_from_digest_map(chan);
  1588. }
  1589. }
  1590. /* Tell circuits if we opened and stuff */
  1591. if (to_state == CHANNEL_STATE_OPEN) {
  1592. channel_do_open_actions(chan);
  1593. /* Check for queued cells to process */
  1594. if (chan->incoming_queue &&
  1595. smartlist_len(chan->incoming_queue) > 0)
  1596. channel_process_cells(chan);
  1597. if (chan->outgoing_queue &&
  1598. smartlist_len(chan->outgoing_queue) > 0)
  1599. channel_flush_cells(chan);
  1600. } else if (to_state == CHANNEL_STATE_CLOSED ||
  1601. to_state == CHANNEL_STATE_ERROR) {
  1602. /* Assert that all queues are empty */
  1603. tor_assert(!(chan->incoming_queue) ||
  1604. smartlist_len(chan->incoming_queue) == 0);
  1605. tor_assert(!(chan->outgoing_queue) ||
  1606. smartlist_len(chan->outgoing_queue) == 0);
  1607. }
  1608. }
  1609. /**
  1610. * Change channel listener state
  1611. *
  1612. * This internal and subclass use only function is used to change channel
  1613. * listener state, performing all transition validity checks and whatever
  1614. * actions are appropriate to the state transition in question.
  1615. */
  1616. void
  1617. channel_listener_change_state(channel_listener_t *chan_l,
  1618. channel_listener_state_t to_state)
  1619. {
  1620. channel_listener_state_t from_state;
  1621. unsigned char was_active, is_active;
  1622. tor_assert(chan_l);
  1623. from_state = chan_l->state;
  1624. tor_assert(channel_listener_state_is_valid(from_state));
  1625. tor_assert(channel_listener_state_is_valid(to_state));
  1626. tor_assert(channel_listener_state_can_transition(chan_l->state, to_state));
  1627. /* Check for no-op transitions */
  1628. if (from_state == to_state) {
  1629. log_debug(LD_CHANNEL,
  1630. "Got no-op transition from \"%s\" to itself on channel "
  1631. "listener %p (global ID " U64_FORMAT ")",
  1632. channel_listener_state_to_string(to_state),
  1633. chan_l, U64_PRINTF_ARG(chan_l->global_identifier));
  1634. return;
  1635. }
  1636. /* If we're going to a closing or closed state, we must have a reason set */
  1637. if (to_state == CHANNEL_LISTENER_STATE_CLOSING ||
  1638. to_state == CHANNEL_LISTENER_STATE_CLOSED ||
  1639. to_state == CHANNEL_LISTENER_STATE_ERROR) {
  1640. tor_assert(chan_l->reason_for_closing != CHANNEL_LISTENER_NOT_CLOSING);
  1641. }
  1642. /*
  1643. * We need to maintain the queues here for some transitions:
  1644. * when we enter CHANNEL_STATE_OPEN (especially from CHANNEL_STATE_MAINT)
  1645. * we may have a backlog of cells to transmit, so drain the queues in
  1646. * that case, and when going to CHANNEL_STATE_CLOSED the subclass
  1647. * should have made sure to finish sending things (or gone to
  1648. * CHANNEL_STATE_ERROR if not possible), so we assert for that here.
  1649. */
  1650. log_debug(LD_CHANNEL,
  1651. "Changing state of channel listener %p (global ID " U64_FORMAT
  1652. "from \"%s\" to \"%s\"",
  1653. chan_l, U64_PRINTF_ARG(chan_l->global_identifier),
  1654. channel_listener_state_to_string(chan_l->state),
  1655. channel_listener_state_to_string(to_state));
  1656. chan_l->state = to_state;
  1657. /* Need to add to the right lists if the channel listener is registered */
  1658. if (chan_l->registered) {
  1659. was_active = !(from_state == CHANNEL_LISTENER_STATE_CLOSED ||
  1660. from_state == CHANNEL_LISTENER_STATE_ERROR);
  1661. is_active = !(to_state == CHANNEL_LISTENER_STATE_CLOSED ||
  1662. to_state == CHANNEL_LISTENER_STATE_ERROR);
  1663. /* Need to take off active list and put on finished list? */
  1664. if (was_active && !is_active) {
  1665. if (active_listeners) smartlist_remove(active_listeners, chan_l);
  1666. if (!finished_listeners) finished_listeners = smartlist_new();
  1667. smartlist_add(finished_listeners, chan_l);
  1668. }
  1669. /* Need to put on active list? */
  1670. else if (!was_active && is_active) {
  1671. if (finished_listeners) smartlist_remove(finished_listeners, chan_l);
  1672. if (!active_listeners) active_listeners = smartlist_new();
  1673. smartlist_add(active_listeners, chan_l);
  1674. }
  1675. }
  1676. if (to_state == CHANNEL_LISTENER_STATE_CLOSED ||
  1677. to_state == CHANNEL_LISTENER_STATE_ERROR) {
  1678. /* Assert that the queue is empty */
  1679. tor_assert(!(chan_l->incoming_list) ||
  1680. smartlist_len(chan_l->incoming_list) == 0);
  1681. }
  1682. }
  1683. /**
  1684. * Try to flush cells to the lower layer
  1685. *
  1686. * this is called by the lower layer to indicate that it wants more cells;
  1687. * it will try to write up to num_cells cells from the channel's cell queue or
  1688. * from circuits active on that channel, or as many as it has available if
  1689. * num_cells == -1.
  1690. */
  1691. #define MAX_CELLS_TO_GET_FROM_CIRCUITS_FOR_UNLIMITED 256
  1692. ssize_t
  1693. channel_flush_some_cells(channel_t *chan, ssize_t num_cells)
  1694. {
  1695. unsigned int unlimited = 0;
  1696. ssize_t flushed = 0;
  1697. int num_cells_from_circs, clamped_num_cells;
  1698. tor_assert(chan);
  1699. if (num_cells < 0) unlimited = 1;
  1700. if (!unlimited && num_cells <= flushed) goto done;
  1701. /* If we aren't in CHANNEL_STATE_OPEN, nothing goes through */
  1702. if (chan->state == CHANNEL_STATE_OPEN) {
  1703. /* Try to flush as much as we can that's already queued */
  1704. flushed += channel_flush_some_cells_from_outgoing_queue(chan,
  1705. (unlimited ? -1 : num_cells - flushed));
  1706. if (!unlimited && num_cells <= flushed) goto done;
  1707. if (circuitmux_num_cells(chan->cmux) > 0) {
  1708. /* Calculate number of cells, including clamp */
  1709. if (unlimited) {
  1710. clamped_num_cells = MAX_CELLS_TO_GET_FROM_CIRCUITS_FOR_UNLIMITED;
  1711. } else {
  1712. if (num_cells - flushed >
  1713. MAX_CELLS_TO_GET_FROM_CIRCUITS_FOR_UNLIMITED) {
  1714. clamped_num_cells = MAX_CELLS_TO_GET_FROM_CIRCUITS_FOR_UNLIMITED;
  1715. } else {
  1716. clamped_num_cells = (int)(num_cells - flushed);
  1717. }
  1718. }
  1719. /* Try to get more cells from any active circuits */
  1720. num_cells_from_circs = channel_flush_from_first_active_circuit(
  1721. chan, clamped_num_cells);
  1722. /* If it claims we got some, process the queue again */
  1723. if (num_cells_from_circs > 0) {
  1724. flushed += channel_flush_some_cells_from_outgoing_queue(chan,
  1725. (unlimited ? -1 : num_cells - flushed));
  1726. }
  1727. }
  1728. }
  1729. done:
  1730. return flushed;
  1731. }
  1732. /**
  1733. * Flush cells from just the channel's outgoing cell queue
  1734. *
  1735. * This gets called from channel_flush_some_cells() above to flush cells
  1736. * just from the queue without trying for active_circuits.
  1737. */
  1738. static ssize_t
  1739. channel_flush_some_cells_from_outgoing_queue(channel_t *chan,
  1740. ssize_t num_cells)
  1741. {
  1742. unsigned int unlimited = 0;
  1743. ssize_t flushed = 0;
  1744. cell_queue_entry_t *q = NULL;
  1745. tor_assert(chan);
  1746. tor_assert(chan->write_cell);
  1747. tor_assert(chan->write_packed_cell);
  1748. tor_assert(chan->write_var_cell);
  1749. if (num_cells < 0) unlimited = 1;
  1750. if (!unlimited && num_cells <= flushed) return 0;
  1751. /* If we aren't in CHANNEL_STATE_OPEN, nothing goes through */
  1752. if (chan->state == CHANNEL_STATE_OPEN) {
  1753. while ((unlimited || num_cells > flushed) &&
  1754. (chan->outgoing_queue &&
  1755. (smartlist_len(chan->outgoing_queue) > 0))) {
  1756. /*
  1757. * Ewww, smartlist_del_keeporder() is O(n) in list length; maybe a
  1758. * a linked list would make more sense for the queue.
  1759. */
  1760. /* Get the head of the queue */
  1761. q = smartlist_get(chan->outgoing_queue, 0);
  1762. if (q) {
  1763. /*
  1764. * Okay, we have a good queue entry, try to give it to the lower
  1765. * layer.
  1766. */
  1767. switch (q->type) {
  1768. case CELL_QUEUE_FIXED:
  1769. if (q->u.fixed.cell) {
  1770. if (chan->write_cell(chan,
  1771. q->u.fixed.cell)) {
  1772. ++flushed;
  1773. channel_timestamp_xmit(chan);
  1774. ++(chan->n_cells_xmitted);
  1775. cell_queue_entry_free(q, 1);
  1776. q = NULL;
  1777. }
  1778. /* Else couldn't write it; leave it on the queue */
  1779. } else {
  1780. /* This shouldn't happen */
  1781. log_info(LD_CHANNEL,
  1782. "Saw broken cell queue entry of type CELL_QUEUE_FIXED "
  1783. "with no cell on channel %p "
  1784. "(global ID " U64_FORMAT ").",
  1785. chan, U64_PRINTF_ARG(chan->global_identifier));
  1786. /* Throw it away */
  1787. cell_queue_entry_free(q, 0);
  1788. q = NULL;
  1789. }
  1790. break;
  1791. case CELL_QUEUE_PACKED:
  1792. if (q->u.packed.packed_cell) {
  1793. if (chan->write_packed_cell(chan,
  1794. q->u.packed.packed_cell)) {
  1795. ++flushed;
  1796. channel_timestamp_xmit(chan);
  1797. ++(chan->n_cells_xmitted);
  1798. cell_queue_entry_free(q, 1);
  1799. q = NULL;
  1800. }
  1801. /* Else couldn't write it; leave it on the queue */
  1802. } else {
  1803. /* This shouldn't happen */
  1804. log_info(LD_CHANNEL,
  1805. "Saw broken cell queue entry of type CELL_QUEUE_PACKED "
  1806. "with no cell on channel %p "
  1807. "(global ID " U64_FORMAT ").",
  1808. chan, U64_PRINTF_ARG(chan->global_identifier));
  1809. /* Throw it away */
  1810. cell_queue_entry_free(q, 0);
  1811. q = NULL;
  1812. }
  1813. break;
  1814. case CELL_QUEUE_VAR:
  1815. if (q->u.var.var_cell) {
  1816. if (chan->write_var_cell(chan,
  1817. q->u.var.var_cell)) {
  1818. ++flushed;
  1819. channel_timestamp_xmit(chan);
  1820. ++(chan->n_cells_xmitted);
  1821. cell_queue_entry_free(q, 1);
  1822. q = NULL;
  1823. }
  1824. /* Else couldn't write it; leave it on the queue */
  1825. } else {
  1826. /* This shouldn't happen */
  1827. log_info(LD_CHANNEL,
  1828. "Saw broken cell queue entry of type CELL_QUEUE_VAR "
  1829. "with no cell on channel %p "
  1830. "(global ID " U64_FORMAT ").",
  1831. chan, U64_PRINTF_ARG(chan->global_identifier));
  1832. /* Throw it away */
  1833. cell_queue_entry_free(q, 0);
  1834. q = NULL;
  1835. }
  1836. break;
  1837. default:
  1838. /* Unknown type, log and free it */
  1839. log_info(LD_CHANNEL,
  1840. "Saw an unknown cell queue entry type %d on channel %p "
  1841. "(global ID " U64_FORMAT "; ignoring it."
  1842. " Someone should fix this.",
  1843. q->type, chan, U64_PRINTF_ARG(chan->global_identifier));
  1844. cell_queue_entry_free(q, 0);
  1845. q = NULL;
  1846. }
  1847. } else {
  1848. /* This shouldn't happen; log and throw it away */
  1849. log_info(LD_CHANNEL,
  1850. "Saw a NULL entry in the outgoing cell queue on channel %p "
  1851. "(global ID " U64_FORMAT "); this is definitely a bug.",
  1852. chan, U64_PRINTF_ARG(chan->global_identifier));
  1853. /* q is already NULL, so we know to delete that queue entry */
  1854. }
  1855. /* if q got NULLed out, we used it and should remove the queue entry */
  1856. if (!q) smartlist_del_keeporder(chan->outgoing_queue, 0);
  1857. /* No cell removed from list, so we can't go on any further */
  1858. else break;
  1859. }
  1860. }
  1861. /* Did we drain the queue? */
  1862. if (!(chan->outgoing_queue) ||
  1863. smartlist_len(chan->outgoing_queue) == 0) {
  1864. /* Timestamp it */
  1865. channel_timestamp_drained(chan);
  1866. }
  1867. return flushed;
  1868. }
  1869. /**
  1870. * Flush as many cells as we possibly can from the queue
  1871. *
  1872. * This tries to flush as many cells from the queue as the lower layer
  1873. * will take. It just calls channel_flush_some_cells_from_outgoing_queue()
  1874. * in unlimited mode.
  1875. */
  1876. void
  1877. channel_flush_cells(channel_t *chan)
  1878. {
  1879. channel_flush_some_cells_from_outgoing_queue(chan, -1);
  1880. }
  1881. /**
  1882. * Check if any cells are available
  1883. *
  1884. * This gets used from the lower layer to check if any more cells are
  1885. * available.
  1886. */
  1887. int
  1888. channel_more_to_flush(channel_t *chan)
  1889. {
  1890. tor_assert(chan);
  1891. /* Check if we have any queued */
  1892. if (chan->incoming_queue &&
  1893. smartlist_len(chan->incoming_queue) > 0) return 1;
  1894. /* Check if any circuits would like to queue some */
  1895. if (circuitmux_num_cells(chan->cmux) > 0) return 1;
  1896. /* Else no */
  1897. return 0;
  1898. }
  1899. /**
  1900. * Notify the channel we're done flushing the output in the lower layer
  1901. *
  1902. * Connection.c will call this when we've flushed the output; there's some
  1903. * dirreq-related maintenance to do.
  1904. */
  1905. void
  1906. channel_notify_flushed(channel_t *chan)
  1907. {
  1908. tor_assert(chan);
  1909. if (chan->dirreq_id != 0)
  1910. geoip_change_dirreq_state(chan->dirreq_id,
  1911. DIRREQ_TUNNELED,
  1912. DIRREQ_CHANNEL_BUFFER_FLUSHED);
  1913. }
  1914. /**
  1915. * Process the queue of incoming channels on a listener
  1916. *
  1917. * Use a listener's registered callback to process as many entries in the
  1918. * queue of incoming channels as possible.
  1919. */
  1920. void
  1921. channel_listener_process_incoming(channel_listener_t *listener)
  1922. {
  1923. tor_assert(listener);
  1924. /*
  1925. * CHANNEL_LISTENER_STATE_CLOSING permitted because we drain the queue
  1926. * while closing a listener.
  1927. */
  1928. tor_assert(listener->state == CHANNEL_LISTENER_STATE_LISTENING ||
  1929. listener->state == CHANNEL_LISTENER_STATE_CLOSING);
  1930. tor_assert(listener->listener);
  1931. log_debug(LD_CHANNEL,
  1932. "Processing queue of incoming connections for channel "
  1933. "listener %p (global ID " U64_FORMAT ")",
  1934. listener, U64_PRINTF_ARG(listener->global_identifier));
  1935. if (!(listener->incoming_list)) return;
  1936. SMARTLIST_FOREACH_BEGIN(listener->incoming_list,
  1937. channel_t *, chan) {
  1938. tor_assert(chan);
  1939. log_debug(LD_CHANNEL,
  1940. "Handling incoming channel %p (" U64_FORMAT ") "
  1941. "for listener %p (" U64_FORMAT ")",
  1942. chan,
  1943. U64_PRINTF_ARG(chan->global_identifier),
  1944. listener,
  1945. U64_PRINTF_ARG(listener->global_identifier));
  1946. /* Make sure this is set correctly */
  1947. channel_mark_incoming(chan);
  1948. listener->listener(listener, chan);
  1949. } SMARTLIST_FOREACH_END(chan);
  1950. smartlist_free(listener->incoming_list);
  1951. listener->incoming_list = NULL;
  1952. }
  1953. /**
  1954. * Take actions required when a channel becomes open
  1955. *
  1956. * Handle actions we should do when we know a channel is open; a lot of
  1957. * this comes from the old connection_or_set_state_open() of connection_or.c.
  1958. *
  1959. * Because of this mechanism, future channel_t subclasses should take care
  1960. * not to change a channel to from CHANNEL_STATE_OPENING to CHANNEL_STATE_OPEN
  1961. * until there is positive confirmation that the network is operational.
  1962. * In particular, anything UDP-based should not make this transition until a
  1963. * packet is received from the other side.
  1964. */
  1965. void
  1966. channel_do_open_actions(channel_t *chan)
  1967. {
  1968. tor_addr_t remote_addr;
  1969. int started_here, not_using = 0;
  1970. time_t now = time(NULL);
  1971. tor_assert(chan);
  1972. started_here = channel_is_outgoing(chan);
  1973. if (started_here) {
  1974. circuit_build_times_network_is_live(&circ_times);
  1975. rep_hist_note_connect_succeeded(chan->identity_digest, now);
  1976. if (entry_guard_register_connect_status(
  1977. chan->identity_digest, 1, 0, now) < 0) {
  1978. /* Close any circuits pending on this channel. We leave it in state
  1979. * 'open' though, because it didn't actually *fail* -- we just
  1980. * chose not to use it. */
  1981. log_debug(LD_OR,
  1982. "New entry guard was reachable, but closing this "
  1983. "connection so we can retry the earlier entry guards.");
  1984. circuit_n_chan_done(chan, 0);
  1985. not_using = 1;
  1986. }
  1987. router_set_status(chan->identity_digest, 1);
  1988. } else {
  1989. /* only report it to the geoip module if it's not a known router */
  1990. if (!router_get_by_id_digest(chan->identity_digest)) {
  1991. if (channel_get_addr_if_possible(chan, &remote_addr)) {
  1992. geoip_note_client_seen(GEOIP_CLIENT_CONNECT, &remote_addr,
  1993. now);
  1994. }
  1995. /* Otherwise the underlying transport can't tell us this, so skip it */
  1996. }
  1997. }
  1998. if (!not_using) circuit_n_chan_done(chan, 1);
  1999. }
  2000. /**
  2001. * Queue an incoming channel on a listener
  2002. *
  2003. * Internal and subclass use only function to queue an incoming channel from
  2004. * a listener. A subclass of channel_listener_t should call this when a new
  2005. * incoming channel is created.
  2006. */
  2007. void
  2008. channel_listener_queue_incoming(channel_listener_t *listener,
  2009. channel_t *incoming)
  2010. {
  2011. int need_to_queue = 0;
  2012. tor_assert(listener);
  2013. tor_assert(listener->state == CHANNEL_LISTENER_STATE_LISTENING);
  2014. tor_assert(incoming);
  2015. log_debug(LD_CHANNEL,
  2016. "Queueing incoming channel %p (global ID " U64_FORMAT ") on "
  2017. "channel listener %p (global ID " U64_FORMAT ")",
  2018. incoming, U64_PRINTF_ARG(incoming->global_identifier),
  2019. listener, U64_PRINTF_ARG(listener->global_identifier));
  2020. /* Do we need to queue it, or can we just call the listener right away? */
  2021. if (!(listener->listener)) need_to_queue = 1;
  2022. if (listener->incoming_list &&
  2023. (smartlist_len(listener->incoming_list) > 0))
  2024. need_to_queue = 1;
  2025. /* If we need to queue and have no queue, create one */
  2026. if (need_to_queue && !(listener->incoming_list)) {
  2027. listener->incoming_list = smartlist_new();
  2028. }
  2029. /* Bump the counter and timestamp it */
  2030. channel_listener_timestamp_active(listener);
  2031. channel_listener_timestamp_accepted(listener);
  2032. ++(listener->n_accepted);
  2033. /* If we don't need to queue, process it right away */
  2034. if (!need_to_queue) {
  2035. tor_assert(listener->listener);
  2036. listener->listener(listener, incoming);
  2037. }
  2038. /*
  2039. * Otherwise, we need to queue; queue and then process the queue if
  2040. * we can.
  2041. */
  2042. else {
  2043. tor_assert(listener->incoming_list);
  2044. smartlist_add(listener->incoming_list, incoming);
  2045. if (listener->listener) channel_listener_process_incoming(listener);
  2046. }
  2047. }
  2048. /**
  2049. * Process queued incoming cells
  2050. *
  2051. * Process as many queued cells as we can from the incoming
  2052. * cell queue.
  2053. */
  2054. void
  2055. channel_process_cells(channel_t *chan)
  2056. {
  2057. tor_assert(chan);
  2058. tor_assert(chan->state == CHANNEL_STATE_CLOSING ||
  2059. chan->state == CHANNEL_STATE_MAINT ||
  2060. chan->state == CHANNEL_STATE_OPEN);
  2061. log_debug(LD_CHANNEL,
  2062. "Processing as many incoming cells as we can for channel %p",
  2063. chan);
  2064. /* Nothing we can do if we have no registered cell handlers */
  2065. if (!(chan->cell_handler ||
  2066. chan->var_cell_handler)) return;
  2067. /* Nothing we can do if we have no cells */
  2068. if (!(chan->incoming_queue)) return;
  2069. /*
  2070. * Process cells until we're done or find one we have no current handler
  2071. * for.
  2072. */
  2073. SMARTLIST_FOREACH_BEGIN(chan->incoming_queue,
  2074. cell_queue_entry_t *, q) {
  2075. tor_assert(q);
  2076. tor_assert(q->type == CELL_QUEUE_FIXED ||
  2077. q->type == CELL_QUEUE_VAR);
  2078. if (q->type == CELL_QUEUE_FIXED &&
  2079. chan->cell_handler) {
  2080. /* Handle a fixed-length cell */
  2081. tor_assert(q->u.fixed.cell);
  2082. log_debug(LD_CHANNEL,
  2083. "Processing incoming cell_t %p for channel %p (global ID "
  2084. U64_FORMAT ")",
  2085. q->u.fixed.cell, chan,
  2086. U64_PRINTF_ARG(chan->global_identifier));
  2087. chan->cell_handler(chan, q->u.fixed.cell);
  2088. SMARTLIST_DEL_CURRENT(chan->incoming_queue, q);
  2089. tor_free(q);
  2090. } else if (q->type == CELL_QUEUE_VAR &&
  2091. chan->var_cell_handler) {
  2092. /* Handle a variable-length cell */
  2093. tor_assert(q->u.var.var_cell);
  2094. log_debug(LD_CHANNEL,
  2095. "Processing incoming var_cell_t %p for channel %p (global ID "
  2096. U64_FORMAT ")",
  2097. q->u.var.var_cell, chan,
  2098. U64_PRINTF_ARG(chan->global_identifier));
  2099. chan->var_cell_handler(chan, q->u.var.var_cell);
  2100. SMARTLIST_DEL_CURRENT(chan->incoming_queue, q);
  2101. tor_free(q);
  2102. } else {
  2103. /* Can't handle this one */
  2104. break;
  2105. }
  2106. } SMARTLIST_FOREACH_END(q);
  2107. /* If the list is empty, free it */
  2108. if (smartlist_len(chan->incoming_queue) == 0 ) {
  2109. smartlist_free(chan->incoming_queue);
  2110. chan->incoming_queue = NULL;
  2111. }
  2112. }
  2113. /**
  2114. * Queue incoming cell
  2115. *
  2116. * This should be called by a channel_t subclass to queue an incoming fixed-
  2117. * length cell for processing, and process it if possible.
  2118. */
  2119. void
  2120. channel_queue_cell(channel_t *chan, cell_t *cell)
  2121. {
  2122. int need_to_queue = 0;
  2123. cell_queue_entry_t *q;
  2124. tor_assert(chan);
  2125. tor_assert(cell);
  2126. tor_assert(chan->state == CHANNEL_STATE_OPEN);
  2127. /* Do we need to queue it, or can we just call the handler right away? */
  2128. if (!(chan->cell_handler)) need_to_queue = 1;
  2129. if (chan->incoming_queue &&
  2130. (smartlist_len(chan->incoming_queue) > 0))
  2131. need_to_queue = 1;
  2132. /* If we need to queue and have no queue, create one */
  2133. if (need_to_queue && !(chan->incoming_queue)) {
  2134. chan->incoming_queue = smartlist_new();
  2135. }
  2136. /* Timestamp for receiving */
  2137. channel_timestamp_recv(chan);
  2138. /* Update the counter */
  2139. ++(chan->n_cells_recved);
  2140. /* If we don't need to queue we can just call cell_handler */
  2141. if (!need_to_queue) {
  2142. tor_assert(chan->cell_handler);
  2143. log_debug(LD_CHANNEL,
  2144. "Directly handling incoming cell_t %p for channel %p "
  2145. "(global ID " U64_FORMAT ")",
  2146. cell, chan,
  2147. U64_PRINTF_ARG(chan->global_identifier));
  2148. chan->cell_handler(chan, cell);
  2149. } else {
  2150. /* Otherwise queue it and then process the queue if possible. */
  2151. tor_assert(chan->incoming_queue);
  2152. q = cell_queue_entry_new_fixed(cell);
  2153. log_debug(LD_CHANNEL,
  2154. "Queueing incoming cell_t %p for channel %p "
  2155. "(global ID " U64_FORMAT ")",
  2156. cell, chan,
  2157. U64_PRINTF_ARG(chan->global_identifier));
  2158. smartlist_add(chan->incoming_queue, q);
  2159. if (chan->cell_handler ||
  2160. chan->var_cell_handler) {
  2161. channel_process_cells(chan);
  2162. }
  2163. }
  2164. }
  2165. /**
  2166. * Queue incoming variable-length cell
  2167. *
  2168. * This should be called by a channel_t subclass to queue an incoming
  2169. * variable-length cell for processing, and process it if possible.
  2170. */
  2171. void
  2172. channel_queue_var_cell(channel_t *chan, var_cell_t *var_cell)
  2173. {
  2174. int need_to_queue = 0;
  2175. cell_queue_entry_t *q;
  2176. tor_assert(chan);
  2177. tor_assert(var_cell);
  2178. tor_assert(chan->state == CHANNEL_STATE_OPEN);
  2179. /* Do we need to queue it, or can we just call the handler right away? */
  2180. if (!(chan->var_cell_handler)) need_to_queue = 1;
  2181. if (chan->incoming_queue &&
  2182. (smartlist_len(chan->incoming_queue) > 0))
  2183. need_to_queue = 1;
  2184. /* If we need to queue and have no queue, create one */
  2185. if (need_to_queue && !(chan->incoming_queue)) {
  2186. chan->incoming_queue = smartlist_new();
  2187. }
  2188. /* Timestamp for receiving */
  2189. channel_timestamp_recv(chan);
  2190. /* Update the counter */
  2191. ++(chan->n_cells_recved);
  2192. /* If we don't need to queue we can just call cell_handler */
  2193. if (!need_to_queue) {
  2194. tor_assert(chan->var_cell_handler);
  2195. log_debug(LD_CHANNEL,
  2196. "Directly handling incoming var_cell_t %p for channel %p "
  2197. "(global ID " U64_FORMAT ")",
  2198. var_cell, chan,
  2199. U64_PRINTF_ARG(chan->global_identifier));
  2200. chan->var_cell_handler(chan, var_cell);
  2201. } else {
  2202. /* Otherwise queue it and then process the queue if possible. */
  2203. tor_assert(chan->incoming_queue);
  2204. q = cell_queue_entry_new_var(var_cell);
  2205. log_debug(LD_CHANNEL,
  2206. "Queueing incoming var_cell_t %p for channel %p "
  2207. "(global ID " U64_FORMAT ")",
  2208. var_cell, chan,
  2209. U64_PRINTF_ARG(chan->global_identifier));
  2210. smartlist_add(chan->incoming_queue, q);
  2211. if (chan->cell_handler ||
  2212. chan->var_cell_handler) {
  2213. channel_process_cells(chan);
  2214. }
  2215. }
  2216. }
  2217. /**
  2218. * Send destroy cell on a channel
  2219. *
  2220. * Write a destroy cell with circ ID <b>circ_id</b> and reason <b>reason</b>
  2221. * onto channel <b>chan</b>. Don't perform range-checking on reason:
  2222. * we may want to propagate reasons from other cells.
  2223. */
  2224. int
  2225. channel_send_destroy(circid_t circ_id, channel_t *chan, int reason)
  2226. {
  2227. cell_t cell;
  2228. tor_assert(chan);
  2229. memset(&cell, 0, sizeof(cell_t));
  2230. cell.circ_id = circ_id;
  2231. cell.command = CELL_DESTROY;
  2232. cell.payload[0] = (uint8_t) reason;
  2233. log_debug(LD_OR,
  2234. "Sending destroy (circID %d) on channel %p "
  2235. "(global ID " U64_FORMAT ")",
  2236. circ_id, chan,
  2237. U64_PRINTF_ARG(chan->global_identifier));
  2238. channel_write_cell(chan, &cell);
  2239. return 0;
  2240. }
  2241. /**
  2242. * Dump channel statistics to the log
  2243. *
  2244. * This is called from dumpstats() in main.c and spams the log with
  2245. * statistics on channels.
  2246. */
  2247. void
  2248. channel_dumpstats(int severity)
  2249. {
  2250. if (all_channels && smartlist_len(all_channels) > 0) {
  2251. log(severity, LD_GENERAL,
  2252. "Dumping statistics about %d channels:",
  2253. smartlist_len(all_channels));
  2254. log(severity, LD_GENERAL,
  2255. "%d are active, and %d are done and waiting for cleanup",
  2256. (active_channels != NULL) ?
  2257. smartlist_len(active_channels) : 0,
  2258. (finished_channels != NULL) ?
  2259. smartlist_len(finished_channels) : 0);
  2260. SMARTLIST_FOREACH(all_channels, channel_t *, chan,
  2261. channel_dump_statistics(chan, severity));
  2262. log(severity, LD_GENERAL,
  2263. "Done spamming about channels now");
  2264. } else {
  2265. log(severity, LD_GENERAL,
  2266. "No channels to dump");
  2267. }
  2268. }
  2269. /**
  2270. * Dump channel listener statistics to the log
  2271. *
  2272. * This is called from dumpstats() in main.c and spams the log with
  2273. * statistics on channel listeners.
  2274. */
  2275. void
  2276. channel_listener_dumpstats(int severity)
  2277. {
  2278. if (all_listeners && smartlist_len(all_listeners) > 0) {
  2279. log(severity, LD_GENERAL,
  2280. "Dumping statistics about %d channel listeners:",
  2281. smartlist_len(all_listeners));
  2282. log(severity, LD_GENERAL,
  2283. "%d are active and %d are done and waiting for cleanup",
  2284. (active_listeners != NULL) ?
  2285. smartlist_len(active_listeners) : 0,
  2286. (finished_listeners != NULL) ?
  2287. smartlist_len(finished_listeners) : 0);
  2288. SMARTLIST_FOREACH(all_listeners, channel_listener_t *, chan_l,
  2289. channel_listener_dump_statistics(chan_l, severity));
  2290. log(severity, LD_GENERAL,
  2291. "Done spamming about channel listeners now");
  2292. } else {
  2293. log(severity, LD_GENERAL,
  2294. "No channel listeners to dump");
  2295. }
  2296. }
  2297. /**
  2298. * Set the cmux policy on all active channels
  2299. */
  2300. void
  2301. channel_set_cmux_policy_everywhere(circuitmux_policy_t *pol)
  2302. {
  2303. if (!active_channels) return;
  2304. SMARTLIST_FOREACH_BEGIN(active_channels, channel_t *, curr) {
  2305. if (curr->cmux) {
  2306. circuitmux_set_policy(curr->cmux, pol);
  2307. }
  2308. } SMARTLIST_FOREACH_END(curr);
  2309. }
  2310. /**
  2311. * Clean up channels
  2312. *
  2313. * This gets called periodically from run_scheduled_events() in main.c;
  2314. * it cleans up after closed channels.
  2315. */
  2316. void
  2317. channel_run_cleanup(void)
  2318. {
  2319. channel_t *tmp = NULL;
  2320. /* Check if we need to do anything */
  2321. if (!finished_channels || smartlist_len(finished_channels) == 0) return;
  2322. /* Iterate through finished_channels and get rid of them */
  2323. SMARTLIST_FOREACH_BEGIN(finished_channels, channel_t *, curr) {
  2324. tmp = curr;
  2325. /* Remove it from the list */
  2326. SMARTLIST_DEL_CURRENT(finished_channels, curr);
  2327. /* Also unregister it */
  2328. channel_unregister(tmp);
  2329. /* ... and free it */
  2330. channel_free(tmp);
  2331. } SMARTLIST_FOREACH_END(curr);
  2332. }
  2333. /**
  2334. * Clean up channel listeners
  2335. *
  2336. * This gets called periodically from run_scheduled_events() in main.c;
  2337. * it cleans up after closed channel listeners.
  2338. */
  2339. void
  2340. channel_listener_run_cleanup(void)
  2341. {
  2342. channel_listener_t *tmp = NULL;
  2343. /* Check if we need to do anything */
  2344. if (!finished_listeners || smartlist_len(finished_listeners) == 0) return;
  2345. /* Iterate through finished_channels and get rid of them */
  2346. SMARTLIST_FOREACH_BEGIN(finished_listeners, channel_listener_t *, curr) {
  2347. tmp = curr;
  2348. /* Remove it from the list */
  2349. SMARTLIST_DEL_CURRENT(finished_listeners, curr);
  2350. /* Also unregister it */
  2351. channel_listener_unregister(tmp);
  2352. /* ... and free it */
  2353. channel_listener_free(tmp);
  2354. } SMARTLIST_FOREACH_END(curr);
  2355. }
  2356. /**
  2357. * Free a list of channels for channel_free_all()
  2358. */
  2359. static void
  2360. channel_free_list(smartlist_t *channels, int mark_for_close)
  2361. {
  2362. if (!channels) return;
  2363. SMARTLIST_FOREACH_BEGIN(channels, channel_t *, curr) {
  2364. /* Deregister and free it */
  2365. tor_assert(curr);
  2366. log_debug(LD_CHANNEL,
  2367. "Cleaning up channel %p (global ID " U64_FORMAT ") "
  2368. "in state %s (%d)",
  2369. curr, U64_PRINTF_ARG(curr->global_identifier),
  2370. channel_state_to_string(curr->state), curr->state);
  2371. /* Detach circuits early so they can find the channel */
  2372. if (curr->cmux) {
  2373. circuitmux_detach_all_circuits(curr->cmux);
  2374. }
  2375. channel_unregister(curr);
  2376. if (mark_for_close) {
  2377. if (!(curr->state == CHANNEL_STATE_CLOSING ||
  2378. curr->state == CHANNEL_STATE_CLOSED ||
  2379. curr->state == CHANNEL_STATE_ERROR)) {
  2380. channel_mark_for_close(curr);
  2381. }
  2382. channel_force_free(curr);
  2383. } else channel_free(curr);
  2384. } SMARTLIST_FOREACH_END(curr);
  2385. }
  2386. /**
  2387. * Free a list of channel listeners for channel_free_all()
  2388. */
  2389. static void
  2390. channel_listener_free_list(smartlist_t *listeners, int mark_for_close)
  2391. {
  2392. if (!listeners) return;
  2393. SMARTLIST_FOREACH_BEGIN(listeners, channel_listener_t *, curr) {
  2394. /* Deregister and free it */
  2395. tor_assert(curr);
  2396. log_debug(LD_CHANNEL,
  2397. "Cleaning up channel listener %p (global ID " U64_FORMAT ") "
  2398. "in state %s (%d)",
  2399. curr, U64_PRINTF_ARG(curr->global_identifier),
  2400. channel_listener_state_to_string(curr->state), curr->state);
  2401. channel_listener_unregister(curr);
  2402. if (mark_for_close) {
  2403. if (!(curr->state == CHANNEL_LISTENER_STATE_CLOSING ||
  2404. curr->state == CHANNEL_LISTENER_STATE_CLOSED ||
  2405. curr->state == CHANNEL_LISTENER_STATE_ERROR)) {
  2406. channel_listener_mark_for_close(curr);
  2407. }
  2408. channel_listener_force_free(curr);
  2409. } else channel_listener_free(curr);
  2410. } SMARTLIST_FOREACH_END(curr);
  2411. }
  2412. /**
  2413. * Close all channels and free everything
  2414. *
  2415. * This gets called from tor_free_all() in main.c to clean up on exit.
  2416. * It will close all registered channels and free associated storage,
  2417. * then free the all_channels, active_channels, listening_channels and
  2418. * finished_channels lists and also channel_identity_map.
  2419. */
  2420. void
  2421. channel_free_all(void)
  2422. {
  2423. log_debug(LD_CHANNEL,
  2424. "Shutting down channels...");
  2425. /* First, let's go for finished channels */
  2426. if (finished_channels) {
  2427. channel_free_list(finished_channels, 0);
  2428. smartlist_free(finished_channels);
  2429. finished_channels = NULL;
  2430. }
  2431. /* Now the finished listeners */
  2432. if (finished_listeners) {
  2433. channel_listener_free_list(finished_listeners, 0);
  2434. smartlist_free(finished_listeners);
  2435. finished_listeners = NULL;
  2436. }
  2437. /* Now all active channels */
  2438. if (active_channels) {
  2439. channel_free_list(active_channels, 1);
  2440. smartlist_free(active_channels);
  2441. active_channels = NULL;
  2442. }
  2443. /* Now all active listeners */
  2444. if (active_listeners) {
  2445. channel_listener_free_list(active_listeners, 1);
  2446. smartlist_free(active_listeners);
  2447. active_listeners = NULL;
  2448. }
  2449. /* Now all channels, in case any are left over */
  2450. if (all_channels) {
  2451. channel_free_list(all_channels, 1);
  2452. smartlist_free(all_channels);
  2453. all_channels = NULL;
  2454. }
  2455. /* Now all listeners, in case any are left over */
  2456. if (all_listeners) {
  2457. channel_listener_free_list(all_listeners, 1);
  2458. smartlist_free(all_listeners);
  2459. all_listeners = NULL;
  2460. }
  2461. /* Now free channel_identity_map */
  2462. if (channel_identity_map) {
  2463. log_debug(LD_CHANNEL,
  2464. "Freeing channel_identity_map");
  2465. /* Geez, anything still left over just won't die ... let it leak then */
  2466. digestmap_free(channel_identity_map, NULL);
  2467. channel_identity_map = NULL;
  2468. }
  2469. log_debug(LD_CHANNEL,
  2470. "Done cleaning up after channels");
  2471. }
  2472. /**
  2473. * Connect to a given addr/port/digest
  2474. *
  2475. * This sets up a new outgoing channel; in the future if multiple
  2476. * channel_t subclasses are available, this is where the selection policy
  2477. * should go. It may also be desirable to fold port into tor_addr_t
  2478. * or make a new type including a tor_addr_t and port, so we have a
  2479. * single abstract object encapsulating all the protocol details of
  2480. * how to contact an OR.
  2481. */
  2482. channel_t *
  2483. channel_connect(const tor_addr_t *addr, uint16_t port,
  2484. const char *id_digest)
  2485. {
  2486. return channel_tls_connect(addr, port, id_digest);
  2487. }
  2488. /**
  2489. * Decide which of two channels to prefer for extending a circuit
  2490. *
  2491. * This function is called while extending a circuit and returns true iff
  2492. * a is 'better' than b. The most important criterion here is that a
  2493. * canonical channel is always better than a non-canonical one, but the
  2494. * number of circuits and the age are used as tie-breakers.
  2495. *
  2496. * This is based on the former connection_or_is_better() of connection_or.c
  2497. */
  2498. int
  2499. channel_is_better(time_t now, channel_t *a, channel_t *b,
  2500. int forgive_new_connections)
  2501. {
  2502. int a_grace, b_grace;
  2503. int a_is_canonical, b_is_canonical;
  2504. int a_has_circs, b_has_circs;
  2505. /*
  2506. * Do not definitively deprecate a new channel with no circuits on it
  2507. * until this much time has passed.
  2508. */
  2509. #define NEW_CHAN_GRACE_PERIOD (15*60)
  2510. tor_assert(a);
  2511. tor_assert(b);
  2512. /* Check if one is canonical and the other isn't first */
  2513. a_is_canonical = channel_is_canonical(a);
  2514. b_is_canonical = channel_is_canonical(b);
  2515. if (a_is_canonical && !b_is_canonical) return 1;
  2516. if (!a_is_canonical && b_is_canonical) return 0;
  2517. /*
  2518. * Okay, if we're here they tied on canonicity. Next we check if
  2519. * they have any circuits, and if one does and the other doesn't,
  2520. * we prefer the one that does, unless we are forgiving and the
  2521. * one that has no circuits is in its grace period.
  2522. */
  2523. a_has_circs = (channel_num_circuits(a) > 0);
  2524. b_has_circs = (channel_num_circuits(b) > 0);
  2525. a_grace = (forgive_new_connections &&
  2526. (now < channel_when_created(a) + NEW_CHAN_GRACE_PERIOD));
  2527. b_grace = (forgive_new_connections &&
  2528. (now < channel_when_created(b) + NEW_CHAN_GRACE_PERIOD));
  2529. if (a_has_circs && !b_has_circs && !b_grace) return 1;
  2530. if (!a_has_circs && b_has_circs && !a_grace) return 0;
  2531. /* They tied on circuits too; just prefer whichever is newer */
  2532. if (channel_when_created(a) > channel_when_created(b)) return 1;
  2533. else return 0;
  2534. }
  2535. /**
  2536. * Get a channel to extend a circuit
  2537. *
  2538. * Pick a suitable channel to extend a circuit to given the desired digest
  2539. * the address we believe is correct for that digest; this tries to see
  2540. * if we already have one for the requested endpoint, but if there is no good
  2541. * channel, set *msg_out to a message describing the channel's state
  2542. * and our next action, and set *launch_out to a boolean indicated whether
  2543. * the caller should try to launch a new channel with channel_connect().
  2544. */
  2545. channel_t *
  2546. channel_get_for_extend(const char *digest,
  2547. const tor_addr_t *target_addr,
  2548. const char **msg_out,
  2549. int *launch_out)
  2550. {
  2551. channel_t *chan, *best = NULL;
  2552. int n_inprogress_goodaddr = 0, n_old = 0;
  2553. int n_noncanonical = 0, n_possible = 0;
  2554. time_t now = approx_time();
  2555. tor_assert(msg_out);
  2556. tor_assert(launch_out);
  2557. if (!channel_identity_map) {
  2558. *msg_out = "Router not connected (nothing is). Connecting.";
  2559. *launch_out = 1;
  2560. return NULL;
  2561. }
  2562. chan = channel_find_by_remote_digest(digest);
  2563. /* Walk the list, unrefing the old one and refing the new at each
  2564. * iteration.
  2565. */
  2566. for (; chan; chan = channel_next_with_digest(chan)) {
  2567. tor_assert(tor_memeq(chan->identity_digest,
  2568. digest, DIGEST_LEN));
  2569. if (chan->state == CHANNEL_STATE_CLOSING ||
  2570. chan->state == CHANNEL_STATE_CLOSED ||
  2571. chan->state == CHANNEL_STATE_ERROR)
  2572. continue;
  2573. /* Never return a channel on which the other end appears to be
  2574. * a client. */
  2575. if (channel_is_client(chan)) {
  2576. continue;
  2577. }
  2578. /* Never return a non-open connection. */
  2579. if (chan->state != CHANNEL_STATE_OPEN) {
  2580. /* If the address matches, don't launch a new connection for this
  2581. * circuit. */
  2582. if (!channel_matches_target_addr_for_extend(chan, target_addr))
  2583. ++n_inprogress_goodaddr;
  2584. continue;
  2585. }
  2586. /* Never return a connection that shouldn't be used for circs. */
  2587. if (channel_is_bad_for_new_circs(chan)) {
  2588. ++n_old;
  2589. continue;
  2590. }
  2591. /* Never return a non-canonical connection using a recent link protocol
  2592. * if the address is not what we wanted.
  2593. *
  2594. * The channel_is_canonical_is_reliable() function asks the lower layer
  2595. * if we should trust channel_is_canonical(). The below is from the
  2596. * comments of the old circuit_or_get_for_extend() and applies when
  2597. * the lower-layer transport is channel_tls_t.
  2598. *
  2599. * (For old link protocols, we can't rely on is_canonical getting
  2600. * set properly if we're talking to the right address, since we might
  2601. * have an out-of-date descriptor, and we will get no NETINFO cell to
  2602. * tell us about the right address.)
  2603. */
  2604. if (!channel_is_canonical(chan) &&
  2605. channel_is_canonical_is_reliable(chan) &&
  2606. !channel_matches_target_addr_for_extend(chan, target_addr)) {
  2607. ++n_noncanonical;
  2608. continue;
  2609. }
  2610. ++n_possible;
  2611. if (!best) {
  2612. best = chan; /* If we have no 'best' so far, this one is good enough. */
  2613. continue;
  2614. }
  2615. if (channel_is_better(now, chan, best, 0))
  2616. best = chan;
  2617. }
  2618. if (best) {
  2619. *msg_out = "Connection is fine; using it.";
  2620. *launch_out = 0;
  2621. return best;
  2622. } else if (n_inprogress_goodaddr) {
  2623. *msg_out = "Connection in progress; waiting.";
  2624. *launch_out = 0;
  2625. return NULL;
  2626. } else if (n_old || n_noncanonical) {
  2627. *msg_out = "Connections all too old, or too non-canonical. "
  2628. " Launching a new one.";
  2629. *launch_out = 1;
  2630. return NULL;
  2631. } else {
  2632. *msg_out = "Not connected. Connecting.";
  2633. *launch_out = 1;
  2634. return NULL;
  2635. }
  2636. }
  2637. /**
  2638. * Describe the transport subclass for a channel
  2639. *
  2640. * Invoke a method to get a string description of the lower-layer
  2641. * transport for this channel.
  2642. */
  2643. const char *
  2644. channel_describe_transport(channel_t *chan)
  2645. {
  2646. tor_assert(chan);
  2647. tor_assert(chan->describe_transport);
  2648. return chan->describe_transport(chan);
  2649. }
  2650. /**
  2651. * Describe the transport subclass for a channel listener
  2652. *
  2653. * Invoke a method to get a string description of the lower-layer
  2654. * transport for this channel listener.
  2655. */
  2656. const char *
  2657. channel_listener_describe_transport(channel_listener_t *chan_l)
  2658. {
  2659. tor_assert(chan_l);
  2660. tor_assert(chan_l->describe_transport);
  2661. return chan_l->describe_transport(chan_l);
  2662. }
  2663. /**
  2664. * Dump channel statistics
  2665. *
  2666. * Dump statistics for one channel to the log
  2667. */
  2668. void
  2669. channel_dump_statistics(channel_t *chan, int severity)
  2670. {
  2671. double avg, interval, age;
  2672. time_t now = time(NULL);
  2673. tor_addr_t remote_addr;
  2674. int have_remote_addr;
  2675. char *remote_addr_str;
  2676. tor_assert(chan);
  2677. age = (double)(now - chan->timestamp_created);
  2678. log(severity, LD_GENERAL,
  2679. "Channel " U64_FORMAT " (at %p) with transport %s is in state "
  2680. "%s (%d)",
  2681. U64_PRINTF_ARG(chan->global_identifier), chan,
  2682. channel_describe_transport(chan),
  2683. channel_state_to_string(chan->state), chan->state);
  2684. log(severity, LD_GENERAL,
  2685. " * Channel " U64_FORMAT " was created at " U64_FORMAT
  2686. " (" U64_FORMAT " seconds ago) "
  2687. "and last active at " U64_FORMAT " (" U64_FORMAT " seconds ago)",
  2688. U64_PRINTF_ARG(chan->global_identifier),
  2689. U64_PRINTF_ARG(chan->timestamp_created),
  2690. U64_PRINTF_ARG(now - chan->timestamp_created),
  2691. U64_PRINTF_ARG(chan->timestamp_active),
  2692. U64_PRINTF_ARG(now - chan->timestamp_active));
  2693. /* Handle digest and nickname */
  2694. if (!tor_digest_is_zero(chan->identity_digest)) {
  2695. if (chan->nickname) {
  2696. log(severity, LD_GENERAL,
  2697. " * Channel " U64_FORMAT " says it is connected "
  2698. "to an OR with digest %s and nickname %s",
  2699. U64_PRINTF_ARG(chan->global_identifier),
  2700. hex_str(chan->identity_digest, DIGEST_LEN),
  2701. chan->nickname);
  2702. } else {
  2703. log(severity, LD_GENERAL,
  2704. " * Channel " U64_FORMAT " says it is connected "
  2705. "to an OR with digest %s and no known nickname",
  2706. U64_PRINTF_ARG(chan->global_identifier),
  2707. hex_str(chan->identity_digest, DIGEST_LEN));
  2708. }
  2709. } else {
  2710. if (chan->nickname) {
  2711. log(severity, LD_GENERAL,
  2712. " * Channel " U64_FORMAT " does not know the digest"
  2713. " of the OR it is connected to, but reports its nickname is %s",
  2714. U64_PRINTF_ARG(chan->global_identifier),
  2715. chan->nickname);
  2716. } else {
  2717. log(severity, LD_GENERAL,
  2718. " * Channel " U64_FORMAT " does not know the digest"
  2719. " or the nickname of the OR it is connected to",
  2720. U64_PRINTF_ARG(chan->global_identifier));
  2721. }
  2722. }
  2723. /* Handle remote address and descriptions */
  2724. have_remote_addr = channel_get_addr_if_possible(chan, &remote_addr);
  2725. if (have_remote_addr) {
  2726. remote_addr_str = tor_dup_addr(&remote_addr);
  2727. log(severity, LD_GENERAL,
  2728. " * Channel " U64_FORMAT " says its remote address"
  2729. " is %s, and gives a canonical description of \"%s\" and an "
  2730. "actual description of \"%s\"",
  2731. U64_PRINTF_ARG(chan->global_identifier),
  2732. remote_addr_str,
  2733. channel_get_canonical_remote_descr(chan),
  2734. channel_get_actual_remote_descr(chan));
  2735. tor_free(remote_addr_str);
  2736. } else {
  2737. log(severity, LD_GENERAL,
  2738. " * Channel " U64_FORMAT " does not know its remote "
  2739. "address, but gives a canonical description of \"%s\" and an "
  2740. "actual description of \"%s\"",
  2741. U64_PRINTF_ARG(chan->global_identifier),
  2742. channel_get_canonical_remote_descr(chan),
  2743. channel_get_actual_remote_descr(chan));
  2744. }
  2745. /* Handle marks */
  2746. log(severity, LD_GENERAL,
  2747. " * Channel " U64_FORMAT " has these marks: %s %s %s "
  2748. "%s %s %s",
  2749. U64_PRINTF_ARG(chan->global_identifier),
  2750. channel_is_bad_for_new_circs(chan) ?
  2751. "bad_for_new_circs" : "!bad_for_new_circs",
  2752. channel_is_canonical(chan) ?
  2753. "canonical" : "!canonical",
  2754. channel_is_canonical_is_reliable(chan) ?
  2755. "is_canonical_is_reliable" :
  2756. "!is_canonical_is_reliable",
  2757. channel_is_client(chan) ?
  2758. "client" : "!client",
  2759. channel_is_local(chan) ?
  2760. "local" : "!local",
  2761. channel_is_incoming(chan) ?
  2762. "incoming" : "outgoing");
  2763. /* Describe queues */
  2764. log(severity, LD_GENERAL,
  2765. " * Channel " U64_FORMAT " has %d queued incoming cells"
  2766. " and %d queued outgoing cells",
  2767. U64_PRINTF_ARG(chan->global_identifier),
  2768. (chan->incoming_queue != NULL) ?
  2769. smartlist_len(chan->incoming_queue) : 0,
  2770. (chan->outgoing_queue != NULL) ?
  2771. smartlist_len(chan->outgoing_queue) : 0);
  2772. /* Describe circuits */
  2773. log(severity, LD_GENERAL,
  2774. " * Channel " U64_FORMAT " has %d active circuits out of"
  2775. " %d in total",
  2776. U64_PRINTF_ARG(chan->global_identifier),
  2777. (chan->cmux != NULL) ?
  2778. circuitmux_num_active_circuits(chan->cmux) : 0,
  2779. (chan->cmux != NULL) ?
  2780. circuitmux_num_circuits(chan->cmux) : 0);
  2781. /* Describe timestamps */
  2782. log(severity, LD_GENERAL,
  2783. " * Channel " U64_FORMAT " was last used by a "
  2784. "client at " U64_FORMAT " (" U64_FORMAT " seconds ago)",
  2785. U64_PRINTF_ARG(chan->global_identifier),
  2786. U64_PRINTF_ARG(chan->timestamp_client),
  2787. U64_PRINTF_ARG(now - chan->timestamp_client));
  2788. log(severity, LD_GENERAL,
  2789. " * Channel " U64_FORMAT " was last drained at "
  2790. U64_FORMAT " (" U64_FORMAT " seconds ago)",
  2791. U64_PRINTF_ARG(chan->global_identifier),
  2792. U64_PRINTF_ARG(chan->timestamp_drained),
  2793. U64_PRINTF_ARG(now - chan->timestamp_drained));
  2794. log(severity, LD_GENERAL,
  2795. " * Channel " U64_FORMAT " last received a cell "
  2796. "at " U64_FORMAT " (" U64_FORMAT " seconds ago)",
  2797. U64_PRINTF_ARG(chan->global_identifier),
  2798. U64_PRINTF_ARG(chan->timestamp_recv),
  2799. U64_PRINTF_ARG(now - chan->timestamp_recv));
  2800. log(severity, LD_GENERAL,
  2801. " * Channel " U64_FORMAT " last trasmitted a cell "
  2802. "at " U64_FORMAT " (" U64_FORMAT " seconds ago)",
  2803. U64_PRINTF_ARG(chan->global_identifier),
  2804. U64_PRINTF_ARG(chan->timestamp_xmit),
  2805. U64_PRINTF_ARG(now - chan->timestamp_xmit));
  2806. /* Describe counters and rates */
  2807. log(severity, LD_GENERAL,
  2808. " * Channel " U64_FORMAT " has received "
  2809. U64_FORMAT " cells and transmitted " U64_FORMAT,
  2810. U64_PRINTF_ARG(chan->global_identifier),
  2811. U64_PRINTF_ARG(chan->n_cells_recved),
  2812. U64_PRINTF_ARG(chan->n_cells_xmitted));
  2813. if (now > chan->timestamp_created &&
  2814. chan->timestamp_created > 0) {
  2815. if (chan->n_cells_recved > 0) {
  2816. avg = (double)(chan->n_cells_recved) / age;
  2817. if (avg >= 1.0) {
  2818. log(severity, LD_GENERAL,
  2819. " * Channel " U64_FORMAT " has averaged %f "
  2820. "cells received per second",
  2821. U64_PRINTF_ARG(chan->global_identifier), avg);
  2822. } else if (avg >= 0.0) {
  2823. interval = 1.0 / avg;
  2824. log(severity, LD_GENERAL,
  2825. " * Channel " U64_FORMAT " has averaged %f "
  2826. "seconds between received cells",
  2827. U64_PRINTF_ARG(chan->global_identifier), interval);
  2828. }
  2829. }
  2830. if (chan->n_cells_xmitted > 0) {
  2831. avg = (double)(chan->n_cells_xmitted) / age;
  2832. if (avg >= 1.0) {
  2833. log(severity, LD_GENERAL,
  2834. " * Channel " U64_FORMAT " has averaged %f "
  2835. "cells transmitted per second",
  2836. U64_PRINTF_ARG(chan->global_identifier), avg);
  2837. } else if (avg >= 0.0) {
  2838. interval = 1.0 / avg;
  2839. log(severity, LD_GENERAL,
  2840. " * Channel " U64_FORMAT " has averaged %f "
  2841. "seconds between transmitted cells",
  2842. U64_PRINTF_ARG(chan->global_identifier), interval);
  2843. }
  2844. }
  2845. }
  2846. /* Dump anything the lower layer has to say */
  2847. channel_dump_transport_statistics(chan, severity);
  2848. }
  2849. /**
  2850. * Dump channel listener statistics
  2851. *
  2852. * Dump statistics for one channel listener to the log
  2853. */
  2854. void
  2855. channel_listener_dump_statistics(channel_listener_t *chan_l, int severity)
  2856. {
  2857. double avg, interval, age;
  2858. time_t now = time(NULL);
  2859. tor_assert(chan_l);
  2860. age = (double)(now - chan_l->timestamp_created);
  2861. log(severity, LD_GENERAL,
  2862. "Channel listener " U64_FORMAT " (at %p) with transport %s is in "
  2863. "state %s (%d)",
  2864. U64_PRINTF_ARG(chan_l->global_identifier), chan_l,
  2865. channel_listener_describe_transport(chan_l),
  2866. channel_listener_state_to_string(chan_l->state), chan_l->state);
  2867. log(severity, LD_GENERAL,
  2868. " * Channel listener " U64_FORMAT " was created at " U64_FORMAT
  2869. " (" U64_FORMAT " seconds ago) "
  2870. "and last active at " U64_FORMAT " (" U64_FORMAT " seconds ago)",
  2871. U64_PRINTF_ARG(chan_l->global_identifier),
  2872. U64_PRINTF_ARG(chan_l->timestamp_created),
  2873. U64_PRINTF_ARG(now - chan_l->timestamp_created),
  2874. U64_PRINTF_ARG(chan_l->timestamp_active),
  2875. U64_PRINTF_ARG(now - chan_l->timestamp_active));
  2876. log(severity, LD_GENERAL,
  2877. " * Channel listener " U64_FORMAT " last accepted an incoming "
  2878. "channel at " U64_FORMAT " (" U64_FORMAT " seconds ago) "
  2879. "and has accepted " U64_FORMAT " channels in total",
  2880. U64_PRINTF_ARG(chan_l->global_identifier),
  2881. U64_PRINTF_ARG(chan_l->timestamp_accepted),
  2882. U64_PRINTF_ARG(now - chan_l->timestamp_accepted),
  2883. U64_PRINTF_ARG(chan_l->n_accepted));
  2884. /*
  2885. * If it's sensible to do so, get the rate of incoming channels on this
  2886. * listener
  2887. */
  2888. if (now > chan_l->timestamp_created &&
  2889. chan_l->timestamp_created > 0 &&
  2890. chan_l->n_accepted > 0) {
  2891. avg = (double)(chan_l->n_accepted) / age;
  2892. if (avg >= 1.0) {
  2893. log(severity, LD_GENERAL,
  2894. " * Channel listener " U64_FORMAT " has averaged %f incoming "
  2895. "channels per second",
  2896. U64_PRINTF_ARG(chan_l->global_identifier), avg);
  2897. } else if (avg >= 0.0) {
  2898. interval = 1.0 / avg;
  2899. log(severity, LD_GENERAL,
  2900. " * Channel listener " U64_FORMAT " has averaged %f seconds "
  2901. "between incoming channels",
  2902. U64_PRINTF_ARG(chan_l->global_identifier), interval);
  2903. }
  2904. }
  2905. /* Dump anything the lower layer has to say */
  2906. channel_listener_dump_transport_statistics(chan_l, severity);
  2907. }
  2908. /**
  2909. * Invoke transport-specific stats dump for channel
  2910. *
  2911. * If there is a lower-layer statistics dump method, invoke it
  2912. */
  2913. void
  2914. channel_dump_transport_statistics(channel_t *chan, int severity)
  2915. {
  2916. tor_assert(chan);
  2917. if (chan->dumpstats) chan->dumpstats(chan, severity);
  2918. }
  2919. /**
  2920. * Invoke transport-specific stats dump for channel listener
  2921. *
  2922. * If there is a lower-layer statistics dump method, invoke it
  2923. */
  2924. void
  2925. channel_listener_dump_transport_statistics(channel_listener_t *chan_l,
  2926. int severity)
  2927. {
  2928. tor_assert(chan_l);
  2929. if (chan_l->dumpstats) chan_l->dumpstats(chan_l, severity);
  2930. }
  2931. /**
  2932. * Return text description of the remote endpoint
  2933. *
  2934. * This function return a test provided by the lower layer of the remote
  2935. * endpoint for this channel; it should specify the actual address connected
  2936. * to/from.
  2937. */
  2938. const char *
  2939. channel_get_actual_remote_descr(channel_t *chan)
  2940. {
  2941. tor_assert(chan);
  2942. tor_assert(chan->get_remote_descr);
  2943. /* Param 1 indicates the actual description */
  2944. return chan->get_remote_descr(chan, 1);
  2945. }
  2946. /**
  2947. * Return text description of the remote endpoint canonical address
  2948. *
  2949. * This function return a test provided by the lower layer of the remote
  2950. * endpoint for this channel; it should use the known canonical address for
  2951. * this OR's identity digest if possible.
  2952. */
  2953. const char *
  2954. channel_get_canonical_remote_descr(channel_t *chan)
  2955. {
  2956. tor_assert(chan);
  2957. tor_assert(chan->get_remote_descr);
  2958. /* Param 0 indicates the canonicalized description */
  2959. return chan->get_remote_descr(chan, 0);
  2960. }
  2961. /**
  2962. * Get remote address if possible
  2963. *
  2964. * Write the remote address out to a tor_addr_t if the underlying transport
  2965. * supports this operation.
  2966. */
  2967. int
  2968. channel_get_addr_if_possible(channel_t *chan, tor_addr_t *addr_out)
  2969. {
  2970. tor_assert(chan);
  2971. tor_assert(addr_out);
  2972. if (chan->get_remote_addr)
  2973. return chan->get_remote_addr(chan, addr_out);
  2974. /* Else no support, method not implemented */
  2975. else return 0;
  2976. }
  2977. /**
  2978. * Check if there are outgoing queue writes on this channel
  2979. *
  2980. * Indicate if either we have queued cells, or if not, whether the underlying
  2981. * lower-layer transport thinks it has an output queue.
  2982. */
  2983. int
  2984. channel_has_queued_writes(channel_t *chan)
  2985. {
  2986. int has_writes = 0;
  2987. tor_assert(chan);
  2988. tor_assert(chan->has_queued_writes);
  2989. if (chan->outgoing_queue &&
  2990. smartlist_len(chan->outgoing_queue) > 0) {
  2991. has_writes = 1;
  2992. } else {
  2993. /* Check with the lower layer */
  2994. has_writes = chan->has_queued_writes(chan);
  2995. }
  2996. return has_writes;
  2997. }
  2998. /**
  2999. * Check the is_bad_for_new_circs flag
  3000. *
  3001. * This function returns the is_bad_for_new_circs flag of the specified
  3002. * channel.
  3003. */
  3004. int
  3005. channel_is_bad_for_new_circs(channel_t *chan)
  3006. {
  3007. tor_assert(chan);
  3008. return chan->is_bad_for_new_circs;
  3009. }
  3010. /**
  3011. * Mark a channel as bad for new circuits
  3012. *
  3013. * Set the is_bad_for_new_circs_flag on chan.
  3014. */
  3015. void
  3016. channel_mark_bad_for_new_circs(channel_t *chan)
  3017. {
  3018. tor_assert(chan);
  3019. chan->is_bad_for_new_circs = 1;
  3020. }
  3021. /**
  3022. * Get the client flag
  3023. *
  3024. * This returns the client flag of a channel, which will be set if
  3025. * command_process_create_cell() in command.c thinks this is a connection
  3026. * from a client.
  3027. */
  3028. int
  3029. channel_is_client(channel_t *chan)
  3030. {
  3031. tor_assert(chan);
  3032. return chan->is_client;
  3033. }
  3034. /**
  3035. * Set the client flag
  3036. *
  3037. * Mark a channel as being from a client
  3038. */
  3039. void
  3040. channel_mark_client(channel_t *chan)
  3041. {
  3042. tor_assert(chan);
  3043. chan->is_client = 1;
  3044. }
  3045. /**
  3046. * Get the canonical flag for a channel
  3047. *
  3048. * This returns the is_canonical for a channel; this flag is determined by
  3049. * the lower layer and can't be set in a transport-independent way.
  3050. */
  3051. int
  3052. channel_is_canonical(channel_t *chan)
  3053. {
  3054. tor_assert(chan);
  3055. tor_assert(chan->is_canonical);
  3056. return chan->is_canonical(chan, 0);
  3057. }
  3058. /**
  3059. * Test if the canonical flag is reliable
  3060. *
  3061. * This function asks if the lower layer thinks it's safe to trust the
  3062. * result of channel_is_canonical()
  3063. */
  3064. int
  3065. channel_is_canonical_is_reliable(channel_t *chan)
  3066. {
  3067. tor_assert(chan);
  3068. tor_assert(chan->is_canonical);
  3069. return chan->is_canonical(chan, 1);
  3070. }
  3071. /**
  3072. * Test incoming flag
  3073. *
  3074. * This function gets the incoming flag; this is set when a listener spawns
  3075. * a channel. If this returns true the channel was remotely initiated.
  3076. */
  3077. int
  3078. channel_is_incoming(channel_t *chan)
  3079. {
  3080. tor_assert(chan);
  3081. return chan->is_incoming;
  3082. }
  3083. /**
  3084. * Set the incoming flag
  3085. *
  3086. * This function is called when a channel arrives on a listening channel
  3087. * to mark it as incoming.
  3088. */
  3089. void
  3090. channel_mark_incoming(channel_t *chan)
  3091. {
  3092. tor_assert(chan);
  3093. chan->is_incoming = 1;
  3094. }
  3095. /**
  3096. * Test local flag
  3097. *
  3098. * This function gets the local flag; the lower layer should set this when
  3099. * setting up the channel if is_local_addr() is true for all of the
  3100. * destinations it will communicate with on behalf of this channel. It's
  3101. * used to decide whether to declare the network reachable when seeing incoming
  3102. * traffic on the channel.
  3103. */
  3104. int
  3105. channel_is_local(channel_t *chan)
  3106. {
  3107. tor_assert(chan);
  3108. return chan->is_local;
  3109. }
  3110. /**
  3111. * Set the local flag
  3112. *
  3113. * This internal-only function should be called by the lower layer if the
  3114. * channel is to a local address. See channel_is_local() above or the
  3115. * description of the is_local bit in channel.h
  3116. */
  3117. void
  3118. channel_mark_local(channel_t *chan)
  3119. {
  3120. tor_assert(chan);
  3121. chan->is_local = 1;
  3122. }
  3123. /**
  3124. * Test outgoing flag
  3125. *
  3126. * This function gets the outgoing flag; this is the inverse of the incoming
  3127. * bit set when a listener spawns a channel. If this returns true the channel
  3128. * was locally initiated.
  3129. */
  3130. int
  3131. channel_is_outgoing(channel_t *chan)
  3132. {
  3133. tor_assert(chan);
  3134. return !(chan->is_incoming);
  3135. }
  3136. /**
  3137. * Mark a channel as outgoing
  3138. *
  3139. * This function clears the incoming flag and thus marks a channel as
  3140. * outgoing.
  3141. */
  3142. void
  3143. channel_mark_outgoing(channel_t *chan)
  3144. {
  3145. tor_assert(chan);
  3146. chan->is_incoming = 0;
  3147. }
  3148. /*********************
  3149. * Timestamp updates *
  3150. ********************/
  3151. /**
  3152. * Update the created timestamp for a channel
  3153. *
  3154. * This updates the channel's created timestamp and should only be called
  3155. * from channel_init().
  3156. */
  3157. void
  3158. channel_timestamp_created(channel_t *chan)
  3159. {
  3160. time_t now = time(NULL);
  3161. tor_assert(chan);
  3162. chan->timestamp_created = now;
  3163. }
  3164. /**
  3165. * Update the created timestamp for a channel listener
  3166. *
  3167. * This updates the channel listener's created timestamp and should only be
  3168. * called from channel_init_listener().
  3169. */
  3170. void
  3171. channel_listener_timestamp_created(channel_listener_t *chan_l)
  3172. {
  3173. time_t now = time(NULL);
  3174. tor_assert(chan_l);
  3175. chan_l->timestamp_created = now;
  3176. }
  3177. /**
  3178. * Update the last active timestamp for a channel
  3179. *
  3180. * This function updates the channel's last active timestamp; it should be
  3181. * called by the lower layer whenever there is activity on the channel which
  3182. * does not lead to a cell being transmitted or received; the active timestamp
  3183. * is also updated from channel_timestamp_recv() and channel_timestamp_xmit(),
  3184. * but it should be updated for things like the v3 handshake and stuff that
  3185. * produce activity only visible to the lower layer.
  3186. */
  3187. void
  3188. channel_timestamp_active(channel_t *chan)
  3189. {
  3190. time_t now = time(NULL);
  3191. tor_assert(chan);
  3192. chan->timestamp_active = now;
  3193. }
  3194. /**
  3195. * Update the last active timestamp for a channel listener
  3196. */
  3197. void
  3198. channel_listener_timestamp_active(channel_listener_t *chan_l)
  3199. {
  3200. time_t now = time(NULL);
  3201. tor_assert(chan_l);
  3202. chan_l->timestamp_active = now;
  3203. }
  3204. /**
  3205. * Update the last accepted timestamp.
  3206. *
  3207. * This function updates the channel listener's last accepted timestamp; it
  3208. * should be called whenever a new incoming channel is accepted on a
  3209. * listener.
  3210. */
  3211. void
  3212. channel_listener_timestamp_accepted(channel_listener_t *chan_l)
  3213. {
  3214. time_t now = time(NULL);
  3215. tor_assert(chan_l);
  3216. chan_l->timestamp_active = now;
  3217. chan_l->timestamp_accepted = now;
  3218. }
  3219. /**
  3220. * Update client timestamp
  3221. *
  3222. * This function is called by relay.c to timestamp a channel that appears to
  3223. * be used as a client.
  3224. */
  3225. void
  3226. channel_timestamp_client(channel_t *chan)
  3227. {
  3228. time_t now = time(NULL);
  3229. tor_assert(chan);
  3230. chan->timestamp_client = now;
  3231. }
  3232. /**
  3233. * Update the last drained timestamp
  3234. *
  3235. * This is called whenever we transmit a cell which leaves the outgoing cell
  3236. * queue completely empty. It also updates the xmit time and the active time.
  3237. */
  3238. void
  3239. channel_timestamp_drained(channel_t *chan)
  3240. {
  3241. time_t now = time(NULL);
  3242. tor_assert(chan);
  3243. chan->timestamp_active = now;
  3244. chan->timestamp_drained = now;
  3245. chan->timestamp_xmit = now;
  3246. }
  3247. /**
  3248. * Update the recv timestamp
  3249. *
  3250. * This is called whenever we get an incoming cell from the lower layer.
  3251. * This also updates the active timestamp.
  3252. */
  3253. void
  3254. channel_timestamp_recv(channel_t *chan)
  3255. {
  3256. time_t now = time(NULL);
  3257. tor_assert(chan);
  3258. chan->timestamp_active = now;
  3259. chan->timestamp_recv = now;
  3260. }
  3261. /**
  3262. * Update the xmit timestamp
  3263. * This is called whenever we pass an outgoing cell to the lower layer. This
  3264. * also updates the active timestamp.
  3265. */
  3266. void
  3267. channel_timestamp_xmit(channel_t *chan)
  3268. {
  3269. time_t now = time(NULL);
  3270. tor_assert(chan);
  3271. chan->timestamp_active = now;
  3272. chan->timestamp_xmit = now;
  3273. }
  3274. /***************************************************************
  3275. * Timestamp queries - see above for definitions of timestamps *
  3276. **************************************************************/
  3277. /**
  3278. * Query created timestamp for a channel
  3279. */
  3280. time_t
  3281. channel_when_created(channel_t *chan)
  3282. {
  3283. tor_assert(chan);
  3284. return chan->timestamp_created;
  3285. }
  3286. /**
  3287. * Query created timestamp for a channel listener
  3288. */
  3289. time_t
  3290. channel_listener_when_created(channel_listener_t *chan_l)
  3291. {
  3292. tor_assert(chan_l);
  3293. return chan_l->timestamp_created;
  3294. }
  3295. /**
  3296. * Query last active timestamp for a channel
  3297. */
  3298. time_t
  3299. channel_when_last_active(channel_t *chan)
  3300. {
  3301. tor_assert(chan);
  3302. return chan->timestamp_active;
  3303. }
  3304. /**
  3305. * Query last active timestamp for a channel listener
  3306. */
  3307. time_t
  3308. channel_listener_when_last_active(channel_listener_t *chan_l)
  3309. {
  3310. tor_assert(chan_l);
  3311. return chan_l->timestamp_active;
  3312. }
  3313. /**
  3314. * Query last accepted timestamp for a channel listener
  3315. */
  3316. time_t
  3317. channel_listener_when_last_accepted(channel_listener_t *chan_l)
  3318. {
  3319. tor_assert(chan_l);
  3320. return chan_l->timestamp_accepted;
  3321. }
  3322. /**
  3323. * Query client timestamp
  3324. */
  3325. time_t
  3326. channel_when_last_client(channel_t *chan)
  3327. {
  3328. tor_assert(chan);
  3329. return chan->timestamp_client;
  3330. }
  3331. /**
  3332. * Query drained timestamp
  3333. */
  3334. time_t
  3335. channel_when_last_drained(channel_t *chan)
  3336. {
  3337. tor_assert(chan);
  3338. return chan->timestamp_drained;
  3339. }
  3340. /**
  3341. * Query recv timestamp
  3342. */
  3343. time_t
  3344. channel_when_last_recv(channel_t *chan)
  3345. {
  3346. tor_assert(chan);
  3347. return chan->timestamp_recv;
  3348. }
  3349. /**
  3350. * Query xmit timestamp
  3351. */
  3352. time_t
  3353. channel_when_last_xmit(channel_t *chan)
  3354. {
  3355. tor_assert(chan);
  3356. return chan->timestamp_xmit;
  3357. }
  3358. /**
  3359. * Query accepted counter
  3360. */
  3361. uint64_t
  3362. channel_listener_count_accepted(channel_listener_t *chan_l)
  3363. {
  3364. tor_assert(chan_l);
  3365. return chan_l->n_accepted;
  3366. }
  3367. /**
  3368. * Query received cell counter
  3369. */
  3370. uint64_t
  3371. channel_count_recved(channel_t *chan)
  3372. {
  3373. tor_assert(chan);
  3374. return chan->n_cells_recved;
  3375. }
  3376. /**
  3377. * Query transmitted cell counter
  3378. */
  3379. uint64_t
  3380. channel_count_xmitted(channel_t *chan)
  3381. {
  3382. tor_assert(chan);
  3383. return chan->n_cells_xmitted;
  3384. }
  3385. /**
  3386. * Check if a channel matches an extend_info_t
  3387. *
  3388. * This function calls the lower layer and asks if this channel matches a
  3389. * given extend_info_t.
  3390. */
  3391. int
  3392. channel_matches_extend_info(channel_t *chan, extend_info_t *extend_info)
  3393. {
  3394. tor_assert(chan);
  3395. tor_assert(chan->matches_extend_info);
  3396. tor_assert(extend_info);
  3397. return chan->matches_extend_info(chan, extend_info);
  3398. }
  3399. /**
  3400. * Check if a channel matches a given target address
  3401. *
  3402. * This function calls into the lower layer and asks if this channel thinks
  3403. * it matches a given target address for circuit extension purposes.
  3404. */
  3405. int
  3406. channel_matches_target_addr_for_extend(channel_t *chan,
  3407. const tor_addr_t *target)
  3408. {
  3409. tor_assert(chan);
  3410. tor_assert(chan->matches_target);
  3411. tor_assert(target);
  3412. return chan->matches_target(chan, target);
  3413. }
  3414. /**
  3415. * Return the total number of circuits used by a channel
  3416. *
  3417. * @param chan Channel to query
  3418. * @return Number of circuits using this as n_chan or p_chan
  3419. */
  3420. unsigned int
  3421. channel_num_circuits(channel_t *chan)
  3422. {
  3423. tor_assert(chan);
  3424. return chan->num_n_circuits +
  3425. chan->num_p_circuits;
  3426. }
  3427. /**
  3428. * Set up circuit ID generation
  3429. *
  3430. * This is called when setting up a channel and replaces the old
  3431. * connection_or_set_circid_type()
  3432. */
  3433. void
  3434. channel_set_circid_type(channel_t *chan, crypto_pk_t *identity_rcvd)
  3435. {
  3436. int started_here;
  3437. crypto_pk_t *our_identity;
  3438. tor_assert(chan);
  3439. started_here = channel_is_outgoing(chan);
  3440. our_identity = started_here ?
  3441. get_tlsclient_identity_key() : get_server_identity_key();
  3442. if (identity_rcvd) {
  3443. if (crypto_pk_cmp_keys(our_identity, identity_rcvd) < 0) {
  3444. chan->circ_id_type = CIRC_ID_TYPE_LOWER;
  3445. } else {
  3446. chan->circ_id_type = CIRC_ID_TYPE_HIGHER;
  3447. }
  3448. } else {
  3449. chan->circ_id_type = CIRC_ID_TYPE_NEITHER;
  3450. }
  3451. }