search for: high1

...explain why PHI nodes instructions are necessary in machine code? And why the code in LiveVariables.cpp which looks at those PHI nodes (line 249 and below) is necessary. The reason I'm asking is that I try to support 64-bit comparison and I do it by generating code like: // if high1 cond high2: goto operand0 // if high1 reverse_cond high2: goto operand1 // if low cond high2: goto operand0 // goto operand1 but this means that operand0 and operand1 (the successor basic blocks) suddenly get more predecessor than recorded in phi nodes, and...

...hese phis get removed after register allocation. So you would write code like: if (a cond b) then r1 = 1 else r2 = 0 r = phi(r1, r2) > The reason I'm asking is that I try to support 64-bit comparison and I do it > by generating code like: > > // if high1 cond high2: goto operand0 > // if high1 reverse_cond high2: goto operand1 the second if should just be an unconditional branch to operand1: clearly, if (high1 cond high2) is false, the reverse condition is true. > // if low cond high2: goto operand0 >...

...; preds = %0 %23 = call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([24 x i8]* @.str, i32 0, i32 0)) br label %24 ; <label>:24 ; preds = %22, %0 %25 = load i32* %tmphigh, align 4 %26 = and i32 %25, 65535 store i32 %26, i32* %high1, align 4 ..... If I insert some instructions before %25 so it will look like: .... ; <label>:22 ; preds = %0 %23 = call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([24 x i8]* @.str, i32 0, i32 0)) br label %24 ; <label>:24 %var = ad...

...l i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([24 x i8]* > @.str, i32 0, i32 0)) > br label %24 > > ;<label>:24 ; preds = %22, %0 > %25 = load i32* %tmphigh, align 4 > %26 = and i32 %25, 65535 > store i32 %26, i32* %high1, align 4 > ..... > > > If I insert some instructions before %25 so it will look like: > .... > ;<label>:22 ; preds = %0 > %23 = call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([24 x i8]* > @.str, i32 0, i32 0)) > b...

...d write code like: > > if (a cond b) then > r1 = 1 > else > r2 = 0 > > r = phi(r1, r2) Ok, I see. > > The reason I'm asking is that I try to support 64-bit comparison and I do > > it by generating code like: > > > > // if high1 cond high2: goto operand0 > > // if high1 reverse_cond high2: goto operand1 > > the second if should just be an unconditional branch to operand1: > clearly, if (high1 cond high2) is false, the reverse condition is true. Actually, you've found a bug: it should be swa...

...entptr inbounds ([24 x >> i8]* >> @.str, i32 0, i32 0)) >> br label %24 >> >> ;<label>:24 ; preds = %22, %0 >> %25 = load i32* %tmphigh, align 4 >> %26 = and i32 %25, 65535 >> store i32 %26, i32* %high1, align 4 >> ..... >> >> >> If I insert some instructions before %25 so it will look like: >> .... >> ;<label>:22 ; preds = %0 >> %23 = call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([24 x >> i8]*...

...> in > machine code? And why the code in LiveVariables.cpp which looks at > those PHI > nodes (line 249 and below) is necessary. > > The reason I'm asking is that I try to support 64-bit comparison and I > do it > by generating code like: > > // if high1 cond high2: goto operand0 > // if high1 reverse_cond high2: goto operand1 > // if low cond high2: goto operand0 > // goto operand1 > > but this means that operand0 and operand1 (the successor basic blocks) > suddenly get more predecessor than...

...; 3 bytes vendor part of MAC + xchg ah,al ; Convert to host byte order + ror eax,16 + xchg ah,al +.hexify_loop1: rol eax,4 + push eax + and al,0Fh + cmp al,10 + jae .high1 +.low1: add al,'0' + jmp short .char1 +.high1: add al,'A'-10 +.char1: stosb + pop eax + loop .hexify_loop1 + + mov cx,6 ; 6 nibbles in netcard part of MAC +...

...val of the NA's. Here is the data, and the code that I am using so far, if you run it, you'll see the error pop up.... please help me to get around this problem. Thanks in advance. Location Dist. Size low1 .5 10.5 low2 .5 23 low3 .5 NA low4 .5 NA mid1 3 15 mid2 3 11.5 mid3 3 15 mid4 3 NA high1 6 12.5 high2 6 20 high3 6 21 high4 6 22 wall1 10 13 wall2 10 12.5 wall3 10 13 wall4 10 12 d<-read.table("dilomaaethiops.txt",header=T) d str(d) range(d$Dist.) s<-d$Size range(s) s[s<.1]<-NA range(s,na.rm=T) summary(d) length(s) length(d$Dist.) plot(s~d$Dist.,xlab="Distan...