/
util.c
285 lines (241 loc) · 5.28 KB
/
util.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
274
275
276
277
278
279
280
281
282
283
284
285
#include <string.h>
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include "include/def.h"
//Make a string uppercase
int toupperstr(char *str, int len){
int i;
for(i = 0; i < len; ++i){
str[i] = toupper(str[i]);
}
return 0;
}
direction_t strtodir(char *str){
if(!str) {
return NONE;
}
//fprintf(stderr, "%s\n", str);
char *split;
//Deal with multiple attack buttons
if((split = rindex(str, '+'))){
int fst, snd;
split[0] = 0;
split++;
fst = strtodir(str);
snd = strtodir(split);
return (fst * 10) + snd;
}
if(!strcasecmp("B", str)){
return B;
} else if(!strcasecmp("C", str)){
return C;
} else if(!strcasecmp("CB", str)){
return CB;
} else if(!strcasecmp("CF", str)){
return CF;
} else if(!strcasecmp("DP", str)){
return DP;
} else if(!strcasecmp("F", str)){
return F;
} else if(!strcasecmp("HCB", str)){
return HCB;
} else if(!strcasecmp("HCF", str)){
return HCF;
} else if(!strcasecmp("QCB", str)){
return QCB;
} else if(!strcasecmp("QCF", str)){
return QCF;
} else if(!strcasecmp("S", str)){
return S;
} else if(!strcasecmp("J", str) || !strcasecmp("U", str)){
return U;
} else if(!strcasecmp("JB", str)){
return UB;
} else if(!strcasecmp("JF", str)){
return UF;
} else if(!strcasecmp("XX", str)){
return CANCEL;
} else {
return S;
}
}
attack_t strtoatk(char *str){
char *split;
if(!str){
return NONE;
}
//Deal with multiple attack buttons
if((split = rindex(str, '+'))){
int fst, snd;
split[0] = 0;
split++;
fst = strtoatk(str);
snd = strtoatk(split);
return (fst * 10) + snd;
}
if(!strcasecmp("LP", str)){
return LP;
} else if(!strcasecmp("MP", str)){
return MP;
} else if(!strcasecmp("HP", str)){
return HP;
} else if(!strcasecmp("LK", str)){
return LK;
} else if(!strcasecmp("MK", str)){
return MK;
} else if(!strcasecmp("HK", str)){
return HK;
} else if(!strcasecmp("P", str)){
return P;
} else if(!strcasecmp("K", str)){
return K;
} else {
return NONE;
}
}
char* dirtostr(direction_t direction, char *l){
if(!direction){
return l;
}
int tmp = direction % 10;
char *s, *ans;
if(l){
s = (char *)malloc((strlen(l) + 5) * sizeof(char));
} else {
s = (char *)malloc(3 * sizeof(char));
}
//case analysis
switch(tmp){
case CB: strncpy(s, "CB", 3); break;
case C: strncpy(s, "C", 2); break;
case CF: strncpy(s, "CF", 3); break;
case B: strncpy(s, "B", 2); break;
case S: strncpy(s, "S", 2); break;
case F: strncpy(s, "F", 2); break;
case UB: strncpy(s, "JB", 3); break;
case U: strncpy(s, "J", 2); break;
case UF: strncpy(s, "JF", 3); break;
default: s = ""; break;
}
if(l) {
strncat(s, "+", 1);
strncat(s, l, strlen(l));
}
ans = dirtostr(direction/10, s);
if(s != ans) {
free(s);
}
return ans;
}
char* atktostr(attack_t attack, char *l){
if(!attack){
return l;
}
int tmp = attack % 10;
char *s, *ans;
if(l){
s = (char *)malloc((strlen(l) + 4) * sizeof(char));
} else {
s = (char *)malloc(3 * sizeof(char));
}
//case analysis
switch(tmp){
case 1: strncpy(s, "LP", 3); break;
case 2: strncpy(s, "MP", 3); break;
case 3: strncpy(s, "HP", 3); break;
case 4: strncpy(s, "LK", 3); break;
case 5: strncpy(s, "MK", 3); break;
case 6: strncpy(s, "HK", 3); break;
case 7: strncpy(s, "P", 2); break;
case 8: strncpy(s, "K", 2); break;
default: s = ""; break;
}
if(l) {
strncat(s, "+", 1);
strncat(s, l, strlen(l));
}
ans = atktostr(attack/10, s);
if(s != ans) free(s);
return ans;
}
/* Move-specific utilities */
Move_t alloc_move(void){
return (Move_t) malloc(sizeof(struct Move));
}
void print_move(Move_t m){
char *dir = NULL;
char *atk = NULL;
dir = dirtostr(m->direction, NULL);
atk = atktostr(m->attack, NULL);
printf("%s.%s", dir, atk);
if(dir) free(dir);
if(atk) free(atk);
}
void print_move_numerical(Move_t m){
char *atk;
atk = atktostr(m->attack, NULL);
printf("%i%s", m->direction, atk);
if(atk) free(atk);
}
void print_move_raw(Move_t m){
printf("dir is %i\n", m->direction);
printf("atk is %i\n", m->attack);
}
/* Combo-specific utilities */
Combo init_combo(Move_t m, char *note){
Combo tmp;
tmp = (Combo) malloc(sizeof(struct Combo_node));
if(!tmp) {
fprintf(stderr, "Out of memory\n");
exit(1);
}
tmp->m = m;
if(note) tmp->note = strdup(note);
else tmp->note = NULL;
tmp->next = NULL;
return tmp;
}
void add_move_to_combo(Move_t m, char *note, Combo prev){
Combo tmp;
tmp = init_combo(m, note);
prev->next = tmp;
}
void print_combo(Combo c){
Combo tmp = c;
while(tmp){
print_move(tmp->m);
if(tmp->note) printf("(%s)", tmp->note);
tmp = tmp->next;
if(tmp) printf(",");
}
printf("\n");
}
void print_combo_numerical(Combo c){
Combo tmp = c;
while(tmp){
print_move_numerical(tmp->m);
tmp = tmp->next;
if(tmp) printf(",");
}
printf("\n");
}
void print_combo_raw(Combo c){
Combo tmp = c;
while(tmp){
print_move_raw(tmp->m);
tmp = tmp->next;
if(tmp) printf(",");
}
printf("\n");
}
void free_combo(Combo c){
Combo tmp;
while(c){
tmp = c->next;
free(c->m);
if(c->note) free(c->note);
free(c);
c = tmp;
}
}