aboutsummaryrefslogtreecommitdiffstats
path: root/ArrayUtils.cpp
blob: f0d7d6a8122f9935c2095011cfa1069258bb5bc9 (plain) (blame)
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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
/*
    This file is part of cpp-ethereum.

    cpp-ethereum is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    cpp-ethereum is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with cpp-ethereum.  If not, see <http://www.gnu.org/licenses/>.
*/
/**
 * @author Christian <c@ethdev.com>
 * @date 2015
 * Code generation utils that handle arrays.
 */

#include <libsolidity/ArrayUtils.h>
#include <libevmcore/Instruction.h>
#include <libsolidity/CompilerContext.h>
#include <libsolidity/CompilerUtils.h>
#include <libsolidity/Types.h>
#include <libsolidity/Utils.h>
#include <libsolidity/LValue.h>

using namespace std;
using namespace dev;
using namespace solidity;

void ArrayUtils::copyArrayToStorage(ArrayType const& _targetType, ArrayType const& _sourceType) const
{
    // stack layout: [source_ref] target_ref (top)
    // need to leave target_ref on the stack at the end
    solAssert(_targetType.getLocation() == ArrayType::Location::Storage, "");
    solAssert(
        _sourceType.getLocation() == ArrayType::Location::CallData ||
            _sourceType.getLocation() == ArrayType::Location::Storage,
        "Given array location not implemented."
    );

    IntegerType uint256(256);
    Type const* targetBaseType = _targetType.isByteArray() ? &uint256 : &(*_targetType.getBaseType());
    Type const* sourceBaseType = _sourceType.isByteArray() ? &uint256 : &(*_sourceType.getBaseType());

    // this copies source to target and also clears target if it was larger

    // TODO unroll loop for small sizes

    // stack: source_ref [source_length] target_ref
    // store target_ref
    for (unsigned i = _sourceType.getSizeOnStack(); i > 0; --i)
        m_context << eth::swapInstruction(i);
    if (_sourceType.getLocation() != ArrayType::Location::CallData || !_sourceType.isDynamicallySized())
        retrieveLength(_sourceType); // otherwise, length is already there
    // stack: target_ref source_ref source_length
    m_context << eth::Instruction::DUP3;
    // stack: target_ref source_ref source_length target_ref
    retrieveLength(_targetType);
    // stack: target_ref source_ref source_length target_ref target_length
    if (_targetType.isDynamicallySized())
        // store new target length
        m_context << eth::Instruction::DUP3 << eth::Instruction::DUP3 << eth::Instruction::SSTORE;
    if (sourceBaseType->getCategory() == Type::Category::Mapping)
    {
        solAssert(targetBaseType->getCategory() == Type::Category::Mapping, "");
        solAssert(_sourceType.getLocation() == ArrayType::Location::Storage, "");
        // nothing to copy
        m_context
            << eth::Instruction::POP << eth::Instruction::POP
            << eth::Instruction::POP << eth::Instruction::POP;
        return;
    }
    // compute hashes (data positions)
    m_context << eth::Instruction::SWAP1;
    if (_targetType.isDynamicallySized())
        CompilerUtils(m_context).computeHashStatic();
    // stack: target_ref source_ref source_length target_length target_data_pos
    m_context << eth::Instruction::SWAP1;
    convertLengthToSize(_targetType);
    m_context << eth::Instruction::DUP2 << eth::Instruction::ADD;
    // stack: target_ref source_ref source_length target_data_pos target_data_end
    m_context << eth::Instruction::SWAP3;
    // stack: target_ref target_data_end source_length target_data_pos source_ref
    // skip copying if source length is zero
    m_context << eth::Instruction::DUP3 << eth::Instruction::ISZERO;
    eth::AssemblyItem copyLoopEnd = m_context.newTag();
    m_context.appendConditionalJumpTo(copyLoopEnd);

    if (_sourceType.getLocation() == ArrayType::Location::Storage && _sourceType.isDynamicallySized())
        CompilerUtils(m_context).computeHashStatic();
    // stack: target_ref target_data_end source_length target_data_pos source_data_pos
    m_context << eth::Instruction::SWAP2;
    convertLengthToSize(_sourceType);
    m_context << eth::Instruction::DUP3 << eth::Instruction::ADD;
    // stack: target_ref target_data_end source_data_pos target_data_pos source_data_end
    eth::AssemblyItem copyLoopStart = m_context.newTag();
    m_context << copyLoopStart;
    // check for loop condition
    m_context
        << eth::Instruction::DUP3 << eth::Instruction::DUP2
        << eth::Instruction::GT << eth::Instruction::ISZERO;
    m_context.appendConditionalJumpTo(copyLoopEnd);
    // stack: target_ref target_data_end source_data_pos target_data_pos source_data_end
    // copy
    if (sourceBaseType->getCategory() == Type::Category::Array)
    {
        m_context << eth::Instruction::DUP3 << eth::Instruction::DUP3;
        copyArrayToStorage(
            dynamic_cast<ArrayType const&>(*targetBaseType),
            dynamic_cast<ArrayType const&>(*sourceBaseType)
        );
        m_context << eth::Instruction::POP;
    }
    else
    {
        m_context << eth::Instruction::DUP3;
        if (_sourceType.getLocation() == ArrayType::Location::Storage)
            StorageItem(m_context, *sourceBaseType).retrieveValue(SourceLocation(), true);
        else if (sourceBaseType->isValueType())
            CompilerUtils(m_context).loadFromMemoryDynamic(*sourceBaseType, true, true, false);
        else
            solAssert(false, "Copying of unknown type requested: " + sourceBaseType->toString());
        m_context << eth::dupInstruction(2 + sourceBaseType->getSizeOnStack());
        StorageItem(m_context, *targetBaseType).storeValue(*sourceBaseType, SourceLocation(), true);
    }
    // increment source
    m_context
        << eth::Instruction::SWAP2
        << (_sourceType.getLocation() == ArrayType::Location::Storage ?
            sourceBaseType->getStorageSize() :
            sourceBaseType->getCalldataEncodedSize())
        << eth::Instruction::ADD
        << eth::Instruction::SWAP2;
    // increment target
    m_context
        << eth::Instruction::SWAP1
        << targetBaseType->getStorageSize()
        << eth::Instruction::ADD
        << eth::Instruction::SWAP1;
    m_context.appendJumpTo(copyLoopStart);
    m_context << copyLoopEnd;

    // zero-out leftovers in target
    // stack: target_ref target_data_end source_data_pos target_data_pos source_data_end
    m_context << eth::Instruction::POP << eth::Instruction::SWAP1 << eth::Instruction::POP;
    // stack: target_ref target_data_end target_data_pos_updated
    clearStorageLoop(*targetBaseType);
    m_context << eth::Instruction::POP;
}

