RumorMill.h 2.0 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
  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 <https://www.gnu.org/licenses/>.
  14. */
  15. #ifndef RumorMill_H
  16. #define RumorMill_H
  17. #ifdef SUBNODE
  18. #error "this file should not be included in subnode"
  19. #endif
  20. #include "dht/Address.h"
  21. #include "memory/Allocator.h"
  22. #include "util/log/Log.h"
  23. #include "util/Gcc.h"
  24. #include "util/Linker.h"
  25. Linker_require("dht/dhtcore/RumorMill.c");
  26. /**
  27. * The rumor mill is for new nodes which have been discovered by search and getPeers requests
  28. * but we have never actually communicated with them so we are not sure if they exist.
  29. *
  30. * More importantly, we *cannot* link them into the nodeStore tree because we are not sure of
  31. * their encoding scheme.
  32. */
  33. struct RumorMill
  34. {
  35. struct Address* addresses;
  36. int count;
  37. const char* name;
  38. };
  39. void RumorMill__addNode(struct RumorMill* mill, struct Address* addr, const char* file, int line);
  40. #define RumorMill_addNode(mill, addr) RumorMill__addNode((mill), (addr), Gcc_FILE, Gcc_LINE)
  41. bool RumorMill_getNode(struct RumorMill* mill, struct Address* output);
  42. /**
  43. * Create a new RumorMill.
  44. *
  45. * The name parameter is used for logging and must be a string constant which will outlive the
  46. * life of the mill.
  47. */
  48. struct RumorMill* RumorMill_new(struct Allocator* allocator,
  49. struct Address* selfAddr,
  50. int capacity,
  51. struct Log* log,
  52. const char* name);
  53. #endif