On Sat, Jul 19, 2008 at 12:45 AM, Kenneth Zadeck
<[EMAIL PROTECTED]> wrote:
> Richard Guenther wrote:
>>
>> On Fri, Jul 18, 2008 at 11:25 PM, Kenneth Zadeck
>> <[EMAIL PROTECTED]> wrote:
>>
>>>
>>> Diego has asked me to look into what would be needed in a gimple type
>>> system. This is an issue
Hello all,
I am involved in porting gcc 4.1.2.
For some processing i need to know whether a register is being defined
and used in a particular instruction. Till now i have been using
'refers_to_regno_p()' to know whether a register is being used in a
instruction and 'modified_in_p()' to know wheth
Hi,
I hope I'm not flooding with this topic. I've did some research and
couldn't find anything relevant on this topic.
My team is developing a large scale CAD application that has a large
memory footprint, requiring strong machines to run.
The application uses pointers massively.
During one of ou
Yair Lifshitz wrote:
Hi,
I hope I'm not flooding with this topic. I've did some research and
couldn't find anything relevant on this topic.
My team is developing a large scale CAD application that has a large
memory footprint, requiring strong machines to run.
The application uses pointers mass
The application does go well beyond the 4GB range.
By using this implementation I can use 32-bit pointers for most
objects (those that do not require <8byte alignment, i.e. chars, etc.)
while still have a 32GB address range.
On 7/19/08, Robert Dewar <[EMAIL PROTECTED]> wrote:
> Yair Lifshitz wrot
"Yair Lifshitz" <[EMAIL PROTECTED]> writes:
>
> Basically, as long as the application is in the 32G range (2^32*2^3),
Seems like a strange assumption. If the application can use 32GB
what stops it from using 40GB or 64GB? Systems with that much
memory are readily available these days.
> Would be
Andi Kleen wrote:
"Yair Lifshitz" <[EMAIL PROTECTED]> writes:
Basically, as long as the application is in the 32G range (2^32*2^3),
Seems like a strange assumption. If the application can use 32GB
what stops it from using 40GB or 64GB? Systems with that much
memory are readily available these
On Sat, Jul 19, 2008 at 06:53:41PM -0400, Robert Dewar wrote:
> Andi Kleen wrote:
> >"Yair Lifshitz" <[EMAIL PROTECTED]> writes:
> >>Basically, as long as the application is in the 32G range (2^32*2^3),
> >
> >Seems like a strange assumption. If the application can use 32GB
> >what stops it from us
> > Anyone familiar with the idea of trying to describe a machine the way
> > it works?
> > like where it's being a machine working the way of having a loop with
> > the problem of being in
> > the middle and then to the outside as how the machine can move? so
> > like if you were to make it a mach
