Displaying 8 results from an estimated 8 matches for "infot".
Did you mean:
info
2012 Feb 15
0
[LLVMdev] LLVM GHC Backend: Tables Next To Code
...post about TNTC is beyond the time I have right now.
Sure, understandable. I'm surprised someone else hasn't already :)
> Here is some high level documentation of the layout of Heap objects in GHC:
>
> http://hackage.haskell.org/trac/ghc/wiki/Commentary/Rts/Storage/HeapObjects#InfoTables
>
> With TNTC enabled we generate code for closures of this form:
>
> .text
> .align 8
> .long Main_main1_srt-(Main_main1_info)+0
> .long 0
> .quad 4294967299
> .quad 0
> .quad 270582939663
> .globl Main_main1_info
> .type Main_main1_info, @object
&g...
2012 Feb 15
2
[LLVMdev] LLVM GHC Backend: Tables Next To Code
...the time I have right now.
>
> Sure, understandable. I'm surprised someone else hasn't already :)
>
>> Here is some high level documentation of the layout of Heap objects in GHC:
>>
>> http://hackage.haskell.org/trac/ghc/wiki/Commentary/Rts/Storage/HeapObjects#InfoTables
>>
>> With TNTC enabled we generate code for closures of this form:
>>
>> .text
>> .align 8
>> .long Main_main1_srt-(Main_main1_info)+0
>> .long 0
>> .quad 4294967299
>> .quad 0
>> .quad 270582939663
>> .globl Main_main1...
2012 Feb 14
3
[LLVMdev] LLVM GHC Backend: Tables Next To Code
Hmm writing a blog post about TNTC is beyond the time I have right now.
Here is some high level documentation of the layout of Heap objects in GHC:
http://hackage.haskell.org/trac/ghc/wiki/Commentary/Rts/Storage/HeapObjects#InfoTables
With TNTC enabled we generate code for closures of this form:
.text
.align 8
.long Main_main1_srt-(Main_main1_info)+0
.long 0
.quad 4294967299
.quad 0
.quad 270582939663
.globl Main_main1_info
.type Main_main1_info, @object
Main_main1_info:
.Lc1Df:
leaq -8(%rbp),%rax
cmpq %r15,%rax...
2012 Feb 15
0
[LLVMdev] LLVM GHC Backend: Tables Next To Code
...nd the time I have right now.
>
> Sure, understandable. I'm surprised someone else hasn't already :)
>
>> Here is some high level documentation of the layout of Heap objects in GHC:
>>
>> http://hackage.haskell.org/trac/ghc/wiki/Commentary/Rts/Storage/HeapObjects#InfoTables
>>
>> With TNTC enabled we generate code for closures of this form:
>>
>> .text
>> .align 8
>> .long Main_main1_srt-(Main_main1_info)+0
>> .long 0
>> .quad 4294967299
>> .quad 0
>> .quad 2705829...
2006 May 26
1
Building V2.3.0 on Tru64 V5.1B
Hi,
I am going to be attempting a build of R for the alphas (our
main need is to collate and present graphically, performance metrics we
gather on our applications).
We have:
CC=cc, CXX=cxx, Fortran V5.51 (f77, f95), GNU make 3.80, Perl 5.8.4
I am hesitant to rebuild GCC on this platform, and would like to know if
others have success in building R with native C, C++ and Fortran. I plan
on
2006 Jun 08
1
Problems Building R-2.3.1 on Alpha server ES40 running Tru64 V5.1B PK#5
R Listers,
One of the list contributors suggested I abandon attempts to build
R-1.9.1 and focus on building R-2.3.1. I believe the main set of
packages have been built properly (with some changes to the code) -
however, when building the Recommended packages, the build fails.
CODE CHANGES:
=============
1. My C compiler requires a ";" on line 589 of
..../src/main/printutils.c. Here
2012 Feb 14
0
[LLVMdev] LLVM GHC Backend: Tables Next To Code
On Feb 13, 2012, at 6:49 AM, Sergiu Ivanov wrote:
> On behalf of GHC hackers, I would like to discuss the possibility of
> having a proper implementation of the tables-next-to-code optimisation
> in LLVM.
It would be great to have this. However, the design will be tricky. Is there anything that spells out how the TNTC optimization works at the actual machine instruction level? It
2012 Feb 13
3
[LLVMdev] LLVM GHC Backend: Tables Next To Code
Hello everyone,
On behalf of GHC hackers, I would like to discuss the possibility of
having a proper implementation of the tables-next-to-code optimisation
in LLVM.
Currently, the object code produced by all three GHC backends follows
the convention that the table with the metadata of a closure is
located immediately before the code of the closure. This makes it
possible to get to both the code