Metrics for bug329 (missed optimization)

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

analyze7.0ms (0.8%)

Memory

8.6MiB live, 8.6MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	50%	50%	0%	0%	0%	0
0%	0%	50%	50%	0%	0%	0%	1
50%	25%	25%	50%	0%	0%	0%	2
50%	25%	25%	50%	0%	0%	0%	3
75%	37.5%	12.5%	50%	0%	0%	0%	4
75%	37.5%	12.5%	50%	0%	0%	0%	5
87.5%	43.7%	6.2%	50%	0%	0%	0%	6
87.5%	43.7%	6.2%	50%	0%	0%	0%	7
93.8%	46.8%	3.1%	50%	0%	0%	0%	8
93.8%	46.8%	3.1%	50%	0%	0%	0%	9
96.9%	48.4%	1.6%	50%	0%	0%	0%	10
96.9%	48.4%	1.6%	50%	0%	0%	0%	11
98.4%	49.2%	0.8%	50%	0%	0%	0%	12

Compiler

Compiled 8 to 7 computations (12.5% saved)

sample614.0ms (69.8%)

Memory

2.4MiB live, 566.0MiB allocated; 189ms collecting garbage

Samples

427.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 138.0ms

ival-div!: 88.0ms (63.9% of total)

ival-atan: 49.0ms (35.6% of total)

adjust: 1.0ms (0.7% of total)

Bogosity

preprocess79.0ms (9%)

Memory

-18.9MiB live, 27.6MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	26
1	33	26
2	86	26
3	162	26
4	428	26
5	2434	26

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(atan.f64 (/.f64 y x))

Symmetry

(negabs x)

(negabs y)

Compiler

Compiled 8 to 8 computations (0% saved)

series4.0ms (0.5%)

Memory

7.7MiB live, 7.7MiB allocated; 0ms collecting garbage

Counts

4 → 4

Calls

Call 1

Inputs
(atan.f64 (/.f64 y x))
(/.f64 y x)
y
x

Outputs
#s(approx (atan (/ y x)) #s(hole binary64 (atan (/ y x))))
#s(approx (/ y x) #s(hole binary64 (/ y x)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((atan (/ y x)) (/ y x) y x)
1.0ms	x	@	-inf	((atan (/ y x)) (/ y x) y x)
1.0ms	y	@	inf	((atan (/ y x)) (/ y x) y x)
1.0ms	y	@	-inf	((atan (/ y x)) (/ y x) y x)
1.0ms	y	@	0	((atan (/ y x)) (/ y x) y x)

rewrite74.0ms (8.4%)

Memory

14.3MiB live, 107.8MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	31
0	11	31
1	19	31
2	49	31
3	158	31
0	626	31
1	1900	31

Stop Event

1×	saturated
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

8 → 45

Calls

Call 1

