Mirrors/hackrf
2
0
Fork 0
mirror of https://github.com/greatscottgadgets/hackrf.git synced 2026-03-06 15:30:18 +01:00
Code Issues Packages Projects Releases Wiki Activity

Keep track of longest shortfall.

Browse Source 
This adds six cycles to the TX and RX shortfall paths.
This commit is contained in:
Martin Ling
2021-12-24 09:35:41 +00:00
parent a7bd1e3ede
commit 2c86f493d9
5 changed files with 22 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
host/hackrf-tools/src/hackrf_transfer.c
View File

@@ -1159,11 +1159,12 @@ int main(int argc, char** argv) {
if (result != HACKRF_SUCCESS)
fprintf(stderr, "\nhackrf_get_m0_state() failed: %s (%d)\n", hackrf_error_name(result), result);
else
fprintf(stderr, ", %d bytes %s in buffer, %u %s\n",
fprintf(stderr, ", %d bytes %s in buffer, %u %s, longest %u bytes\n",
tx ? state.m4_count - state.m0_count : state.m0_count - state.m4_count,
tx ? "filled" : "free",
state.num_shortfalls,
tx ? "underruns" : "overruns");
tx ? "underruns" : "overruns",
state.longest_shortfall);
} else {
fprintf(stderr, "\n");
}
@@ -1219,11 +1220,12 @@ int main(int argc, char** argv) {
"Transfer statistics:\n"
"%lu bytes transferred by M0\n"
"%lu bytes transferred by M4\n"
"%u %s\n",
"%u %s, longest %u bytes\n",
stats.m0_total,
stats.m4_total,
state.num_shortfalls,
(transmit || signalsource) ? "underruns" : "overruns");
(transmit || signalsource) ? "underruns" : "overruns",
state.longest_shortfall);
}
}