libsolidity/ast/Types.cpp



89b794f1
3f9f7257
89b794f1
3f9f7257
8a506b50


89b794f1
3f9f7257
8a506b50


89b794f1
8a506b50
3f9f7257
89b794f1


e3dffb61
da178d96
da178d96

987f42aa
59b5e950
70d9eb3f
e8c2e873
eb5b18e8
da178d96

7159944f
07045d49
9865012f

da178d96
080be885
da178d96

09a36cba
da178d96

89b794f1
de493c67
e2d6e34f

89b794f1
33fbf887


02595abf
7f64584b
02595abf


7f64584b
02595abf


1b5e6fc9
7f64584b
02595abf
7f64584b
02595abf

7f64584b
742e5b25
02595abf
1b5e6fc9


02595abf

1b5e6fc9
02595abf

7f64584b
02595abf


742e5b25
02595abf


1b5e6fc9
02595abf


7f64584b


93b3237c


5fb89530
02595abf


0c69d5fd

02595abf


0c69d5fd
1b5e6fc9
02595abf


1b5e6fc9
7f64584b

1b5e6fc9

7f64584b

da178d96


b471983e
da178d96


b471983e
da178d96

b471983e
da178d96
b471983e
da178d96


b471983e
da178d96


b471983e
da178d96


b471983e
da178d96


75170597


b471983e

75170597


3064bd17


7b918a7b
89b794f1
f112377d
9b67969f

c1f7a166
f112377d
22318c0c

7b918a7b

8a506b50
7b918a7b
d2c0712f
7b918a7b
d2c0712f
7b918a7b
d2c0712f
9a075458


7b918a7b


9a075458
e37b6195
9a075458
e37b6195
7b918a7b
b8cede37
7b918a7b
12aaca16
7b918a7b
a60d82d1
7b918a7b
1ff8dbeb
7b918a7b
1ff8dbeb
7b918a7b

80980309

7b918a7b
80980309
7b918a7b
89b794f1

adb43456

9865012f


f112377d
9865012f
f112377d
5b1c0506

9865012f


5b1c0506
9865012f
12aaca16


5b1c0506
9865012f

5b1c0506
9865012f
adb43456

adb43456
89b794f1
1b5e6fc9
8a506b50
6f621f84

a60d82d1
6f621f84
7d7abeb1
6f621f84
46dde467
89b794f1
ef7049f9
89b794f1


7dc78279

f25aa0c6

dcc16c81
6c157576
dcc16c81
6c157576
7dc78279


93b3237c


7ea3d950
93b3237c


7a8a243e


0b65b2df


7a8a243e
7a8a243e


93b3237c


7ea3d950
93b3237c
eecc26de
93b3237c
7ea3d950

93b3237c
fdd1108c

93b3237c


fa987e0a
12aaca16


87804b64

12aaca16


87804b64


12aaca16

87804b64
87804b64


12aaca16


87804b64


9fb835b7
87804b64

f112377d
87804b64


f112377d
87804b64

f112377d
87804b64


12aaca16


87804b64

12aaca16
87804b64


12aaca16
87804b64
12aaca16


87804b64

7fb4a641


f112377d
27380450


87804b64
27380450
b79531be
27380450


7fb4a641

b3442824
fd046d7c
89b794f1
5fb89530

b3442824
ee65ecfb
3fed790a

2e7067fb
3fed790a
87804b64
89b794f1


9a075458
ef7049f9
9a075458


9a075458


87804b64
9a075458
89b794f1
9a075458
89b794f1

f0c33467
89b794f1
1b5e6fc9
87804b64
1b5e6fc9

5c59d563
62894101
89b794f1

f112377d
89b794f1
be1e89da
6f621f84
a5d12b87
87804b64
6f621f84
9aea119e
faf0b3f6
be1e89da


59b5e950

62822ffd
59b5e950
1b5e6fc9
59b5e950


89b794f1

258b1a74
a09e4c55
7d7f37bd
a09e4c55


01a1296e


f112377d
7dc78279
3ba308fb


7dc78279
f112377d
2df60bec
2df60bec
27380450


2df60bec

f347dee8
7dc78279

62894101
84429746
f112377d
84429746
f112377d
ab33328d
62894101
91923574
3ca5900b


91923574


2bddebc3
7dc78279

2c00ebbe
78769f3b
9a075458

aa1542a9
2c00ebbe
78769f3b

3fed790a

2e7067fb
3fed790a
e902ce1a
9a075458


78769f3b
9a075458
9a075458
72917c4f
9a075458
a6fc3c8f
9a075458


87804b64
9a075458

f112377d
9a075458
3dcf089c


9a075458
3dcf089c


9a075458
3dcf089c
9a075458
3dcf089c
9a075458


78769f3b
9a075458


78769f3b
9a075458

72917c4f


8d38d4d2
72917c4f


8d38d4d2
72917c4f


f112377d
9a075458
57003c53
9a075458


f112377d
9a075458
f112377d
9a075458


57003c53

b3442824
57003c53

e923f27e
3d03e85e
e923f27e
3d03e85e

e923f27e


9a075458
bfc238c8
e923f27e

bfc238c8
2b00804d
e923f27e

ef7049f9
e923f27e

9a075458

bfc238c8
e923f27e


9a075458
e923f27e

9a075458
e923f27e


7d7abeb1


4d5216c2

7d7abeb1


bfc238c8
3d03e85e
dde87de4
3d03e85e

4d5216c2
924a8fff
b9222808


a2b9f52c

09a36cba
a2b9f52c
b9222808
924a8fff
e8e5e12a
b9222808
924a8fff
e8e5e12a
924a8fff
e8e5e12a
924a8fff
e8e5e12a


33fbf887
b9222808
33fbf887
e8e5e12a
e923f27e
e8e5e12a

dde87de4
1083e6da
dfc8f890
33fbf887

dde87de4
1083e6da
33fbf887
1083e6da
dfc8f890
33fbf887


dde87de4
1083e6da
33fbf887
1083e6da
33fbf887
9a075458

9a075458
e923f27e
b9222808
e923f27e


9a075458
9a075458
bfc238c8
82edc1ca
bfc238c8
82edc1ca
a6fc3c8f


dde87de4
a6fc3c8f

dde87de4
a6fc3c8f

dde87de4
a6fc3c8f

dde87de4
a6fc3c8f

dde87de4
a6fc3c8f

dde87de4
a6fc3c8f

dde87de4
a6fc3c8f

dde87de4
a6fc3c8f


dde87de4
be623273

4b749fc3
be623273
097a3fab


b2fadf6b
65640524
bfc238c8
f2d62267
3d88eca5

b3442824
fe8d09a3
9a075458
f2d62267
9a075458
097a3fab


382ac85a
6fa5e0fa
9a075458
097a3fab
9a075458
a6fc3c8f
72917c4f
097a3fab
b2fadf6b
097a3fab
7d7abeb1
097a3fab

a8505e59
be623273

4b749fc3
be623273
7d7abeb1


be623273

f112377d
be623273
9a075458
be623273

6f621f84
65640524
82039b73
9a075458
be623273
6f621f84
93295ae8
be623273
6f621f84
93295ae8
be623273
1c9a048a

be623273


4b749fc3
be623273

f112377d
be623273
ef7049f9
9a075458
3b7b962b

9a075458
3b7b962b
9a075458
1b5e6fc9
be623273

4b749fc3
f112377d
be623273
140dbfdb
ef7049f9


be623273


9a075458
65640524
be623273

9a075458
6f621f84
82039b73

9a075458
be623273
6f621f84
82039b73

9a075458
be623273
6f621f84
82039b73

9a075458
be623273
6f621f84
6fa5e0fa
be623273
6f621f84
6fa5e0fa
be623273
6f621f84
be623273
bfc238c8
6f621f84
fe8d09a3
be623273
9a075458

be623273
6f621f84
fe8d09a3
be623273
82039b73
9a075458
4b3e1f14

9a075458


9865012f
d307b091
9a075458
65640524
11b4e7f7
33fbf887


d307b091
33fbf887


8d38d4d2
33fbf887


d307b091
9a075458
48f20289

48f20289

33250eef
48f20289
33250eef

33fbf887


8d38d4d2
33fbf887
48f20289

7ac27c95


48f20289
48f20289

33250eef
48f20289
33250eef

33fbf887


8d38d4d2
f33dc92c
33fbf887
f33dc92c

510f227b


f33dc92c


33fbf887
48f20289

be623273


33fbf887


4b749fc3
be623273


2e7067fb
3fed790a
b0f9fc5a


3fed790a

4b749fc3
be623273
1b5e6fc9
be623273
4b749fc3
9a075458
be623273

560fbd0d
a320ffea

560fbd0d
a320ffea

560fbd0d
a320ffea


560fbd0d
be623273
65640524
560fbd0d
a320ffea
560fbd0d


be623273

4b749fc3
be623273
02e1c9be


dca5f7b5
9865012f
a6fc3c8f
65640524
02e1c9be

a6fc3c8f
a6fc3c8f
00b1b96e
72917c4f
8d38d4d2
a6fc3c8f
02e1c9be
be623273
00b1b96e
82039b73
dca5f7b5
fe8d09a3
82039b73
be623273
bfc238c8
dca5f7b5
be623273

4b749fc3
2c9ff474
65640524
80c368da


2c9ff474

4b749fc3
be623273
65640524

be623273

9a075458
be623273


382ac85a


be623273

4b749fc3
9a075458
93295ae8
78769f3b
02e1c9be
9865012f
d4206b7c

bfc238c8
78769f3b
9a075458
78769f3b

82039b73
9865012f
5bddb2d6
82039b73
72917c4f
a6fc3c8f
43bda534

02e1c9be

a6fc3c8f
cf226f06
a6fc3c8f
5bddb2d6
cf226f06
78769f3b
cf226f06
a6fc3c8f
5bddb2d6
78769f3b
5bddb2d6

9a075458

46dde467
1b5e6fc9
46dde467


8a9b9e4f

e136ec87
da566b95
46dde467


2e7067fb
3fed790a


46dde467

1b5e6fc9
46dde467


bf76321c

f1df3dee
e8c2e873
a9e92cb6
e8c2e873

bf76321c


46dde467


e136ec87

a9e92cb6
e136ec87

aa1542a9
130ff85e
e0b178e1


130ff85e

7d7f37bd
130ff85e
1b5e6fc9
130ff85e
7d7f37bd
130ff85e


7d7f37bd
5de93e6a
5c59d563
87804b64
4dfe9a21
1b5e6fc9
5de93e6a

f112377d
7d7f37bd


a5d12b87
7d7f37bd


f112377d
7d7f37bd
f112377d
2df60bec
27380450


2df60bec
2df60bec

7d7f37bd
7d7f37bd


f112377d
7d7f37bd


29faf1b2


2e7067fb
3fed790a
e902ce1a
3fed790a

7d7f37bd
130ff85e
1b5e6fc9
130ff85e
7d7f37bd
130ff85e


be623273
89b794f1
be623273
1b5e6fc9
7f19f3d1
1b5e6fc9
7f19f3d1
59b5e950
80980309
59b5e950

f112377d
00b0b093
6f621f84
a5d12b87
6f621f84
00b0b093

f112377d
7dc78279
1b5e6fc9
7dc78279
0b6eea0c
dcda38cf
7dc78279


c5c89331
c50cd646
c5c89331
c50cd646
1b5e6fc9
417f9c03
34a81fd6
ae5a6a23

c8232d97


417f9c03
c50cd646


c5c89331

12aaca16


c5c89331

f20b150f


f112377d
00b0b093
5c8a6aac

a5d12b87
00b0b093

f112377d
03edf74e


a5d12b87
03edf74e
a5d12b87
03edf74e
35540fcf
03edf74e

1ff8dbeb
258b1a74


1ff8dbeb
258b1a74
1ff8dbeb
258b1a74
1ff8dbeb
258b1a74

6f7595e0

258b1a74

3fed790a


b7cafcbd


3fed790a
b7cafcbd

