[Bug target/38781] PR38151: valgrind finds problem
--- Comment #8 from lauras at gcc dot gnu dot org 2009-04-24 05:50 --- *** Bug 34865 has been marked as a duplicate of this bug. *** -- lauras at gcc dot gnu dot org changed: What|Removed |Added CC||hp at gcc dot gnu dot org http://gcc.gnu.org/bugzilla/show_bug.cgi?id=38781
[Bug target/38781] PR38151: valgrind finds problem
--- Comment #6 from hjl at gcc dot gnu dot org 2009-03-30 14:29 --- Subject: Bug 38781 Author: hjl Date: Mon Mar 30 14:29:10 2009 New Revision: 145292 URL: http://gcc.gnu.org/viewcvs?root=gccview=revrev=145292 Log: 2008-03-30 H.J. Lu hongjiu...@intel.com PR target/38781 * config/i386/i386.c (classify_argument): Check total size of structure. Modified: trunk/gcc/ChangeLog trunk/gcc/config/i386/i386.c -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=38781
[Bug target/38781] PR38151: valgrind finds problem
--- Comment #7 from hjl dot tools at gmail dot com 2009-03-30 14:33 --- Fixed for 4.5.0. No plan to back port. -- hjl dot tools at gmail dot com changed: What|Removed |Added Status|NEW |RESOLVED Resolution||FIXED Target Milestone|4.4.0 |4.5.0 http://gcc.gnu.org/bugzilla/show_bug.cgi?id=38781
[Bug target/38781] PR38151: valgrind finds problem
--- Comment #5 from hjl dot tools at gmail dot com 2009-03-29 19:33 --- The updated patch is at http://gcc.gnu.org/ml/gcc-patches/2009-03/msg01581.html -- hjl dot tools at gmail dot com changed: What|Removed |Added CC||ubizjak at gmail dot com URL|http://gcc.gnu.org/ml/gcc- |http://gcc.gnu.org/ml/gcc- |patches/2009- |patches/2009- |01/msg00747.html|03/msg01581.html http://gcc.gnu.org/bugzilla/show_bug.cgi?id=38781
[Bug target/38781] PR38151: valgrind finds problem
--- Comment #4 from dcb314 at hotmail dot com 2009-01-15 21:51 --- (In reply to comment #3) An updated patch is at http://gcc.gnu.org/ml/gcc-patches/2009-01/msg00747.html I have a couple of minor questions about the coding style of this patch. 1. Why is the / 8 / 8 a good idea ? Presumably / 64 doesn't do it right ? 2. On the middle condition of the for-loop, could it be micro-optimised to compute the upper limit of the for loop before the loop starts ? For example, instead of ; (i A) (i + pos) B; ++i replace with const int limit = min( A, B - pos); ... ; i limit; ++i Just an idea. -- dcb314 at hotmail dot com changed: What|Removed |Added CC||dcb314 at hotmail dot com http://gcc.gnu.org/bugzilla/show_bug.cgi?id=38781
[Bug target/38781] PR38151: valgrind finds problem
--- Comment #2 from hjl dot tools at gmail dot com 2009-01-14 15:16 --- An updated patch is posted at http://gcc.gnu.org/ml/gcc-patches/2009-01/msg00738.html -- hjl dot tools at gmail dot com changed: What|Removed |Added URL|http://gcc.gnu.org/ml/gcc- |http://gcc.gnu.org/ml/gcc- |patches/2009- |patches/2009- |01/msg00463.html|01/msg00738.html http://gcc.gnu.org/bugzilla/show_bug.cgi?id=38781
[Bug target/38781] PR38151: valgrind finds problem
--- Comment #3 from hjl dot tools at gmail dot com 2009-01-14 17:07 --- An updated patch is at http://gcc.gnu.org/ml/gcc-patches/2009-01/msg00747.html -- hjl dot tools at gmail dot com changed: What|Removed |Added URL|http://gcc.gnu.org/ml/gcc- |http://gcc.gnu.org/ml/gcc- |patches/2009- |patches/2009- |01/msg00738.html|01/msg00747.html http://gcc.gnu.org/bugzilla/show_bug.cgi?id=38781