Metrics for bug329 (missed optimization)

analyze10.0ms (1.1%)

Memory

-27.5MiB live, 15.2MiB allocated

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)

sample634.0ms (73.1%)

Memory

15.2MiB live, 829.6MiB allocated

Samples

431.0ms

8 256×

valid

Precisions

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

ival-div: 81.0ms (45.2% of total)

ival-atan: 44.0ms (24.5% of total)

ival->=: 43.0ms (24% of total)

exact: 8.0ms (4.5% of total)

ival-assert: 3.0ms (1.7% of total)

Bogosity

preprocess17.0ms (2%)

Memory

-13.5MiB live, 25.3MiB allocated

Algorithm

1×	egg-herbie

Rules

30×	`sub-neg`
20×	`+-commutative`
14×	`div-sub`
10×	`*-commutative`
10×	`neg-sub0`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	26
1	24	26
2	36	26
3	46	26
4	54	26
5	68	26
6	88	26
7	98	26
8	100	26
0	4	4
0	6	4
0	6	4

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

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

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

explain43.0ms (5%)

Memory

12.3MiB live, 87.7MiB allocated

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(/.f64 y x)`
-	-	`y`
-	-	`(atan.f64 (/.f64 y x))`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

21.0ms

512×

valid

Compiler

Compiled 34 to 20 computations (41.2% saved)

Precisions

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

ival-div: 4.0ms (50.4% of total)

ival-atan: 3.0ms (37.8% of total)

ival-true: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

eval0.0ms (0%)

Memory: 0.4MiB live, 0.4MiB allocated
Compiler: Compiled 2 to 2 computations (0% saved)

prune1.0ms (0.1%)

Memory

1.3MiB live, 1.3MiB allocated

Alt Table

Click to see full alt table

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

simplify4.0ms (0.4%)

Memory

7.0MiB live, 7.0MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(/.f64 y x)
✓	cost-diff	0	(atan.f64 (/.f64 y x))

Rules

2×	`lift-/.f64`
2×	`lower-atan.f32`
2×	`lift-atan.f64`
2×	`lower-/.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	9
0	6	9
0	6	9

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize18.0ms (2.1%)

Memory

-12.1MiB live, 29.0MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(/.f64 y x)
✓	accuracy	100.0%	(atan.f64 (/.f64 y x))

Samples

14.0ms

256×

valid

Compiler

Compiled 11 to 6 computations (45.5% saved)

Precisions

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

ival-div: 2.0ms (51.6% of total)

ival-atan: 1.0ms (25.8% of total)

ival-true: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series3.0ms (0.4%)

Memory

6.9MiB live, 6.9MiB allocated

Counts

2 → 48

Calls

Call 1

Inputs
#<alt (atan.f64 (/.f64 y x))>
#<alt (/.f64 y x)>

Outputs
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (atan (/ y x))>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>
#<alt (/ y x)>

Calls

12 calls:

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

rewrite73.0ms (8.4%)

Memory

-3.8MiB live, 107.7MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

522×	`lower-*.f64`
522×	`lower-*.f32`
470×	`lower-/.f32`
468×	`lower-/.f64`
136×	`lower--.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	7
0	6	7
1	14	7
2	49	7
3	224	7
0	1218	7

Stop Event

1×	iter limit
1×	iter limit
1×	node limit
1×	iter limit

Counts

2 → 62

Calls

Call 1

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

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

simplify5.0ms (0.5%)

Memory

15.8MiB live, 15.9MiB allocated

Algorithm

1×	egg-herbie

Rules

2×	`lower-atan.f32`
2×	`lower-/.f32`
2×	`lower-/.f64`
2×	`lower-atan.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	168
0	4	168

Stop Event

1×	iter limit
1×	saturated

Counts

48 → 48

Calls

Call 1

Inputs
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(atan (/ y x))
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)
(/ y x)

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

eval18.0ms (2.1%)

Memory: -8.6MiB live, 34.0MiB allocated
Compiler: Compiled 820 to 197 computations (76% saved)

prune10.0ms (1.1%)

Memory

-14.6MiB live, 23.5MiB allocated

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	110	0	110
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	110	1	111

Accuracy

100.0%

Counts

111 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 12 to 8 computations (33.3% saved)

simplify5.0ms (0.6%)

Memory

14.0MiB live, 14.0MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	4

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness0.0ms (0%)

Memory

0.8MiB live, 0.8MiB allocated

Stop Event

1×

done

Compiler

Compiled 6 to 4 computations (33.3% saved)

preprocess28.0ms (3.2%)

Memory: 3.8MiB live, 79.9MiB allocated
Compiler: Compiled 34 to 22 computations (35.3% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze10.0ms (1.1%)

sample634.0ms (73.1%)

preprocess17.0ms (2%)

explain43.0ms (5%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify4.0ms (0.4%)

localize18.0ms (2.1%)

series3.0ms (0.4%)

rewrite73.0ms (8.4%)

simplify5.0ms (0.5%)

eval18.0ms (2.1%)

prune10.0ms (1.1%)

simplify5.0ms (0.6%)

soundness0.0ms (0%)

preprocess28.0ms (3.2%)

end0.0ms (0%)

Profiling