While the name may suggest that the blah variable is a very performance
critical piece of the stack traversal algorithm, it turns out to be of little
relevance :)
Change-Id: Ia12eaf5f169a6eae64f005364da7452e1ef86daf
Reviewed-by: Lars Knoll <lars.knoll@digia.com>
}
qSort(heapChunkBoundaries, heapChunkBoundariesEnd);
- int blah = 0;
- for (; current < top; ++current, ++blah) {
+ for (; current < top; ++current) {
Object* possibleObject = current->asObject();
if (!possibleObject)
continue;