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

analyze0.0ms (0%)

Memory

0.1MiB live, 0.1MiB allocated

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)

sample736.0ms (70.1%)

Memory

-0.9MiB live, 400.0MiB allocated

Samples

605.0ms

8 256×

valid

Precisions

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

ival-sub: 320.0ms (91.4% of total)

ival-mult: 19.0ms (5.4% of total)

ival-true: 5.0ms (1.4% of total)

exact: 4.0ms (1.1% of total)

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

Bogosity

preprocess15.0ms (1.4%)

Memory

-5.0MiB live, 33.8MiB allocated

Algorithm

2×	egg-herbie

Rules

8×	`+-lowering-+.f64`
8×	`+-lowering-+.f32`
8×	`sub-neg`
8×	`distribute-lft-neg-in`
8×	`sub-neg`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	3
1	25	3
2	33	3
3	48	3
4	55	3
5	57	3
0	4	1
1	8	1
2	11	1
3	13	1
4	15	1
5	17	1
6	21	1
7	26	1
0	26	1

Stop Event

1×	iter limit
1×	saturated
1×	saturated

Calls

Call 1

Inputs
(* 1000000 (- x x))

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

Call 2

Inputs
(* 1000000 (- x x))
(* 1000000 (- (neg x) (neg x)))
(neg (* 1000000 (- (neg x) (neg x))))

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

Symmetry

(abs x)

(negabs x)

explain41.0ms (3.9%)

Memory

17.5MiB live, 99.5MiB allocated

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

17.0ms

512×

valid

Compiler

Compiled 36 to 20 computations (44.4% saved)

Precisions

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

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

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

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

exact: 0.0ms (0% of total)

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

eval0.0ms (0%)

Memory: 0.4MiB live, 0.4MiB allocated
Compiler: Compiled 1 to 1 computations (0% saved)

prune1.0ms (0%)

Memory

1.5MiB live, 1.5MiB allocated

Alt Table

Click to see full alt table

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

simplify4.0ms (0.4%)

Memory

8.7MiB live, 8.7MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	192	(-.f64 x x)
✓	cost-diff	320	(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Rules

8×	`+-lowering-+.f64`
8×	`+-lowering-+.f32`
8×	`sub-neg`
6×	`--lowering--.f32`
6×	`--lowering--.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	4
1	8	4
2	11	4
3	13	4
4	15	4
5	17	4
6	21	4
7	26	4
0	26	4

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(* 1000000 (- x x))
1000000
(- x x)
x

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

localize14.0ms (1.4%)

Memory

-33.4MiB live, 45.0MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(-.f64 x x)
✓	accuracy	100.0%	(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Samples

8.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

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

ival-sub: 1.0ms (28.5% of total)

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

exact: 0.0ms (0% of total)

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

series0.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated

Counts

2 → 24

Calls

Call 1

Inputs
#<alt (* 1000000 (- x x))>
#<alt (- x x)>

Outputs
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>

Calls

6 calls:

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

rewrite35.0ms (3.4%)

Memory

-9.5MiB live, 80.6MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

28×	`+-lowering-+.f64`
28×	`-lowering-.f32`
28×	`-lowering-.f64`
28×	`+-lowering-+.f32`
28×	`accelerator-lowering-fma.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	2
1	18	2
0	82	2

Stop Event

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

Counts

2 → 2

Calls

Call 1

Inputs
(* 1000000 (- x x))
(- x x)

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

simplify4.0ms (0.4%)

Memory

5.3MiB live, 5.3MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	24
0	1	24

Stop Event

1×	saturated
1×	saturated

Counts

24 → 24

Calls

Call 1

Inputs
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

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

eval2.0ms (0.2%)

Memory: 2.7MiB live, 2.7MiB allocated
Compiler: Compiled 53 to 4 computations (92.5% saved)

prune1.0ms (0.1%)

Memory

1.2MiB live, 1.2MiB allocated

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	25	1	26
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	26	1	27

Accuracy

100.0%

Counts

27 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(literal 0 binary64)

Compiler

Compiled 2 to 2 computations (0% saved)

simplify3.0ms (0.3%)

Memory

5.4MiB live, 5.4MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1
0	1	1

Stop Event

1×	saturated
1×	saturated

Calls

Call 1

Inputs
0

Outputs
0
#s(literal 0 binary64)

localize6.0ms (0.6%)

Memory

7.0MiB live, 7.0MiB allocated

Samples

3.0ms

256×

valid

Compiler

Compiled 3 to 4 computations (-33.3% saved)

Precisions

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

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

exact: 0.0ms (0% of total)

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

series0.0ms (0%)

Memory

0.0MiB live, 0.0MiB allocated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

rewrite8.0ms (0.7%)

Memory

14.4MiB live, 14.4MiB allocated

Algorithm

1×	batch-egg-rewrite

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0
0	0	0

Stop Event

1×	saturated
1×	saturated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

simplify113.0ms (10.8%)

Memory

-29.2MiB live, 9.9MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0
0	0	0

Stop Event

1×	saturated
1×	saturated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

eval0.0ms (0%)

Memory: 0.5MiB live, 0.5MiB allocated
Compiler: Compiled 1 to 1 computations (0% saved)

prune1.0ms (0.1%)

Memory

2.8MiB live, 2.8MiB allocated

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes4.0ms (0.4%)

Memory

10.2MiB live, 10.2MiB allocated

Accuracy

Total 0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

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

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

Compiler

Compiled 12 to 7 computations (41.7% saved)

simplify7.0ms (0.6%)

Memory

14.8MiB live, 14.8MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1

Stop Event

1×

saturated

Calls

Call 1

Inputs
#s(literal 0 binary64)

Outputs
#s(literal 0 binary64)

soundness21.0ms (2%)

Memory

-34.2MiB live, 44.5MiB allocated

Rules

28×	`+-lowering-+.f64`
28×	`-lowering-.f32`
28×	`-lowering-.f64`
28×	`+-lowering-+.f32`
28×	`accelerator-lowering-fma.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	2
1	18	2
0	82	2

Stop Event

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

Compiler

Compiled 4 to 4 computations (0% saved)

preprocess34.0ms (3.3%)

Memory

32.1MiB live, 112.8MiB allocated

Remove

(negabs x)

(abs x)

Compiler

Compiled 28 to 24 computations (14.3% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze0.0ms (0%)

sample736.0ms (70.1%)

preprocess15.0ms (1.4%)

explain41.0ms (3.9%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify4.0ms (0.4%)

localize14.0ms (1.4%)

series0.0ms (0%)

rewrite35.0ms (3.4%)

simplify4.0ms (0.4%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

simplify3.0ms (0.3%)

localize6.0ms (0.6%)

series0.0ms (0%)

rewrite8.0ms (0.7%)

simplify113.0ms (10.8%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes4.0ms (0.4%)

simplify7.0ms (0.6%)

soundness21.0ms (2%)

preprocess34.0ms (3.3%)

end0.0ms (0%)

Profiling