3fed790a
b7cafcbd

3fed790a
b7cafcbd
b7cafcbd
3fed790a


5e320831
20b4c690
1b5e6fc9
2ea8f3a7

6949ce97
2ea8f3a7
258b1a74
1ff8dbeb
2ea8f3a7
1ff8dbeb
258b1a74
1ff8dbeb
258b1a74

1b5e6fc9
258b1a74


1b5e6fc9
258b1a74


1add48a6


1b5e6fc9

1add48a6
258b1a74


1b5e6fc9
258b1a74
2ea8f3a7
258b1a74
20b4c690

56d5c331


1b5e6fc9
56d5c331


2e7067fb
3fed790a


da178d96
3fed790a
da178d96
3fed790a

da178d96

3fed790a
da178d96
3fed790a
da178d96
3fed790a


5e320831
13693378
1b5e6fc9
13693378
5e320831
6949ce97
258b1a74
6949ce97


2ea8f3a7
79c5d032

3fed790a
13693378

cb4875a2


71126969

68f1da1e
1b5e6fc9
d8b156ec
cb4875a2


71126969


b38f3161


1b5e6fc9
754c804d


2cde4f34

1b5e6fc9
2cde4f34


754c804d
2cde4f34
1b5e6fc9
754c804d
2cde4f34
1b5e6fc9
2cde4f34
742e5b25
2cde4f34
754c804d

1b5e6fc9
79aec952
1ff8dbeb
71126969

79aec952
73275e18

79aec952


258b1a74
a33fa270
258b1a74
6949ce97
258b1a74
6949ce97
258b1a74


1b5e6fc9
258b1a74
1b5e6fc9
258b1a74


5e320831

080be885
bc609c55


080be885
bc609c55


bc609c55


080be885


93b3237c
a521843f
93b3237c

a521843f
93b3237c

e9dcfb0b
93b3237c


3ae88377
93b3237c
e9dcfb0b


34b5eca1
e9dcfb0b

a521843f
93b3237c
a521843f

9cc7402c
607f3972
9cc7402c


421dcf4c


9cc7402c

22b4d1b2
9cc7402c


6949ce97
e5ae5955
9cc7402c
342ca948
607f3972
607f3972
e3ea90e9
5fb89530
607f3972
5fb89530
607f3972

22b4d1b2


22b4d1b2


9547c456


99ec6702


9547c456

1ff8dbeb
5e320831

258b1a74
6949ce97
258b1a74
5e320831


a33fa270

2e7067fb
3fed790a
e902ce1a
3fed790a

62822ffd
59b5e950
1b5e6fc9
89b794f1
59b5e950
ae5a6a23
89b794f1

258b1a74
c50cd646
147830d1


c50cd646

080be885
bc609c55


09276cb9
57e6827c
aa6de494
09276cb9
93b3237c
57e6827c
93b3237c
ff9039b2
7887045a


93b3237c


0c69d5fd
93b3237c
0c69d5fd
93b3237c

3fcd6292
93b3237c


0c69d5fd
93b3237c


57e6827c
7ea3d950
54e3637d
93b3237c


54e3637d
d5d1a08b


9c64edf1
2f64c56e

9c64edf1
2f64c56e


1b5e6fc9
895c0834

34a81fd6
b47d5932
895c0834
b47d5932
895c0834

34a81fd6
895c0834


1b5e6fc9
895c0834


258b1a74

1b5e6fc9
258b1a74


1ff8dbeb
258b1a74
1ff8dbeb
258b1a74


2e7067fb
3fed790a
e902ce1a
3fed790a

62822ffd
89b794f1
1b5e6fc9
89b794f1
59b5e950
258b1a74
89b794f1

1b5e6fc9
e5ae5955

86495dfc
e5ae5955


1b5e6fc9
e5ae5955


b38f3161

70d70e78


b38f3161

cad33793


080be885

cad33793


1b5e6fc9
64a4d77c
86495dfc
64a4d77c

258b1a74
c560a623
6db9fd49
258b1a74


c560a623

93b3237c
c560a623
93b3237c

fa987e0a
93b3237c
c3c3cccb
93b3237c


fa987e0a
93b3237c
c560a623

9cc7402c

06965458


9cc7402c

06965458
2e72bd16
06965458


59ea19b3
06965458


69ff61d1

06965458

69ff61d1
06965458

9cc7402c

1ff8dbeb
f4d1acc5
a2796c3d
258b1a74
f4d1acc5


080be885
bc609c55
080be885


36a90289


080be885


bc609c55

e2d6e34f


86495dfc
e2d6e34f


3ae88377
e2d6e34f


1b5e6fc9
c560a623
86495dfc
02595abf

c560a623

cad33793


86495dfc
cad33793


080be885


a2796c3d


1b5e6fc9
34a81fd6
1b5e6fc9
a2796c3d


59ea19b3

06965458
59ea19b3
38f9667e
59ea19b3
eb5b18e8
06965458


eb5b18e8

06965458
06965458
eb5b18e8
06965458

59ea19b3

f112377d
c3a9ae0b
a5d12b87
c3a9ae0b

2e7067fb
3fed790a
e902ce1a
3fed790a

c3a9ae0b

1b5e6fc9
c3a9ae0b


1b5e6fc9
7f64584b
e6098f00
7f64584b


258b1a74
c3a9ae0b
6db9fd49
c3a9ae0b

080be885
bc609c55


e6098f00


012e3294

20c2ca39
012e3294

22318c0c
fbd39323
22318c0c
1b5e6fc9
fbd39323
1b5e6fc9
fbd39323


475b8188
fbd39323

039b2a76


ece9afef
039b2a76
ece9afef

039b2a76
ece9afef
039b2a76
039b2a76


2e7067fb
3fed790a
da178d96
3fed790a

a5d12b87


039b2a76
a5d12b87

039b2a76
7ebd536e

a5d12b87


80980309
a5d12b87


039b2a76
7ebd536e
a5d12b87


039b2a76
7ebd536e
039b2a76

f25aa0c6


039b2a76


b11e39e2
039b2a76
b11e39e2
7ebd536e
b11e39e2
dcc16c81
b11e39e2

dcc16c81
7ebd536e
039b2a76
7ebd536e

d1e05ac4
7123f252
2a9ba937
04190798
a2715c5f
2a9ba937


1b5e6fc9
5c7359aa
917dd28e

5c7359aa
1b5e6fc9
5c7359aa
917dd28e

5c7359aa
a2715c5f

3cc04923
c7cb00d4


3cc04923
34a81fd6
c6fcb855
fb1cf35f
ec7a9bf9
6f38bfeb
fb1cf35f
917dd28e

1b5e6fc9
fb1cf35f
6f38bfeb
fb1cf35f
1ff8dbeb
44e8dfd3
1ff8dbeb
1b5e6fc9
917dd28e

fb1cf35f


ec7a9bf9
8cd3d4b4
724ee769

86495dfc
c3c3cccb

1b5e6fc9
724ee769
1ff8dbeb


4da20bdf


917dd28e
724ee769
c3c3cccb
724ee769


917dd28e
1ff8dbeb


917dd28e
724ee769
3cc04923

9c64edf1
c7cb00d4


4a6ed843
1b5e6fc9
4a6ed843
917dd28e

4a6ed843
4a6ed843

cc8583ec
7123f252
2a9ba937
cc8583ec
925d6741
7123f252
cc8583ec


7123f252
2c14a968


cc8583ec


7123f252
2c14a968


cc8583ec


9c64edf1


a26a5f20
9c64edf1
b25f0c52

9c64edf1


a26a5f20

9c64edf1
b25f0c52
9c64edf1


7123f252
9c64edf1
a26a5f20
9c64edf1


5fb89530
93b3237c


cc2f71e4


82f512a7


cc2f71e4


93b3237c


2e7067fb
3fed790a

7123f252


7123f252
6d37f30d
7123f252

7ca0aaaf
7123f252


ed52f422
7123f252


fb4d01e2
7123f252


7cf36331
7123f252

dea7b864
d56acb68


9328ea4c
3fed790a
93be0dd9
da178d96
3fed790a
7159944f
3fed790a
7159944f
3fed790a
da178d96
3fed790a


62822ffd
59b5e950
1b5e6fc9
59b5e950
ad7a63f8
c0591191
1b32cdcf
c0591191
7f415da8
a2715c5f
59b5e950

767ec1d6

d0461c49

767ec1d6


c0591191


f112377d
f21f794f
f112377d
f21f794f


f112377d
f47e6e90
4407a13c
f47e6e90


080be885
ec31d087
7123f252
ec31d087


258b1a74
c560a623
a2715c5f

258b1a74
2c14a968
93be0dd9

7123f252
2c14a968


c560a623

cc8583ec


1b5e6fc9
7f64584b
7123f252
cc8583ec

80980309
cc8583ec


7123f252
cc8583ec
7123f252
cc8583ec

80980309
7f64584b

1b5e6fc9
f30dc68c
7123f252

e7528c6a

7123f252
e7528c6a

ec022783
3dcf089c


3dcf089c
ec022783
3dcf089c


7ca0aaaf
3dcf089c

7cf36331
3dcf089c
a521843f
3dcf089c


ec022783


93b3237c

ec022783


9cc7402c
a3d829d0
9cc7402c


a3d829d0


d7d5b820
37a0234c
9cc7402c
342ca948

8125f93b
37a0234c
d7d5b820
37a0234c
9cc7402c
342ca948

8125f93b
37a0234c
b2daa5a9


9c64edf1
1b32cdcf


79e84a8f

9c64edf1
a3d829d0

93b3237c
ec022783
7123f252
f30dc68c
7123f252

6d37f30d
7123f252

7ca0aaaf
93b3237c
e5514bec
58f7a27e

fd1f8ab3
58f7a27e

d70ff5f8
962531af
2a9ba937
962531af


7123f252
962531af
a26a5f20
79e84a8f
962531af


7123f252
e5514bec


7123f252
e5514bec
a26a5f20
79e84a8f
e5514bec

93b3237c
e5514bec
93b3237c

f30dc68c
93b3237c
f30dc68c


dd173f83


7123f252
dd173f83


6f19559d
cc8583ec
7123f252
ec31d087
62492b67

cc8583ec

f9e52c9d
0c69d5fd
f9e52c9d


93b3237c
0c69d5fd

1b5e6fc9
0c69d5fd

5fb89530
0c69d5fd

1b5e6fc9
0c69d5fd


3fcd6292
0c69d5fd


c0591191


dba5ffc2

7123f252
dba5ffc2
6d37f30d
7123f252

7ca0aaaf
7123f252


dba5ffc2


bc609c55
24d7bdd3
bc609c55
d4e44ecb
45534587


45534587


bc609c55
080be885
9cc7402c
a6d08950
080be885

701b34fb
080be885


24d7bdd3

0c69d5fd

aefb6e5f
0c69d5fd

f39763e9

aa94000a

f39763e9
ed52f422
7123f252


dac0029d


9328ea4c

f39763e9

a5d32e48
307a83e1


adb43456
307a83e1


ec022783

88536f90


1087d34a

7123f252
88536f90
a26a5f20
79e84a8f
88536f90
93b3237c

88536f90
ec022783

93b3237c
8639cf8e
003359a0


fd1a01bb


a689152c
fd1a01bb


7123f252
7ea3d950


7123f252
7ea3d950
7123f252
7ea3d950

8639cf8e
fd1a01bb
cc2f71e4
8639cf8e
754a9925
7123f252
8639cf8e
a26a5f20
79e84a8f
8639cf8e
93b3237c

8639cf8e


da178d96
93b3237c
2d9c4074

93b3237c


1b5e6fc9
005100c4
04190798
005100c4
1b5e6fc9
005100c4


23c41420


7ca0aaaf
23c41420

ed52f422
23c41420


2e7067fb
3fed790a
da178d96
3fed790a

62822ffd
59b5e950
1b5e6fc9
59b5e950


258b1a74
c560a623
1b5e6fc9
c560a623

080be885
bc609c55
080be885
bc609c55

