Hi,
It's slightly unclear to me what the L/S cycles reported refer to. Since malioc is not taking into account memory-latency, etc.. are those cycles just related with the number of instructions issued to fetch attribute data and store the pre-interpolated varying results?
e.g.
A LS T Bound Total instruction cycles: 20.60 35.00 0.00 LS Shortest path cycles: 16.60 29.00 0.00 LS Longest path cycles: N/A N/A N/A N/A
Cheers
Thanks for the clarification Pete! So, for the Midgard case this metric combines a mix of vertex and fragment stage cost: a "fixed" cost for the 3 vertices (in case of a triangle) and a variable cost (coverage-dependent) for the fragment side, correct?