/* * Copyright (C) 2017 Ortega Froysa, Nicolás * Author: Ortega Froysa, Nicolás * * This program is free software: you can redistribute it and/or * modify it under the terms of the GNU Lesser 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 * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this program. If not, see * . */ #include "nodes.h" #include #include struct node { // The address of the node char *address; unsigned short port; // Whether or not it is a directory node/server int directory; // Useful variables for passing on connections of new nodes unsigned int connections; unsigned int max_connections; }; // List of nodes static struct node *node_list; // Maximum number of nodes static unsigned int node_max; // Number of nodes in the list static unsigned int node_count; int init_nodes(unsigned int max_nodes) { node_list = calloc(max_nodes, sizeof(struct node)); if(!node_list) return 0; node_max = max_nodes; node_count = 0; return 1; } int resize_node_list(unsigned int new_max_nodes) { if(new_max_nodes <= node_max) return 0; void* tmp_list = realloc(node_list, new_max_nodes * sizeof(struct node)); if(!tmp_list) return 0; node_list = tmp_list; return 1; } unsigned int get_node_max() { return node_max; } unsigned int get_node_count() { return node_count; } int add_node(char *addr, unsigned short port) { if(node_count >= node_max) return 0; for(unsigned int i = 0; i < node_count; ++i) { if(strcmp(node_list[i].address, addr) == 0 && node_list[i].port == port) return 1; } node_list[node_count].address = addr; node_list[node_count].port = port; node_list[node_count].directory = 0; node_list[node_count].connections = 0; node_list[node_count].max_connections = 0; node_count++; return 1; }