-
Notifications
You must be signed in to change notification settings - Fork 0
/
antennes.c
1672 lines (1512 loc) · 50.3 KB
/
antennes.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
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
/*
* Copyright (c) 2022 Laurent Ghigonis <ooookiwi@gmail.com>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <stdlib.h>
#include <stdio.h>
#include <stdint.h>
#include <unistd.h>
#include <inttypes.h>
#include <strings.h>
#include <limits.h>
#include <sys/stat.h>
#include <sys/mman.h>
#include <fcntl.h>
#include <err.h>
#include <string.h>
#include <stdarg.h>
#include <ctype.h>
#include <time.h>
#include <libgen.h>
#include "utils.h"
#define STA_NM_LEN 10
#define STA_NM_DEPT_LEN 3
#define STA_NM_ZONE_LEN 3
struct sta_nm {
uint64_t nm;
uint16_t dept; /* INSEE departement code */
uint16_t zone;
uint16_t id;
const char *str;
};
#define NATURE_ID_MAX 100
struct f_nature {
struct csv csv;
struct nature *table[NATURE_ID_MAX];
int count;
};
struct nature {
int nat_id;
char *nat_lb_nom;
};
#define SUPPORTS_ID_MAX 4 * 1000 * 1000
struct f_support {
struct csv csv;
struct support *table[SUPPORTS_ID_MAX];
int count;
};
#define SUPPORT_STA_MAX 100
#define SUPPORT_DESCRIPTION_BUF_SIZE 65536
#define SUPPORT_CP_DEPT_MAX 0x99 /* departement INSEE */
struct support {
int sup_id;
struct sta_nm sta_nm_anfr[SUPPORT_STA_MAX];
int nat_id;
int lat_dms[3];
char *lat_ns;
int lon_dms[3];
char *lon_ew;
int sup_nm_haut;
int tpo_id;
char *adr_lb_lieu;
char *adr_lb_add0;
char *adr_lb_add2;
char *adr_lb_add3;
char *adr_nm_cp_str;
int adr_nm_cp;
uint32_t com_cd_insee;
/* calculated */
float lat;
float lon;
uint8_t dept;
char dept_name[3];
int sta_count;
};
#define PROPRIETAIRE_ID_MAX 100
struct f_proprietaire {
struct csv csv;
struct proprio *table[PROPRIETAIRE_ID_MAX];
int count;
};
struct proprio {
int tpo_id;
char *tpo_lb;
};
#define EXPLOITANT_ID_MAX 500
struct f_exploitant {
struct csv csv;
struct exploitant *table[EXPLOITANT_ID_MAX];
int count;
};
struct exploitant {
int adm_id;
char *adm_lb_nom;
};
/*
* SUP_STATION.txt
* ---------------------------
* | STA_NM_ANFR |
* |-------------------------|
* | 0 1 2 3 4 5 6 7 8 9 |
* |-------------------------|
* | dept | zone | id |
* ---------------------------
* STA_NM_ANFR is mapped to sta_nm structure
* storage is in f_station:
* - 'dept' are indexed in a pointer table 'depts'.
* - 'zone' are indexed in a pointer table 'zones' per 'dept'.
* - 'id' are indexed in in a pointer table 'stations' as an array of pointers to all possible stations for a given 'dept' and 'zone'.
*/
#define STATION_EMETTEUR_MAX 500
#define STATION_ANTENNE_MAX 100
#define SYSTEMES_ID_MAX 100
struct station {
struct sta_nm sta_nm;
int adm_id;
char *dem_nm_consis_str;
struct tm dte_implemntatation;
char *dte_implemntatation_str;
struct tm dte_modif;
char *dte_modif_str;
struct tm dte_en_service;
char *dte_en_service_str;
/* computed */
struct tm dte_latest; /* most recent date from the above */
/* references */
struct emetteur *emetteurs[STATION_EMETTEUR_MAX];
int emetteur_count;
int systeme_count[SYSTEMES_ID_MAX];
struct antenne *antennes[STATION_ANTENNE_MAX];
int antenne_count;
};
/* station id is 4 decimal digits */
#define STATION_ID_MAX 10*10*10*10
struct station_zone {
struct station *stations[STATION_ID_MAX];
int station_count;
};
/* zones are from sta_nm character 3 to 5, max value of 465 as of 202101 is obtained by:
* $ cut -d';' -f1 SUP_STATION.txt |cut -c 4-6 |sort -n |tail -n1 */
#define STATION_ZONE_MAX 600
struct station_dept {
struct station_zone *zones[STATION_ZONE_MAX];
int zone_count;
};
/* depts are from sta_nm character 0 to 2, max value of 988 as of 20220729 is obtained by:
* $ cut -d';' -f1 SUP_STATION.txt |cut -c 1-3 |sort -n |tail -n1 */
#define STATION_DEPT_MAX 0x999
struct f_station {
struct csv csv;
struct station_dept *depts[STATION_DEPT_MAX];
int id_count;
int station_count;
int dept_count;
int zone_count;
struct tm latest; /* latest station update date */
};
/* emetteurs have an integer id, max value of 20308500 as of 20220729 obtained by:
* $ cut -d';' -f1 SUP_EMETTEUR.txt |sort -n |tail -n1 */
#define EMETTEUR_ID_MAX 30000000
struct f_emetteur {
struct csv csv;
struct emetteur *table[EMETTEUR_ID_MAX];
int count;
char *systemes_lb[SYSTEMES_ID_MAX]; /* index for the different values of emr_lb_systeme */
int systemes_count[SYSTEMES_ID_MAX];
int systeme_count;
};
#define EMETTEUR_BAND_MAX 50
struct emetteur {
int emr_id;
char *emr_id_str;
char *emr_lb_systeme;
int systeme_id;
struct sta_nm sta_nm;
int aer_id;
struct tm emr_dt_service;
char *emr_dt_service_str;
struct bande *bandes[EMETTEUR_BAND_MAX];
int bande_count;
};
/* bandes have an integer id, max value of 45214227 as of 20220729 obtained by:
* $ cut -d';' -f2 tmp/extract/SUP_BANDE.txt |sort -n |tail -n1 */
#define BANDE_ID_MAX 100000000
struct f_bande {
struct csv csv;
struct bande *table[BANDE_ID_MAX];
int count;
};
struct bande {
struct sta_nm sta_nm;
int ban_id;
int emr_id;
uint64_t ban_nb_f_deb;
char *ban_nb_f_deb_str;
uint64_t ban_nb_f_fin;
char *ban_nb_f_fin_str;
char *ban_fg_unite;
};
/* used when computing bands per exploitant */
struct bande_tree {
int emr_count;
uint64_t ban_nb_f_deb;
char *ban_nb_f_deb_str;
uint64_t ban_nb_f_fin;
char *ban_nb_f_fin_str;
int systemes_count[SYSTEMES_ID_MAX];
struct bande_tree *next; /* band with higher ban_nb_f_deb, or same ban_nb_f_deb and higher ban_nb_f_fin */
};
/* antennes have an integer id, max value of 7878184 as of 20220729 obtained by:
* $ cut -d';' -f2 tmp/extract/SUP_ANTENNE.txt |sort -n |tail -n1 */
#define ANTENNE_ID_MAX 10000000
#define ANTENNE_EMETTEUR_MAX 50
struct f_antenne {
struct csv csv;
struct antenne *table[ANTENNE_ID_MAX];
int count;
};
struct antenne {
struct sta_nm sta_nm;
int aer_id;
char *aer_id_str;
int tae_id;
float aer_nb_dimension;
char *aer_nb_dimension_str;
char *aer_fg_rayon;
float aer_nb_azimut;
char *aer_nb_azimut_str;
float aer_nb_alt_bas;
char *aer_nb_alt_bas_str;
char *sup_id_str;
struct emetteur *emetteurs[ANTENNE_EMETTEUR_MAX];
int emetteur_count;
};
#define TYPE_ANTENNE_ID_MAX 150
struct f_type_antenne {
struct csv csv;
char *table[TYPE_ANTENNE_ID_MAX];
int counts[TYPE_ANTENNE_ID_MAX];
int count;
};
struct anfr_set {
struct f_nature *natures;
struct f_support *supports;
struct f_proprietaire *proprietaires;
struct f_station *stations;
struct f_exploitant *exploitants;
struct f_emetteur *emetteurs;
struct f_bande *bandes;
struct f_antenne *antennes;
struct f_type_antenne *types_antenne;
};
#define KML_ANFR_DESCRIPTION "KML export of french emetteurs <5W based on ANFR data"
__attribute__((__noreturn__)) void usageexit(void);
/* input file processing */
struct anfr_set *set_load(char *);
void set_free(struct anfr_set *);
struct f_nature *natures_load(char *);
void natures_free(struct f_nature *);
const char *nature_get_name(struct f_nature *, int);
struct f_support *supports_load(char *);
void supports_free(struct f_support *);
struct f_proprietaire *proprietaires_load(char *);
void proprietaires_free(struct f_proprietaire *);
const char *proprietaire_get_name(struct f_proprietaire *, int);
struct f_station *stations_load(char *);
void stations_free(struct f_station *);
struct station *station_get(struct f_station *, struct sta_nm *);
struct station *station_get_next(struct f_station *, struct sta_nm *, int, struct station *);
int station_description(struct f_type_antenne *, struct station *, char *);
int station_systemes(struct f_emetteur *, struct station *, char *);
struct f_exploitant *exploitants_load(char *);
void exploitants_free(struct f_exploitant *);
const char *exploitant_get_name(struct f_exploitant *, int);
struct f_emetteur *emetteurs_load(char *, struct f_station *, struct f_antenne *);
void emetteurs_free(struct f_emetteur *);
const char * emetteurs_stats(struct f_emetteur *);
struct emetteur *emetteur_get(struct f_emetteur *, int);
struct emetteur *emetteur_get_next(struct emetteur **, int, struct emetteur *);
struct f_bande *bandes_load(char *, struct f_emetteur *);
void bandes_free(struct f_bande *);
struct f_antenne *antennes_load(char *, struct f_station *);
void antennes_free(struct f_antenne *);
struct antenne *antenne_get_next(struct antenne **, int, struct antenne *);
struct f_type_antenne *types_antenne_load(char *);
void types_antenne_free(struct f_type_antenne *);
char *type_antenne_get(struct f_type_antenne *, int);
/* output file */
void output_kml(struct anfr_set *, const char *, const char *);
void output_bands(struct anfr_set *, const char *, const char *);
/* utils */
void csv_stanm(struct csv *, struct sta_nm *);
struct conf conf;
__attribute__((__noreturn__)) void
usageexit()
{
printf("usage: antennes [-Cv] [-b <dir>] [-k <dir>] <data_dir>\n");
printf("Query and export KML files from ANFR radio sites public data\n");
printf("-b <dir> export csv bands statistics to this directory\n");
printf("-C do not set any kml placemark colors\n");
printf("-k <dir> export kml files to this directory\n");
printf("-s display antennes statistics\n");
printf("-v verbose logging\n");
printf("if neither -s or -k are specified, this program only loads the data.\n");
printf("output kml files hierarchy:\n");
printf(" anfr_proprietaires.kml : all supports in a single file, one section per proprietaire\n");
printf(" anfr_departements.kml : all supports in a single file, one section per departement\n");
printf(" anfr_departements_light.kml : all supports in a single file, one section per departement, no description\n");
printf(" anfr_proprietaire/anfr_proprietaire_<proprietaire-id>_<proprietaire-name>.kml : one file per proprietaire\n");
printf(" anfr_departement/anfr_departement_<dept-id>.kml : one file per departement\n");
printf(" anfr_systeme/anfr_systeme_<sys-name>.kml : one file per systeme, one section per departement\n");
printf("kml placemark colors:\n");
printf(" orange for supports with stations updated in less than 3 months, red for 1 month, blue otherwise\n");
exit(1);
}
int
main(int argc, char *argv[])
{
struct anfr_set *set;
int ch, stats = 0;
char *kml_export = NULL, *bands_export = NULL;
time_t now;
bzero(&conf, sizeof(conf));
while ((ch = getopt(argc, argv, "b:Chk:sv")) != -1) {
switch (ch) {
case 'b':
bands_export = optarg;
break;
case 'C':
conf.no_color = 1;
break;
case 'k':
kml_export = optarg;
break;
case 's':
stats = 1;
break;
case 'v':
conf.verbose = 1;
break;
default:
usageexit();
}
}
argc -= optind;
argv += optind;
if (argc < 1)
usageexit();
time(&now);
gmtime_r(&now, &conf.now);
strftime(conf.now_str, sizeof(conf.now_str), "%Y-%m-%d", &conf.now);
info("[+] loading files from %s\n", argv[0]);
if (stats)
printf("file name : %s\n\n", basename(argv[0]));
set = set_load(argv[0]);
if (stats) {
info("[*] displaying statistics\n");
printf("\nemetteurs systemes count:\n%s", emetteurs_stats(set->emetteurs));
}
if (kml_export) {
info("[*] exporting kml to %s\n", kml_export);
output_kml(set, kml_export, basename(argv[0]));
}
if (bands_export) {
info("[*] exporting bands usage to %s\n", bands_export);
output_bands(set, bands_export, basename(argv[0]));
}
#ifdef DEBUG
info("[*] freeing ressources\n");
set_free(set);
#endif
if (conf.warn_incoherent_data > 0)
printf("incoherent data warnings: %d\n", conf.warn_incoherent_data);
return 0;
}
struct anfr_set *
set_load(char *path)
{
struct anfr_set *set = xmalloc_zero(sizeof(struct anfr_set));
char dir[PATH_MAX];
snprintf(dir, sizeof(dir), "%s/SUP_NATURE.txt", path);
set->natures = natures_load(dir);
snprintf(dir, sizeof(dir), "%s/SUP_SUPPORT.txt", path);
set->supports = supports_load(dir);
snprintf(dir, sizeof(dir), "%s/SUP_PROPRIETAIRE.txt", path);
set->proprietaires = proprietaires_load(dir);
snprintf(dir, sizeof(dir), "%s/SUP_STATION.txt", path);
set->stations = stations_load(dir);
snprintf(dir, sizeof(dir), "%s/SUP_EXPLOITANT.txt", path);
set->exploitants = exploitants_load(dir);
snprintf(dir, sizeof(dir), "%s/SUP_ANTENNE.txt", path);
set->antennes = antennes_load(dir, set->stations);
snprintf(dir, sizeof(dir), "%s/SUP_TYPE_ANTENNE.txt", path);
set->types_antenne = types_antenne_load(dir);
snprintf(dir, sizeof(dir), "%s/SUP_EMETTEUR.txt", path);
set->emetteurs = emetteurs_load(dir, set->stations, set->antennes);
snprintf(dir, sizeof(dir), "%s/SUP_BANDE.txt", path);
set->bandes = bandes_load(dir, set->emetteurs);
return set;
}
void
set_free(struct anfr_set *set)
{
bandes_free(set->bandes);
emetteurs_free(set->emetteurs);
types_antenne_free(set->types_antenne);
antennes_free(set->antennes);
exploitants_free(set->exploitants);
stations_free(set->stations);
proprietaires_free(set->proprietaires);
supports_free(set->supports);
natures_free(set->natures);
}
struct f_nature *
natures_load(char *path)
{
struct f_nature *natures;
struct csv *csv;
struct nature *nature;
int nat_id;
natures = xmalloc_zero(sizeof(struct f_nature));
csv = &natures->csv;
csv_open(csv, path, CSV_CONV_UTF8_TO_ISO8859, ';', 0);
while (csv_line(csv)) {
if (!isdigit(csv->line[0]))
continue; /* comment or header */
csv_int(csv, &nat_id, NULL);
if (nat_id == 999999999) /* Support non décrit */
continue;
if (nat_id >= NATURE_ID_MAX)
errx(1, "nature id %d too big", nat_id);
nature = malloc(sizeof(struct nature));
nature->nat_id = nat_id;
csv_str(csv, &nature->nat_lb_nom);
natures->table[nature->nat_id] = nature;
natures->count++;
}
printf("%d natures of support\n", natures->count);
return natures;
}
void
natures_free(struct f_nature *natures)
{
int n;
for (n=0; n<NATURE_ID_MAX; n++)
if (natures->table[n])
free(natures->table[n]);
csv_close(&natures->csv);
free(natures);
}
const char *
nature_get_name(struct f_nature *f, int id)
{
if (id > NATURE_ID_MAX || !f->table[id])
return "Support non décrit";
return f->table[id]->nat_lb_nom;
}
struct f_support *
supports_load(char *path)
{
struct f_support *supports;
struct csv *csv;
struct support *sup;
int sup_id;
supports = xmalloc_zero(sizeof(struct f_support));
csv = &supports->csv;
csv_open(csv, path, CSV_NORMAL, ';', 0);
while (csv_line(csv)) {
if (!isdigit(csv->line[0]))
continue; /* comment or header */
csv_int(csv, &sup_id, NULL);
if (sup_id >= SUPPORTS_ID_MAX)
errx(1, "invalid support id, too big: %d", sup_id);
if (!supports->table[sup_id]) {
verb("new support %d\n", sup_id);
sup = malloc(sizeof(struct support));
sup->sup_id = sup_id;
csv_stanm(csv, &sup->sta_nm_anfr[0]);
csv_int(csv, &sup->nat_id, NULL);
csv_int(csv, &sup->lat_dms[0], NULL);
csv_int(csv, &sup->lat_dms[1], NULL);
csv_int(csv, &sup->lat_dms[2], NULL);
csv_str(csv, &sup->lat_ns);
csv_int(csv, &sup->lon_dms[0], NULL);
csv_int(csv, &sup->lon_dms[1], NULL);
csv_int(csv, &sup->lon_dms[2], NULL);
csv_str(csv, &sup->lon_ew);
csv_int(csv, &sup->sup_nm_haut, NULL);
csv_int(csv, &sup->tpo_id, NULL);
csv_str(csv, &sup->adr_lb_lieu);
csv_str(csv, &sup->adr_lb_add0);
csv_str(csv, &sup->adr_lb_add2);
csv_str(csv, &sup->adr_lb_add3);
csv_int(csv, &sup->adr_nm_cp, &sup->adr_nm_cp_str);
csv_int16(csv, &sup->com_cd_insee, NULL);
coord_dms_to_dd(sup->lat_dms, sup->lat_ns, sup->lon_dms, sup->lon_ew, &sup->lat, &sup->lon);
sup->dept = sup->com_cd_insee >> 12;
snprintf(sup->dept_name, sizeof(sup->dept_name), "%02X", sup->dept);
sup->sta_count = 0;
supports->table[sup->sup_id] = sup;
supports->count++;
} else {
verb("existing support %d\n", sup_id);
sup = supports->table[sup_id];
if (sup->sta_count == SUPPORT_STA_MAX)
errx(1, "maximum stations %d reached for support %d", SUPPORT_STA_MAX, sup->sup_id);
csv_stanm(csv, &sup->sta_nm_anfr[sup->sta_count]);
}
sup->sta_count++;
verb("%d: tpo=%d lieu='%s' add0='%s' cp=%d insee=%x\n", sup->sup_id, sup->tpo_id, sup->adr_lb_lieu, sup->adr_lb_add0, sup->adr_nm_cp, sup->com_cd_insee);
}
printf("%d supports\n", supports->count);
return supports;
}
void
supports_free(struct f_support *supports)
{
int n;
for (n=0; n<SUPPORTS_ID_MAX; n++)
if (supports->table[n])
free(supports->table[n]);
csv_close(&supports->csv);
free(supports);
}
struct f_proprietaire *
proprietaires_load(char *path)
{
struct f_proprietaire *proprietaires;
struct csv *csv;
struct proprio *proprio;
int tpo_id;
proprietaires = xmalloc_zero(sizeof(struct f_proprietaire));
csv = &proprietaires->csv;
csv_open(csv, path, CSV_CONV_UTF8_TO_ISO8859, ';', 0);
while (csv_line(csv)) {
if (!isdigit(csv->line[0]))
continue; /* comment or header */
csv_int(csv, &tpo_id, NULL);
if (tpo_id >= PROPRIETAIRE_ID_MAX)
errx(1, "line %d: invalid proprietaire id %d too big", csv->line_count, tpo_id);
if (proprietaires->table[tpo_id]) {
warn_incoherent_data("line %d: proprietaire %d already exists, ignoring\n", csv->line_count, tpo_id);
continue;
}
proprio = malloc(sizeof(struct proprio));
proprio->tpo_id = tpo_id;
csv_str(csv, &proprio->tpo_lb);
verb("proprietaire id %d : %s\n", tpo_id, proprio->tpo_lb);
proprietaires->table[proprio->tpo_id] = proprio;
proprietaires->count++;
}
printf("%d proprietaires\n", proprietaires->count);
return proprietaires;
}
void
proprietaires_free(struct f_proprietaire *proprietaires)
{
int n;
for (n=0; n<PROPRIETAIRE_ID_MAX; n++)
if (proprietaires->table[n])
free(proprietaires->table[n]);
csv_close(&proprietaires->csv);
free(proprietaires);
}
const char *
proprietaire_get_name(struct f_proprietaire *f, int proprio)
{
if (proprio > PROPRIETAIRE_ID_MAX)
return "invalid id";
if (!f->table[proprio])
return "unknown";
return f->table[proprio]->tpo_lb;
}
struct f_station *
stations_load(char *path)
{
struct f_station *stations;
struct csv *csv;
struct station_dept *dept;
struct station_zone *zone;
struct station *sta;
struct tm *dte_latest;
stations = xmalloc_zero(sizeof(struct f_station));
csv = &stations->csv;
csv_open(csv, path, CSV_NORMAL, ';', 0);
while (csv_line(csv)) {
if (!isdigit(csv->line[0]))
continue; /* comment or header */
sta = malloc(sizeof(struct station));
csv_stanm(csv, &sta->sta_nm);
csv_int(csv, &sta->adm_id, NULL);
csv_int(csv, NULL, &sta->dem_nm_consis_str);
csv_date(csv, &sta->dte_implemntatation, &sta->dte_implemntatation_str);
csv_date(csv, &sta->dte_modif, &sta->dte_modif_str);
csv_date(csv, &sta->dte_en_service, &sta->dte_en_service_str);
sta->emetteur_count = 0;
bzero(sta->systeme_count, sizeof(sta->systeme_count));
sta->antenne_count = 0;
/* set station most recent date */
if (tm_diff(&sta->dte_implemntatation, &sta->dte_modif) > 0) {
if (tm_diff(&sta->dte_implemntatation, &sta->dte_en_service) > 0)
dte_latest = &sta->dte_implemntatation;
else
dte_latest = &sta->dte_en_service;
} else {
if (tm_diff(&sta->dte_modif, &sta->dte_en_service))
dte_latest = &sta->dte_modif;
else
dte_latest = &sta->dte_en_service;
}
memcpy(&sta->dte_latest, dte_latest, sizeof(struct tm));
/* update latest station date, except if date is more recent than now (incoherent data) */
if (tm_diff(&conf.now, dte_latest) > 0 && tm_diff(dte_latest, &stations->latest) > 0)
memcpy(&stations->latest, dte_latest, sizeof(struct tm));
/* insert the station in maching zone of departement */
if (!stations->depts[sta->sta_nm.dept]) {
stations->depts[sta->sta_nm.dept] = xmalloc_zero(sizeof(struct station_dept));
stations->dept_count++;
}
dept = stations->depts[sta->sta_nm.dept];
if (!dept->zones[sta->sta_nm.zone]) {
dept->zones[sta->sta_nm.zone] = xmalloc_zero(sizeof(struct station_zone));
dept->zone_count++;
stations->zone_count++;
}
zone = dept->zones[sta->sta_nm.zone];
if (zone->stations[sta->sta_nm.id]) {
warn_incoherent_data("line %d: station %s already exists, ignoring", csv->line_count, sta->sta_nm.str);
free(sta);
continue;
}
zone->stations[sta->sta_nm.id] = sta;
stations->station_count++;
zone->station_count++;
}
printf("%d stations in %d departement and %d zones\n", stations->station_count, stations->dept_count, stations->zone_count);
return stations;
}
void
stations_free(struct f_station *stations)
{
int ndept, nzone, id;
struct station_dept *dept;
struct station_zone *zone;
struct station *sta;
int freed_stations = 0;
for (ndept=0; ndept < STATION_DEPT_MAX; ndept++) {
dept = stations->depts[ndept];
if (!dept)
continue;
for (nzone=0; nzone < STATION_ZONE_MAX; nzone++) {
zone = dept->zones[nzone];
if (!zone)
continue;
for (id=0; id < STATION_ID_MAX; id++) {
sta = zone->stations[id];
if (!sta)
continue;
free(sta);
freed_stations++;
}
free(zone);
}
free(dept);
}
if (stations->station_count != freed_stations)
warnx("freed_stations %d != station_count %d", freed_stations, stations->station_count);
csv_close(&stations->csv);
free(stations);
}
struct station *
station_get(struct f_station *stations, struct sta_nm *nm)
{
if (!stations->depts[nm->dept])
errx(1, "station_get: departement %x not found for station %s", nm->dept, nm->str);
if (!stations->depts[nm->dept]->zones[nm->zone]) {
warn_incoherent_data("zone %d not found in departement %x when looking for station %s", nm->zone, nm->dept, nm->str);
return NULL;
}
return stations->depts[nm->dept]->zones[nm->zone]->stations[nm->id];
}
/* returns the next recently modified or en service station older than 'last' in 'table' sta_nm index
* in case of equality, station number is compared */
struct station *
station_get_next(struct f_station *stations, struct sta_nm *table, int count, struct station *last)
{
struct station *next = NULL, *sta;
int n, tmdiff1_last, tmdiff1_next, tmdiff2_last, tmdiff2_next;
struct tm *sta_date, *cmp_date;
for (n=0; n<count; n++) {
sta = station_get(stations, &table[n]);
if (!sta) {
warn_incoherent_data("station %s not found, ignoring", table[n].str);
continue;
}
tmdiff1_last = 0;
tmdiff1_next = 0;
tmdiff2_last = 0;
tmdiff2_next = 0;
sta_date = (sta->dte_modif_str[0]) ? &sta->dte_modif : &sta->dte_en_service;
if (last) {
cmp_date = (last->dte_modif_str[0]) ? &last->dte_modif : &last->dte_en_service;
tmdiff1_last = tm_diff(sta_date, cmp_date);
tmdiff2_last = tm_diff(&sta->dte_en_service, &last->dte_en_service);
}
if (next) {
cmp_date = (next->dte_modif_str[0]) ? &next->dte_modif : &next->dte_en_service;
tmdiff1_next = tm_diff(sta_date, cmp_date);
tmdiff2_next = tm_diff(&sta->dte_en_service, &next->dte_en_service);
}
if ( (!last || tmdiff1_last < 0 || (tmdiff1_last == 0 && (tmdiff2_last < 0 || (tmdiff2_last == 0 && sta->sta_nm.nm < last->sta_nm.nm))))
&& (!next || tmdiff1_next > 0 || (tmdiff1_next == 0 && (tmdiff2_next > 0 || (tmdiff2_next == 0 && sta->sta_nm.nm > next->sta_nm.nm)))) )
next = sta;
}
return next;
}
/* appends a text description of a station to 'desc'
* we use strbuf_*() macros to avoid poor performance of sprintf, as this function loops a lot during kml file generation */
int
station_description(struct f_type_antenne *types_antenne, struct station *sta, char *desc)
{
char *desc_start = desc;
struct emetteur *emr;
struct bande *ban;
struct antenne *aer;
int n, b, e;
/* summary */
strbuf_str(desc, " implementation: ");
strbuf_str(desc, sta->dte_implemntatation_str);
strbuf_str(desc, "\n modification: ");
strbuf_str(desc, sta->dte_modif_str);
strbuf_str(desc, "\n en service: ");
strbuf_str(desc, sta->dte_en_service_str);
strbuf_chr(desc, '\n');
strbuf_int(desc, sta->emetteur_count);
strbuf_str(desc, " emetteur");
if (sta->emetteur_count > 1)
strbuf_chr(desc, 's');
strbuf_chr(desc, '\n');
/* emetteurs list */
emr = NULL;
for (n=0; n<sta->emetteur_count; n++) {
emr = emetteur_get_next(sta->emetteurs, sta->emetteur_count, emr);
strbuf_chr(desc, '>');
strbuf_int(desc, n+1);
strbuf_chr(desc, ' ');
strbuf_str(desc, emr->emr_id_str);
strbuf_chr(desc, ' ');
strbuf_str(desc, emr->emr_lb_systeme);
strbuf_chr(desc, ' ');
strbuf_str(desc, emr->emr_dt_service_str);
strbuf_chr(desc, ' ');
for (b=0; b<emr->bande_count; b++) {
ban = emr->bandes[b];
strbuf_str(desc, ban->ban_nb_f_deb_str);
strbuf_chr(desc, '-');
strbuf_str(desc, ban->ban_nb_f_fin_str);
strbuf_str(desc, ban->ban_fg_unite);
strbuf_chr(desc, ' ');
}
strbuf_chr(desc, '\n');
}
/* antennes list */
strbuf_int(desc, sta->antenne_count);
strbuf_str(desc, " antenne");
if (sta->antenne_count > 1)
strbuf_chr(desc, 's');
strbuf_chr(desc, '\n');
aer = NULL;
for (n=0; n<sta->antenne_count; n++) {
aer = antenne_get_next(sta->antennes, sta->antenne_count, aer);
strbuf_chr(desc, '>');
strbuf_int(desc, n+1);
strbuf_chr(desc, ' ');
strbuf_str(desc, aer->aer_id_str);
strbuf_chr(desc, ' ');
strbuf_str(desc, type_antenne_get(types_antenne, aer->tae_id));
strbuf_chr(desc, ' ');
strbuf_str(desc, aer->aer_nb_dimension_str);
strbuf_chr(desc, 'm');
if (aer->aer_fg_rayon[0] == 'D')
strbuf_str(desc, " Directional ");
else if (aer->aer_fg_rayon[0] == 'N')
strbuf_str(desc, " Omnidirectional ");
strbuf_str(desc, aer->aer_nb_azimut_str);
strbuf_chr(desc, 'd');
strbuf_chr(desc, ' ');
strbuf_chr(desc, '+');
strbuf_str(desc, aer->aer_nb_alt_bas_str);
strbuf_chr(desc, '\n');
if (aer->emetteur_count > 0) {
emr = NULL;
strbuf_str(desc, " ");
for (e=0; e<aer->emetteur_count; e++) {
if (emr) {
strbuf_chr(desc, ',');
strbuf_chr(desc, ' ');
}
emr = aer->emetteurs[e];
strbuf_str(desc, emr->emr_id_str);
strbuf_chr(desc, ' ');
strbuf_str(desc, emr->emr_lb_systeme);
}
strbuf_chr(desc, '\n');
}
}
return desc - desc_start;
}
/* appends a string of all emetteur systemes present on a station to description, sorted by systemes count */
int
station_systemes(struct f_emetteur *emetteurs, struct station *sta, char *desc)
{
char *desc_start = desc;
int id = 0, count = 0;
char *lb = NULL;
while ( (count = next_smallest_positive_int(sta->systeme_count, SYSTEMES_ID_MAX, count, id, &id)) > 0 ) {
if (lb) {
strbuf_chr(desc, ',');
strbuf_chr(desc, ' ');
}
lb = emetteurs->systemes_lb[id];
strbuf_str(desc, lb);
strbuf_chr(desc, ' ');
strbuf_chr(desc, '(');
strbuf_int(desc, count);
strbuf_chr(desc, ')');
}
strbuf_chr(desc, '\n');
return desc - desc_start;
}
struct f_exploitant *
exploitants_load(char *path)
{
struct f_exploitant *exploitants;
struct csv *csv;
struct exploitant *exploitant;
int adm_id;
exploitants = xmalloc_zero(sizeof(struct f_exploitant));
csv = &exploitants->csv;
csv_open(csv, path, CSV_CONV_UTF8_TO_ISO8859, ';', 0);
while (csv_line(csv)) {
if (!isdigit(csv->line[0]))
continue; /* comment or header */
csv_int(csv, &adm_id, NULL);
if (adm_id >= EXPLOITANT_ID_MAX)
errx(1, "invalid exploitant id, too big (%d) at line %d", adm_id, csv->line_count);
if (exploitants->table[adm_id]) {
warn_incoherent_data("line %d: exploitant %d already exists, ignoring\n", csv->line_count, adm_id);
continue;
}
exploitant = malloc(sizeof(struct exploitant));
exploitant->adm_id = adm_id;
csv_str(csv, &exploitant->adm_lb_nom);
verb("exploitant id %d : %s\n", adm_id, exploitant->adm_lb_nom);
exploitants->table[exploitant->adm_id] = exploitant;
exploitants->count++;
}
printf("%d exploitants\n", exploitants->count);
return exploitants;
}
void
exploitants_free(struct f_exploitant *exploitants)
{
int n;
for (n=0; n<EXPLOITANT_ID_MAX; n++)
if (exploitants->table[n])
free(exploitants->table[n]);
csv_close(&exploitants->csv);
free(exploitants);
}
const char *
exploitant_get_name(struct f_exploitant *f, int adm_id)
{
if (adm_id < 0 || adm_id > EXPLOITANT_ID_MAX)
errx(1, "invalid exploitant id %d", adm_id);
if (!f->table[adm_id])
return "unknown";
return f->table[adm_id]->adm_lb_nom;
}
struct f_emetteur *
emetteurs_load(char *path, struct f_station *stations, struct f_antenne *antennes)
{
struct f_emetteur *emetteurs;
struct csv *csv;
struct emetteur *emr;
int emr_id, sys_id;
char *emr_id_str;
struct station *sta;
struct antenne *aer;
emetteurs = xmalloc_zero(sizeof(struct f_emetteur));
csv = &emetteurs->csv;
csv_open(csv, path, CSV_NORMAL, ';', 0);
while (csv_line(csv)) {