/* vim: set expandtab ts=4 sw=4: */ /* * You may redistribute this program and/or modify it under the terms of * the GNU General Public License as published by the Free Software Foundation, * either version 3 of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . */ #include "dht/dhtcore/Node.h" #include "switch/EncodingScheme.h" #include "util/Assert.h" #include "util/Bits.h" void Node_setReach(struct Node_Two* node, uint32_t newReach) { if (newReach) { Assert_true(Node_getBestParent(node)); Assert_true(node->address.path < UINT64_MAX); } else { Assert_true(!Node_getBestParent(node)); Assert_true(node->address.path == UINT64_MAX); } node->reach_pvt = newReach; } void Node_setParentReachAndPath(struct Node_Two* node, struct Node_Link* bestParent, uint32_t reach, uint64_t path) { if (bestParent) { Assert_true(bestParent->child == node); Assert_true(reach); Assert_true(path != UINT64_MAX); // make an exception for the self-node if (Node_getReach(bestParent->parent) <= reach) { Assert_true(bestParent->parent == node); Assert_true(reach == UINT32_MAX); Assert_true(path == 1); } } else { Assert_true(!reach); Assert_true(path == UINT64_MAX); } node->bestParent_pvt = bestParent; node->reach_pvt = reach; node->address.path = path; } bool Node_isOneHopLink(struct Node_Link* link) { struct EncodingScheme* ps = link->parent->encodingScheme; int num = EncodingScheme_getFormNum(ps, link->cannonicalLabel); Assert_true(num > -1 && num < ps->count); return EncodingScheme_formSize(&ps->forms[num]) == Bits_log2x64(link->cannonicalLabel); }