Searched refs:underflows (Results 1 – 9 of 9) sorted by relevance
1 * Fix FIFO/buffer overflows and underflows
36 result underflows before rounding, but becomes a normalised number
453 const unsigned int *underflows, in check_entry_size_and_hooks() argument482 if ((unsigned char *)e - base == underflows[h]) { in check_entry_size_and_hooks()486 newinfo->underflow[h] = underflows[h]; in check_entry_size_and_hooks()
596 const unsigned int *underflows, in check_entry_size_and_hooks() argument625 if ((unsigned char *)e - base == underflows[h]) { in check_entry_size_and_hooks()629 newinfo->underflow[h] = underflows[h]; in check_entry_size_and_hooks()
614 const unsigned int *underflows, in check_entry_size_and_hooks() argument643 if ((unsigned char *)e - base == underflows[h]) { in check_entry_size_and_hooks()647 newinfo->underflow[h] = underflows[h]; in check_entry_size_and_hooks()
112 leeway for computational errors (over/underflows). Example: if
92 over/underflows and clamping issues of integer values in general. The usual
277 control mechanisms exist on both sides to prevent underflows and overflows.
1038 will detect preemption count underflows.