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
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
|
/*
// Copyright (c) 2010-2017 Intel Corporation
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
*/
#include <ctype.h>
#include <stdio.h>
#include <float.h>
#include <math.h>
#include <unistd.h>
#include <errno.h>
#include <stdarg.h>
#include <rte_ether.h>
#include <rte_string_fns.h>
#include "quit.h"
#include "cfgfile.h"
#include "ip6_addr.h"
#include "parse_utils.h"
#include "prox_globals.h"
#include "prox_cfg.h"
#include "log.h"
#include "prox_lua.h"
#include "prox_lua_types.h"
#define MAX_NB_PORT_NAMES PROX_MAX_PORTS
#define MAX_LEN_PORT_NAME 24
#define MAX_LEN_VAR_NAME 24
#define MAX_LEN_VAL 512
#define MAX_NB_VARS 32
#if MAX_WT_PER_LB > MAX_INDEX
#error MAX_WT_PER_LB > MAX_INDEX
#endif
/* The CPU topology of the system is used to parse "socket
notation". This notation allows to refer to cores on specific
sockets and the hyper-thread of those cores. The CPU topology is
loaded only if the socket notation is used at least once. */
struct cpu_topology {
int socket[MAX_SOCKETS][RTE_MAX_LCORE][2];
uint32_t n_cores[MAX_SOCKETS];
uint32_t n_sockets;
};
struct cpu_topology cpu_topo;
struct port_name {
uint32_t id;
char name[MAX_LEN_PORT_NAME];
};
static struct port_name port_names[MAX_NB_PORT_NAMES];
static uint8_t nb_port_names;
struct var {
uint8_t cli;
char name[MAX_LEN_VAR_NAME];
char val[MAX_LEN_VAL];
};
static struct var vars[MAX_NB_VARS];
static uint8_t nb_vars;
static char format_err_str[256];
static const char *err_str = "";
const char *get_parse_err(void)
{
return err_str;
}
static int read_cpu_topology(void);
static int parse_core(int *socket, int *core, int *ht, const char* str);
static void set_errf(const char *format, ...)
{
va_list ap;
va_start(ap, format);
vsnprintf(format_err_str, sizeof(format_err_str), format, ap);
va_end(ap);
err_str = format_err_str;
}
static struct var *var_lookup(const char *name)
{
for (uint8_t i = 0; i < nb_vars; ++i) {
if (!strcmp(name, vars[i].name)) {
return &vars[i];
}
}
return NULL;
}
static int parse_single_var(char *val, size_t len, const char *name)
{
struct var *match;
match = var_lookup(name);
if (match) {
if (strlen(match->val) + 1 > len) {
set_errf("Variables '%s' with value '%s' is too long\n",
match->name, match->val);
return -1;
}
strncpy(val, match->val, len);
return 0;
}
else {
/* name + 1 to skip leading '$' */
if (lua_to_string(prox_lua(), GLOBAL, name + 1, val, len) >= 0)
return 0;
}
set_errf("Variable '%s' not defined!", name);
return 1;
}
/* Replace $... and each occurrence of ${...} with variable values */
int parse_vars(char *val, size_t len, const char *name)
{
static char result[MAX_CFG_STRING_LEN];
static char cur_var[MAX_CFG_STRING_LEN];
char parsed[2048];
size_t name_len = strlen(name);
enum parse_vars_state {NO_VAR, WHOLE_VAR, INLINE_VAR} state = NO_VAR;
size_t result_len = 0;
size_t start_var = 0;
memset(result, 0, sizeof(result));
PROX_PANIC(name_len > sizeof(result), "\tUnable to parse var %s: too long\n", name);
for (size_t i = 0; i < name_len; ++i) {
switch (state) {
case NO_VAR:
if (name[i] == '$') {
if (i != name_len - 1 && name[i + 1] == '{') {
start_var = i + 2;
state = INLINE_VAR;
i = i + 1;
}
else if (i == 0 && i != name_len - 1) {
state = WHOLE_VAR;
}
else {
set_errf("Invalid variable syntax");
return -1;
}
}
else {
result[result_len++] = name[i];
}
break;
case INLINE_VAR:
if (name[i] == '}') {
cur_var[0] = '$';
size_t var_len = i - start_var;
if (var_len == 0) {
set_errf("Empty variable are not allowed");
return -1;
}
strncpy(&cur_var[1], &name[start_var], var_len);
cur_var[1 + var_len] = 0;
if (parse_single_var(parsed, sizeof(parsed), cur_var)) {
return -1;
}
strcpy(&result[result_len], parsed);
result_len += strlen(parsed);
state = NO_VAR;
}
else if (i == name_len - 1) {
set_errf("Invalid variable syntax, expected '}'.");
return -1;
}
break;
case WHOLE_VAR:
if (i == name_len - 1) {
return parse_single_var(val, len, name);
}
break;
}
}
strncpy(val, result, len);
return 0;
}
int parse_int_mask(uint32_t *val, uint32_t *mask, const char *str2)
{
char str[MAX_STR_LEN_PROC];
char *mask_str;
if (parse_vars(str, sizeof(str), str2))
return -1;
mask_str = strchr(str, '&');
if (mask_str == NULL) {
set_errf("Missing '&' when parsing mask");
return -2;
}
*mask_str = 0;
if (parse_int(val, str))
return -1;
if (parse_int(mask, mask_str + 1))
return -1;
return 0;
}
int parse_range(uint32_t* lo, uint32_t* hi, const char *str2)
{
char str[MAX_STR_LEN_PROC];
char *dash;
if (parse_vars(str, sizeof(str), str2))
return -1;
dash = strstr(str, "-");
if (dash == NULL) {
set_errf("Missing '-' when parsing mask");
return -2;
}
*dash = 0;
if (parse_int(lo, str))
return -1;
if (parse_int(hi, dash + 1))
return -1;
int64_t tmp = strtol(str, 0, 0);
if (tmp > UINT32_MAX) {
set_errf("Integer is bigger than %u", UINT32_MAX);
return -1;
}
if (tmp < 0) {
set_errf("Integer is negative");
return -2;
}
*lo = tmp;
tmp = strtol(dash + 1, 0, 0);
if (tmp > UINT32_MAX) {
set_errf("Integer is bigger than %u", UINT32_MAX);
return -1;
}
if (tmp < 0) {
set_errf("Integer is negative");
return -2;
}
*hi = tmp;
if (*lo > *hi) {
set_errf("Low boundary is above high boundary in range");
return -2;
}
return 0;
}
int parse_ip(uint32_t *addr, const char *str2)
{
char str[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
char *ip_parts[5];
if (strlen(str) > MAX_STR_LEN_PROC) {
set_errf("String too long (max supported: %d)", MAX_STR_LEN_PROC);
return -2;
}
if (4 != rte_strsplit(str, strlen(str), ip_parts, 5, '.')) {
set_errf("Expecting 4 octets in ip.");
return -1;
}
uint32_t val;
for (uint8_t i = 0; i < 4; ++i) {
val = atoi(ip_parts[i]);
if (val > 255) {
set_errf("Maximum value for octet is 255 but octet %u is %u", i, val);
return -1;
}
*addr = *addr << 8 | val;
}
return 0;
}
int parse_ip4_cidr(struct ip4_subnet *val, const char *str2)
{
char str[MAX_STR_LEN_PROC];
char *slash;
int prefix;
if (parse_vars(str, sizeof(str), str2))
return -1;
slash = strstr(str, "/");
if (slash == NULL) {
set_errf("Missing '/' when parsing CIDR notation");
return -2;
}
*slash = 0;
prefix = atoi(slash + 1);
val->prefix = prefix;
if (prefix > 32) {
set_errf("Prefix %d is too big", prefix);
return -2;
}
if (prefix < 1) {
set_errf("Prefix %d is too small", prefix);
}
if (parse_ip(&val->ip, str))
return -2;
/* Apply mask making all bits outside the prefix zero */
val->ip &= ((int)(1 << 31)) >> (prefix - 1);
return 0;
}
int parse_ip6_cidr(struct ip6_subnet *val, const char *str2)
{
char str[MAX_STR_LEN_PROC];
char *slash;
int prefix;
if (parse_vars(str, sizeof(str), str2))
return -1;
slash = strstr(str, "/");
if (slash == NULL) {
set_errf("Missing '/' when parsing CIDR notation");
return -2;
}
*slash = 0;
prefix = atoi(slash + 1);
val->prefix = prefix;
parse_ip6((struct ipv6_addr *)&val->ip, str);
/* Apply mask making all bits outside the prefix zero */
int p = 120;
int cnt = 0;
while (p >= prefix) {
val->ip[15-cnt] = 0;
p -= 8;
cnt++;
}
if (prefix % 8 != 0) {
val->ip[15-cnt] &= ((int8_t)(1 << 7)) >> ((prefix %8) - 1);
}
return 0;
}
int parse_ip6(struct ipv6_addr *addr, const char *str2)
{
char str[MAX_STR_LEN_PROC];
char *addr_parts[9];
if (parse_vars(str, sizeof(str), str2))
return -1;
uint8_t ret = rte_strsplit(str, strlen(str), addr_parts, 9, ':');
if (ret == 9) {
set_errf("Invalid IPv6 address");
return -1;
}
uint8_t omitted = 0;
for (uint8_t i = 0, j = 0; i < ret; ++i, ++j) {
if (*addr_parts[i] == 0) {
if (omitted == 0) {
set_errf("Can only omit zeros once");
return -1;
}
omitted = 1;
j += 8 - ret;
}
else {
uint16_t w = strtoll(addr_parts[i], NULL, 16);
addr->bytes[j++] = (w >> 8) & 0xff;
addr->bytes[j] = w & 0xff;
}
}
return 0;
}
int parse_mac(struct ether_addr *ether_addr, const char *str2)
{
char str[MAX_STR_LEN_PROC];
char *addr_parts[7];
if (parse_vars(str, sizeof(str), str2))
return -1;
uint8_t ret = rte_strsplit(str, strlen(str), addr_parts, 7, ':');
if (ret != 6) {
set_errf("Invalid MAC address format");
return -1;
}
for (uint8_t i = 0; i < 6; ++i) {
if (2 != strlen(addr_parts[i])) {
set_errf("Invalid MAC address format");
return -1;
}
ether_addr->addr_bytes[i] = strtol(addr_parts[i], NULL, 16);
}
return 0;
}
char* get_cfg_key(char *str)
{
char *pkey = strchr(str, '=');
if (pkey == NULL) {
return NULL;
}
*pkey++ = '\0';
/* remove leading spaces */
while (isspace(*pkey)) {
pkey++;
}
if (*pkey == '\0') { /* an empty key */
return NULL;
}
return pkey;
}
void strip_spaces(char *strings[], const uint32_t count)
{
for (uint32_t i = 0; i < count; ++i) {
while (isspace(strings[i][0])) {
++strings[i];
}
size_t len = strlen(strings[i]);
while (len && isspace(strings[i][len - 1])) {
strings[i][len - 1] = '\0';
--len;
}
}
}
int is_virtualized(void)
{
char buf[1024]= "/proc/cpuinfo";
int virtualized = 0;
FILE* fd = fopen(buf, "r");
if (fd == NULL) {
set_errf("Could not open %s", buf);
return -1;
}
while (fgets(buf, sizeof(buf), fd) != NULL) {
if ((strstr(buf, "flags") != NULL) && (strstr(buf, "hypervisor") != NULL))
virtualized = 1;
}
fclose(fd);
return virtualized;
}
static int get_phys_core(uint32_t *dst, int lcore_id)
{
uint32_t ret;
char buf[1024];
snprintf(buf, sizeof(buf), "/sys/devices/system/cpu/cpu%u/topology/thread_siblings_list", lcore_id);
FILE* ht_fd = fopen(buf, "r");
if (ht_fd == NULL) {
set_errf("Could not open cpu topology %s", buf);
return -1;
}
if (fgets(buf, sizeof(buf), ht_fd) == NULL) {
set_errf("Could not read cpu topology");
return -1;
}
fclose(ht_fd);
uint32_t list[2] = {-1,-1};
parse_list_set(list, buf, 2);
*dst = list[0];
return 0;
}
static int get_socket(uint32_t core_id, uint32_t *socket)
{
int ret = -1;
char buf[1024];
snprintf(buf, sizeof(buf), "/sys/devices/system/cpu/cpu%u/topology/physical_package_id", core_id);
FILE* fd = fopen(buf, "r");
if (fd == NULL) {
set_errf("%s", buf);
return -1;
}
if (fgets(buf, sizeof(buf), fd) != NULL) {
ret = atoi(buf);
}
fclose(fd);
if (socket)
*socket = (ret == -1 ? 0 : ret);
return 0;
}
int lcore_to_socket_core_ht(uint32_t lcore_id, char *dst, size_t len)
{
if (cpu_topo.n_sockets == 0) {
if (read_cpu_topology() == -1) {
return -1;
}
}
for (uint32_t s = 0; s < cpu_topo.n_sockets; s++) {
for (uint32_t i = 0; i < cpu_topo.n_cores[s]; ++i) {
if ((uint32_t)cpu_topo.socket[s][i][0] == lcore_id) {
snprintf(dst, len, "%us%u", i, s);
return 0;
} else if ((uint32_t)cpu_topo.socket[s][i][1] == lcore_id) {
snprintf(dst, len, "%us%uh", i, s);
return 0;
}
}
}
return -1;
}
static int get_lcore_id(uint32_t socket_id, uint32_t core_id, int ht)
{
if (cpu_topo.n_sockets == 0) {
if (read_cpu_topology() == -1) {
return -1;
}
}
if (socket_id == UINT32_MAX)
socket_id = 0;
if (socket_id >= MAX_SOCKETS) {
set_errf("Socket id %d too high (max allowed is %d)", MAX_SOCKETS);
return -1;
}
if (core_id >= RTE_MAX_LCORE) {
set_errf("Core id %d too high (max allowed is %d)", RTE_MAX_LCORE);
return -1;
}
if (socket_id >= cpu_topo.n_sockets) {
set_errf("Current CPU topology reported that there are %u CPU sockets, CPU topology = %u socket(s), %u physical cores per socket, %u thread(s) per physical core",
cpu_topo.n_sockets, cpu_topo.n_sockets, cpu_topo.n_cores[0], cpu_topo.socket[0][0][1] == -1? 1: 2);
return -1;
}
if (core_id >= cpu_topo.n_cores[socket_id]) {
set_errf("Core %u on socket %u does not exist, CPU topology = %u socket(s), %u physical cores per socket, %u thread(s) per physical core",
core_id, socket_id, cpu_topo.n_sockets, cpu_topo.n_cores[0], cpu_topo.socket[socket_id][0][1] == -1? 1: 2);
return -1;
}
if (cpu_topo.socket[socket_id][core_id][!!ht] == -1) {
set_errf("Core %u %son socket %u has no hyper-thread, CPU topology = %u socket(s), %u physical cores per socket, %u thread(s) per physical core",
core_id, ht ? "(hyper-thread) " : "", socket_id, cpu_topo.n_sockets, cpu_topo.n_cores[0], cpu_topo.socket[socket_id][core_id][1] == -1? 1: 2);
return -1;
}
return cpu_topo.socket[socket_id][core_id][!!ht];
}
/* Returns 0 on success, negative on error. Parses the syntax XsYh
where sYh is optional. If sY is specified, Y is stored in the
socket argument. If, in addition, h is specified, *ht is set to
1. In case the input is only a number, socket and ht are set to
-1.*/
static int parse_core(int *socket, int *core, int *ht, const char* str)
{
*socket = -1;
*core = -1;
*ht = -1;
char* end;
*core = strtol(str, &end, 10);
if (*end == 's') {
*socket = 0;
*ht = 0;
if (cpu_topo.n_sockets == 0) {
if (read_cpu_topology() == -1) {
return -1;
}
}
++end;
*socket = strtol(end, &end, 10);
if (*socket >= MAX_SOCKETS) {
set_errf("Socket id %d too high (max allowed is %d)", *socket, MAX_SOCKETS - 1);
return -1;
}
if (*end == 'h') {
++end;
*ht = 1;
}
return 0;
}
if (*end == 'h') {
set_errf("Can't find hyper-thread since socket has not been specified");
return -1;
}
return 0;
}
static int parse_task(const char *str, uint32_t *socket, uint32_t *core, uint32_t *task, uint32_t *ht, enum ctrl_type *type)
{
const char *str_beg = str;
char *end;
*core = strtol(str, &end, 10);
if (str == end) {
set_errf("Expected number to in core-task definition:\n"
"\t(i.e. 5s1t0 for task 0 on core 5 on socket 1)\n"
"\tHave: '%s'.", end);
return -1;
}
*task = 0;
*socket = -1;
*ht = -1;
*type = 0;
str = end;
if (*str == 's') {
str++;
*socket = 0;
*ht = 0;
*socket = strtol(str, &end, 10);
str = end;
if (*str == 'h') {
str++;
*ht = 1;
}
if (*str == 't') {
str++;
*task = strtol(str, &end, 10);
str = end;
if (*str == 'p') {
*type = CTRL_TYPE_PKT;
str += 1;
}
else if (*str == 'm') {
*type = CTRL_TYPE_MSG;
str += 1;
}
}
} else {
if (*str == 'h') {
set_errf("Can't find hyper-thread since socket has not been specified");
return -1;
}
if (*str == 't') {
str++;
*task = strtol(str, &end, 10);
str = end;
if (*str == 'p') {
*type = CTRL_TYPE_PKT;
str += 1;
}
else if (*str == 'm') {
*type = CTRL_TYPE_MSG;
str += 1;
}
}
}
return str - str_beg;
}
static int core_task_set_add(struct core_task_set *val, uint32_t core, uint32_t task, enum ctrl_type type)
{
if (val->n_elems == sizeof(val->core_task)/sizeof(val->core_task[0]))
return -1;
val->core_task[val->n_elems].core = core;
val->core_task[val->n_elems].task = task;
val->core_task[val->n_elems].type = type;
val->n_elems++;
return 0;
}
int parse_task_set(struct core_task_set *cts, const char *str2)
{
char str[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
cts->n_elems = 0;
char *str3 = str;
int ret;
uint32_t socket_beg, core_beg, task_beg, ht_beg,
socket_end, core_end, task_end, ht_end;
enum ctrl_type type_beg, type_end;
uint32_t task_group_start = -1;
while (*str3 && *str3 != ' ') {
if (*str3 == '(') {
task_group_start = cts->n_elems;
str3 += 1;
continue;
}
if (*str3 == ')' && *(str3 + 1) == 't') {
str3 += 2;
char *end;
uint32_t t = strtol(str3, &end, 10);
enum ctrl_type type = 0;
str3 = end;
if (*str3 == 'p') {
type = CTRL_TYPE_PKT;
str3 += 1;
}
else if (*str3 == 'm') {
type = CTRL_TYPE_MSG;
str3 += 1;
}
for (uint32_t i = task_group_start; i < cts->n_elems; ++i) {
cts->core_task[i].task = t;
cts->core_task[i].type = type;
}
continue;
}
ret = parse_task(str3, &socket_beg, &core_beg, &task_beg, &ht_beg, &type_beg);
if (ret < 0)
return -1;
str3 += ret;
socket_end = socket_beg;
core_end = core_beg;
task_end = task_beg;
ht_end = ht_beg;
type_end = type_beg;
if (*str3 == '-') {
str3 += 1;
ret = parse_task(str3, &socket_end, &core_end, &task_end, &ht_end, &type_end);
if (ret < 0)
return -1;
str3 += ret;
}
if (*str3 == ',')
str3 += 1;
if (socket_end != socket_beg) {
set_errf("Same socket must be used in range syntax.");
return -1;
} else if (ht_beg != ht_end) {
set_errf("If 'h' syntax is in range, it must be specified everywhere.\n");
return -1;
} else if (task_end != task_beg && core_end != core_beg) {
set_errf("Same task must be used in range syntax when cores are different.\n");
return -1;
} else if (task_end < task_beg) {
set_errf("Task for end of range must be higher than task for beginning of range.\n");
return -1;
} else if (type_end != type_beg) {
set_errf("Task type for end of range must be the same as task type for beginning.\n");
return -1;
} else if (core_end < core_beg) {
set_errf("Core for end of range must be higher than core for beginning of range.\n");
return -1;
}
for (uint32_t j = core_beg; j <= core_end; ++j) {
if (socket_beg != UINT32_MAX && ht_beg != UINT32_MAX)
ret = get_lcore_id(socket_beg, j, ht_beg);
else
ret = j;
if (ret < 0)
return -1;
for (uint32_t k = task_beg; k <= task_end; ++k) {
core_task_set_add(cts, ret, k, type_beg);
}
}
}
return 0;
}
int parse_list_set(uint32_t *list, const char *str2, uint32_t max_list)
{
char str[MAX_STR_LEN_PROC];
char *parts[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
int n_parts = rte_strsplit(str, strlen(str), parts, MAX_STR_LEN_PROC, ',');
size_t list_count = 0;
for (int i = 0; i < n_parts; ++i) {
char *cur_part = parts[i];
char *sub_parts[3];
int n_sub_parts = rte_strsplit(cur_part, strlen(cur_part), sub_parts, 3, '-');
int socket1, socket2;
int ht1, ht2;
int core1, core2;
int ret = 0;
if (n_sub_parts == 1) {
if (parse_core(&socket1, &core1, &ht1, sub_parts[0]))
return -1;
socket2 = socket1;
core2 = core1;
ht2 = ht1;
} else if (n_sub_parts == 2) {
if (parse_core(&socket1, &core1, &ht1, sub_parts[0]))
return -1;
if (parse_core(&socket2, &core2, &ht2, sub_parts[1]))
return -1;
} else if (n_sub_parts >= 3) {
set_errf("Multiple '-' characters in range syntax found");
return -1;
} else {
set_errf("Invalid list syntax");
return -1;
}
if (socket1 != socket2) {
set_errf("Same socket must be used in range syntax");
return -1;
}
else if (ht1 != ht2) {
set_errf("If 'h' syntax is in range, it must be specified everywhere.");
return -1;
}
for (int cur_core = core1; cur_core <= core2; ++cur_core) {
int effective_core;
if (socket1 != -1)
effective_core = get_lcore_id(socket1, cur_core, ht1);
else
effective_core = cur_core;
if (list_count >= max_list) {
set_errf("Too many elements in list\n");
return -1;
}
list[list_count++] = effective_core;
}
}
return list_count;
}
int parse_kmg(uint32_t* val, const char *str2)
{
char str[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
char c = str[strlen(str) - 1];
*val = atoi(str);
switch (c) {
case 'G':
if (*val >> 22)
return -2;
*val <<= 10;
case 'M':
if (*val >> 22)
return -2;
*val <<= 10;
case 'K':
if (*val >> 22)
return -2;
*val <<= 10;
break;
default:
/* only support optional KMG suffix */
if (c < '0' || c > '9') {
set_errf("Unknown syntax for KMG suffix '%c' (expected K, M or G)", c);
return -1;
}
}
return 0;
}
int parse_bool(uint32_t* val, const char *str2)
{
char str[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
if (!strcmp(str, "yes")) {
*val = 1;
return 0;
}
else if (!strcmp(str, "no")) {
*val = 0;
return 0;
}
set_errf("Unknown syntax for bool '%s' (expected yes or no)", str);
return -1;
}
int parse_flag(uint32_t* val, uint32_t flag, const char *str2)
{
char str[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
uint32_t tmp;
if (parse_bool(&tmp, str))
return -1;
if (tmp)
*val |= flag;
else
*val &= ~flag;
return 0;
}
int parse_int(uint32_t* val, const char *str2)
{
char str[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
int64_t tmp = strtol(str, 0, 0);
if (tmp > UINT32_MAX) {
set_errf("Integer is bigger than %u", UINT32_MAX);
return -1;
}
if (tmp < 0) {
set_errf("Integer is negative");
return -2;
}
*val = tmp;
return 0;
}
int parse_float(float* val, const char *str2)
{
char str[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
float tmp = strtof(str, 0);
if ((tmp >= HUGE_VALF) || (tmp <= -HUGE_VALF)) {
set_errf("Unable to parse float\n");
return -1;
}
*val = tmp;
return 0;
}
int parse_u64(uint64_t* val, const char *str2)
{
char str[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
errno = 0;
uint64_t tmp = strtoul(str, NULL, 0);
if (errno != 0) {
set_errf("Invalid u64 '%s' (%s)", str, strerror(errno));
return -2;
}
*val = tmp;
return 0;
}
int parse_str(char* dst, const char *str2, size_t max_len)
{
char str[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
if (strlen(str) > max_len - 1) {
set_errf("String too long (%u > %u)", strlen(str), max_len - 1);
return -2;
}
strncpy(dst, str, max_len);
return 0;
}
int parse_path(char *dst, const char *str, size_t max_len)
{
if (parse_str(dst, str, max_len))
return -1;
if (access(dst, F_OK)) {
set_errf("Invalid file '%s' (%s)", dst, strerror(errno));
return -1;
}
return 0;
}
int parse_port_name(uint32_t *val, const char *str2)
{
char str[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
for (uint8_t i = 0; i < nb_port_names; ++i) {
if (!strcmp(str, port_names[i].name)) {
*val = port_names[i].id;
return 0;
}
}
set_errf("Port with name %s not defined", str);
return 1;
}
int parse_port_name_list(uint32_t *val, uint32_t* tot, uint8_t max_vals, const char *str2)
{
char *elements[PROX_MAX_PORTS + 1];
char str[MAX_STR_LEN_PROC];
uint32_t cur;
int ret;
if (parse_str(str, str2, sizeof(str)))
return -1;
ret = rte_strsplit(str, strlen(str), elements, PROX_MAX_PORTS + 1, ',');
if (ret == PROX_MAX_PORTS + 1 || ret > max_vals) {
set_errf("Too many ports in port list");
return -1;
}
strip_spaces(elements, ret);
for (uint8_t i = 0; i < ret; ++i) {
if (parse_port_name(&cur, elements[i])) {
return -1;
}
val[i] = cur;
}
if (tot) {
*tot = ret;
}
return 0;
}
int parse_remap(uint8_t *mapping, const char *str)
{
char *elements[PROX_MAX_PORTS + 1];
char *elements2[PROX_MAX_PORTS + 1];
char str_cpy[MAX_STR_LEN_PROC];
uint32_t val;
int ret, ret2;
if (strlen(str) > MAX_STR_LEN_PROC) {
set_errf("String too long (max supported: %d)", MAX_STR_LEN_PROC);
return -2;
}
strncpy(str_cpy, str, MAX_STR_LEN_PROC);
ret = rte_strsplit(str_cpy, strlen(str_cpy), elements, PROX_MAX_PORTS + 1, ',');
if (ret <= 0) {
set_errf("Invalid remap syntax");
return -1;
}
else if (ret > PROX_MAX_PORTS) {
set_errf("Too many remaps");
return -2;
}
strip_spaces(elements, ret);
for (uint8_t i = 0; i < ret; ++i) {
ret2 = rte_strsplit(elements[i], strlen(elements[i]), elements2, PROX_MAX_PORTS + 1, '|');
strip_spaces(elements2, ret2);
if (ret2 > PROX_MAX_PORTS) {
set_errf("Too many remaps");
return -2;
}
for (uint8_t j = 0; j < ret2; ++j) {
if (parse_port_name(&val, elements2[j])) {
return -1;
}
/* This port will be mapped to the i'th
element specified before remap=. */
mapping[val] = i;
}
}
return ret;
}
int add_port_name(uint32_t val, const char *str2)
{
char str[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
struct port_name* pn;
if (nb_port_names == MAX_NB_PORT_NAMES) {
set_errf("Too many ports defined (can define %d)", MAX_NB_PORT_NAMES);
return -1;
}
for (uint8_t i = 0; i < nb_port_names; ++i) {
/* each port has to have a unique name*/
if (!strcmp(str, port_names[i].name)) {
set_errf("Port with name %s is already defined", str);
return -2;
}
}
pn = &port_names[nb_port_names];
strncpy(pn->name, str, sizeof(pn->name));
pn->id = val;
++nb_port_names;
return 0;
}
int set_self_var(const char *str)
{
for (uint8_t i = 0; i < nb_vars; ++i) {
if (!strcmp("$self", vars[i].name)) {
sprintf(vars[i].val, "%s", str);
return 0;
}
}
struct var *v = &vars[nb_vars];
strncpy(v->name, "$self", strlen("$self"));
sprintf(v->val, "%s", str);
nb_vars++;
return 0;
}
int add_var(const char* name, const char *str2, uint8_t cli)
{
struct var* v;
char str[MAX_STR_LEN_PROC];
if (parse_vars(str, sizeof(str), str2))
return -1;
if (strlen(name) == 0 || strlen(name) == 1) {
set_errf("Can't define variables with empty name");
return -1;
}
if (name[0] != '$') {
set_errf("Each variable should start with the $ character");
return -1;
}
if (nb_vars == MAX_NB_VARS) {
set_errf("Too many variables defined (can define %d)", MAX_NB_VARS);
return -2;
}
for (uint8_t i = 0; i < nb_vars; ++i) {
if (!strcmp(name, vars[i].name)) {
/* Variables defined through program arguments
take precedence. */
if (!cli && vars[i].cli) {
return 0;
}
set_errf("Variable with name %s is already defined", name);
return -3;
}
}
v = &vars[nb_vars];
PROX_PANIC(strlen(name) > sizeof(v->name), "\tUnable to parse var %s: too long\n", name);
PROX_PANIC(strlen(str) > sizeof(v->val), "\tUnable to parse var %s=%s: too long\n", name,str);
strncpy(v->name, name, sizeof(v->name));
strncpy(v->val, str, sizeof(v->val));
v->cli = cli;
++nb_vars;
return 0;
}
static int read_cores_present(uint32_t *cores, int max_cores, int *res)
{
FILE* fd = fopen("/sys/devices/system/cpu/present", "r");
char buf[1024];
if (fd == NULL) {
set_errf("Could not opening file /sys/devices/system/cpu/present");
return -1;
}
if (fgets(buf, sizeof(buf), fd) == NULL) {
set_errf("Could not read cores range");
return -1;
}
fclose(fd);
int ret = parse_list_set(cores, buf, max_cores);
if (ret < 0)
return -1;
*res = ret;
return 0;
}
static int set_dummy_topology(void)
{
int core_count = 0;
for (int s = 0; s < MAX_SOCKETS; s++) {
for (int i = 0; i < 32; ++i) {
cpu_topo.socket[s][i][0] = core_count++;
cpu_topo.socket[s][i][1] = core_count++;
cpu_topo.n_cores[s]++;
}
}
cpu_topo.n_sockets = MAX_SOCKETS;
return 0;
}
static int read_cpu_topology(void)
{
if (cpu_topo.n_sockets != 0)
return 0;
if (prox_cfg.flags & DSF_USE_DUMMY_CPU_TOPO)
return set_dummy_topology();
uint32_t cores[RTE_MAX_LCORE];
int n_cores = 0;
if (read_cores_present(cores, sizeof(cores)/sizeof(cores[0]), &n_cores) != 0)
return -1;
for (int s = 0; s < MAX_SOCKETS; s++) {
for (int i = 0; i < RTE_MAX_LCORE; ++i) {
cpu_topo.socket[s][i][0] = -1;
cpu_topo.socket[s][i][1] = -1;
}
}
for (int i = 0; i < n_cores; ++i) {
uint32_t socket_id, lcore_id, phys;
lcore_id = cores[i];
if (get_socket(lcore_id, &socket_id) != 0)
return -1;
if (socket_id >= MAX_SOCKETS) {
set_errf("Can't read CPU topology due too high socket ID (max allowed is %d)",
MAX_SOCKETS);
return -1;
}
if (socket_id >= cpu_topo.n_sockets) {
cpu_topo.n_sockets = socket_id + 1;
}
if (get_phys_core(&phys, lcore_id) != 0)
return -1;
if (phys >= RTE_MAX_LCORE) {
set_errf("Core ID %u too high", phys);
return -1;
}
if (cpu_topo.socket[socket_id][phys][0] == -1) {
cpu_topo.socket[socket_id][phys][0] = lcore_id;
cpu_topo.n_cores[socket_id]++;
}
else if (cpu_topo.socket[socket_id][phys][1] == -1) {
cpu_topo.socket[socket_id][phys][1] = lcore_id;
}
else {
set_errf("Too many core siblings");
return -1;
}
}
/* There can be holes in the cpu_topo description at this
point. An example for this is a CPU topology where the
lowest core ID of 2 hyper-threads is always an even
number. Before finished up this phase, compact all the
cores to make the numbers consecutive. */
for (uint32_t i = 0; i < cpu_topo.n_sockets; ++i) {
int spread = 0, compact = 0;
while (cpu_topo.socket[i][spread][0] == -1)
spread++;
for (uint32_t c = 0; c < cpu_topo.n_cores[i]; ++c) {
cpu_topo.socket[i][compact][0] = cpu_topo.socket[i][spread][0];
cpu_topo.socket[i][compact][1] = cpu_topo.socket[i][spread][1];
compact++;
spread++;
/* Skip gaps */
while (cpu_topo.socket[i][spread][0] == -1)
spread++;
}
}
return 0;
}
static int bit_len_valid(uint32_t len, const char *str)
{
if (len > 32) {
set_errf("Maximum random length is 32, but length of '%s' is %zu\n", str, len);
return 0;
}
if (len % 8) {
plog_err("Random should be multiple of 8 long\n");
return 0;
}
if (len == 0) {
plog_err("Random should be at least 1 byte long\n");
return 0;
}
return -1;
}
int parse_random_str(uint32_t *mask, uint32_t *fixed, uint32_t *len, const char *str)
{
const size_t len_bits = strlen(str);
if (!bit_len_valid(len_bits, str))
return -1;
*mask = 0;
*fixed = 0;
*len = len_bits / 8;
for (uint32_t j = 0; j < len_bits; ++j) {
/* Store in the lower bits the value of the rand string (note
that these are the higher bits in LE). */
switch (str[j]) {
case 'X':
*mask |= 1 << (len_bits - 1 - j);
break;
case '1':
*fixed |= 1 << (len_bits - 1 - j);
break;
case '0':
break;
default:
set_errf("Unexpected %c\n", str[j]);
return -1;
}
}
return 0;
}
|