int main (int argc, char** argv) {
// parse the program arguments
options in_options = options();
CHECK(parse_arguments(argc, argv, in_options));
// parse the input graph
std::unordered_map<uint64_t,cell> graph;
CHECK(parse_graph(in_options, graph));
//CHECK(validate_parser(in_options, graph));
// factor the number of partitions
std::vector<uint64_t> factors(0);
CHECK(factor(in_options, factors));
CHECK(validate_factors(in_options, factors));
// partition!
CHECK(partition(in_options, graph, factors));
// write partitions
CHECK(write_partitions(in_options, graph));
CHECK(do_cleanup(graph));
return 0;
}
t_buffer *stock_list_cours(t_server *s_info, char *buffer, int n)
{
t_buffer *tmp;
t_buffer *ele;
if (socket_com[n].socket == s_info->graph)
parse_graph(s_info, buffer);
else
{
if ((tmp = malloc(sizeof(t_buffer))) == NULL)
my_perror("allocation problem\n");
tmp->id = n;
tmp->buffer = strdup(buffer);
tmp->end = (float)clock() + definetim(buffer, s_info) * 100;
tmp->prev = NULL;
tmp->next = NULL;
if (s_info->list == NULL)
return (tmp);
else
{
ele = stock_list_second(tmp, s_info->list);
return (ele);
}
}
}
void handler_s(t_server *s_info, char *buffer, int n) {
int (*tab_handler[7])(char **, t_server *, int);
char **cmd;
int i;
verif_egg(s_info);
if (strlen(buffer) != 0)
{
my_cutn(buffer, '\n');
dprintf(1, "\t\t\tReceiving message from %d : %s\n"
, socket_com[n].socket, buffer);
if (socket_com[n].team == NULL)
{
if (handl_team(buffer, s_info, n) == 0)
{
dprintf(socket_com[n].socket, "ko\n");
close(socket_com[n].socket);
dprintf(1, "***Deleting player %d\n", socket_com[n].socket);
socket_com[n].socket = 0;
}
}
else if (strcmp(socket_com[n].team, "GRAPHIC") == 0)
parse_graph(s_info, buffer, n);
else
verif_cours(s_info, buffer, n);
}
}
