Hi,
Function get_address_cost in ivopt computes multiplied address cost
with below code:
First:
rat = 1;
for (i = 2; i <= MAX_RATIO; i++)
if (multiplier_allowed_in_address_p (i, mem_mode, as))
{
rat = i;
break;
}
Then:
if (rat_p)
addr = ge
On 18/02/13 18:08, Robert Dewar wrote:
Forgive me, but I don't see where anything is guaranteed to be zero'd
before use. I'm likely wrong somewhere since you disagree.
http://en.wikipedia.org/wiki/.bss
This is about what happens to work, and specifically notes that it is
not part of the C s
S, Pitchumani schrieb:
From: Georg-Johann Lay
S, Pitchumani wrote:
I was analyzing an issue for avr target (gcc-4.7.2).
Issue is that already clobbered register is used after the
transformation in post reload pass.
insns after reload pass:
set (reg:HI r24
(const:HI (plus:HI (symbol_ref
Snapshot gcc-4.6-20130222 is now available on
ftp://gcc.gnu.org/pub/gcc/snapshots/4.6-20130222/
and on various mirrors, see http://gcc.gnu.org/mirrors.html for details.
This snapshot has been generated from the GCC 4.6 SVN branch
with the following options: svn://gcc.gnu.org/svn/gcc/branches
Hi,
Consider the following function
A *CheckNotNull (A *a_ptr) {
if (a_ptr == NULL) {
// Code with non-trivial code size
}
return a_ptr;
}
If this is invoked as CheckNotNull(&a), the inliner should be able to
infer that (a_ptr == 0) predicate is false and estimate the size and
time ba
On Fri, Feb 22, 2013 at 3:08 PM, Easwaran Raman wrote:
> Hi,
>
> Consider the following function
>
> A *CheckNotNull (A *a_ptr) {
> if (a_ptr == NULL) {
> // Code with non-trivial code size
> }
> return a_ptr;
> }
>
> If this is invoked as CheckNotNull(&a), the inliner should be able to
