mirror of
https://github.com/golang/go
synced 2024-10-04 08:31:22 -06:00
cmd/5l, runtime: make ARM integer division profiler-friendly
The implementation of division constructed non-standard stack frames that could not be handled by the traceback routines. CL 13239052 left the frames non-standard but fixed them for the specific case of a divide-by-zero panic. A profiling signal can arrive at any time, so that fix is not sufficient. Change the division to store the extra argument in the M struct instead of in a new stack slot. That keeps the frames bog standard at all times. Also fix a related bug in the traceback code: when starting a traceback, the LR register should be ignored if the current function has already allocated its stack frame and saved the original LR on the stack. The stack copy should be used, as the LR register may have been modified. Combined, these make the torture test from issue 6681 pass. Fixes #6681. R=golang-dev, r, josharian CC=golang-dev https://golang.org/cl/19810043
This commit is contained in:
parent
95ae85fb82
commit
b0db472ea2
@ -60,7 +60,7 @@ linkcase(Prog *casep)
|
||||
void
|
||||
noops(void)
|
||||
{
|
||||
Prog *p, *q, *q1, *q2;
|
||||
Prog *p, *q, *q1, *q2, orig;
|
||||
int o;
|
||||
Sym *tlsfallback, *gmsym;
|
||||
|
||||
@ -401,26 +401,27 @@ noops(void)
|
||||
break;
|
||||
if(p->to.type != D_REG)
|
||||
break;
|
||||
q1 = p;
|
||||
|
||||
/* MOV a,4(SP) */
|
||||
p = appendp(p);
|
||||
orig = *p;
|
||||
|
||||
/* MOV a,4(M) */
|
||||
p->as = AMOVW;
|
||||
p->line = q1->line;
|
||||
p->line = orig.line;
|
||||
p->from.type = D_REG;
|
||||
p->from.reg = q1->from.reg;
|
||||
p->from.reg = orig.from.reg;
|
||||
p->reg = NREG;
|
||||
p->to.type = D_OREG;
|
||||
p->to.reg = REGSP;
|
||||
p->to.reg = REGM;
|
||||
p->to.offset = 4;
|
||||
|
||||
/* MOV b,REGTMP */
|
||||
p = appendp(p);
|
||||
p->as = AMOVW;
|
||||
p->line = q1->line;
|
||||
p->line = orig.line;
|
||||
p->from.type = D_REG;
|
||||
p->from.reg = q1->reg;
|
||||
if(q1->reg == NREG)
|
||||
p->from.reg = q1->to.reg;
|
||||
p->from.reg = orig.reg;
|
||||
if(orig.reg == NREG)
|
||||
p->from.reg = orig.to.reg;
|
||||
p->to.type = D_REG;
|
||||
p->to.reg = REGTMP;
|
||||
p->to.offset = 0;
|
||||
@ -428,7 +429,7 @@ noops(void)
|
||||
/* CALL appropriate */
|
||||
p = appendp(p);
|
||||
p->as = ABL;
|
||||
p->line = q1->line;
|
||||
p->line = orig.line;
|
||||
p->to.type = D_BRANCH;
|
||||
p->cond = p;
|
||||
switch(o) {
|
||||
@ -453,34 +454,12 @@ noops(void)
|
||||
/* MOV REGTMP, b */
|
||||
p = appendp(p);
|
||||
p->as = AMOVW;
|
||||
p->line = q1->line;
|
||||
p->line = orig.line;
|
||||
p->from.type = D_REG;
|
||||
p->from.reg = REGTMP;
|
||||
p->from.offset = 0;
|
||||
p->to.type = D_REG;
|
||||
p->to.reg = q1->to.reg;
|
||||
|
||||
/* ADD $8,SP */
|
||||
p = appendp(p);
|
||||
p->as = AADD;
|
||||
p->line = q1->line;
|
||||
p->from.type = D_CONST;
|
||||
p->from.reg = NREG;
|
||||
p->from.offset = 8;
|
||||
p->reg = NREG;
|
||||
p->to.type = D_REG;
|
||||
p->to.reg = REGSP;
|
||||
p->spadj = -8;
|
||||
|
||||
/* SUB $8,SP */
|
||||
q1->as = ASUB;
|
||||
q1->from.type = D_CONST;
|
||||
q1->from.offset = 8;
|
||||
q1->from.reg = NREG;
|
||||
q1->reg = NREG;
|
||||
q1->to.type = D_REG;
|
||||
q1->to.reg = REGSP;
|
||||
q1->spadj = 8;
|
||||
p->to.reg = orig.to.reg;
|
||||
|
||||
break;
|
||||
case AMOVW:
|
||||
|
@ -8,6 +8,7 @@ import (
|
||||
"bytes"
|
||||
"fmt"
|
||||
"hash/crc32"
|
||||
"math/big"
|
||||
"os/exec"
|
||||
"regexp"
|
||||
"runtime"
|
||||
@ -123,6 +124,10 @@ func testCPUProfile(t *testing.T, need []string, f func()) {
|
||||
}
|
||||
})
|
||||
|
||||
if len(need) == 0 {
|
||||
return
|
||||
}
|
||||
|
||||
var total uintptr
|
||||
for i, name := range need {
|
||||
total += have[i]
|
||||
@ -237,6 +242,26 @@ func TestGoroutineSwitch(t *testing.T) {
|
||||
}
|
||||
}
|
||||
|
||||
// Test that profiling of division operations is okay, especially on ARM. See issue 6681.
|
||||
func TestMathBigDivide(t *testing.T) {
|
||||
testCPUProfile(t, nil, func() {
|
||||
t := time.After(5 * time.Second)
|
||||
pi := new(big.Int)
|
||||
for {
|
||||
for i := 0; i < 100; i++ {
|
||||
n := big.NewInt(2646693125139304345)
|
||||
d := big.NewInt(842468587426513207)
|
||||
pi.Div(n, d)
|
||||
}
|
||||
select {
|
||||
case <-t:
|
||||
return
|
||||
default:
|
||||
}
|
||||
}
|
||||
})
|
||||
}
|
||||
|
||||
// Operating systems that are expected to fail the tests. See issue 6047.
|
||||
var badOS = map[string]bool{
|
||||
"darwin": true,
|
||||
|
@ -290,6 +290,7 @@ struct G
|
||||
struct M
|
||||
{
|
||||
G* g0; // goroutine with scheduling stack
|
||||
uint32 divmod; // div/mod denominator on arm
|
||||
void* moreargp; // argument pointer for more stack
|
||||
Gobuf morebuf; // gobuf arg to morestack
|
||||
|
||||
|
@ -84,7 +84,7 @@ runtime·gentraceback(uintptr pc0, uintptr sp0, uintptr lr0, G *gp, int32 skip,
|
||||
frame.lr = 0;
|
||||
flr = nil;
|
||||
} else {
|
||||
if(frame.lr == 0)
|
||||
if((n == 0 && frame.fp > frame.sp) || frame.lr == 0)
|
||||
frame.lr = *(uintptr*)frame.sp;
|
||||
flr = runtime·findfunc(frame.lr);
|
||||
if(flr == nil) {
|
||||
|
@ -105,7 +105,7 @@ s = 2 // three temporary variables
|
||||
M = 3
|
||||
a = 11
|
||||
// Be careful: R(a) == R11 will be used by the linker for synthesized instructions.
|
||||
TEXT udiv<>(SB),NOSPLIT,$-4
|
||||
TEXT udiv<>(SB),NOSPLIT,$-4-0
|
||||
CLZ R(q), R(s) // find normalizing shift
|
||||
MOVW.S R(q)<<R(s), R(a)
|
||||
MOVW $fast_udiv_tab<>-64(SB), R(M)
|
||||
@ -165,22 +165,8 @@ udiv_by_0_or_1:
|
||||
RET
|
||||
|
||||
udiv_by_0:
|
||||
// The ARM toolchain expects it can emit references to DIV and MOD
|
||||
// instructions. The linker rewrites each pseudo-instruction into
|
||||
// a sequence that pushes two values onto the stack and then calls
|
||||
// _divu, _modu, _div, or _mod (below), all of which have a 16-byte
|
||||
// frame plus the saved LR. The traceback routine knows the expanded
|
||||
// stack frame size at the pseudo-instruction call site, but it
|
||||
// doesn't know that the frame has a non-standard layout. In particular,
|
||||
// it expects to find a saved LR in the bottom word of the frame.
|
||||
// Unwind the stack back to the pseudo-instruction call site, copy the
|
||||
// saved LR where the traceback routine will look for it, and make it
|
||||
// appear that panicdivide was called from that PC.
|
||||
MOVW 0(R13), LR
|
||||
ADD $20, R13
|
||||
MOVW 8(R13), R1 // actual saved LR
|
||||
MOVW R1, 0(R13) // expected here for traceback
|
||||
B runtime·panicdivide(SB)
|
||||
MOVW $runtime·panicdivide(SB),R11
|
||||
B (R11)
|
||||
|
||||
TEXT fast_udiv_tab<>(SB),NOSPLIT,$-4
|
||||
// var tab [64]byte
|
||||
@ -207,14 +193,16 @@ TEXT fast_udiv_tab<>(SB),NOSPLIT,$-4
|
||||
// expects the result in R(TMP)
|
||||
TMP = 11
|
||||
|
||||
TEXT _divu(SB), NOSPLIT, $16
|
||||
TEXT _divu(SB), NOSPLIT, $16-0
|
||||
MOVW R(q), 4(R13)
|
||||
MOVW R(r), 8(R13)
|
||||
MOVW R(s), 12(R13)
|
||||
MOVW R(M), 16(R13)
|
||||
|
||||
MOVW R(TMP), R(r) /* numerator */
|
||||
MOVW 0(FP), R(q) /* denominator */
|
||||
MOVW m_divmod(m), R(q) /* denominator */
|
||||
MOVW $0, R(s)
|
||||
MOVW R(s), m_divmod(m)
|
||||
BL udiv<>(SB)
|
||||
MOVW R(q), R(TMP)
|
||||
MOVW 4(R13), R(q)
|
||||
@ -223,14 +211,16 @@ TEXT _divu(SB), NOSPLIT, $16
|
||||
MOVW 16(R13), R(M)
|
||||
RET
|
||||
|
||||
TEXT _modu(SB), NOSPLIT, $16
|
||||
TEXT _modu(SB), NOSPLIT, $16-0
|
||||
MOVW R(q), 4(R13)
|
||||
MOVW R(r), 8(R13)
|
||||
MOVW R(s), 12(R13)
|
||||
MOVW R(M), 16(R13)
|
||||
|
||||
MOVW R(TMP), R(r) /* numerator */
|
||||
MOVW 0(FP), R(q) /* denominator */
|
||||
MOVW m_divmod(m), R(q) /* denominator */
|
||||
MOVW $0, R(s)
|
||||
MOVW R(s), m_divmod(m)
|
||||
BL udiv<>(SB)
|
||||
MOVW R(r), R(TMP)
|
||||
MOVW 4(R13), R(q)
|
||||
@ -239,13 +229,15 @@ TEXT _modu(SB), NOSPLIT, $16
|
||||
MOVW 16(R13), R(M)
|
||||
RET
|
||||
|
||||
TEXT _div(SB),NOSPLIT,$16
|
||||
TEXT _div(SB),NOSPLIT,$16-0
|
||||
MOVW R(q), 4(R13)
|
||||
MOVW R(r), 8(R13)
|
||||
MOVW R(s), 12(R13)
|
||||
MOVW R(M), 16(R13)
|
||||
MOVW R(TMP), R(r) /* numerator */
|
||||
MOVW 0(FP), R(q) /* denominator */
|
||||
MOVW m_divmod(m), R(q) /* denominator */
|
||||
MOVW $0, R(s)
|
||||
MOVW R(s), m_divmod(m)
|
||||
CMP $0, R(r)
|
||||
BGE d1
|
||||
RSB $0, R(r), R(r)
|
||||
@ -265,13 +257,15 @@ d2:
|
||||
RSB $0, R(q), R(TMP)
|
||||
B out
|
||||
|
||||
TEXT _mod(SB),NOSPLIT,$16
|
||||
TEXT _mod(SB),NOSPLIT,$16-0
|
||||
MOVW R(q), 4(R13)
|
||||
MOVW R(r), 8(R13)
|
||||
MOVW R(s), 12(R13)
|
||||
MOVW R(M), 16(R13)
|
||||
MOVW R(TMP), R(r) /* numerator */
|
||||
MOVW 0(FP), R(q) /* denominator */
|
||||
MOVW m_divmod(m), R(q) /* denominator */
|
||||
MOVW $0, R(s)
|
||||
MOVW R(s), m_divmod(m)
|
||||
CMP $0, R(q)
|
||||
RSB.LT $0, R(q), R(q)
|
||||
CMP $0, R(r)
|
||||
|
Loading…
Reference in New Issue
Block a user