void ArrayUtils::clearArray(ArrayType const& _type) const
{
    solAssert(_type.getLocation() == ArrayType::Location::Storage, "");
    if (_type.isDynamicallySized())
        clearDynamicArray(_type);
    else if (_type.getLength() == 0 || _type.getBaseType()->getCategory() == Type::Category::Mapping)
        m_context << eth::Instruction::POP;
    else if (_type.getLength() < 5) // unroll loop for small arrays @todo choose a good value
    {
        solAssert(!_type.isByteArray(), "");
        for (unsigned i = 1; i < _type.getLength(); ++i)
        {
            StorageItem(m_context, *_type.getBaseType()).setToZero(SourceLocation(), false);
            m_context << u256(_type.getBaseType()->getStorageSize()) << eth::Instruction::ADD;
        }
        StorageItem(m_context, *_type.getBaseType()).setToZero(SourceLocation(), true);
    }
    else
    {
        solAssert(!_type.isByteArray(), "");
        m_context
            << eth::Instruction::DUP1 << u256(_type.getLength())
            << u256(_type.getBaseType()->getStorageSize())
            << eth::Instruction::MUL << eth::Instruction::ADD << eth::Instruction::SWAP1;
        clearStorageLoop(*_type.getBaseType());
        m_context << eth::Instruction::POP;
    }
}

void ArrayUtils::clearDynamicArray(ArrayType const& _type) const
{
    solAssert(_type.getLocation() == ArrayType::Location::Storage, "");
    solAssert(_type.isDynamicallySized(), "");

    // fetch length
    m_context << eth::Instruction::DUP1 << eth::Instruction::SLOAD;
    // set length to zero
    m_context << u256(0) << eth::Instruction::DUP3 << eth::Instruction::SSTORE;
    // stack: ref old_length
    convertLengthToSize(_type);
    // compute data positions
    m_context << eth::Instruction::SWAP1;
    CompilerUtils(m_context).computeHashStatic();
    // stack: len data_pos (len is in slots for byte array and in items for other arrays)
    m_context << eth::Instruction::SWAP1 << eth::Instruction::DUP2 << eth::Instruction::ADD
        << eth::Instruction::SWAP1;
    // stack: data_pos_end data_pos
    if (_type.isByteArray())
        clearStorageLoop(IntegerType(256));
    else
        clearStorageLoop(*_type.getBaseType());
    // cleanup
    m_context << eth::Instruction::POP;
}

