blob: 02316416097992c4c05057119251ff4ec10ee5da (
plain)
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
|
// Copyright (C) 2016 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR LGPL-3.0-only OR GPL-2.0-only OR GPL-3.0-only
#include "qv4memberdata_p.h"
#include <private/qv4mm_p.h>
#include "qv4value_p.h"
using namespace QV4;
DEFINE_MANAGED_VTABLE(MemberData);
static size_t nextPowerOfTwo(size_t s)
{
--s;
s |= s >> 1;
s |= s >> 2;
s |= s >> 4;
s |= s >> 8;
s |= s >> 16;
#if (QT_POINTER_SIZE == 8)
s |= s >> 32;
#endif
++s;
return s;
}
Heap::MemberData *MemberData::allocate(ExecutionEngine *e, uint n, Heap::MemberData *old)
{
Q_ASSERT(!old || old->values.size <= n);
if (!n)
n = 4;
size_t alloc = MemoryManager::align(sizeof(Heap::MemberData) + (n - 1)*sizeof(Value));
// round up to next power of two to avoid quadratic behaviour for very large objects
alloc = nextPowerOfTwo(alloc);
// The above code can overflow in a number of interesting ways. All of those are unsigned,
// and therefore defined behavior. Still, apply some sane bounds.
const size_t intMax = std::numeric_limits<int>::max();
if (alloc > intMax)
alloc = intMax;
Heap::MemberData *m;
if (old) {
const size_t oldSize = sizeof(Heap::MemberData) + (old->values.size - 1) * sizeof(Value);
if (oldSize > alloc)
alloc = oldSize;
m = e->memoryManager->allocManaged<MemberData>(alloc);
// no write barrier required here, as m gets marked later when member data is set
memcpy(m, old, oldSize);
} else {
m = e->memoryManager->allocManaged<MemberData>(alloc);
m->init();
}
m->values.alloc = static_cast<uint>((alloc - sizeof(Heap::MemberData) + sizeof(Value))/sizeof(Value));
m->values.size = m->values.alloc;
return m;
}
|
