FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
solidity/libsolidity/codegen/CompilerUtils.cpp at develop · compumatrix/solidity · GitHub
compumatrix
/
solidity
Public
forked from
argotorg/solidity
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
solidity
/
libsolidity
/
codegen
/
CompilerUtils.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
843 lines (793 loc) · 29 KB
Breadcrumbs
solidity
/
libsolidity
/
codegen
/
CompilerUtils.cpp
Copy path
File metadata and controls
843 lines (793 loc) · 29 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
/*
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 2014
* Routines used by both the compiler and the expression compiler.
*/
#
include
<
libsolidity/codegen/CompilerUtils.h
>
#
include
<
libsolidity/ast/AST.h
>
#
include
<
libevmasm/Instruction.h
>
#
include
<
libsolidity/codegen/ArrayUtils.h
>
#
include
<
libsolidity/codegen/LValue.h
>
using
namespace
std
;
namespace
dev
{
namespace
solidity
{
const
unsigned
CompilerUtils::dataStartOffset =
4
;
const
size_t
CompilerUtils::freeMemoryPointer =
64
;
const
unsigned
CompilerUtils::identityContractAddress =
4
;
void
CompilerUtils::initialiseFreeMemoryPointer
()
{
m_context <<
u256
(freeMemoryPointer +
32
);
storeFreeMemoryPointer
();
}
void
CompilerUtils::fetchFreeMemoryPointer
()
{
m_context <<
u256
(freeMemoryPointer) << Instruction::
MLOAD
;
}
void
CompilerUtils::storeFreeMemoryPointer
()
{
m_context <<
u256
(freeMemoryPointer) << Instruction::
MSTORE
;
}
void
CompilerUtils::allocateMemory
()
{
fetchFreeMemoryPointer
();
m_context << Instruction::
SWAP1
<< Instruction::
DUP2
<< Instruction::
ADD
;
storeFreeMemoryPointer
();
}
void
CompilerUtils::toSizeAfterFreeMemoryPointer
()
{
fetchFreeMemoryPointer
();
m_context << Instruction::
DUP1
<< Instruction::
SWAP2
<< Instruction::
SUB
;
m_context << Instruction::
SWAP1
;
}
unsigned
CompilerUtils::loadFromMemory
(
unsigned
_offset,
Type
const
& _type,
bool
_fromCalldata,
bool
_padToWordBoundaries
)
{
solAssert
(_type.
category
() != Type::Category::Array,
"
Unable to statically load dynamic type.
"
);
m_context <<
u256
(_offset);
return
loadFromMemoryHelper
(_type, _fromCalldata, _padToWordBoundaries);
}
void
CompilerUtils::loadFromMemoryDynamic
(
Type
const
& _type,
bool
_fromCalldata,
bool
_padToWordBoundaries,
bool
_keepUpdatedMemoryOffset
)
{
if
(_keepUpdatedMemoryOffset)
m_context << Instruction::
DUP1
;
if
(
auto
arrayType =
dynamic_cast
<ArrayType
const
*>(&_type))
{
solAssert
(!arrayType->
isDynamicallySized
(),
"
"
);
solAssert
(!_fromCalldata,
"
"
);
solAssert
(_padToWordBoundaries,
"
"
);
if
(_keepUpdatedMemoryOffset)
m_context << arrayType->
memorySize
() << Instruction::
ADD
;
}
else
{
unsigned
numBytes =
loadFromMemoryHelper
(_type, _fromCalldata, _padToWordBoundaries);
if
(_keepUpdatedMemoryOffset)
{
//
update memory counter
moveToStackTop
(_type.
sizeOnStack
());
m_context <<
u256
(numBytes) << Instruction::
ADD
;
}
}
}
void
CompilerUtils::storeInMemory
(
unsigned
_offset)
{
unsigned
numBytes =
prepareMemoryStore
(
IntegerType
(
256
),
true
);
if
(numBytes >
0
)
m_context <<
u256
(_offset) << Instruction::
MSTORE
;
}
void
CompilerUtils::storeInMemoryDynamic
(Type
const
& _type,
bool
_padToWordBoundaries)
{
if
(
auto
ref =
dynamic_cast
<ReferenceType
const
*>(&_type))
{
solAssert
(ref->
location
() == DataLocation::Memory,
"
"
);
storeInMemoryDynamic
(
IntegerType
(
256
), _padToWordBoundaries);
}
else
if
(
auto
str =
dynamic_cast
<StringLiteralType
const
*>(&_type))
{
m_context << Instruction::
DUP1
;
storeStringData
(
bytesConstRef
(str->
value
()));
if
(_padToWordBoundaries)
m_context <<
u256
(((str->
value
().
size
() +
31
) /
32
) *
32
);
else
m_context <<
u256
(str->
value
().
size
());
m_context << Instruction::
ADD
;
}
else
{
unsigned
numBytes =
prepareMemoryStore
(_type, _padToWordBoundaries);
if
(numBytes >
0
)
{
solAssert
(
_type.
sizeOnStack
() ==
1
,
"
Memory store of types with stack size != 1 not implemented.
"
);
m_context << Instruction::
DUP2
<< Instruction::
MSTORE
;
m_context <<
u256
(numBytes) << Instruction::
ADD
;
}
}
}
void
CompilerUtils::encodeToMemory
(
TypePointers
const
& _givenTypes,
TypePointers
const
& _targetTypes,
bool
_padToWordBoundaries,
bool
_copyDynamicDataInPlace,
bool
_encodeAsLibraryTypes
)
{
//
stack: <v1> <v2> ... <vn> <mem>
TypePointers targetTypes = _targetTypes.
empty
() ? _givenTypes : _targetTypes;
solAssert
(targetTypes.
size
() == _givenTypes.
size
(),
"
"
);
for
(TypePointer& t: targetTypes)
t = t->
mobileType
()->
interfaceType
(_encodeAsLibraryTypes)->
encodingType
();
//
Stack during operation:
//
<v1> <v2> ... <vn> <mem_start> <dyn_head_1> ... <dyn_head_r> <end_of_mem>
//
The values dyn_head_i are added during the first loop and they point to the head part
//
of the ith dynamic parameter, which is filled once the dynamic parts are processed.
//
store memory start pointer
m_context << Instruction::
DUP1
;
unsigned
argSize =
CompilerUtils::sizeOnStack
(_givenTypes);
unsigned
stackPos =
0
;
//
advances through the argument values
unsigned
dynPointers =
0
;
//
number of dynamic head pointers on the stack
for
(
size_t
i =
0
; i < _givenTypes.
size
(); ++i)
{
TypePointer targetType = targetTypes[i];
solAssert
(!!targetType,
"
Externalable type expected.
"
);
if
(targetType->
isDynamicallySized
() && !_copyDynamicDataInPlace)
{
//
leave end_of_mem as dyn head pointer
m_context << Instruction::
DUP1
<<
u256
(
32
) << Instruction::
ADD
;
dynPointers++;
}
else
{
copyToStackTop
(argSize - stackPos + dynPointers +
2
, _givenTypes[i]->
sizeOnStack
());
solAssert
(!!targetType,
"
Externalable type expected.
"
);
TypePointer type = targetType;
if
(_givenTypes[i]->
dataStoredIn
(DataLocation::Storage) && targetType->
isValueType
())
{
//
special case: convert storage reference type to value type - this is only
//
possible for library calls where we just forward the storage reference
solAssert
(_encodeAsLibraryTypes,
"
"
);
solAssert
(_givenTypes[i]->
sizeOnStack
() ==
1
,
"
"
);
}
else
if
(
_givenTypes[i]->
dataStoredIn
(DataLocation::Storage) ||
_givenTypes[i]->
dataStoredIn
(DataLocation::CallData) ||
_givenTypes[i]->
category
() == Type::Category::StringLiteral
)
type = _givenTypes[i];
//
delay conversion
else
convertType
(*_givenTypes[i], *targetType,
true
);
if
(
auto
arrayType =
dynamic_cast
<ArrayType
const
*>(type.
get
()))
ArrayUtils
(m_context).
copyArrayToMemory
(*arrayType, _padToWordBoundaries);
else
storeInMemoryDynamic
(*type, _padToWordBoundaries);
}
stackPos += _givenTypes[i]->
sizeOnStack
();
}
//
now copy the dynamic part
//
Stack: <v1> <v2> ... <vn> <mem_start> <dyn_head_1> ... <dyn_head_r> <end_of_mem>
stackPos =
0
;
unsigned
thisDynPointer =
0
;
for
(
size_t
i =
0
; i < _givenTypes.
size
(); ++i)
{
TypePointer targetType = targetTypes[i];
solAssert
(!!targetType,
"
Externalable type expected.
"
);
if
(targetType->
isDynamicallySized
() && !_copyDynamicDataInPlace)
{
//
copy tail pointer (=mem_end - mem_start) to memory
m_context <<
dupInstruction
(
2
+ dynPointers) << Instruction::
DUP2
;
m_context << Instruction::
SUB
;
m_context <<
dupInstruction
(
2
+ dynPointers - thisDynPointer);
m_context << Instruction::
MSTORE
;
//
stack: ... <end_of_mem>
if
(_givenTypes[i]->
category
() == Type::Category::StringLiteral)
{
auto
const
& strType =
dynamic_cast
<StringLiteralType
const
&>(*_givenTypes[i]);
m_context <<
u256
(strType.
value
().
size
());
storeInMemoryDynamic
(
IntegerType
(
256
),
true
);
//
stack: ... <end_of_mem'>
storeInMemoryDynamic
(strType, _padToWordBoundaries);
}
else
{
solAssert
(_givenTypes[i]->
category
() == Type::Category::Array,
"
Unknown dynamic type.
"
);
auto
const
& arrayType =
dynamic_cast
<ArrayType
const
&>(*_givenTypes[i]);
//
now copy the array
copyToStackTop
(argSize - stackPos + dynPointers +
2
, arrayType.
sizeOnStack
());
//
stack: ... <end_of_mem> <value...>
//
copy length to memory
m_context <<
dupInstruction
(
1
+ arrayType.
sizeOnStack
());
ArrayUtils
(m_context).
retrieveLength
(arrayType,
1
);
//
stack: ... <end_of_mem> <value...> <end_of_mem'> <length>
storeInMemoryDynamic
(
IntegerType
(
256
),
true
);
//
stack: ... <end_of_mem> <value...> <end_of_mem''>
//
copy the new memory pointer
m_context <<
swapInstruction
(arrayType.
sizeOnStack
() +
1
) << Instruction::
POP
;
//
stack: ... <end_of_mem''> <value...>
//
copy data part
ArrayUtils
(m_context).
copyArrayToMemory
(arrayType, _padToWordBoundaries);
//
stack: ... <end_of_mem'''>
}
thisDynPointer++;
}
stackPos += _givenTypes[i]->
sizeOnStack
();
}
//
remove unneeded stack elements (and retain memory pointer)
m_context <<
swapInstruction
(argSize + dynPointers +
1
);
popStackSlots
(argSize + dynPointers +
1
);
}
void
CompilerUtils::zeroInitialiseMemoryArray
(ArrayType
const
& _type)
{
auto
repeat = m_context.
newTag
();
m_context << repeat;
pushZeroValue
(*_type.
baseType
());
storeInMemoryDynamic
(*_type.
baseType
());
m_context << Instruction::
SWAP1
<<
u256
(
1
) << Instruction::
SWAP1
;
m_context << Instruction::
SUB
<< Instruction::
SWAP1
;
m_context << Instruction::
DUP2
;
m_context.
appendConditionalJumpTo
(repeat);
m_context << Instruction::
SWAP1
<< Instruction::
POP
;
}
void
CompilerUtils::memoryCopy
()
{
//
Stack here: size target source
//
stack for call: outsize target size source value contract gas
//
@TODO do not use ::CALL if less than 32 bytes?
m_context << Instruction::
DUP3
<< Instruction::
SWAP1
;
m_context <<
u256
(
0
) <<
u256
(identityContractAddress);
//
compute gas costs
m_context <<
u256
(
32
) << Instruction::
DUP5
<<
u256
(
31
) << Instruction::
ADD
;
static
unsigned
c_identityGas =
15
;
static
unsigned
c_identityWordGas =
3
;
m_context << Instruction::
DIV
<<
u256
(c_identityWordGas) << Instruction::
MUL
;
m_context <<
u256
(c_identityGas) << Instruction::
ADD
;
m_context << Instruction::
CALL
;
m_context << Instruction::
POP
;
//
ignore return value
}
void
CompilerUtils::convertType
(Type
const
& _typeOnStack, Type
const
& _targetType,
bool
_cleanupNeeded)
{
//
For a type extension, we need to remove all higher-order bits that we might have ignored in
//
previous operations.
//
@todo: store in the AST whether the operand might have "dirty" higher order bits
if
(_typeOnStack == _targetType && !_cleanupNeeded)
return
;
Type::Category stackTypeCategory = _typeOnStack.
category
();
Type::Category targetTypeCategory = _targetType.
category
();
switch
(stackTypeCategory)
{
case
Type::Category::FixedBytes:
{
FixedBytesType
const
& typeOnStack =
dynamic_cast
<FixedBytesType
const
&>(_typeOnStack);
if
(targetTypeCategory == Type::Category::Integer)
{
//
conversion from bytes to integer. no need to clean the high bit
//
only to shift right because of opposite alignment
IntegerType
const
& targetIntegerType =
dynamic_cast
<IntegerType
const
&>(_targetType);
m_context << (
u256
(
1
) << (
256
- typeOnStack.
numBytes
() *
8
)) << Instruction::
SWAP1
<< Instruction::
DIV
;
if
(targetIntegerType.
numBits
() < typeOnStack.
numBytes
() *
8
)
convertType
(
IntegerType
(typeOnStack.
numBytes
() *
8
), _targetType, _cleanupNeeded);
}
else
{
//
clear for conversion to longer bytes
solAssert
(targetTypeCategory == Type::Category::FixedBytes,
"
Invalid type conversion requested.
"
);
FixedBytesType
const
& targetType =
dynamic_cast
<FixedBytesType
const
&>(_targetType);
if
(targetType.
numBytes
() > typeOnStack.
numBytes
() || _cleanupNeeded)
{
if
(typeOnStack.
numBytes
() ==
0
)
m_context << Instruction::
POP
<<
u256
(
0
);
else
{
m_context << ((
u256
(
1
) << (
256
- typeOnStack.
numBytes
() *
8
)) -
1
);
m_context << Instruction::
NOT
<< Instruction::
AND
;
}
}
}
}
break
;
case
Type::Category::Enum:
solAssert
(targetTypeCategory == Type::Category::Integer || targetTypeCategory == Type::Category::Enum,
"
"
);
break
;
case
Type::Category::FixedPoint:
solAssert
(
false
,
"
Not yet implemented - FixedPointType.
"
);
case
Type::Category::Integer:
case
Type::Category::Contract:
case
Type::Category::RationalNumber:
if
(targetTypeCategory == Type::Category::FixedBytes)
{
solAssert
(stackTypeCategory == Type::Category::Integer || stackTypeCategory == Type::Category::RationalNumber,
"
Invalid conversion to FixedBytesType requested.
"
);
//
conversion from bytes to string. no need to clean the high bit
//
only to shift left because of opposite alignment
FixedBytesType
const
& targetBytesType =
dynamic_cast
<FixedBytesType
const
&>(_targetType);
if
(
auto
typeOnStack =
dynamic_cast
<IntegerType
const
*>(&_typeOnStack))
if
(targetBytesType.
numBytes
() *
8
> typeOnStack->
numBits
())
cleanHigherOrderBits
(*typeOnStack);
m_context << (
u256
(
1
) << (
256
- targetBytesType.
numBytes
() *
8
)) << Instruction::
MUL
;
}
else
if
(targetTypeCategory == Type::Category::Enum)
//
just clean
convertType
(_typeOnStack, *_typeOnStack.
mobileType
(),
true
);
else
if
(targetTypeCategory == Type::Category::FixedPoint)
{
solAssert
(
stackTypeCategory == Type::Category::Integer ||
stackTypeCategory == Type::Category::RationalNumber ||
stackTypeCategory == Type::Category::FixedPoint,
"
Invalid conversion to FixedMxNType requested.
"
);
//
shift all integer bits onto the left side of the fixed type
FixedPointType
const
& targetFixedPointType =
dynamic_cast
<FixedPointType
const
&>(_targetType);
if
(
auto
typeOnStack =
dynamic_cast
<IntegerType
const
*>(&_typeOnStack))
if
(targetFixedPointType.
integerBits
() > typeOnStack->
numBits
())
cleanHigherOrderBits
(*typeOnStack);
solAssert
(
false
,
"
Not yet implemented - FixedPointType.
"
);
}
else
{
solAssert
(targetTypeCategory == Type::Category::Integer || targetTypeCategory == Type::Category::Contract,
"
"
);
IntegerType
addressType
(
0
, IntegerType::Modifier::Address);
IntegerType
const
& targetType = targetTypeCategory == Type::Category::Integer
?
dynamic_cast
<IntegerType
const
&>(_targetType) : addressType;
if
(stackTypeCategory == Type::Category::RationalNumber)
{
RationalNumberType
const
& constType =
dynamic_cast
<RationalNumberType
const
&>(_typeOnStack);
//
We know that the stack is clean, we only have to clean for a narrowing conversion
//
where cleanup is forced.
solAssert
(!constType.
isFractional
(),
"
Not yet implemented - FixedPointType.
"
);
if
(targetType.
numBits
() < constType.
integerType
()->
numBits
() && _cleanupNeeded)
cleanHigherOrderBits
(targetType);
}
else
{
IntegerType
const
& typeOnStack = stackTypeCategory == Type::Category::Integer
?
dynamic_cast
<IntegerType
const
&>(_typeOnStack) : addressType;
//
Widening: clean up according to source type width
//
Non-widening and force: clean up according to target type bits
if
(targetType.
numBits
() > typeOnStack.
numBits
())
cleanHigherOrderBits
(typeOnStack);
else
if
(_cleanupNeeded)
cleanHigherOrderBits
(targetType);
}
}
break
;
case
Type::Category::StringLiteral:
{
auto
const
& literalType =
dynamic_cast
<StringLiteralType
const
&>(_typeOnStack);
string
const
& value = literalType.
value
();
bytesConstRef
data
(value);
if
(targetTypeCategory == Type::Category::FixedBytes)
{
solAssert
(data.
size
() <=
32
,
"
"
);
m_context <<
h256::Arith
(
h256
(data, h256::AlignLeft));
}
else
if
(targetTypeCategory == Type::Category::Array)
{
auto
const
& arrayType =
dynamic_cast
<ArrayType
const
&>(_targetType);
solAssert
(arrayType.
isByteArray
(),
"
"
);
u256
storageSize
(
32
+ ((data.
size
() +
31
) /
32
) *
32
);
m_context << storageSize;
allocateMemory
();
//
stack: mempos
m_context << Instruction::
DUP1
<<
u256
(data.
size
());
storeInMemoryDynamic
(
IntegerType
(
256
));
//
stack: mempos datapos
storeStringData
(data);
break
;
}
else
solAssert
(
false
,
"
Invalid conversion from string literal to
"
+ _targetType.
toString
(
false
) +
"
requested.
"
);
break
;
}
case
Type::Category::Array:
{
solAssert
(targetTypeCategory == stackTypeCategory,
"
"
);
ArrayType
const
& typeOnStack =
dynamic_cast
<ArrayType
const
&>(_typeOnStack);
ArrayType
const
& targetType =
dynamic_cast
<ArrayType
const
&>(_targetType);
switch
(targetType.
location
())
{
case
DataLocation::Storage:
//
Other cases are done explicitly in LValue::storeValue, and only possible by assignment.
solAssert
(
(targetType.
isPointer
() || (typeOnStack.
isByteArray
() && targetType.
isByteArray
())) &&
typeOnStack.
location
() == DataLocation::Storage,
"
Invalid conversion to storage type.
"
);
break
;
case
DataLocation::Memory:
{
//
Copy the array to a free position in memory, unless it is already in memory.
if
(typeOnStack.
location
() != DataLocation::Memory)
{
//
stack: <source ref> (variably sized)
unsigned
stackSize = typeOnStack.
sizeOnStack
();
ArrayUtils
(m_context).
retrieveLength
(typeOnStack);
//
allocate memory
//
stack: <source ref> (variably sized) <length>
m_context << Instruction::
DUP1
;
ArrayUtils
(m_context).
convertLengthToSize
(targetType,
true
);
//
stack: <source ref> (variably sized) <length> <size>
if
(targetType.
isDynamicallySized
())
m_context <<
u256
(
0x20
) << Instruction::
ADD
;
allocateMemory
();
//
stack: <source ref> (variably sized) <length> <mem start>
m_context << Instruction::
DUP1
;
moveIntoStack
(
2
+ stackSize);
if
(targetType.
isDynamicallySized
())
{
m_context << Instruction::
DUP2
;
storeInMemoryDynamic
(
IntegerType
(
256
));
}
//
stack: <mem start> <source ref> (variably sized) <length> <mem data pos>
if
(targetType.
baseType
()->
isValueType
())
{
solAssert
(typeOnStack.
baseType
()->
isValueType
(),
"
"
);
copyToStackTop
(
2
+ stackSize, stackSize);
ArrayUtils
(m_context).
copyArrayToMemory
(typeOnStack);
}
else
{
m_context <<
u256
(
0
) << Instruction::
SWAP1
;
//
stack: <mem start> <source ref> (variably sized) <length> <counter> <mem data pos>
auto
repeat = m_context.
newTag
();
m_context << repeat;
m_context << Instruction::
DUP3
<< Instruction::
DUP3
;
m_context << Instruction::
LT
<< Instruction::
ISZERO
;
auto
loopEnd = m_context.
appendConditionalJump
();
copyToStackTop
(
3
+ stackSize, stackSize);
copyToStackTop
(
2
+ stackSize,
1
);
ArrayUtils
(m_context).
accessIndex
(typeOnStack,
false
);
if
(typeOnStack.
location
() == DataLocation::Storage)
StorageItem
(m_context, *typeOnStack.
baseType
()).
retrieveValue
(
SourceLocation
(),
true
);
convertType
(*typeOnStack.
baseType
(), *targetType.
baseType
(), _cleanupNeeded);
storeInMemoryDynamic
(*targetType.
baseType
(),
true
);
m_context << Instruction::
SWAP1
<<
u256
(
1
) << Instruction::
ADD
;
m_context << Instruction::
SWAP1
;
m_context.
appendJumpTo
(repeat);
m_context << loopEnd;
m_context << Instruction::
POP
;
}
//
stack: <mem start> <source ref> (variably sized) <length> <mem data pos updated>
popStackSlots
(
2
+ stackSize);
//
Stack: <mem start>
}
break
;
}
case
DataLocation::CallData:
solAssert
(
targetType.
isByteArray
() &&
typeOnStack.
isByteArray
() &&
typeOnStack.
location
() == DataLocation::CallData,
"
Invalid conversion to calldata type.
"
);
break
;
default
:
solAssert
(
false
,
"
Invalid type conversion
"
+
_typeOnStack.
toString
(
false
) +
"
to
"
+
_targetType.
toString
(
false
) +
"
requested.
"
);
}
break
;
}
case
Type::Category::Struct:
{
solAssert
(targetTypeCategory == stackTypeCategory,
"
"
);
auto
& targetType =
dynamic_cast
<StructType
const
&>(_targetType);
auto
& typeOnStack =
dynamic_cast
<StructType
const
&>(_typeOnStack);
solAssert
(
targetType.
location
() != DataLocation::CallData &&
typeOnStack.
location
() != DataLocation::CallData
,
"
"
);
switch
(targetType.
location
())
{
case
DataLocation::Storage:
//
Other cases are done explicitly in LValue::storeValue, and only possible by assignment.
solAssert
(
targetType.
isPointer
() &&
typeOnStack.
location
() == DataLocation::Storage,
"
Invalid conversion to storage type.
"
);
break
;
case
DataLocation::Memory:
//
Copy the array to a free position in memory, unless it is already in memory.
if
(typeOnStack.
location
() != DataLocation::Memory)
{
solAssert
(typeOnStack.
location
() == DataLocation::Storage,
"
"
);
//
stack: <source ref>
m_context << typeOnStack.
memorySize
();
allocateMemory
();
m_context << Instruction::
SWAP1
<< Instruction::
DUP2
;
//
stack: <memory ptr> <source ref> <memory ptr>
for
(
auto
const
& member: typeOnStack.
members
(
nullptr
))
{
if
(!member.
type
->
canLiveOutsideStorage
())
continue
;
pair<u256,
unsigned
>
const
& offsets = typeOnStack.
storageOffsetsOfMember
(member.
name
);
m_context << offsets.
first
<< Instruction::
DUP3
<< Instruction::
ADD
;
m_context <<
u256
(offsets.
second
);
StorageItem
(m_context, *member.
type
).
retrieveValue
(
SourceLocation
(),
true
);
TypePointer targetMemberType = targetType.
memberType
(member.
name
);
solAssert
(!!targetMemberType,
"
Member not found in target type.
"
);
convertType
(*member.
type
, *targetMemberType,
true
);
storeInMemoryDynamic
(*targetMemberType,
true
);
}
m_context << Instruction::
POP
<< Instruction::
POP
;
}
break
;
case
DataLocation::CallData:
solAssert
(
false
,
"
Invalid type conversion target location CallData.
"
);
break
;
}
break
;
}
case
Type::Category::Tuple:
{
TupleType
const
& sourceTuple =
dynamic_cast
<TupleType
const
&>(_typeOnStack);
TupleType
const
& targetTuple =
dynamic_cast
<TupleType
const
&>(_targetType);
//
fillRight: remove excess values at right side, !fillRight: remove eccess values at left side
bool
fillRight = !targetTuple.
components
().
empty
() && (
!targetTuple.
components
().
back
() ||
targetTuple.
components
().
front
()
);
unsigned
depth = sourceTuple.
sizeOnStack
();
for
(
size_t
i =
0
; i < sourceTuple.
components
().
size
(); ++i)
{
TypePointer sourceType = sourceTuple.
components
()[i];
TypePointer targetType;
if
(fillRight && i < targetTuple.
components
().
size
())
targetType = targetTuple.
components
()[i];
else
if
(!fillRight && targetTuple.
components
().
size
() + i >= sourceTuple.
components
().
size
())
targetType = targetTuple.
components
()[targetTuple.
components
().
size
() - (sourceTuple.
components
().
size
() - i)];
if
(!sourceType)
{
solAssert
(!targetType,
"
"
);
continue
;
}
unsigned
sourceSize = sourceType->
sizeOnStack
();
unsigned
targetSize = targetType ? targetType->
sizeOnStack
() :
0
;
if
(!targetType || *sourceType != *targetType || _cleanupNeeded)
{
if
(targetType)
{
if
(sourceSize >
0
)
copyToStackTop
(depth, sourceSize);
convertType
(*sourceType, *targetType, _cleanupNeeded);
}
if
(sourceSize >
0
|| targetSize >
0
)
{
//
Move it back into its place.
for
(
unsigned
j =
0
; j <
min
(sourceSize, targetSize); ++j)
m_context <<
swapInstruction
(depth + targetSize - sourceSize) <<
Instruction::
POP
;
//
Value shrank
for
(
unsigned
j = targetSize; j < sourceSize; ++j)
{
moveToStackTop
(depth -
1
,
1
);
m_context << Instruction::
POP
;
}
//
Value grew
if
(targetSize > sourceSize)
moveIntoStack
(depth + targetSize - sourceSize -
1
, targetSize - sourceSize);
}
}
depth -= sourceSize;
}
break
;
}
case
Type::Category::Bool:
solAssert
(_targetType == _typeOnStack,
"
Invalid conversion for bool.
"
);
if
(_cleanupNeeded)
m_context << Instruction::
ISZERO
<< Instruction::
ISZERO
;
default
:
//
All other types should not be convertible to non-equal types.
solAssert
(_typeOnStack == _targetType,
"
Invalid type conversion requested.
"
);
break
;
}
}
void
CompilerUtils::pushZeroValue
(Type
const
& _type)
{
auto
const
* referenceType =
dynamic_cast
<ReferenceType
const
*>(&_type);
if
(!referenceType || referenceType->
location
() == DataLocation::Storage)
{
for
(
size_t
i =
0
; i < _type.
sizeOnStack
(); ++i)
m_context <<
u256
(
0
);
return
;
}
solAssert
(referenceType->
location
() == DataLocation::Memory,
"
"
);
m_context <<
u256
(
max
(
32u
, _type.
calldataEncodedSize
()));
allocateMemory
();
m_context << Instruction::
DUP1
;
if
(
auto
structType =
dynamic_cast
<StructType
const
*>(&_type))
for
(
auto
const
& member: structType->
members
(
nullptr
))
{
pushZeroValue
(*member.
type
);
storeInMemoryDynamic
(*member.
type
);
}
else
if
(
auto
arrayType =
dynamic_cast
<ArrayType
const
*>(&_type))
{
if
(arrayType->
isDynamicallySized
())
{
//
zero length
m_context <<
u256
(
0
);
storeInMemoryDynamic
(
IntegerType
(
256
));
}
else
if
(arrayType->
length
() >
0
)
{
m_context << arrayType->
length
() << Instruction::
SWAP1
;
//
stack: items_to_do memory_pos
zeroInitialiseMemoryArray
(*arrayType);
//
stack: updated_memory_pos
}
}
else
solAssert
(
false
,
"
Requested initialisation for unknown type:
"
+ _type.
toString
());
//
remove the updated memory pointer
m_context << Instruction::
POP
;
}
void
CompilerUtils::moveToStackVariable
(VariableDeclaration
const
& _variable)
{
unsigned
const
stackPosition = m_context.
baseToCurrentStackOffset
(m_context.
baseStackOffsetOfVariable
(_variable));
unsigned
const
size = _variable.
annotation
().
type
->
sizeOnStack
();
solAssert
(stackPosition >= size,
"
Variable size and position mismatch.
"
);
//
move variable starting from its top end in the stack
if
(stackPosition - size +
1
>
16
)
BOOST_THROW_EXCEPTION
(
CompilerError
() <<
errinfo_sourceLocation
(_variable.
location
()) <<
errinfo_comment
(
"
Stack too deep, try removing local variables.
"
)
);
for
(
unsigned
i =
0
; i < size; ++i)
m_context <<
swapInstruction
(stackPosition - size +
1
) << Instruction::
POP
;
}
void
CompilerUtils::copyToStackTop
(
unsigned
_stackDepth,
unsigned
_itemSize)
{
solAssert
(_stackDepth <=
16
,
"
Stack too deep, try removing local variables.
"
);
for
(
unsigned
i =
0
; i < _itemSize; ++i)
m_context <<
dupInstruction
(_stackDepth);
}
void
CompilerUtils::moveToStackTop
(
unsigned
_stackDepth,
unsigned
_itemSize)
{
moveIntoStack
(_itemSize, _stackDepth);
}
void
CompilerUtils::moveIntoStack
(
unsigned
_stackDepth,
unsigned
_itemSize)
{
if
(_stackDepth <= _itemSize)
for
(
unsigned
i =
0
; i < _stackDepth; ++i)
rotateStackDown
(_stackDepth + _itemSize);
else
for
(
unsigned
i =
0
; i < _itemSize; ++i)
rotateStackUp
(_stackDepth + _itemSize);
}
void
CompilerUtils::rotateStackUp
(
unsigned
_items)
{
solAssert
(_items -
1
<=
16
,
"
Stack too deep, try removing local variables.
"
);
for
(
unsigned
i =
1
; i < _items; ++i)
m_context <<
swapInstruction
(_items - i);
}
void
CompilerUtils::rotateStackDown
(
unsigned
_items)
{
solAssert
(_items -
1
<=
16
,
"
Stack too deep, try removing local variables.
"
);
for
(
unsigned
i =
1
; i < _items; ++i)
m_context <<
swapInstruction
(i);
}
void
CompilerUtils::popStackElement
(Type
const
& _type)
{
popStackSlots
(_type.
sizeOnStack
());
}
void
CompilerUtils::popStackSlots
(
size_t
_amount)
{
for
(
size_t
i =
0
; i < _amount; ++i)
m_context << Instruction::
POP
;
}
unsigned
CompilerUtils::sizeOnStack
(vector<shared_ptr<Type
const
>>
const
& _variableTypes)
{
unsigned
size =
0
;
for
(shared_ptr<Type
const
>
const
& type: _variableTypes)
size += type->
sizeOnStack
();
return
size;
}
void
CompilerUtils::computeHashStatic
()
{
storeInMemory
(
0
);
m_context <<
u256
(
32
) <<
u256
(
0
) << Instruction::
SHA3
;
}
void
CompilerUtils::storeStringData
(bytesConstRef _data)
{
//
@todo provide both alternatives to the optimiser
//
stack: mempos
if
(_data.
size
() <=
128
)
{
for
(
unsigned
i =
0
; i < _data.
size
(); i +=
32
)
{
m_context <<
h256::Arith
(
h256
(_data.
cropped
(i), h256::AlignLeft));
storeInMemoryDynamic
(
IntegerType
(
256
));
}
m_context << Instruction::
POP
;
}
else
{
//
stack: mempos mempos_data
m_context.
appendData
(_data.
toBytes
());
m_context <<
u256
(_data.
size
()) << Instruction::
SWAP2
;
m_context << Instruction::
CODECOPY
;
}
}
unsigned
CompilerUtils::loadFromMemoryHelper
(Type
const
& _type,
bool
_fromCalldata,
bool
_padToWordBoundaries)
{
unsigned
numBytes = _type.
calldataEncodedSize
(_padToWordBoundaries);
bool
leftAligned = _type.
category
() == Type::Category::FixedBytes;
if
(numBytes ==
0
)
m_context << Instruction::
POP
<<
u256
(
0
);
else
{
solAssert
(numBytes <=
32
,
"
Static memory load of more than 32 bytes requested.
"
);
m_context << (_fromCalldata ? Instruction::
CALLDATALOAD
: Instruction::
MLOAD
);
if
(numBytes !=
32
)
{
//
add leading or trailing zeros by dividing/multiplying depending on alignment
u256 shiftFactor =
u256
(
1
) << ((
32
- numBytes) *
8
);
m_context << shiftFactor << Instruction::
SWAP1
<< Instruction::
DIV
;
if
(leftAligned)
m_context << shiftFactor << Instruction::
MUL
;
}
}
return
numBytes;
}
void
CompilerUtils::cleanHigherOrderBits
(IntegerType
const
& _typeOnStack)
{
if
(_typeOnStack.
numBits
() ==
256
)
return
;
else
if
(_typeOnStack.
isSigned
())
m_context <<
u256
(_typeOnStack.
numBits
() /
8
-
1
) << Instruction::
SIGNEXTEND
;
else
m_context << ((
u256
(
1
) << _typeOnStack.
numBits
()) -
1
) << Instruction::
AND
;
}
unsigned
CompilerUtils::prepareMemoryStore
(Type
const
& _type,
bool
_padToWordBoundaries)
const
{
unsigned
numBytes = _type.
calldataEncodedSize
(_padToWordBoundaries);
bool
leftAligned = _type.
category
() == Type::Category::FixedBytes;
if
(numBytes ==
0
)
m_context << Instruction::
POP
;
else
{
solAssert
(numBytes <=
32
,
"
Memory store of more than 32 bytes requested.
"
);
if
(numBytes !=
32
&& !leftAligned && !_padToWordBoundaries)
//
shift the value accordingly before storing
m_context << (
u256
(
1
) << ((
32
- numBytes) *
8
)) << Instruction::
MUL
;
}
return
numBytes;
}
}
}
Back
|
FazBrowse Home
|
New Git URL