2e7067fb
3fed790a
da178d96
3fed790a

62822ffd
59b5e950
1b5e6fc9
59b5e950

1b5e6fc9
59b5e950
89b794f1
1b5e6fc9
7f64584b
80980309
7f64584b

976c380b


93b3237c
6e111d5d
93b3237c

6e111d5d
93b3237c
54e3637d


93b3237c
7ea3d950
eecc26de
7ea3d950


54e3637d
e7f40863
54e3637d


e7f40863
6e111d5d
93b3237c


6e111d5d

941c77c8


1b5e6fc9

34a81fd6
941c77c8


1b5e6fc9
7f64584b
80980309
7f64584b

2e7067fb
3fed790a
da178d96
3fed790a

941c77c8

1b5e6fc9
941c77c8


258b1a74
941c77c8


258b1a74
941c77c8

6e111d5d
2e7067fb
3fed790a
e902ce1a
3fed790a

603dc580
6e6b85b5
603dc580


93b3237c

2e7067fb
3fed790a


d56acb68

3fed790a


93b3237c


6e6b85b5

3ef75bae
93b3237c
12aaca16
9b2a255c
aa94000a
9b2a255c


cddceb2b
3ef75bae
93b3237c
12aaca16
9b2a255c

1ff8dbeb
9b2a255c
cddceb2b
3ef75bae
93b3237c
12aaca16
9b2a255c
cddceb2b
d56acb68


9328ea4c


d56acb68

6e6b85b5
80980309
6e6b85b5


258b1a74
6e6b85b5


3ef75bae
6e6b85b5
3ef75bae
6e6b85b5
3ef75bae
6e6b85b5
d56acb68

6e6b85b5
80980309
6e6b85b5


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
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415

  
/*
    This file is part of solidity.

    solidity 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.

    solidity 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 solidity.  If not, see <http://www.gnu.org/licenses/>.
*/
/**
 * @author Christian <c@ethdev.com>
 * @date 2014
 * Solidity data types
 */

#include <libsolidity/ast/Types.h>

#include <libsolidity/ast/AST.h>

#include <libdevcore/CommonIO.h>
#include <libdevcore/CommonData.h>
#include <libdevcore/SHA3.h>
#include <libdevcore/UTF8.h>
#include <libdevcore/Algorithms.h>

#include <boost/algorithm/string/join.hpp>
#include <boost/algorithm/string/replace.hpp>
#include <boost/algorithm/string/predicate.hpp>
#include <boost/algorithm/string/classification.hpp>
#include <boost/algorithm/string/split.hpp>
#include <boost/range/adaptor/reversed.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/range/adaptor/sliced.hpp>
#include <boost/range/adaptor/transformed.hpp>
#include <boost/algorithm/string.hpp>

#include <limits>

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

namespace
{

unsigned int mostSignificantBit(bigint const& _number)
{
#if BOOST_VERSION < 105500
    solAssert(_number > 0, "");
    bigint number = _number;
    unsigned int result = 0;
    while (number != 0)
    {
        number >>= 1;
        ++result;
    }
    return --result;
#else
    return boost::multiprecision::msb(_number);
#endif
}

/// Check whether (_base ** _exp) fits into 4096 bits.
bool fitsPrecisionExp(bigint const& _base, bigint const& _exp)
{
    if (_base == 0)
        return true;

    solAssert(_base > 0, "");

    size_t const bitsMax = 4096;

    unsigned mostSignificantBaseBit = mostSignificantBit(_base);
    if (mostSignificantBaseBit == 0) // _base == 1
        return true;
    if (mostSignificantBaseBit > bitsMax) // _base >= 2 ^ 4096
        return false;

    bigint bitsNeeded = _exp * (mostSignificantBaseBit + 1);

    return bitsNeeded <= bitsMax;
}

/// Checks whether _mantissa * (X ** _exp) fits into 4096 bits,
/// where X is given indirectly via _log2OfBase = log2(X).
bool fitsPrecisionBaseX(
    bigint const& _mantissa,
    double _log2OfBase,
    uint32_t _exp
)
{
    if (_mantissa == 0)
        return true;

    solAssert(_mantissa > 0, "");

    size_t const bitsMax = 4096;

    unsigned mostSignificantMantissaBit = mostSignificantBit(_mantissa);
    if (mostSignificantMantissaBit > bitsMax) // _mantissa >= 2 ^ 4096
        return false;

    bigint bitsNeeded = mostSignificantMantissaBit + bigint(floor(double(_exp) * _log2OfBase)) + 1;
    return bitsNeeded <= bitsMax;
}

/// Checks whether _mantissa * (10 ** _expBase10) fits into 4096 bits.
bool fitsPrecisionBase10(bigint const& _mantissa, uint32_t _expBase10)
{
    double const log2Of10AwayFromZero = 3.3219280948873624;
    return fitsPrecisionBaseX(_mantissa, log2Of10AwayFromZero, _expBase10);
}

/// Checks whether _mantissa * (2 ** _expBase10) fits into 4096 bits.
bool fitsPrecisionBase2(bigint const& _mantissa, uint32_t _expBase2)
{
    return fitsPrecisionBaseX(_mantissa, 1.0, _expBase2);
}

}

void StorageOffsets::computeOffsets(TypePointers const& _types)
{
    bigint slotOffset = 0;
    unsigned byteOffset = 0;
    map<size_t, pair<u256, unsigned>> offsets;
    for (size_t i = 0; i < _types.size(); ++i)
    {
        TypePointer const& type = _types[i];
        if (!type->canBeStored())
            continue;
        if (byteOffset + type->storageBytes() > 32)
        {
            // would overflow, go to next slot
            ++slotOffset;
            byteOffset = 0;
        }
        if (slotOffset >= bigint(1) << 256)
            BOOST_THROW_EXCEPTION(Error(Error::Type::TypeError) << errinfo_comment("Object too large for storage."));
        offsets[i] = make_pair(u256(slotOffset), byteOffset);
        solAssert(type->storageSize() >= 1, "Invalid storage size.");
        if (type->storageSize() == 1 && byteOffset + type->storageBytes() <= 32)
            byteOffset += type->storageBytes();
        else
        {
            slotOffset += type->storageSize();
            byteOffset = 0;
        }
    }
    if (byteOffset > 0)
        ++slotOffset;
    if (slotOffset >= bigint(1) << 256)
        BOOST_THROW_EXCEPTION(Error(Error::Type::TypeError) << errinfo_comment("Object too large for storage."));
    m_storageSize = u256(slotOffset);
    swap(m_offsets, offsets);
}

pair<u256, unsigned> const* StorageOffsets::offset(size_t _index) const
{
    if (m_offsets.count(_index))
        return &m_offsets.at(_index);
    else
        return nullptr;
}

void MemberList::combine(MemberList const & _other)
{
    m_memberTypes += _other.m_memberTypes;
}

pair<u256, unsigned> const* MemberList::memberStorageOffset(string const& _name) const
{
    if (!m_storageOffsets)
    {
        TypePointers memberTypes;
        memberTypes.reserve(m_memberTypes.size());
        for (auto const& member: m_memberTypes)
            memberTypes.push_back(member.type);
        m_storageOffsets.reset(new StorageOffsets());
        m_storageOffsets->computeOffsets(memberTypes);
    }
    for (size_t index = 0; index < m_memberTypes.size(); ++index)
        if (m_memberTypes[index].name == _name)
            return m_storageOffsets->offset(index);
    return nullptr;
}

u256 const& MemberList::storageSize() const
{
    // trigger lazy computation
    memberStorageOffset("");
    return m_storageOffsets->storageSize();
}

/// Helper functions for type identifier
namespace
{

string parenthesizeIdentifier(string const& _internal)
{
    return "(" + _internal + ")";
}

template <class Range>
string identifierList(Range const&& _list)
{
    return parenthesizeIdentifier(boost::algorithm::join(_list, ","));
}

string richIdentifier(TypePointer const& _type)
{
    return _type ? _type->richIdentifier() : "";
}

string identifierList(vector<TypePointer> const& _list)
{
    return identifierList(_list | boost::adaptors::transformed(richIdentifier));
}

string identifierList(TypePointer const& _type)
{
    return parenthesizeIdentifier(richIdentifier(_type));
}

string identifierList(TypePointer const& _type1, TypePointer const& _type2)
{
    TypePointers list;
    list.push_back(_type1);
    list.push_back(_type2);
    return identifierList(list);
}

string parenthesizeUserIdentifier(string const& _internal)
{
    return parenthesizeIdentifier(_internal);
}

}

string Type::escapeIdentifier(string const& _identifier)
{
    string ret = _identifier;
    // FIXME: should be _$$$_
    boost::algorithm::replace_all(ret, "$", "$$$");
    boost::algorithm::replace_all(ret, ",", "_$_");
    boost::algorithm::replace_all(ret, "(", "$_");
    boost::algorithm::replace_all(ret, ")", "_$");
    return ret;
}

string Type::identifier() const
{
    string ret = escapeIdentifier(richIdentifier());
    solAssert(ret.find_first_of("0123456789") != 0, "Identifier cannot start with a number.");
    solAssert(
        ret.find_first_not_of("0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMONPQRSTUVWXYZ_$") == string::npos,
        "Identifier contains invalid characters."
    );
    return ret;
}

TypePointer Type::fromElementaryTypeName(ElementaryTypeNameToken const& _type)
{
    solAssert(TokenTraits::isElementaryTypeName(_type.token()),
        "Expected an elementary type name but got " + _type.toString()
    );

    Token token = _type.token();
    unsigned m = _type.firstNumber();
    unsigned n = _type.secondNumber();

    switch (token)
    {
    case Token::IntM:
        return make_shared<IntegerType>(m, IntegerType::Modifier::Signed);
    case Token::UIntM:
        return make_shared<IntegerType>(m, IntegerType::Modifier::Unsigned);
    case Token::BytesM:
        return make_shared<FixedBytesType>(m);
    case Token::FixedMxN:
        return make_shared<FixedPointType>(m, n, FixedPointType::Modifier::Signed);
    case Token::UFixedMxN:
        return make_shared<FixedPointType>(m, n, FixedPointType::Modifier::Unsigned);
    case Token::Int:
        return make_shared<IntegerType>(256, IntegerType::Modifier::Signed);
    case Token::UInt:
        return make_shared<IntegerType>(256, IntegerType::Modifier::Unsigned);
    case Token::Fixed:
        return make_shared<FixedPointType>(128, 18, FixedPointType::Modifier::Signed);
    case Token::UFixed:
        return make_shared<FixedPointType>(128, 18, FixedPointType::Modifier::Unsigned);
    case Token::Byte:
        return make_shared<FixedBytesType>(1);
    case Token::Address:
        return make_shared<AddressType>(StateMutability::NonPayable);
    case Token::Bool:
        return make_shared<BoolType>();
    case Token::Bytes:
        return make_shared<ArrayType>(DataLocation::Storage);
    case Token::String:
        return make_shared<ArrayType>(DataLocation::Storage, true);
    //no types found
    default:
        solAssert(
            false,
            "Unable to convert elementary typename " + _type.toString() + " to type."
        );
    }
}

TypePointer Type::fromElementaryTypeName(string const& _name)
{
    vector<string> nameParts;
    boost::split(nameParts, _name, boost::is_any_of(" "));
    solAssert(nameParts.size() == 1 || nameParts.size() == 2, "Cannot parse elementary type: " + _name);
    Token token;
    unsigned short firstNum, secondNum;
    tie(token, firstNum, secondNum) = TokenTraits::fromIdentifierOrKeyword(nameParts[0]);
    auto t = fromElementaryTypeName(ElementaryTypeNameToken(token, firstNum, secondNum));
    if (auto* ref = dynamic_cast<ReferenceType const*>(t.get()))
    {
        DataLocation location = DataLocation::Storage;
        if (nameParts.size() == 2)
        {
            if (nameParts[1] == "storage")
                location = DataLocation::Storage;
            else if (nameParts[1] == "calldata")
                location = DataLocation::CallData;
            else if (nameParts[1] == "memory")
                location = DataLocation::Memory;
            else
                solAssert(false, "Unknown data location: " + nameParts[1]);
        }
        return ref->copyForLocation(location, true);
    }
    else if (t->category() == Type::Category::Address)
    {
        if (nameParts.size() == 2)
        {
            if (nameParts[1] == "payable")
                return make_shared<AddressType>(StateMutability::Payable);
            else
                solAssert(false, "Invalid state mutability for address type: " + nameParts[1]);
        }
        return make_shared<AddressType>(StateMutability::NonPayable);
    }
    else
    {
        solAssert(nameParts.size() == 1, "Storage location suffix only allowed for reference types");
        return t;
    }
}

