(file, tickIndex)
| 224 | } |
| 225 | |
| 226 | addStack(file, tickIndex) { |
| 227 | this.tree.ticks++; |
| 228 | |
| 229 | let stack = file.ticks[tickIndex].s; |
| 230 | let i; |
| 231 | for (i = 0; i < stack.length; i += 2) { |
| 232 | let codeId = stack[i]; |
| 233 | if (codeId < 0) return; |
| 234 | let code = file.code[codeId]; |
| 235 | if (code.type !== "CPP" && code.type !== "SHARED_LIB") { |
| 236 | i -= 2; |
| 237 | break; |
| 238 | } |
| 239 | } |
| 240 | if (i < 0 || i >= stack.length) return; |
| 241 | addOrUpdateChildNode(this.tree, file, tickIndex, i, false); |
| 242 | } |
| 243 | } |
| 244 | |
| 245 | class PlainCallTreeProcessor { |
nothing calls this directly
no test coverage detected