search for: ptr32

...d at runtime (the snipped was also printed at runtime) define i32 @myfunc(i32 %pi) { entry: %pi_addr = alloca i32 ; <i32*> [#uses=3] %retval = alloca i32 ; <i32*> [#uses=2] %tmp = alloca i32 ; <i32*> [#uses=2] > %ptr32 = alloca i32 ; <i32*> [#uses=2] %"alloca point" = bitcast i32 0 to i32 ; <i32> [#uses=0] > store i32 %pi, i32* %ptr32 > %ptr8 = bitcast i32* %ptr32 to i8* ; <i8*> [#uses=1] > call void @roc( i8* %ptr8...

...> define i32 @myfunc(i32 %pi) { > > entry: > > %pi_addr = alloca i32 ; <i32*> [#uses=3] > > %retval = alloca i32 ; <i32*> [#uses=2] > > %tmp = alloca i32 ; <i32*> [#uses=2] > > > %ptr32 = alloca i32 ; <i32*> [#uses=2] > > %"alloca point" = bitcast i32 0 to i32 ; <i32> [#uses=0] > > > > > store i32 %pi, i32* %ptr32 > > > %ptr8 = bitcast i32* %ptr32 to i8* ; <i8*> > [...

...rinted at runtime) > > define i32 @myfunc(i32 %pi) { > entry: > %pi_addr = alloca i32 ; <i32*> [#uses=3] > %retval = alloca i32 ; <i32*> [#uses=2] > %tmp = alloca i32 ; <i32*> [#uses=2] > > %ptr32 = alloca i32 ; <i32*> [#uses=2] > %"alloca point" = bitcast i32 0 to i32 ; <i32> [#uses=0] > > > store i32 %pi, i32* %ptr32 > > %ptr8 = bitcast i32* %ptr32 to i8* ; <i8*> [#uses=1] > >...

...different addresses for the > static/dynamic code - as far I see this is what it's happening but I > have no clue why. If you look at the LLVM IR you can see two distinct alloca instructions, the one your static code had named "%pi_addr" and the one you created named "%ptr32". It sounds like what you want to do is instead of creating your own stack spot to store %pi into, you should look at the first user of %pi which should be a store of %pi into its stack space, as generated by the static compilation, and pull the stack slot out of there. Something like thi...

...he > > static/dynamic code - as far I see this is what it's happening but I > > have no clue why. > > If you look at the LLVM IR you can see two distinct alloca instructions, > the one your static code had named "%pi_addr" and the one you created > named "%ptr32". > > It sounds like what you want to do is instead of creating your own stack > spot to store %pi into, you should look at the first user of %pi which > should be a store of %pi into its stack space, as generated by the > static compilation, and pull the stack slot out of there...

...here, unfortunately. If it would help, one of the changes that we’ve made is to add separate PTRADD, INTTOPTR and PTRTOINT nodes to SelectionDAG, which makes it possible to keep pointer types distinct. We currently have an iFATPTR type, which is not ideal - we’d like to replace this with a set of PTR32 to PTR256 types. I’d be happy to prioritise extracting these patches for upstreaming if that would be useful to others. David

...it ints */ 428 int32_t i32; 429 uint32_t ui32; 430 struct { 431 union { 432 char *ptr; /* NULL-term string */ 433 #if defined(_KERNEL) && defined(_MULTI_DATAMODEL) 434 caddr32_t ptr32; 435 #endif 436 char __pad[8]; /* 64-bit padding */ 437 } addr; 438 uint32_t len; /* # bytes for strlen + ''\0'' */ 439 } string; What seems to be happening is that DTrace is getting confused with thi...

Hi, I recently started helping with the LLVM AVR backend [1]. The AVR is an 8 bit core with pointer type i16. That makes pointers illegal in the SelectionDAG. As far as I understand it, it is the backends job to legalize these nodes by using the ReplaceNodeResults/LowerOperation callbacks. Is that about right? I have the feeling that the symbolic nodes carrying pointers, like FrameIndex are

The following series of 10 patches is a merge of the xenfb and xenconsoled functionality into the qemu-dm code. The general approach taken is to have qemu-dm provide two machine types - one for xen paravirt, the other for fullyvirt. For compatability the later is the default. The goals overall are to kill LibVNCServer, remove alot of code duplication and/or parallel impls of the same concepts, and

Hello all, I would like to propose a large change to LLVM that I would be happy to implement. The instruction selection legalizer knows of three different ways to legalize an action (ignoring an already legal action). - Expansion - Promotion - Custom Expanding a node will lead to one of two things - the operation will be split into several equivalent smaller operations (i.e. 64-bit