Metrics for Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1

start0.0ms (0.0%)

analyze0.0ms (0.1%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0.0%	0.0%	99.9%	0.1%	0.0%	0.0%	0.0%	0
100.0%	99.9%	0.0%	0.1%	0.0%	0.0%	0.0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample215.0ms (33.4%)

Samples

149.0ms

8 256×

valid

Precisions

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

Mul: 3.0ms (58.9% of total, 0.0 MiB)

Sub: 2.0ms (39.3% of total, 0.0 MiB)

Bogosity

preprocess18.0ms (2.8%)

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	32
1	65	31
2	166	31
3	303	31
4	783	31

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 x (*.f64 y y))

Symmetry

(abs y)

Compiler

Compiled 2 to 8 computations (-300.0% saved)

sample0.0ms (0.0%)

Calls

Call 1

Inputs

Outputs

series8.0ms (1.2%)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	32	102

Stop Event

1×	iter-limit

Counts

4 → 10

Calls

Call 1

Inputs
%2 = (*.f64 y y) x y %2 (-.f64 x %2)

Outputs
%5 = (* y y) %6 = (- x %5) %9 = (pow.f64 y #s(literal 2 binary64)) %10 = (.f64 #s(literal -1 binary64) %9) %15 = (/.f64 %9 x) (approx x #s(literal 0 binary64)) (approx x x) (approx %6 %10) (approx %6 (-.f64 x %9)) (approx %6 (.f64 x (+.f64 #s(literal 1 binary64) (.f64 #s(literal -1 binary64) %15)))) (approx %6 (.f64 #s(literal -1 binary64) (.f64 x (-.f64 %15 #s(literal 1 binary64))))) (approx y y) (approx %5 %9) (approx %6 (+.f64 x %10)) (approx %6 (.f64 %9 (-.f64 (/.f64 x %9) #s(literal 1 binary64))))

Outputs

%5 = (* y y)
%6 = (- x %5)
%9 = (pow.f64 y #s(literal 2 binary64))
%10 = (*.f64 #s(literal -1 binary64) %9)
%15 = (/.f64 %9 x)
(approx x #s(literal 0 binary64))
(approx x x)
(approx %6 %10)
(approx %6 (-.f64 x %9))
(approx %6 (*.f64 x (+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1 binary64) %15))))
(approx %6 (*.f64 #s(literal -1 binary64) (*.f64 x (-.f64 %15 #s(literal 1 binary64)))))
(approx y y)
(approx %5 %9)
(approx %6 (+.f64 x %10))
(approx %6 (*.f64 %9 (-.f64 (/.f64 x %9) #s(literal 1 binary64))))

Calls

6 calls:

Time	Variable	Point
1.0ms	y	inf
1.0ms	x	-inf
1.0ms	x	inf
1.0ms	y	-inf
0.0ms	y	0

rewrite99.0ms (15.4%)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	23	10
2	67	10
3	157	10
4	462	10
5	3128	10
0	4080	10
0	4484	10

Stop Event

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

Counts

4 → 55

Calls

Call 1

Inputs
%2 = (*.f64 y y) x y %2 (-.f64 x %2)

Outputs
%2 = (.f64 y y) %3 = (.f64 %2 %2) %5 = (pow.f64 %3 #s(literal -1/2 binary64)) %7 = (fabs.f64 y) %8 = (sqrt.f64 %7) %9 = (.f64 %8 %7) %10 = (sqrt.f64 %8) %14 = (neg.f64 %8) %15 = (.f64 %14 %7) %21 = (neg.f64 %7) %24 = (neg.f64 y) %29 = (pow.f64 y #s(literal 8 binary64)) %61 = (.f64 %24 y) %70 = (-.f64 x %2) x y (.f64 %5 %3) (.f64 (.f64 %9 %10) %10) (.f64 %9 %8) (.f64 %15 %14) (.f64 %14 %15) (.f64 %10 (.f64 %10 %9)) (.f64 %8 %9) (.f64 %21 %21) (.f64 %7 %7) (.f64 %24 %24) (.f64 #s(literal 1 binary64) %2) %2 (pow.f64 %29 #s(literal 1/4 binary64)) (pow.f64 %3 #s(literal 1/2 binary64)) (pow.f64 %8 #s(literal 4 binary64)) (pow.f64 %21 #s(literal 2 binary64)) (pow.f64 %7 #s(literal 2 binary64)) (pow.f64 %24 #s(literal 2 binary64)) (pow.f64 %2 #s(literal 1 binary64)) (pow.f64 y #s(literal 2 binary64)) (/.f64 #s(literal 1 binary64) (pow.f64 %29 #s(literal -1/4 binary64))) (/.f64 #s(literal 1 binary64) %5) (/.f64 #s(literal 1 binary64) (pow.f64 %8 #s(literal -4 binary64))) (/.f64 #s(literal 1 binary64) (pow.f64 %21 #s(literal -2 binary64))) (/.f64 #s(literal 1 binary64) (pow.f64 %7 #s(literal -2 binary64))) (/.f64 #s(literal 1 binary64) (pow.f64 %24 #s(literal -2 binary64))) (/.f64 #s(literal 1 binary64) (pow.f64 %2 #s(literal -1 binary64))) (/.f64 #s(literal 1 binary64) (pow.f64 y #s(literal -2 binary64))) (neg.f64 %61) (sqrt.f64 %3) (fabs.f64 (.f64 %21 y)) (fabs.f64 (.f64 %7 y)) (fabs.f64 %61) (fabs.f64 %2) (.f64 #s(literal 1 binary64) %70) (pow.f64 %70 #s(literal 1 binary64)) (/.f64 #s(literal 1 binary64) (pow.f64 %70 #s(literal -1 binary64))) (neg.f64 (-.f64 %2 x)) (fma.f64 (.f64 %15 %10) %10 x) (fma.f64 %9 %14 x) (fma.f64 %15 %8 x) (fma.f64 %14 %9 x) (fma.f64 %10 (*.f64 %10 %15) x) (fma.f64 %8 %15 x) (fma.f64 %21 %7 x) (fma.f64 %7 %21 x) (fma.f64 %24 y x) (fma.f64 #s(literal 1 binary64) %61 x) (fma.f64 y %24 x) (-.f64 %61 (neg.f64 x)) %70 (+.f64 %61 x) (+.f64 x %61)

Outputs

%2 = (*.f64 y y)
%3 = (*.f64 %2 %2)
%5 = (pow.f64 %3 #s(literal -1/2 binary64))
%7 = (fabs.f64 y)
%8 = (sqrt.f64 %7)
%9 = (*.f64 %8 %7)
%10 = (sqrt.f64 %8)
%14 = (neg.f64 %8)
%15 = (*.f64 %14 %7)
%21 = (neg.f64 %7)
%24 = (neg.f64 y)
%29 = (pow.f64 y #s(literal 8 binary64))
%61 = (*.f64 %24 y)
%70 = (-.f64 x %2)
x
y
(*.f64 %5 %3)
(*.f64 (*.f64 %9 %10) %10)
(*.f64 %9 %8)
(*.f64 %15 %14)
(*.f64 %14 %15)
(*.f64 %10 (*.f64 %10 %9))
(*.f64 %8 %9)
(*.f64 %21 %21)
(*.f64 %7 %7)
(*.f64 %24 %24)
(*.f64 #s(literal 1 binary64) %2)
%2
(pow.f64 %29 #s(literal 1/4 binary64))
(pow.f64 %3 #s(literal 1/2 binary64))
(pow.f64 %8 #s(literal 4 binary64))
(pow.f64 %21 #s(literal 2 binary64))
(pow.f64 %7 #s(literal 2 binary64))
(pow.f64 %24 #s(literal 2 binary64))
(pow.f64 %2 #s(literal 1 binary64))
(pow.f64 y #s(literal 2 binary64))
(/.f64 #s(literal 1 binary64) (pow.f64 %29 #s(literal -1/4 binary64)))
(/.f64 #s(literal 1 binary64) %5)
(/.f64 #s(literal 1 binary64) (pow.f64 %8 #s(literal -4 binary64)))
(/.f64 #s(literal 1 binary64) (pow.f64 %21 #s(literal -2 binary64)))
(/.f64 #s(literal 1 binary64) (pow.f64 %7 #s(literal -2 binary64)))
(/.f64 #s(literal 1 binary64) (pow.f64 %24 #s(literal -2 binary64)))
(/.f64 #s(literal 1 binary64) (pow.f64 %2 #s(literal -1 binary64)))
(/.f64 #s(literal 1 binary64) (pow.f64 y #s(literal -2 binary64)))
(neg.f64 %61)
(sqrt.f64 %3)
(fabs.f64 (*.f64 %21 y))
(fabs.f64 (*.f64 %7 y))
(fabs.f64 %61)
(fabs.f64 %2)
(*.f64 #s(literal 1 binary64) %70)
(pow.f64 %70 #s(literal 1 binary64))
(/.f64 #s(literal 1 binary64) (pow.f64 %70 #s(literal -1 binary64)))
(neg.f64 (-.f64 %2 x))
(fma.f64 (*.f64 %15 %10) %10 x)
(fma.f64 %9 %14 x)
(fma.f64 %15 %8 x)
(fma.f64 %14 %9 x)
(fma.f64 %10 (*.f64 %10 %15) x)
(fma.f64 %8 %15 x)
(fma.f64 %21 %7 x)
(fma.f64 %7 %21 x)
(fma.f64 %24 y x)
(fma.f64 #s(literal 1 binary64) %61 x)
(fma.f64 y %24 x)
(-.f64 %61 (neg.f64 x))
%70
(+.f64 %61 x)
(+.f64 x %61)

reconstruct6.0ms (1.0%)

Counts: 65 → 23
Compiler: Compiled 65 to 108 computations (-66.2% saved)

eval2.0ms (0.3%)

Compiler: Compiled 20 to 68 computations (-240.0% saved)

prune1.0ms (0.1%)

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	19	1	20
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	19	2	21

Accuracy

100.0%

Counts

21 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 y (neg.f64 y) x)
✓	100.0%	(-.f64 x (*.f64 y y))

Compiler

Compiled 2 to 6 computations (-200.0% saved)

sample0.0ms (0.0%)

Calls

Call 1

Inputs

Outputs

series5.0ms (0.8%)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	32	90

Stop Event

1×	iter-limit

Counts

4 → 9

Calls

Call 1

Inputs
%2 = (neg.f64 y) x y %2 (fma.f64 y %2 x)

Outputs
%5 = (neg y) %7 = (+ (* y %5) x) %10 = (pow.f64 y #s(literal 2 binary64)) %11 = (.f64 #s(literal -1 binary64) %10) %16 = (/.f64 %10 x) (approx x #s(literal 0 binary64)) (approx x x) (approx %7 %11) (approx %7 (+.f64 x %11)) (approx %7 (.f64 x (+.f64 #s(literal 1 binary64) (.f64 #s(literal -1 binary64) %16)))) (approx %7 (.f64 #s(literal -1 binary64) (.f64 x (-.f64 %16 #s(literal 1 binary64))))) (approx y y) (approx %5 (.f64 #s(literal -1 binary64) y)) (approx %7 (*.f64 %10 (-.f64 (/.f64 x %10) #s(literal 1 binary64))))

Outputs

%5 = (neg y)
%7 = (+ (* y %5) x)
%10 = (pow.f64 y #s(literal 2 binary64))
%11 = (*.f64 #s(literal -1 binary64) %10)
%16 = (/.f64 %10 x)
(approx x #s(literal 0 binary64))
(approx x x)
(approx %7 %11)
(approx %7 (+.f64 x %11))
(approx %7 (*.f64 x (+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1 binary64) %16))))
(approx %7 (*.f64 #s(literal -1 binary64) (*.f64 x (-.f64 %16 #s(literal 1 binary64)))))
(approx y y)
(approx %5 (*.f64 #s(literal -1 binary64) y))
(approx %7 (*.f64 %10 (-.f64 (/.f64 x %10) #s(literal 1 binary64))))

Calls

6 calls:

Time	Variable	Point
1.0ms	y	inf
1.0ms	x	-inf
1.0ms	y	-inf
1.0ms	x	inf
0.0ms	y	0

rewrite115.0ms (17.9%)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	9
0	7	9
1	19	9
2	44	9
3	118	9
4	284	9
5	1459	9
0	4338	9
0	4508	9

Stop Event

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

Counts

4 → 21

Calls

Call 1

Inputs
%2 = (neg.f64 y) x y %2 (fma.f64 y %2 x)

Outputs
%3 = (neg.f64 y) %9 = (.f64 y y) %10 = (-.f64 x %9) %17 = (fabs.f64 y) %18 = (neg.f64 %17) %19 = (sqrt.f64 %17) %26 = (.f64 %3 y) x y (.f64 #s(literal 1 binary64) %3) (pow.f64 %3 #s(literal 1 binary64)) (/.f64 #s(literal 1 binary64) (pow.f64 %3 #s(literal -1 binary64))) %3 (.f64 #s(literal 1 binary64) %10) (pow.f64 %10 #s(literal 1 binary64)) (/.f64 #s(literal 1 binary64) (pow.f64 %10 #s(literal -1 binary64))) (neg.f64 (-.f64 %9 x)) (fma.f64 (.f64 %18 %19) %19 x) (fma.f64 %19 (.f64 %19 %18) x) (fma.f64 %18 %17 x) (fma.f64 %17 %18 x) (fma.f64 #s(literal 1 binary64) %26 x) (fma.f64 %3 y x) (fma.f64 y %3 x) (-.f64 %26 (neg.f64 x)) %10 (+.f64 %26 x) (+.f64 x %26)

Outputs

%3 = (neg.f64 y)
%9 = (*.f64 y y)
%10 = (-.f64 x %9)
%17 = (fabs.f64 y)
%18 = (neg.f64 %17)
%19 = (sqrt.f64 %17)
%26 = (*.f64 %3 y)
x
y
(*.f64 #s(literal 1 binary64) %3)
(pow.f64 %3 #s(literal 1 binary64))
(/.f64 #s(literal 1 binary64) (pow.f64 %3 #s(literal -1 binary64)))
%3
(*.f64 #s(literal 1 binary64) %10)
(pow.f64 %10 #s(literal 1 binary64))
(/.f64 #s(literal 1 binary64) (pow.f64 %10 #s(literal -1 binary64)))
(neg.f64 (-.f64 %9 x))
(fma.f64 (*.f64 %18 %19) %19 x)
(fma.f64 %19 (*.f64 %19 %18) x)
(fma.f64 %18 %17 x)
(fma.f64 %17 %18 x)
(fma.f64 #s(literal 1 binary64) %26 x)
(fma.f64 %3 y x)
(fma.f64 y %3 x)
(-.f64 %26 (neg.f64 x))
%10
(+.f64 %26 x)
(+.f64 x %26)

reconstruct2.0ms (0.3%)

Counts: 30 → 12
Compiler: Compiled 30 to 50 computations (-66.7% saved)

eval1.0ms (0.2%)

Compiler: Compiled 9 to 30 computations (-233.3% saved)

prune1.0ms (0.1%)

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	9	0	9
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	9	2	11

Accuracy

100.0%

Counts

11 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 y (neg.f64 y) x)
✓	100.0%	(-.f64 x (*.f64 y y))

Compiler

Compiled 2 to 6 computations (-200.0% saved)

regimes7.0ms (1.1%)

Accuracy

Total 0.0b remaining (0.0%)

Threshold costs 0.0b (0.0%)

0.0b	0%
0.0b	0%

Counts

1 → 1

2 → 1

Calls

Call 1

Inputs
(-.f64 x (*.f64 y y))

Outputs
(-.f64 x (*.f64 y y))

Call 2

Inputs
(-.f64 x (*.f64 y y)) (fma.f64 y (neg.f64 y) x)

Outputs
(fma.f64 y (neg.f64 y) x)

Calls

4 calls:

5.0ms	y
2.0ms	x
2.0ms	(-.f64 x (*.f64 y y))
1.0ms	(*.f64 y y)

Results

Accuracy	Segments	Branch
100.0%	1	y
100.0%	1	x
100.0%	1	(-.f64 x (*.f64 y y))
100.0%	1	(*.f64 y y)

Compiler

Compiled 6 to 10 computations (-66.7% saved)

bsearch0.0ms (0.0%)

derivations19.0ms (3.0%)

Stop Event

1×

done

Compiler

Compiled 2 to 6 computations (-200.0% saved)

preprocess9.0ms (1.4%)

Compiler: Compiled 7 to 26 computations (-271.4% saved)

end0.0ms (0.0%)

gc134ms (20.9%)

Allocations

Allocated	Percent	Phase
263.7 MiB	56.6%	`sample`
113.4 MiB	24.3%	`rewrite`
27.1 MiB	5.8%	`preprocess`
18.0 MiB	3.9%	`series`
15.1 MiB	3.2%	`derivations`
11.1 MiB	2.4%	`regimes`
9.1 MiB	2.0%	`reconstruct`
5.2 MiB	1.1%	`eval`
2.6 MiB	0.6%	`prune`
0.3 MiB	0.1%	`analyze`
0.0 MiB	0.0%	`start`
0.0 MiB	0.0%	`bsearch`
0.0 MiB	0.0%	`end`
465.8 MiB	100.0%	`total`

start0.0ms (0.0%)

analyze0.0ms (0.1%)

sample215.0ms (33.4%)

preprocess18.0ms (2.8%)

sample0.0ms (0.0%)

series8.0ms (1.2%)

rewrite99.0ms (15.4%)

reconstruct6.0ms (1.0%)

eval2.0ms (0.3%)

prune1.0ms (0.1%)

sample0.0ms (0.0%)

series5.0ms (0.8%)

rewrite115.0ms (17.9%)

reconstruct2.0ms (0.3%)

eval1.0ms (0.2%)

prune1.0ms (0.1%)

regimes7.0ms (1.1%)

bsearch0.0ms (0.0%)

bsearch0.0ms (0.0%)

derivations19.0ms (3.0%)

preprocess9.0ms (1.4%)

end0.0ms (0.0%)

gc134ms (20.9%)

Profiling