https://gcc.gnu.org/bugzilla/show_bug.cgi?id=109008
--- Comment #16 from Richard Biener <rguenth at gcc dot gnu.org> --- (In reply to Jakub Jelinek from comment #14) > Created attachment 54599 [details] > gcc13-pr109008-wip.patch > > I have now this WIP but it doesn't work correctly yet, need to debug it now, > just finished writing it and making it compile. > Note, after the binary search it is still unfinished, I'd like to then > adjust it one bit at a time to narrow it further. But before working on > that it needs to work correctly. Looks nicer and more precise (even though the iterating function is ugly and you also suffer from the lack of copying of alternate range state, but using .union () is a way out here I guess ;)). Can we ignore -frounding-math here? The way you structured the tests rely on doing the "correct" rounding? Or does fold_range already compensate for -frounding-math?