Inputs
(atan.f64 (/.f64 y x))
(/.f64 y x)
y
x
#s(approx (atan (/ y x)) #s(hole binary64 (atan (/ y x))))
#s(approx (/ y x) #s(hole binary64 (/ y x)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Outputs
(neg.f64 (atan.f64 (/.f64 (neg.f64 y) x)))
(atan.f64 (/.f64 y x))
(*.f64 (/.f64 (neg.f64 y) x) #s(literal -1 binary64))
(*.f64 (/.f64 #s(literal -1 binary64) x) (neg.f64 y))
(*.f64 #s(literal -1 binary64) (/.f64 (neg.f64 y) x))
(*.f64 (/.f64 #s(literal 1 binary64) x) y)
(*.f64 #s(literal 1 binary64) (/.f64 y x))
(*.f64 (neg.f64 y) (/.f64 #s(literal -1 binary64) x))
(*.f64 (/.f64 y x) #s(literal 1 binary64))
(*.f64 y (/.f64 #s(literal 1 binary64) x))
(/.f64 (*.f64 (/.f64 y x) #s(literal 2 binary64)) #s(literal 2 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (/.f64 y x)) #s(literal 2 binary64))
(/.f64 (*.f64 (neg.f64 y) #s(literal -1 binary64)) x)
(/.f64 (*.f64 #s(literal -1 binary64) (neg.f64 y)) x)
(/.f64 (.f64 (neg.f64 y) #s(literal 2 binary64)) (.f64 (neg.f64 x) #s(literal 2 binary64)))
(/.f64 (.f64 y #s(literal 2 binary64)) (.f64 x #s(literal 2 binary64)))
(/.f64 (.f64 #s(literal 2 binary64) (neg.f64 y)) (.f64 #s(literal 2 binary64) (neg.f64 x)))
(/.f64 (.f64 #s(literal 2 binary64) y) (.f64 #s(literal 2 binary64) x))
(/.f64 (neg.f64 y) (neg.f64 x))
(/.f64 y x)
(neg.f64 (/.f64 (neg.f64 y) x))
(fma.f64 (/.f64 (neg.f64 y) x) #s(literal -1 binary64) (*.f64 (/.f64 y x) #s(literal 0 binary64)))
(fma.f64 (/.f64 (neg.f64 y) x) #s(literal -1 binary64) (*.f64 #s(literal 0 binary64) (/.f64 y x)))
(fma.f64 (/.f64 #s(literal -1 binary64) x) (neg.f64 y) (*.f64 (/.f64 y x) #s(literal 0 binary64)))
(fma.f64 (/.f64 #s(literal -1 binary64) x) (neg.f64 y) (*.f64 #s(literal 0 binary64) (/.f64 y x)))
(fma.f64 #s(literal -1 binary64) (/.f64 (neg.f64 y) x) (*.f64 (/.f64 y x) #s(literal 0 binary64)))
(fma.f64 #s(literal -1 binary64) (/.f64 (neg.f64 y) x) (*.f64 #s(literal 0 binary64) (/.f64 y x)))
(fma.f64 (/.f64 #s(literal 1 binary64) x) y (*.f64 (/.f64 y x) #s(literal 0 binary64)))
(fma.f64 (/.f64 #s(literal 1 binary64) x) y (*.f64 #s(literal 0 binary64) (/.f64 y x)))
(fma.f64 #s(literal 1 binary64) (/.f64 y x) (*.f64 (/.f64 y x) #s(literal 0 binary64)))
(fma.f64 #s(literal 1 binary64) (/.f64 y x) (*.f64 #s(literal 0 binary64) (/.f64 y x)))
(fma.f64 (neg.f64 y) (/.f64 #s(literal -1 binary64) x) (*.f64 (/.f64 y x) #s(literal 0 binary64)))
(fma.f64 (neg.f64 y) (/.f64 #s(literal -1 binary64) x) (*.f64 #s(literal 0 binary64) (/.f64 y x)))
(fma.f64 (/.f64 y x) #s(literal 1 binary64) (*.f64 (/.f64 y x) #s(literal 0 binary64)))
(fma.f64 (/.f64 y x) #s(literal 1 binary64) (*.f64 #s(literal 0 binary64) (/.f64 y x)))
(fma.f64 y (/.f64 #s(literal 1 binary64) x) (*.f64 (/.f64 y x) #s(literal 0 binary64)))
(fma.f64 y (/.f64 #s(literal 1 binary64) x) (*.f64 #s(literal 0 binary64) (/.f64 y x)))
(+.f64 (/.f64 y x) (*.f64 (/.f64 y x) #s(literal 0 binary64)))
(+.f64 (/.f64 y x) (*.f64 #s(literal 0 binary64) (/.f64 y x)))
y
x
#s(approx (atan (/ y x)) (atan.f64 (/.f64 y x)))
#s(approx (/ y x) (/.f64 y x))
#s(approx x x)
#s(approx y y)

eval4.0ms (0.4%)

Memory: 10.3MiB live, 10.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 195 to 112 computations (42.6% saved)

prune2.0ms (0.2%)

Memory

4.9MiB live, 4.9MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	40	1	41
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	40	2	42

Accuracy

100.0%

Counts

42 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(atan.f64 (/.f64 y x))
▶	99.8%	(atan.f64 (*.f64 (/.f64 #s(literal 1 binary64) x) y))

Compiler

Compiled 10 to 10 computations (0% saved)

series14.0ms (1.6%)

Memory

-37.9MiB live, 8.4MiB allocated; 17ms collecting garbage

Counts

6 → 5

Calls

Call 1

Inputs
(atan.f64 (*.f64 (/.f64 #s(literal 1 binary64) x) y))
(*.f64 (/.f64 #s(literal 1 binary64) x) y)
(/.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
x
y

Outputs
#s(approx (atan (* (/ 1 x) y)) #s(hole binary64 (atan (/ y x))))
#s(approx (* (/ 1 x) y) #s(hole binary64 (/ y x)))
#s(approx (/ 1 x) #s(hole binary64 (/ 1 x)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
12.0ms	y	@	-inf	((atan (* (/ 1 x) y)) (* (/ 1 x) y) (/ 1 x) 1 x y)
1.0ms	x	@	-inf	((atan (* (/ 1 x) y)) (* (/ 1 x) y) (/ 1 x) 1 x y)
0.0ms	y	@	inf	((atan (* (/ 1 x) y)) (* (/ 1 x) y) (/ 1 x) 1 x y)
0.0ms	x	@	0	((atan (* (/ 1 x) y)) (* (/ 1 x) y) (/ 1 x) 1 x y)
0.0ms	x	@	inf	((atan (* (/ 1 x) y)) (* (/ 1 x) y) (/ 1 x) 1 x y)

rewrite56.0ms (6.4%)

Memory

13.1MiB live, 58.0MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	50
0	20	42
1	40	42
2	103	42
0	399	42
1	1044	42

Stop Event

1×	saturated
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

11 → 61

Calls

Call 1

Inputs
(atan.f64 (*.f64 (/.f64 #s(literal 1 binary64) x) y))
(*.f64 (/.f64 #s(literal 1 binary64) x) y)
(/.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
x
y
#s(approx (atan (* (/ 1 x) y)) #s(hole binary64 (atan (/ y x))))
#s(approx (* (/ 1 x) y) #s(hole binary64 (/ y x)))
#s(approx (/ 1 x) #s(hole binary64 (/ 1 x)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Outputs
(neg.f64 (atan.f64 (/.f64 (neg.f64 y) x)))
(atan.f64 (/.f64 y x))
(*.f64 (/.f64 #s(literal -1 binary64) x) (neg.f64 y))
(*.f64 (neg.f64 y) (/.f64 #s(literal -1 binary64) x))
(.f64 #s(literal -1 binary64) (.f64 (/.f64 #s(literal -1 binary64) x) y))
(*.f64 #s(literal -1 binary64) (/.f64 (neg.f64 y) x))
(*.f64 (/.f64 y x) #s(literal 1 binary64))
(*.f64 (/.f64 #s(literal 1 binary64) x) y)
(*.f64 y (/.f64 #s(literal 1 binary64) x))
(*.f64 #s(literal 1 binary64) (/.f64 y x))
(/.f64 (*.f64 #s(literal 2 binary64) (/.f64 y x)) #s(literal 2 binary64))
(/.f64 (.f64 #s(literal 2 binary64) (neg.f64 y)) (.f64 #s(literal 2 binary64) (neg.f64 x)))
(/.f64 (.f64 #s(literal 2 binary64) y) (.f64 #s(literal 2 binary64) x))
(/.f64 (neg.f64 y) (neg.f64 x))
(/.f64 y x)
(neg.f64 (*.f64 (/.f64 #s(literal -1 binary64) x) y))
(neg.f64 (*.f64 #s(literal -1 binary64) (/.f64 y x)))
(neg.f64 (/.f64 (neg.f64 y) x))
(*.f64 (/.f64 #s(literal -1 binary64) x) #s(literal -1 binary64))
(.f64 #s(literal -1 binary64) (.f64 (/.f64 #s(literal -1 binary64) x) #s(literal 1 binary64)))
(*.f64 #s(literal -1 binary64) (/.f64 #s(literal -1 binary64) x))
(*.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x))
(pow.f64 x #s(literal -1 binary64))
(/.f64 (*.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64)) #s(literal 2 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)) #s(literal 2 binary64))
(/.f64 #s(literal -2 binary64) (*.f64 (neg.f64 x) #s(literal 2 binary64)))
(/.f64 #s(literal -2 binary64) (*.f64 #s(literal 2 binary64) (neg.f64 x)))
(/.f64 #s(literal 2 binary64) (*.f64 x #s(literal 2 binary64)))
(/.f64 #s(literal 2 binary64) (*.f64 #s(literal 2 binary64) x))
(/.f64 #s(literal -1 binary64) (neg.f64 x))
(/.f64 #s(literal 1 binary64) x)
(neg.f64 (*.f64 (/.f64 #s(literal -1 binary64) x) #s(literal 1 binary64)))
(neg.f64 (*.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))
(neg.f64 (/.f64 #s(literal -1 binary64) x))
(fma.f64 (/.f64 #s(literal -1 binary64) x) #s(literal -1 binary64) (*.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 0 binary64)))
(fma.f64 (/.f64 #s(literal -1 binary64) x) #s(literal -1 binary64) (*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) x)))
(fma.f64 (/.f64 #s(literal -1 binary64) x) #s(literal -1 binary64) (/.f64 #s(literal 0 binary64) x))
(fma.f64 #s(literal -1 binary64) (.f64 (/.f64 #s(literal -1 binary64) x) #s(literal 1 binary64)) (.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 0 binary64)))
(fma.f64 #s(literal -1 binary64) (.f64 (/.f64 #s(literal -1 binary64) x) #s(literal 1 binary64)) (.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) x)))
(fma.f64 #s(literal -1 binary64) (*.f64 (/.f64 #s(literal -1 binary64) x) #s(literal 1 binary64)) (/.f64 #s(literal 0 binary64) x))
(fma.f64 #s(literal -1 binary64) (/.f64 #s(literal -1 binary64) x) (*.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 0 binary64)))
(fma.f64 #s(literal -1 binary64) (/.f64 #s(literal -1 binary64) x) (*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) x)))
(fma.f64 #s(literal -1 binary64) (/.f64 #s(literal -1 binary64) x) (/.f64 #s(literal 0 binary64) x))
(fma.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64) (*.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 0 binary64)))
(fma.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64) (*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) x)))
(fma.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64) (/.f64 #s(literal 0 binary64) x))
(fma.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x) (*.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 0 binary64)))
(fma.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x) (*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) x)))
(fma.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x) (/.f64 #s(literal 0 binary64) x))
(+.f64 (/.f64 #s(literal 1 binary64) x) (*.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 0 binary64)))
(+.f64 (/.f64 #s(literal 1 binary64) x) (*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) x)))
(+.f64 (/.f64 #s(literal 1 binary64) x) (/.f64 #s(literal 0 binary64) x))
#s(literal 1 binary64)
x
y
#s(approx (atan (* (/ 1 x) y)) (atan.f64 (/.f64 y x)))
#s(approx (* (/ 1 x) y) (/.f64 y x))
#s(approx (/ 1 x) (/.f64 #s(literal 1 binary64) x))
#s(approx x x)
#s(approx y y)

eval5.0ms (0.6%)

Memory: 8.1MiB live, 8.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 266 to 179 computations (32.7% saved)

prune2.0ms (0.2%)

Memory

3.2MiB live, 3.2MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	54	0	54
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	54	2	56

Accuracy

100.0%

Counts

56 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(atan.f64 (/.f64 y x))
✓	99.8%	(atan.f64 (*.f64 (/.f64 #s(literal 1 binary64) x) y))

Compiler

Compiled 18 to 18 computations (0% saved)

regimes5.0ms (0.5%)

Memory

8.2MiB live, 8.2MiB allocated; 0ms collecting garbage

Accuracy

Total -0.1b remaining (-2600%)

Threshold costs -0.1b (-2600%)

Counts

2 → 1

Calls

Call 1

Inputs
(atan.f64 (/.f64 y x))
(atan.f64 (*.f64 (/.f64 #s(literal 1 binary64) x) y))

Outputs
(atan.f64 (/.f64 y x))

Calls

4 calls:

1.0ms	y
1.0ms	x
1.0ms	(/.f64 y x)
1.0ms	(atan.f64 (/.f64 y x))

Results

Accuracy	Segments	Branch
100.0%	1	`(/.f64 y x)`
100.0%	1	`(atan.f64 (/.f64 y x))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 9 to 11 computations (-22.2% saved)

derivations0.0ms (0%)

Memory

0.2MiB live, 0.2MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 4 to 4 computations (0% saved)

preprocess13.0ms (1.5%)

Memory

16.6MiB live, 16.6MiB allocated; 0ms collecting garbage

Remove

(negabs y)

(negabs x)

Compiler

Compiled 24 to 24 computations (0% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze7.0ms (0.8%)

sample614.0ms (69.8%)

preprocess79.0ms (9%)

series4.0ms (0.5%)

rewrite74.0ms (8.4%)

eval4.0ms (0.4%)

prune2.0ms (0.2%)

series14.0ms (1.6%)

rewrite56.0ms (6.4%)

eval5.0ms (0.6%)

prune2.0ms (0.2%)

regimes5.0ms (0.5%)

derivations0.0ms (0%)

preprocess13.0ms (1.5%)

end0.0ms (0%)

Profiling