(prevBiggest, d)
| 9 | |
| 10 | # Recursively search for the drawcall with the most vertices |
| 11 | def biggestDraw(prevBiggest, d): |
| 12 | ret = prevBiggest |
| 13 | if ret == None or d.numIndices > ret.numIndices: |
| 14 | ret = d |
| 15 | |
| 16 | for c in d.children: |
| 17 | biggest = biggestDraw(ret, c) |
| 18 | |
| 19 | if biggest.numIndices > ret.numIndices: |
| 20 | ret = biggest |
| 21 | |
| 22 | return ret |
| 23 | |
| 24 | def sampleCode(controller): |
| 25 | # Find the biggest drawcall in the whole capture |