TypePointer Type::forLiteral(Literal const& _literal)
{
    switch (_literal.token())
    {
    case Token::TrueLiteral:
    case Token::FalseLiteral:
        return make_shared<BoolType>();
    case Token::Number:
        return RationalNumberType::forLiteral(_literal);
    case Token::StringLiteral:
        return make_shared<StringLiteralType>(_literal);
    default:
        return TypePointer();
    }
}

TypePointer Type::commonType(TypePointer const& _a, TypePointer const& _b)
{
    if (!_a || !_b)
        return TypePointer();
    else if (_a->mobileType() && _b->isImplicitlyConvertibleTo(*_a->mobileType()))
        return _a->mobileType();
    else if (_b->mobileType() && _a->isImplicitlyConvertibleTo(*_b->mobileType()))
        return _b->mobileType();
    else
        return TypePointer();
}

MemberList const& Type::members(ContractDefinition const* _currentScope) const
{
    if (!m_members[_currentScope])
    {
        MemberList::MemberMap members = nativeMembers(_currentScope);
        if (_currentScope)
            members += boundFunctions(*this, *_currentScope);
        m_members[_currentScope] = unique_ptr<MemberList>(new MemberList(move(members)));
    }
    return *m_members[_currentScope];
}

TypePointer Type::fullEncodingType(bool _inLibraryCall, bool _encoderV2, bool _packed) const
{
    TypePointer encodingType = mobileType();
    if (encodingType)
        encodingType = encodingType->interfaceType(_inLibraryCall);
    if (encodingType)
        encodingType = encodingType->encodingType();
    // Structs are fine in the following circumstances:
    // - ABIv2 without packed encoding or,
    // - storage struct for a library
    if (_inLibraryCall && encodingType->dataStoredIn(DataLocation::Storage))
        return encodingType;
    TypePointer baseType = encodingType;
    while (auto const* arrayType = dynamic_cast<ArrayType const*>(baseType.get()))
        baseType = arrayType->baseType();
    if (dynamic_cast<StructType const*>(baseType.get()))
        if (!_encoderV2 || _packed)
            return TypePointer();
    return encodingType;
}

MemberList::MemberMap Type::boundFunctions(Type const& _type, ContractDefinition const& _scope)
{
    // Normalise data location of type.
    TypePointer type = ReferenceType::copyForLocationIfReference(DataLocation::Storage, _type.shared_from_this());
    set<Declaration const*> seenFunctions;
    MemberList::MemberMap members;
    for (ContractDefinition const* contract: _scope.annotation().linearizedBaseContracts)
        for (UsingForDirective const* ufd: contract->usingForDirectives())
        {
            if (ufd->typeName() && *type != *ReferenceType::copyForLocationIfReference(
                DataLocation::Storage,
                ufd->typeName()->annotation().type
            ))
                continue;
            auto const& library = dynamic_cast<ContractDefinition const&>(
                *ufd->libraryName().annotation().referencedDeclaration
            );
            for (FunctionDefinition const* function: library.definedFunctions())
            {
                if (!function->isVisibleAsLibraryMember() || seenFunctions.count(function))
                    continue;
                seenFunctions.insert(function);
                FunctionType funType(*function, false);
                if (auto fun = funType.asMemberFunction(true, true))
                    if (_type.isImplicitlyConvertibleTo(*fun->selfType()))
                        members.push_back(MemberList::Member(function->name(), fun, function));
            }
        }
    return members;
}

AddressType::AddressType(StateMutability _stateMutability):
    m_stateMutability(_stateMutability)
{
    solAssert(m_stateMutability == StateMutability::Payable || m_stateMutability == StateMutability::NonPayable, "");
}

string AddressType::richIdentifier() const
{
    if (m_stateMutability == StateMutability::Payable)
        return "t_address_payable";
    else
        return "t_address";
}

bool AddressType::isImplicitlyConvertibleTo(Type const& _other) const
{
    if (_other.category() != category())
        return false;
    AddressType const& other = dynamic_cast<AddressType const&>(_other);

    return other.m_stateMutability <= m_stateMutability;
}

bool AddressType::isExplicitlyConvertibleTo(Type const& _convertTo) const
{
    if (auto const* contractType = dynamic_cast<ContractType const*>(&_convertTo))
        return (m_stateMutability >= StateMutability::Payable) || !contractType->isPayable();
    return isImplicitlyConvertibleTo(_convertTo) ||
           _convertTo.category() == Category::Integer ||
           (_convertTo.category() == Category::FixedBytes && 160 == dynamic_cast<FixedBytesType const&>(_convertTo).numBytes() * 8);
}

string AddressType::toString(bool) const
{
    if (m_stateMutability == StateMutability::Payable)
        return "address payable";
    else
        return "address";
}

string AddressType::canonicalName() const
{
    return "address";
}

u256 AddressType::literalValue(Literal const* _literal) const
{
    solAssert(_literal, "");
    solAssert(_literal->value().substr(0, 2) == "0x", "");
    return u256(_literal->valueWithoutUnderscores());
}

TypePointer AddressType::unaryOperatorResult(Token _operator) const
{
    return _operator == Token::Delete ? make_shared<TupleType>() : TypePointer();
}


TypePointer AddressType::binaryOperatorResult(Token _operator, TypePointer const& _other) const
{
    // Addresses can only be compared.
    if (!TokenTraits::isCompareOp(_operator))
        return TypePointer();

    return Type::commonType(shared_from_this(), _other);
}

bool AddressType::operator==(Type const& _other) const
{
    if (_other.category() != category())
        return false;
    AddressType const& other = dynamic_cast<AddressType const&>(_other);
    return other.m_stateMutability == m_stateMutability;
}

MemberList::MemberMap AddressType::nativeMembers(ContractDefinition const*) const
{
    MemberList::MemberMap members = {
        {"balance", make_shared<IntegerType>(256)},
        {"call", make_shared<FunctionType>(strings{"bytes memory"}, strings{"bool", "bytes memory"}, FunctionType::Kind::BareCall, false, StateMutability::Payable)},
        {"callcode", make_shared<FunctionType>(strings{"bytes memory"}, strings{"bool", "bytes memory"}, FunctionType::Kind::BareCallCode, false, StateMutability::Payable)},
        {"delegatecall", make_shared<FunctionType>(strings{"bytes memory"}, strings{"bool", "bytes memory"}, FunctionType::Kind::BareDelegateCall, false)},
        {"staticcall", make_shared<FunctionType>(strings{"bytes memory"}, strings{"bool", "bytes memory"}, FunctionType::Kind::BareStaticCall, false, StateMutability::View)}
    };
    if (m_stateMutability == StateMutability::Payable)
    {
        members.emplace_back(MemberList::Member{"send", make_shared<FunctionType>(strings{"uint"}, strings{"bool"}, FunctionType::Kind::Send)});
        members.emplace_back(MemberList::Member{"transfer", make_shared<FunctionType>(strings{"uint"}, strings(), FunctionType::Kind::Transfer)});
    }
    return members;
}

namespace
{

bool isValidShiftAndAmountType(Token _operator, Type const& _shiftAmountType)
{
    // Disable >>> here.
    if (_operator == Token::SHR)
        return false;
    else if (IntegerType const* otherInt = dynamic_cast<decltype(otherInt)>(&_shiftAmountType))
        return true;
    else if (RationalNumberType const* otherRat = dynamic_cast<decltype(otherRat)>(&_shiftAmountType))
        return !otherRat->isFractional() && otherRat->integerType() && !otherRat->integerType()->isSigned();
    else
        return false;
}

}

IntegerType::IntegerType(unsigned _bits, IntegerType::Modifier _modifier):
    m_bits(_bits), m_modifier(_modifier)
{
    solAssert(
        m_bits > 0 && m_bits <= 256 && m_bits % 8 == 0,
        "Invalid bit number for integer type: " + dev::toString(m_bits)
    );
}

string IntegerType::richIdentifier() const
{
    return "t_" + string(isSigned() ? "" : "u") + "int" + to_string(numBits());
}

bool IntegerType::isImplicitlyConvertibleTo(Type const& _convertTo) const
{
    if (_convertTo.category() == category())
    {
        IntegerType const& convertTo = dynamic_cast<IntegerType const&>(_convertTo);
        if (convertTo.m_bits < m_bits)
            return false;
        else if (isSigned())
            return convertTo.isSigned();
        else
            return !convertTo.isSigned() || convertTo.m_bits > m_bits;
    }
    else if (_convertTo.category() == Category::FixedPoint)
    {
        FixedPointType const& convertTo = dynamic_cast<FixedPointType const&>(_convertTo);
        return maxValue() <= convertTo.maxIntegerValue() && minValue() >= convertTo.minIntegerValue();
    }
    else
        return false;
}

bool IntegerType::isExplicitlyConvertibleTo(Type const& _convertTo) const
{
    return _convertTo.category() == category() ||
        _convertTo.category() == Category::Address ||
        _convertTo.category() == Category::Contract ||
        _convertTo.category() == Category::Enum ||
        (_convertTo.category() == Category::FixedBytes && numBits() == dynamic_cast<FixedBytesType const&>(_convertTo).numBytes() * 8) ||
        _convertTo.category() == Category::FixedPoint;
}

TypePointer IntegerType::unaryOperatorResult(Token _operator) const
{
    // "delete" is ok for all integer types
    if (_operator == Token::Delete)
        return make_shared<TupleType>();
    // we allow +, -, ++ and --
    else if (_operator == Token::Add || _operator == Token::Sub ||
            _operator == Token::Inc || _operator == Token::Dec ||
            _operator == Token::BitNot)
        return shared_from_this();
    else
        return TypePointer();
}

bool IntegerType::operator==(Type const& _other) const
{
    if (_other.category() != category())
        return false;
    IntegerType const& other = dynamic_cast<IntegerType const&>(_other);
    return other.m_bits == m_bits && other.m_modifier == m_modifier;
}

string IntegerType::toString(bool) const
{
    string prefix = isSigned() ? "int" : "uint";
    return prefix + dev::toString(m_bits);
}

bigint IntegerType::minValue() const
{
    if (isSigned())
        return -(bigint(1) << (m_bits - 1));
    else
        return bigint(0);
}

bigint IntegerType::maxValue() const
{
    if (isSigned())
        return (bigint(1) << (m_bits - 1)) - 1;
    else
        return (bigint(1) << m_bits) - 1;
}

TypePointer IntegerType::binaryOperatorResult(Token _operator, TypePointer const& _other) const
{
    if (
        _other->category() != Category::RationalNumber &&
        _other->category() != Category::FixedPoint &&
        _other->category() != category()
    )
        return TypePointer();
    if (TokenTraits::isShiftOp(_operator))
    {
        // Shifts are not symmetric with respect to the type
        if (isValidShiftAndAmountType(_operator, *_other))
            return shared_from_this();
        else
            return TypePointer();
    }

    auto commonType = Type::commonType(shared_from_this(), _other); //might be an integer or fixed point
    if (!commonType)
        return TypePointer();

    // All integer types can be compared
    if (TokenTraits::isCompareOp(_operator))
        return commonType;
    if (TokenTraits::isBooleanOp(_operator))
        return TypePointer();
    if (auto intType = dynamic_pointer_cast<IntegerType const>(commonType))
    {
        // Signed EXP is not allowed
        if (Token::Exp == _operator && intType->isSigned())
            return TypePointer();
    }
    else if (auto fixType = dynamic_pointer_cast<FixedPointType const>(commonType))
        if (Token::Exp == _operator)
            return TypePointer();
    return commonType;
}

