channel.c 112 KB

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