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.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)

sample557.0ms (45.6%)

Memory

-16.0MiB live, 708.9MiB allocated; 121ms collecting garbage

Samples

373.0ms

8 256×

valid

Precisions

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

ival-mult!: 83.0ms (79.1% of total)

ival-sub!: 21.0ms (20% of total)

adjust: 1.0ms (1% of total)

Bogosity

preprocess38.0ms (3.1%)

Memory

-3.8MiB live, 41.5MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	3
1	19	3
2	61	3
3	303	3
4	1819	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)

series3.0ms (0.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	10

Stop Event

1×	iter-limit

Counts

4 → 2

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(literal 0 binary64))
#s(approx x 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)

rewrite268.0ms (21.9%)

Memory

-11.2MiB live, 264.5MiB allocated; 108ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	4
1	25	4
2	59	4
3	361	4
4	2948	4
0	8030	4
1	13778	4

Stop Event

1×	saturated
1×	node-limit
1×	iter-limit

Counts

4 → 4

Calls

Call 1

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

Outputs
#s(literal 0 binary64)
#s(literal 1000000 binary64)
#s(literal 0 binary64)
x

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

series1.0ms (0.1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	7

Stop Event

1×	iter-limit

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(literal 0 binary64))

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)

rewrite338.0ms (27.7%)

Memory

-31.9MiB live, 296.9MiB allocated; 26ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	8
0	6	4
1	27	4
2	76	4
3	564	4
4	6776	4
0	9307	4
1	16697	4

Stop Event

1×	saturated
1×	node-limit
1×	saturated

Counts

2 → 2

Calls

Call 1

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

Outputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
#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.1%)

Memory

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

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

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 6 to 6 computations (0% saved)

preprocess11.0ms (0.9%)

Memory

25.8MiB live, 25.8MiB allocated; 0ms 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%)

sample557.0ms (45.6%)

preprocess38.0ms (3.1%)

series3.0ms (0.3%)

rewrite268.0ms (21.9%)

eval0.0ms (0%)

prune0.0ms (0%)

series1.0ms (0.1%)

rewrite338.0ms (27.7%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes3.0ms (0.2%)

derivations0.0ms (0%)

preprocess11.0ms (0.9%)

end0.0ms (0%)

Profiling