FixedPointType::FixedPointType(unsigned _totalBits, unsigned _fractionalDigits, FixedPointType::Modifier _modifier):
    m_totalBits(_totalBits), m_fractionalDigits(_fractionalDigits), m_modifier(_modifier)
{
    solAssert(
        8 <= m_totalBits && m_totalBits <= 256 && m_totalBits % 8 == 0 && m_fractionalDigits <= 80,
        "Invalid bit number(s) for fixed type: " +
        dev::toString(_totalBits) + "x" + dev::toString(_fractionalDigits)
    );
}

string FixedPointType::richIdentifier() const
{
    return "t_" + string(isSigned() ? "" : "u") + "fixed" + to_string(m_totalBits) + "x" + to_string(m_fractionalDigits);
}

bool FixedPointType::isImplicitlyConvertibleTo(Type const& _convertTo) const
{
    if (_convertTo.category() == category())
    {
        FixedPointType const& convertTo = dynamic_cast<FixedPointType const&>(_convertTo);
        if (convertTo.numBits() < m_totalBits || convertTo.fractionalDigits() < m_fractionalDigits)
            return false;
        else
            return convertTo.maxIntegerValue() >= maxIntegerValue() && convertTo.minIntegerValue() <= minIntegerValue();
    }
    return false;
}

bool FixedPointType::isExplicitlyConvertibleTo(Type const& _convertTo) const
{
    return _convertTo.category() == category() || _convertTo.category() == Category::Integer;
}

TypePointer FixedPointType::unaryOperatorResult(Token _operator) const
{
    switch(_operator)
    {
    case Token::Delete:
        // "delete" is ok for all fixed types
        return make_shared<TupleType>();
    case Token::Add:
    case Token::Sub:
    case Token::Inc:
    case Token::Dec:
        // for fixed, we allow +, -, ++ and --
        return shared_from_this();
    default:
        return TypePointer();
    }
}

bool FixedPointType::operator==(Type const& _other) const
{
    if (_other.category() != category())
        return false;
    FixedPointType const& other = dynamic_cast<FixedPointType const&>(_other);
    return other.m_totalBits == m_totalBits && other.m_fractionalDigits == m_fractionalDigits && other.m_modifier == m_modifier;
}

string FixedPointType::toString(bool) const
{
    string prefix = isSigned() ? "fixed" : "ufixed";
    return prefix + dev::toString(m_totalBits) + "x" + dev::toString(m_fractionalDigits);
}

bigint FixedPointType::maxIntegerValue() const
{
    bigint maxValue = (bigint(1) << (m_totalBits - (isSigned() ? 1 : 0))) - 1;
    return maxValue / boost::multiprecision::pow(bigint(10), m_fractionalDigits);
}

bigint FixedPointType::minIntegerValue() const
{
    if (isSigned())
    {
        bigint minValue = -(bigint(1) << (m_totalBits - (isSigned() ? 1 : 0)));
        return minValue / boost::multiprecision::pow(bigint(10), m_fractionalDigits);
    }
    else
        return bigint(0);
}

TypePointer FixedPointType::binaryOperatorResult(Token _operator, TypePointer const& _other) const
{
    auto commonType = Type::commonType(shared_from_this(), _other);

    if (!commonType)
        return TypePointer();

    // All fixed types can be compared
    if (TokenTraits::isCompareOp(_operator))
        return commonType;
    if (TokenTraits::isBitOp(_operator) || TokenTraits::isBooleanOp(_operator) || _operator == Token::Exp)
        return TypePointer();
    return commonType;
}

std::shared_ptr<IntegerType> FixedPointType::asIntegerType() const
{
    return make_shared<IntegerType>(numBits(), isSigned() ? IntegerType::Modifier::Signed : IntegerType::Modifier::Unsigned);
}

tuple<bool, rational> RationalNumberType::parseRational(string const& _value)
{
    rational value;
    try
    {
        auto radixPoint = find(_value.begin(), _value.end(), '.');

        if (radixPoint != _value.end())
        {
            if (
                !all_of(radixPoint + 1, _value.end(), ::isdigit) ||
                !all_of(_value.begin(), radixPoint, ::isdigit)
            )
                return make_tuple(false, rational(0));

            // Only decimal notation allowed here, leading zeros would switch to octal.
            auto fractionalBegin = find_if_not(
                radixPoint + 1,
                _value.end(),
                [](char const& a) { return a == '0'; }
            );

            rational numerator;
            rational denominator(1);

            denominator = bigint(string(fractionalBegin, _value.end()));
            denominator /= boost::multiprecision::pow(
                bigint(10),
                distance(radixPoint + 1, _value.end())
            );
            numerator = bigint(string(_value.begin(), radixPoint));
            value = numerator + denominator;
        }
        else
            value = bigint(_value);
        return make_tuple(true, value);
    }
    catch (...)
    {
        return make_tuple(false, rational(0));
    }
}

TypePointer RationalNumberType::forLiteral(Literal const& _literal)
{
    solAssert(_literal.token() == Token::Number, "");
    tuple<bool, rational> validLiteral = isValidLiteral(_literal);
    if (get<0>(validLiteral))
    {
        TypePointer compatibleBytesType;
        if (_literal.isHexNumber())
        {
            size_t const digitCount = _literal.valueWithoutUnderscores().length() - 2;
            if (digitCount % 2 == 0 && (digitCount / 2) <= 32)
                compatibleBytesType = make_shared<FixedBytesType>(digitCount / 2);
        }

        return make_shared<RationalNumberType>(get<1>(validLiteral), compatibleBytesType);
    }
    return TypePointer();
}

tuple<bool, rational> RationalNumberType::isValidLiteral(Literal const& _literal)
{
    rational value;
    try
    {
        ASTString valueString = _literal.valueWithoutUnderscores();

        auto expPoint = find(valueString.begin(), valueString.end(), 'e');
        if (expPoint == valueString.end())
            expPoint = find(valueString.begin(), valueString.end(), 'E');

        if (boost::starts_with(valueString, "0x"))
        {
            // process as hex
            value = bigint(valueString);
        }
        else if (expPoint != valueString.end())
        {
            // Parse mantissa and exponent. Checks numeric limit.
            tuple<bool, rational> mantissa = parseRational(string(valueString.begin(), expPoint));

            if (!get<0>(mantissa))
                return make_tuple(false, rational(0));
            value = get<1>(mantissa);

            // 0E... is always zero.
            if (value == 0)
                return make_tuple(true, rational(0));

            bigint exp = bigint(string(expPoint + 1, valueString.end()));

            if (exp > numeric_limits<int32_t>::max() || exp < numeric_limits<int32_t>::min())
                return make_tuple(false, rational(0));

            uint32_t expAbs = bigint(abs(exp)).convert_to<uint32_t>();

            if (exp < 0)
            {
                if (!fitsPrecisionBase10(abs(value.denominator()), expAbs))
                    return make_tuple(false, rational(0));
                value /= boost::multiprecision::pow(
                    bigint(10),
                    expAbs
                );
            }
            else if (exp > 0)
            {
                if (!fitsPrecisionBase10(abs(value.numerator()), expAbs))
                    return make_tuple(false, rational(0));
                value *= boost::multiprecision::pow(
                    bigint(10),
                    expAbs
                );
            }
        }
        else
        {
            // parse as rational number
            tuple<bool, rational> tmp = parseRational(valueString);
            if (!get<0>(tmp))
                return tmp;
            value = get<1>(tmp);
        }
    }
    catch (...)
    {
        return make_tuple(false, rational(0));
    }
    switch (_literal.subDenomination())
    {
        case Literal::SubDenomination::None:
        case Literal::SubDenomination::Wei:
        case Literal::SubDenomination::Second:
            break;
        case Literal::SubDenomination::Szabo:
            value *= bigint("1000000000000");
            break;
        case Literal::SubDenomination::Finney:
            value *= bigint("1000000000000000");
            break;
        case Literal::SubDenomination::Ether:
            value *= bigint("1000000000000000000");
            break;
        case Literal::SubDenomination::Minute:
            value *= bigint("60");
            break;
        case Literal::SubDenomination::Hour:
            value *= bigint("3600");
            break;
        case Literal::SubDenomination::Day:
            value *= bigint("86400");
            break;
        case Literal::SubDenomination::Week:
            value *= bigint("604800");
            break;
        case Literal::SubDenomination::Year:
            value *= bigint("31536000");
            break;
    }


    return make_tuple(true, value);
}

bool RationalNumberType::isImplicitlyConvertibleTo(Type const& _convertTo) const
{
    switch (_convertTo.category())
    {
    case Category::Integer:
    {
        if (isFractional())
            return false;
        IntegerType const& targetType = dynamic_cast<IntegerType const&>(_convertTo);
        if (m_value == rational(0))
            return true;
        unsigned forSignBit = (targetType.isSigned() ? 1 : 0);
        if (m_value > rational(0))
        {
            if (m_value.numerator() <= (u256(-1) >> (256 - targetType.numBits() + forSignBit)))
                return true;
            return false;
        }
        if (targetType.isSigned())
        {
            if (-m_value.numerator() <= (u256(1) << (targetType.numBits() - forSignBit)))
                return true;
        }
        return false;
    }
    case Category::FixedPoint:
    {
        if (auto fixed = fixedPointType())
            return fixed->isImplicitlyConvertibleTo(_convertTo);
        return false;
    }
    case Category::FixedBytes:
        return (m_value == rational(0)) || (m_compatibleBytesType && *m_compatibleBytesType == _convertTo);
    default:
        return false;
    }
}

bool RationalNumberType::isExplicitlyConvertibleTo(Type const& _convertTo) const
{
    if (isImplicitlyConvertibleTo(_convertTo))
        return true;
    else if (_convertTo.category() != Category::FixedBytes)
    {
        TypePointer mobType = mobileType();
        return (mobType && mobType->isExplicitlyConvertibleTo(_convertTo));
    }
    else
        return false;
}

TypePointer RationalNumberType::unaryOperatorResult(Token _operator) const
{
    rational value;
    switch (_operator)
    {
    case Token::BitNot:
        if (isFractional())
            return TypePointer();
        value = ~m_value.numerator();
        break;
    case Token::Add:
        value = +(m_value);
        break;
    case Token::Sub:
        value = -(m_value);
        break;
    case Token::After:
        return shared_from_this();
    default:
        return TypePointer();
    }
    return make_shared<RationalNumberType>(value);
}

TypePointer RationalNumberType::binaryOperatorResult(Token _operator, TypePointer const& _other) const
{
    if (_other->category() == Category::Integer || _other->category() == Category::FixedPoint)
    {
        auto commonType = Type::commonType(shared_from_this(), _other);
        if (!commonType)
            return TypePointer();
        return commonType->binaryOperatorResult(_operator, _other);
    }
    else if (_other->category() != category())
        return TypePointer();

    RationalNumberType const& other = dynamic_cast<RationalNumberType const&>(*_other);
    if (TokenTraits::isCompareOp(_operator))
    {
        // Since we do not have a "BoolConstantType", we have to do the actual comparison
        // at runtime and convert to mobile typse first. Such a comparison is not a very common
        // use-case and will be optimized away.
        TypePointer thisMobile = mobileType();
        TypePointer otherMobile = other.mobileType();
        if (!thisMobile || !otherMobile)
            return TypePointer();
        return thisMobile->binaryOperatorResult(_operator, otherMobile);
    }
    else
    {
        rational value;
        bool fractional = isFractional() || other.isFractional();
        switch (_operator)
        {
        //bit operations will only be enabled for integers and fixed types that resemble integers
        case Token::BitOr:
            if (fractional)
                return TypePointer();
            value = m_value.numerator() | other.m_value.numerator();
            break;
        case Token::BitXor:
            if (fractional)
                return TypePointer();
            value = m_value.numerator() ^ other.m_value.numerator();
            break;
        case Token::BitAnd:
            if (fractional)
                return TypePointer();
            value = m_value.numerator() & other.m_value.numerator();
            break;
        case Token::Add:
            value = m_value + other.m_value;
            break;
        case Token::Sub:
            value = m_value - other.m_value;
            break;
        case Token::Mul:
            value = m_value * other.m_value;
            break;
        case Token::Div:
            if (other.m_value == rational(0))
                return TypePointer();
            else
                value = m_value / other.m_value;
            break;
        case Token::Mod:
            if (other.m_value == rational(0))
                return TypePointer();
            else if (fractional)
            {
                rational tempValue = m_value / other.m_value;
                value = m_value - (tempValue.numerator() / tempValue.denominator()) * other.m_value;
            }
            else
                value = m_value.numerator() % other.m_value.numerator();
            break;
        case Token::Exp:
        {
            if (other.isFractional())
                return TypePointer();
            solAssert(other.m_value.denominator() == 1, "");
            bigint const& exp = other.m_value.numerator();

            // x ** 0 = 1
            // for 0, 1 and -1 the size of the exponent doesn't have to be restricted
            if (exp == 0)
                value = 1;
            else if (m_value.numerator() == 0 || m_value == 1)
                value = m_value;
            else if (m_value == -1)
            {
                bigint isOdd = abs(exp) & bigint(1);
                value = 1 - 2 * isOdd.convert_to<int>();
            }
            else
            {
                if (abs(exp) > numeric_limits<uint32_t>::max())
                    return TypePointer(); // This will need too much memory to represent.

                uint32_t absExp = bigint(abs(exp)).convert_to<uint32_t>();

                // Limit size to 4096 bits
                if (!fitsPrecisionExp(abs(m_value.numerator()), absExp) || !fitsPrecisionExp(abs(m_value.denominator()), absExp))
                    return TypePointer();

                static auto const optimizedPow = [](bigint const& _base, uint32_t _exponent) -> bigint {
                    if (_base == 1)
                        return 1;
                    else if (_base == -1)
                        return 1 - 2 * int(_exponent & 1);
                    else
                        return boost::multiprecision::pow(_base, _exponent);
                };

                bigint numerator = optimizedPow(m_value.numerator(), absExp);
                bigint denominator = optimizedPow(m_value.denominator(), absExp);

                if (exp >= 0)
                    value = rational(numerator, denominator);
                else
                    // invert
                    value = rational(denominator, numerator);
            }
            break;
        }
        case Token::SHL:
        {
            if (fractional)
                return TypePointer();
            else if (other.m_value < 0)
                return TypePointer();
            else if (other.m_value > numeric_limits<uint32_t>::max())
                return TypePointer();
            if (m_value.numerator() == 0)
                value = 0;
            else
            {
                uint32_t exponent = other.m_value.numerator().convert_to<uint32_t>();
                if (!fitsPrecisionBase2(abs(m_value.numerator()), exponent))
                    return TypePointer();
                value = m_value.numerator() * boost::multiprecision::pow(bigint(2), exponent);
            }
            break;
        }
        // NOTE: we're using >> (SAR) to denote right shifting. The type of the LValue
        //       determines the resulting type and the type of shift (SAR or SHR).
        case Token::SAR:
        {
            if (fractional)
                return TypePointer();
            else if (other.m_value < 0)
                return TypePointer();
            else if (other.m_value > numeric_limits<uint32_t>::max())
                return TypePointer();
            if (m_value.numerator() == 0)
                value = 0;
            else
            {
                uint32_t exponent = other.m_value.numerator().convert_to<uint32_t>();
                if (exponent > mostSignificantBit(boost::multiprecision::abs(m_value.numerator())))
                    value = m_value.numerator() < 0 ? -1 : 0;
                else
                {
                    if (m_value.numerator() < 0)
                        // Add 1 to the negative value before dividing to get a result that is strictly too large,
                        // then subtract 1 afterwards to round towards negative infinity.
                        // This is the same algorithm as used in ExpressionCompiler::appendShiftOperatorCode(...).
                        // To see this note that for negative x, xor(x,all_ones) = (-x-1) and
                        // therefore xor(div(xor(x,all_ones), exp(2, shift_amount)), all_ones) is
                        // -(-x - 1) / 2^shift_amount - 1, which is the same as
                        // (x + 1) / 2^shift_amount - 1.
                        value = rational((m_value.numerator() + 1) / boost::multiprecision::pow(bigint(2), exponent) - bigint(1), 1);
                    else
                        value = rational(m_value.numerator() / boost::multiprecision::pow(bigint(2), exponent), 1);
                }
            }
            break;
        }
        default:
            return TypePointer();
        }

        // verify that numerator and denominator fit into 4096 bit after every operation
        if (value.numerator() != 0 && max(mostSignificantBit(abs(value.numerator())), mostSignificantBit(abs(value.denominator()))) > 4096)
            return TypePointer();

        return make_shared<RationalNumberType>(value);
    }
}

string RationalNumberType::richIdentifier() const
{
    // rational seemingly will put the sign always on the numerator,
    // but let just make it deterministic here.
    bigint numerator = abs(m_value.numerator());
    bigint denominator = abs(m_value.denominator());
    if (m_value < 0)
        return "t_rational_minus_" + numerator.str() + "_by_" + denominator.str();
    else
        return "t_rational_" + numerator.str() + "_by_" + denominator.str();
}

bool RationalNumberType::operator==(Type const& _other) const
{
    if (_other.category() != category())
        return false;
    RationalNumberType const& other = dynamic_cast<RationalNumberType const&>(_other);
    return m_value == other.m_value;
}

string RationalNumberType::bigintToReadableString(dev::bigint const& _num)
{
    string str = _num.str();
    if (str.size() > 32)
    {
        int omitted = str.size() - 8;
        str = str.substr(0, 4) + "...(" + to_string(omitted) + " digits omitted)..." + str.substr(str.size() - 4, 4);
    }
    return str;
}

string RationalNumberType::toString(bool) const
{
    if (!isFractional())
        return "int_const " + bigintToReadableString(m_value.numerator());

    string numerator = bigintToReadableString(m_value.numerator());
    string denominator = bigintToReadableString(m_value.denominator());
    return "rational_const " + numerator + " / " + denominator;
}

u256 RationalNumberType::literalValue(Literal const*) const
{
    // We ignore the literal and hope that the type was correctly determined to represent
    // its value.

    u256 value;
    bigint shiftedValue;

    if (!isFractional())
        shiftedValue = m_value.numerator();
    else
    {
        auto fixed = fixedPointType();
        solAssert(fixed, "Rational number cannot be represented as fixed point type.");
        int fractionalDigits = fixed->fractionalDigits();
        shiftedValue = m_value.numerator() * boost::multiprecision::pow(bigint(10), fractionalDigits) / m_value.denominator();
    }

    // we ignore the literal and hope that the type was correctly determined
    solAssert(shiftedValue <= u256(-1), "Number constant too large.");
    solAssert(shiftedValue >= -(bigint(1) << 255), "Number constant too small.");

    if (m_value >= rational(0))
        value = u256(shiftedValue);
    else
        value = s2u(s256(shiftedValue));
    return value;
}

TypePointer RationalNumberType::mobileType() const
{
    if (!isFractional())
        return integerType();
    else
        return fixedPointType();
}

shared_ptr<IntegerType const> RationalNumberType::integerType() const
{
    solAssert(!isFractional(), "integerType() called for fractional number.");
    bigint value = m_value.numerator();
    bool negative = (value < 0);
    if (negative) // convert to positive number of same bit requirements
        value = ((0 - value) - 1) << 1;
    if (value > u256(-1))
        return shared_ptr<IntegerType const>();
    else
        return make_shared<IntegerType>(
            max(bytesRequired(value), 1u) * 8,
            negative ? IntegerType::Modifier::Signed : IntegerType::Modifier::Unsigned
        );
}

shared_ptr<FixedPointType const> RationalNumberType::fixedPointType() const
{
    bool negative = (m_value < 0);
    unsigned fractionalDigits = 0;
    rational value = abs(m_value); // We care about the sign later.
    rational maxValue = negative ?
        rational(bigint(1) << 255, 1):
        rational((bigint(1) << 256) - 1, 1);

    while (value * 10 <= maxValue && value.denominator() != 1 && fractionalDigits < 80)
    {
        value *= 10;
        fractionalDigits++;
    }

    if (value > maxValue)
        return shared_ptr<FixedPointType const>();
    // This means we round towards zero for positive and negative values.
    bigint v = value.numerator() / value.denominator();

    if (negative && v != 0)
        // modify value to satisfy bit requirements for negative numbers:
        // add one bit for sign and decrement because negative numbers can be larger
        v = (v - 1) << 1;

    if (v > u256(-1))
        return shared_ptr<FixedPointType const>();

    unsigned totalBits = max(bytesRequired(v), 1u) * 8;
    solAssert(totalBits <= 256, "");

    return make_shared<FixedPointType>(
        totalBits, fractionalDigits,
        negative ? FixedPointType::Modifier::Signed : FixedPointType::Modifier::Unsigned
    );
}

StringLiteralType::StringLiteralType(Literal const& _literal):
    m_value(_literal.value())
{
}

bool StringLiteralType::isImplicitlyConvertibleTo(Type const& _convertTo) const
{
    if (auto fixedBytes = dynamic_cast<FixedBytesType const*>(&_convertTo))
        return size_t(fixedBytes->numBytes()) >= m_value.size();
    else if (auto arrayType = dynamic_cast<ArrayType const*>(&_convertTo))
        return
            arrayType->isByteArray() &&
            !(arrayType->dataStoredIn(DataLocation::Storage) && arrayType->isPointer()) &&
            !(arrayType->isString() && !isValidUTF8());
    else
        return false;
}

string StringLiteralType::richIdentifier() const
{
    // Since we have to return a valid identifier and the string itself may contain
    // anything, we hash it.
    return "t_stringliteral_" + toHex(keccak256(m_value).asBytes());
}

bool StringLiteralType::operator==(const Type& _other) const
{
    if (_other.category() != category())
        return false;
    return m_value == dynamic_cast<StringLiteralType const&>(_other).m_value;
}

std::string StringLiteralType::toString(bool) const
{
    size_t invalidSequence;

    if (!dev::validateUTF8(m_value, invalidSequence))
        return "literal_string (contains invalid UTF-8 sequence at position " + dev::toString(invalidSequence) + ")";

    return "literal_string \"" + m_value + "\"";
}

TypePointer StringLiteralType::mobileType() const
{
    return make_shared<ArrayType>(DataLocation::Memory, true);
}

bool StringLiteralType::isValidUTF8() const
{
    return dev::validateUTF8(m_value);
}

FixedBytesType::FixedBytesType(unsigned _bytes): m_bytes(_bytes)
{
    solAssert(
        m_bytes > 0 && m_bytes <= 32,
        "Invalid byte number for fixed bytes type: " + dev::toString(m_bytes)
    );
}

bool FixedBytesType::isImplicitlyConvertibleTo(Type const& _convertTo) const
{
    if (_convertTo.category() != category())
        return false;
    FixedBytesType const& convertTo = dynamic_cast<FixedBytesType const&>(_convertTo);
    return convertTo.m_bytes >= m_bytes;
}

bool FixedBytesType::isExplicitlyConvertibleTo(Type const& _convertTo) const
{
    return (_convertTo.category() == Category::Integer && numBytes() * 8 == dynamic_cast<IntegerType const&>(_convertTo).numBits()) ||
        (_convertTo.category() == Category::Address && numBytes() == 20) ||
        _convertTo.category() == Category::FixedPoint ||
        _convertTo.category() == category();
}

TypePointer FixedBytesType::unaryOperatorResult(Token _operator) const
{
    // "delete" and "~" is okay for FixedBytesType
    if (_operator == Token::Delete)
        return make_shared<TupleType>();
    else if (_operator == Token::BitNot)
        return shared_from_this();

    return TypePointer();
}

