RumorMill.h 1.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142
  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. #ifndef RumorMill_H
  16. #define RumorMill_H
  17. #include "dht/Address.h"
  18. #include "memory/Allocator.h"
  19. #include "util/Linker.h"
  20. Linker_require("dht/dhtcore/RumorMill.c")
  21. /**
  22. * The rumor mill is for new nodes which have been discovered by search and getPeers requests
  23. * but we have never actually communicated with them so we are not sure if they exist.
  24. *
  25. * More importantly, we *cannot* link them into the nodeStore tree because we are not sure of
  26. * their encoding scheme.
  27. */
  28. struct RumorMill
  29. {
  30. int count;
  31. int capacity;
  32. };
  33. void RumorMill_addNode(struct RumorMill* mill, struct Address* addr);
  34. bool RumorMill_getNode(struct RumorMill* mill, struct Address* output);
  35. struct RumorMill* RumorMill_new(struct Allocator* alloc, struct Address* selfAddr, int capacity);
  36. #endif