-
Notifications
You must be signed in to change notification settings - Fork 0
/
utils.c
273 lines (260 loc) · 10.4 KB
/
utils.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
#include "utils.h"
void disp_header()
{
printf(IST "┌─Projecto─de─Redes─de─Computadores─e─Internet─────────────┐\n");
printf("│" RESET "Base de Dados em Anel com Cordas Ano Letivo 21/22 " IST "│\n");
printf("│ │\n");
printf("│" RESET "Autores: " IST "│\n");
printf("│" RESET " •Gonçalo Midões -------------------------- ist196219 " IST "│\n");
printf("│" RESET " •Ravi Regalo ----------------------------- ist196305 " IST "│\n");
printf("└──────────────────────────────────────────────────────────┘\n\n" RESET);
}
void command_list(int i, char *ip, char *port)
{
printf(IST "┌─Node─Information─and─Command─List───────────────────────────────────────────────────┐\n");
printf("│" RESET "\E[1m New node created with:\E[87G\E[0m" IST "│\n");
printf("│" RESET " ~Key: " GRN "%d\E[87G" IST "│\n", i);
printf("│" RESET " ~IP: " GRN "%s\E[87G" IST "│\n", ip);
printf("│" RESET " ~Port: " GRN "%s\E[87G" IST "│\n", port);
printf("│\E[87G│\n");
printf("│" RESET "\E[1m Command List:\E[87G\E[0m" IST "│\n");
printf("│" RESET " (Every command can also be called by its initial only)\E[87G" IST "│\n");
printf("│\E[87G│\n");
printf("│" YLW " new\E[87G" IST "│\n");
printf("│" RESET " -Creates a new ring containing only this node;\E[87G" IST "│\n");
printf("│\E[87G│\n");
printf("│" YLW " bentry" ORG " boot boot.IP boot.port\E[87G" IST "│\n");
printf("│" RESET " -Entry of this node on " ORG "boot" RESET "'s node ring without knowing its predecessor;\E[87G" IST "│\n");
printf("│\E[87G│\n");
printf("│" YLW " pentry" ORG " pred pred.IP pred.port\E[87G" IST "│\n");
printf("│" RESET " -Entry of this node on " ORG "pred" RESET "'s node ring using " ORG "pred" RESET " as its predecessor;\E[87G" IST "│\n");
printf("│\E[87G│\n");
printf("│" YLW " chord" ORG " i i.IP i.port\E[87G" IST "│\n");
printf("│" RESET " -Creation of a shortcut to node " ORG "i" RESET " (each node can only have one shortcut);\E[87G" IST "│\n");
printf("│\E[87G│\n");
printf("│" YLW " echord\E[87G" IST "│\n");
printf("│" RESET " -Deletion of current shortcut;\E[87G" IST "│\n");
printf("│\E[87G│\n");
printf("│" YLW " show\E[87G" IST "│\n");
printf("│" RESET " -Shows current information of node. This information is divided in 4 parts:\E[87G" IST "│\n");
printf("│\E[87G│\n");
printf("│" RESET " (i) Key, IP Address, Port;\E[87G" IST "│\n");
printf("│" RESET " (ii) Key, IP Address, Port of node sucessor;\E[87G" IST "│\n");
printf("│" RESET " (iii) Key, IP Address, Port of node predecessor;\E[87G" IST "│\n");
printf("│" RESET " (iv) Key, IP Address, Port of node shortcut;\E[87G" IST "│\n");
printf("│\E[87G│\n");
printf("│" YLW " find " ORG "k\E[87G" IST "│\n");
printf("│" RESET " -Searches for the key " ORG "k" RESET " on the ring returning it's key, IP\E[87G" IST "│\n");
printf("│" RESET " address, and port;\E[87G" IST "│\n");
printf("│\E[87G│\n");
printf("│" YLW " leave\E[87G" IST "│\n");
printf("│" RESET " -Exit of this node from current ring;\E[87G" IST "│\n");
printf("│\E[87G│\n");
printf("│" YLW " exit\E[87G" IST "│\n");
printf("│" RESET " -Closes aplication; \E[87G" IST "│\n");
printf("│" GRAY " (The abriviation of this command only works if there is currently no shortcut)\E[87G" IST "│\n");
// printf("│" GRAY " " IST "│\n");
printf("└─────────────────────────────────────────────────────────────────────────────────────┘\n" RESET);
return;
}
void log_info(char *str, char *mode)
{
if (disp_info)
{
if (strcmp(mode, "TCPin") == 0)
printf(GRN START "[->][TCP] %s" RESET, str);
if (strcmp(mode, "TCPout") == 0)
printf(GRN START "[<-][TCP] %s" RESET, str);
if (strcmp(mode, "UDPin") == 0)
printf(GRN START "[->][UDP] %s \n" RESET, str);
if (strcmp(mode, "UDPout") == 0)
printf(GRN START "[<-][UDP] %s \n" RESET, str);
if (strcmp(mode, "") == 0)
printf(GRN START "[INFO] %s \n" RESET, str);
}
}
void verbose(char *str)
{
if (verb == 1)
printf(YLW "%s\n" RESET, str);
}
void clean_args(char **args, int size)
{
for (int i = 0; i < 6; i++)
memset(args[i], '\0', size);
}
// calculates the distance from node/key i to node/key j
int dist(int i, int j)
{
return j - i < 0 ? j - i + 32 : j - i;
}
//
int check_dist(Node_struct *node, int key)
{
int dist_self = dist(node->self_i, key);
int dist_succ = node->succ_i != -1 ? dist(node->succ_i, key) : 100;
int dist_chord = node->chord_i != -1 ? dist(node->chord_i, key) : 100; // if there is no chord distance is infinite
if (dist_self < dist_succ && dist_self < dist_chord)
return 0;
else if (dist_succ < dist_chord)
return 1;
else if (dist_chord < dist_succ)
return 2;
return -1;
}
// prompts user for a command (and its args) and returns the number of args read
int get_command(char **args)
{
char buffer[BUFFER_SIZE];
clean_args(args, BUFFER_SIZE);
fgets(buffer, BUFFER_SIZE, stdin);
return sscanf(buffer, "%s %s %s %s %s", args[0], args[1], args[2], args[3], args[4]);
}
// checks if a command is valid
int check_command(char **args, int num_read, Node_struct *node)
{
if (strcmp(args[0], "new") == 0 || strcmp(args[0], "n") == 0)
{
if (node->is_online)
{
printf(RED START "Node is already part of a ring. First use \"leave\" to leave the ring\n" RESET);
return -1;
}
return 0;
}
if (strcmp(args[0], "bentry") == 0 || strcmp(args[0], "b") == 0)
{
if (node->is_online)
{
printf(RED START "Node is already part of a ring. First use \"leave\" to leave the ring\n" RESET);
return -1;
}
if (num_read != 4)
{
printf(YLW START "Usage: bentry key key.ip key.port\n" RESET);
return -1;
}
return 1;
}
if (strcmp(args[0], "pbentry") == 0 || strcmp(args[0], "pb") == 0)
{
if (node->is_online)
{
printf(RED START "Node is already part of a ring. First use \"leave\" to leave the ring\n" RESET);
return -1;
}
if (num_read != 2)
{
printf(YLW START "Usage: pbentry key\n" RESET);
return -1;
}
return 10;
}
if (strcmp(args[0], "pentry") == 0 || strcmp(args[0], "p") == 0)
{
if (node->is_online)
{
printf(RED START "Node is already part of a ring. First use \"leave\" to leave the ring\n" RESET);
return -1;
}
if (num_read != 4)
{
printf(YLW START "Usage: pentry key key.ip key.port\n" RESET);
return -1;
}
return 2;
}
if (strcmp(args[0], "chord") == 0 || strcmp(args[0], "c") == 0)
{
if (!node->is_online)
{
printf(RED START "Node is not part of a ring. Use \"new\", \"pentry\" or \"bentry\"\n" RESET);
return -1;
}
if (num_read != 4)
{
printf(YLW START "Usage: chord key key.ip key.port\n" RESET);
return -1;
}
return 3;
}
if ((strcmp(args[0], "dchord") == 0 || strcmp(args[0], "d") == 0) && node->chord_i != -1)
{
if (!node->is_online)
{
printf(RED START "Node is not part of a ring. Use \"new\", \"pentry\" or \"bentry\"\n" RESET);
return -1;
}
return 4;
}
if (strcmp(args[0], "show") == 0 || strcmp(args[0], "s") == 0)
{
if (!node->is_online)
{
printf(RED START "Node is not part of a ring. Use \"new\", \"pentry\" or \"bentry\"\n" RESET);
return -1;
}
return 5;
}
if (strcmp(args[0], "find") == 0 || strcmp(args[0], "f") == 0)
{
if (!node->is_online)
{
printf(RED START "Node is not part of a ring. Use \"new\", \"pentry\" or \"bentry\"\n" RESET);
return -1;
}
if (strcmp(args[1], "") == 0)
{
printf(RED START "Usage: find k, where k is the key to be searched\n" RESET);
return -1;
}
if (strlen(args[1]) > 2 || atoi(args[1]) > 32 || args[1][0] < 48 || args[1][0] > 59)
{
printf(RED START "Usage: find k, k must be a number smaller than 32\n" RESET);
return -1;
}
return 6;
}
if (strcmp(args[0], "leave") == 0 || strcmp(args[0], "l") == 0)
{
if (!node->is_online)
{
printf(RED START "Node is not part of a ring. Use \"new\", \"pentry\" or \"bentry\"\n" RESET);
return -1;
}
return 7;
}
if (strcmp(args[0], "exit") == 0 || strcmp(args[0], "e") == 0)
{
if (node->is_online)
{
printf(RED START "Node is still part of a ring. Use \"leave\"\n" RESET);
return -1;
}
return 8;
}
printf(RED START "\"%s\" is not a valid command.\n" RESET, args[0]);
return -1;
}
void check_call(int argc, char **argv)
{
if (argc != 4)
{
if (argc == 5)
if (strcmp(argv[4], "-v") == 0)
verb = 1;
else if (strcmp(argv[4], "-s") == 0)
disp_info = 0;
else
{
printf(RED "Usage: ring i i.ip i.port (-v for verbose, -s for silent)\n");
exit(0);
}
else
{
printf(RED "Usage: ring i i.ip i.port (-v for verbose)\n");
exit(0);
}
}
return;
}