TypePointer FixedBytesType::binaryOperatorResult(Token _operator, TypePointer const& _other) const
{
    if (TokenTraits::isShiftOp(_operator))
    {
        if (isValidShiftAndAmountType(_operator, *_other))
            return shared_from_this();
        else
            return TypePointer();
    }

    auto commonType = dynamic_pointer_cast<FixedBytesType const>(Type::commonType(shared_from_this(), _other));
    if (!commonType)
        return TypePointer();

    // FixedBytes can be compared and have bitwise operators applied to them
    if (TokenTraits::isCompareOp(_operator) || TokenTraits::isBitOp(_operator))
        return commonType;

    return TypePointer();
}

MemberList::MemberMap FixedBytesType::nativeMembers(const ContractDefinition*) const
{
    return MemberList::MemberMap{MemberList::Member{"length", make_shared<IntegerType>(8)}};
}

string FixedBytesType::richIdentifier() const
{
    return "t_bytes" + to_string(m_bytes);
}

bool FixedBytesType::operator==(Type const& _other) const
{
    if (_other.category() != category())
        return false;
    FixedBytesType const& other = dynamic_cast<FixedBytesType const&>(_other);
    return other.m_bytes == m_bytes;
}

u256 BoolType::literalValue(Literal const* _literal) const
{
    solAssert(_literal, "");
    if (_literal->token() == Token::TrueLiteral)
        return u256(1);
    else if (_literal->token() == Token::FalseLiteral)
        return u256(0);
    else
        solAssert(false, "Bool type constructed from non-boolean literal.");
}

TypePointer BoolType::unaryOperatorResult(Token _operator) const
{
    if (_operator == Token::Delete)
        return make_shared<TupleType>();
    return (_operator == Token::Not) ? shared_from_this() : TypePointer();
}

TypePointer BoolType::binaryOperatorResult(Token _operator, TypePointer const& _other) const
{
    if (category() != _other->category())
        return TypePointer();
    if (_operator == Token::Equal || _operator == Token::NotEqual || _operator == Token::And || _operator == Token::Or)
        return _other;
    else
        return TypePointer();
}

bool ContractType::isImplicitlyConvertibleTo(Type const& _convertTo) const
{
    if (*this == _convertTo)
        return true;
    if (_convertTo.category() == Category::Contract)
    {
        auto const& bases = contractDefinition().annotation().linearizedBaseContracts;
        if (m_super && bases.size() <= 1)
            return false;
        return find(
            m_super ? ++bases.begin() : bases.begin(), bases.end(),
            &dynamic_cast<ContractType const&>(_convertTo).contractDefinition()
        ) != bases.end();
    }
    return false;
}

bool ContractType::isExplicitlyConvertibleTo(Type const& _convertTo) const
{
    if (auto const* addressType = dynamic_cast<AddressType const*>(&_convertTo))
        return isPayable() || (addressType->stateMutability() < StateMutability::Payable);
    return isImplicitlyConvertibleTo(_convertTo);
}

bool ContractType::isPayable() const
{
    auto fallbackFunction = m_contract.fallbackFunction();
    return fallbackFunction && fallbackFunction->isPayable();
}

TypePointer ContractType::unaryOperatorResult(Token _operator) const
{
    if (isSuper())
        return TypePointer{};
    return _operator == Token::Delete ? make_shared<TupleType>() : TypePointer();
}

TypePointer ReferenceType::unaryOperatorResult(Token _operator) const
{
    if (_operator != Token::Delete)
        return TypePointer();
    // delete can be used on everything except calldata references or storage pointers
    // (storage references are ok)
    switch (location())
    {
    case DataLocation::CallData:
        return TypePointer();
    case DataLocation::Memory:
        return make_shared<TupleType>();
    case DataLocation::Storage:
        return m_isPointer ? TypePointer() : make_shared<TupleType>();
    }
    return TypePointer();
}

TypePointer ReferenceType::copyForLocationIfReference(DataLocation _location, TypePointer const& _type)
{
    if (auto type = dynamic_cast<ReferenceType const*>(_type.get()))
        return type->copyForLocation(_location, false);
    return _type;
}

TypePointer ReferenceType::copyForLocationIfReference(TypePointer const& _type) const
{
    return copyForLocationIfReference(m_location, _type);
}

string ReferenceType::stringForReferencePart() const
{
    switch (m_location)
    {
    case DataLocation::Storage:
        return string("storage ") + (m_isPointer ? "pointer" : "ref");
    case DataLocation::CallData:
        return "calldata";
    case DataLocation::Memory:
        return "memory";
    }
    solAssert(false, "");
    return "";
}

string ReferenceType::identifierLocationSuffix() const
{
    string id;
    switch (location())
    {
    case DataLocation::Storage:
        id += "_storage";
        break;
    case DataLocation::Memory:
        id += "_memory";
        break;
    case DataLocation::CallData:
        id += "_calldata";
        break;
    }
    if (isPointer())
        id += "_ptr";
    return id;
}

bool ArrayType::isImplicitlyConvertibleTo(const Type& _convertTo) const
{
    if (_convertTo.category() != category())
        return false;
    auto& convertTo = dynamic_cast<ArrayType const&>(_convertTo);
    if (convertTo.isByteArray() != isByteArray() || convertTo.isString() != isString())
        return false;
    // memory/calldata to storage can be converted, but only to a direct storage reference
    if (convertTo.location() == DataLocation::Storage && location() != DataLocation::Storage && convertTo.isPointer())
        return false;
    if (convertTo.location() == DataLocation::CallData && location() != convertTo.location())
        return false;
    if (convertTo.location() == DataLocation::Storage && !convertTo.isPointer())
    {
        // Less restrictive conversion, since we need to copy anyway.
        if (!baseType()->isImplicitlyConvertibleTo(*convertTo.baseType()))
            return false;
        if (convertTo.isDynamicallySized())
            return true;
        return !isDynamicallySized() && convertTo.length() >= length();
    }
    else
    {
        // Conversion to storage pointer or to memory, we de not copy element-for-element here, so
        // require that the base type is the same, not only convertible.
        // This disallows assignment of nested dynamic arrays from storage to memory for now.
        if (
            *copyForLocationIfReference(location(), baseType()) !=
            *copyForLocationIfReference(location(), convertTo.baseType())
        )
            return false;
        if (isDynamicallySized() != convertTo.isDynamicallySized())
            return false;
        // We also require that the size is the same.
        if (!isDynamicallySized() && length() != convertTo.length())
            return false;
        return true;
    }
}

bool ArrayType::isExplicitlyConvertibleTo(const Type& _convertTo) const
{
    if (isImplicitlyConvertibleTo(_convertTo))
        return true;
    // allow conversion bytes <-> string
    if (_convertTo.category() != category())
        return false;
    auto& convertTo = dynamic_cast<ArrayType const&>(_convertTo);
    if (convertTo.location() != location())
        return false;
    if (!isByteArray() || !convertTo.isByteArray())
        return false;
    return true;
}

string ArrayType::richIdentifier() const
{
    string id;
    if (isString())
        id = "t_string";
    else if (isByteArray())
        id = "t_bytes";
    else
    {
        id = "t_array";
        id += identifierList(baseType());
        if (isDynamicallySized())
            id += "dyn";
        else
            id += length().str();
    }
    id += identifierLocationSuffix();

    return id;
}

bool ArrayType::operator==(Type const& _other) const
{
    if (_other.category() != category())
        return false;
    ArrayType const& other = dynamic_cast<ArrayType const&>(_other);
    if (
        !ReferenceType::operator==(other) ||
        other.isByteArray() != isByteArray() ||
        other.isString() != isString() ||
        other.isDynamicallySized() != isDynamicallySized()
    )
        return false;
    if (*other.baseType() != *baseType())
        return false;
    return isDynamicallySized() || length() == other.length();
}

bool ArrayType::validForCalldata() const
{
    return unlimitedCalldataEncodedSize(true) <= numeric_limits<unsigned>::max();
}

bigint ArrayType::unlimitedCalldataEncodedSize(bool _padded) const
{
    if (isDynamicallySized())
        return 32;
    bigint size = bigint(length()) * (isByteArray() ? 1 : baseType()->calldataEncodedSize(_padded));
    size = ((size + 31) / 32) * 32;
    return size;
}

unsigned ArrayType::calldataEncodedSize(bool _padded) const
{
    bigint size = unlimitedCalldataEncodedSize(_padded);
    solAssert(size <= numeric_limits<unsigned>::max(), "Array size does not fit unsigned.");
    return unsigned(size);
}

bool ArrayType::isDynamicallyEncoded() const
{
    return isDynamicallySized() || baseType()->isDynamicallyEncoded();
}

u256 ArrayType::storageSize() const
{
    if (isDynamicallySized())
        return 1;

    bigint size;
    unsigned baseBytes = baseType()->storageBytes();
    if (baseBytes == 0)
        size = 1;
    else if (baseBytes < 32)
    {
        unsigned itemsPerSlot = 32 / baseBytes;
        size = (bigint(length()) + (itemsPerSlot - 1)) / itemsPerSlot;
    }
    else
        size = bigint(length()) * baseType()->storageSize();
    if (size >= bigint(1) << 256)
        BOOST_THROW_EXCEPTION(Error(Error::Type::TypeError) << errinfo_comment("Array too large for storage."));
    return max<u256>(1, u256(size));
}

unsigned ArrayType::sizeOnStack() const
{
    if (m_location == DataLocation::CallData)
        // offset [length] (stack top)
        return 1 + (isDynamicallySized() ? 1 : 0);
    else
        // storage slot or memory offset
        // byte offset inside storage value is omitted
        return 1;
}

string ArrayType::toString(bool _short) const
{
    string ret;
    if (isString())
        ret = "string";
    else if (isByteArray())
        ret = "bytes";
    else
    {
        ret = baseType()->toString(_short) + "[";
        if (!isDynamicallySized())
            ret += length().str();
        ret += "]";
    }
    if (!_short)
        ret += " " + stringForReferencePart();
    return ret;
}

string ArrayType::canonicalName() const
{
    string ret;
    if (isString())
        ret = "string";
    else if (isByteArray())
        ret = "bytes";
    else
    {
        ret = baseType()->canonicalName() + "[";
        if (!isDynamicallySized())
            ret += length().str();
        ret += "]";
    }
    return ret;
}

string ArrayType::signatureInExternalFunction(bool _structsByName) const
{
    if (isByteArray())
        return canonicalName();
    else
    {
        solAssert(baseType(), "");
        return
            baseType()->signatureInExternalFunction(_structsByName) +
            "[" +
            (isDynamicallySized() ? "" : length().str()) +
            "]";
    }
}

MemberList::MemberMap ArrayType::nativeMembers(ContractDefinition const*) const
{
    MemberList::MemberMap members;
    if (!isString())
    {
        members.push_back({"length", make_shared<IntegerType>(256)});
        if (isDynamicallySized() && location() == DataLocation::Storage)
        {
            members.push_back({"push", make_shared<FunctionType>(
                TypePointers{baseType()},
                TypePointers{make_shared<IntegerType>(256)},
                strings{string()},
                strings{string()},
                isByteArray() ? FunctionType::Kind::ByteArrayPush : FunctionType::Kind::ArrayPush
            )});
            members.push_back({"pop", make_shared<FunctionType>(
                TypePointers{},
                TypePointers{},
                strings{string()},
                strings{string()},
                FunctionType::Kind::ArrayPop
            )});
        }
    }
    return members;
}

TypePointer ArrayType::encodingType() const
{
    if (location() == DataLocation::Storage)
        return make_shared<IntegerType>(256);
    else
        return this->copyForLocation(DataLocation::Memory, true);
}

TypePointer ArrayType::decodingType() const
{
    if (location() == DataLocation::Storage)
        return make_shared<IntegerType>(256);
    else
        return shared_from_this();
}

