Metrics for FastMath test1

analyze0.0ms (0%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 9 to 7 computations (22.2% saved)

Precisions

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

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

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

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

sample656.0ms (77.9%)

Results

454.0ms

8256×

valid

Precisions

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

ival-mult: 157.0ms (69.7% of total)

ival-add: 50.0ms (22.2% of total)

const: 15.0ms (6.7% of total)

backward-pass: 3.0ms (1.3% of total)

Bogosity

preprocess23.0ms (2.7%)

Algorithm

2×	egg-herbie

Rules

184×	`fnmsub-define`
184×	`fmsub-define`
184×	`fnmadd-define`
140×	`fmm-def`
60×	`sum3-define`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	10
1	34	10
2	102	9
3	303	9
4	530	9
5	656	9
6	680	9
0	6	3
1	13	3
2	18	3
0	18	3

Stop Event

1×	iter limit
1×	saturated
1×	saturated

Calls

Call 1

Inputs
(+ (* d 10) (* d 20))

Outputs
(+ (* d 10) (* d 20))
(*.f64 d #s(literal 30 binary64))

Call 2

Inputs
(+ (* d 10) (* d 20))
(+ (* (neg d) 10) (* (neg d) 20))
(neg (+ (* (neg d) 10) (* (neg d) 20)))

Outputs
(+ (* d 10) (* d 20))
(* d 30)
(+ (* (neg d) 10) (* (neg d) 20))
(* d -30)
(neg (+ (* (neg d) 10) (* (neg d) 20)))
(* d 30)

Symmetry

(negabs d)

explain58.0ms (6.9%)

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`#s(literal 10 binary64)`
-	-	`(*.f64 d #s(literal 20 binary64))`
-	-	`#s(literal 20 binary64)`
-	-	`(*.f64 d #s(literal 10 binary64))`
-	-	`d`
-	-	`(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))`

Results

37.0ms

512×

valid

Compiler

Compiled 44 to 20 computations (54.5% saved)

Precisions

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

ival-mult: 7.0ms (53.6% of total)

ival-add: 4.0ms (30.7% of total)

const: 1.0ms (7.7% of total)

backward-pass: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler: Compiled 4 to 3 computations (25% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 d #s(literal 30 binary64))

Compiler

Compiled 4 to 3 computations (25% saved)

simplify3.0ms (0.4%)

Algorithm

1×	egg-herbie

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(*.f64 d #s(literal 30 binary64))

Rules

4×	`-lowering-.f32`
4×	`-lowering-.f64`
2×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	5
1	4	5
0	4	5

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(* d 30)
d
30

Outputs
(* d 30)
(*.f64 d #s(literal 30 binary64))
d
30
#s(literal 30 binary64)

localize19.0ms (2.2%)

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(*.f64 d #s(literal 30 binary64))

Results

9.0ms

256×

valid

Compiler

Compiled 7 to 4 computations (42.9% saved)

Precisions

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

ival-mult: 2.0ms (81.6% of total)

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

series1.0ms (0.1%)

Counts

1 → 12

Calls

Call 1

Inputs
#<alt (* d 30)>

Outputs
#<alt (* 30 d)>
#<alt (* 30 d)>
#<alt (* 30 d)>
#<alt (* 30 d)>
#<alt (* 30 d)>
#<alt (* 30 d)>
#<alt (* 30 d)>
#<alt (* 30 d)>
#<alt (* 30 d)>
#<alt (* 30 d)>
#<alt (* 30 d)>
#<alt (* 30 d)>

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	d	@	-inf	(* d 30)
0.0ms	d	@	inf	(* d 30)
0.0ms	d	@	0	(* d 30)

rewrite23.0ms (2.7%)

Algorithm

1×	batch-egg-rewrite

Rules

4×	`-lowering-.f32`
4×	`-lowering-.f64`
2×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	3
1	4	3
0	4	3

Stop Event

1×	iter limit
1×	saturated

Counts

1 → 2

Calls

Call 1

Inputs
(* d 30)

Outputs
(*.f64 d #s(literal 30 binary64))
(*.f64 #s(literal 30 binary64) d)

simplify4.0ms (0.4%)

Algorithm

1×	egg-herbie

Rules

4×	`-lowering-.f32`
4×	`-lowering-.f64`
2×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	36
1	4	36
0	4	36

Stop Event

1×	iter limit
1×	saturated

Counts

12 → 12

Calls

Call 1

Inputs
(* 30 d)
(* 30 d)
(* 30 d)
(* 30 d)
(* 30 d)
(* 30 d)
(* 30 d)
(* 30 d)
(* 30 d)
(* 30 d)
(* 30 d)
(* 30 d)

Outputs
(* 30 d)
(*.f64 #s(literal 30 binary64) d)
(* 30 d)
(*.f64 #s(literal 30 binary64) d)
(* 30 d)
(*.f64 #s(literal 30 binary64) d)
(* 30 d)
(*.f64 #s(literal 30 binary64) d)
(* 30 d)
(*.f64 #s(literal 30 binary64) d)
(* 30 d)
(*.f64 #s(literal 30 binary64) d)
(* 30 d)
(*.f64 #s(literal 30 binary64) d)
(* 30 d)
(*.f64 #s(literal 30 binary64) d)
(* 30 d)
(*.f64 #s(literal 30 binary64) d)
(* 30 d)
(*.f64 #s(literal 30 binary64) d)
(* 30 d)
(*.f64 #s(literal 30 binary64) d)
(* 30 d)
(*.f64 #s(literal 30 binary64) d)

eval1.0ms (0.2%)

Compiler: Compiled 43 to 4 computations (90.7% saved)

prune1.0ms (0.1%)

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	14	0	14
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	14	1	15

Accuracy

100.0%

Counts

15 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 d #s(literal 30 binary64))

Compiler

Compiled 15 to 11 computations (26.7% saved)

regimes3.0ms (0.4%)

Accuracy

Total -0.3b remaining (-∞%)

Threshold costs -0.3b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(*.f64 d #s(literal 30 binary64))
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))

Outputs
(*.f64 d #s(literal 30 binary64))

Calls

2 calls:

1.0ms	(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))
1.0ms	d

Results

Accuracy	Segments	Branch
100.0%	1	`d`
100.0%	1	`(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))`

Compiler

Compiled 10 to 7 computations (30% saved)

simplify10.0ms (1.2%)

Algorithm

1×	egg-herbie

Rules

2×	`*-commutative_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	3
1	4	3

Stop Event

1×

saturated

Calls

Call 1

Inputs
(*.f64 d #s(literal 30 binary64))

Outputs
(*.f64 d #s(literal 30 binary64))

soundness4.0ms (0.4%)

Rules

12×	`-lowering-.f32`
12×	`-lowering-.f64`
8×	`fma-lowering-fma.f32`
8×	`fma-define`
8×	`fma-lowering-fma.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	3
1	13	3
2	18	3
0	18	3

Stop Event

1×	done
1×	iter limit
1×	saturated

Compiler

Compiled 8 to 6 computations (25% saved)

preprocess34.0ms (4.1%)

Remove: (negabs d)
Compiler: Compiled 48 to 36 computations (25% saved)

FastMath test1

analyze0.0ms (0%)

sample656.0ms (77.9%)

preprocess23.0ms (2.7%)

explain58.0ms (6.9%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify3.0ms (0.4%)

localize19.0ms (2.2%)

series1.0ms (0.1%)

rewrite23.0ms (2.7%)

simplify4.0ms (0.4%)

eval1.0ms (0.2%)

prune1.0ms (0.1%)

regimes3.0ms (0.4%)

simplify10.0ms (1.2%)

soundness4.0ms (0.4%)

preprocess34.0ms (4.1%)

end0.0ms (0%)

Profiling