rephist.c 83 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658
  1. /* Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  2. * Copyright (c) 2007-2011, The Tor Project, Inc. */
  3. /* See LICENSE for licensing information */
  4. /**
  5. * \file rephist.c
  6. * \brief Basic history and "reputation" functionality to remember
  7. * which servers have worked in the past, how much bandwidth we've
  8. * been using, which ports we tend to want, and so on; further,
  9. * exit port statistics, cell statistics, and connection statistics.
  10. **/
  11. #include "or.h"
  12. #include "circuitlist.h"
  13. #include "circuituse.h"
  14. #include "config.h"
  15. #include "nodelist.h"
  16. #include "rephist.h"
  17. #include "router.h"
  18. #include "routerlist.h"
  19. #include "ht.h"
  20. static void bw_arrays_init(void);
  21. static void predicted_ports_init(void);
  22. /** Total number of bytes currently allocated in fields used by rephist.c. */
  23. uint64_t rephist_total_alloc=0;
  24. /** Number of or_history_t objects currently allocated. */
  25. uint32_t rephist_total_num=0;
  26. /** If the total weighted run count of all runs for a router ever falls
  27. * below this amount, the router can be treated as having 0 MTBF. */
  28. #define STABILITY_EPSILON 0.0001
  29. /** Value by which to discount all old intervals for MTBF purposes. This
  30. * is compounded every STABILITY_INTERVAL. */
  31. #define STABILITY_ALPHA 0.95
  32. /** Interval at which to discount all old intervals for MTBF purposes. */
  33. #define STABILITY_INTERVAL (12*60*60)
  34. /* (This combination of ALPHA, INTERVAL, and EPSILON makes it so that an
  35. * interval that just ended counts twice as much as one that ended a week ago,
  36. * 20X as much as one that ended a month ago, and routers that have had no
  37. * uptime data for about half a year will get forgotten.) */
  38. /** History of an OR-\>OR link. */
  39. typedef struct link_history_t {
  40. /** When did we start tracking this list? */
  41. time_t since;
  42. /** When did we most recently note a change to this link */
  43. time_t changed;
  44. /** How many times did extending from OR1 to OR2 succeed? */
  45. unsigned long n_extend_ok;
  46. /** How many times did extending from OR1 to OR2 fail? */
  47. unsigned long n_extend_fail;
  48. } link_history_t;
  49. /** History of an OR. */
  50. typedef struct or_history_t {
  51. /** When did we start tracking this OR? */
  52. time_t since;
  53. /** When did we most recently note a change to this OR? */
  54. time_t changed;
  55. /** How many times did we successfully connect? */
  56. unsigned long n_conn_ok;
  57. /** How many times did we try to connect and fail?*/
  58. unsigned long n_conn_fail;
  59. /** How many seconds have we been connected to this OR before
  60. * 'up_since'? */
  61. unsigned long uptime;
  62. /** How many seconds have we been unable to connect to this OR before
  63. * 'down_since'? */
  64. unsigned long downtime;
  65. /** If nonzero, we have been connected since this time. */
  66. time_t up_since;
  67. /** If nonzero, we have been unable to connect since this time. */
  68. time_t down_since;
  69. /* === For MTBF tracking: */
  70. /** Weighted sum total of all times that this router has been online.
  71. */
  72. unsigned long weighted_run_length;
  73. /** If the router is now online (according to stability-checking rules),
  74. * when did it come online? */
  75. time_t start_of_run;
  76. /** Sum of weights for runs in weighted_run_length. */
  77. double total_run_weights;
  78. /* === For fractional uptime tracking: */
  79. time_t start_of_downtime;
  80. unsigned long weighted_uptime;
  81. unsigned long total_weighted_time;
  82. /** Map from hex OR2 identity digest to a link_history_t for the link
  83. * from this OR to OR2. */
  84. digestmap_t *link_history_map;
  85. } or_history_t;
  86. /** When did we last multiply all routers' weighted_run_length and
  87. * total_run_weights by STABILITY_ALPHA? */
  88. static time_t stability_last_downrated = 0;
  89. /** */
  90. static time_t started_tracking_stability = 0;
  91. /** Map from hex OR identity digest to or_history_t. */
  92. static digestmap_t *history_map = NULL;
  93. /** Return the or_history_t for the OR with identity digest <b>id</b>,
  94. * creating it if necessary. */
  95. static or_history_t *
  96. get_or_history(const char* id)
  97. {
  98. or_history_t *hist;
  99. if (tor_mem_is_zero(id, DIGEST_LEN))
  100. return NULL;
  101. hist = digestmap_get(history_map, id);
  102. if (!hist) {
  103. hist = tor_malloc_zero(sizeof(or_history_t));
  104. rephist_total_alloc += sizeof(or_history_t);
  105. rephist_total_num++;
  106. hist->link_history_map = digestmap_new();
  107. hist->since = hist->changed = time(NULL);
  108. digestmap_set(history_map, id, hist);
  109. }
  110. return hist;
  111. }
  112. /** Return the link_history_t for the link from the first named OR to
  113. * the second, creating it if necessary. (ORs are identified by
  114. * identity digest.)
  115. */
  116. static link_history_t *
  117. get_link_history(const char *from_id, const char *to_id)
  118. {
  119. or_history_t *orhist;
  120. link_history_t *lhist;
  121. orhist = get_or_history(from_id);
  122. if (!orhist)
  123. return NULL;
  124. if (tor_mem_is_zero(to_id, DIGEST_LEN))
  125. return NULL;
  126. lhist = (link_history_t*) digestmap_get(orhist->link_history_map, to_id);
  127. if (!lhist) {
  128. lhist = tor_malloc_zero(sizeof(link_history_t));
  129. rephist_total_alloc += sizeof(link_history_t);
  130. lhist->since = lhist->changed = time(NULL);
  131. digestmap_set(orhist->link_history_map, to_id, lhist);
  132. }
  133. return lhist;
  134. }
  135. /** Helper: free storage held by a single link history entry. */
  136. static void
  137. _free_link_history(void *val)
  138. {
  139. rephist_total_alloc -= sizeof(link_history_t);
  140. tor_free(val);
  141. }
  142. /** Helper: free storage held by a single OR history entry. */
  143. static void
  144. free_or_history(void *_hist)
  145. {
  146. or_history_t *hist = _hist;
  147. digestmap_free(hist->link_history_map, _free_link_history);
  148. rephist_total_alloc -= sizeof(or_history_t);
  149. rephist_total_num--;
  150. tor_free(hist);
  151. }
  152. /** Update an or_history_t object <b>hist</b> so that its uptime/downtime
  153. * count is up-to-date as of <b>when</b>.
  154. */
  155. static void
  156. update_or_history(or_history_t *hist, time_t when)
  157. {
  158. tor_assert(hist);
  159. if (hist->up_since) {
  160. tor_assert(!hist->down_since);
  161. hist->uptime += (when - hist->up_since);
  162. hist->up_since = when;
  163. } else if (hist->down_since) {
  164. hist->downtime += (when - hist->down_since);
  165. hist->down_since = when;
  166. }
  167. }
  168. /** Initialize the static data structures for tracking history. */
  169. void
  170. rep_hist_init(void)
  171. {
  172. history_map = digestmap_new();
  173. bw_arrays_init();
  174. predicted_ports_init();
  175. }
  176. /** Helper: note that we are no longer connected to the router with history
  177. * <b>hist</b>. If <b>failed</b>, the connection failed; otherwise, it was
  178. * closed correctly. */
  179. static void
  180. mark_or_down(or_history_t *hist, time_t when, int failed)
  181. {
  182. if (hist->up_since) {
  183. hist->uptime += (when - hist->up_since);
  184. hist->up_since = 0;
  185. }
  186. if (failed && !hist->down_since) {
  187. hist->down_since = when;
  188. }
  189. }
  190. /** Helper: note that we are connected to the router with history
  191. * <b>hist</b>. */
  192. static void
  193. mark_or_up(or_history_t *hist, time_t when)
  194. {
  195. if (hist->down_since) {
  196. hist->downtime += (when - hist->down_since);
  197. hist->down_since = 0;
  198. }
  199. if (!hist->up_since) {
  200. hist->up_since = when;
  201. }
  202. }
  203. /** Remember that an attempt to connect to the OR with identity digest
  204. * <b>id</b> failed at <b>when</b>.
  205. */
  206. void
  207. rep_hist_note_connect_failed(const char* id, time_t when)
  208. {
  209. or_history_t *hist;
  210. hist = get_or_history(id);
  211. if (!hist)
  212. return;
  213. ++hist->n_conn_fail;
  214. mark_or_down(hist, when, 1);
  215. hist->changed = when;
  216. }
  217. /** Remember that an attempt to connect to the OR with identity digest
  218. * <b>id</b> succeeded at <b>when</b>.
  219. */
  220. void
  221. rep_hist_note_connect_succeeded(const char* id, time_t when)
  222. {
  223. or_history_t *hist;
  224. hist = get_or_history(id);
  225. if (!hist)
  226. return;
  227. ++hist->n_conn_ok;
  228. mark_or_up(hist, when);
  229. hist->changed = when;
  230. }
  231. /** Remember that we intentionally closed our connection to the OR
  232. * with identity digest <b>id</b> at <b>when</b>.
  233. */
  234. void
  235. rep_hist_note_disconnect(const char* id, time_t when)
  236. {
  237. or_history_t *hist;
  238. hist = get_or_history(id);
  239. if (!hist)
  240. return;
  241. mark_or_down(hist, when, 0);
  242. hist->changed = when;
  243. }
  244. /** Remember that our connection to the OR with identity digest
  245. * <b>id</b> had an error and stopped working at <b>when</b>.
  246. */
  247. void
  248. rep_hist_note_connection_died(const char* id, time_t when)
  249. {
  250. or_history_t *hist;
  251. if (!id) {
  252. /* If conn has no identity, it didn't complete its handshake, or something
  253. * went wrong. Ignore it.
  254. */
  255. return;
  256. }
  257. hist = get_or_history(id);
  258. if (!hist)
  259. return;
  260. mark_or_down(hist, when, 1);
  261. hist->changed = when;
  262. }
  263. /** We have just decided that this router with identity digest <b>id</b> is
  264. * reachable, meaning we will give it a "Running" flag for the next while. */
  265. void
  266. rep_hist_note_router_reachable(const char *id, time_t when)
  267. {
  268. or_history_t *hist = get_or_history(id);
  269. int was_in_run = 1;
  270. char tbuf[ISO_TIME_LEN+1];
  271. tor_assert(hist);
  272. if (!started_tracking_stability)
  273. started_tracking_stability = time(NULL);
  274. if (!hist->start_of_run) {
  275. hist->start_of_run = when;
  276. was_in_run = 0;
  277. }
  278. if (hist->start_of_downtime) {
  279. long down_length;
  280. format_local_iso_time(tbuf, hist->start_of_downtime);
  281. log_info(LD_HIST, "Router %s is now Running; it had been down since %s.",
  282. hex_str(id, DIGEST_LEN), tbuf);
  283. if (was_in_run)
  284. log_info(LD_HIST, " (Paradoxically, it was already Running too.)");
  285. down_length = when - hist->start_of_downtime;
  286. hist->total_weighted_time += down_length;
  287. hist->start_of_downtime = 0;
  288. } else {
  289. format_local_iso_time(tbuf, hist->start_of_run);
  290. if (was_in_run)
  291. log_debug(LD_HIST, "Router %s is still Running; it has been Running "
  292. "since %s", hex_str(id, DIGEST_LEN), tbuf);
  293. else
  294. log_info(LD_HIST,"Router %s is now Running; it was previously untracked",
  295. hex_str(id, DIGEST_LEN));
  296. }
  297. }
  298. /** We have just decided that this router is unreachable, meaning
  299. * we are taking away its "Running" flag. */
  300. void
  301. rep_hist_note_router_unreachable(const char *id, time_t when)
  302. {
  303. or_history_t *hist = get_or_history(id);
  304. char tbuf[ISO_TIME_LEN+1];
  305. int was_running = 0;
  306. if (!started_tracking_stability)
  307. started_tracking_stability = time(NULL);
  308. tor_assert(hist);
  309. if (hist->start_of_run) {
  310. /*XXXX We could treat failed connections differently from failed
  311. * connect attempts. */
  312. long run_length = when - hist->start_of_run;
  313. format_local_iso_time(tbuf, hist->start_of_run);
  314. hist->weighted_run_length += run_length;
  315. hist->total_run_weights += 1.0;
  316. hist->start_of_run = 0;
  317. hist->weighted_uptime += run_length;
  318. hist->total_weighted_time += run_length;
  319. was_running = 1;
  320. log_info(LD_HIST, "Router %s is now non-Running: it had previously been "
  321. "Running since %s. Its total weighted uptime is %lu/%lu.",
  322. hex_str(id, DIGEST_LEN), tbuf, hist->weighted_uptime,
  323. hist->total_weighted_time);
  324. }
  325. if (!hist->start_of_downtime) {
  326. hist->start_of_downtime = when;
  327. if (!was_running)
  328. log_info(LD_HIST, "Router %s is now non-Running; it was previously "
  329. "untracked.", hex_str(id, DIGEST_LEN));
  330. } else {
  331. if (!was_running) {
  332. format_local_iso_time(tbuf, hist->start_of_downtime);
  333. log_info(LD_HIST, "Router %s is still non-Running; it has been "
  334. "non-Running since %s.", hex_str(id, DIGEST_LEN), tbuf);
  335. }
  336. }
  337. }
  338. /** Helper: Discount all old MTBF data, if it is time to do so. Return
  339. * the time at which we should next discount MTBF data. */
  340. time_t
  341. rep_hist_downrate_old_runs(time_t now)
  342. {
  343. digestmap_iter_t *orhist_it;
  344. const char *digest1;
  345. or_history_t *hist;
  346. void *hist_p;
  347. double alpha = 1.0;
  348. if (!history_map)
  349. history_map = digestmap_new();
  350. if (!stability_last_downrated)
  351. stability_last_downrated = now;
  352. if (stability_last_downrated + STABILITY_INTERVAL > now)
  353. return stability_last_downrated + STABILITY_INTERVAL;
  354. /* Okay, we should downrate the data. By how much? */
  355. while (stability_last_downrated + STABILITY_INTERVAL < now) {
  356. stability_last_downrated += STABILITY_INTERVAL;
  357. alpha *= STABILITY_ALPHA;
  358. }
  359. log_info(LD_HIST, "Discounting all old stability info by a factor of %lf",
  360. alpha);
  361. /* Multiply every w_r_l, t_r_w pair by alpha. */
  362. for (orhist_it = digestmap_iter_init(history_map);
  363. !digestmap_iter_done(orhist_it);
  364. orhist_it = digestmap_iter_next(history_map,orhist_it)) {
  365. digestmap_iter_get(orhist_it, &digest1, &hist_p);
  366. hist = hist_p;
  367. hist->weighted_run_length =
  368. (unsigned long)(hist->weighted_run_length * alpha);
  369. hist->total_run_weights *= alpha;
  370. hist->weighted_uptime = (unsigned long)(hist->weighted_uptime * alpha);
  371. hist->total_weighted_time = (unsigned long)
  372. (hist->total_weighted_time * alpha);
  373. }
  374. return stability_last_downrated + STABILITY_INTERVAL;
  375. }
  376. /** Helper: Return the weighted MTBF of the router with history <b>hist</b>. */
  377. static double
  378. get_stability(or_history_t *hist, time_t when)
  379. {
  380. unsigned long total = hist->weighted_run_length;
  381. double total_weights = hist->total_run_weights;
  382. if (hist->start_of_run) {
  383. /* We're currently in a run. Let total and total_weights hold the values
  384. * they would hold if the current run were to end now. */
  385. total += (when-hist->start_of_run);
  386. total_weights += 1.0;
  387. }
  388. if (total_weights < STABILITY_EPSILON) {
  389. /* Round down to zero, and avoid divide-by-zero. */
  390. return 0.0;
  391. }
  392. return total / total_weights;
  393. }
  394. /** Return the total amount of time we've been observing, with each run of
  395. * time downrated by the appropriate factor. */
  396. static long
  397. get_total_weighted_time(or_history_t *hist, time_t when)
  398. {
  399. long total = hist->total_weighted_time;
  400. if (hist->start_of_run) {
  401. total += (when - hist->start_of_run);
  402. } else if (hist->start_of_downtime) {
  403. total += (when - hist->start_of_downtime);
  404. }
  405. return total;
  406. }
  407. /** Helper: Return the weighted percent-of-time-online of the router with
  408. * history <b>hist</b>. */
  409. static double
  410. get_weighted_fractional_uptime(or_history_t *hist, time_t when)
  411. {
  412. unsigned long total = hist->total_weighted_time;
  413. unsigned long up = hist->weighted_uptime;
  414. if (hist->start_of_run) {
  415. long run_length = (when - hist->start_of_run);
  416. up += run_length;
  417. total += run_length;
  418. } else if (hist->start_of_downtime) {
  419. total += (when - hist->start_of_downtime);
  420. }
  421. if (!total) {
  422. /* Avoid calling anybody's uptime infinity (which should be impossible if
  423. * the code is working), or NaN (which can happen for any router we haven't
  424. * observed up or down yet). */
  425. return 0.0;
  426. }
  427. return ((double) up) / total;
  428. }
  429. /** Return an estimated MTBF for the router whose identity digest is
  430. * <b>id</b>. Return 0 if the router is unknown. */
  431. double
  432. rep_hist_get_stability(const char *id, time_t when)
  433. {
  434. or_history_t *hist = get_or_history(id);
  435. if (!hist)
  436. return 0.0;
  437. return get_stability(hist, when);
  438. }
  439. /** Return an estimated percent-of-time-online for the router whose identity
  440. * digest is <b>id</b>. Return 0 if the router is unknown. */
  441. double
  442. rep_hist_get_weighted_fractional_uptime(const char *id, time_t when)
  443. {
  444. or_history_t *hist = get_or_history(id);
  445. if (!hist)
  446. return 0.0;
  447. return get_weighted_fractional_uptime(hist, when);
  448. }
  449. /** Return a number representing how long we've known about the router whose
  450. * digest is <b>id</b>. Return 0 if the router is unknown.
  451. *
  452. * Be careful: this measure increases monotonically as we know the router for
  453. * longer and longer, but it doesn't increase linearly.
  454. */
  455. long
  456. rep_hist_get_weighted_time_known(const char *id, time_t when)
  457. {
  458. or_history_t *hist = get_or_history(id);
  459. if (!hist)
  460. return 0;
  461. return get_total_weighted_time(hist, when);
  462. }
  463. /** Return true if we've been measuring MTBFs for long enough to
  464. * pronounce on Stability. */
  465. int
  466. rep_hist_have_measured_enough_stability(void)
  467. {
  468. /* XXXX021 This doesn't do so well when we change our opinion
  469. * as to whether we're tracking router stability. */
  470. return started_tracking_stability < time(NULL) - 4*60*60;
  471. }
  472. /** Remember that we successfully extended from the OR with identity
  473. * digest <b>from_id</b> to the OR with identity digest
  474. * <b>to_name</b>.
  475. */
  476. void
  477. rep_hist_note_extend_succeeded(const char *from_id, const char *to_id)
  478. {
  479. link_history_t *hist;
  480. /* log_fn(LOG_WARN, "EXTEND SUCCEEDED: %s->%s",from_name,to_name); */
  481. hist = get_link_history(from_id, to_id);
  482. if (!hist)
  483. return;
  484. ++hist->n_extend_ok;
  485. hist->changed = time(NULL);
  486. }
  487. /** Remember that we tried to extend from the OR with identity digest
  488. * <b>from_id</b> to the OR with identity digest <b>to_name</b>, but
  489. * failed.
  490. */
  491. void
  492. rep_hist_note_extend_failed(const char *from_id, const char *to_id)
  493. {
  494. link_history_t *hist;
  495. /* log_fn(LOG_WARN, "EXTEND FAILED: %s->%s",from_name,to_name); */
  496. hist = get_link_history(from_id, to_id);
  497. if (!hist)
  498. return;
  499. ++hist->n_extend_fail;
  500. hist->changed = time(NULL);
  501. }
  502. /** Log all the reliability data we have remembered, with the chosen
  503. * severity.
  504. */
  505. void
  506. rep_hist_dump_stats(time_t now, int severity)
  507. {
  508. digestmap_iter_t *lhist_it;
  509. digestmap_iter_t *orhist_it;
  510. const char *name1, *name2, *digest1, *digest2;
  511. char hexdigest1[HEX_DIGEST_LEN+1];
  512. or_history_t *or_history;
  513. link_history_t *link_history;
  514. void *or_history_p, *link_history_p;
  515. double uptime;
  516. char buffer[2048];
  517. size_t len;
  518. int ret;
  519. unsigned long upt, downt;
  520. const node_t *node;
  521. rep_history_clean(now - get_options()->RephistTrackTime);
  522. log(severity, LD_HIST, "--------------- Dumping history information:");
  523. for (orhist_it = digestmap_iter_init(history_map);
  524. !digestmap_iter_done(orhist_it);
  525. orhist_it = digestmap_iter_next(history_map,orhist_it)) {
  526. double s;
  527. long stability;
  528. digestmap_iter_get(orhist_it, &digest1, &or_history_p);
  529. or_history = (or_history_t*) or_history_p;
  530. if ((node = node_get_by_id(digest1)) && node_get_nickname(node))
  531. name1 = node_get_nickname(node);
  532. else
  533. name1 = "(unknown)";
  534. base16_encode(hexdigest1, sizeof(hexdigest1), digest1, DIGEST_LEN);
  535. update_or_history(or_history, now);
  536. upt = or_history->uptime;
  537. downt = or_history->downtime;
  538. s = get_stability(or_history, now);
  539. stability = (long)s;
  540. if (upt+downt) {
  541. uptime = ((double)upt) / (upt+downt);
  542. } else {
  543. uptime=1.0;
  544. }
  545. log(severity, LD_HIST,
  546. "OR %s [%s]: %ld/%ld good connections; uptime %ld/%ld sec (%.2f%%); "
  547. "wmtbf %lu:%02lu:%02lu",
  548. name1, hexdigest1,
  549. or_history->n_conn_ok, or_history->n_conn_fail+or_history->n_conn_ok,
  550. upt, upt+downt, uptime*100.0,
  551. stability/3600, (stability/60)%60, stability%60);
  552. if (!digestmap_isempty(or_history->link_history_map)) {
  553. strlcpy(buffer, " Extend attempts: ", sizeof(buffer));
  554. len = strlen(buffer);
  555. for (lhist_it = digestmap_iter_init(or_history->link_history_map);
  556. !digestmap_iter_done(lhist_it);
  557. lhist_it = digestmap_iter_next(or_history->link_history_map,
  558. lhist_it)) {
  559. digestmap_iter_get(lhist_it, &digest2, &link_history_p);
  560. if ((node = node_get_by_id(digest2)) && node_get_nickname(node))
  561. name2 = node_get_nickname(node);
  562. else
  563. name2 = "(unknown)";
  564. link_history = (link_history_t*) link_history_p;
  565. ret = tor_snprintf(buffer+len, 2048-len, "%s(%ld/%ld); ", name2,
  566. link_history->n_extend_ok,
  567. link_history->n_extend_ok+link_history->n_extend_fail);
  568. if (ret<0)
  569. break;
  570. else
  571. len += ret;
  572. }
  573. log(severity, LD_HIST, "%s", buffer);
  574. }
  575. }
  576. }
  577. /** Remove history info for routers/links that haven't changed since
  578. * <b>before</b>.
  579. */
  580. void
  581. rep_history_clean(time_t before)
  582. {
  583. int authority = authdir_mode(get_options());
  584. or_history_t *or_history;
  585. link_history_t *link_history;
  586. void *or_history_p, *link_history_p;
  587. digestmap_iter_t *orhist_it, *lhist_it;
  588. const char *d1, *d2;
  589. orhist_it = digestmap_iter_init(history_map);
  590. while (!digestmap_iter_done(orhist_it)) {
  591. int remove;
  592. digestmap_iter_get(orhist_it, &d1, &or_history_p);
  593. or_history = or_history_p;
  594. remove = authority ? (or_history->total_run_weights < STABILITY_EPSILON &&
  595. !or_history->start_of_run)
  596. : (or_history->changed < before);
  597. if (remove) {
  598. orhist_it = digestmap_iter_next_rmv(history_map, orhist_it);
  599. free_or_history(or_history);
  600. continue;
  601. }
  602. for (lhist_it = digestmap_iter_init(or_history->link_history_map);
  603. !digestmap_iter_done(lhist_it); ) {
  604. digestmap_iter_get(lhist_it, &d2, &link_history_p);
  605. link_history = link_history_p;
  606. if (link_history->changed < before) {
  607. lhist_it = digestmap_iter_next_rmv(or_history->link_history_map,
  608. lhist_it);
  609. rephist_total_alloc -= sizeof(link_history_t);
  610. tor_free(link_history);
  611. continue;
  612. }
  613. lhist_it = digestmap_iter_next(or_history->link_history_map,lhist_it);
  614. }
  615. orhist_it = digestmap_iter_next(history_map, orhist_it);
  616. }
  617. }
  618. /** Write MTBF data to disk. Return 0 on success, negative on failure.
  619. *
  620. * If <b>missing_means_down</b>, then if we're about to write an entry
  621. * that is still considered up but isn't in our routerlist, consider it
  622. * to be down. */
  623. int
  624. rep_hist_record_mtbf_data(time_t now, int missing_means_down)
  625. {
  626. char time_buf[ISO_TIME_LEN+1];
  627. digestmap_iter_t *orhist_it;
  628. const char *digest;
  629. void *or_history_p;
  630. or_history_t *hist;
  631. open_file_t *open_file = NULL;
  632. FILE *f;
  633. {
  634. char *filename = get_datadir_fname("router-stability");
  635. f = start_writing_to_stdio_file(filename, OPEN_FLAGS_REPLACE|O_TEXT, 0600,
  636. &open_file);
  637. tor_free(filename);
  638. if (!f)
  639. return -1;
  640. }
  641. /* File format is:
  642. * FormatLine *KeywordLine Data
  643. *
  644. * FormatLine = "format 1" NL
  645. * KeywordLine = Keyword SP Arguments NL
  646. * Data = "data" NL *RouterMTBFLine "." NL
  647. * RouterMTBFLine = Fingerprint SP WeightedRunLen SP
  648. * TotalRunWeights [SP S=StartRunTime] NL
  649. */
  650. #define PUT(s) STMT_BEGIN if (fputs((s),f)<0) goto err; STMT_END
  651. #define PRINTF(args) STMT_BEGIN if (fprintf args <0) goto err; STMT_END
  652. PUT("format 2\n");
  653. format_iso_time(time_buf, time(NULL));
  654. PRINTF((f, "stored-at %s\n", time_buf));
  655. if (started_tracking_stability) {
  656. format_iso_time(time_buf, started_tracking_stability);
  657. PRINTF((f, "tracked-since %s\n", time_buf));
  658. }
  659. if (stability_last_downrated) {
  660. format_iso_time(time_buf, stability_last_downrated);
  661. PRINTF((f, "last-downrated %s\n", time_buf));
  662. }
  663. PUT("data\n");
  664. /* XXX Nick: now bridge auths record this for all routers too.
  665. * Should we make them record it only for bridge routers? -RD
  666. * Not for 0.2.0. -NM */
  667. for (orhist_it = digestmap_iter_init(history_map);
  668. !digestmap_iter_done(orhist_it);
  669. orhist_it = digestmap_iter_next(history_map,orhist_it)) {
  670. char dbuf[HEX_DIGEST_LEN+1];
  671. const char *t = NULL;
  672. digestmap_iter_get(orhist_it, &digest, &or_history_p);
  673. hist = (or_history_t*) or_history_p;
  674. base16_encode(dbuf, sizeof(dbuf), digest, DIGEST_LEN);
  675. if (missing_means_down && hist->start_of_run &&
  676. !router_get_by_id_digest(digest)) {
  677. /* We think this relay is running, but it's not listed in our
  678. * routerlist. Somehow it fell out without telling us it went
  679. * down. Complain and also correct it. */
  680. log_info(LD_HIST,
  681. "Relay '%s' is listed as up in rephist, but it's not in "
  682. "our routerlist. Correcting.", dbuf);
  683. rep_hist_note_router_unreachable(digest, now);
  684. }
  685. PRINTF((f, "R %s\n", dbuf));
  686. if (hist->start_of_run > 0) {
  687. format_iso_time(time_buf, hist->start_of_run);
  688. t = time_buf;
  689. }
  690. PRINTF((f, "+MTBF %lu %.5lf%s%s\n",
  691. hist->weighted_run_length, hist->total_run_weights,
  692. t ? " S=" : "", t ? t : ""));
  693. t = NULL;
  694. if (hist->start_of_downtime > 0) {
  695. format_iso_time(time_buf, hist->start_of_downtime);
  696. t = time_buf;
  697. }
  698. PRINTF((f, "+WFU %lu %lu%s%s\n",
  699. hist->weighted_uptime, hist->total_weighted_time,
  700. t ? " S=" : "", t ? t : ""));
  701. }
  702. PUT(".\n");
  703. #undef PUT
  704. #undef PRINTF
  705. return finish_writing_to_file(open_file);
  706. err:
  707. abort_writing_to_file(open_file);
  708. return -1;
  709. }
  710. /** Format the current tracked status of the router in <b>hist</b> at time
  711. * <b>now</b> for analysis; return it in a newly allocated string. */
  712. static char *
  713. rep_hist_format_router_status(or_history_t *hist, time_t now)
  714. {
  715. char sor_buf[ISO_TIME_LEN+1];
  716. char sod_buf[ISO_TIME_LEN+1];
  717. double wfu;
  718. double mtbf;
  719. int up = 0, down = 0;
  720. char *cp = NULL;
  721. if (hist->start_of_run) {
  722. format_iso_time(sor_buf, hist->start_of_run);
  723. up = 1;
  724. }
  725. if (hist->start_of_downtime) {
  726. format_iso_time(sod_buf, hist->start_of_downtime);
  727. down = 1;
  728. }
  729. wfu = get_weighted_fractional_uptime(hist, now);
  730. mtbf = get_stability(hist, now);
  731. tor_asprintf(&cp,
  732. "%s%s%s"
  733. "%s%s%s"
  734. "wfu %0.3lf\n"
  735. " weighted-time %lu\n"
  736. " weighted-uptime %lu\n"
  737. "mtbf %0.1lf\n"
  738. " weighted-run-length %lu\n"
  739. " total-run-weights %lf\n",
  740. up?"uptime-started ":"", up?sor_buf:"", up?" UTC\n":"",
  741. down?"downtime-started ":"", down?sod_buf:"", down?" UTC\n":"",
  742. wfu,
  743. hist->total_weighted_time,
  744. hist->weighted_uptime,
  745. mtbf,
  746. hist->weighted_run_length,
  747. hist->total_run_weights
  748. );
  749. return cp;
  750. }
  751. /** The last stability analysis document that we created, or NULL if we never
  752. * have created one. */
  753. static char *last_stability_doc = NULL;
  754. /** The last time we created a stability analysis document, or 0 if we never
  755. * have created one. */
  756. static time_t built_last_stability_doc_at = 0;
  757. /** Shortest allowable time between building two stability documents. */
  758. #define MAX_STABILITY_DOC_BUILD_RATE (3*60)
  759. /** Return a pointer to a NUL-terminated document describing our view of the
  760. * stability of the routers we've been tracking. Return NULL on failure. */
  761. const char *
  762. rep_hist_get_router_stability_doc(time_t now)
  763. {
  764. char *result;
  765. smartlist_t *chunks;
  766. if (built_last_stability_doc_at + MAX_STABILITY_DOC_BUILD_RATE > now)
  767. return last_stability_doc;
  768. if (!history_map)
  769. return NULL;
  770. tor_free(last_stability_doc);
  771. chunks = smartlist_create();
  772. if (rep_hist_have_measured_enough_stability()) {
  773. smartlist_add(chunks, tor_strdup("we-have-enough-measurements\n"));
  774. } else {
  775. smartlist_add(chunks, tor_strdup("we-do-not-have-enough-measurements\n"));
  776. }
  777. DIGESTMAP_FOREACH(history_map, id, or_history_t *, hist) {
  778. const node_t *node;
  779. char dbuf[BASE64_DIGEST_LEN+1];
  780. char header_buf[512];
  781. char *info;
  782. digest_to_base64(dbuf, id);
  783. node = node_get_by_id(id);
  784. if (node) {
  785. char ip[INET_NTOA_BUF_LEN+1];
  786. char tbuf[ISO_TIME_LEN+1];
  787. time_t published = node_get_published_on(node);
  788. node_get_address_string(node,ip,sizeof(ip));
  789. if (published > 0)
  790. format_iso_time(tbuf, published);
  791. else
  792. strlcpy(tbuf, "???", sizeof(tbuf));
  793. tor_snprintf(header_buf, sizeof(header_buf),
  794. "router %s %s %s\n"
  795. "published %s\n"
  796. "relevant-flags %s%s%s\n"
  797. "declared-uptime %ld\n",
  798. dbuf, node_get_nickname(node), ip,
  799. tbuf,
  800. node->is_running ? "Running " : "",
  801. node->is_valid ? "Valid " : "",
  802. node->ri && node->ri->is_hibernating ? "Hibernating " : "",
  803. node_get_declared_uptime(node));
  804. } else {
  805. tor_snprintf(header_buf, sizeof(header_buf),
  806. "router %s {no descriptor}\n", dbuf);
  807. }
  808. smartlist_add(chunks, tor_strdup(header_buf));
  809. info = rep_hist_format_router_status(hist, now);
  810. if (info)
  811. smartlist_add(chunks, info);
  812. } DIGESTMAP_FOREACH_END;
  813. result = smartlist_join_strings(chunks, "", 0, NULL);
  814. SMARTLIST_FOREACH(chunks, char *, cp, tor_free(cp));
  815. smartlist_free(chunks);
  816. last_stability_doc = result;
  817. built_last_stability_doc_at = time(NULL);
  818. return result;
  819. }
  820. /** Helper: return the first j >= i such that !strcmpstart(sl[j], prefix) and
  821. * such that no line sl[k] with i <= k < j starts with "R ". Return -1 if no
  822. * such line exists. */
  823. static int
  824. find_next_with(smartlist_t *sl, int i, const char *prefix)
  825. {
  826. for ( ; i < smartlist_len(sl); ++i) {
  827. const char *line = smartlist_get(sl, i);
  828. if (!strcmpstart(line, prefix))
  829. return i;
  830. if (!strcmpstart(line, "R "))
  831. return -1;
  832. }
  833. return -1;
  834. }
  835. /** How many bad times has parse_possibly_bad_iso_time parsed? */
  836. static int n_bogus_times = 0;
  837. /** Parse the ISO-formatted time in <b>s</b> into *<b>time_out</b>, but
  838. * rounds any pre-1970 date to Jan 1, 1970. */
  839. static int
  840. parse_possibly_bad_iso_time(const char *s, time_t *time_out)
  841. {
  842. int year;
  843. char b[5];
  844. strlcpy(b, s, sizeof(b));
  845. b[4] = '\0';
  846. year = (int)tor_parse_long(b, 10, 0, INT_MAX, NULL, NULL);
  847. if (year < 1970) {
  848. *time_out = 0;
  849. ++n_bogus_times;
  850. return 0;
  851. } else
  852. return parse_iso_time(s, time_out);
  853. }
  854. /** We've read a time <b>t</b> from a file stored at <b>stored_at</b>, which
  855. * says we started measuring at <b>started_measuring</b>. Return a new number
  856. * that's about as much before <b>now</b> as <b>t</b> was before
  857. * <b>stored_at</b>.
  858. */
  859. static INLINE time_t
  860. correct_time(time_t t, time_t now, time_t stored_at, time_t started_measuring)
  861. {
  862. if (t < started_measuring - 24*60*60*365)
  863. return 0;
  864. else if (t < started_measuring)
  865. return started_measuring;
  866. else if (t > stored_at)
  867. return 0;
  868. else {
  869. long run_length = stored_at - t;
  870. t = now - run_length;
  871. if (t < started_measuring)
  872. t = started_measuring;
  873. return t;
  874. }
  875. }
  876. /** Load MTBF data from disk. Returns 0 on success or recoverable error, -1
  877. * on failure. */
  878. int
  879. rep_hist_load_mtbf_data(time_t now)
  880. {
  881. /* XXXX won't handle being called while history is already populated. */
  882. smartlist_t *lines;
  883. const char *line = NULL;
  884. int r=0, i;
  885. time_t last_downrated = 0, stored_at = 0, tracked_since = 0;
  886. time_t latest_possible_start = now;
  887. long format = -1;
  888. {
  889. char *filename = get_datadir_fname("router-stability");
  890. char *d = read_file_to_str(filename, RFTS_IGNORE_MISSING, NULL);
  891. tor_free(filename);
  892. if (!d)
  893. return -1;
  894. lines = smartlist_create();
  895. smartlist_split_string(lines, d, "\n", SPLIT_SKIP_SPACE, 0);
  896. tor_free(d);
  897. }
  898. {
  899. const char *firstline;
  900. if (smartlist_len(lines)>4) {
  901. firstline = smartlist_get(lines, 0);
  902. if (!strcmpstart(firstline, "format "))
  903. format = tor_parse_long(firstline+strlen("format "),
  904. 10, -1, LONG_MAX, NULL, NULL);
  905. }
  906. }
  907. if (format != 1 && format != 2) {
  908. log_warn(LD_HIST,
  909. "Unrecognized format in mtbf history file. Skipping.");
  910. goto err;
  911. }
  912. for (i = 1; i < smartlist_len(lines); ++i) {
  913. line = smartlist_get(lines, i);
  914. if (!strcmp(line, "data"))
  915. break;
  916. if (!strcmpstart(line, "last-downrated ")) {
  917. if (parse_iso_time(line+strlen("last-downrated "), &last_downrated)<0)
  918. log_warn(LD_HIST,"Couldn't parse downrate time in mtbf "
  919. "history file.");
  920. }
  921. if (!strcmpstart(line, "stored-at ")) {
  922. if (parse_iso_time(line+strlen("stored-at "), &stored_at)<0)
  923. log_warn(LD_HIST,"Couldn't parse stored time in mtbf "
  924. "history file.");
  925. }
  926. if (!strcmpstart(line, "tracked-since ")) {
  927. if (parse_iso_time(line+strlen("tracked-since "), &tracked_since)<0)
  928. log_warn(LD_HIST,"Couldn't parse started-tracking time in mtbf "
  929. "history file.");
  930. }
  931. }
  932. if (last_downrated > now)
  933. last_downrated = now;
  934. if (tracked_since > now)
  935. tracked_since = now;
  936. if (!stored_at) {
  937. log_warn(LD_HIST, "No stored time recorded.");
  938. goto err;
  939. }
  940. if (line && !strcmp(line, "data"))
  941. ++i;
  942. n_bogus_times = 0;
  943. for (; i < smartlist_len(lines); ++i) {
  944. char digest[DIGEST_LEN];
  945. char hexbuf[HEX_DIGEST_LEN+1];
  946. char mtbf_timebuf[ISO_TIME_LEN+1];
  947. char wfu_timebuf[ISO_TIME_LEN+1];
  948. time_t start_of_run = 0;
  949. time_t start_of_downtime = 0;
  950. int have_mtbf = 0, have_wfu = 0;
  951. long wrl = 0;
  952. double trw = 0;
  953. long wt_uptime = 0, total_wt_time = 0;
  954. int n;
  955. or_history_t *hist;
  956. line = smartlist_get(lines, i);
  957. if (!strcmp(line, "."))
  958. break;
  959. mtbf_timebuf[0] = '\0';
  960. wfu_timebuf[0] = '\0';
  961. if (format == 1) {
  962. n = sscanf(line, "%40s %ld %lf S=%10s %8s",
  963. hexbuf, &wrl, &trw, mtbf_timebuf, mtbf_timebuf+11);
  964. if (n != 3 && n != 5) {
  965. log_warn(LD_HIST, "Couldn't scan line %s", escaped(line));
  966. continue;
  967. }
  968. have_mtbf = 1;
  969. } else {
  970. // format == 2.
  971. int mtbf_idx, wfu_idx;
  972. if (strcmpstart(line, "R ") || strlen(line) < 2+HEX_DIGEST_LEN)
  973. continue;
  974. strlcpy(hexbuf, line+2, sizeof(hexbuf));
  975. mtbf_idx = find_next_with(lines, i+1, "+MTBF ");
  976. wfu_idx = find_next_with(lines, i+1, "+WFU ");
  977. if (mtbf_idx >= 0) {
  978. const char *mtbfline = smartlist_get(lines, mtbf_idx);
  979. n = sscanf(mtbfline, "+MTBF %lu %lf S=%10s %8s",
  980. &wrl, &trw, mtbf_timebuf, mtbf_timebuf+11);
  981. if (n == 2 || n == 4) {
  982. have_mtbf = 1;
  983. } else {
  984. log_warn(LD_HIST, "Couldn't scan +MTBF line %s",
  985. escaped(mtbfline));
  986. }
  987. }
  988. if (wfu_idx >= 0) {
  989. const char *wfuline = smartlist_get(lines, wfu_idx);
  990. n = sscanf(wfuline, "+WFU %lu %lu S=%10s %8s",
  991. &wt_uptime, &total_wt_time,
  992. wfu_timebuf, wfu_timebuf+11);
  993. if (n == 2 || n == 4) {
  994. have_wfu = 1;
  995. } else {
  996. log_warn(LD_HIST, "Couldn't scan +WFU line %s", escaped(wfuline));
  997. }
  998. }
  999. if (wfu_idx > i)
  1000. i = wfu_idx;
  1001. if (mtbf_idx > i)
  1002. i = mtbf_idx;
  1003. }
  1004. if (base16_decode(digest, DIGEST_LEN, hexbuf, HEX_DIGEST_LEN) < 0) {
  1005. log_warn(LD_HIST, "Couldn't hex string %s", escaped(hexbuf));
  1006. continue;
  1007. }
  1008. hist = get_or_history(digest);
  1009. if (!hist)
  1010. continue;
  1011. if (have_mtbf) {
  1012. if (mtbf_timebuf[0]) {
  1013. mtbf_timebuf[10] = ' ';
  1014. if (parse_possibly_bad_iso_time(mtbf_timebuf, &start_of_run)<0)
  1015. log_warn(LD_HIST, "Couldn't parse time %s",
  1016. escaped(mtbf_timebuf));
  1017. }
  1018. hist->start_of_run = correct_time(start_of_run, now, stored_at,
  1019. tracked_since);
  1020. if (hist->start_of_run < latest_possible_start + wrl)
  1021. latest_possible_start = hist->start_of_run - wrl;
  1022. hist->weighted_run_length = wrl;
  1023. hist->total_run_weights = trw;
  1024. }
  1025. if (have_wfu) {
  1026. if (wfu_timebuf[0]) {
  1027. wfu_timebuf[10] = ' ';
  1028. if (parse_possibly_bad_iso_time(wfu_timebuf, &start_of_downtime)<0)
  1029. log_warn(LD_HIST, "Couldn't parse time %s", escaped(wfu_timebuf));
  1030. }
  1031. }
  1032. hist->start_of_downtime = correct_time(start_of_downtime, now, stored_at,
  1033. tracked_since);
  1034. hist->weighted_uptime = wt_uptime;
  1035. hist->total_weighted_time = total_wt_time;
  1036. }
  1037. if (strcmp(line, "."))
  1038. log_warn(LD_HIST, "Truncated MTBF file.");
  1039. if (tracked_since < 86400*365) /* Recover from insanely early value. */
  1040. tracked_since = latest_possible_start;
  1041. stability_last_downrated = last_downrated;
  1042. started_tracking_stability = tracked_since;
  1043. goto done;
  1044. err:
  1045. r = -1;
  1046. done:
  1047. SMARTLIST_FOREACH(lines, char *, cp, tor_free(cp));
  1048. smartlist_free(lines);
  1049. return r;
  1050. }
  1051. /** For how many seconds do we keep track of individual per-second bandwidth
  1052. * totals? */
  1053. #define NUM_SECS_ROLLING_MEASURE 10
  1054. /** How large are the intervals for which we track and report bandwidth use? */
  1055. #define NUM_SECS_BW_SUM_INTERVAL (15*60)
  1056. /** How far in the past do we remember and publish bandwidth use? */
  1057. #define NUM_SECS_BW_SUM_IS_VALID (24*60*60)
  1058. /** How many bandwidth usage intervals do we remember? (derived) */
  1059. #define NUM_TOTALS (NUM_SECS_BW_SUM_IS_VALID/NUM_SECS_BW_SUM_INTERVAL)
  1060. /** Structure to track bandwidth use, and remember the maxima for a given
  1061. * time period.
  1062. */
  1063. typedef struct bw_array_t {
  1064. /** Observation array: Total number of bytes transferred in each of the last
  1065. * NUM_SECS_ROLLING_MEASURE seconds. This is used as a circular array. */
  1066. uint64_t obs[NUM_SECS_ROLLING_MEASURE];
  1067. int cur_obs_idx; /**< Current position in obs. */
  1068. time_t cur_obs_time; /**< Time represented in obs[cur_obs_idx] */
  1069. uint64_t total_obs; /**< Total for all members of obs except
  1070. * obs[cur_obs_idx] */
  1071. uint64_t max_total; /**< Largest value that total_obs has taken on in the
  1072. * current period. */
  1073. uint64_t total_in_period; /**< Total bytes transferred in the current
  1074. * period. */
  1075. /** When does the next period begin? */
  1076. time_t next_period;
  1077. /** Where in 'maxima' should the maximum bandwidth usage for the current
  1078. * period be stored? */
  1079. int next_max_idx;
  1080. /** How many values in maxima/totals have been set ever? */
  1081. int num_maxes_set;
  1082. /** Circular array of the maximum
  1083. * bandwidth-per-NUM_SECS_ROLLING_MEASURE usage for the last
  1084. * NUM_TOTALS periods */
  1085. uint64_t maxima[NUM_TOTALS];
  1086. /** Circular array of the total bandwidth usage for the last NUM_TOTALS
  1087. * periods */
  1088. uint64_t totals[NUM_TOTALS];
  1089. } bw_array_t;
  1090. /** Shift the current period of b forward by one. */
  1091. static void
  1092. commit_max(bw_array_t *b)
  1093. {
  1094. /* Store total from current period. */
  1095. b->totals[b->next_max_idx] = b->total_in_period;
  1096. /* Store maximum from current period. */
  1097. b->maxima[b->next_max_idx++] = b->max_total;
  1098. /* Advance next_period and next_max_idx */
  1099. b->next_period += NUM_SECS_BW_SUM_INTERVAL;
  1100. if (b->next_max_idx == NUM_TOTALS)
  1101. b->next_max_idx = 0;
  1102. if (b->num_maxes_set < NUM_TOTALS)
  1103. ++b->num_maxes_set;
  1104. /* Reset max_total. */
  1105. b->max_total = 0;
  1106. /* Reset total_in_period. */
  1107. b->total_in_period = 0;
  1108. }
  1109. /** Shift the current observation time of 'b' forward by one second. */
  1110. static INLINE void
  1111. advance_obs(bw_array_t *b)
  1112. {
  1113. int nextidx;
  1114. uint64_t total;
  1115. /* Calculate the total bandwidth for the last NUM_SECS_ROLLING_MEASURE
  1116. * seconds; adjust max_total as needed.*/
  1117. total = b->total_obs + b->obs[b->cur_obs_idx];
  1118. if (total > b->max_total)
  1119. b->max_total = total;
  1120. nextidx = b->cur_obs_idx+1;
  1121. if (nextidx == NUM_SECS_ROLLING_MEASURE)
  1122. nextidx = 0;
  1123. b->total_obs = total - b->obs[nextidx];
  1124. b->obs[nextidx]=0;
  1125. b->cur_obs_idx = nextidx;
  1126. if (++b->cur_obs_time >= b->next_period)
  1127. commit_max(b);
  1128. }
  1129. /** Add <b>n</b> bytes to the number of bytes in <b>b</b> for second
  1130. * <b>when</b>. */
  1131. static INLINE void
  1132. add_obs(bw_array_t *b, time_t when, uint64_t n)
  1133. {
  1134. /* Don't record data in the past. */
  1135. if (when<b->cur_obs_time)
  1136. return;
  1137. /* If we're currently adding observations for an earlier second than
  1138. * 'when', advance b->cur_obs_time and b->cur_obs_idx by an
  1139. * appropriate number of seconds, and do all the other housekeeping */
  1140. while (when>b->cur_obs_time)
  1141. advance_obs(b);
  1142. b->obs[b->cur_obs_idx] += n;
  1143. b->total_in_period += n;
  1144. }
  1145. /** Allocate, initialize, and return a new bw_array. */
  1146. static bw_array_t *
  1147. bw_array_new(void)
  1148. {
  1149. bw_array_t *b;
  1150. time_t start;
  1151. b = tor_malloc_zero(sizeof(bw_array_t));
  1152. rephist_total_alloc += sizeof(bw_array_t);
  1153. start = time(NULL);
  1154. b->cur_obs_time = start;
  1155. b->next_period = start + NUM_SECS_BW_SUM_INTERVAL;
  1156. return b;
  1157. }
  1158. /** Recent history of bandwidth observations for read operations. */
  1159. static bw_array_t *read_array = NULL;
  1160. /** Recent history of bandwidth observations for write operations. */
  1161. static bw_array_t *write_array = NULL;
  1162. /** Recent history of bandwidth observations for read operations for the
  1163. directory protocol. */
  1164. static bw_array_t *dir_read_array = NULL;
  1165. /** Recent history of bandwidth observations for write operations for the
  1166. directory protocol. */
  1167. static bw_array_t *dir_write_array = NULL;
  1168. /** Set up [dir-]read_array and [dir-]write_array. */
  1169. static void
  1170. bw_arrays_init(void)
  1171. {
  1172. read_array = bw_array_new();
  1173. write_array = bw_array_new();
  1174. dir_read_array = bw_array_new();
  1175. dir_write_array = bw_array_new();
  1176. }
  1177. /** We read <b>num_bytes</b> more bytes in second <b>when</b>.
  1178. *
  1179. * Add num_bytes to the current running total for <b>when</b>.
  1180. *
  1181. * <b>when</b> can go back to time, but it's safe to ignore calls
  1182. * earlier than the latest <b>when</b> you've heard of.
  1183. */
  1184. void
  1185. rep_hist_note_bytes_written(size_t num_bytes, time_t when)
  1186. {
  1187. /* Maybe a circular array for recent seconds, and step to a new point
  1188. * every time a new second shows up. Or simpler is to just to have
  1189. * a normal array and push down each item every second; it's short.
  1190. */
  1191. /* When a new second has rolled over, compute the sum of the bytes we've
  1192. * seen over when-1 to when-1-NUM_SECS_ROLLING_MEASURE, and stick it
  1193. * somewhere. See rep_hist_bandwidth_assess() below.
  1194. */
  1195. add_obs(write_array, when, num_bytes);
  1196. }
  1197. /** We wrote <b>num_bytes</b> more bytes in second <b>when</b>.
  1198. * (like rep_hist_note_bytes_written() above)
  1199. */
  1200. void
  1201. rep_hist_note_bytes_read(size_t num_bytes, time_t when)
  1202. {
  1203. /* if we're smart, we can make this func and the one above share code */
  1204. add_obs(read_array, when, num_bytes);
  1205. }
  1206. /** We wrote <b>num_bytes</b> more directory bytes in second <b>when</b>.
  1207. * (like rep_hist_note_bytes_written() above)
  1208. */
  1209. void
  1210. rep_hist_note_dir_bytes_written(size_t num_bytes, time_t when)
  1211. {
  1212. add_obs(dir_write_array, when, num_bytes);
  1213. }
  1214. /** We read <b>num_bytes</b> more directory bytes in second <b>when</b>.
  1215. * (like rep_hist_note_bytes_written() above)
  1216. */
  1217. void
  1218. rep_hist_note_dir_bytes_read(size_t num_bytes, time_t when)
  1219. {
  1220. add_obs(dir_read_array, when, num_bytes);
  1221. }
  1222. /** Helper: Return the largest value in b->maxima. (This is equal to the
  1223. * most bandwidth used in any NUM_SECS_ROLLING_MEASURE period for the last
  1224. * NUM_SECS_BW_SUM_IS_VALID seconds.)
  1225. */
  1226. static uint64_t
  1227. find_largest_max(bw_array_t *b)
  1228. {
  1229. int i;
  1230. uint64_t max;
  1231. max=0;
  1232. for (i=0; i<NUM_TOTALS; ++i) {
  1233. if (b->maxima[i]>max)
  1234. max = b->maxima[i];
  1235. }
  1236. return max;
  1237. }
  1238. /** Find the largest sums in the past NUM_SECS_BW_SUM_IS_VALID (roughly)
  1239. * seconds. Find one sum for reading and one for writing. They don't have
  1240. * to be at the same time.
  1241. *
  1242. * Return the smaller of these sums, divided by NUM_SECS_ROLLING_MEASURE.
  1243. */
  1244. int
  1245. rep_hist_bandwidth_assess(void)
  1246. {
  1247. uint64_t w,r;
  1248. r = find_largest_max(read_array);
  1249. w = find_largest_max(write_array);
  1250. if (r>w)
  1251. return (int)(U64_TO_DBL(w)/NUM_SECS_ROLLING_MEASURE);
  1252. else
  1253. return (int)(U64_TO_DBL(r)/NUM_SECS_ROLLING_MEASURE);
  1254. }
  1255. /** Print the bandwidth history of b (either [dir-]read_array or
  1256. * [dir-]write_array) into the buffer pointed to by buf. The format is
  1257. * simply comma separated numbers, from oldest to newest.
  1258. *
  1259. * It returns the number of bytes written.
  1260. */
  1261. static size_t
  1262. rep_hist_fill_bandwidth_history(char *buf, size_t len, bw_array_t *b)
  1263. {
  1264. char *cp = buf;
  1265. int i, n;
  1266. or_options_t *options = get_options();
  1267. uint64_t cutoff;
  1268. if (b->num_maxes_set <= b->next_max_idx) {
  1269. /* We haven't been through the circular array yet; time starts at i=0.*/
  1270. i = 0;
  1271. } else {
  1272. /* We've been around the array at least once. The next i to be
  1273. overwritten is the oldest. */
  1274. i = b->next_max_idx;
  1275. }
  1276. if (options->RelayBandwidthRate) {
  1277. /* We don't want to report that we used more bandwidth than the max we're
  1278. * willing to relay; otherwise everybody will know how much traffic
  1279. * we used ourself. */
  1280. cutoff = options->RelayBandwidthRate * NUM_SECS_BW_SUM_INTERVAL;
  1281. } else {
  1282. cutoff = UINT64_MAX;
  1283. }
  1284. for (n=0; n<b->num_maxes_set; ++n,++i) {
  1285. uint64_t total;
  1286. if (i >= NUM_TOTALS)
  1287. i -= NUM_TOTALS;
  1288. tor_assert(i < NUM_TOTALS);
  1289. /* Round the bandwidth used down to the nearest 1k. */
  1290. total = b->totals[i] & ~0x3ff;
  1291. if (total > cutoff)
  1292. total = cutoff;
  1293. if (n==(b->num_maxes_set-1))
  1294. tor_snprintf(cp, len-(cp-buf), U64_FORMAT, U64_PRINTF_ARG(total));
  1295. else
  1296. tor_snprintf(cp, len-(cp-buf), U64_FORMAT",", U64_PRINTF_ARG(total));
  1297. cp += strlen(cp);
  1298. }
  1299. return cp-buf;
  1300. }
  1301. /** Allocate and return lines for representing this server's bandwidth
  1302. * history in its descriptor.
  1303. */
  1304. char *
  1305. rep_hist_get_bandwidth_lines(void)
  1306. {
  1307. char *buf, *cp;
  1308. char t[ISO_TIME_LEN+1];
  1309. int r;
  1310. bw_array_t *b = NULL;
  1311. const char *desc = NULL;
  1312. size_t len;
  1313. /* opt [dirreq-](read|write)-history yyyy-mm-dd HH:MM:SS (n s) n,n,n... */
  1314. len = (67+21*NUM_TOTALS)*4;
  1315. buf = tor_malloc_zero(len);
  1316. cp = buf;
  1317. for (r=0;r<4;++r) {
  1318. switch (r) {
  1319. case 0:
  1320. b = write_array;
  1321. desc = "write-history";
  1322. break;
  1323. case 1:
  1324. b = read_array;
  1325. desc = "read-history";
  1326. break;
  1327. case 2:
  1328. b = dir_write_array;
  1329. desc = "dirreq-write-history";
  1330. break;
  1331. case 3:
  1332. b = dir_read_array;
  1333. desc = "dirreq-read-history";
  1334. break;
  1335. }
  1336. tor_assert(b);
  1337. format_iso_time(t, b->next_period-NUM_SECS_BW_SUM_INTERVAL);
  1338. tor_snprintf(cp, len-(cp-buf), "%s %s (%d s) ",
  1339. desc, t, NUM_SECS_BW_SUM_INTERVAL);
  1340. cp += strlen(cp);
  1341. cp += rep_hist_fill_bandwidth_history(cp, len-(cp-buf), b);
  1342. strlcat(cp, "\n", len-(cp-buf));
  1343. ++cp;
  1344. }
  1345. return buf;
  1346. }
  1347. /** Update <b>state</b> with the newest bandwidth history. */
  1348. void
  1349. rep_hist_update_state(or_state_t *state)
  1350. {
  1351. int len, r;
  1352. char *buf, *cp;
  1353. smartlist_t **s_values = NULL;
  1354. time_t *s_begins = NULL;
  1355. int *s_interval = NULL;
  1356. bw_array_t *b = NULL;
  1357. len = 20*NUM_TOTALS+1;
  1358. buf = tor_malloc_zero(len);
  1359. for (r=0;r<4;++r) {
  1360. switch (r) {
  1361. case 0:
  1362. b = write_array;
  1363. s_begins = &state->BWHistoryWriteEnds;
  1364. s_interval = &state->BWHistoryWriteInterval;
  1365. s_values = &state->BWHistoryWriteValues;
  1366. break;
  1367. case 1:
  1368. b = read_array;
  1369. s_begins = &state->BWHistoryReadEnds;
  1370. s_interval = &state->BWHistoryReadInterval;
  1371. s_values = &state->BWHistoryReadValues;
  1372. break;
  1373. case 2:
  1374. b = dir_write_array;
  1375. s_begins = &state->BWHistoryDirWriteEnds;
  1376. s_interval = &state->BWHistoryDirWriteInterval;
  1377. s_values = &state->BWHistoryDirWriteValues;
  1378. break;
  1379. case 3:
  1380. b = dir_read_array;
  1381. s_begins = &state->BWHistoryDirReadEnds;
  1382. s_interval = &state->BWHistoryDirReadInterval;
  1383. s_values = &state->BWHistoryDirReadValues;
  1384. break;
  1385. }
  1386. if (*s_values) {
  1387. SMARTLIST_FOREACH(*s_values, char *, val, tor_free(val));
  1388. smartlist_free(*s_values);
  1389. }
  1390. if (! server_mode(get_options())) {
  1391. /* Clients don't need to store bandwidth history persistently;
  1392. * force these values to the defaults. */
  1393. /* FFFF we should pull the default out of config.c's state table,
  1394. * so we don't have two defaults. */
  1395. if (*s_begins != 0 || *s_interval != 900) {
  1396. time_t now = time(NULL);
  1397. time_t save_at = get_options()->AvoidDiskWrites ? now+3600 : now+600;
  1398. or_state_mark_dirty(state, save_at);
  1399. }
  1400. *s_begins = 0;
  1401. *s_interval = 900;
  1402. *s_values = smartlist_create();
  1403. continue;
  1404. }
  1405. *s_begins = b->next_period;
  1406. *s_interval = NUM_SECS_BW_SUM_INTERVAL;
  1407. cp = buf;
  1408. cp += rep_hist_fill_bandwidth_history(cp, len, b);
  1409. tor_snprintf(cp, len-(cp-buf), cp == buf ? U64_FORMAT : ","U64_FORMAT,
  1410. U64_PRINTF_ARG(b->total_in_period));
  1411. *s_values = smartlist_create();
  1412. if (server_mode(get_options()))
  1413. smartlist_split_string(*s_values, buf, ",", SPLIT_SKIP_SPACE, 0);
  1414. }
  1415. tor_free(buf);
  1416. if (server_mode(get_options())) {
  1417. or_state_mark_dirty(get_or_state(), time(NULL)+(2*3600));
  1418. }
  1419. }
  1420. /** Set bandwidth history from our saved state. */
  1421. int
  1422. rep_hist_load_state(or_state_t *state, char **err)
  1423. {
  1424. time_t s_begins = 0, start;
  1425. time_t now = time(NULL);
  1426. uint64_t v;
  1427. int r,i,ok;
  1428. int all_ok = 1;
  1429. int s_interval = 0;
  1430. smartlist_t *s_values = NULL;
  1431. bw_array_t *b = NULL;
  1432. /* Assert they already have been malloced */
  1433. tor_assert(read_array && write_array);
  1434. for (r=0;r<4;++r) {
  1435. switch (r) {
  1436. case 0:
  1437. b = write_array;
  1438. s_begins = state->BWHistoryWriteEnds;
  1439. s_interval = state->BWHistoryWriteInterval;
  1440. s_values = state->BWHistoryWriteValues;
  1441. break;
  1442. case 1:
  1443. b = read_array;
  1444. s_begins = state->BWHistoryReadEnds;
  1445. s_interval = state->BWHistoryReadInterval;
  1446. s_values = state->BWHistoryReadValues;
  1447. break;
  1448. case 2:
  1449. b = dir_write_array;
  1450. s_begins = state->BWHistoryDirWriteEnds;
  1451. s_interval = state->BWHistoryDirWriteInterval;
  1452. s_values = state->BWHistoryDirWriteValues;
  1453. break;
  1454. case 3:
  1455. b = dir_read_array;
  1456. s_begins = state->BWHistoryDirReadEnds;
  1457. s_interval = state->BWHistoryDirReadInterval;
  1458. s_values = state->BWHistoryDirReadValues;
  1459. break;
  1460. }
  1461. if (s_values && s_begins >= now - NUM_SECS_BW_SUM_INTERVAL*NUM_TOTALS) {
  1462. start = s_begins - s_interval*(smartlist_len(s_values));
  1463. if (start > now)
  1464. continue;
  1465. b->cur_obs_time = start;
  1466. b->next_period = start + NUM_SECS_BW_SUM_INTERVAL;
  1467. SMARTLIST_FOREACH(s_values, char *, cp, {
  1468. v = tor_parse_uint64(cp, 10, 0, UINT64_MAX, &ok, NULL);
  1469. if (!ok) {
  1470. all_ok=0;
  1471. log_notice(LD_HIST, "Could not parse '%s' into a number.'", cp);
  1472. }
  1473. if (start < now) {
  1474. add_obs(b, start, v);
  1475. start += NUM_SECS_BW_SUM_INTERVAL;
  1476. }
  1477. });
  1478. }
  1479. /* Clean up maxima and observed */
  1480. /* Do we really want to zero this for the purpose of max capacity? */
  1481. for (i=0; i<NUM_SECS_ROLLING_MEASURE; ++i) {
  1482. b->obs[i] = 0;
  1483. }
  1484. b->total_obs = 0;
  1485. for (i=0; i<NUM_TOTALS; ++i) {
  1486. b->maxima[i] = 0;
  1487. }
  1488. b->max_total = 0;
  1489. }
  1490. if (!all_ok) {
  1491. *err = tor_strdup("Parsing of bandwidth history values failed");
  1492. /* and create fresh arrays */
  1493. tor_free(read_array);
  1494. tor_free(write_array);
  1495. read_array = bw_array_new();
  1496. write_array = bw_array_new();
  1497. return -1;
  1498. }
  1499. return 0;
  1500. }
  1501. /*********************************************************************/
  1502. typedef struct predicted_port_t {
  1503. uint16_t port;
  1504. time_t time;
  1505. } predicted_port_t;
  1506. /** A list of port numbers that have been used recently. */
  1507. static smartlist_t *predicted_ports_list=NULL;
  1508. /** We just got an application request for a connection with
  1509. * port <b>port</b>. Remember it for the future, so we can keep
  1510. * some circuits open that will exit to this port.
  1511. */
  1512. static void
  1513. add_predicted_port(time_t now, uint16_t port)
  1514. {
  1515. predicted_port_t *pp = tor_malloc(sizeof(predicted_port_t));
  1516. pp->port = port;
  1517. pp->time = now;
  1518. rephist_total_alloc += sizeof(*pp);
  1519. smartlist_add(predicted_ports_list, pp);
  1520. }
  1521. /** Initialize whatever memory and structs are needed for predicting
  1522. * which ports will be used. Also seed it with port 80, so we'll build
  1523. * circuits on start-up.
  1524. */
  1525. static void
  1526. predicted_ports_init(void)
  1527. {
  1528. predicted_ports_list = smartlist_create();
  1529. add_predicted_port(time(NULL), 80); /* add one to kickstart us */
  1530. }
  1531. /** Free whatever memory is needed for predicting which ports will
  1532. * be used.
  1533. */
  1534. static void
  1535. predicted_ports_free(void)
  1536. {
  1537. rephist_total_alloc -=
  1538. smartlist_len(predicted_ports_list)*sizeof(predicted_port_t);
  1539. SMARTLIST_FOREACH(predicted_ports_list, predicted_port_t *, pp, tor_free(pp));
  1540. smartlist_free(predicted_ports_list);
  1541. }
  1542. /** Remember that <b>port</b> has been asked for as of time <b>now</b>.
  1543. * This is used for predicting what sorts of streams we'll make in the
  1544. * future and making exit circuits to anticipate that.
  1545. */
  1546. void
  1547. rep_hist_note_used_port(time_t now, uint16_t port)
  1548. {
  1549. tor_assert(predicted_ports_list);
  1550. if (!port) /* record nothing */
  1551. return;
  1552. SMARTLIST_FOREACH_BEGIN(predicted_ports_list, predicted_port_t *, pp) {
  1553. if (pp->port == port) {
  1554. pp->time = now;
  1555. return;
  1556. }
  1557. } SMARTLIST_FOREACH_END(pp);
  1558. /* it's not there yet; we need to add it */
  1559. add_predicted_port(now, port);
  1560. }
  1561. /** For this long after we've seen a request for a given port, assume that
  1562. * we'll want to make connections to the same port in the future. */
  1563. #define PREDICTED_CIRCS_RELEVANCE_TIME (60*60)
  1564. /** Return a newly allocated pointer to a list of uint16_t * for ports that
  1565. * are likely to be asked for in the near future.
  1566. */
  1567. smartlist_t *
  1568. rep_hist_get_predicted_ports(time_t now)
  1569. {
  1570. smartlist_t *out = smartlist_create();
  1571. tor_assert(predicted_ports_list);
  1572. /* clean out obsolete entries */
  1573. SMARTLIST_FOREACH_BEGIN(predicted_ports_list, predicted_port_t *, pp) {
  1574. if (pp->time + PREDICTED_CIRCS_RELEVANCE_TIME < now) {
  1575. log_debug(LD_CIRC, "Expiring predicted port %d", pp->port);
  1576. rephist_total_alloc -= sizeof(predicted_port_t);
  1577. tor_free(pp);
  1578. SMARTLIST_DEL_CURRENT(predicted_ports_list, pp);
  1579. } else {
  1580. smartlist_add(out, tor_memdup(&pp->port, sizeof(uint16_t)));
  1581. }
  1582. } SMARTLIST_FOREACH_END(pp);
  1583. return out;
  1584. }
  1585. /** The user asked us to do a resolve. Rather than keeping track of
  1586. * timings and such of resolves, we fake it for now by treating
  1587. * it the same way as a connection to port 80. This way we will continue
  1588. * to have circuits lying around if the user only uses Tor for resolves.
  1589. */
  1590. void
  1591. rep_hist_note_used_resolve(time_t now)
  1592. {
  1593. rep_hist_note_used_port(now, 80);
  1594. }
  1595. /** The last time at which we needed an internal circ. */
  1596. static time_t predicted_internal_time = 0;
  1597. /** The last time we needed an internal circ with good uptime. */
  1598. static time_t predicted_internal_uptime_time = 0;
  1599. /** The last time we needed an internal circ with good capacity. */
  1600. static time_t predicted_internal_capacity_time = 0;
  1601. /** Remember that we used an internal circ at time <b>now</b>. */
  1602. void
  1603. rep_hist_note_used_internal(time_t now, int need_uptime, int need_capacity)
  1604. {
  1605. predicted_internal_time = now;
  1606. if (need_uptime)
  1607. predicted_internal_uptime_time = now;
  1608. if (need_capacity)
  1609. predicted_internal_capacity_time = now;
  1610. }
  1611. /** Return 1 if we've used an internal circ recently; else return 0. */
  1612. int
  1613. rep_hist_get_predicted_internal(time_t now, int *need_uptime,
  1614. int *need_capacity)
  1615. {
  1616. if (!predicted_internal_time) { /* initialize it */
  1617. predicted_internal_time = now;
  1618. predicted_internal_uptime_time = now;
  1619. predicted_internal_capacity_time = now;
  1620. }
  1621. if (predicted_internal_time + PREDICTED_CIRCS_RELEVANCE_TIME < now)
  1622. return 0; /* too long ago */
  1623. if (predicted_internal_uptime_time + PREDICTED_CIRCS_RELEVANCE_TIME >= now)
  1624. *need_uptime = 1;
  1625. // Always predict that we need capacity.
  1626. *need_capacity = 1;
  1627. return 1;
  1628. }
  1629. /** Any ports used lately? These are pre-seeded if we just started
  1630. * up or if we're running a hidden service. */
  1631. int
  1632. any_predicted_circuits(time_t now)
  1633. {
  1634. return smartlist_len(predicted_ports_list) ||
  1635. predicted_internal_time + PREDICTED_CIRCS_RELEVANCE_TIME >= now;
  1636. }
  1637. /** Return 1 if we have no need for circuits currently, else return 0. */
  1638. int
  1639. rep_hist_circbuilding_dormant(time_t now)
  1640. {
  1641. if (any_predicted_circuits(now))
  1642. return 0;
  1643. /* see if we'll still need to build testing circuits */
  1644. if (server_mode(get_options()) &&
  1645. (!check_whether_orport_reachable() || !circuit_enough_testing_circs()))
  1646. return 0;
  1647. if (!check_whether_dirport_reachable())
  1648. return 0;
  1649. return 1;
  1650. }
  1651. /** Structure to track how many times we've done each public key operation. */
  1652. static struct {
  1653. /** How many directory objects have we signed? */
  1654. unsigned long n_signed_dir_objs;
  1655. /** How many routerdescs have we signed? */
  1656. unsigned long n_signed_routerdescs;
  1657. /** How many directory objects have we verified? */
  1658. unsigned long n_verified_dir_objs;
  1659. /** How many routerdescs have we verified */
  1660. unsigned long n_verified_routerdescs;
  1661. /** How many onionskins have we encrypted to build circuits? */
  1662. unsigned long n_onionskins_encrypted;
  1663. /** How many onionskins have we decrypted to do circuit build requests? */
  1664. unsigned long n_onionskins_decrypted;
  1665. /** How many times have we done the TLS handshake as a client? */
  1666. unsigned long n_tls_client_handshakes;
  1667. /** How many times have we done the TLS handshake as a server? */
  1668. unsigned long n_tls_server_handshakes;
  1669. /** How many PK operations have we done as a hidden service client? */
  1670. unsigned long n_rend_client_ops;
  1671. /** How many PK operations have we done as a hidden service midpoint? */
  1672. unsigned long n_rend_mid_ops;
  1673. /** How many PK operations have we done as a hidden service provider? */
  1674. unsigned long n_rend_server_ops;
  1675. } pk_op_counts = {0,0,0,0,0,0,0,0,0,0,0};
  1676. /** Increment the count of the number of times we've done <b>operation</b>. */
  1677. void
  1678. note_crypto_pk_op(pk_op_t operation)
  1679. {
  1680. switch (operation)
  1681. {
  1682. case SIGN_DIR:
  1683. pk_op_counts.n_signed_dir_objs++;
  1684. break;
  1685. case SIGN_RTR:
  1686. pk_op_counts.n_signed_routerdescs++;
  1687. break;
  1688. case VERIFY_DIR:
  1689. pk_op_counts.n_verified_dir_objs++;
  1690. break;
  1691. case VERIFY_RTR:
  1692. pk_op_counts.n_verified_routerdescs++;
  1693. break;
  1694. case ENC_ONIONSKIN:
  1695. pk_op_counts.n_onionskins_encrypted++;
  1696. break;
  1697. case DEC_ONIONSKIN:
  1698. pk_op_counts.n_onionskins_decrypted++;
  1699. break;
  1700. case TLS_HANDSHAKE_C:
  1701. pk_op_counts.n_tls_client_handshakes++;
  1702. break;
  1703. case TLS_HANDSHAKE_S:
  1704. pk_op_counts.n_tls_server_handshakes++;
  1705. break;
  1706. case REND_CLIENT:
  1707. pk_op_counts.n_rend_client_ops++;
  1708. break;
  1709. case REND_MID:
  1710. pk_op_counts.n_rend_mid_ops++;
  1711. break;
  1712. case REND_SERVER:
  1713. pk_op_counts.n_rend_server_ops++;
  1714. break;
  1715. default:
  1716. log_warn(LD_BUG, "Unknown pk operation %d", operation);
  1717. }
  1718. }
  1719. /** Log the number of times we've done each public/private-key operation. */
  1720. void
  1721. dump_pk_ops(int severity)
  1722. {
  1723. log(severity, LD_HIST,
  1724. "PK operations: %lu directory objects signed, "
  1725. "%lu directory objects verified, "
  1726. "%lu routerdescs signed, "
  1727. "%lu routerdescs verified, "
  1728. "%lu onionskins encrypted, "
  1729. "%lu onionskins decrypted, "
  1730. "%lu client-side TLS handshakes, "
  1731. "%lu server-side TLS handshakes, "
  1732. "%lu rendezvous client operations, "
  1733. "%lu rendezvous middle operations, "
  1734. "%lu rendezvous server operations.",
  1735. pk_op_counts.n_signed_dir_objs,
  1736. pk_op_counts.n_verified_dir_objs,
  1737. pk_op_counts.n_signed_routerdescs,
  1738. pk_op_counts.n_verified_routerdescs,
  1739. pk_op_counts.n_onionskins_encrypted,
  1740. pk_op_counts.n_onionskins_decrypted,
  1741. pk_op_counts.n_tls_client_handshakes,
  1742. pk_op_counts.n_tls_server_handshakes,
  1743. pk_op_counts.n_rend_client_ops,
  1744. pk_op_counts.n_rend_mid_ops,
  1745. pk_op_counts.n_rend_server_ops);
  1746. }
  1747. /*** Exit port statistics ***/
  1748. /* Some constants */
  1749. /** To what multiple should byte numbers be rounded up? */
  1750. #define EXIT_STATS_ROUND_UP_BYTES 1024
  1751. /** To what multiple should stream counts be rounded up? */
  1752. #define EXIT_STATS_ROUND_UP_STREAMS 4
  1753. /** Number of TCP ports */
  1754. #define EXIT_STATS_NUM_PORTS 65536
  1755. /** Top n ports that will be included in exit stats. */
  1756. #define EXIT_STATS_TOP_N_PORTS 10
  1757. /* The following data structures are arrays and no fancy smartlists or maps,
  1758. * so that all write operations can be done in constant time. This comes at
  1759. * the price of some memory (1.25 MB) and linear complexity when writing
  1760. * stats for measuring relays. */
  1761. /** Number of bytes read in current period by exit port */
  1762. static uint64_t *exit_bytes_read = NULL;
  1763. /** Number of bytes written in current period by exit port */
  1764. static uint64_t *exit_bytes_written = NULL;
  1765. /** Number of streams opened in current period by exit port */
  1766. static uint32_t *exit_streams = NULL;
  1767. /** Start time of exit stats or 0 if we're not collecting exit stats. */
  1768. static time_t start_of_exit_stats_interval;
  1769. /** Initialize exit port stats. */
  1770. void
  1771. rep_hist_exit_stats_init(time_t now)
  1772. {
  1773. start_of_exit_stats_interval = now;
  1774. exit_bytes_read = tor_malloc_zero(EXIT_STATS_NUM_PORTS *
  1775. sizeof(uint64_t));
  1776. exit_bytes_written = tor_malloc_zero(EXIT_STATS_NUM_PORTS *
  1777. sizeof(uint64_t));
  1778. exit_streams = tor_malloc_zero(EXIT_STATS_NUM_PORTS *
  1779. sizeof(uint32_t));
  1780. }
  1781. /** Reset counters for exit port statistics. */
  1782. void
  1783. rep_hist_reset_exit_stats(time_t now)
  1784. {
  1785. start_of_exit_stats_interval = now;
  1786. memset(exit_bytes_read, 0, EXIT_STATS_NUM_PORTS * sizeof(uint64_t));
  1787. memset(exit_bytes_written, 0, EXIT_STATS_NUM_PORTS * sizeof(uint64_t));
  1788. memset(exit_streams, 0, EXIT_STATS_NUM_PORTS * sizeof(uint32_t));
  1789. }
  1790. /** Stop collecting exit port stats in a way that we can re-start doing
  1791. * so in rep_hist_exit_stats_init(). */
  1792. void
  1793. rep_hist_exit_stats_term(void)
  1794. {
  1795. start_of_exit_stats_interval = 0;
  1796. tor_free(exit_bytes_read);
  1797. tor_free(exit_bytes_written);
  1798. tor_free(exit_streams);
  1799. }
  1800. /** Helper for qsort: compare two ints. */
  1801. static int
  1802. _compare_int(const void *x, const void *y) {
  1803. return (*(int*)x - *(int*)y);
  1804. }
  1805. /** Return a newly allocated string containing the exit port statistics
  1806. * until <b>now</b>, or NULL if we're not collecting exit stats. */
  1807. char *
  1808. rep_hist_format_exit_stats(time_t now)
  1809. {
  1810. int i, j, top_elements = 0, cur_min_idx = 0, cur_port;
  1811. uint64_t top_bytes[EXIT_STATS_TOP_N_PORTS];
  1812. int top_ports[EXIT_STATS_TOP_N_PORTS];
  1813. uint64_t cur_bytes = 0, other_read = 0, other_written = 0,
  1814. total_read = 0, total_written = 0;
  1815. uint32_t total_streams = 0, other_streams = 0;
  1816. char *buf;
  1817. smartlist_t *written_strings, *read_strings, *streams_strings;
  1818. char *written_string, *read_string, *streams_string;
  1819. char t[ISO_TIME_LEN+1];
  1820. char *result;
  1821. if (!start_of_exit_stats_interval)
  1822. return NULL; /* Not initialized. */
  1823. /* Go through all ports to find the n ports that saw most written and
  1824. * read bytes.
  1825. *
  1826. * Invariant: at the end of the loop for iteration i,
  1827. * total_read is the sum of all exit_bytes_read[0..i]
  1828. * total_written is the sum of all exit_bytes_written[0..i]
  1829. * total_stream is the sum of all exit_streams[0..i]
  1830. *
  1831. * top_elements = MAX(EXIT_STATS_TOP_N_PORTS,
  1832. * #{j | 0 <= j <= i && volume(i) > 0})
  1833. *
  1834. * For all 0 <= j < top_elements,
  1835. * top_bytes[j] > 0
  1836. * 0 <= top_ports[j] <= 65535
  1837. * top_bytes[j] = volume(top_ports[j])
  1838. *
  1839. * There is no j in 0..i and k in 0..top_elements such that:
  1840. * volume(j) > top_bytes[k] AND j is not in top_ports[0..top_elements]
  1841. *
  1842. * There is no j!=cur_min_idx in 0..top_elements such that:
  1843. * top_bytes[j] < top_bytes[cur_min_idx]
  1844. *
  1845. * where volume(x) == exit_bytes_read[x]+exit_bytes_written[x]
  1846. *
  1847. * Worst case: O(EXIT_STATS_NUM_PORTS * EXIT_STATS_TOP_N_PORTS)
  1848. */
  1849. for (i = 1; i < EXIT_STATS_NUM_PORTS; i++) {
  1850. total_read += exit_bytes_read[i];
  1851. total_written += exit_bytes_written[i];
  1852. total_streams += exit_streams[i];
  1853. cur_bytes = exit_bytes_read[i] + exit_bytes_written[i];
  1854. if (cur_bytes == 0) {
  1855. continue;
  1856. }
  1857. if (top_elements < EXIT_STATS_TOP_N_PORTS) {
  1858. top_bytes[top_elements] = cur_bytes;
  1859. top_ports[top_elements++] = i;
  1860. } else if (cur_bytes > top_bytes[cur_min_idx]) {
  1861. top_bytes[cur_min_idx] = cur_bytes;
  1862. top_ports[cur_min_idx] = i;
  1863. } else {
  1864. continue;
  1865. }
  1866. cur_min_idx = 0;
  1867. for (j = 1; j < top_elements; j++) {
  1868. if (top_bytes[j] < top_bytes[cur_min_idx]) {
  1869. cur_min_idx = j;
  1870. }
  1871. }
  1872. }
  1873. /* Add observations of top ports to smartlists. */
  1874. written_strings = smartlist_create();
  1875. read_strings = smartlist_create();
  1876. streams_strings = smartlist_create();
  1877. other_read = total_read;
  1878. other_written = total_written;
  1879. other_streams = total_streams;
  1880. /* Sort the ports; this puts them out of sync with top_bytes, but we
  1881. * won't be using top_bytes again anyway */
  1882. qsort(top_ports, top_elements, sizeof(int), _compare_int);
  1883. for (j = 0; j < top_elements; j++) {
  1884. cur_port = top_ports[j];
  1885. if (exit_bytes_written[cur_port] > 0) {
  1886. uint64_t num = round_uint64_to_next_multiple_of(
  1887. exit_bytes_written[cur_port],
  1888. EXIT_STATS_ROUND_UP_BYTES);
  1889. num /= 1024;
  1890. buf = NULL;
  1891. tor_asprintf(&buf, "%d="U64_FORMAT, cur_port, U64_PRINTF_ARG(num));
  1892. smartlist_add(written_strings, buf);
  1893. other_written -= exit_bytes_written[cur_port];
  1894. }
  1895. if (exit_bytes_read[cur_port] > 0) {
  1896. uint64_t num = round_uint64_to_next_multiple_of(
  1897. exit_bytes_read[cur_port],
  1898. EXIT_STATS_ROUND_UP_BYTES);
  1899. num /= 1024;
  1900. buf = NULL;
  1901. tor_asprintf(&buf, "%d="U64_FORMAT, cur_port, U64_PRINTF_ARG(num));
  1902. smartlist_add(read_strings, buf);
  1903. other_read -= exit_bytes_read[cur_port];
  1904. }
  1905. if (exit_streams[cur_port] > 0) {
  1906. uint32_t num = round_uint32_to_next_multiple_of(
  1907. exit_streams[cur_port],
  1908. EXIT_STATS_ROUND_UP_STREAMS);
  1909. buf = NULL;
  1910. tor_asprintf(&buf, "%d=%u", cur_port, num);
  1911. smartlist_add(streams_strings, buf);
  1912. other_streams -= exit_streams[cur_port];
  1913. }
  1914. }
  1915. /* Add observations of other ports in a single element. */
  1916. other_written = round_uint64_to_next_multiple_of(other_written,
  1917. EXIT_STATS_ROUND_UP_BYTES);
  1918. other_written /= 1024;
  1919. buf = NULL;
  1920. tor_asprintf(&buf, "other="U64_FORMAT, U64_PRINTF_ARG(other_written));
  1921. smartlist_add(written_strings, buf);
  1922. other_read = round_uint64_to_next_multiple_of(other_read,
  1923. EXIT_STATS_ROUND_UP_BYTES);
  1924. other_read /= 1024;
  1925. buf = NULL;
  1926. tor_asprintf(&buf, "other="U64_FORMAT, U64_PRINTF_ARG(other_read));
  1927. smartlist_add(read_strings, buf);
  1928. other_streams = round_uint32_to_next_multiple_of(other_streams,
  1929. EXIT_STATS_ROUND_UP_STREAMS);
  1930. buf = NULL;
  1931. tor_asprintf(&buf, "other=%u", other_streams);
  1932. smartlist_add(streams_strings, buf);
  1933. /* Join all observations in single strings. */
  1934. written_string = smartlist_join_strings(written_strings, ",", 0, NULL);
  1935. read_string = smartlist_join_strings(read_strings, ",", 0, NULL);
  1936. streams_string = smartlist_join_strings(streams_strings, ",", 0, NULL);
  1937. SMARTLIST_FOREACH(written_strings, char *, cp, tor_free(cp));
  1938. SMARTLIST_FOREACH(read_strings, char *, cp, tor_free(cp));
  1939. SMARTLIST_FOREACH(streams_strings, char *, cp, tor_free(cp));
  1940. smartlist_free(written_strings);
  1941. smartlist_free(read_strings);
  1942. smartlist_free(streams_strings);
  1943. /* Put everything together. */
  1944. format_iso_time(t, now);
  1945. tor_asprintf(&result, "exit-stats-end %s (%d s)\n"
  1946. "exit-kibibytes-written %s\n"
  1947. "exit-kibibytes-read %s\n"
  1948. "exit-streams-opened %s\n",
  1949. t, (unsigned) (now - start_of_exit_stats_interval),
  1950. written_string,
  1951. read_string,
  1952. streams_string);
  1953. tor_free(written_string);
  1954. tor_free(read_string);
  1955. tor_free(streams_string);
  1956. return result;
  1957. }
  1958. /** If 24 hours have passed since the beginning of the current exit port
  1959. * stats period, write exit stats to $DATADIR/stats/exit-stats (possibly
  1960. * overwriting an existing file) and reset counters. Return when we would
  1961. * next want to write exit stats or 0 if we never want to write. */
  1962. time_t
  1963. rep_hist_exit_stats_write(time_t now)
  1964. {
  1965. char *statsdir = NULL, *filename = NULL, *str = NULL;
  1966. if (!start_of_exit_stats_interval)
  1967. return 0; /* Not initialized. */
  1968. if (start_of_exit_stats_interval + WRITE_STATS_INTERVAL > now)
  1969. goto done; /* Not ready to write. */
  1970. log_info(LD_HIST, "Writing exit port statistics to disk.");
  1971. /* Generate history string. */
  1972. str = rep_hist_format_exit_stats(now);
  1973. /* Reset counters. */
  1974. rep_hist_reset_exit_stats(now);
  1975. /* Try to write to disk. */
  1976. statsdir = get_datadir_fname("stats");
  1977. if (check_private_dir(statsdir, CPD_CREATE) < 0) {
  1978. log_warn(LD_HIST, "Unable to create stats/ directory!");
  1979. goto done;
  1980. }
  1981. filename = get_datadir_fname2("stats", "exit-stats");
  1982. if (write_str_to_file(filename, str, 0) < 0)
  1983. log_warn(LD_HIST, "Unable to write exit port statistics to disk!");
  1984. done:
  1985. tor_free(str);
  1986. tor_free(statsdir);
  1987. tor_free(filename);
  1988. return start_of_exit_stats_interval + WRITE_STATS_INTERVAL;
  1989. }
  1990. /** Note that we wrote <b>num_written</b> bytes and read <b>num_read</b>
  1991. * bytes to/from an exit connection to <b>port</b>. */
  1992. void
  1993. rep_hist_note_exit_bytes(uint16_t port, size_t num_written,
  1994. size_t num_read)
  1995. {
  1996. if (!start_of_exit_stats_interval)
  1997. return; /* Not initialized. */
  1998. exit_bytes_written[port] += num_written;
  1999. exit_bytes_read[port] += num_read;
  2000. log_debug(LD_HIST, "Written %lu bytes and read %lu bytes to/from an "
  2001. "exit connection to port %d.",
  2002. (unsigned long)num_written, (unsigned long)num_read, port);
  2003. }
  2004. /** Note that we opened an exit stream to <b>port</b>. */
  2005. void
  2006. rep_hist_note_exit_stream_opened(uint16_t port)
  2007. {
  2008. if (!start_of_exit_stats_interval)
  2009. return; /* Not initialized. */
  2010. exit_streams[port]++;
  2011. log_debug(LD_HIST, "Opened exit stream to port %d", port);
  2012. }
  2013. /*** cell statistics ***/
  2014. /** Start of the current buffer stats interval or 0 if we're not
  2015. * collecting buffer statistics. */
  2016. static time_t start_of_buffer_stats_interval;
  2017. /** Initialize buffer stats. */
  2018. void
  2019. rep_hist_buffer_stats_init(time_t now)
  2020. {
  2021. start_of_buffer_stats_interval = now;
  2022. }
  2023. typedef struct circ_buffer_stats_t {
  2024. uint32_t processed_cells;
  2025. double mean_num_cells_in_queue;
  2026. double mean_time_cells_in_queue;
  2027. } circ_buffer_stats_t;
  2028. /** Holds stats. */
  2029. smartlist_t *circuits_for_buffer_stats = NULL;
  2030. /** Remember cell statistics for circuit <b>circ</b> at time
  2031. * <b>end_of_interval</b> and reset cell counters in case the circuit
  2032. * remains open in the next measurement interval. */
  2033. void
  2034. rep_hist_buffer_stats_add_circ(circuit_t *circ, time_t end_of_interval)
  2035. {
  2036. circ_buffer_stats_t *stat;
  2037. time_t start_of_interval;
  2038. int interval_length;
  2039. or_circuit_t *orcirc;
  2040. if (CIRCUIT_IS_ORIGIN(circ))
  2041. return;
  2042. orcirc = TO_OR_CIRCUIT(circ);
  2043. if (!orcirc->processed_cells)
  2044. return;
  2045. if (!circuits_for_buffer_stats)
  2046. circuits_for_buffer_stats = smartlist_create();
  2047. start_of_interval = (circ->timestamp_created.tv_sec >
  2048. start_of_buffer_stats_interval) ?
  2049. circ->timestamp_created.tv_sec :
  2050. start_of_buffer_stats_interval;
  2051. interval_length = (int) (end_of_interval - start_of_interval);
  2052. stat = tor_malloc_zero(sizeof(circ_buffer_stats_t));
  2053. stat->processed_cells = orcirc->processed_cells;
  2054. /* 1000.0 for s -> ms; 2.0 because of app-ward and exit-ward queues */
  2055. stat->mean_num_cells_in_queue = interval_length == 0 ? 0.0 :
  2056. (double) orcirc->total_cell_waiting_time /
  2057. (double) interval_length / 1000.0 / 2.0;
  2058. stat->mean_time_cells_in_queue =
  2059. (double) orcirc->total_cell_waiting_time /
  2060. (double) orcirc->processed_cells;
  2061. smartlist_add(circuits_for_buffer_stats, stat);
  2062. orcirc->total_cell_waiting_time = 0;
  2063. orcirc->processed_cells = 0;
  2064. }
  2065. /** Sorting helper: return -1, 1, or 0 based on comparison of two
  2066. * circ_buffer_stats_t */
  2067. static int
  2068. _buffer_stats_compare_entries(const void **_a, const void **_b)
  2069. {
  2070. const circ_buffer_stats_t *a = *_a, *b = *_b;
  2071. if (a->processed_cells < b->processed_cells)
  2072. return 1;
  2073. else if (a->processed_cells > b->processed_cells)
  2074. return -1;
  2075. else
  2076. return 0;
  2077. }
  2078. /** Stop collecting cell stats in a way that we can re-start doing so in
  2079. * rep_hist_buffer_stats_init(). */
  2080. void
  2081. rep_hist_buffer_stats_term(void)
  2082. {
  2083. start_of_buffer_stats_interval = 0;
  2084. if (!circuits_for_buffer_stats)
  2085. circuits_for_buffer_stats = smartlist_create();
  2086. SMARTLIST_FOREACH(circuits_for_buffer_stats, circ_buffer_stats_t *,
  2087. stat, tor_free(stat));
  2088. smartlist_clear(circuits_for_buffer_stats);
  2089. }
  2090. /** Write buffer statistics to $DATADIR/stats/buffer-stats and return when
  2091. * we would next want to write exit stats. */
  2092. time_t
  2093. rep_hist_buffer_stats_write(time_t now)
  2094. {
  2095. char *statsdir = NULL, *filename = NULL;
  2096. char written[ISO_TIME_LEN+1];
  2097. open_file_t *open_file = NULL;
  2098. FILE *out;
  2099. #define SHARES 10
  2100. int processed_cells[SHARES], circs_in_share[SHARES],
  2101. number_of_circuits, i;
  2102. double queued_cells[SHARES], time_in_queue[SHARES];
  2103. smartlist_t *str_build = smartlist_create();
  2104. char *str = NULL, *buf=NULL;
  2105. circuit_t *circ;
  2106. if (!start_of_buffer_stats_interval)
  2107. return 0; /* Not initialized. */
  2108. if (start_of_buffer_stats_interval + WRITE_STATS_INTERVAL > now)
  2109. goto done; /* Not ready to write */
  2110. /* add current circuits to stats */
  2111. for (circ = _circuit_get_global_list(); circ; circ = circ->next)
  2112. rep_hist_buffer_stats_add_circ(circ, now);
  2113. /* calculate deciles */
  2114. memset(processed_cells, 0, SHARES * sizeof(int));
  2115. memset(circs_in_share, 0, SHARES * sizeof(int));
  2116. memset(queued_cells, 0, SHARES * sizeof(double));
  2117. memset(time_in_queue, 0, SHARES * sizeof(double));
  2118. if (!circuits_for_buffer_stats)
  2119. circuits_for_buffer_stats = smartlist_create();
  2120. smartlist_sort(circuits_for_buffer_stats,
  2121. _buffer_stats_compare_entries);
  2122. number_of_circuits = smartlist_len(circuits_for_buffer_stats);
  2123. if (number_of_circuits < 1) {
  2124. log_info(LD_HIST, "Attempt to write cell statistics to disk failed. "
  2125. "We haven't seen a single circuit to report about.");
  2126. goto done;
  2127. }
  2128. i = 0;
  2129. SMARTLIST_FOREACH_BEGIN(circuits_for_buffer_stats,
  2130. circ_buffer_stats_t *, stat)
  2131. {
  2132. int share = i++ * SHARES / number_of_circuits;
  2133. processed_cells[share] += stat->processed_cells;
  2134. queued_cells[share] += stat->mean_num_cells_in_queue;
  2135. time_in_queue[share] += stat->mean_time_cells_in_queue;
  2136. circs_in_share[share]++;
  2137. }
  2138. SMARTLIST_FOREACH_END(stat);
  2139. /* clear buffer stats history */
  2140. SMARTLIST_FOREACH(circuits_for_buffer_stats, circ_buffer_stats_t *,
  2141. stat, tor_free(stat));
  2142. smartlist_clear(circuits_for_buffer_stats);
  2143. /* write to file */
  2144. statsdir = get_datadir_fname("stats");
  2145. if (check_private_dir(statsdir, CPD_CREATE) < 0)
  2146. goto done;
  2147. filename = get_datadir_fname2("stats", "buffer-stats");
  2148. out = start_writing_to_stdio_file(filename, OPEN_FLAGS_APPEND,
  2149. 0600, &open_file);
  2150. if (!out)
  2151. goto done;
  2152. format_iso_time(written, now);
  2153. if (fprintf(out, "cell-stats-end %s (%d s)\n", written,
  2154. (unsigned) (now - start_of_buffer_stats_interval)) < 0)
  2155. goto done;
  2156. for (i = 0; i < SHARES; i++) {
  2157. tor_asprintf(&buf,"%d", !circs_in_share[i] ? 0 :
  2158. processed_cells[i] / circs_in_share[i]);
  2159. smartlist_add(str_build, buf);
  2160. }
  2161. str = smartlist_join_strings(str_build, ",", 0, NULL);
  2162. if (fprintf(out, "cell-processed-cells %s\n", str) < 0)
  2163. goto done;
  2164. tor_free(str);
  2165. SMARTLIST_FOREACH(str_build, char *, c, tor_free(c));
  2166. smartlist_clear(str_build);
  2167. for (i = 0; i < SHARES; i++) {
  2168. tor_asprintf(&buf, "%.2f", circs_in_share[i] == 0 ? 0.0 :
  2169. queued_cells[i] / (double) circs_in_share[i]);
  2170. smartlist_add(str_build, buf);
  2171. }
  2172. str = smartlist_join_strings(str_build, ",", 0, NULL);
  2173. if (fprintf(out, "cell-queued-cells %s\n", str) < 0)
  2174. goto done;
  2175. tor_free(str);
  2176. SMARTLIST_FOREACH(str_build, char *, c, tor_free(c));
  2177. smartlist_clear(str_build);
  2178. for (i = 0; i < SHARES; i++) {
  2179. tor_asprintf(&buf, "%.0f", circs_in_share[i] == 0 ? 0.0 :
  2180. time_in_queue[i] / (double) circs_in_share[i]);
  2181. smartlist_add(str_build, buf);
  2182. }
  2183. str = smartlist_join_strings(str_build, ",", 0, NULL);
  2184. if (fprintf(out, "cell-time-in-queue %s\n", str) < 0)
  2185. goto done;
  2186. tor_free(str);
  2187. SMARTLIST_FOREACH(str_build, char *, c, tor_free(c));
  2188. smartlist_free(str_build);
  2189. str_build = NULL;
  2190. if (fprintf(out, "cell-circuits-per-decile %d\n",
  2191. (number_of_circuits + SHARES - 1) / SHARES) < 0)
  2192. goto done;
  2193. finish_writing_to_file(open_file);
  2194. open_file = NULL;
  2195. start_of_buffer_stats_interval = now;
  2196. done:
  2197. if (open_file)
  2198. abort_writing_to_file(open_file);
  2199. tor_free(filename);
  2200. tor_free(statsdir);
  2201. if (str_build) {
  2202. SMARTLIST_FOREACH(str_build, char *, c, tor_free(c));
  2203. smartlist_free(str_build);
  2204. }
  2205. tor_free(str);
  2206. #undef SHARES
  2207. return start_of_buffer_stats_interval + WRITE_STATS_INTERVAL;
  2208. }
  2209. /*** Connection statistics ***/
  2210. /** Start of the current connection stats interval or 0 if we're not
  2211. * collecting connection statistics. */
  2212. static time_t start_of_conn_stats_interval;
  2213. /** Initialize connection stats. */
  2214. void
  2215. rep_hist_conn_stats_init(time_t now)
  2216. {
  2217. start_of_conn_stats_interval = now;
  2218. }
  2219. /* Count connections that we read and wrote less than these many bytes
  2220. * from/to as below threshold. */
  2221. #define BIDI_THRESHOLD 20480
  2222. /* Count connections that we read or wrote at least this factor as many
  2223. * bytes from/to than we wrote or read to/from as mostly reading or
  2224. * writing. */
  2225. #define BIDI_FACTOR 10
  2226. /* Interval length in seconds for considering read and written bytes for
  2227. * connection stats. */
  2228. #define BIDI_INTERVAL 10
  2229. /* Start of next BIDI_INTERVAL second interval. */
  2230. static time_t bidi_next_interval = 0;
  2231. /* Number of connections that we read and wrote less than BIDI_THRESHOLD
  2232. * bytes from/to in BIDI_INTERVAL seconds. */
  2233. static uint32_t below_threshold = 0;
  2234. /* Number of connections that we read at least BIDI_FACTOR times more
  2235. * bytes from than we wrote to in BIDI_INTERVAL seconds. */
  2236. static uint32_t mostly_read = 0;
  2237. /* Number of connections that we wrote at least BIDI_FACTOR times more
  2238. * bytes to than we read from in BIDI_INTERVAL seconds. */
  2239. static uint32_t mostly_written = 0;
  2240. /* Number of connections that we read and wrote at least BIDI_THRESHOLD
  2241. * bytes from/to, but not BIDI_FACTOR times more in either direction in
  2242. * BIDI_INTERVAL seconds. */
  2243. static uint32_t both_read_and_written = 0;
  2244. /* Entry in a map from connection ID to the number of read and written
  2245. * bytes on this connection in a BIDI_INTERVAL second interval. */
  2246. typedef struct bidi_map_entry_t {
  2247. HT_ENTRY(bidi_map_entry_t) node;
  2248. uint64_t conn_id; /**< Connection ID */
  2249. size_t read; /**< Number of read bytes */
  2250. size_t written; /**< Number of written bytes */
  2251. } bidi_map_entry_t;
  2252. /** Map of OR connections together with the number of read and written
  2253. * bytes in the current BIDI_INTERVAL second interval. */
  2254. static HT_HEAD(bidimap, bidi_map_entry_t) bidi_map =
  2255. HT_INITIALIZER();
  2256. static int
  2257. bidi_map_ent_eq(const bidi_map_entry_t *a, const bidi_map_entry_t *b)
  2258. {
  2259. return a->conn_id == b->conn_id;
  2260. }
  2261. static unsigned
  2262. bidi_map_ent_hash(const bidi_map_entry_t *entry)
  2263. {
  2264. return (unsigned) entry->conn_id;
  2265. }
  2266. HT_PROTOTYPE(bidimap, bidi_map_entry_t, node, bidi_map_ent_hash,
  2267. bidi_map_ent_eq);
  2268. HT_GENERATE(bidimap, bidi_map_entry_t, node, bidi_map_ent_hash,
  2269. bidi_map_ent_eq, 0.6, malloc, realloc, free);
  2270. static void
  2271. bidi_map_free(void)
  2272. {
  2273. bidi_map_entry_t **ptr, **next, *ent;
  2274. for (ptr = HT_START(bidimap, &bidi_map); ptr; ptr = next) {
  2275. ent = *ptr;
  2276. next = HT_NEXT_RMV(bidimap, &bidi_map, ptr);
  2277. tor_free(ent);
  2278. }
  2279. HT_CLEAR(bidimap, &bidi_map);
  2280. }
  2281. /** Reset counters for conn statistics. */
  2282. void
  2283. rep_hist_reset_conn_stats(time_t now)
  2284. {
  2285. start_of_conn_stats_interval = now;
  2286. below_threshold = 0;
  2287. mostly_read = 0;
  2288. mostly_written = 0;
  2289. both_read_and_written = 0;
  2290. bidi_map_free();
  2291. }
  2292. /** Stop collecting connection stats in a way that we can re-start doing
  2293. * so in rep_hist_conn_stats_init(). */
  2294. void
  2295. rep_hist_conn_stats_term(void)
  2296. {
  2297. rep_hist_reset_conn_stats(0);
  2298. }
  2299. /** We read <b>num_read</b> bytes and wrote <b>num_written</b> from/to OR
  2300. * connection <b>conn_id</b> in second <b>when</b>. If this is the first
  2301. * observation in a new interval, sum up the last observations. Add bytes
  2302. * for this connection. */
  2303. void
  2304. rep_hist_note_or_conn_bytes(uint64_t conn_id, size_t num_read,
  2305. size_t num_written, time_t when)
  2306. {
  2307. if (!start_of_conn_stats_interval)
  2308. return;
  2309. /* Initialize */
  2310. if (bidi_next_interval == 0)
  2311. bidi_next_interval = when + BIDI_INTERVAL;
  2312. /* Sum up last period's statistics */
  2313. if (when >= bidi_next_interval) {
  2314. bidi_map_entry_t **ptr, **next, *ent;
  2315. for (ptr = HT_START(bidimap, &bidi_map); ptr; ptr = next) {
  2316. ent = *ptr;
  2317. if (ent->read + ent->written < BIDI_THRESHOLD)
  2318. below_threshold++;
  2319. else if (ent->read >= ent->written * BIDI_FACTOR)
  2320. mostly_read++;
  2321. else if (ent->written >= ent->read * BIDI_FACTOR)
  2322. mostly_written++;
  2323. else
  2324. both_read_and_written++;
  2325. next = HT_NEXT_RMV(bidimap, &bidi_map, ptr);
  2326. tor_free(ent);
  2327. }
  2328. while (when >= bidi_next_interval)
  2329. bidi_next_interval += BIDI_INTERVAL;
  2330. log_info(LD_GENERAL, "%d below threshold, %d mostly read, "
  2331. "%d mostly written, %d both read and written.",
  2332. below_threshold, mostly_read, mostly_written,
  2333. both_read_and_written);
  2334. }
  2335. /* Add this connection's bytes. */
  2336. if (num_read > 0 || num_written > 0) {
  2337. bidi_map_entry_t *entry, lookup;
  2338. lookup.conn_id = conn_id;
  2339. entry = HT_FIND(bidimap, &bidi_map, &lookup);
  2340. if (entry) {
  2341. entry->written += num_written;
  2342. entry->read += num_read;
  2343. } else {
  2344. entry = tor_malloc_zero(sizeof(bidi_map_entry_t));
  2345. entry->conn_id = conn_id;
  2346. entry->written = num_written;
  2347. entry->read = num_read;
  2348. HT_INSERT(bidimap, &bidi_map, entry);
  2349. }
  2350. }
  2351. }
  2352. /** Return a newly allocated string containing the connection statistics
  2353. * until <b>now</b>, or NULL if we're not collecting conn stats. */
  2354. char *
  2355. rep_hist_format_conn_stats(time_t now)
  2356. {
  2357. char *result, written[ISO_TIME_LEN+1];
  2358. if (!start_of_conn_stats_interval)
  2359. return NULL; /* Not initialized. */
  2360. format_iso_time(written, now);
  2361. tor_asprintf(&result, "conn-bi-direct %s (%d s) %d,%d,%d,%d\n",
  2362. written,
  2363. (unsigned) (now - start_of_conn_stats_interval),
  2364. below_threshold,
  2365. mostly_read,
  2366. mostly_written,
  2367. both_read_and_written);
  2368. return result;
  2369. }
  2370. /** If 24 hours have passed since the beginning of the current conn stats
  2371. * period, write conn stats to $DATADIR/stats/conn-stats (possibly
  2372. * overwriting an existing file) and reset counters. Return when we would
  2373. * next want to write conn stats or 0 if we never want to write. */
  2374. time_t
  2375. rep_hist_conn_stats_write(time_t now)
  2376. {
  2377. char *statsdir = NULL, *filename = NULL, *str = NULL;
  2378. if (!start_of_conn_stats_interval)
  2379. return 0; /* Not initialized. */
  2380. if (start_of_conn_stats_interval + WRITE_STATS_INTERVAL > now)
  2381. goto done; /* Not ready to write */
  2382. /* Generate history string. */
  2383. str = rep_hist_format_conn_stats(now);
  2384. /* Reset counters. */
  2385. rep_hist_reset_conn_stats(now);
  2386. /* Try to write to disk. */
  2387. statsdir = get_datadir_fname("stats");
  2388. if (check_private_dir(statsdir, CPD_CREATE) < 0) {
  2389. log_warn(LD_HIST, "Unable to create stats/ directory!");
  2390. goto done;
  2391. }
  2392. filename = get_datadir_fname2("stats", "conn-stats");
  2393. if (write_str_to_file(filename, str, 0) < 0)
  2394. log_warn(LD_HIST, "Unable to write conn stats to disk!");
  2395. done:
  2396. tor_free(str);
  2397. tor_free(filename);
  2398. tor_free(statsdir);
  2399. return start_of_conn_stats_interval + WRITE_STATS_INTERVAL;
  2400. }
  2401. /** Free all storage held by the OR/link history caches, by the
  2402. * bandwidth history arrays, by the port history, or by statistics . */
  2403. void
  2404. rep_hist_free_all(void)
  2405. {
  2406. digestmap_free(history_map, free_or_history);
  2407. tor_free(read_array);
  2408. tor_free(write_array);
  2409. tor_free(last_stability_doc);
  2410. tor_free(exit_bytes_read);
  2411. tor_free(exit_bytes_written);
  2412. tor_free(exit_streams);
  2413. built_last_stability_doc_at = 0;
  2414. predicted_ports_free();
  2415. bidi_map_free();
  2416. }