This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
Other format: | [Raw text] |
From: Paul Schlie <schlie@comcast.net> ... (minimally, likely doing nothing for out-of-range shifts, as generating code to implement an undefined behavior may not be necessarily prudent?)
Although acknowledge that a saturating behavior for non-negative shifts may be desirable if the middle-end presumes ((x >> y) >> y) :: (x >> (2 * y)), or it's analogy for left-shifts; but it's not clear that it officially does?
For arithmetical right shifts > N, we may also want to fill the result with the sign bit instead of clearing.
-- // Bernardo Innocenti - Develer S.r.l., R&D dept. \X/ http://www.develer.com/
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |