diff options
| author | Erik Verbruggen <erik.verbruggen@digia.com> | 2015-12-23 14:08:48 +0100 |
|---|---|---|
| committer | Erik Verbruggen <erik.verbruggen@theqtcompany.com> | 2016-01-06 09:25:34 +0000 |
| commit | 7ffb275c5756ef60187a0d7aec4dcb949ee89fd1 (patch) | |
| tree | 37d319a5d3d12adcd9f0eb5739d3037e05b3208c /src/qml/compiler/qv4ssa.cpp | |
| parent | 49f9797d2a2aab245a9866bc4563812a6e8c02e1 (diff) | |
V4: Replace QVector with (Q)VarLengthArray in BasicBlock.
This prevents extra mallocs in nearly all cases, because the number of
incoming edges is not that big. The outgoing edge count has a maximum of
two.
Change-Id: I89195809952ce6087c5af51d717a4c2d8ac6b853
Reviewed-by: Lars Knoll <lars.knoll@theqtcompany.com>
Diffstat (limited to 'src/qml/compiler/qv4ssa.cpp')
| -rw-r--r-- | src/qml/compiler/qv4ssa.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/qml/compiler/qv4ssa.cpp b/src/qml/compiler/qv4ssa.cpp index 89101ad756..f20dbbf4fe 100644 --- a/src/qml/compiler/qv4ssa.cpp +++ b/src/qml/compiler/qv4ssa.cpp @@ -477,7 +477,7 @@ class DominatorTree d->vertex[d->N] = n; d->parent[n] = todo.parent; ++d->N; - const QVector<BasicBlock *> &out = function->basicBlock(n)->out; + const BasicBlock::OutgoingEdges &out = function->basicBlock(n)->out; for (int i = out.size() - 1; i > 0; --i) worklist.push_back(DFSTodo(out[i]->index(), n)); |