dircollate.c 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122
  1. /* Copyright (c) 2001-2004, Roger Dingledine.
  2. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  3. * Copyright (c) 2007-2014, The Tor Project, Inc. */
  4. /* See LICENSE for licensing information */
  5. /**
  6. * \file dircollate.c
  7. *
  8. * \brief Collation code for figuring out which identities to vote for in
  9. * the directory voting process.
  10. */
  11. #define DIRCOLLATE_PRIVATE
  12. #include "dircollate.h"
  13. static void dircollator_collate_by_rsa(dircollator_t *dc);
  14. static void
  15. dircollator_add_routerstatus(dircollator_t *dc,
  16. int vote_num,
  17. networkstatus_t *vote,
  18. vote_routerstatus_t *vrs)
  19. {
  20. const char *id = vrs->status.identity_digest;
  21. (void) vote;
  22. vote_routerstatus_t **vrs_lst = digestmap_get(dc->by_rsa_sha1, id);
  23. if (NULL == vrs_lst) {
  24. vrs_lst = tor_calloc(sizeof(vote_routerstatus_t *), dc->n_votes);
  25. digestmap_set(dc->by_rsa_sha1, id, vrs_lst);
  26. }
  27. tor_assert(vrs_lst[vote_num] == NULL);
  28. vrs_lst[vote_num] = vrs;
  29. }
  30. dircollator_t *
  31. dircollator_new(int n_votes, int n_authorities)
  32. {
  33. dircollator_t *dc = tor_malloc_zero(sizeof(dircollator_t));
  34. tor_assert(n_votes <= n_authorities);
  35. dc->n_votes = n_votes;
  36. dc->n_authorities = n_authorities;
  37. dc->by_rsa_sha1 = digestmap_new();
  38. return dc;
  39. }
  40. void
  41. dircollator_free(dircollator_t *dc)
  42. {
  43. if (!dc)
  44. return;
  45. digestmap_free(dc->by_rsa_sha1, tor_free_);
  46. tor_free(dc);
  47. }
  48. void
  49. dircollator_add_vote(dircollator_t *dc, networkstatus_t *v)
  50. {
  51. tor_assert(v->type == NS_TYPE_VOTE);
  52. tor_assert(dc->next_vote_num < dc->n_votes);
  53. tor_assert(!dc->is_collated);
  54. const int votenum = dc->next_vote_num++;
  55. SMARTLIST_FOREACH_BEGIN(v->routerstatus_list, vote_routerstatus_t *, vrs) {
  56. dircollator_add_routerstatus(dc, votenum, v, vrs);
  57. } SMARTLIST_FOREACH_END(vrs);
  58. }
  59. void
  60. dircollator_collate(dircollator_t *dc)
  61. {
  62. dircollator_collate_by_rsa(dc);
  63. }
  64. static void
  65. dircollator_collate_by_rsa(dircollator_t *dc)
  66. {
  67. tor_assert(!dc->is_collated);
  68. dc->all_rsa_sha1_lst = smartlist_new();
  69. const int total_authorities = dc->n_authorities;
  70. DIGESTMAP_FOREACH(dc->by_rsa_sha1, k, vote_routerstatus_t **, vrs_lst) {
  71. int n = 0, i;
  72. for (i = 0; i < dc->n_votes; ++i) {
  73. if (vrs_lst[i] != NULL)
  74. ++n;
  75. }
  76. if (n <= total_authorities / 2)
  77. continue;
  78. smartlist_add(dc->all_rsa_sha1_lst, (char *)k);
  79. } DIGESTMAP_FOREACH_END;
  80. smartlist_sort_digests(dc->all_rsa_sha1_lst);
  81. dc->is_collated = 1;
  82. }
  83. int
  84. dircollator_n_routers(dircollator_t *dc)
  85. {
  86. return smartlist_len(dc->all_rsa_sha1_lst);
  87. }
  88. vote_routerstatus_t **
  89. dircollator_get_votes_for_router(dircollator_t *dc, int idx)
  90. {
  91. tor_assert(idx < smartlist_len(dc->all_rsa_sha1_lst));
  92. return digestmap_get(dc->by_rsa_sha1,
  93. smartlist_get(dc->all_rsa_sha1_lst, idx));
  94. }