search for: bb1_6

...; Loop Header is BB1_2 ; Inner Loop mov EAX, DWORD PTR [_gv] add DWORD PTR [ESP + 4], EAX dec DWORD PTR [_gv] jmp $BB1_2 $BB1_4: ; %else mov DWORD PTR [ESP + 4], 1 jmp $BB1_6 ALIGN 16 $BB1_5: ; %whilebody9 ; Loop Depth 1 ; Loop Header is BB1_6...

...that it can add a[i], b[i] and cy with a > single adc. (Well it could if the loop iteration wasn't messing with > the carry flag). > > Indeed, this compiles to: > > > .LBB1_7:                                # %bb.i >                                        #   Parent Loop BB1_6 Depth=1 >                                        # =>  This Inner Loop Header: Depth=2 >        addq    (%rbx,%rsi,8), %rdi >        movl    $0, %r8d >        adcq    $0, %r8 >        addq    (%r14,%rsi,8), %rdi >        adcq    $0, %r8 >        movq    %rdi, (%r15,%rsi,8) &...

...adds. There's no way to tell it that it can add a[i], b[i] and cy with a single adc. (Well it could if the loop iteration wasn't messing with the carry flag). Indeed, this compiles to: .LBB1_7: # %bb.i # Parent Loop BB1_6 Depth=1 # => This Inner Loop Header: Depth=2 addq (%rbx,%rsi,8), %rdi movl $0, %r8d adcq $0, %r8 addq (%r14,%rsi,8), %rdi adcq $0, %r8 movq %rdi, (%r15,%rsi,8) incq %rsi...

I am currently able to emit jump tables, but I cannot use then because I cant figure out how to add its address to the constant pool. For example, if I have the jump table ------------------------------------- .JTI1_0: .word .BB1_6 .word .BB1_7 .word .BB1_1 .word .BB1_2 ------------------------------------- the address ".JTI1_0" must be in a constant pool: --------------------------------- .xyz .word .JTI1_0 .... ldr r1, .xyz add r0, r0, r1 ldr r0, [r0] bx r0 ------------------...

...ith a >> single adc. (Well it could if the loop iteration wasn't messing with >> the carry flag). >> >> Indeed, this compiles to: >> >> >> .LBB1_7: # %bb.i >> # Parent Loop BB1_6 Depth=1 >> # => This Inner Loop Header: Depth=2 >> addq (%rbx,%rsi,8), %rdi >> movl $0, %r8d >> adcq $0, %r8 >> addq (%r14,%rsi,8), %rdi >> adcq $0, %r8 >> m...

.... (Well it could if the loop iteration wasn't messing with >>> the carry flag). >>> >>> Indeed, this compiles to: >>> >>> >>> .LBB1_7:                                # %bb.i >>>                                        #   Parent Loop BB1_6 Depth=1 >>>                                        # =>  This Inner Loop Header: Depth=2 >>>        addq    (%rbx,%rsi,8), %rdi >>>        movl    $0, %r8d >>>        adcq    $0, %r8 >>>        addq    (%r14,%rsi,8), %rdi >>>        adcq    $...

On Fri, Jun 11, 2010 at 3:28 PM, Bill Hart <goodwillhart at googlemail.com> wrote: > Hi Eli, > > On 11 June 2010 22:44, Eli Friedman <eli.friedman at gmail.com> wrote: >> On Fri, Jun 11, 2010 at 10:37 AM, Bill Hart <goodwillhart at googlemail.com> wrote: >>> a) What plans are there to support addition, subtraction, >>> multiplication, division,

Hi all, After searching for a decent compiler backend for ages (google sometimes isn't helpful), I recently stumbled upon LLVM. Woot!! I work on bignum arithmetic (I'm a professional mathematician) and have recently decided to switch from developing GPL'd bignum code to BSD licensed code. (See http://www.mpir.org/ which I contributed to for a while - a fork of GMP). Please bear with