void ArrayUtils::resizeDynamicArray(const ArrayType& _type) const
{
    solAssert(_type.getLocation() == ArrayType::Location::Storage, "");
    solAssert(_type.isDynamicallySized(), "");

    eth::AssemblyItem resizeEnd = m_context.newTag();

    // stack: ref new_length
    // fetch old length
    m_context << eth::Instruction::DUP2 << eth::Instruction::SLOAD;
    // stack: ref new_length old_length
    // store new length
    m_context << eth::Instruction::DUP2 << eth::Instruction::DUP4 << eth::Instruction::SSTORE;
    // skip if size is not reduced
    m_context << eth::Instruction::DUP2 << eth::Instruction::DUP2
        << eth::Instruction::ISZERO << eth::Instruction::GT;
    m_context.appendConditionalJumpTo(resizeEnd);

    // size reduced, clear the end of the array
    // stack: ref new_length old_length
    convertLengthToSize(_type);
    m_context << eth::Instruction::DUP2;
    convertLengthToSize(_type);
    // stack: ref new_length old_size new_size
    // compute data positions
    m_context << eth::Instruction::DUP4;
    CompilerUtils(m_context).computeHashStatic();
    // stack: ref new_length old_size new_size data_pos
    m_context << eth::Instruction::SWAP2 << eth::Instruction::DUP3 << eth::Instruction::ADD;
    // stack: ref new_length data_pos new_size delete_end
    m_context << eth::Instruction::SWAP2 << eth::Instruction::ADD;
    // stack: ref new_length delete_end delete_start
    if (_type.isByteArray())
        clearStorageLoop(IntegerType(256));
    else
        clearStorageLoop(*_type.getBaseType());

    m_context << resizeEnd;
    // cleanup
    m_context << eth::Instruction::POP << eth::Instruction::POP << eth::Instruction::POP;
}

void ArrayUtils::clearStorageLoop(Type const& _type) const
{
    if (_type.getCategory() == Type::Category::Mapping)
    {
        m_context << eth::Instruction::POP;
        return;
    }
    // stack: end_pos pos
    eth::AssemblyItem loopStart = m_context.newTag();
    m_context << loopStart;
    // check for loop condition
    m_context << eth::Instruction::DUP1 << eth::Instruction::DUP3
               << eth::Instruction::GT << eth::Instruction::ISZERO;
    eth::AssemblyItem zeroLoopEnd = m_context.newTag();
    m_context.appendConditionalJumpTo(zeroLoopEnd);
    // delete
    StorageItem(m_context, _type).setToZero(SourceLocation(), false);
    // increment
    m_context << u256(1) << eth::Instruction::ADD;
    m_context.appendJumpTo(loopStart);
    // cleanup
    m_context << zeroLoopEnd;
    m_context << eth::Instruction::POP;
}

void ArrayUtils::convertLengthToSize(ArrayType const& _arrayType, bool _pad) const
{
    if (_arrayType.getLocation() == ArrayType::Location::Storage)
    {
        if (_arrayType.isByteArray())
            m_context << u256(31) << eth::Instruction::ADD
                << u256(32) << eth::Instruction::SWAP1 << eth::Instruction::DIV;
        else if (_arrayType.getBaseType()->getStorageSize() > 1)
            m_context << _arrayType.getBaseType()->getStorageSize() << eth::Instruction::MUL;
    }
    else
    {
        if (!_arrayType.isByteArray())
            m_context << _arrayType.getBaseType()->getCalldataEncodedSize() << eth::Instruction::MUL;
        else if (_pad)
            m_context << u256(31) << eth::Instruction::ADD
                << u256(32) << eth::Instruction::DUP1
                << eth::Instruction::SWAP2 << eth::Instruction::DIV << eth::Instruction::MUL;
    }
}

void ArrayUtils::retrieveLength(ArrayType const& _arrayType) const
{
    if (!_arrayType.isDynamicallySized())
        m_context << _arrayType.getLength();
    else
    {
        m_context << eth::Instruction::DUP1;
        switch (_arrayType.getLocation())
        {
        case ArrayType::Location::CallData:
            // length is stored on the stack
            break;
        case ArrayType::Location::Memory:
            m_context << eth::Instruction::MLOAD;
            break;
        case ArrayType::Location::Storage:
            m_context << eth::Instruction::SLOAD;
            break;
        }
    }
}