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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.3MiB live, 0.3MiB 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)

sample591.0ms (55.4%)

Memory

-8.1MiB live, 697.4MiB allocated; 111ms collecting garbage

Samples

386.0ms

8 256×

valid

Precisions

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

ival-sub: 156.0ms (83.9% of total)

ival-mult: 20.0ms (10.8% of total)

exact: 6.0ms (3.2% of total)

adjust: 2.0ms (1.1% of total)

ival-assert: 2.0ms (1.1% of total)

Bogosity

explain52.0ms (4.8%)

Memory

26.5MiB live, 70.7MiB allocated; 5ms 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 (61.1% of total)

ival-mult: 1.0ms (20.4% 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)

preprocess252.0ms (23.6%)

Memory

-28.8MiB live, 208.9MiB allocated; 24ms 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.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

1.5MiB live, 1.5MiB 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

3.2MiB live, 3.2MiB 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)

rewrite44.0ms (4.1%)

Memory

0.5MiB live, 58.8MiB allocated; 5ms 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: 1.0MiB live, 1.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 37 to 14 computations (62.2% saved)

prune1.0ms (0%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	6	1	7
Fresh	0	0	0
Picked	1	0	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%	#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

Compiler

Compiled 7 to 6 computations (14.3% saved)

series0.0ms (0%)

Memory

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

Counts

2 → 1

Calls

Call 1

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

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

Calls

3 calls:

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

rewrite40.0ms (3.8%)

Memory

-11.2MiB live, 35.2MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	15
0	6	7
1	20	7
0	113	7

Stop Event

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

Counts

3 → 3

Calls

Call 1

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

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

eval0.0ms (0%)

Memory: 0.2MiB live, 0.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 14 to 6 computations (57.1% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	2	0	2
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	2	1	3

Accuracy

100.0%

Counts

3 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 19 to 15 computations (21.1% saved)

regimes3.0ms (0.3%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

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

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

Calls

3 calls:

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

Results

Accuracy	Segments	Branch
100.0%	1	`(-.f64 x x)`
100.0%	1	`(*.f64 #s(literal 1000000 binary64) (-.f64 x x))`
100.0%	1	`x`

Compiler

Compiled 9 to 7 computations (22.2% saved)

simplify65.0ms (6.1%)

Memory

3.2MiB live, 49.9MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	6	5
1	8	3
2	9	3
3	12	3
4	25	3
5	128	3
6	975	3
7	1874	3
8	2598	3
9	3887	3

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 7 to 6 computations (14.3% saved)

preprocess15.0ms (1.4%)

Memory

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

Remove

(negabs x)

(abs x)

Compiler

Compiled 54 to 48 computations (11.1% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample591.0ms (55.4%)

explain52.0ms (4.8%)

preprocess252.0ms (23.6%)

eval0.0ms (0%)

prune0.0ms (0%)

series1.0ms (0.1%)

rewrite44.0ms (4.1%)

eval1.0ms (0.1%)

prune1.0ms (0%)

series0.0ms (0%)

rewrite40.0ms (3.8%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes3.0ms (0.3%)

simplify65.0ms (6.1%)

derivations1.0ms (0.1%)

preprocess15.0ms (1.4%)

end0.0ms (0%)

Profiling