preprocess165.0ms (7.6%)

Memory

-31.4MiB live, 166.1MiB allocated

Algorithm

2×	egg-herbie

Rules

772×	accelerator-lowering-fma.f32
772×	accelerator-lowering-fma.f64
486×	distribute-lft-in
484×	*-lowering-*.f32
484×	*-lowering-*.f64

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	26	68
1	74	66
2	252	66
3	834	66
4	1897	66
5	2840	66
6	3217	66
7	3545	66
8	3570	66
9	3570	66
10	3570	66
11	3602	66
12	3608	66
13	3608	66
0	10	11
1	22	11
2	50	11
3	116	11
4	212	11
5	349	11
6	514	11
7	763	11
8	1093	11
9	1364	11
10	1402	11
11	1424	11
12	1426	11
13	1426	11
0	1426	11

Stop Event

1×	iter limit
1×	saturated
1×	saturated

Calls

Call 1

Inputs
(* (* 1/2 (sin re)) (- (exp (neg im)) (exp im)))

Outputs
(* (* 1/2 (sin re)) (- (exp (neg im)) (exp im)))
(fma.f64 #s(literal 1/2 binary64) (fma.f64 (sin.f64 re) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)) #s(literal 0 binary64)) #s(literal 0 binary64))

Call 2

Inputs
(* (* 1/2 (sin re)) (- (exp (neg im)) (exp im)))
(* (* 1/2 (sin (neg re))) (- (exp (neg im)) (exp im)))
(* (* 1/2 (sin re)) (- (exp (neg (neg im))) (exp (neg im))))
(neg (* (* 1/2 (sin (neg re))) (- (exp (neg im)) (exp im))))
(neg (* (* 1/2 (sin re)) (- (exp (neg (neg im))) (exp (neg im)))))
(* (* 1/2 (sin im)) (- (exp (neg re)) (exp re)))

Outputs
(* (* 1/2 (sin re)) (- (exp (neg im)) (exp im)))
(* (* 1/2 (sin (neg re))) (- (exp (neg im)) (exp im)))
(* (* 1/2 (sin re)) (- (exp im) (exp (neg im))))
(* (* 1/2 (sin re)) (- (exp (neg (neg im))) (exp (neg im))))
(* (* 1/2 (sin re)) (- (exp im) (exp (neg im))))
(neg (* (* 1/2 (sin (neg re))) (- (exp (neg im)) (exp im))))
(* (* 1/2 (sin re)) (- (exp (neg im)) (exp im)))
(neg (* (* 1/2 (sin re)) (- (exp (neg (neg im))) (exp (neg im)))))
(* (* 1/2 (sin re)) (- (exp (neg im)) (exp im)))
(* (* 1/2 (sin im)) (- (exp (neg re)) (exp re)))

Symmetry

(negabs re)

(negabs im)