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.2MiB live, 0.2MiB 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)

sample492.0ms (30.1%)

Memory

32.5MiB live, 562.4MiB allocated; 196ms collecting garbage

Samples

354.0ms

8 256×

valid

Precisions

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

ival-mult!: 29.0ms (57.5% of total)

ival-sub!: 20.0ms (39.7% of total)

adjust: 2.0ms (4% of total)

Bogosity

preprocess74.0ms (4.5%)

Memory

-39.7MiB live, 55.8MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	3
1	15	3
2	27	3
3	71	3
4	264	3
5	1656	3

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(abs x)

(negabs x)

Compiler

Compiled 8 to 8 computations (0% saved)

series1.0ms (0.1%)

Memory

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

rewrite450.0ms (27.5%)

Memory

38.3MiB live, 131.3MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	25
0	12	13
1	16	13
2	30	13
3	106	13
4	629	13
0	9052	13

Stop Event

1×	iter-limit
1×	iter-limit
1×	node-limit
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)

eval0.0ms (0%)

Memory: 0.3MiB live, 0.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 11 to 10 computations (9.1% saved)

prune0.0ms (0%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

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

Accuracy

100.0%

Counts

4 → 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 6 to 6 computations (0% 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)

rewrite536.0ms (32.7%)

Memory

-54.2MiB live, 111.5MiB allocated; 189ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	15
0	6	7
1	10	7
2	24	7
3	100	7
4	623	7
0	9047	7

Stop Event

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

prune1.0ms (0%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accuracy

100.0%

Counts

1 → 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 15 to 15 computations (0% saved)

regimes3.0ms (0.2%)

Memory

5.8MiB live, 5.8MiB 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 7 to 7 computations (0% saved)

derivations32.0ms (2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 6 to 6 computations (0% saved)

preprocess46.0ms (2.8%)

Memory

-21.3MiB live, 23.9MiB allocated; 7ms collecting garbage

Remove

(negabs x)

(abs x)

Compiler

Compiled 34 to 34 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample492.0ms (30.1%)

preprocess74.0ms (4.5%)

series1.0ms (0.1%)

rewrite450.0ms (27.5%)

eval0.0ms (0%)

prune0.0ms (0%)

series0.0ms (0%)

rewrite536.0ms (32.7%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes3.0ms (0.2%)

derivations32.0ms (2%)

preprocess46.0ms (2.8%)

end0.0ms (0%)

Profiling