From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 3326 invoked by alias); 8 Feb 2009 14:47:19 -0000 Received: (qmail 3299 invoked by uid 48); 8 Feb 2009 14:47:08 -0000 Date: Sun, 08 Feb 2009 14:47:00 -0000 Message-ID: <20090208144708.3298.qmail@sourceware.org> X-Bugzilla-Reason: CC References: Subject: [Bug tree-optimization/31178] VRP can infer a range for b in a >> b and a << b In-Reply-To: Reply-To: gcc-bugzilla@gcc.gnu.org To: gcc-bugs@gcc.gnu.org From: "rguenth at gcc dot gnu dot org" Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Id: List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org X-SW-Source: 2009-02/txt/msg00727.txt.bz2 ------- Comment #3 from rguenth at gcc dot gnu dot org 2009-02-08 14:47 ------- No, it's now possible to implement this optimization (but yes, nobody has done so sofar). It's on my TODO (with tons of other stuff, of course). As this is an easy task for beginners ... whoever feels like doing it, I'll review the result. -- rguenth at gcc dot gnu dot org changed: What |Removed |Added ---------------------------------------------------------------------------- Status|WAITING |NEW Ever Confirmed|0 |1 Last reconfirmed|0000-00-00 00:00:00 |2009-02-08 14:47:08 date| | http://gcc.gnu.org/bugzilla/show_bug.cgi?id=31178