H.J. Lu hongjiu...@intel.com writes:
diff --git a/gcc/config/i386/bmiintrin.h b/gcc/config/i386/bmiintrin.h
index af5d9dc..72ab114 100644
--- a/gcc/config/i386/bmiintrin.h
+++ b/gcc/config/i386/bmiintrin.h
@@ -42,8 +42,8 @@ __tzcnt_u16 (unsigned short __X)
extern __inline unsigned int
This patch series adds shrink-wrap support for PowerPC. The patches
are on top of Bernd's Initial shrink-wrapping patch:
http://gcc.gnu.org/ml/gcc-patches/2011-08/msg02557.html, but with the
tm.texi patch applied to tm.texi.in. Bootstrapped and regression
tested powerpc64-linux all langs except
This obvious patch extends my 2011-08-03 fix to simple_return.
Necessary for the same reason as the original patch, namely that
rs6000.md has a peephole2 that matches and recreates a conditional
jump. With the third patch in this series applied, rs6000 will start
to use simple_return in
Finally, the powerpc backend changes. These are mostly just
mechanical. I'll note that we need both simple_return and return
variants of the conditional returns because they can only be used when
no epilogue is required. The return variant must use
direct_return() as a predicate to check this
(the original discussion started here:
http://gcc.gnu.org/ml/gcc-patches/2011-08/msg00758.html
)
On Mon, 8 Aug 2011, Joseph S. Myers wrote:
On Mon, 8 Aug 2011, Marc Glisse wrote:
* include/obstack.h (obstack_free): Cast to char* instead of int
This header comes from glibc/gnulib.
On Fri, Sep 16, 2011 at 6:20 PM, Jakub Jelinek ja...@redhat.com wrote:
Surprisingly with -mavx2 the integer loops aren't vectorized with
32-byte vectors, wonder why. But looking at the integer umin/umax/smin/smax
16-byte reductions they generate good code even without reduc_* patterns,
On Fri, Sep 16, 2011 at 8:52 PM, Jakub Jelinek ja...@redhat.com wrote:
So, either we can fix this by adding
reduc_{smin,smax,umin,umax}_v{32q,16h,8s,4d}i
patterns (at that point I guess I should just macroize them together with
the reduc_{smin,smax,umin,umax}_v{4sf,8sf,4df}) and handle the 4
On 09/16/2011 03:00 AM, Paolo Carlini wrote:
Ok... but:
+ us.max_load_factor(.5f);
+ VERIFY( us.max_load_factor() == .5f );
as we discussed already (didn't we?), this kind of VERIFY is in
general very brittle (even if on the widespread base-2 systems
probably we are lucky in this
On 09/17/2011 11:27 AM, François Dumont wrote:
Paolo, I know that using float equality comparison is not reliable in
general and I have remove the suspicious line but in this case I can't
imagine a system where it could fail.
As a general policy, in the testsuite we should never assert equality
On Sat, Sep 17, 2011 at 8:31 AM, Andreas Schwab sch...@linux-m68k.org wrote:
diff --git a/gcc/config/i386/bmiintrin.h b/gcc/config/i386/bmiintrin.h
index af5d9dc..72ab114 100644
--- a/gcc/config/i386/bmiintrin.h
+++ b/gcc/config/i386/bmiintrin.h
@@ -42,8 +42,8 @@ __tzcnt_u16 (unsigned short
Uros Bizjak ubiz...@gmail.com writes:
Agreed. Some parets are missing, though:
- unsigned long long tmp = (__X) ^ (__X - 1);
- return tmp;
+ unsigned long long __tmp = (__X) ^ (__X - 1);
+ return __tmp;
There is none missing. This is not a macro.
Andreas.
--
Andreas Schwab,
Regarding the last patch, the GNU style puts a line break after the ) in:
+ if (!sym) return NULL;
+
In principle I'm aware of the GNU coding style, but apparently I
didn't pay enough attention. Sorry again. I'll fix it ...
Fixed with r178928.
Cheers,
Janus
Jason Merrill ja...@redhat.com writes:
On 07/16/2011 10:37 AM, Dodji Seketeli wrote:
Ideally, I'd prefer some parts of this patch to be integrated into the
memory allocator. That is, I'd like to see the memory allocator have
an interface that returns the actual size of memory it has
On Sat, 17 Sep 2011, Marc Glisse wrote:
Is someone willing to review (and possibly commit) these 2 patches?
Changelog for include/obstack.h in glibc (guess it should be copied almost as
is?):
2011-09-11 Ulrich Drepper drep...@gmail.com
* obstack.h [!GNUC] (obstack_free): Avoid
On 09/17/11 09:16, Alan Modra wrote:
This patch series adds shrink-wrap support for PowerPC. The patches
are on top of Bernd's Initial shrink-wrapping patch:
http://gcc.gnu.org/ml/gcc-patches/2011-08/msg02557.html, but with the
tm.texi patch applied to tm.texi.in. Bootstrapped and regression
This patch fixes a couple of cases where reload incorrectly thinks it
should be messing around with the result of a match_operator operand.
Given that it's never even tried to validate the contents of such an
operand the changes it tries to make are bogus.
This is needed for an upcoming patch I
On 9/17/2011 5:38 AM, Paolo Carlini wrote:
On 09/17/2011 11:27 AM, François Dumont wrote:
Paolo, I know that using float equality comparison is not reliable in
general and I have remove the suspicious line but in this case I can't
imagine a system where it could fail.
As a general policy, in
Hi!
(Again, sorry for the long delay, but I indeed have very few time to work on it)
2011/6/22 Jason Merrill ja...@redhat.com:
On 06/15/2011 01:58 PM, Fabien Chęne wrote:
Otherwise, perhaps that it would be better if the second declaration
of E1 does not rely on supplement_binding_1.
What
On 09/16/2011 03:55 AM, Dodji Seketeli wrote:
+test.c: In function ‘g’:
+test.c:5:14: error: invalid operands to binary (have ‘double’ and ‘int’)
+test.c:2:9: note: in expansion of macro 'OPERATE'
+test.c:5:3: note: expanded from here
+test.c:5:14: note: in expansion of
OK.
Jason
On 09/16/2011 04:13 AM, Dodji Seketeli wrote:
It seems odd to add in the locations size here since it's also printed
separately.
I wanted macro_maps_used_size to really reflect the total used size
for macro maps, without having to mentally do the addition of its two
components. But at the same
On 09/17/2011 07:08 AM, Dodji Seketeli wrote:
OK, so the patch below extracts a public ggc_alloced_size_for_request
function from the different implementations of the ggc allocator's
interface, and lets new_linemap use that.
Maybe ggc_round_alloc_size? OK with that change if nobody else has
On Sat, Sep 17, 2011 at 3:10 AM, Andreas Schwab sch...@linux-m68k.org wrote:
Uros Bizjak ubiz...@gmail.com writes:
Agreed. Some parets are missing, though:
- unsigned long long tmp = (__X) ^ (__X - 1);
- return tmp;
+ unsigned long long __tmp = (__X) ^ (__X - 1);
+ return __tmp;
Restructure pph_read_tree_header and pph_read_tree to do what their
names say they do. In particular, generic tree handling from
pph_read_tree_header to pph_read_tree.
Add debugging routines pph_tree_code_text (to avoid out of bounds
indexing on a bad tree code) and pph_dump_min_decl (to dump
On 09/16/2011 04:46 AM, Dodji Seketeli wrote:
struct c_declspecs *
-finish_declspecs (struct c_declspecs *specs)
+finish_declspecs (struct c_declspecs *specs,
+ location_t where)
Let's call this first_token_loc, too. And mention it in the function
comment.
OK with that
On Tue, 2 Aug 2011, Jakub Jelinek wrote:a
--- projects/gomp/index.html 30 Mar 2009 00:07:58 - 1.10
+++ projects/gomp/index.html 2 Aug 2011 17:01:52 -
Two minor editorial changes that I just committed.
Gerald
Index: projects/gomp/index.html
...shortening the text a bit as well.
Gerald
Index: extensions.html
===
RCS file: /cvs/gcc/wwwdocs/htdocs/extensions.html,v
retrieving revision 1.48
diff -u -r1.48 extensions.html
--- extensions.html 10 Sep 2011 21:47:33 -
Hi,
tested x86_64-linux, committed to mainline.
Paolo.
///
2011-09-17 Paolo Carlini paolo.carl...@oracle.com
PR libstdc++/50441
* acinclude.m4 ([GLIBCXX_ENABLE_INT128_FLOAT128]): Add.
* configure.ac: Call it.
* include/std/type_traits
This adjusts the costs of various operations on Niagara-3, in
particular FP operation latency increases to 9 cycles compared to
Niagara-2's 6 cycles. Integer multiplies increase to 9 cycles as
well, which likely indicates that they go through the FPU unit too.
I also fixed up the integer divide
29 matches
Mail list logo
