-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdvr2plex.c
1425 lines (1226 loc) · 39 KB
/
dvr2plex.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 © Paul Chambers, 2019.
@ToDo Switch to UTF-8 string handling, rather than relying on ASCII backwards-compatibility
*/
#define _XOPEN_SOURCE 700
#include <features.h>
#include "dvr2plex.h"
#include <stdlib.h>
#include <stdio.h>
#include <errno.h>
#include <limits.h>
#include <sys/types.h>
#include <string.h>
#include <ctype.h>
#include <time.h>
#include <libgen.h> // for basename()
#include <pwd.h>
#define __USE_MISC // dirent.d_type is linux-specific, apparently
#include <dirent.h>
#define __USE_GNU
#include <unistd.h>
#include <sys/stat.h>
#include <dlfcn.h>
#include "dictionary.h"
/* hashes for patterns we are scanning for in the filename
this hash table is used to generate hashes used to match patterns.
it maps all digits to the same value, maps uppercase letters to
lowercase, and ignores several characters completely.
*/
#include "patterns.h"
/*
Hashes for the keywords/parameter names in the template. This hash table is also
used for series names.
Periods are ignored, because the trailing one is often omitted of series like
"S.W.A.T." and "Marvel's Agents of S.H.I.E.L.D.". By ignoring periods,
"S.W.A.T.", "S.W.A.T" and "SWAT" will all result in the same hash value.
Since periods may also be used as a separator, we have to treat ' ' and '_' as
equivalent, or the hash for a space-separated name won't match the hash of a
period- or underscore-seperated one.
In other words, ' ', '_' and '.' do not contribute to the series hash. Similarly,
apostrophes are also often omitted ("Marvel's" becomes "Marvels"), so it is
similarly ignored when generating a hash, along with '?' (e.g. "Whose Line Is It
Anyway?") and '!' ("I'm a Celebrity...Get Me Out of Here!").
"Marvel's Agents of S.H.I.E.L.D. (2017)" is perhaps one of the most difficult
matching examples I've seen in the wild. There are so many ways to mangle that.
':' is usually converted to '-' or omitted entirely, so ignore those, too.
Left and right brackets are also mapped to be equivalent, e.g. [2017] has the
same hash as (2017).
*/
#include "keywords.h"
string gMyName;
int gDebugLevel = 0;
unsigned int gNextYear = 1895;
tDictionary * gMainDict;
tDictionary * gPathDict;
tDictionary * gFileDict;
tDictionary * gSeriesDict;
string gCachedPath = NULL;
string gCachedSeries = NULL;
typedef struct sToken
{
struct sToken * next;
string start;
string end;
tHash hash;
unsigned char seperator;
} tToken;
tToken gTokenList;
/**
* trim any trailing whitespace from the end of the string
*
* @param line line to be trimmed
*/
void trimTrailingWhitespace(char * line)
{
char * t = line;
char * nwsp = line;
if ( t != NULL )
{
while (*t != '\0')
{
if (!isspace(*t++))
{
// note: t has already been incremented
nwsp = t;
}
}
*nwsp = '\0';
}
}
string lookupHash(tHash hash)
{
tKeywordHashMapping * keywordMap = KeywordHashLookup;
while ( keywordMap->key != 0 )
{
if ( hash == keywordMap->key )
{
return keywordMap->label;
}
keywordMap++;
}
tPatternHashMapping * patternMap = PatternHashLookup;
while ( patternMap->key != 0 )
{
if ( hash == patternMap->key )
{
return patternMap->label;
}
patternMap++;
}
return "<unknown>";
}
/**
* @brief look in the three dictionaries for the first occurance of a hash value
* @param hash
* @return
*/
string findParam( tHash hash )
{
string result;
result = findValue( gFileDict, hash );
if ( result == NULL )
{
result = findValue( gPathDict, hash );
}
if ( result == NULL )
{
result = findValue( gMainDict, hash );
}
return result;
}
/**
Hashes the 'series' using the 'keyword' hash table, since comparing series names needs
slightly different logic than scanning for patterns. Separators (spaces, periods,
underscores) are ignored completely. As are \', !, amd ?, since those are frequently
omitted. Upper case letters are mapped to lower case since those are also very
inconsistent (no UTF-8 handling yet, though). and '&' is expanded to 'and' in the
hash, so both forms will hash to the same value.
Since a series name may or may not be suffixed by a year or country surrounded
by brackets (e.g. (2019) or (US)). So a hash is added whenever a left bracket
is encountered, so the hash for 'Some Series' and 'Some Series (2019)' are both
stored in the series dictionary, so there will be a hash available to match
either with or without the suffix.
*/
void addSeries( string series )
{
tHash result = 0;
unsigned char * s = (unsigned char *)series;
unsigned char c;
do {
c = kKeywordMap[ *s++ ];
switch ( c )
{
// we hash the '&' character as if 'and' was used. so both forms generate the same hash
// e.g. the hash of 'Will & Grace' will match the hash of 'Will and Grace'
case '&':
result = fKeywordHashChar( result, 'a' );
result = fKeywordHashChar( result, 'n' );
result = fKeywordHashChar( result, 'd' );
break;
case kKeywordLBracket:
// we found something bracketed, e.g. (uk) or (2019), so we also add the
// intermediate hash to the dictionary, before we hash the bracketed content.
// Then if we hash the same series with the year omitted, for example, will
// still match something. Though we can't do much about a file that omits a
// a year or country, e.g. 'MacGyver' instead of 'MacGyver (2016)', or
// 'Hell's Kitchen' instead of 'Hell's Kitchen (US)'
//
// Note: if there are multiple left brackets encountered, there will be
// multiple intermediate hashes added.
addParam( gSeriesDict, result, series );
result = fKeywordHashChar( result, c );
break;
case '\0':
case kKeywordSeparator:
case kKeywordIgnored:
break;
default:
result = fKeywordHashChar( result, c );
break;
}
} while ( c != '\0' );
// also add the hash of the full string, including any trailing bracketed stuff
addParam( gSeriesDict, result, series );
}
static int scanDirFilter( const struct dirent * entry)
{
int result = 0;
result = ( entry->d_name[0] != '.' && entry->d_type == DT_DIR );
// debugf( 3, "%s, 0x%x, %d\n", entry->d_name, entry->d_type, result );
return result;
}
int buildSeriesDictionary( string path )
{
struct dirent **namelist;
int n;
n = scandir( path, &namelist, scanDirFilter, alphasort);
if ( n < 0 ) {
perror("scandir");
return n;
}
for ( int i = 0; i < n; ++i )
{
addSeries( namelist[ i ]->d_name );
free( namelist[ i ] );
}
free(namelist);
/* printDictionary( dictionary ); */
return 0;
}
void addSeasonEpisode( unsigned int season, unsigned int episode )
{
char temp[50];
snprintf( temp, sizeof(temp), "%02u", season );
addParam( gFileDict, kKeywordSeason, temp );
if ( season == 0 || episode == 0 )
{
addParam( gFileDict, kKeywordSeasonFolder, "Specials" );
}
else
{
snprintf( temp, sizeof(temp), "Season %02u", season );
addParam( gFileDict, kKeywordSeasonFolder, temp );
}
snprintf( temp, sizeof(temp), "%02u", episode );
addParam( gFileDict, kKeywordEpisode, temp );
}
void storeSeries( string series )
{
string result = series;
string ptr, end;
tHash hash;
unsigned char c;
ptr = series;
hash = 0;
addParam( gFileDict, kKeywordSeries, series );
// regenerate the hash incrementally, checking at each separator.
// remember the longest match, i.e. keep looking until the end of the string
do {
c = kKeywordMap[ (unsigned char)*ptr ];
switch ( c )
{
case kKeywordSeparator:
case '\0':
/* let's see if we have a match */
debugf( 4, "checking: 0x%016lx\n", hash );
string match = findValue( gSeriesDict, hash );
if ( match != NULL)
{
result = match;
debugf( 3, "matched %s\n", result );
end = ptr;
}
break;
case '&':
hash = fPatternHashChar( hash, 'a' );
hash = fPatternHashChar( hash, 'n' );
hash = fPatternHashChar( hash, 'd' );
break;
default:
hash = fPatternHashChar( hash, c );
break;
};
ptr++;
} while ( c != '\0' );
if ( result != series )
{
if ( *end != '\0' )
{
/* if the run is longer than the match with the series name,
then store the trailing remnant as the episode title */
addParam( gFileDict, kKeywordTitle, (string) end + 1 );
*(char *) end = '\0';
}
}
addParam( gFileDict, kKeywordDestSeries, result );
}
int storeToken( tHash hash, string value )
{
unsigned int season = 0;
unsigned int episode = 0;
unsigned int year = 0;
char temp[20];
string seriesName;
switch (hash)
{
case kPatternSnnEnn: // we found 'SnnEnn' or
case kPatternSyyyyEnn: // SyyyyEnnn
case kPatternSnnEn: // SnnEn
case kPatternSnEnn: // SnEnn
case kPatternSnEn: // SnEn
debugf( 3,"SnnEnn: %s\n", value);
sscanf( value, "%*1c%u%*1c%u", &season, &episode ); // ignore characters since we don't know their case
addSeasonEpisode( season, episode );
break;
case kPatternEnnn:
debugf( 3,"Ennn: %s\n", value);
sscanf( value, "%*1c%u", &episode ); // ignore characters since we don't know their case
season = episode / 100;
episode %= 100;
addSeasonEpisode( season, episode );
break;
case kPatternEnnnn:
debugf( 3,"Ennnn: %s\n", value);
sscanf( value, "%*1c%u", &episode ); // ignore characters since we don't know their case
unsigned int divisor = 100;
/* see if there's a season number to extract */
if ( ((episode / divisor) % 10) == 0 )
{
/* least significant digit of season is zero, so we can increase the divisor by 10 */
divisor *= 10;
}
season = episode / divisor;
episode %= divisor;
addSeasonEpisode( season, episode );
break;
case kPatternnXnn:
case kPatternnnXnn:
debugf( 3, "nnXnn: %s\n", value);
sscanf( value, "%u%*1c%u", &season, &episode ); // ignore characters since we don't know their case
addSeasonEpisode( season, episode );
break;
case kPatternYear:
sscanf( value, "%*1c%u%*1c", &year ); // ignore characters since we don't know their case
if ( 1890 < year && year <= gNextYear )
{
snprintf( temp, sizeof( temp ), "%u", year );
addParam( gFileDict, kKeywordYear, temp );
}
debugf( 3, "year: %u\n", year );
break;
case kPatternCountryUSA:
addParam( gFileDict, kKeywordCountry, "USA" );
break;
case kPatternCountryUS:
addParam( gFileDict, kKeywordCountry, "US" );
break;
case kPatternCountryUK:
addParam( gFileDict, kKeywordCountry, "UK" );
break;
case kPatternNoMatch:
seriesName = findParam( kKeywordSeries );
if ( seriesName == NULL )
{
debugf( 3, "series: %s\n", value );
storeSeries( value );
}
else
{
debugf( 3, "title: %s\n", value );
addParam( gFileDict, kKeywordTitle, value );
}
break;
// kPatternTwoDigits:
// kPatternFourDigits:
// kPatternSixDigits:
// kPatternEightDigits:
default:
break;
}
return 0;
}
tHash checkHash( tHash hash)
{
switch (hash)
{
case kPatternSnnEnn: // SnnEnn
case kPatternSyyyyEnn: // SnnnnEnn
case kPatternSnnEn: // SnnEn
case kPatternSnEnn: // SnEnn
case kPatternSnEn: // SnEn
case kPatternEnnn: // Ennn
case kPatternEnnnn: // Ennnn
case kPatternnXnn: // nXnn
case kPatternnnXnn: // nnXnn
case kPatternTwoDigits: // nn
case kPatternFourDigits: // nnnn
case kPatternSixDigits: // nnnnnn
case kPatternEightDigits: // nnnnnnnn
case kPatternCountryUSA: // (USA)
case kPatternCountryUS: // (US)
case kPatternCountryUK: // (UK)
case kPatternYear: // (nnnn)
break;
default:
hash = kPatternNoMatch;
break;
}
return hash;
}
void tokenizeName( string originalName )
{
gTokenList.next = NULL;
string name = strdup( originalName ); // copy it, because we'll terminate strings in place as we go
if ( name != NULL)
{
unsigned char c;
string start = name;
string ptr = start;
tHash hash = 0;
tToken * token = &gTokenList;
do {
c = kPatternMap[ *(unsigned char *)ptr ];
switch ( c )
{
case kPatternSeperator:
case '\0':
// reached the end of a token
token->next = calloc( 1, sizeof(tToken) );
token = token->next;
if ( token != NULL )
{
token->hash = checkHash( hash );
token->start = start;
token->end = ptr;
token->seperator = *ptr;
*(char *)ptr = '\0';
}
// only prepare for the next run if we're not at the end of the string
if ( c != '\0' )
{
// skip over a run of kPatternSeperator, if present (e.g. ' - ')
do { ptr++; } while ( kPatternMap[ *(unsigned char *)ptr ] == kPatternSeperator );
start = ptr;
hash = 0;
}
break;
case '&':
hash = fPatternHashChar( hash, 'a' );
hash = fPatternHashChar( hash, 'n' );
hash = fPatternHashChar( hash, 'd' );
ptr++;
break;
default:
hash = fPatternHashChar( hash, c );
ptr++;
break;
};
} while ( c != '\0' );
token = gTokenList.next;
while ( token != NULL )
{
debugf( 4, "token: \'%s\', \'%s\' (%c)\n", lookupHash( token->hash ), token->start, token->seperator );
token = token->next;
}
}
}
void freeTokenList( void )
{
tToken *nextToken;
tToken * token = gTokenList.next;
gTokenList.next = NULL;
while ( token != NULL )
{
nextToken = token->next;
free( token );
token = nextToken;
}
}
/*
* Channels DVR:
* air date: yyyy-mm-dd
* recorded: yyyy-mm-dd-hhss
* TVMosaic
* recorded: hhss-yyyymmdd
*
*/
void mergeDigits( void )
{
tToken * token[4];
token[0] = gTokenList.next;
while ( token[0] != NULL)
{
token[1] = token[0]->next;
switch ( token[0]->hash )
{
// Channels DVR: YYYY-mm-dd
// YYYY-mm-dd-hhss
// TVMosaic: HHSS-yyyymmdd
case kPatternFourDigits:
if ( token[1] != NULL)
{
token[2] = token[1]->next;
switch ( token[1]->hash )
{
// Channels DVR: YYYY-MM-dd
// YYYY-MM-dd-hhss
case kPatternTwoDigits:
if ( token[1]->seperator == '-' && token[2] != NULL)
{
switch ( token[2]->hash )
{
// Channels DVR: YYYY-MM-DD
// YYYY-MM-DD-hhss
case kPatternTwoDigits:
token[3] = token[2]->next;
if (token[3] != NULL)
{
switch ( token[3]->hash )
{
case kPatternFourDigits:
// ok, looks like we have YYYY-MM-DD-HHSS
token[0]->next = token[3]->next;
*(char *) token[0]->end = '-';
*(char *) token[1]->end = '-';
*(char *) token[2]->end = '-';
token[0]->end = token[3]->end;
token[0]->hash = kKeywordDateRecorded;
free( token[1] );
free( token[2] );
free( token[3] );
break;
default:
// ok, looks like we have YYYY-MM-DD
token[0]->next = token[2]->next;
*(char *) token[0]->end = '-';
*(char *) token[1]->end = '-';
token[0]->end = token[2]->end;
token[0]->hash = kKeywordFirstAired;
free( token[1] );
free( token[2] );
break;
}
}
break;
default:
break;
}
}
break;
// TVMosaic: HHSS-YYYYMMDD
case kPatternEightDigits:
token[0]->next = token[1]->next;
*(char *) token[0]->end = '-';
token[0]->end = token[1]->end;
token[0]->hash = kKeywordDateRecorded;
free( token[1] );
break;
default:
token[0]->hash = kPatternNoMatch;
break;
}
}
else
{
// last token, therefore four trailing digits, no metapattern
token[0]->hash = kPatternNoMatch;
}
break;
default:
// not kPatternFourDigits, ignore it.
break;
}
token[0] = token[0]->next;
}
}
void mergeNoMatch( void )
{
tToken * token;
tToken * nextToken;
token = gTokenList.next;
while ( token != NULL)
{
nextToken = token->next;
if ( nextToken != NULL && token->hash == kPatternNoMatch && nextToken->hash == kPatternNoMatch )
{
// combine the two kPatternNoMatch tokens
token->next = nextToken->next;
*(char *)token->end = ' ';
token->end = nextToken->end;
free( nextToken );
}
else
{
token = token->next;
}
}
/* Some tokens should also be appended as a suffix, while also retaining the token */
token = gTokenList.next;
while ( token != NULL)
{
nextToken = token->next;
if ( token->hash == kPatternNoMatch && nextToken != NULL )
{
switch ( nextToken->hash )
{
/* The tokens we treat as suffixes */
case kPatternCountryUK:
case kPatternCountryUS:
case kPatternCountryUSA:
case kPatternYear:
/* extend the kPatternNoMatch token to include the suffix */
*(char *)token->end = ' ';
token->end = nextToken->end;
break;
default:
break;
}
}
token = token->next;
}
}
int parseName( string name )
{
tToken * token = gTokenList.next;
tokenizeName( name );
mergeDigits();
mergeNoMatch();
debugf( 4, "%s\n", "after merging" );
token = gTokenList.next;
while ( token != NULL)
{
debugf( 4, "token: \'%s\', \'%s\' (%c)\n", lookupHash( token->hash ), token->start, token->seperator );
storeToken( token->hash, token->start );
token = token->next;
}
freeTokenList();
return 0;
}
/*
* carve up the path into directory path, basename and extension
* then pass basename onto parseName() to be processed
*/
int parsePath( string path )
{
int result = 0;
addParam( gFileDict, kKeywordSource, path );
string lastPeriod = strrchr( path, '.' );
string lastChar = path + strlen(path);
if ( lastPeriod != NULL && (lastChar - lastPeriod) < 5 )
{
addParam( gFileDict, kKeywordExtension, lastPeriod );
}
else
{
lastPeriod = lastChar;
}
string lastSlash = strrchr( path, '/' );
if ( lastSlash != NULL )
{
string p = strndup( path, lastSlash - path );
addParam( gFileDict, kKeywordPath, p );
free( (void *)p );
++lastSlash;
}
else
{
lastSlash = path; // no directories prefixed
}
string basename = strndup( lastSlash, lastPeriod - lastSlash );
addParam( gFileDict, kKeywordBasename, basename );
parseName( basename );
free( (void *)basename );
return result;
}
string buildString( string template )
{
string result = NULL;
string t = template;
char * s; // pointer into the returned string
result = calloc( 1, 32768 );
s = (char *)result;
if ( s != NULL )
{
unsigned char c = *t++; // unsigned because it is used as an array subscript when calculating the hash
while ( c != '\0' )
{
unsigned long hash;
string k;
switch (c)
{
case '{': // start of keyword
k = t; // remember where the keyword starts
// scan the keyword and generate its hash
hash = 0;
c = *t++;
while ( c != '\0' && c != '}' && c != '?' )
{
if ( kKeywordMap[ c ] != kKeywordSeparator ) /* we ignore some characters when calculating the hash */
{
hash = fKeywordHashChar( hash, c );
}
c = *t++;
}
if ( hash != kKeywordTemplate ) // don't want to expand a {template} keyword in a template!
{
string value = findParam( hash );
if ( value == NULL ) // not in the dictionaries, check for an environment variable
{
string envkey = strndup( k, t - k - 1 );
value = getenv( envkey );
if ( value != NULL )
{
debugf( 3, "env=\"%s\", value=\"%s\"\n", envkey, value );
}
free( (void *)envkey );
}
if ( c != '?' )
{
// end of keyword, and not the beginning of a ternary expression
if ( value != NULL )
{
s = stpcpy( s, value );
}
}
else
{ // ternary operator, like {param?true:false} (true or false can be absent)
c = *t++;
if ( value != NULL )
{
// copy the 'true' clause
while ( c != '}' && c != ':' && c != '\0' )
{
if ( c != '@' )
{
*s++ = c;
}
else
{
s = stpcpy( s, value );
}
c = *t++;
}
if ( c == ':' )
{
// skip over the 'false' clause
while ( c != '\0' && c != '}' )
{
c = *t++;
}
}
}
else // if undefined, skip over 'true' pattern, find the ':' (or trailing '}')
{
// value is undefined, so skip ahead to the false clause (or keyword end)
while ( c != ':' && c != '}' && c != '\0' )
{
c = *t++;
}
if ( c == ':' ) // did we find the 'false' clause?
{
c = *t++; // yep, so swallow the colon
// copy the 'false' clause into the string
// no '@' processing, as the parameter is not defined
while ( c != '\0' && c != '}' )
{
*s++ = c;
c = *t++;
}
}
}
}
} // if !{template}
break;
case '\\': // next template character is escaped, not interpreted, e.g. \{
c = *t++;
*s++ = c;
break;
default:
*s++ = c;
break;
} // switch
c = *t++;
}
*s = '\0'; // always terminate the string
}
return result;
}
int parseConfigFile( tDictionary * dictionary, string path )
{
int result = 0;
FILE * file;
char buffer[ 4096 ]; // 4K seems like plenty
if ( eaccess( path, R_OK ) != 0 ) // only attempt to parse it if there's something accessible there
{
// it's OK if the file is missing, otherwise complain
if ( errno != ENOENT )
{
fprintf( stderr,
"### Error: Unable to access config file \'%s\' (%d: %s)",
path, errno, strerror(errno));
result = errno;
}
}
else
{
debugf( 3, "config file: \'%s\'\n", path );
file = fopen(path, "r");
if (file == NULL)
{
fprintf( stderr, "### Error: Unable to open config file \'%s\' (%d: %s)\n",
path, errno, strerror(errno) );
result = errno;
}
else
{
while ( fgets( buffer, sizeof( buffer ), file) != NULL )
{
trimTrailingWhitespace( buffer );
debugf( 4,"line: \'%s\'\n", buffer );
tHash hash = 0;
string s = buffer;
while (isspace(*s)) {
s++;
}
unsigned char c = (unsigned char) *s++;
if (c != '\0') {
while (c != '\0' && c != '=') {
if ( c != kKeywordSeparator ) {
hash = fKeywordHashChar( hash, c );
}
c = (unsigned char) *s++;
}
if (c == '=') {
// skip over whitespace from the beginning of the value
while ( isspace(*s) ) {
s++;
}
trimTrailingWhitespace( (char *)s );
}
debugf( 4,"hash = 0x%016lx, value = \'%s\'\n", hash, s);
addParam( dictionary, hash, s );
}
}
fclose(file);
}
}
return result;
}
/**
* @brief Look for config files to process, and use them to update the main dictionary.
*
* First, look in /etc/<argv[0]>.conf then in ~/.config/<argv[0]>.conf, and finally the file
* passed as a -c parameter, if any, then any parameters on the command line (except -c)
* Where a parameter occurs more than once in a dictionary, the most recent definition 'wins'
*/
int parseConfig( string path )
{
int result = 0;
char temp[PATH_MAX];
snprintf( temp, sizeof( temp ), "/etc/%s.conf", gMyName );
debugf( 4, "/etc path: \"%s\"\n", temp );
result = parseConfigFile( gMainDict, temp );
if ( result == 0 )
{
string home = getenv("HOME");
if ( home == NULL)
{
home = getpwuid( getuid() )->pw_dir;
}
if ( home != NULL )
{
snprintf( temp, sizeof( temp ), "%s/.config/%s.conf", home, gMyName );
debugf( 4, "~ path: \"%s\"\n", temp );
result = parseConfigFile( gMainDict, temp );
}
}
if ( result == 0 && path != NULL )
{
struct stat fileStat;
if ( stat( path, &fileStat ) != 0 )