srvrec.cc 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197
  1. // -*- mode: cpp; mode: fold -*-
  2. // Description /*{{{*/
  3. /* ######################################################################
  4. SRV record support
  5. ##################################################################### */
  6. /*}}}*/
  7. #include <config.h>
  8. #include <netdb.h>
  9. #include <netinet/in.h>
  10. #include <arpa/nameser.h>
  11. #include <resolv.h>
  12. #include <chrono>
  13. #include <algorithm>
  14. #include <apt-pkg/configuration.h>
  15. #include <apt-pkg/error.h>
  16. #include <apt-pkg/strutl.h>
  17. #include "srvrec.h"
  18. bool GetSrvRecords(std::string host, int port, std::vector<SrvRec> &Result)
  19. {
  20. std::string target;
  21. struct servent *s_ent = getservbyport(htons(port), "tcp");
  22. if (s_ent == NULL)
  23. return false;
  24. strprintf(target, "_%s._tcp.%s", s_ent->s_name, host.c_str());
  25. return GetSrvRecords(target, Result);
  26. }
  27. bool GetSrvRecords(std::string name, std::vector<SrvRec> &Result)
  28. {
  29. unsigned char answer[PACKETSZ];
  30. int answer_len, compressed_name_len;
  31. int answer_count;
  32. if (res_init() != 0)
  33. return _error->Errno("res_init", "Failed to init resolver");
  34. answer_len = res_query(name.c_str(), C_IN, T_SRV, answer, sizeof(answer));
  35. if (answer_len == -1)
  36. return false;
  37. if (answer_len < (int)sizeof(HEADER))
  38. return _error->Warning("Not enough data from res_query (%i)", answer_len);
  39. // check the header
  40. HEADER *header = (HEADER*)answer;
  41. if (header->rcode != NOERROR)
  42. return _error->Warning("res_query returned rcode %i", header->rcode);
  43. answer_count = ntohs(header->ancount);
  44. if (answer_count <= 0)
  45. return _error->Warning("res_query returned no answers (%i) ", answer_count);
  46. // skip the header
  47. compressed_name_len = dn_skipname(answer+sizeof(HEADER), answer+answer_len);
  48. if(compressed_name_len < 0)
  49. return _error->Warning("dn_skipname failed %i", compressed_name_len);
  50. // pt points to the first answer record, go over all of them now
  51. unsigned char *pt = answer+sizeof(HEADER)+compressed_name_len+QFIXEDSZ;
  52. while ((int)Result.size() < answer_count && pt < answer+answer_len)
  53. {
  54. SrvRec rec;
  55. u_int16_t type, klass, priority, weight, port, dlen;
  56. char buf[MAXDNAME];
  57. compressed_name_len = dn_skipname(pt, answer+answer_len);
  58. if (compressed_name_len < 0)
  59. return _error->Warning("dn_skipname failed (2): %i",
  60. compressed_name_len);
  61. pt += compressed_name_len;
  62. if (((answer+answer_len) - pt) < 16)
  63. return _error->Warning("packet too short");
  64. // extract the data out of the result buffer
  65. #define extract_u16(target, p) target = *p++ << 8; target |= *p++;
  66. extract_u16(type, pt);
  67. if(type != T_SRV)
  68. return _error->Warning("Unexpected type excepted %x != %x",
  69. T_SRV, type);
  70. extract_u16(klass, pt);
  71. if(klass != C_IN)
  72. return _error->Warning("Unexpected class excepted %x != %x",
  73. C_IN, klass);
  74. pt += 4; // ttl
  75. extract_u16(dlen, pt);
  76. extract_u16(priority, pt);
  77. extract_u16(weight, pt);
  78. extract_u16(port, pt);
  79. #undef extract_u16
  80. compressed_name_len = dn_expand(answer, answer+answer_len, pt, buf, sizeof(buf));
  81. if(compressed_name_len < 0)
  82. return _error->Warning("dn_expand failed %i", compressed_name_len);
  83. pt += compressed_name_len;
  84. // add it to our class
  85. rec.priority = priority;
  86. rec.weight = weight;
  87. rec.port = port;
  88. rec.target = buf;
  89. Result.push_back(rec);
  90. }
  91. // implement load balancing as specified in RFC-2782
  92. // sort them by priority
  93. std::stable_sort(Result.begin(), Result.end());
  94. for(std::vector<SrvRec>::iterator I = Result.begin();
  95. I != Result.end(); ++I)
  96. {
  97. if (_config->FindB("Debug::Acquire::SrvRecs", false) == true)
  98. {
  99. std::cerr << "SrvRecs: got " << I->target
  100. << " prio: " << I->priority
  101. << " weight: " << I->weight
  102. << std::endl;
  103. }
  104. }
  105. return true;
  106. }
  107. SrvRec PopFromSrvRecs(std::vector<SrvRec> &Recs)
  108. {
  109. // FIXME: instead of the simplistic shuffle below use the algorithm
  110. // described in rfc2782 (with weights)
  111. // and figure out how the weights need to be adjusted if
  112. // a host refuses connections
  113. #if 0 // all code below is only needed for the weight adjusted selection
  114. // assign random number ranges
  115. int prev_weight = 0;
  116. int prev_priority = 0;
  117. for(std::vector<SrvRec>::iterator I = Result.begin();
  118. I != Result.end(); ++I)
  119. {
  120. if(prev_priority != I->priority)
  121. prev_weight = 0;
  122. I->random_number_range_start = prev_weight;
  123. I->random_number_range_end = prev_weight + I->weight;
  124. prev_weight = I->random_number_range_end;
  125. prev_priority = I->priority;
  126. if (_config->FindB("Debug::Acquire::SrvRecs", false) == true)
  127. std::cerr << "SrvRecs: got " << I->target
  128. << " prio: " << I->priority
  129. << " weight: " << I->weight
  130. << std::endl;
  131. }
  132. // go over the code in reverse order and note the max random range
  133. int max = 0;
  134. prev_priority = 0;
  135. for(std::vector<SrvRec>::iterator I = Result.end();
  136. I != Result.begin(); --I)
  137. {
  138. if(prev_priority != I->priority)
  139. max = I->random_number_range_end;
  140. I->random_number_range_max = max;
  141. }
  142. #endif
  143. // shuffle in a very simplistic way for now (equal weights)
  144. std::vector<SrvRec>::iterator I, J;
  145. I = J = Recs.begin();
  146. for(;I != Recs.end(); ++I)
  147. {
  148. if(I->priority != J->priority)
  149. break;
  150. }
  151. // FIXME: meeeeh, where to init this properly
  152. unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
  153. std::shuffle(J, I, std::default_random_engine(seed));
  154. // meh, no pop_front() in std::vector?
  155. SrvRec selected = *Recs.begin();
  156. Recs.erase(Recs.begin());
  157. if (_config->FindB("Debug::Acquire::SrvRecs", false) == true)
  158. std::cerr << "PopFromSrvRecs: selecting " << selected.target << std::endl;
  159. return selected;
  160. }