This repository has been archived by the owner on Aug 30, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 258
/
fault.c
1178 lines (1066 loc) · 37.6 KB
/
fault.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 2009-2012 Eucalyptus Systems, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; version 3 of the License.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see http://www.gnu.org/licenses/.
*
* Please contact Eucalyptus Systems, Inc., 6755 Hollister Ave., Goleta
* CA 93117, USA or visit http://www.eucalyptus.com/licenses/ if you need
* additional information or have any questions.
*
* This file may incorporate work covered under the following copyright
* and permission notice:
*
* Software License Agreement (BSD License)
*
* Copyright (c) 2008, Regents of the University of California
* All rights reserved.
*
* Redistribution and use of this software in source and binary forms,
* with or without modification, are permitted provided that the
* following conditions are met:
*
* Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE. USERS OF THIS SOFTWARE ACKNOWLEDGE
* THE POSSIBLE PRESENCE OF OTHER OPEN SOURCE LICENSED MATERIAL,
* COPYRIGHTED MATERIAL OR PATENTED MATERIAL IN THIS SOFTWARE,
* AND IF ANY SUCH MATERIAL IS DISCOVERED THE PARTY DISCOVERING
* IT MAY INFORM DR. RICH WOLSKI AT THE UNIVERSITY OF CALIFORNIA,
* SANTA BARBARA WHO WILL THEN ASCERTAIN THE MOST APPROPRIATE REMEDY,
* WHICH IN THE REGENTS' DISCRETION MAY INCLUDE, WITHOUT LIMITATION,
* REPLACEMENT OF THE CODE SO IDENTIFIED, LICENSING OF THE CODE SO
* IDENTIFIED, OR WITHDRAWAL OF THE CODE CAPABILITY TO THE EXTENT
* NEEDED TO COMPLY WITH ANY SUCH LICENSES OR RIGHTS.
************************************************************************/
// -*- mode: C; c-basic-offset: 4; tab-width: 4; indent-tabs-mode: nil -*-
// vim: set softtabstop=4 shiftwidth=4 tabstop=4 expandtab:
#define _FILE_OFFSET_BITS 64 // so large-file support works on 32-bit systems
#include <stdio.h>
#include <stdlib.h>
#define _GNU_SOURCE
#include <assert.h>
#include <dirent.h>
#include <errno.h>
#include <limits.h>
#include <locale.h>
#include <pthread.h>
#include <stdarg.h>
#include <string.h>
#include <unistd.h>
#include <wchar.h>
#include <sys/stat.h>
#include <ctype.h>
#include <libxml/parser.h>
#include <libxml/tree.h>
#include <eucalyptus-config.h>
#include <eucalyptus.h>
#include <misc.h>
#include <fault.h>
#include <wc.h>
#include <utf8.h>
/*
* These definitions are all easily customized.
*
* FIXME: Make some or all of them configuration-file options?
* FIXME: Make paths relative to some configurable base directory?
*/
#define FAULT_LOGFILE_SUFFIX "-fault.log"
#define DEFAULT_LOCALIZATION "en_US"
#define LOCALIZATION_ENV_VAR "LOCALE"
#define XML_SUFFIX ".xml"
#define COMMON_PREFIX "common" /* For .xml file defining common fault
labels */
#define LOCALIZED_TAG "localized"
#define MESSAGE_TAG "message"
#define STANDARD_FILESTREAM stderr
/*
* This is the order of priority (highest to lowest) for fault messages
* wrt customization & localization.
*
* Once a fault id has been found and added to the in-memory repository,
* all further occurrences of that fault in lower-priority faultdirs
* will be ignored. This is how we set the customization/localization
* pecking order.
*/
enum faultdir_types {
CUSTOM_LOCALIZED,
CUSTOM_DEFAULT_LOCALIZATION,
DISTRO_LOCALIZED,
DISTRO_DEFAULT_LOCALIZATION,
NUM_FAULTDIR_TYPES, /* For iterating. */
};
/*
* For output formatting
*/
#define STARS "************************************************************************"
#define BARS "" /* I want to remove these little monsters! */
/*
* Defines the order of labels in fault log entries.
*/
static char *fault_labels[] = { "condition",
"cause",
"initiator",
"location",
"resolution",
0,
};
/*
* NO USER-SERVICEABLE PARTS BEYOND THIS POINT
*/
/*
* Shared data
*/
// This holds the in-memory model of the fault registry.
static xmlDoc *ef_doc = NULL;
// Fault log filehandle.
static FILE *faultlog = NULL;
// Global equivalent to argv[0]'s basename.
extern char *program_invocation_short_name;
// FIXME: Thread safety is only half-baked at this point.
static pthread_mutex_t fault_mutex = PTHREAD_MUTEX_INITIALIZER;
// base install directory ($EUCALYPTUS) or '\0' if root
static char euca_base [PATH_MAX] = "";
// Linked list of faults being deliberately suppressed.
struct suppress_list {
char *id;
struct suppress_list *next;
};
static struct suppress_list *suppressed = NULL;
static struct suppress_list *redundant = NULL;
/*
* Function prototypes
*/
static xmlDoc *read_eucafault (const char *, const char *);
static char *get_fault_id (const xmlNode *);
static xmlNode *get_eucafault (const char *, const xmlDoc *);
static int scandir_filter (const struct dirent *);
static boolean str_end_cmp (const char *, const char *);
static char *str_trim_suffix (char *, const char *);
static boolean add_eucafault (const xmlDoc *);
static xmlNode *get_common_block (const xmlDoc *);
static char *get_common_var (const char *);
static char *get_fault_var (const char *, const xmlNode *);
static boolean format_eucafault (const char *, const char_map **);
static boolean initialize_faultlog (const char *);
static boolean check_eucafault_suppression (const char *, const char *);
static boolean is_suppressed_eucafault (const char *);
#ifndef HAVE_XMLFIRSTELEMENTCHILD
static xmlNodePtr xmlFirstElementChild (xmlNodePtr);
#endif // HAVE_XMLFIRSTELEMENTCHILD
/*
* Utility functions -- move to misc.c?
* (Might some of them already be there in one form or another?)
*/
/*
* Utility function:
* Compares end of one string to another string (the suffix) for a match.
*/
static boolean
str_end_cmp (const char *str, const char *suffix)
{
if (!str || !suffix) {
return FALSE;
}
size_t lenstr = strlen (str);
size_t lensuffix = strlen (suffix);
if (lensuffix > lenstr) {
return FALSE;
}
return strncmp (str + lenstr - lensuffix, suffix, lensuffix) == 0;
}
/*
* Utility function:
* Trims end of string off if it matches a supplied suffix.
*
* NOTE: The pointer returned by this function must be free()'d by the
* caller.
*/
static char *
str_trim_suffix (char *str, const char *suffix)
{
if (!str || !suffix || !str_end_cmp (str, suffix)) {
return (char *)str;
} else {
int trim = strlen (str) - strlen (suffix);
*(str + trim) = '\0';
logprintfl (EUCATRACE, "returning: %s\n", str);
}
return str;
}
/*
* Utility function:
* Used internally by scandir() to match filenames by suffix.
*/
static int
scandir_filter (const struct dirent *entry)
{
return str_end_cmp (entry->d_name, XML_SUFFIX);
}
#ifndef HAVE_XMLFIRSTELEMENTCHILD
/*
* Utility function:
*
* Needed for older versions of libxml2 (e.g. on RHEL/CentOS 5), which
* don't contain this function.
*/
static xmlNodePtr xmlFirstElementChild (xmlNodePtr parent)
{
xmlNodePtr child;
if (parent == NULL) {
return NULL;
}
for (child = parent->children; child != NULL; child = child->next) {
if (child->type == XML_ELEMENT_NODE) {
break;
}
}
return child;
}
#endif // HAVE_XMLFIRSTELEMENTCHILD
/*
* End utility functions.
*/
/*
* Returns TRUE if fault_id is being suppressed, FALSE otherwise.
*/
static boolean
is_suppressed_eucafault (const char *fault_id)
{
if (fault_id == NULL) {
logprintfl (EUCAWARN, "called with NULL argument...ignoring.\n");
return FALSE;
}
struct suppress_list *suppose = suppressed;
while (suppose) {
if (!strcmp (fault_id, suppose->id)) {
logprintfl (EUCATRACE, "returning TRUE for %s.\n",
fault_id);
return TRUE;
}
suppose = suppose->next;
}
logprintfl (EUCATRACE, "returning FALSE for %s.\n", fault_id);
return FALSE;
}
/*
* Returns TRUE if fault_id is being suppressed, FALSE otherwise.
*
* If second argument (fault_file) is non-NULL, checks path specified in
* arg for a zero-length file. If one is found, the specified fault_id
* will be added to the suppression list.
*
* If second argument is NULL, simply checks for presence of fault_id in
* suppression list by calling is_suppressed_eucafault().
*/
static boolean
check_eucafault_suppression (const char *fault_id, const char *fault_file)
{
if ((fault_id == NULL) && (fault_file == NULL)) {
logprintfl (EUCAWARN, "called with two NULL arguments...ignoring.\n");
return FALSE;
}
if (fault_file == NULL) {
// Degenerate case.
return is_suppressed_eucafault (fault_id);
} else if (fault_id != NULL){
if (is_suppressed_eucafault (fault_id)) {
logprintfl (EUCATRACE, "Detected already-suppressed fault id %s\n", fault_id);
return TRUE;
}
struct stat st;
if (stat (fault_file, &st) != 0) {
logprintfl (EUCAWARN, "stat() problem with %s: %s\n", fault_file,
strerror (errno));
return FALSE;
}
if (st.st_size == 0) {
logprintfl (EUCAINFO, "Suppressing fault id %s.\n", fault_id);
struct suppress_list *new_supp =
(struct suppress_list *)malloc (sizeof (struct suppress_list));
if (new_supp == NULL) {
logprintfl (EUCAERROR, "struct malloc() failed in check_eucafault_suppression while adding suppressed fault %s.\n", fault_id);
return FALSE;
}
if ((new_supp->id = (char *)strdup (fault_id)) == NULL) {
logprintfl (EUCAERROR, "string malloc() failed in check_eucafault_suppression while adding suppressed fault %s.\n", fault_id);
free (new_supp);
return FALSE;
}
// Insert at beginning of list.
new_supp->next = suppressed;
suppressed = new_supp;
return TRUE;
} else {
return FALSE;
}
}
logprintfl (EUCATRACE, "returning FALSE for %s, %s\n", SP(fault_id), SP(fault_file));
return FALSE;
}
/*
* Return an XML doc containing fault information for a given fault id.
*
* Assumes--indeed REQUIRES--that fault id matches filename prefix!
*/
static xmlDoc *
read_eucafault (const char *faultdir, const char *fault_id)
{
xmlDoc *my_doc = NULL;
char fault_file[PATH_MAX];
static int common_block_exists = 0;
snprintf (fault_file, PATH_MAX, "%s/%s%s", faultdir, fault_id, XML_SUFFIX);
logprintfl (EUCATRACE, "Attempting to load file %s\n", fault_file);
if (get_eucafault (fault_id, NULL) != NULL) {
logprintfl (EUCATRACE, "Looks like fault %s already exists.\n", fault_id);
return NULL;
}
if (check_eucafault_suppression (fault_id, fault_file)) {
logprintfl (EUCATRACE, "Looks like fault %s is being deliberately suppressed.\n",
fault_id);
return NULL;
}
my_doc = xmlParseFile (fault_file);
if (my_doc == NULL) {
logprintfl (EUCAWARN, "Could not parse file %s\n",
fault_file);
return NULL;
} else {
logprintfl (EUCATRACE, "Successfully parsed file %s\n",
fault_file);
}
if (get_eucafault (fault_id, my_doc) != NULL) {
logprintfl (EUCATRACE, "Found fault id %s in %s\n", fault_id, fault_file);
} else if (get_common_block (my_doc) != NULL) {
logprintfl (EUCATRACE, "Found <%s> block in %s\n", COMMON_PREFIX, fault_file);
if (common_block_exists++) {
logprintfl (EUCATRACE, "<%s> block already exists--skipping.\n", COMMON_PREFIX);
xmlFreeDoc (my_doc);
return NULL;
}
} else {
logprintfl (EUCAWARN, "Did not find fault id %s in %s -- found fault id %s instead. (Not adding fault.)\n", fault_id, fault_file, get_fault_id (xmlFirstElementChild (xmlDocGetRootElement (my_doc))));
xmlFreeDoc (my_doc);
return NULL;
}
return my_doc;
}
/*
* Adds XML doc for a fault to the in-memory fault registry (doc).
* Creates registry if none exists yet.
*
* Can also add COMMON_PREFIX (<common>) block.
*/
static boolean
add_eucafault (const xmlDoc *new_doc)
{
if (xmlDocGetRootElement (ef_doc) == NULL) {
logprintfl (EUCATRACE, "Creating new document.\n");
ef_doc = xmlCopyDoc ((xmlDoc *)new_doc, 1); /* 1 == recursive copy */
if (ef_doc == NULL) {
logprintfl (EUCAERROR, "Problem creating fault registry.\n");
return FALSE;
}
} else {
logprintfl (EUCATRACE, "Appending to existing document.\n");
if (xmlAddNextSibling (xmlFirstElementChild (xmlDocGetRootElement (ef_doc)),
xmlFirstElementChild (xmlDocGetRootElement ((xmlDoc *)new_doc))) == NULL) {
logprintfl (EUCAERROR, "Problem adding fault to existing registry.\n");
return FALSE;
}
}
return TRUE;
}
/*
* Returns the fault id found in a fault node.
*/
static char *
get_fault_id (const xmlNode *node)
{
if (node == NULL) {
return NULL;
}
/*
* Does case-insensitive string comparison on the attribute name & value.
* (These are technically case-sensitive in XML, but I'm being
* forgiving of minor transgressions in order to have happier users.)
*/
if ((node->type == XML_ELEMENT_NODE) &&
!strcasecmp ((const char *)node->name, "fault")) {
for (xmlAttr *attr = node->properties; attr; attr = attr->next) {
if (!strcasecmp ((const char *)attr->name, "id")) {
return (char *)attr->children->content;
}
}
}
return NULL;
}
/*
* Returns true (1) if common block exists in doc, false (0) if not.
*/
static xmlNode *
get_common_block (const xmlDoc *doc)
{
if (doc == NULL) {
return NULL;
}
for (xmlNode *node =
xmlFirstElementChild (xmlDocGetRootElement ((xmlDoc *)doc));
node; node = node->next) {
if (node->type == XML_ELEMENT_NODE) {
if (!strcasecmp ((const char *)node->name, COMMON_PREFIX)) {
logprintfl (EUCATRACE, "Found <%s> block.\n", COMMON_PREFIX);
return node;
}
}
}
return NULL;
}
/*
* Returns fault node if fault id exists in registry, NULL if not.
*
* Uses global fault registry unless a non-NULL doc pointer is passed as a
* parameter, so it can be used either to match a fault id in a single
* doc or to determine if a fault id already exists in the overall
* registry.
*
* If NULL id supplied, simply returns the first fault node in document.
*/
static xmlNode *
get_eucafault (const char *id, const xmlDoc *doc)
{
/*
* Uses global registry if no doc supplied.
*/
if (doc == NULL) {
doc = ef_doc;
}
for (xmlNode *node =
xmlFirstElementChild (xmlDocGetRootElement ((xmlDoc *)doc));
node; node = node->next) {
char *this_id = get_fault_id (node);
if (id == NULL) {
return node;
} else if ((this_id != NULL) && !strcasecmp (this_id, id)) {
return node;
}
}
return NULL;
}
/*
* Builds up the fault log path from supplied argument and configured
* directory prefix. If passed NULL, tries to determine process name and
* uses that for building up the path.
*
* Returns TRUE if fault logfile successfully opened, FALSE otherwise
* (meaning logging is to console).
*/
static boolean
initialize_faultlog (const char *fileprefix)
{
char faultlogpath[PATH_MAX];
char *fileprefix_i;
if (fileprefix == NULL) {
faultlog = STANDARD_FILESTREAM;
return TRUE;
} else if (strlen (fileprefix) == 0) {
// FIXME: program_infocation_short_name is a GNU'ism and is not
// portable--should wrap with an autoconf check.
snprintf (faultlogpath, PATH_MAX, EUCALYPTUS_LOG_DIR "/%s"
FAULT_LOGFILE_SUFFIX, euca_base,
program_invocation_short_name);
} else {
// Prune any leading directores from path.
fileprefix_i = rindex (fileprefix, '/');
if (fileprefix_i != NULL) {
fileprefix = fileprefix_i + 1;
}
snprintf (faultlogpath, PATH_MAX, EUCALYPTUS_LOG_DIR "/%s"
FAULT_LOGFILE_SUFFIX, euca_base, fileprefix);
}
logprintfl (EUCATRACE, "Initializing faultlog using %s\n", faultlogpath);
faultlog = fopen (faultlogpath, "a+");
if (faultlog == NULL) {
logprintfl (EUCAERROR, "Cannot open fault log file %s: %s\n",
faultlogpath, strerror (errno));
logprintfl (EUCAERROR, "Logging faults to the console...\n");
faultlog = STANDARD_FILESTREAM;
return FALSE;
} else {
return TRUE;
}
}
/*
* EXTERNAL ENTRY POINT
*
* Builds the localized fault registry from XML files supplied in
* various directories.
*
* Returns the number of faults successfully loaded into registry. If
* the registry was previously loaded, returns the number of previously
* loaded faults as a negative number.
*/
int
init_eucafaults (char *fileprefix)
{
struct stat dirstat;
static int faults_loaded = 0;
char *locale = NULL;
static char faultdirs[NUM_FAULTDIR_TYPES][PATH_MAX];
pthread_mutex_lock (&fault_mutex);
if (faults_loaded) {
logprintfl (EUCATRACE, "Attempt to reinitialize fault registry? Skipping...\n");
pthread_mutex_unlock (&fault_mutex);
return -faults_loaded; // Negative return because already loaded.
}
char *euca_env = getenv (EUCALYPTUS_ENV_VAR_NAME);
if (euca_env) {
strncpy (euca_base, euca_env, MAX_PATH - 1);
}
initialize_faultlog (fileprefix);
logprintfl (EUCATRACE, "Initializing fault registry directories.\n");
if ((locale = getenv (LOCALIZATION_ENV_VAR)) == NULL) {
logprintfl (EUCAINFO,
"$%s not set, using default value of: %s\n",
LOCALIZATION_ENV_VAR, DEFAULT_LOCALIZATION);
}
LIBXML_TEST_VERSION;
/* Cycle through list of faultdirs in priority order, noting any missing. */
if (locale != NULL) {
snprintf (faultdirs[CUSTOM_LOCALIZED], PATH_MAX,
EUCALYPTUS_CUSTOM_FAULT_DIR "/%s/", euca_base, locale);
} else {
faultdirs[CUSTOM_LOCALIZED][0] = 0;
}
snprintf (faultdirs[CUSTOM_DEFAULT_LOCALIZATION], PATH_MAX,
EUCALYPTUS_CUSTOM_FAULT_DIR "/%s/", euca_base,
DEFAULT_LOCALIZATION);
if (locale != NULL) {
snprintf (faultdirs[DISTRO_LOCALIZED], PATH_MAX, EUCALYPTUS_FAULT_DIR
"/%s/", euca_base, locale);
} else {
faultdirs[DISTRO_LOCALIZED][0] = 0;
}
snprintf (faultdirs[DISTRO_DEFAULT_LOCALIZATION], PATH_MAX,
EUCALYPTUS_FAULT_DIR "/%s/", euca_base, DEFAULT_LOCALIZATION);
for (int i = 0; i < NUM_FAULTDIR_TYPES; i++) {
if (faultdirs[i][0]) {
if (stat (faultdirs[i], &dirstat) != 0) {
logprintfl (EUCAINFO, "stat() problem with %s: %s\n",
faultdirs[i], strerror (errno));
} else if (!S_ISDIR (dirstat.st_mode)) {
logprintfl (EUCAINFO,
"stat() problem with %s: Not a directory\n",
faultdirs[i], strerror (errno));
} else {
struct dirent **namelist;
int numfaults = scandir (faultdirs[i], &namelist, &scandir_filter,
alphasort);
if (numfaults == 0) {
logprintfl (EUCADEBUG, "No faults found in %s\n", faultdirs[i]);
} else {
logprintfl (EUCADEBUG, "Found %d %s files in %s\n", numfaults, XML_SUFFIX,
faultdirs[i]);
while (numfaults--) {
xmlDoc *new_fault = read_eucafault (faultdirs[i], str_trim_suffix (namelist[numfaults]->d_name, XML_SUFFIX));
free (namelist[numfaults]);
if (new_fault) {
if (add_eucafault (new_fault)) {
faults_loaded++;
}
xmlFreeDoc (new_fault);
} else {
logprintfl (EUCATRACE, "Not adding new fault--mismatch or already exists...?\n");
}
}
free (namelist);
}
}
}
}
pthread_mutex_unlock (&fault_mutex);
logprintfl (EUCAINFO, "Loaded %d eucafault descriptions into registry.\n",
faults_loaded);
return faults_loaded;
}
/*
* Retrieves a translated label from <common> block.
*
* NOTE: The pointer returned by this function must be free()'d by the
* caller.
*
* FIXME: Consolidate this with get_fault_id() and make some sort of
* general-purpose fetch function? Or make get_fault_id() more general
* and change this to call it?
*
* FIXME: Consolidate with get_fault_var()?
*/
static char *
get_common_var (const char *var)
{
xmlNode *c_node = NULL;
if ((c_node = get_common_block (ef_doc)) == NULL) {
logprintfl (EUCAWARN, "Did not find <%s> block\n", COMMON_PREFIX);
return strdup (var);
}
for (xmlNode *node = xmlFirstElementChild (c_node); node;
node = node->next) {
if ((node->type == XML_ELEMENT_NODE) &&
!strcasecmp ((const char *)node->name, "var")) {
xmlChar *prop = xmlGetProp (node, (const xmlChar *)"name");
if (!strcasecmp (var, (char *)prop)) {
xmlChar *value = NULL;
xmlFree (prop);
value = xmlGetProp (node, (const xmlChar *)LOCALIZED_TAG);
if (value == NULL) {
value = xmlGetProp (node, (const xmlChar *)"value");
}
return (char *)value;
} else {
xmlFree (prop);
}
}
}
// If nothing useful is found, return original variable-name string.
logprintfl (EUCAWARN, "Did not find label '%s'\n", var);
return strdup (var);
}
/*
* Retrieves a translated label from <fault> block.
*
* NOTE: The pointer returned by this function must be free()'d by the
* caller.
*
* FIXME: Consolidate with get_common_var()?
*
* FIXME: Gosh this looks messy.
*/
static char *
get_fault_var (const char *var, const xmlNode *f_node)
{
if ((f_node == NULL) || (var == NULL)) {
logprintfl (EUCAWARN, "called with one or more NULL arguments.\n");
return NULL;
}
// Just in case we're matching the top-level node.
// FIXME: Move this into a new tmfunction to eliminate repeated logic below?
if ((f_node->type == XML_ELEMENT_NODE) &&
!strcasecmp ((const char *)f_node->name, var)) {
xmlChar *value = xmlGetProp ((xmlNode *)f_node,
(const xmlChar *)LOCALIZED_TAG);
if (value == NULL) {
value = xmlGetProp ((xmlNode *)f_node,
(const xmlChar *)MESSAGE_TAG);
}
// This is a special (parent) case, so it doesn't handle
// message/localized text in a child node.
return (char *)value;
}
for (xmlNode *node = xmlFirstElementChild ((xmlNode *)f_node); node;
node = node->next) {
if ((node->type == XML_ELEMENT_NODE) &&
!strcasecmp ((const char *)node->name, var)) {
xmlChar *value = xmlGetProp (node, (const xmlChar *)LOCALIZED_TAG);
if (value == NULL) {
value = xmlGetProp (node, (const xmlChar *)MESSAGE_TAG);
}
if (value == NULL) {
// May be a child node, e.g. for "resolution"
for (xmlNode *subnode = xmlFirstElementChild (node); subnode;
subnode = subnode->next) {
if ((node->type == XML_ELEMENT_NODE) &&
!strcasecmp ((const char *)subnode->name,
LOCALIZED_TAG)) {
return (char *)xmlNodeGetContent (subnode);
}
}
// FIXME: More elegant method than another list walk?
for (xmlNode *subnode = xmlFirstElementChild (node); subnode;
subnode = subnode->next) {
if ((node->type == XML_ELEMENT_NODE) &&
!strcasecmp ((const char *)subnode->name,
MESSAGE_TAG)) {
return (char *)xmlNodeGetContent (subnode);
}
}
}
return (char *)value;
}
}
logprintfl (EUCAWARN, "Did not find <%s> message in get_fault_var().\n",
var);
return NULL;
}
/*
* Formats fault-log output and sends to fault log (or stdout/stderr).
*/
static boolean
format_eucafault (const char *fault_id, const char_map **map)
{
static int max_label_len = 0;
char *fault_var = NULL;
time_t secs;
struct tm lt;
xmlNode *fault_node = get_eucafault (fault_id, NULL);
if (fault_node == NULL) {
logprintfl (EUCAERROR,
"Fault %s detected, could not find fault id in registry.\n",
fault_id);
return FALSE;
}
// Determine label alignment. (Only needs to be done once.)
if (!max_label_len) {
for (int i = 0; fault_labels[i]; i++) {
int label_len = 0;
int w_label_len = 0;
char *label = get_common_var (fault_labels[i]);
label_len = strlen (label);
w_label_len = utf8_to_wchar (label, label_len, NULL, 0, 0);
free (label);
if (w_label_len > max_label_len) {
max_label_len = w_label_len;
}
}
}
// Top border.
fprintf (faultlog, "%s\n", STARS);
// Get time.
secs = time (NULL);
if (localtime_r (&secs, <) == NULL) {
// Someone call Dr. Who.
lt.tm_year = lt.tm_mon = lt.tm_mday = 0;
lt.tm_hour = lt.tm_min = lt.tm_sec = 0;
} else {
// Account for implied offsets in struct.
lt.tm_year += 1900;
lt.tm_mon += 1;
}
// Construct timestamped fault header.
fprintf (faultlog, " ERR-%s %04d-%02d-%02d %02d:%02d:%02dZ ", fault_id,
lt.tm_year, lt.tm_mon, lt.tm_mday,
lt.tm_hour, lt.tm_min, lt.tm_sec);
if ((fault_var = get_fault_var ("fault", fault_node)) != NULL) {
char *fault_subbed = NULL;
if ((fault_subbed = c_varsub (fault_var, map)) != NULL) {
fprintf (faultlog, "%s\n\n", fault_subbed);
} else {
fprintf (faultlog, "%s\n\n", fault_var);
}
free (fault_subbed);
free (fault_var);
} else {
char *common_var = get_common_var ("unknown");
fprintf (faultlog, "%s\n\n", common_var);
free (common_var);
}
// Construct fault information lines.
for (int i = 0; fault_labels[i]; i++) {
int w_common_var_len = 0;
int common_var_len = 0;
int padding = 0;
char *common_var = get_common_var (fault_labels[i]);
common_var_len = strlen (common_var);
w_common_var_len = utf8_to_wchar (common_var, common_var_len, NULL, 0,
0);
padding = max_label_len - w_common_var_len + 1;
fprintf (faultlog, "%s%*s %s: ", BARS, padding, " ", common_var);
free (common_var);
if ((fault_var = get_fault_var (fault_labels[i], fault_node)) != NULL) {
char *fault_subbed = NULL;
if ((fault_subbed = c_varsub (fault_var, map)) != NULL) {
fprintf (faultlog, "%s", fault_subbed);
} else {
fprintf (faultlog, "%s", fault_var);
}
free (fault_subbed);
free (fault_var);
} else {
common_var = get_common_var ("unknown");
fprintf (faultlog, "%s", common_var);
free (common_var);
}
fprintf (faultlog, "\n");
}
// Bottom border.
fprintf (faultlog, "%s\n\n", STARS);
fflush (faultlog);
return TRUE;
}
/*
* Checks if this fault has already been logged with the same
* set of parameters.
*
* Returns TRUE if so, FALSE otherwise.
*/
boolean
is_redundant_eucafault (const char *fault_id, const char_map **vars)
{
// just concatenate everything together: fault_id+key1+val1+key2...
char * new = strdup (fault_id);
for (int i = 0; vars && vars[i] != NULL; i++) {
const char_map * v = vars[i];
new = strdupcat (new, v->key);
new = strdupcat (new, v->val);
}
// see if it is already in our linked list (TODO: switch to a more efficient data structure)
for (struct suppress_list * s = redundant; s != NULL; s = s->next) {
char * old = s->id;
// compare strings ourselves (instead of strcmp) so we can bail early
int i;
for (i = 0; new [i] != '\0' && old [i] != '\0'; i++)
if (new [i] != old [i])
break; // not the same string
if (new [i] == '\0' && old [i] == '\0') { // found the match in the LL
free (new);
return TRUE;
}
}
// was not found, so add it to the list
struct suppress_list * s = calloc (1, sizeof (struct suppress_list));
s->id = new;
if (redundant == NULL) {
redundant = s;
} else {
redundant->next = s;
}
return FALSE;
}
/*
* EXTERNAL ENTRY POINT
*
* Logs a fault, initializing the fault registry, if necessary.
*
* Returns TRUE if fault successfully logged, FALSE otherwise.
*/
boolean
log_eucafault_map (const char *fault_id, const char_map **map)
{
int load = init_eucafaults (NULL);
logprintfl (EUCATRACE, "init_eucafaults() returned %d\n", load);
if (is_suppressed_eucafault (fault_id)) {
logprintfl (EUCADEBUG, "Fault %s detected, but it is being actively suppressed.\n", fault_id);
return FALSE;
}
if (is_redundant_eucafault (fault_id, map)) {
logprintfl (EUCADEBUG, "Fault %s detected, but it has already been logged.\n", fault_id);
return FALSE;
}
return format_eucafault (fault_id, map);
}
/*
* EXTERNAL ENTRY POINT
*
* Logs a fault, initializing the fault registry, if necessary.
*
* Returns the number of substitution parameters it was called with,
* returning it as a negative number if the underlying log_eucafault_map()
* call returned FALSE.
*/
int
log_eucafault (const char *fault_id, ...)
{
va_list argv;
char *token[2];
char_map **m = NULL;
int count = 0;
int load = init_eucafaults (NULL);
logprintfl (EUCATRACE, "init_eucafaults() returned %d\n", load);
va_start (argv, fault_id);
while ((token[count % 2] = va_arg (argv, char *)) != NULL) {
++count;
if (! (count % 2)) {
m = c_varmap_alloc (m, token[0], token[1]);
}
}
va_end (argv);
if (count % 2) {
logprintfl (EUCAWARN, "called with an odd (unmatched) number of substitution parameters: %d\n", count);
}
if (!log_eucafault_map (fault_id, (const char_map **)m)) {
logprintfl (EUCATRACE, "got FALSE from log_eucafault_map()\n");
count *= -1;
}