GitHub/dsd-fme
1
0
Fork 0
mirror of https://github.com/lwvmobile/dsd-fme.git synced 2026-11-14 01:37:25 -05:00
Code Issues Packages Projects Releases Wiki Activity

Direct all prints to STDERR

Browse Source 
Direct all prints to STDERR
Take 2
This commit is contained in:
lwvmobile
2022-02-10 16:56:37 -05:00
committed by GitHub
parent 05b9e29724
commit fcf680a138
32 changed files with 623 additions and 626 deletions
Download Patch File Download Diff File Expand all files Collapse all files

52
src/p25p1_check_ldu.cpp
View File

@@ -38,32 +38,32 @@ int check_and_fix_reedsolomon_24_12_13(char* data, char* parity)
int irrecoverable_error = reed_solomon_24_12_13.decode(data, parity);
#ifdef CHECK_LDU_DEBUG
printf("Results for Reed-Solomon code (24,12,13)\n\n");
fprintf (stderr, "Results for Reed-Solomon code (24,12,13)\n\n");
if (irrecoverable_error == 0) {
printf(" i original fixed\n");
fprintf (stderr, " i original fixed\n");
for (int i = 0; i < 12; i++) {
printf("%3d [", i);
fprintf (stderr, "%3d [", i);
for (int j = 0; j < 6; j++) {
printf("%c", (original[i][j] == 1)? 'X' : ' ');
fprintf (stderr, "%c", (original[i][j] == 1)? 'X' : ' ');
}
printf("] [");
fprintf (stderr, "] [");
for (int j = 0; j < 6; j++) {
printf("%c", (data[i*6+j] == 1)? 'X' : ' ');
fprintf (stderr, "%c", (data[i*6+j] == 1)? 'X' : ' ');
}
printf("]\n");
fprintf (stderr, "]\n");
}
} else {
printf("Irrecoverable errors found\n");
printf(" i original fixed\n");
fprintf (stderr, "Irrecoverable errors found\n");
fprintf (stderr, " i original fixed\n");
for (int i = 0; i < 12; i++) {
printf("%3d [", i);
fprintf (stderr, "%3d [", i);
for (int j = 0; j < 6; j++) {
printf("%c", (original[i][j] == 1)? 'X' : ' ');
fprintf (stderr, "%c", (original[i][j] == 1)? 'X' : ' ');
}
printf("]\n");
fprintf (stderr, "]\n");
}
}
printf("\n");
fprintf (stderr, "\n");
#endif
return irrecoverable_error;
@@ -88,32 +88,32 @@ int check_and_fix_reedsolomon_24_16_9(char* data, char* parity)
int irrecoverable_error = reed_solomon_24_16_9.decode(data, parity);
#ifdef CHECK_LDU_DEBUG
printf("Results for Reed-Solomon code (24,16,9)\n\n");
fprintf (stderr, "Results for Reed-Solomon code (24,16,9)\n\n");
if (irrecoverable_error == 0) {
printf(" i original fixed\n");
fprintf (stderr, " i original fixed\n");
for (int i = 0; i < 16; i++) {
printf("%3d [", i);
fprintf (stderr, "%3d [", i);
for (int j = 0; j < 6; j++) {
printf("%c", (original[i][j] == 1)? 'X' : ' ');
fprintf (stderr, "%c", (original[i][j] == 1)? 'X' : ' ');
}
printf("] [");
fprintf (stderr, "] [");
for (int j = 0; j < 6; j++) {
printf("%c", (data[i*6+j] == 1)? 'X' : ' ');
fprintf (stderr, "%c", (data[i*6+j] == 1)? 'X' : ' ');
}
printf("]\n");
fprintf (stderr, "]\n");
}
} else {
printf("Irrecoverable errors found\n");
printf(" i original fixed\n");
fprintf (stderr, "Irrecoverable errors found\n");
fprintf (stderr, " i original fixed\n");
for (int i = 0; i < 16; i++) {
printf("%3d [", i);
fprintf (stderr, "%3d [", i);
for (int j = 0; j < 6; j++) {
printf("%c", (original[i][j] == 1)? 'X' : ' ');
fprintf (stderr, "%c", (original[i][j] == 1)? 'X' : ' ');
}
printf("]\n");
fprintf (stderr, "]\n");
}
}
printf("\n");
fprintf (stderr, "\n");
#endif
return irrecoverable_error;