TypePointer ArrayType::interfaceType(bool _inLibrary) const
{
    // Note: This has to fulfill canBeUsedExternally(_inLibrary) ==  !!interfaceType(_inLibrary)
    if (_inLibrary && location() == DataLocation::Storage)
        return shared_from_this();

    if (m_arrayKind != ArrayKind::Ordinary)
        return this->copyForLocation(DataLocation::Memory, true);
    TypePointer baseExt = m_baseType->interfaceType(_inLibrary);
    if (!baseExt)
        return TypePointer();

    if (isDynamicallySized())
        return make_shared<ArrayType>(DataLocation::Memory, baseExt);
    else
        return make_shared<ArrayType>(DataLocation::Memory, baseExt, m_length);
}

bool ArrayType::canBeUsedExternally(bool _inLibrary) const
{
    // Note: This has to fulfill canBeUsedExternally(_inLibrary) ==  !!interfaceType(_inLibrary)
    if (_inLibrary && location() == DataLocation::Storage)
        return true;
    else if (m_arrayKind != ArrayKind::Ordinary)
        return true;
    else if (!m_baseType->canBeUsedExternally(_inLibrary))
        return false;
    else
        return true;
}

u256 ArrayType::memorySize() const
{
    solAssert(!isDynamicallySized(), "");
    solAssert(m_location == DataLocation::Memory, "");
    bigint size = bigint(m_length) * m_baseType->memoryHeadSize();
    solAssert(size <= numeric_limits<unsigned>::max(), "Array size does not fit u256.");
    return u256(size);
}

TypePointer ArrayType::copyForLocation(DataLocation _location, bool _isPointer) const
{
    auto copy = make_shared<ArrayType>(_location);
    copy->m_isPointer = _isPointer;
    copy->m_arrayKind = m_arrayKind;
    copy->m_baseType = copy->copyForLocationIfReference(m_baseType);
    copy->m_hasDynamicLength = m_hasDynamicLength;
    copy->m_length = m_length;
    return copy;
}

string ContractType::richIdentifier() const
{
    return (m_super ? "t_super" : "t_contract") + parenthesizeUserIdentifier(m_contract.name()) + to_string(m_contract.id());
}

bool ContractType::operator==(Type const& _other) const
{
    if (_other.category() != category())
        return false;
    ContractType const& other = dynamic_cast<ContractType const&>(_other);
    return other.m_contract == m_contract && other.m_super == m_super;
}

string ContractType::toString(bool) const
{
    return
        string(m_contract.isLibrary() ? "library " : "contract ") +
        string(m_super ? "super " : "") +
        m_contract.name();
}

string ContractType::canonicalName() const
{
    return m_contract.annotation().canonicalName;
}

MemberList::MemberMap ContractType::nativeMembers(ContractDefinition const* _contract) const
{
    MemberList::MemberMap members;
    solAssert(_contract, "");
    if (m_super)
    {
        // add the most derived of all functions which are visible in derived contracts
        auto bases = m_contract.annotation().linearizedBaseContracts;
        solAssert(bases.size() >= 1, "linearizedBaseContracts should at least contain the most derived contract.");
        // `sliced(1, ...)` ignores the most derived contract, which should not be searchable from `super`.
        for (ContractDefinition const* base: bases | boost::adaptors::sliced(1, bases.size()))
            for (FunctionDefinition const* function: base->definedFunctions())
            {
                if (!function->isVisibleInDerivedContracts())
                    continue;
                auto functionType = make_shared<FunctionType>(*function, true);
                bool functionWithEqualArgumentsFound = false;
                for (auto const& member: members)
                {
                    if (member.name != function->name())
                        continue;
                    auto memberType = dynamic_cast<FunctionType const*>(member.type.get());
                    solAssert(!!memberType, "Override changes type.");
                    if (!memberType->hasEqualParameterTypes(*functionType))
                        continue;
                    functionWithEqualArgumentsFound = true;
                    break;
                }
                if (!functionWithEqualArgumentsFound)
                    members.push_back(MemberList::Member(
                        function->name(),
                        functionType,
                        function
                    ));
            }
    }
    else if (!m_contract.isLibrary())
    {
        for (auto const& it: m_contract.interfaceFunctions())
            members.push_back(MemberList::Member(
                it.second->declaration().name(),
                it.second->asMemberFunction(m_contract.isLibrary()),
                &it.second->declaration()
            ));
    }
    return members;
}

shared_ptr<FunctionType const> const& ContractType::newExpressionType() const
{
    if (!m_constructorType)
        m_constructorType = FunctionType::newExpressionType(m_contract);
    return m_constructorType;
}

vector<tuple<VariableDeclaration const*, u256, unsigned>> ContractType::stateVariables() const
{
    vector<VariableDeclaration const*> variables;
    for (ContractDefinition const* contract: boost::adaptors::reverse(m_contract.annotation().linearizedBaseContracts))
        for (VariableDeclaration const* variable: contract->stateVariables())
            if (!variable->isConstant())
                variables.push_back(variable);
    TypePointers types;
    for (auto variable: variables)
        types.push_back(variable->annotation().type);
    StorageOffsets offsets;
    offsets.computeOffsets(types);

    vector<tuple<VariableDeclaration const*, u256, unsigned>> variablesAndOffsets;
    for (size_t index = 0; index < variables.size(); ++index)
        if (auto const* offset = offsets.offset(index))
            variablesAndOffsets.push_back(make_tuple(variables[index], offset->first, offset->second));
    return variablesAndOffsets;
}

bool StructType::isImplicitlyConvertibleTo(const Type& _convertTo) const
{
    if (_convertTo.category() != category())
        return false;
    auto& convertTo = dynamic_cast<StructType const&>(_convertTo);
    // memory/calldata to storage can be converted, but only to a direct storage reference
    if (convertTo.location() == DataLocation::Storage && location() != DataLocation::Storage && convertTo.isPointer())
        return false;
    if (convertTo.location() == DataLocation::CallData && location() != convertTo.location())
        return false;
    return this->m_struct == convertTo.m_struct;
}

string StructType::richIdentifier() const
{
    return "t_struct" + parenthesizeUserIdentifier(m_struct.name()) + to_string(m_struct.id()) + identifierLocationSuffix();
}

bool StructType::operator==(Type const& _other) const
{
    if (_other.category() != category())
        return false;
    StructType const& other = dynamic_cast<StructType const&>(_other);
    return ReferenceType::operator==(other) && other.m_struct == m_struct;
}

unsigned StructType::calldataEncodedSize(bool _padded) const
{
    unsigned size = 0;
    for (auto const& member: members(nullptr))
        if (!member.type->canLiveOutsideStorage())
            return 0;
        else
        {
            unsigned memberSize = member.type->calldataEncodedSize(_padded);
            if (memberSize == 0)
                return 0;
            size += memberSize;
        }
    return size;
}

bool StructType::isDynamicallyEncoded() const
{
    solAssert(!recursive(), "");
    for (auto t: memoryMemberTypes())
    {
        solAssert(t, "Parameter should have external type.");
        t = t->interfaceType(false);
        if (t->isDynamicallyEncoded())
            return true;
    }
    return false;
}

u256 StructType::memorySize() const
{
    u256 size;
    for (auto const& t: memoryMemberTypes())
        size += t->memoryHeadSize();
    return size;
}

u256 StructType::storageSize() const
{
    return max<u256>(1, members(nullptr).storageSize());
}

string StructType::toString(bool _short) const
{
    string ret = "struct " + m_struct.annotation().canonicalName;
    if (!_short)
        ret += " " + stringForReferencePart();
    return ret;
}

MemberList::MemberMap StructType::nativeMembers(ContractDefinition const*) const
{
    MemberList::MemberMap members;
    for (ASTPointer<VariableDeclaration> const& variable: m_struct.members())
    {
        TypePointer type = variable->annotation().type;
        solAssert(type, "");
        // Skip all mapping members if we are not in storage.
        if (location() != DataLocation::Storage && !type->canLiveOutsideStorage())
            continue;
        members.push_back(MemberList::Member(
            variable->name(),
            copyForLocationIfReference(type),
            variable.get())
        );
    }
    return members;
}

TypePointer StructType::interfaceType(bool _inLibrary) const
{
    if (!canBeUsedExternally(_inLibrary))
        return TypePointer();

    // Has to fulfill canBeUsedExternally(_inLibrary) == !!interfaceType(_inLibrary)
    if (_inLibrary && location() == DataLocation::Storage)
        return shared_from_this();
    else
        return copyForLocation(DataLocation::Memory, true);
}

bool StructType::canBeUsedExternally(bool _inLibrary) const
{
    if (_inLibrary && location() == DataLocation::Storage)
        return true;
    else if (recursive())
        return false;
    else
    {
        // Check that all members have interface types.
        // We pass "false" to canBeUsedExternally (_inLibrary), because this struct will be
        // passed by value and thus the encoding does not differ, but it will disallow
        // mappings.
        for (auto const& var: m_struct.members())
        {
            solAssert(var->annotation().type, "");
            if (!var->annotation().type->canBeUsedExternally(false))
                return false;
        }
    }
    return true;
}

TypePointer StructType::copyForLocation(DataLocation _location, bool _isPointer) const
{
    auto copy = make_shared<StructType>(m_struct, _location);
    copy->m_isPointer = _isPointer;
    return copy;
}

string StructType::signatureInExternalFunction(bool _structsByName) const
{
    if (_structsByName)
        return canonicalName();
    else
    {
        TypePointers memberTypes = memoryMemberTypes();
        auto memberTypeStrings = memberTypes | boost::adaptors::transformed([&](TypePointer _t) -> string
        {
            solAssert(_t, "Parameter should have external type.");
            auto t = _t->interfaceType(_structsByName);
            solAssert(t, "");
            return t->signatureInExternalFunction(_structsByName);
        });
        return "(" + boost::algorithm::join(memberTypeStrings, ",") + ")";
    }
}

string StructType::canonicalName() const
{
    return m_struct.annotation().canonicalName;
}

FunctionTypePointer StructType::constructorType() const
{
    TypePointers paramTypes;
    strings paramNames;
    for (auto const& member: members(nullptr))
    {
        if (!member.type->canLiveOutsideStorage())
            continue;
        paramNames.push_back(member.name);
        paramTypes.push_back(copyForLocationIfReference(DataLocation::Memory, member.type));
    }
    return make_shared<FunctionType>(
        paramTypes,
        TypePointers{copyForLocation(DataLocation::Memory, false)},
        paramNames,
        strings(),
        FunctionType::Kind::Internal
    );
}

pair<u256, unsigned> const& StructType::storageOffsetsOfMember(string const& _name) const
{
    auto const* offsets = members(nullptr).memberStorageOffset(_name);
    solAssert(offsets, "Storage offset of non-existing member requested.");
    return *offsets;
}

u256 StructType::memoryOffsetOfMember(string const& _name) const
{
    u256 offset;
    for (auto const& member: members(nullptr))
        if (member.name == _name)
            return offset;
        else
            offset += member.type->memoryHeadSize();
    solAssert(false, "Member not found in struct.");
    return 0;
}

TypePointers StructType::memoryMemberTypes() const
{
    TypePointers types;
    for (ASTPointer<VariableDeclaration> const& variable: m_struct.members())
        if (variable->annotation().type->canLiveOutsideStorage())
            types.push_back(variable->annotation().type);
    return types;
}

set<string> StructType::membersMissingInMemory() const
{
    set<string> missing;
    for (ASTPointer<VariableDeclaration> const& variable: m_struct.members())
        if (!variable->annotation().type->canLiveOutsideStorage())
            missing.insert(variable->name());
    return missing;
}

bool StructType::recursive() const
{
    if (!m_recursive.is_initialized())
    {
        auto visitor = [&](StructDefinition const& _struct, CycleDetector<StructDefinition>& _cycleDetector, size_t /*_depth*/)
        {
            for (ASTPointer<VariableDeclaration> const& variable: _struct.members())
            {
                Type const* memberType = variable->annotation().type.get();
                while (dynamic_cast<ArrayType const*>(memberType))
                    memberType = dynamic_cast<ArrayType const*>(memberType)->baseType().get();