(prevBiggest, d)
| 17 | |
| 18 | # Recursively search for the drawcall with the most vertices |
| 19 | def biggestDraw(prevBiggest, d): |
| 20 | ret = prevBiggest |
| 21 | if ret == None or d.numIndices > ret.numIndices: |
| 22 | ret = d |
| 23 | |
| 24 | for c in d.children: |
| 25 | biggest = biggestDraw(ret, c) |
| 26 | |
| 27 | if biggest.numIndices > ret.numIndices: |
| 28 | ret = biggest |
| 29 | |
| 30 | return ret |
| 31 | |
| 32 | # Unpack a tuple of the given format, from the data |
| 33 | def unpackData(fmt, data): |