1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
|
/****************************************************************************
**
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the QtQml module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qv4function_p.h"
#include "qv4managed_p.h"
#include "qv4string_p.h"
#include "qv4value_p.h"
#include "qv4engine_p.h"
#include "qv4lookup_p.h"
QT_BEGIN_NAMESPACE
using namespace QV4;
Function::Function(ExecutionEngine *engine, CompiledData::CompilationUnit *unit, const CompiledData::Function *function,
ReturnedValue (*codePtr)(ExecutionContext *, const uchar *), quint32 _codeSize)
: compiledFunction(function)
, compilationUnit(unit)
, code(codePtr)
, codeData(0)
, codeSize(_codeSize)
{
Q_UNUSED(engine);
name = compilationUnit->runtimeStrings[compiledFunction->nameIndex].asString();
nArguments = compiledFunction->nFormals;
internalClass = engine->emptyClass;
const quint32 *formalsIndices = compiledFunction->formalsTable();
// iterate backwards, so we get the right ordering for duplicate names
for (int i = static_cast<int>(compiledFunction->nFormals - 1); i >= 0; --i) {
String *arg = compilationUnit->runtimeStrings[formalsIndices[i]].asString();
while (1) {
InternalClass *newClass = internalClass->addMember(arg, Attr_NotConfigurable);
if (newClass != internalClass) {
internalClass = newClass;
break;
}
// duplicate arguments, need some trick to store them
arg = new (engine->memoryManager) String(engine, arg, engine->newString(QString(0xfffe))->getPointer());
}
}
const quint32 *localsIndices = compiledFunction->localsTable();
for (quint32 i = 0; i < compiledFunction->nLocals; ++i) {
String *local = compilationUnit->runtimeStrings[localsIndices[i]].asString();
internalClass = internalClass->addMember(local, Attr_NotConfigurable);
}
}
Function::~Function()
{
}
void Function::mark(ExecutionEngine *e)
{
name.mark(e);
}
namespace QV4 {
template <int field, typename SearchType>
struct LineNumberMappingHelper
{
const quint32 *table;
int lowerBound(int begin, int end, SearchType value) {
int middle;
int n = int(end - begin);
int half;
while (n > 0) {
half = n >> 1;
middle = begin + half;
if (table[middle * 2 + field] < static_cast<quint32>(value)) {
begin = middle + 1;
n -= half + 1;
} else {
n = half;
}
}
return begin;
}
int upperBound(int begin, int end, SearchType value) {
int middle;
int n = int(end - begin);
int half;
while (n > 0) {
half = n >> 1;
middle = begin + half;
if (value < table[middle * 2 + field]) {
n = half;
} else {
begin = middle + 1;
n -= half + 1;
}
}
return begin;
}
};
}
int Function::lineNumberForProgramCounter(qptrdiff offset) const
{
// Access the first field, the program counter
LineNumberMappingHelper<0, qptrdiff> helper;
helper.table = compiledFunction->lineNumberMapping();
const uint count = compiledFunction->nLineNumberMappingEntries;
int pos = helper.lowerBound(0, count, offset);
if (pos != 0 && count > 0)
--pos;
if (static_cast<uint>(pos) == count)
return -1;
return helper.table[pos * 2 + 1];
}
QList<qptrdiff> Function::programCountersForAllLines() const
{
// Only store 1 breakpoint per line...
QHash<quint32, qptrdiff> offsetsPerLine;
const quint32 *mapping = compiledFunction->lineNumberMapping();
// ... and make it the first instruction by walking backwards over the line mapping table
// and inserting all entries keyed on line.
for (quint32 i = compiledFunction->nLineNumberMappingEntries; i > 0; ) {
--i; // the loop is written this way, because starting at endIndex-1 and checking for i>=0 will never end: i>=0 is always true for unsigned.
quint32 offset = mapping[i * 2];
quint32 line = mapping[i * 2 + 1];
offsetsPerLine.insert(line, offset);
}
return offsetsPerLine.values();
}
QT_END_NAMESPACE
|
