From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 31425 invoked by alias); 16 Jul 2009 17:31:16 -0000 Received: (qmail 31361 invoked by uid 48); 16 Jul 2009 17:31:03 -0000 Date: Thu, 16 Jul 2009 17:31:00 -0000 Message-ID: <20090716173103.31360.qmail@sourceware.org> X-Bugzilla-Reason: CC References: Subject: [Bug tree-optimization/40770] Vectorization of complex types, vectorization of sincos missing In-Reply-To: Reply-To: gcc-bugzilla@gcc.gnu.org To: gcc-bugs@gcc.gnu.org From: "irar at il dot ibm dot com" 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-07/txt/msg01373.txt.bz2 ------- Comment #6 from irar at il dot ibm dot com 2009-07-16 17:31 ------- (In reply to comment #3) > > make_vector_type returns NULL for this type. > Yes - there is no vector type for complex double. But the vectorizer > could query for a vector type for the complex component type (double) > and divide the vector element count by 2 (for complex) to get the > vectorization factor which would be 1 here. I see. > Should SLP the be possible > for that loop? Not with the current implementation - SLP needs strided stores to start. Here the stores are not even adjacent. I think, it would be better to vectorize this loop with regular loop-based vectorization to avoid permutations. I'll take a better look on Sunday. Ira > Richard. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=40770