| 127 | size_t mSize; // i.e. capacity. |
| 128 | |
| 129 | DbgStack() |
| 130 | { |
| 131 | // We don't want to set the following too low since the stack would need to be reallocated, |
| 132 | // but also don't want to set it too high since the average script mightn't recurse deeply; |
| 133 | // if the stack size never approaches its maximum, there'll be wasted memory: |
| 134 | mSize = 128; |
| 135 | mBottom = (Entry *)malloc(mSize * sizeof(Entry)); |
| 136 | mTop = mBottom - 1; // ++mTop will be the first entry. |
| 137 | mTopBound = mTop + mSize; // Topmost valid position. |
| 138 | } |
| 139 | |
| 140 | int Depth() |
| 141 | { |
nothing calls this directly
no outgoing calls
no test coverage detected