On 10/18/07, Fran Baena <[EMAIL PROTECTED]> wrote:
> My questions are: are nodes STRUCT_FIELD_TAG, NAME_MEMORY_TAG,
> SYMBOL_MEMORY_TAG used for that purpose? and, where i can find
> documentation about their use within the translation process to SSA?
Yes and no. S_F_T is used to implement field
On Sat, 2007-10-20 at 22:32 +0400, Tomash Brechko wrote:
> I'm not sure what OpenMP spec says about default data scope (too lazy
> to read through),
> but it seems that examples from
> http://kallipolis.com/openmp/2.html assume default(private), while GCC
> GOMP defaults to shared. In your case
On 10/20/07, Chris Lattner <[EMAIL PROTECTED]> wrote:
>
> On Oct 20, 2007, at 4:48 AM, Steven Bosscher wrote:
>
> > I hope the list is useful for someone who wishes to improve GCC's
> > optimizations for code size.
>
> Is there a meta bug for code size optimizations?
Yes there is. I made it depen
On Wed, 10 Oct 2007, [EMAIL PROTECTED] wrote:
> I estabilished an http mirror via rsync, updated four times a day with a
> cron job, located in Utah (US), available at the URL
> "http://gcc.bigsearcher.com/";, from my server bigsearcher.com;
> Please add this mirror to the list of available mirror
I'm not sure what OpenMP spec says about default data scope (too lazy
to read through), but it seems that examples from
http://kallipolis.com/openmp/2.html assume default(private), while GCC
GOMP defaults to shared. In your case,
#pragma omp parallel for shared(A, row, col)
for (i = k+1; i
E-mail реклама - старт Вашего бизнеса! Качественно, от профессионалов.
Cамые полные регулярно обновляемые базы (Москва, Россия, СНГ)
Cамое современное оборудование
Отчет о проделанной работе
тел В москве: - 646-07-20
On Oct 20, 2007, at 4:48 AM, Steven Bosscher wrote:
I hope the list is useful for someone who wishes to improve GCC's
optimizations for code size.
Is there a meta bug for code size optimizations? If not, that would
be a good way to centralize the various ideas you have.
-Chris
Hi,
I have noticed that glibc has extensive use of the _Unwind_Resume procedure
(from libgcc_eh.a) but I have failed to understand it (no luck with
the onlinedocs:
http://gcc.gnu.org/onlinedocs/gccint/Exception-handling-routines.html#Exception-handling-routines).
Can anyone please explain me what
* Was it useful the implementation of the complicated tree-ssa code
waited for long time (many years)?
* Was it better the optimization without tree-ssa code?
If doesn't exist a method for global optimization to use tree-ssa then
* why did not it implement the simplest trial-and-error method for
Hello,
Earlier this year, I had a chat with Richard Earnshaw about code size
optimizations in GCC. I'm of the opinion that GCC should be able to
do better, if a small number of obvious shortcomings would be fixed.
There are many passes that matter for code size, which are currently
rather impaire
10 matches
Mail list logo