| 86 | data.holdover_multiplier_ns = data.ingress_time_ns * 3; |
| 87 | } |
| 88 | return 0; |
| 89 | } |
| 90 | |
| 91 | int reader_thread(fbclock_shmdata* shmp, int tries) { |
| 92 | int err; |
| 93 | fbclock_clockdata data; |
| 94 | for (int i = 0; i < tries; i++) { |
| 95 | err = fbclock_clockdata_load_data(shmp, &data); |
| 96 | if (err != 0) { |
| 97 | return err; |
| 98 | } |
| 99 | if (data.ingress_time_ns * 2 != data.error_bound_ns) { |
| 100 | printf("ingress_time_ns: %lu\n", data.ingress_time_ns); |
| 101 | printf("error_bound_ns: %d\n", data.error_bound_ns); |
| 102 | printf("holdover_multiplier_ns: %d\n", data.holdover_multiplier_ns); |
| 103 | return -1; |
| 104 | } |
| 105 | if (data.ingress_time_ns * 3 != data.holdover_multiplier_ns) { |
| 106 | printf("ingress_time_ns: %lu\n", data.ingress_time_ns); |
| 107 | printf("error_bound_ns: %d\n", data.error_bound_ns); |
| 108 | printf("holdover_multiplier_ns: %d\n", data.holdover_multiplier_ns); |
| 109 | return -1; |
| 110 | } |
| 111 | } |
| 112 | return 0; |
| 113 | } |
nothing calls this directly
no test coverage detected
searching dependent graphs…