Node.c 2.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263
  1. /* vim: set expandtab ts=4 sw=4: */
  2. /*
  3. * You may redistribute this program and/or modify it under the terms of
  4. * the GNU General Public License as published by the Free Software Foundation,
  5. * either version 3 of the License, or (at your option) any later version.
  6. *
  7. * This program is distributed in the hope that it will be useful,
  8. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. * GNU General Public License for more details.
  11. *
  12. * You should have received a copy of the GNU General Public License
  13. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  14. */
  15. #include "dht/dhtcore/Node.h"
  16. #include "switch/EncodingScheme.h"
  17. #include "util/Assert.h"
  18. #include "util/Bits.h"
  19. void Node_setReach(struct Node_Two* node, uint32_t newReach)
  20. {
  21. if (newReach) {
  22. Assert_true(Node_getBestParent(node));
  23. Assert_true(node->address.path < UINT64_MAX);
  24. } else {
  25. Assert_true(!Node_getBestParent(node));
  26. Assert_true(node->address.path == UINT64_MAX);
  27. }
  28. node->reach_pvt = newReach;
  29. }
  30. void Node_setParentReachAndPath(struct Node_Two* node,
  31. struct Node_Link* bestParent,
  32. uint32_t reach,
  33. uint64_t path)
  34. {
  35. if (bestParent) {
  36. Assert_true(bestParent->child == node);
  37. Assert_true(reach);
  38. Assert_true(path != UINT64_MAX);
  39. // make an exception for the self-node
  40. if (Node_getReach(bestParent->parent) <= reach) {
  41. Assert_true(bestParent->parent == node);
  42. Assert_true(reach == UINT32_MAX);
  43. Assert_true(path == 1);
  44. }
  45. } else {
  46. Assert_true(!reach);
  47. Assert_true(path == UINT64_MAX);
  48. }
  49. node->bestParent_pvt = bestParent;
  50. node->reach_pvt = reach;
  51. node->address.path = path;
  52. }
  53. bool Node_isOneHopLink(struct Node_Link* link)
  54. {
  55. struct EncodingScheme* ps = link->parent->encodingScheme;
  56. int num = EncodingScheme_getFormNum(ps, link->cannonicalLabel);
  57. Assert_true(num > -1 && num < ps->count);
  58. return EncodingScheme_formSize(&ps->forms[num]) == Bits_log2x64(link->cannonicalLabel);
  59. }