OLD | NEW |
1 /* | 1 /* |
2 ******************************************************************************** | 2 ******************************************************************************** |
3 * | 3 * |
4 * Copyright (C) 1996-2013, International Business Machines | 4 * Copyright (C) 1996-2014, International Business Machines |
5 * Corporation and others. All Rights Reserved. | 5 * Corporation and others. All Rights Reserved. |
6 * | 6 * |
7 ******************************************************************************** | 7 ******************************************************************************** |
8 */ | 8 */ |
9 #include <stdio.h> | 9 #include <stdio.h> |
10 #include <stdlib.h> | 10 #include <stdlib.h> |
11 #include <string.h> | 11 #include <string.h> |
12 #include <assert.h> | 12 #include <assert.h> |
13 #include <stdarg.h> | 13 #include <stdarg.h> |
14 #include <ctype.h> | 14 #include <ctype.h> |
(...skipping 501 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
516 | 516 |
517 /*print out result summary*/ | 517 /*print out result summary*/ |
518 | 518 |
519 ON_LINE=FALSE; /* just in case */ | 519 ON_LINE=FALSE; /* just in case */ |
520 | 520 |
521 if(knownList != NULL) { | 521 if(knownList != NULL) { |
522 if( udbg_knownIssue_print(knownList) ) { | 522 if( udbg_knownIssue_print(knownList) ) { |
523 fprintf(stdout, "(To run suppressed tests, use the -K option.) \n\n"); | 523 fprintf(stdout, "(To run suppressed tests, use the -K option.) \n\n"); |
524 } | 524 } |
525 udbg_knownIssue_close(knownList); | 525 udbg_knownIssue_close(knownList); |
| 526 knownList = NULL; |
526 } | 527 } |
527 | 528 |
528 if (ERROR_COUNT) | 529 if (ERROR_COUNT) |
529 { | 530 { |
530 fprintf(stdout,"\nSUMMARY:\n"); | 531 fprintf(stdout,"\nSUMMARY:\n"); |
531 fflush(stdout); | 532 fflush(stdout); |
532 fprintf(stdout,"******* [Total error count:\t%d]\n", ERROR_COUNT); | 533 fprintf(stdout,"******* [Total error count:\t%d]\n", ERROR_COUNT); |
533 fflush(stdout); | 534 fflush(stdout); |
534 fprintf(stdout, " Errors in\n"); | 535 fprintf(stdout, " Errors in\n"); |
535 for (i=0;i < ERRONEOUS_FUNCTION_COUNT; i++) | 536 for (i=0;i < ERRONEOUS_FUNCTION_COUNT; i++) |
(...skipping 163 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
699 UBool firstForWhere; | 700 UBool firstForWhere; |
700 | 701 |
701 if(NO_KNOWN) return FALSE; | 702 if(NO_KNOWN) return FALSE; |
702 if(pattern==NULL) pattern=""; | 703 if(pattern==NULL) pattern=""; |
703 | 704 |
704 vsprintf(buf, pattern, ap); | 705 vsprintf(buf, pattern, ap); |
705 knownList = udbg_knownIssue_open(knownList, ticket, gTestName, buf, | 706 knownList = udbg_knownIssue_open(knownList, ticket, gTestName, buf, |
706 &firstForTicket, &firstForWhere); | 707 &firstForTicket, &firstForWhere); |
707 | 708 |
708 if(firstForTicket || firstForWhere) { | 709 if(firstForTicket || firstForWhere) { |
709 log_info("(Known issue #%s) %s", ticket, buf); | 710 log_info("(Known issue #%s) %s\n", ticket, buf); |
710 } else { | 711 } else { |
711 log_verbose("(Known issue #%s) %s", ticket, buf); | 712 log_verbose("(Known issue #%s) %s\n", ticket, buf); |
712 } | 713 } |
713 | 714 |
714 return TRUE; | 715 return TRUE; |
715 } | 716 } |
716 | 717 |
717 | 718 |
718 void T_CTEST_EXPORT2 | 719 void T_CTEST_EXPORT2 |
719 vlog_info(const char *prefix, const char *pattern, va_list ap) | 720 vlog_info(const char *prefix, const char *pattern, va_list ap) |
720 { | 721 { |
721 first_line_info(); | 722 first_line_info(); |
(...skipping 578 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1300 if(failMsg) { | 1301 if(failMsg) { |
1301 fprintf(XML_FILE, ">\n\t\t<failure type=\"err\" message=\"%s\"/>\n\t</testca
se>\n", failMsg); | 1302 fprintf(XML_FILE, ">\n\t\t<failure type=\"err\" message=\"%s\"/>\n\t</testca
se>\n", failMsg); |
1302 } else { | 1303 } else { |
1303 fprintf(XML_FILE, "/>\n"); | 1304 fprintf(XML_FILE, "/>\n"); |
1304 } | 1305 } |
1305 | 1306 |
1306 return 0; | 1307 return 0; |
1307 } | 1308 } |
1308 | 1309 |
1309 | 1310 |
OLD | NEW |