Metrics for Development.Shake.Profile:generateTrace from shake-0.15.5

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

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 7 to 6 computations (14.3% saved)

sample468.0ms (54.5%)

Memory

18.4MiB live, 669.3MiB allocated; 129ms collecting garbage

Samples

262.0ms

8 256×

valid

Precisions

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

ival-sub: 47.0ms (51.2% of total)

ival-mult: 34.0ms (37% of total)

exact: 6.0ms (6.5% of total)

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

adjust: 2.0ms (2.2% of total)

Bogosity

explain58.0ms (6.7%)

Memory

-20.8MiB live, 73.6MiB allocated; 40ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(-.f64 x x)`
-	-	`(*.f64 #s(literal 1000000 binary64) (-.f64 x x))`
-	-	`#s(literal 1000000 binary64)`
-	-	`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

15.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-sub: 3.0ms (58.8% of total)

ival-mult: 1.0ms (19.6% of total)

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

preprocess261.0ms (30.3%)

Memory

27.6MiB live, 167.3MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	3
1	15	3
2	26	3
3	54	3
4	136	3
5	401	3
6	469	3
7	648	3
8	1265	3
9	3843	3
0	4	5
0	6	1
1	8	1
2	12	1
3	25	1
4	70	1
5	235	1
6	390	1
7	631	1
8	1236	1
9	3139	1
10	7726	1
0	8228	1

Stop Event

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

Calls

Call 1

Inputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Outputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
#s(literal 0 binary64)

Symmetry

(abs x)

(negabs x)

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Compiler

Compiled 5 to 4 computations (20% saved)

series1.0ms (0.1%)

Memory

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

Counts

4 → 3

Calls

Call 1

Inputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
#s(literal 1000000 binary64)
(-.f64 x x)
x

Outputs
#s(approx (* 1000000 (- x x)) #s(hole binary64 0))
#s(approx (- x x) #s(hole binary64 0))
#s(approx x #s(hole binary64 x))

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((* 1000000 (- x x)) 1000000 (- x x) x)
0.0ms	x	@	inf	((* 1000000 (- x x)) 1000000 (- x x) x)
0.0ms	x	@	0	((* 1000000 (- x x)) 1000000 (- x x) x)

rewrite37.0ms (4.3%)

Memory

1.2MiB live, 44.5MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	25
0	11	13
1	25	13
0	118	13

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

7 → 7

Calls

Call 1

Inputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
#s(literal 1000000 binary64)
(-.f64 x x)
x
#s(approx (* 1000000 (- x x)) #s(hole binary64 0))
#s(approx (- x x) #s(hole binary64 0))
#s(approx x #s(hole binary64 x))

Outputs
#s(literal 0 binary64)
#s(literal 1000000 binary64)
#s(literal 0 binary64)
x
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
#s(approx x x)

eval1.0ms (0.1%)

Memory: 0.8MiB live, 0.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 37 to 14 computations (62.2% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	7	0	7
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	7	1	8

Accuracy

100.0%

Counts

8 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Compiler

Compiled 10 to 8 computations (20% saved)

simplify8.0ms (1%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	4	5
1	7	3
2	13	3
3	14	3

Stop Event

1×

saturated

Calls

Call 1

Inputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Outputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
(*.f64 #s(literal 1000000 binary64) #s(literal 0 binary64))

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 3 to 4 computations (-33.3% saved)

preprocess24.0ms (2.8%)

Memory

1.5MiB live, 44.6MiB allocated; 5ms collecting garbage

Remove

(negabs x)

(abs x)

Compiler

Compiled 40 to 48 computations (-20% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample468.0ms (54.5%)

explain58.0ms (6.7%)

preprocess261.0ms (30.3%)

eval0.0ms (0%)

prune0.0ms (0%)

series1.0ms (0.1%)

rewrite37.0ms (4.3%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

simplify8.0ms (1%)

derivations0.0ms (0%)

preprocess24.0ms (2.8%)

end0.0ms (0%)

Profiling