path
stringlengths 14
112
| content
stringlengths 0
6.32M
| size
int64 0
6.32M
| max_lines
int64 1
100k
| repo_name
stringclasses 2
values | autogenerated
bool 1
class |
|---|---|---|---|---|---|
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/18.key | -----BEGIN EC PARAMETERS-----
BggqhkjOPQMBBw==
-----END EC PARAMETERS-----
-----BEGIN EC PRIVATE KEY-----
MHcCAQEEIJETLWqIZtnejCGzESDgMnknxqEx5evMGZfzBVPKMwKKoAoGCCqGSM49
AwEHoUQDQgAErHPyZDXGH2zIKTn6y+ZCjhsTiWhkukkCHjTt91HgaU6HtW1NmnDe
udsY73BqNHyRLcYNn3Dx0YU5xjAQ9btTdg==
-----END EC PRIVATE KEY-----
| 302 | 9 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/09.crt | -----BEGIN CERTIFICATE-----
MIIB1jCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDgwHhcNMTcwNjIyMTE1MDMzWhcN
MjcwNjIzMTE1MDMzWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDkwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAR7ZB16+t6E
sfahGyKUGJW5mezkzjdaYvc4lbJaKNRwFRfc3F/fmNOSsUFSg/F0N+vUE+doKiPC
8wRwLzvm4s+5o4GJMIGGMB0GA1UdDgQWBBT6gyXHzPIPYc1Vr1aGiLLeMh4HpjBX
BgNVHSMEUDBOgBS40mLt93U8Sh8ZGiDVAhRSiBPcXqEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA3ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDRwAwRAIgO4el1ZPhlIli/qNR2SIEiuvs5Mmy868i
N2Rv5X/VxIECIA/8rUALQxW38XSdBVX3e/jzu7ju47n1YwEqD9K9WdVv
-----END CERTIFICATE-----
| 696 | 13 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/c13.pem | -----BEGIN CERTIFICATE-----
MIIB1zCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMTIwHhcNMTcwNjIyMTE1MDMzWhcN
MjcwNjIzMTE1MDMzWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMTMwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAATrkzCJLznh
lhnsv1RXB9kfeaD+cIruPQ0cItBDGpdvD8xbBVvQci4+RG2RVUCSWRhkFYjSsUSM
0QHMQnBFlhw2o4GJMIGGMB0GA1UdDgQWBBTmVnUSF2MYwws/nCMv7b1wJVkDmjBX
BgNVHSMEUDBOgBTZTtbi+j0Sm/Zs/+gTkWdASpQzfqEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTExggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSAAwRQIgWsm+rHJgwUEyNm8EKbEds5yurpp5/3y5
PsvXJVDqxogCIQDUP0Jcl3A907CE2tPVXSgD6LQ6CPu19mixemPw60yijA==
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1jCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMTEwHhcNMTcwNjIyMTE1MDMzWhcN
MjcwNjIzMTE1MDMzWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMTIwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAATDE9LPlLPc
gZ3b0BchR/AkhNEP9HAavwYadJIyzoPo5edCVnboQH786jsZwZNZoC0gHDAhCmGc
IfRenISAoVuPo4GJMIGGMB0GA1UdDgQWBBTZTtbi+j0Sm/Zs/+gTkWdASpQzfjBX
BgNVHSMEUDBOgBSOSt6ePyMRT6PGMaIi7FqNX9MKtKEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTEwggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDRwAwRAIgYYF5AnRV7eh2hLD5Dz//pceMTKz9Ls46
E6DxvbfDHikCIFttlGrOCZVyS4ocsjuKIELVUX5qfygI0sn4kU3qCTs2
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1jCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMTAwHhcNMTcwNjIyMTE1MDMzWhcN
MjcwNjIzMTE1MDMzWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMTEwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAATZwR+WK6NB
F/7riFdN63c8hjYddZRR4lrzVNPwiBQxnnxwpPyrD9A6aPPmLc6SqGOJW4ZGVCco
IBze9RJVeiB9o4GJMIGGMB0GA1UdDgQWBBSOSt6ePyMRT6PGMaIi7FqNX9MKtDBX
BgNVHSMEUDBOgBQtxZSLJAkEz+2RKMQexM6EtsfgcqEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA5ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDRwAwRAIgN//NqM0FrkrMjmxoeCY9DgxkH2R6sQ4d
NgtwCZAIqEICIBs4vupaVcuvni9tltbP26wi7c0FR+blZuo5DPIA3SVe
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1zCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDkwHhcNMTcwNjIyMTE1MDMzWhcN
MjcwNjIzMTE1MDMzWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMTAwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAR6jlGKbJd5
hiDxN789gkOcwpyHI9wRwCrADAOwOkMePBPRlwGdm7mw7Z/EAmu26zRm/hcyrs4M
qk2LabDjPI9Xo4GJMIGGMB0GA1UdDgQWBBQtxZSLJAkEz+2RKMQexM6EtsfgcjBX
BgNVHSMEUDBOgBT6gyXHzPIPYc1Vr1aGiLLeMh4HpqEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA4ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSAAwRQIgP7S8vFstfUBdNe6ym5GYG5Q+aBVEKqRs
fVW7HNUktSYCIQDo6Jua6o/DJbrpq4qYWq5gv4yGyzPTN+3IaKrEICdaaw==
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1jCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDgwHhcNMTcwNjIyMTE1MDMzWhcN
MjcwNjIzMTE1MDMzWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDkwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAR7ZB16+t6E
sfahGyKUGJW5mezkzjdaYvc4lbJaKNRwFRfc3F/fmNOSsUFSg/F0N+vUE+doKiPC
8wRwLzvm4s+5o4GJMIGGMB0GA1UdDgQWBBT6gyXHzPIPYc1Vr1aGiLLeMh4HpjBX
BgNVHSMEUDBOgBS40mLt93U8Sh8ZGiDVAhRSiBPcXqEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA3ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDRwAwRAIgO4el1ZPhlIli/qNR2SIEiuvs5Mmy868i
N2Rv5X/VxIECIA/8rUALQxW38XSdBVX3e/jzu7ju47n1YwEqD9K9WdVv
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB2DCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDcwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDgwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAARpQeQ/YGQj
nl7Szo6WStJ1u7xunTL5jBkXH8aAVSm0qiX4AD/7YPxa5EnGzZdLTn25vQVnfQAG
pMx8P1lYiGYCo4GJMIGGMB0GA1UdDgQWBBS40mLt93U8Sh8ZGiDVAhRSiBPcXjBX
BgNVHSMEUDBOgBREq5J3toJPxZ3O+ssJ5vkkU0RJE6EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA2ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSQAwRgIhANwGf+F4a+kmXWz8UjSpRkaToTV6EFWw
/Tjzj0tQhDoAAiEA19RxeWOVBBpM6LOHg6v5Lf54YN1snkLf+sEXyZCuWQQ=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB2DCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDYwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDcwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAASNOj4d4MEA
7p/3miijqG4ToE4opKPAm+3BTIGrJTYT14++TSiUICl0ASXj+xeUcLMIaXTN042s
LsHxpShzQaL0o4GJMIGGMB0GA1UdDgQWBBREq5J3toJPxZ3O+ssJ5vkkU0RJEzBX
BgNVHSMEUDBOgBSjovYaC/m6Li9Tp0V9iZRs9267Q6EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA1ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSQAwRgIhAKGcf+c442c/XiwubbaiQvsoZ7EoVxuM
oKmia0gPyBNkAiEA83asjJ5FDXQuLyZpczviXrbmqgCPOfYadtvkc0cxMis=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1jCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDUwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDYwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAASA9qWoAUHr
nn+3kxyNrjPJk82WDLimW21RN51uxpobadv8YgGEDRdP+Ok+uRqQSUsA6ZXfF3iG
r2GjfQ3wMDH8o4GJMIGGMB0GA1UdDgQWBBSjovYaC/m6Li9Tp0V9iZRs9267QzBX
BgNVHSMEUDBOgBTXh06MAV9S4l4lG1TKOrKRBh4qn6EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA0ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDRwAwRAIgcjZNFWJtlDmoPZbAxqsGczRYK0lfPgu6
g1H7pp0ce+wCIDj9BRZM2OB9EF0e+MDKGjyZGfvfrL6Ir47x/KrM6H8T
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1zCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDQwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDUwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQEdT0OFf5G
UcrgX2XllCyJzP94NZ464GsgB6psNLsDeL+j7AU+oJy7VLvW/lHh3ODgl08Z9bhq
LFBmNjnHbm8Qo4GJMIGGMB0GA1UdDgQWBBTXh06MAV9S4l4lG1TKOrKRBh4qnzBX
BgNVHSMEUDBOgBQox4F1NsZunlsduoGvzIgRSYfB36EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAzggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSAAwRQIhAIW++zqDZlLLUk/emePohdNOp5JO3wS9
XvkBJ6Wua7GBAiAdx+EKmdjVrwnzrQltTgnmSfGMXhKNYifK3uD83W3pcQ==
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1jCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDMwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDQwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQUXDgcUVNT
9hovbZE5HL6rjOb7C55wEuWKThV/CcZ4rWrXx7VXHYdD/R3aDA7JSvYpm2sTok4i
sblDzhZM/GDNo4GJMIGGMB0GA1UdDgQWBBQox4F1NsZunlsduoGvzIgRSYfB3zBX
BgNVHSMEUDBOgBQApzZdtBdD3dLxouQpr/aDiVttd6EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAyggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDRwAwRAIgAkiNhqFAZXSUWEDK91OZvQGdeZOtd6mC
+Wv3fGk3t28CIEKOwidkUTUaiPdZ4efmAr+CEeGzdq27ob2S+nqqHqgV
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB2DCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDIwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDMwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQRDXDNIi1p
ereudhqwa2LslXgsxnB63Hu5y5lg+1WPruIYPzD/Ho0APveVdzFLVji19+bE4+tF
PYL1SpsN1WfWo4GJMIGGMB0GA1UdDgQWBBQApzZdtBdD3dLxouQpr/aDiVttdzBX
BgNVHSMEUDBOgBT5RCgQ0AlZTQbfFB2+6+w0XRvydaEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAxggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSQAwRgIhAOnd+7bAofkHVa4KFNjv3TCegw1lrhuM
8Of8wgvrTEGoAiEAsS8iKMpSfXH4D0egg4gLamE6akde965rDtySU+ve9lg=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1zCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDEwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDIwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQWHpv1i6lf
wvNPOP5ka6S0n55EvzoaYK6pbTXP6yMOW/4XZSPKx5Zoq4FMe0cKzGIIFL1rzj1V
2czYB+qvLhyio4GJMIGGMB0GA1UdDgQWBBT5RCgQ0AlZTQbfFB2+6+w0XRvydTBX
BgNVHSMEUDBOgBSh3uHkX5nj86yFEFwjscSWM40P+qEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAwggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSAAwRQIhAI7unGW/gr9tOc3i+dF5N815srgh+FrX
oj9Et74EcSpTAiBubv+vOH0DE0gmYI11HeAIgutWqqMIC72dZlwTF/Vi3g==
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB3jCCAYWgAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDAwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDEwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQznn9zHHwL
GO8VR4W9V7vMlxCdoojzEOiX5Y6JtPtFOz866ueHY6zoN0/mJ6DnqnSXilJIUUeW
6eGfqmka7nxko4GRMIGOMB0GA1UdDgQWBBSh3uHkX5nj86yFEFwjscSWM40P+jBf
BgNVHSMEWDBWgBQlFYvU5WboI4fcdPoiQs8/fPHZraEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAwggkA/KCWhcqToHAw
DAYDVR0TBAUwAwEB/zAKBggqhkjOPQQDAgNHADBEAiBasbuinP+pJTU4oDCVD8zQ
1rJBDSOKIEyWu84/D6Hj6wIgVMPUoO01bPhzllAa/gW8Xk/daey09SBgN3AT9pWU
TDA=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIBpTCCAUugAwIBAgIJAPygloXKk6BwMAoGCCqGSM49BAMCMC8xCzAJBgNVBAYT
AlVLMREwDwYDVQQKDAhtYmVkIFRMUzENMAsGA1UEAwwEQ0EwMDAeFw0xNzA2MjIx
MTUwMzJaFw0yNzA2MjMxMTUwMzJaMC8xCzAJBgNVBAYTAlVLMREwDwYDVQQKDAht
YmVkIFRMUzENMAsGA1UEAwwEQ0EwMDBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IA
BFW41/qAwAPpy+Txdc7PKmzZsq9CPiujKU4vpF1ekXnGx2HP420QobwBVVWhkzRm
LwdboH2j65dcCKjQ7mv/dxKjUDBOMB0GA1UdDgQWBBQlFYvU5WboI4fcdPoiQs8/
fPHZrTAfBgNVHSMEGDAWgBQlFYvU5WboI4fcdPoiQs8/fPHZrTAMBgNVHRMEBTAD
AQH/MAoGCCqGSM49BAMCA0gAMEUCIQC7iRcVzwMyfVK5imirJ7MqJQ04euH4CLOt
IZ+SNfaERAIgSU0MWFDosVEIpg8YMqIHeF7Mg4ZyH6+fGazJgVLttUY=
-----END CERTIFICATE-----
| 9,720 | 169 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/01.crt | -----BEGIN CERTIFICATE-----
MIIB3jCCAYWgAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDAwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDEwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQznn9zHHwL
GO8VR4W9V7vMlxCdoojzEOiX5Y6JtPtFOz866ueHY6zoN0/mJ6DnqnSXilJIUUeW
6eGfqmka7nxko4GRMIGOMB0GA1UdDgQWBBSh3uHkX5nj86yFEFwjscSWM40P+jBf
BgNVHSMEWDBWgBQlFYvU5WboI4fcdPoiQs8/fPHZraEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAwggkA/KCWhcqToHAw
DAYDVR0TBAUwAwEB/zAKBggqhkjOPQQDAgNHADBEAiBasbuinP+pJTU4oDCVD8zQ
1rJBDSOKIEyWu84/D6Hj6wIgVMPUoO01bPhzllAa/gW8Xk/daey09SBgN3AT9pWU
TDA=
-----END CERTIFICATE-----
| 709 | 14 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/07.key | -----BEGIN EC PARAMETERS-----
BggqhkjOPQMBBw==
-----END EC PARAMETERS-----
-----BEGIN EC PRIVATE KEY-----
MHcCAQEEIEi1oKInPLbiINj8OxdActVTgI+YQVSefdQfCu1ihbLRoAoGCCqGSM49
AwEHoUQDQgAEjTo+HeDBAO6f95ooo6huE6BOKKSjwJvtwUyBqyU2E9ePvk0olCAp
dAEl4/sXlHCzCGl0zdONrC7B8aUoc0Gi9A==
-----END EC PRIVATE KEY-----
| 302 | 9 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/18.crt | -----BEGIN CERTIFICATE-----
MIIB2DCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMTcwHhcNMTcwNjIyMTE1MDMzWhcN
MjcwNjIzMTE1MDMzWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMTgwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAASsc/JkNcYf
bMgpOfrL5kKOGxOJaGS6SQIeNO33UeBpToe1bU2acN652xjvcGo0fJEtxg2fcPHR
hTnGMBD1u1N2o4GJMIGGMB0GA1UdDgQWBBSDbIpYntlhJ0GgIsyd75XRhlC18jBX
BgNVHSMEUDBOgBSnjWvpWxZcFnfQ2KGtCg/u6fT/D6EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTE2ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSQAwRgIhAJo2NXfJU1sK6SVTu4OV21FKITlXntMi
oenYMsBjzO8oAiEAidSELcLjjAHi3mfBARvCgKlRhmbNEMCHQT7Ha7ZQoRw=
-----END CERTIFICATE-----
| 700 | 13 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/17.key | -----BEGIN EC PARAMETERS-----
BggqhkjOPQMBBw==
-----END EC PARAMETERS-----
-----BEGIN EC PRIVATE KEY-----
MHcCAQEEIAiUS1dM3qrcOun8PjKe+rw40L2HG/Y8Dfxl0AfzyIVeoAoGCCqGSM49
AwEHoUQDQgAEayEqtszvZg9vWAixweehXVP0SDbUYX3i7TPruaNx2gJ6KctEvfEc
7hBhC46c6/GSOpJDDGbI/JxWUBfB37hNIA==
-----END EC PRIVATE KEY-----
| 302 | 9 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/c00.pem | -----BEGIN CERTIFICATE-----
MIIBpTCCAUugAwIBAgIJAPygloXKk6BwMAoGCCqGSM49BAMCMC8xCzAJBgNVBAYT
AlVLMREwDwYDVQQKDAhtYmVkIFRMUzENMAsGA1UEAwwEQ0EwMDAeFw0xNzA2MjIx
MTUwMzJaFw0yNzA2MjMxMTUwMzJaMC8xCzAJBgNVBAYTAlVLMREwDwYDVQQKDAht
YmVkIFRMUzENMAsGA1UEAwwEQ0EwMDBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IA
BFW41/qAwAPpy+Txdc7PKmzZsq9CPiujKU4vpF1ekXnGx2HP420QobwBVVWhkzRm
LwdboH2j65dcCKjQ7mv/dxKjUDBOMB0GA1UdDgQWBBQlFYvU5WboI4fcdPoiQs8/
fPHZrTAfBgNVHSMEGDAWgBQlFYvU5WboI4fcdPoiQs8/fPHZrTAMBgNVHRMEBTAD
AQH/MAoGCCqGSM49BAMCA0gAMEUCIQC7iRcVzwMyfVK5imirJ7MqJQ04euH4CLOt
IZ+SNfaERAIgSU0MWFDosVEIpg8YMqIHeF7Mg4ZyH6+fGazJgVLttUY=
-----END CERTIFICATE-----
| 631 | 12 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/16.crt | -----BEGIN CERTIFICATE-----
MIIB2DCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMTUwHhcNMTcwNjIyMTE1MDMzWhcN
MjcwNjIzMTE1MDMzWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMTYwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQ7Vsp7JmDN
kgPh/+zmIPkd7o0xot/WPMFn3uAsGtsU385MF0fmhfFLhRbbH9h4JjYHj8y0spU3
buUXhftvAZVbo4GJMIGGMB0GA1UdDgQWBBRTw3K0Psy3u/6+3KKSoaQqJnPvPjBX
BgNVHSMEUDBOgBR1mXlrdW5rx1VnqMMnUBXo0WWGWqEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTE0ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSQAwRgIhAMJnGjE9v3SjuGfi0jNByrwyNfhlTHMh
FhPQidNrDpXwAiEAqYtNiV8t9RrAa9GC6FWDuJpvIiU6FsE+lFq6uIq/J2E=
-----END CERTIFICATE-----
| 700 | 13 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/c01.pem | -----BEGIN CERTIFICATE-----
MIIB3jCCAYWgAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDAwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDEwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQznn9zHHwL
GO8VR4W9V7vMlxCdoojzEOiX5Y6JtPtFOz866ueHY6zoN0/mJ6DnqnSXilJIUUeW
6eGfqmka7nxko4GRMIGOMB0GA1UdDgQWBBSh3uHkX5nj86yFEFwjscSWM40P+jBf
BgNVHSMEWDBWgBQlFYvU5WboI4fcdPoiQs8/fPHZraEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAwggkA/KCWhcqToHAw
DAYDVR0TBAUwAwEB/zAKBggqhkjOPQQDAgNHADBEAiBasbuinP+pJTU4oDCVD8zQ
1rJBDSOKIEyWu84/D6Hj6wIgVMPUoO01bPhzllAa/gW8Xk/daey09SBgN3AT9pWU
TDA=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIBpTCCAUugAwIBAgIJAPygloXKk6BwMAoGCCqGSM49BAMCMC8xCzAJBgNVBAYT
AlVLMREwDwYDVQQKDAhtYmVkIFRMUzENMAsGA1UEAwwEQ0EwMDAeFw0xNzA2MjIx
MTUwMzJaFw0yNzA2MjMxMTUwMzJaMC8xCzAJBgNVBAYTAlVLMREwDwYDVQQKDAht
YmVkIFRMUzENMAsGA1UEAwwEQ0EwMDBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IA
BFW41/qAwAPpy+Txdc7PKmzZsq9CPiujKU4vpF1ekXnGx2HP420QobwBVVWhkzRm
LwdboH2j65dcCKjQ7mv/dxKjUDBOMB0GA1UdDgQWBBQlFYvU5WboI4fcdPoiQs8/
fPHZrTAfBgNVHSMEGDAWgBQlFYvU5WboI4fcdPoiQs8/fPHZrTAMBgNVHRMEBTAD
AQH/MAoGCCqGSM49BAMCA0gAMEUCIQC7iRcVzwMyfVK5imirJ7MqJQ04euH4CLOt
IZ+SNfaERAIgSU0MWFDosVEIpg8YMqIHeF7Mg4ZyH6+fGazJgVLttUY=
-----END CERTIFICATE-----
| 1,340 | 25 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/c11.pem | -----BEGIN CERTIFICATE-----
MIIB1jCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMTAwHhcNMTcwNjIyMTE1MDMzWhcN
MjcwNjIzMTE1MDMzWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMTEwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAATZwR+WK6NB
F/7riFdN63c8hjYddZRR4lrzVNPwiBQxnnxwpPyrD9A6aPPmLc6SqGOJW4ZGVCco
IBze9RJVeiB9o4GJMIGGMB0GA1UdDgQWBBSOSt6ePyMRT6PGMaIi7FqNX9MKtDBX
BgNVHSMEUDBOgBQtxZSLJAkEz+2RKMQexM6EtsfgcqEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA5ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDRwAwRAIgN//NqM0FrkrMjmxoeCY9DgxkH2R6sQ4d
NgtwCZAIqEICIBs4vupaVcuvni9tltbP26wi7c0FR+blZuo5DPIA3SVe
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1zCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDkwHhcNMTcwNjIyMTE1MDMzWhcN
MjcwNjIzMTE1MDMzWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMTAwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAR6jlGKbJd5
hiDxN789gkOcwpyHI9wRwCrADAOwOkMePBPRlwGdm7mw7Z/EAmu26zRm/hcyrs4M
qk2LabDjPI9Xo4GJMIGGMB0GA1UdDgQWBBQtxZSLJAkEz+2RKMQexM6EtsfgcjBX
BgNVHSMEUDBOgBT6gyXHzPIPYc1Vr1aGiLLeMh4HpqEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA4ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSAAwRQIgP7S8vFstfUBdNe6ym5GYG5Q+aBVEKqRs
fVW7HNUktSYCIQDo6Jua6o/DJbrpq4qYWq5gv4yGyzPTN+3IaKrEICdaaw==
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1jCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDgwHhcNMTcwNjIyMTE1MDMzWhcN
MjcwNjIzMTE1MDMzWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDkwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAR7ZB16+t6E
sfahGyKUGJW5mezkzjdaYvc4lbJaKNRwFRfc3F/fmNOSsUFSg/F0N+vUE+doKiPC
8wRwLzvm4s+5o4GJMIGGMB0GA1UdDgQWBBT6gyXHzPIPYc1Vr1aGiLLeMh4HpjBX
BgNVHSMEUDBOgBS40mLt93U8Sh8ZGiDVAhRSiBPcXqEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA3ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDRwAwRAIgO4el1ZPhlIli/qNR2SIEiuvs5Mmy868i
N2Rv5X/VxIECIA/8rUALQxW38XSdBVX3e/jzu7ju47n1YwEqD9K9WdVv
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB2DCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDcwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDgwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAARpQeQ/YGQj
nl7Szo6WStJ1u7xunTL5jBkXH8aAVSm0qiX4AD/7YPxa5EnGzZdLTn25vQVnfQAG
pMx8P1lYiGYCo4GJMIGGMB0GA1UdDgQWBBS40mLt93U8Sh8ZGiDVAhRSiBPcXjBX
BgNVHSMEUDBOgBREq5J3toJPxZ3O+ssJ5vkkU0RJE6EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA2ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSQAwRgIhANwGf+F4a+kmXWz8UjSpRkaToTV6EFWw
/Tjzj0tQhDoAAiEA19RxeWOVBBpM6LOHg6v5Lf54YN1snkLf+sEXyZCuWQQ=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB2DCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDYwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDcwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAASNOj4d4MEA
7p/3miijqG4ToE4opKPAm+3BTIGrJTYT14++TSiUICl0ASXj+xeUcLMIaXTN042s
LsHxpShzQaL0o4GJMIGGMB0GA1UdDgQWBBREq5J3toJPxZ3O+ssJ5vkkU0RJEzBX
BgNVHSMEUDBOgBSjovYaC/m6Li9Tp0V9iZRs9267Q6EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA1ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSQAwRgIhAKGcf+c442c/XiwubbaiQvsoZ7EoVxuM
oKmia0gPyBNkAiEA83asjJ5FDXQuLyZpczviXrbmqgCPOfYadtvkc0cxMis=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1jCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDUwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDYwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAASA9qWoAUHr
nn+3kxyNrjPJk82WDLimW21RN51uxpobadv8YgGEDRdP+Ok+uRqQSUsA6ZXfF3iG
r2GjfQ3wMDH8o4GJMIGGMB0GA1UdDgQWBBSjovYaC/m6Li9Tp0V9iZRs9267QzBX
BgNVHSMEUDBOgBTXh06MAV9S4l4lG1TKOrKRBh4qn6EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA0ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDRwAwRAIgcjZNFWJtlDmoPZbAxqsGczRYK0lfPgu6
g1H7pp0ce+wCIDj9BRZM2OB9EF0e+MDKGjyZGfvfrL6Ir47x/KrM6H8T
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1zCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDQwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDUwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQEdT0OFf5G
UcrgX2XllCyJzP94NZ464GsgB6psNLsDeL+j7AU+oJy7VLvW/lHh3ODgl08Z9bhq
LFBmNjnHbm8Qo4GJMIGGMB0GA1UdDgQWBBTXh06MAV9S4l4lG1TKOrKRBh4qnzBX
BgNVHSMEUDBOgBQox4F1NsZunlsduoGvzIgRSYfB36EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAzggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSAAwRQIhAIW++zqDZlLLUk/emePohdNOp5JO3wS9
XvkBJ6Wua7GBAiAdx+EKmdjVrwnzrQltTgnmSfGMXhKNYifK3uD83W3pcQ==
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1jCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDMwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDQwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQUXDgcUVNT
9hovbZE5HL6rjOb7C55wEuWKThV/CcZ4rWrXx7VXHYdD/R3aDA7JSvYpm2sTok4i
sblDzhZM/GDNo4GJMIGGMB0GA1UdDgQWBBQox4F1NsZunlsduoGvzIgRSYfB3zBX
BgNVHSMEUDBOgBQApzZdtBdD3dLxouQpr/aDiVttd6EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAyggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDRwAwRAIgAkiNhqFAZXSUWEDK91OZvQGdeZOtd6mC
+Wv3fGk3t28CIEKOwidkUTUaiPdZ4efmAr+CEeGzdq27ob2S+nqqHqgV
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB2DCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDIwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDMwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQRDXDNIi1p
ereudhqwa2LslXgsxnB63Hu5y5lg+1WPruIYPzD/Ho0APveVdzFLVji19+bE4+tF
PYL1SpsN1WfWo4GJMIGGMB0GA1UdDgQWBBQApzZdtBdD3dLxouQpr/aDiVttdzBX
BgNVHSMEUDBOgBT5RCgQ0AlZTQbfFB2+6+w0XRvydaEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAxggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSQAwRgIhAOnd+7bAofkHVa4KFNjv3TCegw1lrhuM
8Of8wgvrTEGoAiEAsS8iKMpSfXH4D0egg4gLamE6akde965rDtySU+ve9lg=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1zCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDEwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDIwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQWHpv1i6lf
wvNPOP5ka6S0n55EvzoaYK6pbTXP6yMOW/4XZSPKx5Zoq4FMe0cKzGIIFL1rzj1V
2czYB+qvLhyio4GJMIGGMB0GA1UdDgQWBBT5RCgQ0AlZTQbfFB2+6+w0XRvydTBX
BgNVHSMEUDBOgBSh3uHkX5nj86yFEFwjscSWM40P+qEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAwggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSAAwRQIhAI7unGW/gr9tOc3i+dF5N815srgh+FrX
oj9Et74EcSpTAiBubv+vOH0DE0gmYI11HeAIgutWqqMIC72dZlwTF/Vi3g==
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB3jCCAYWgAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDAwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDEwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQznn9zHHwL
GO8VR4W9V7vMlxCdoojzEOiX5Y6JtPtFOz866ueHY6zoN0/mJ6DnqnSXilJIUUeW
6eGfqmka7nxko4GRMIGOMB0GA1UdDgQWBBSh3uHkX5nj86yFEFwjscSWM40P+jBf
BgNVHSMEWDBWgBQlFYvU5WboI4fcdPoiQs8/fPHZraEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAwggkA/KCWhcqToHAw
DAYDVR0TBAUwAwEB/zAKBggqhkjOPQQDAgNHADBEAiBasbuinP+pJTU4oDCVD8zQ
1rJBDSOKIEyWu84/D6Hj6wIgVMPUoO01bPhzllAa/gW8Xk/daey09SBgN3AT9pWU
TDA=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIBpTCCAUugAwIBAgIJAPygloXKk6BwMAoGCCqGSM49BAMCMC8xCzAJBgNVBAYT
AlVLMREwDwYDVQQKDAhtYmVkIFRMUzENMAsGA1UEAwwEQ0EwMDAeFw0xNzA2MjIx
MTUwMzJaFw0yNzA2MjMxMTUwMzJaMC8xCzAJBgNVBAYTAlVLMREwDwYDVQQKDAht
YmVkIFRMUzENMAsGA1UEAwwEQ0EwMDBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IA
BFW41/qAwAPpy+Txdc7PKmzZsq9CPiujKU4vpF1ekXnGx2HP420QobwBVVWhkzRm
LwdboH2j65dcCKjQ7mv/dxKjUDBOMB0GA1UdDgQWBBQlFYvU5WboI4fcdPoiQs8/
fPHZrTAfBgNVHSMEGDAWgBQlFYvU5WboI4fcdPoiQs8/fPHZrTAMBgNVHRMEBTAD
AQH/MAoGCCqGSM49BAMCA0gAMEUCIQC7iRcVzwMyfVK5imirJ7MqJQ04euH4CLOt
IZ+SNfaERAIgSU0MWFDosVEIpg8YMqIHeF7Mg4ZyH6+fGazJgVLttUY=
-----END CERTIFICATE-----
| 8,324 | 145 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/17.crt | -----BEGIN CERTIFICATE-----
MIIB1zCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMTYwHhcNMTcwNjIyMTE1MDMzWhcN
MjcwNjIzMTE1MDMzWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMTcwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAARrISq2zO9m
D29YCLHB56FdU/RINtRhfeLtM+u5o3HaAnopy0S98RzuEGELjpzr8ZI6kkMMZsj8
nFZQF8HfuE0go4GJMIGGMB0GA1UdDgQWBBSnjWvpWxZcFnfQ2KGtCg/u6fT/DzBX
BgNVHSMEUDBOgBRTw3K0Psy3u/6+3KKSoaQqJnPvPqEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTE1ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSAAwRQIgDgXjoc6FfMF5W0NziV6vx2BOPNWav01Z
ynEP4h9ULnUCIQC1rU4sEId3UdjzTKhpSGTKtaOuPG+b0YdEMPimI4jmVw==
-----END CERTIFICATE-----
| 700 | 13 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/07.crt | -----BEGIN CERTIFICATE-----
MIIB2DCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDYwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDcwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAASNOj4d4MEA
7p/3miijqG4ToE4opKPAm+3BTIGrJTYT14++TSiUICl0ASXj+xeUcLMIaXTN042s
LsHxpShzQaL0o4GJMIGGMB0GA1UdDgQWBBREq5J3toJPxZ3O+ssJ5vkkU0RJEzBX
BgNVHSMEUDBOgBSjovYaC/m6Li9Tp0V9iZRs9267Q6EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTA1ggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSQAwRgIhAKGcf+c442c/XiwubbaiQvsoZ7EoVxuM
oKmia0gPyBNkAiEA83asjJ5FDXQuLyZpczviXrbmqgCPOfYadtvkc0cxMis=
-----END CERTIFICATE-----
| 700 | 13 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/16.key | -----BEGIN EC PARAMETERS-----
BggqhkjOPQMBBw==
-----END EC PARAMETERS-----
-----BEGIN EC PRIVATE KEY-----
MHcCAQEEIM0YCnGkEG/TjBxrytP9Ztslm1yoQaWptBxegRzzBRDVoAoGCCqGSM49
AwEHoUQDQgAEO1bKeyZgzZID4f/s5iD5He6NMaLf1jzBZ97gLBrbFN/OTBdH5oXx
S4UW2x/YeCY2B4/MtLKVN27lF4X7bwGVWw==
-----END EC PRIVATE KEY-----
| 302 | 9 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/02.key | -----BEGIN EC PARAMETERS-----
BggqhkjOPQMBBw==
-----END EC PARAMETERS-----
-----BEGIN EC PRIVATE KEY-----
MHcCAQEEIPW9zE8cjiZ8w17jTAebb4xAmEg6heEEnEaG4lGCd38joAoGCCqGSM49
AwEHoUQDQgAEFh6b9YupX8LzTzj+ZGuktJ+eRL86GmCuqW01z+sjDlv+F2UjyseW
aKuBTHtHCsxiCBS9a849VdnM2Afqry4cog==
-----END EC PRIVATE KEY-----
| 302 | 9 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/c04.pem | -----BEGIN CERTIFICATE-----
MIIB1jCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDMwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDQwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQUXDgcUVNT
9hovbZE5HL6rjOb7C55wEuWKThV/CcZ4rWrXx7VXHYdD/R3aDA7JSvYpm2sTok4i
sblDzhZM/GDNo4GJMIGGMB0GA1UdDgQWBBQox4F1NsZunlsduoGvzIgRSYfB3zBX
BgNVHSMEUDBOgBQApzZdtBdD3dLxouQpr/aDiVttd6EzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAyggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDRwAwRAIgAkiNhqFAZXSUWEDK91OZvQGdeZOtd6mC
+Wv3fGk3t28CIEKOwidkUTUaiPdZ4efmAr+CEeGzdq27ob2S+nqqHqgV
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB2DCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDIwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDMwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQRDXDNIi1p
ereudhqwa2LslXgsxnB63Hu5y5lg+1WPruIYPzD/Ho0APveVdzFLVji19+bE4+tF
PYL1SpsN1WfWo4GJMIGGMB0GA1UdDgQWBBQApzZdtBdD3dLxouQpr/aDiVttdzBX
BgNVHSMEUDBOgBT5RCgQ0AlZTQbfFB2+6+w0XRvydaEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAxggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSQAwRgIhAOnd+7bAofkHVa4KFNjv3TCegw1lrhuM
8Of8wgvrTEGoAiEAsS8iKMpSfXH4D0egg4gLamE6akde965rDtySU+ve9lg=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB1zCCAX2gAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDEwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDIwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQWHpv1i6lf
wvNPOP5ka6S0n55EvzoaYK6pbTXP6yMOW/4XZSPKx5Zoq4FMe0cKzGIIFL1rzj1V
2czYB+qvLhyio4GJMIGGMB0GA1UdDgQWBBT5RCgQ0AlZTQbfFB2+6+w0XRvydTBX
BgNVHSMEUDBOgBSh3uHkX5nj86yFEFwjscSWM40P+qEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAwggEBMAwGA1UdEwQF
MAMBAf8wCgYIKoZIzj0EAwIDSAAwRQIhAI7unGW/gr9tOc3i+dF5N815srgh+FrX
oj9Et74EcSpTAiBubv+vOH0DE0gmYI11HeAIgutWqqMIC72dZlwTF/Vi3g==
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIB3jCCAYWgAwIBAgIBATAKBggqhkjOPQQDAjAvMQswCQYDVQQGEwJVSzERMA8G
A1UECgwIbWJlZCBUTFMxDTALBgNVBAMMBENBMDAwHhcNMTcwNjIyMTE1MDMyWhcN
MjcwNjIzMTE1MDMyWjAvMQswCQYDVQQGEwJVSzERMA8GA1UECgwIbWJlZCBUTFMx
DTALBgNVBAMMBENBMDEwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAAQznn9zHHwL
GO8VR4W9V7vMlxCdoojzEOiX5Y6JtPtFOz866ueHY6zoN0/mJ6DnqnSXilJIUUeW
6eGfqmka7nxko4GRMIGOMB0GA1UdDgQWBBSh3uHkX5nj86yFEFwjscSWM40P+jBf
BgNVHSMEWDBWgBQlFYvU5WboI4fcdPoiQs8/fPHZraEzpDEwLzELMAkGA1UEBhMC
VUsxETAPBgNVBAoMCG1iZWQgVExTMQ0wCwYDVQQDDARDQTAwggkA/KCWhcqToHAw
DAYDVR0TBAUwAwEB/zAKBggqhkjOPQQDAgNHADBEAiBasbuinP+pJTU4oDCVD8zQ
1rJBDSOKIEyWu84/D6Hj6wIgVMPUoO01bPhzllAa/gW8Xk/daey09SBgN3AT9pWU
TDA=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIBpTCCAUugAwIBAgIJAPygloXKk6BwMAoGCCqGSM49BAMCMC8xCzAJBgNVBAYT
AlVLMREwDwYDVQQKDAhtYmVkIFRMUzENMAsGA1UEAwwEQ0EwMDAeFw0xNzA2MjIx
MTUwMzJaFw0yNzA2MjMxMTUwMzJaMC8xCzAJBgNVBAYTAlVLMREwDwYDVQQKDAht
YmVkIFRMUzENMAsGA1UEAwwEQ0EwMDBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IA
BFW41/qAwAPpy+Txdc7PKmzZsq9CPiujKU4vpF1ekXnGx2HP420QobwBVVWhkzRm
LwdboH2j65dcCKjQ7mv/dxKjUDBOMB0GA1UdDgQWBBQlFYvU5WboI4fcdPoiQs8/
fPHZrTAfBgNVHSMEGDAWgBQlFYvU5WboI4fcdPoiQs8/fPHZrTAMBgNVHRMEBTAD
AQH/MAoGCCqGSM49BAMCA0gAMEUCIQC7iRcVzwMyfVK5imirJ7MqJQ04euH4CLOt
IZ+SNfaERAIgSU0MWFDosVEIpg8YMqIHeF7Mg4ZyH6+fGazJgVLttUY=
-----END CERTIFICATE-----
| 3,436 | 61 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir-maxpath/10.key | -----BEGIN EC PARAMETERS-----
BggqhkjOPQMBBw==
-----END EC PARAMETERS-----
-----BEGIN EC PRIVATE KEY-----
MHcCAQEEIPuPPMxo5e2doI7YfDp60qmEn4YwYs2sb5QlOpFQ3BIJoAoGCCqGSM49
AwEHoUQDQgAEeo5RimyXeYYg8Te/PYJDnMKchyPcEcAqwAwDsDpDHjwT0ZcBnZu5
sO2fxAJrtus0Zv4XMq7ODKpNi2mw4zyPVw==
-----END EC PRIVATE KEY-----
| 302 | 9 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir1/test-ca.crt | Certificate:
Data:
Version: 3 (0x2)
Serial Number: 0 (0x0)
Signature Algorithm: sha1WithRSAEncryption
Issuer: C=NL, O=PolarSSL, CN=PolarSSL Test CA
Validity
Not Before: Feb 12 14:44:00 2011 GMT
Not After : Feb 12 14:44:00 2021 GMT
Subject: C=NL, O=PolarSSL, CN=PolarSSL Test CA
Subject Public Key Info:
Public Key Algorithm: rsaEncryption
RSA Public Key: (2048 bit)
Modulus (2048 bit):
00:c0:df:37:fc:17:bb:e0:96:9d:3f:86:de:96:32:
7d:44:a5:16:a0:cd:21:f1:99:d4:ec:ea:cb:7c:18:
58:08:94:a5:ec:9b:c5:8b:df:1a:1e:99:38:99:87:
1e:7b:c0:8d:39:df:38:5d:70:78:07:d3:9e:d9:93:
e8:b9:72:51:c5:ce:a3:30:52:a9:f2:e7:40:70:14:
cb:44:a2:72:0b:c2:e5:40:f9:3e:e5:a6:0e:b3:f9:
ec:4a:63:c0:b8:29:00:74:9c:57:3b:a8:a5:04:90:
71:f1:bd:83:d9:3f:d6:a5:e2:3c:2a:8f:ef:27:60:
c3:c6:9f:cb:ba:ec:60:7d:b7:e6:84:32:be:4f:fb:
58:26:22:03:5b:d4:b4:d5:fb:f5:e3:96:2e:70:c0:
e4:2e:bd:fc:2e:ee:e2:41:55:c0:34:2e:7d:24:72:
69:cb:47:b1:14:40:83:7d:67:f4:86:f6:31:ab:f1:
79:a4:b2:b5:2e:12:f9:84:17:f0:62:6f:27:3e:13:
58:b1:54:0d:21:9a:73:37:a1:30:cf:6f:92:dc:f6:
e9:fc:ac:db:2e:28:d1:7e:02:4b:23:a0:15:f2:38:
65:64:09:ea:0c:6e:8e:1b:17:a0:71:c8:b3:9b:c9:
ab:e9:c3:f2:cf:87:96:8f:80:02:32:9e:99:58:6f:
a2:d5
Exponent: 65537 (0x10001)
X509v3 extensions:
X509v3 Basic Constraints:
CA:TRUE
X509v3 Subject Key Identifier:
B4:5A:E4:A5:B3:DE:D2:52:F6:B9:D5:A6:95:0F:EB:3E:BC:C7:FD:FF
X509v3 Authority Key Identifier:
keyid:B4:5A:E4:A5:B3:DE:D2:52:F6:B9:D5:A6:95:0F:EB:3E:BC:C7:FD:FF
DirName:/C=NL/O=PolarSSL/CN=PolarSSL Test CA
serial:00
Signature Algorithm: sha1WithRSAEncryption
b8:fd:54:d8:00:54:90:8b:25:b0:27:dd:95:cd:a2:f7:84:07:
1d:87:89:4a:c4:78:11:d8:07:b5:d7:22:50:8e:48:eb:62:7a:
32:89:be:63:47:53:ff:b6:be:f1:2e:8c:54:c0:99:3f:a0:b9:
37:23:72:5f:0d:46:59:8f:d8:47:cd:97:4c:9f:07:0c:12:62:
09:3a:24:e4:36:d9:e9:2c:da:38:d0:73:75:61:d7:c1:6c:26:
8b:9b:e0:d5:dc:67:ed:8c:6b:33:d7:74:22:3c:4c:db:b5:8d:
2a:ce:2c:0d:08:59:05:09:05:a6:39:9f:b3:67:1b:e2:83:e5:
e1:8f:53:f6:67:93:c7:f9:6f:76:44:58:12:e8:3a:d4:97:e7:
e9:c0:3e:a8:7a:72:3d:87:53:1f:e5:2c:84:84:e7:9a:9e:7f:
66:d9:1f:9b:f5:13:48:b0:4d:14:d1:de:b2:24:d9:78:7d:f5:
35:cc:58:19:d1:d2:99:ef:4d:73:f8:1f:89:d4:5a:d0:52:ce:
09:f5:b1:46:51:6a:00:8e:3b:cc:6f:63:01:00:99:ed:9d:a6:
08:60:cd:32:18:d0:73:e0:58:71:d9:e5:d2:53:d7:8d:d0:ca:
e9:5d:2a:0a:0d:5d:55:ec:21:50:17:16:e6:06:4a:cd:5e:de:
f7:e0:e9:54
-----BEGIN CERTIFICATE-----
MIIDhzCCAm+gAwIBAgIBADANBgkqhkiG9w0BAQUFADA7MQswCQYDVQQGEwJOTDER
MA8GA1UEChMIUG9sYXJTU0wxGTAXBgNVBAMTEFBvbGFyU1NMIFRlc3QgQ0EwHhcN
MTEwMjEyMTQ0NDAwWhcNMjEwMjEyMTQ0NDAwWjA7MQswCQYDVQQGEwJOTDERMA8G
A1UEChMIUG9sYXJTU0wxGTAXBgNVBAMTEFBvbGFyU1NMIFRlc3QgQ0EwggEiMA0G
CSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQDA3zf8F7vglp0/ht6WMn1EpRagzSHx
mdTs6st8GFgIlKXsm8WL3xoemTiZhx57wI053zhdcHgH057Zk+i5clHFzqMwUqny
50BwFMtEonILwuVA+T7lpg6z+exKY8C4KQB0nFc7qKUEkHHxvYPZP9al4jwqj+8n
YMPGn8u67GB9t+aEMr5P+1gmIgNb1LTV+/Xjli5wwOQuvfwu7uJBVcA0Ln0kcmnL
R7EUQIN9Z/SG9jGr8XmksrUuEvmEF/Bibyc+E1ixVA0hmnM3oTDPb5Lc9un8rNsu
KNF+AksjoBXyOGVkCeoMbo4bF6BxyLObyavpw/LPh5aPgAIynplYb6LVAgMBAAGj
gZUwgZIwDAYDVR0TBAUwAwEB/zAdBgNVHQ4EFgQUtFrkpbPe0lL2udWmlQ/rPrzH
/f8wYwYDVR0jBFwwWoAUtFrkpbPe0lL2udWmlQ/rPrzH/f+hP6Q9MDsxCzAJBgNV
BAYTAk5MMREwDwYDVQQKEwhQb2xhclNTTDEZMBcGA1UEAxMQUG9sYXJTU0wgVGVz
dCBDQYIBADANBgkqhkiG9w0BAQUFAAOCAQEAuP1U2ABUkIslsCfdlc2i94QHHYeJ
SsR4EdgHtdciUI5I62J6Mom+Y0dT/7a+8S6MVMCZP6C5NyNyXw1GWY/YR82XTJ8H
DBJiCTok5DbZ6SzaONBzdWHXwWwmi5vg1dxn7YxrM9d0IjxM27WNKs4sDQhZBQkF
pjmfs2cb4oPl4Y9T9meTx/lvdkRYEug61Jfn6cA+qHpyPYdTH+UshITnmp5/Ztkf
m/UTSLBNFNHesiTZeH31NcxYGdHSme9Nc/gfidRa0FLOCfWxRlFqAI47zG9jAQCZ
7Z2mCGDNMhjQc+BYcdnl0lPXjdDK6V0qCg1dVewhUBcW5gZKzV7e9+DpVA==
-----END CERTIFICATE-----
| 4,357 | 81 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir2/test-ca.crt | Certificate:
Data:
Version: 3 (0x2)
Serial Number: 0 (0x0)
Signature Algorithm: sha1WithRSAEncryption
Issuer: C=NL, O=PolarSSL, CN=PolarSSL Test CA
Validity
Not Before: Feb 12 14:44:00 2011 GMT
Not After : Feb 12 14:44:00 2021 GMT
Subject: C=NL, O=PolarSSL, CN=PolarSSL Test CA
Subject Public Key Info:
Public Key Algorithm: rsaEncryption
RSA Public Key: (2048 bit)
Modulus (2048 bit):
00:c0:df:37:fc:17:bb:e0:96:9d:3f:86:de:96:32:
7d:44:a5:16:a0:cd:21:f1:99:d4:ec:ea:cb:7c:18:
58:08:94:a5:ec:9b:c5:8b:df:1a:1e:99:38:99:87:
1e:7b:c0:8d:39:df:38:5d:70:78:07:d3:9e:d9:93:
e8:b9:72:51:c5:ce:a3:30:52:a9:f2:e7:40:70:14:
cb:44:a2:72:0b:c2:e5:40:f9:3e:e5:a6:0e:b3:f9:
ec:4a:63:c0:b8:29:00:74:9c:57:3b:a8:a5:04:90:
71:f1:bd:83:d9:3f:d6:a5:e2:3c:2a:8f:ef:27:60:
c3:c6:9f:cb:ba:ec:60:7d:b7:e6:84:32:be:4f:fb:
58:26:22:03:5b:d4:b4:d5:fb:f5:e3:96:2e:70:c0:
e4:2e:bd:fc:2e:ee:e2:41:55:c0:34:2e:7d:24:72:
69:cb:47:b1:14:40:83:7d:67:f4:86:f6:31:ab:f1:
79:a4:b2:b5:2e:12:f9:84:17:f0:62:6f:27:3e:13:
58:b1:54:0d:21:9a:73:37:a1:30:cf:6f:92:dc:f6:
e9:fc:ac:db:2e:28:d1:7e:02:4b:23:a0:15:f2:38:
65:64:09:ea:0c:6e:8e:1b:17:a0:71:c8:b3:9b:c9:
ab:e9:c3:f2:cf:87:96:8f:80:02:32:9e:99:58:6f:
a2:d5
Exponent: 65537 (0x10001)
X509v3 extensions:
X509v3 Basic Constraints:
CA:TRUE
X509v3 Subject Key Identifier:
B4:5A:E4:A5:B3:DE:D2:52:F6:B9:D5:A6:95:0F:EB:3E:BC:C7:FD:FF
X509v3 Authority Key Identifier:
keyid:B4:5A:E4:A5:B3:DE:D2:52:F6:B9:D5:A6:95:0F:EB:3E:BC:C7:FD:FF
DirName:/C=NL/O=PolarSSL/CN=PolarSSL Test CA
serial:00
Signature Algorithm: sha1WithRSAEncryption
b8:fd:54:d8:00:54:90:8b:25:b0:27:dd:95:cd:a2:f7:84:07:
1d:87:89:4a:c4:78:11:d8:07:b5:d7:22:50:8e:48:eb:62:7a:
32:89:be:63:47:53:ff:b6:be:f1:2e:8c:54:c0:99:3f:a0:b9:
37:23:72:5f:0d:46:59:8f:d8:47:cd:97:4c:9f:07:0c:12:62:
09:3a:24:e4:36:d9:e9:2c:da:38:d0:73:75:61:d7:c1:6c:26:
8b:9b:e0:d5:dc:67:ed:8c:6b:33:d7:74:22:3c:4c:db:b5:8d:
2a:ce:2c:0d:08:59:05:09:05:a6:39:9f:b3:67:1b:e2:83:e5:
e1:8f:53:f6:67:93:c7:f9:6f:76:44:58:12:e8:3a:d4:97:e7:
e9:c0:3e:a8:7a:72:3d:87:53:1f:e5:2c:84:84:e7:9a:9e:7f:
66:d9:1f:9b:f5:13:48:b0:4d:14:d1:de:b2:24:d9:78:7d:f5:
35:cc:58:19:d1:d2:99:ef:4d:73:f8:1f:89:d4:5a:d0:52:ce:
09:f5:b1:46:51:6a:00:8e:3b:cc:6f:63:01:00:99:ed:9d:a6:
08:60:cd:32:18:d0:73:e0:58:71:d9:e5:d2:53:d7:8d:d0:ca:
e9:5d:2a:0a:0d:5d:55:ec:21:50:17:16:e6:06:4a:cd:5e:de:
f7:e0:e9:54
-----BEGIN CERTIFICATE-----
MIIDhzCCAm+gAwIBAgIBADANBgkqhkiG9w0BAQUFADA7MQswCQYDVQQGEwJOTDER
MA8GA1UEChMIUG9sYXJTU0wxGTAXBgNVBAMTEFBvbGFyU1NMIFRlc3QgQ0EwHhcN
MTEwMjEyMTQ0NDAwWhcNMjEwMjEyMTQ0NDAwWjA7MQswCQYDVQQGEwJOTDERMA8G
A1UEChMIUG9sYXJTU0wxGTAXBgNVBAMTEFBvbGFyU1NMIFRlc3QgQ0EwggEiMA0G
CSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQDA3zf8F7vglp0/ht6WMn1EpRagzSHx
mdTs6st8GFgIlKXsm8WL3xoemTiZhx57wI053zhdcHgH057Zk+i5clHFzqMwUqny
50BwFMtEonILwuVA+T7lpg6z+exKY8C4KQB0nFc7qKUEkHHxvYPZP9al4jwqj+8n
YMPGn8u67GB9t+aEMr5P+1gmIgNb1LTV+/Xjli5wwOQuvfwu7uJBVcA0Ln0kcmnL
R7EUQIN9Z/SG9jGr8XmksrUuEvmEF/Bibyc+E1ixVA0hmnM3oTDPb5Lc9un8rNsu
KNF+AksjoBXyOGVkCeoMbo4bF6BxyLObyavpw/LPh5aPgAIynplYb6LVAgMBAAGj
gZUwgZIwDAYDVR0TBAUwAwEB/zAdBgNVHQ4EFgQUtFrkpbPe0lL2udWmlQ/rPrzH
/f8wYwYDVR0jBFwwWoAUtFrkpbPe0lL2udWmlQ/rPrzH/f+hP6Q9MDsxCzAJBgNV
BAYTAk5MMREwDwYDVQQKEwhQb2xhclNTTDEZMBcGA1UEAxMQUG9sYXJTU0wgVGVz
dCBDQYIBADANBgkqhkiG9w0BAQUFAAOCAQEAuP1U2ABUkIslsCfdlc2i94QHHYeJ
SsR4EdgHtdciUI5I62J6Mom+Y0dT/7a+8S6MVMCZP6C5NyNyXw1GWY/YR82XTJ8H
DBJiCTok5DbZ6SzaONBzdWHXwWwmi5vg1dxn7YxrM9d0IjxM27WNKs4sDQhZBQkF
pjmfs2cb4oPl4Y9T9meTx/lvdkRYEug61Jfn6cA+qHpyPYdTH+UshITnmp5/Ztkf
m/UTSLBNFNHesiTZeH31NcxYGdHSme9Nc/gfidRa0FLOCfWxRlFqAI47zG9jAQCZ
7Z2mCGDNMhjQc+BYcdnl0lPXjdDK6V0qCg1dVewhUBcW5gZKzV7e9+DpVA==
-----END CERTIFICATE-----
| 4,357 | 81 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir2/test-ca2.crt | -----BEGIN CERTIFICATE-----
MIICUjCCAdegAwIBAgIJAMFD4n5iQ8zoMAoGCCqGSM49BAMCMD4xCzAJBgNVBAYT
Ak5MMREwDwYDVQQKEwhQb2xhclNTTDEcMBoGA1UEAxMTUG9sYXJzc2wgVGVzdCBF
QyBDQTAeFw0xMzA5MjQxNTQ5NDhaFw0yMzA5MjIxNTQ5NDhaMD4xCzAJBgNVBAYT
Ak5MMREwDwYDVQQKEwhQb2xhclNTTDEcMBoGA1UEAxMTUG9sYXJzc2wgVGVzdCBF
QyBDQTB2MBAGByqGSM49AgEGBSuBBAAiA2IABMPaKzRBN1gvh1b+/Im6KUNLTuBu
ww5XUzM5WNRStJGVOQsj318XJGJI/BqVKc4sLYfCiFKAr9ZqqyHduNMcbli4yuiy
aY7zQa0pw7RfdadHb9UZKVVpmlM7ILRmFmAzHqOBoDCBnTAdBgNVHQ4EFgQUnW0g
JEkBPyvLeLUZvH4kydv7NnwwbgYDVR0jBGcwZYAUnW0gJEkBPyvLeLUZvH4kydv7
NnyhQqRAMD4xCzAJBgNVBAYTAk5MMREwDwYDVQQKEwhQb2xhclNTTDEcMBoGA1UE
AxMTUG9sYXJzc2wgVGVzdCBFQyBDQYIJAMFD4n5iQ8zoMAwGA1UdEwQFMAMBAf8w
CgYIKoZIzj0EAwIDaQAwZgIxAMO0YnNWKJUAfXgSJtJxexn4ipg+kv4znuR50v56
t4d0PCu412mUC6Nnd7izvtE2MgIxAP1nnJQjZ8BWukszFQDG48wxCCyci9qpdSMv
uCjn8pwUOkABXK8Mss90fzCfCEOtIA==
-----END CERTIFICATE-----
| 867 | 16 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir3/test-ca.crt | Certificate:
Data:
Version: 3 (0x2)
Serial Number: 0 (0x0)
Signature Algorithm: sha1WithRSAEncryption
Issuer: C=NL, O=PolarSSL, CN=PolarSSL Test CA
Validity
Not Before: Feb 12 14:44:00 2011 GMT
Not After : Feb 12 14:44:00 2021 GMT
Subject: C=NL, O=PolarSSL, CN=PolarSSL Test CA
Subject Public Key Info:
Public Key Algorithm: rsaEncryption
RSA Public Key: (2048 bit)
Modulus (2048 bit):
00:c0:df:37:fc:17:bb:e0:96:9d:3f:86:de:96:32:
7d:44:a5:16:a0:cd:21:f1:99:d4:ec:ea:cb:7c:18:
58:08:94:a5:ec:9b:c5:8b:df:1a:1e:99:38:99:87:
1e:7b:c0:8d:39:df:38:5d:70:78:07:d3:9e:d9:93:
e8:b9:72:51:c5:ce:a3:30:52:a9:f2:e7:40:70:14:
cb:44:a2:72:0b:c2:e5:40:f9:3e:e5:a6:0e:b3:f9:
ec:4a:63:c0:b8:29:00:74:9c:57:3b:a8:a5:04:90:
71:f1:bd:83:d9:3f:d6:a5:e2:3c:2a:8f:ef:27:60:
c3:c6:9f:cb:ba:ec:60:7d:b7:e6:84:32:be:4f:fb:
58:26:22:03:5b:d4:b4:d5:fb:f5:e3:96:2e:70:c0:
e4:2e:bd:fc:2e:ee:e2:41:55:c0:34:2e:7d:24:72:
69:cb:47:b1:14:40:83:7d:67:f4:86:f6:31:ab:f1:
79:a4:b2:b5:2e:12:f9:84:17:f0:62:6f:27:3e:13:
58:b1:54:0d:21:9a:73:37:a1:30:cf:6f:92:dc:f6:
e9:fc:ac:db:2e:28:d1:7e:02:4b:23:a0:15:f2:38:
65:64:09:ea:0c:6e:8e:1b:17:a0:71:c8:b3:9b:c9:
ab:e9:c3:f2:cf:87:96:8f:80:02:32:9e:99:58:6f:
a2:d5
Exponent: 65537 (0x10001)
X509v3 extensions:
X509v3 Basic Constraints:
CA:TRUE
X509v3 Subject Key Identifier:
B4:5A:E4:A5:B3:DE:D2:52:F6:B9:D5:A6:95:0F:EB:3E:BC:C7:FD:FF
X509v3 Authority Key Identifier:
keyid:B4:5A:E4:A5:B3:DE:D2:52:F6:B9:D5:A6:95:0F:EB:3E:BC:C7:FD:FF
DirName:/C=NL/O=PolarSSL/CN=PolarSSL Test CA
serial:00
Signature Algorithm: sha1WithRSAEncryption
b8:fd:54:d8:00:54:90:8b:25:b0:27:dd:95:cd:a2:f7:84:07:
1d:87:89:4a:c4:78:11:d8:07:b5:d7:22:50:8e:48:eb:62:7a:
32:89:be:63:47:53:ff:b6:be:f1:2e:8c:54:c0:99:3f:a0:b9:
37:23:72:5f:0d:46:59:8f:d8:47:cd:97:4c:9f:07:0c:12:62:
09:3a:24:e4:36:d9:e9:2c:da:38:d0:73:75:61:d7:c1:6c:26:
8b:9b:e0:d5:dc:67:ed:8c:6b:33:d7:74:22:3c:4c:db:b5:8d:
2a:ce:2c:0d:08:59:05:09:05:a6:39:9f:b3:67:1b:e2:83:e5:
e1:8f:53:f6:67:93:c7:f9:6f:76:44:58:12:e8:3a:d4:97:e7:
e9:c0:3e:a8:7a:72:3d:87:53:1f:e5:2c:84:84:e7:9a:9e:7f:
66:d9:1f:9b:f5:13:48:b0:4d:14:d1:de:b2:24:d9:78:7d:f5:
35:cc:58:19:d1:d2:99:ef:4d:73:f8:1f:89:d4:5a:d0:52:ce:
09:f5:b1:46:51:6a:00:8e:3b:cc:6f:63:01:00:99:ed:9d:a6:
08:60:cd:32:18:d0:73:e0:58:71:d9:e5:d2:53:d7:8d:d0:ca:
e9:5d:2a:0a:0d:5d:55:ec:21:50:17:16:e6:06:4a:cd:5e:de:
f7:e0:e9:54
-----BEGIN CERTIFICATE-----
MIIDhzCCAm+gAwIBAgIBADANBgkqhkiG9w0BAQUFADA7MQswCQYDVQQGEwJOTDER
MA8GA1UEChMIUG9sYXJTU0wxGTAXBgNVBAMTEFBvbGFyU1NMIFRlc3QgQ0EwHhcN
MTEwMjEyMTQ0NDAwWhcNMjEwMjEyMTQ0NDAwWjA7MQswCQYDVQQGEwJOTDERMA8G
A1UEChMIUG9sYXJTU0wxGTAXBgNVBAMTEFBvbGFyU1NMIFRlc3QgQ0EwggEiMA0G
CSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQDA3zf8F7vglp0/ht6WMn1EpRagzSHx
mdTs6st8GFgIlKXsm8WL3xoemTiZhx57wI053zhdcHgH057Zk+i5clHFzqMwUqny
50BwFMtEonILwuVA+T7lpg6z+exKY8C4KQB0nFc7qKUEkHHxvYPZP9al4jwqj+8n
YMPGn8u67GB9t+aEMr5P+1gmIgNb1LTV+/Xjli5wwOQuvfwu7uJBVcA0Ln0kcmnL
R7EUQIN9Z/SG9jGr8XmksrUuEvmEF/Bibyc+E1ixVA0hmnM3oTDPb5Lc9un8rNsu
KNF+AksjoBXyOGVkCeoMbo4bF6BxyLObyavpw/LPh5aPgAIynplYb6LVAgMBAAGj
gZUwgZIwDAYDVR0TBAUwAwEB/zAdBgNVHQ4EFgQUtFrkpbPe0lL2udWmlQ/rPrzH
/f8wYwYDVR0jBFwwWoAUtFrkpbPe0lL2udWmlQ/rPrzH/f+hP6Q9MDsxCzAJBgNV
BAYTAk5MMREwDwYDVQQKEwhQb2xhclNTTDEZMBcGA1UEAxMQUG9sYXJTU0wgVGVz
dCBDQYIBADANBgkqhkiG9w0BAQUFAAOCAQEAuP1U2ABUkIslsCfdlc2i94QHHYeJ
SsR4EdgHtdciUI5I62J6Mom+Y0dT/7a+8S6MVMCZP6C5NyNyXw1GWY/YR82XTJ8H
DBJiCTok5DbZ6SzaONBzdWHXwWwmi5vg1dxn7YxrM9d0IjxM27WNKs4sDQhZBQkF
pjmfs2cb4oPl4Y9T9meTx/lvdkRYEug61Jfn6cA+qHpyPYdTH+UshITnmp5/Ztkf
m/UTSLBNFNHesiTZeH31NcxYGdHSme9Nc/gfidRa0FLOCfWxRlFqAI47zG9jAQCZ
7Z2mCGDNMhjQc+BYcdnl0lPXjdDK6V0qCg1dVewhUBcW5gZKzV7e9+DpVA==
-----END CERTIFICATE-----
| 4,357 | 81 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir3/Readme | This is just to make sure files that don't parse as certs are ignored.
| 71 | 2 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/dir3/test-ca2.crt | -----BEGIN CERTIFICATE-----
MIICUjCCAdegAwIBAgIJAMFD4n5iQ8zoMAoGCCqGSM49BAMCMD4xCzAJBgNVBAYT
Ak5MMREwDwYDVQQKEwhQb2xhclNTTDEcMBoGA1UEAxMTUG9sYXJzc2wgVGVzdCBF
QyBDQTAeFw0xMzA5MjQxNTQ5NDhaFw0yMzA5MjIxNTQ5NDhaMD4xCzAJBgNVBAYT
Ak5MMREwDwYDVQQKEwhQb2xhclNTTDEcMBoGA1UEAxMTUG9sYXJzc2wgVGVzdCBF
QyBDQTB2MBAGByqGSM49AgEGBSuBBAAiA2IABMPaKzRBN1gvh1b+/Im6KUNLTuBu
ww5XUzM5WNRStJGVOQsj318XJGJI/BqVKc4sLYfCiFKAr9ZqqyHduNMcbli4yuiy
aY7zQa0pw7RfdadHb9UZKVVpmlM7ILRmFmAzHqOBoDCBnTAdBgNVHQ4EFgQUnW0g
JEkBPyvLeLUZvH4kydv7NnwwbgYDVR0jBGcwZYAUnW0gJEkBPyvLeLUZvH4kydv7
NnyhQqRAMD4xCzAJBgNVBAYTAk5MMREwDwYDVQQKEwhQb2xhclNTTDEcMBoGA1UE
AxMTUG9sYXJzc2wgVGVzdCBFQyBDQYIJAMFD4n5iQ8zoMAwGA1UdEwQFMAMBAf8w
CgYIKoZIzj0EAwIDaQAwZgIxAMO0YnNWKJUAfXgSJtJxexn4ipg+kv4znuR50v56
t4d0PCu412mUC6Nnd7izvtE2MgIxAP1nnJQjZ8BWukszFQDG48wxCCyci9qpdSMv
uCjn8pwUOkABXK8Mss90fzCfCEOtIA==
-----END CERTIFICATE-----
| 867 | 16 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/cli_cid.txt | // Client, CID 0xBEEF
AhUAAH8AAA8AAAQ8AAAAAF6MZUPMqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABh7h8/aprLN1fS0KwLkZzKcsa5LNtDW7sYu7d1z7fNetuRjLJpX/A1mTSqeBY7li8AAAAAAAM7MIIDNzCCAh+gAwIBAgIBAjANBgkqhkiG9w0BAQsFADA7MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxGTAXBgNVBAMMEFBvbGFyU1NMIFRlc3QgQ0EwHhcNMTkwMjEwMTQ0NDA2WhcNMjkwMjEwMTQ0NDA2WjA0MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxEjAQBgNVBAMMCWxvY2FsaG9zdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMFNo93nzR3RBNdJcriZrA545Do8Ss86ExbQWuTNowCIp+4ea5anUrSQ7y1yej4kmvy2NKwk9XfgJmSMnLAofaHa6ozmyRyWvP7BBFKzNtSj+uGxdtiQwWG0ZlI2oiZTqqt0Xgd9GYLbKtgfoNkNHC1JZvdbJXNG6AuKT2kMtQCQ4dqCEGZ9rlQri2V5kaHiYcPNQEkI7mgM8YuG0ka/0LiqEQMef1aoGh5EGA8PhYvai0Re4hjGYi/HZo36Xdh98yeJKQHFkA4/J/EwyEoO79bex8cna8cFPXrEAjyaHT4P6DSYW8tzS1KW2BGiLICIaTla0w+w3lkvEcf36hIBMJcCAwEAAaNNMEswCQYDVR0TBAIwADAdBgNVHQ4EFgQUpQXoZLjc32APUBJNYKhkr02LQ5MwHwYDVR0jBBgwFoAUtFrkpbPe0lL2udWmlQ/rPrzH/f8wDQYJKoZIhvcNAQELBQADggEBAC465FJhPqel7zJngHIHJrqj/wVAxGAFOTF396XKATGAp+HRCqJ81Ry60CNK1jDzk8dv6M6UHoS7RIFiM/9rXQCbJfiPD5xMTejZp5n5UYHAmxsxDaazfA5FuBhkfokKK6jD4Eq91C94xGKb6X4/VkaPF7cqoBBw/bHxawXc0UEPjqayiBpCYU/rJoVZgLqFVP7Px3sva1nOrNx8rPPI1hJ+ZOg8maiPTxHZnBVLakSSLQy/sWeWyazO1RnrbxjrbgQtYKz0e3nwGpu1w13vfckFmUSBhHXH7AAS/HpKC4IH7G2GAk3+n8iSSN71sZzpxonQwVbopMZqLmbBm/7WPLcAAJRZtK1pHRuu/Uw+Y91KCaqMAHKWeVJvuqjiTaElrahsx+HYoZ1+8i5BMY1NOL/y4TR9qZdxY+7NvNrEdEoFgcI/DqUN0aKs0zAIPmk92pFnjnbro5LxWRm3JbtIFcG6PdN+9aAbISrewt6EERIPhS45aH+Si08NLrvM+CcEBfqBBqOD+4LCZqT8nDBtALJyRqiykibsAAFRgAAAAF6MZUNak74BhbcgvZ2M8WhZKjQyCix7GJzRs4SqnD7iXoxlQ7YXjsVI0K/xyMOJPkT9ZcPEi/2jHGIte1ZduW4Cvu8C3q0AAAAAAAAAAAAAAAIAAAAAAAAABwAAAQAAAAAAAwAAAA==
| 1,623 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/def_b64_ff.bin | // Ensure that the b64 parser continues after encountering a 0xFF
// character. Note that this byte is invalid UTF-8, making this
// entire file invalid UTF-8. Use care when editing.
// -> ÿ <-
AhUAAH8AAA4AAABtAAAAAF6HQx3MqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACG2QbHbUj8eGpdx5KVIebiwk0jvRj9/3m6BOSzpA7qBXeEunhqr3D11NE7ciGjeHMAAACAAAAAAAAAAAAAAAAAAV6HQx248L77RH0Z973tSYNQ8zBsz861CZG5/T09TJz3XodDHe/iJ+cgXb5An3zTdnTBtw3EWAb68T+gCE33GN8AAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAgAAAA==
| 489 | 6 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/srv_min_cfg.txt | // Minimal configuration
AhUAAAMAAAAAAABjAAAAAF6LZlLMqAAgUGktPmpSPbzRPipeCpYJtp5SNIIjTr3R121WF9AeWN4tmKbRhhv+yPMjY0yWPrHLy7lLLhwNFBwCD6eQ0ULZZ15Fi2Rhae/4ZkAR0BN2iCMAAACAAAAAXotmUkMC6aU6s7O5InjmEEeg4ySLZkNDf0Ut/s06/cBei2ZS+kkKS3sJso2u418jlrlKiesyUOW+xXwOD8bYZQAAAQAAAAAAAgAA
| 274 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/def_b64_too_big_2.txt | // Context with added '1234' in the middle of code to simulate too much data
AhUAAH8AAA4AAAQ8AAAAAF6HQx3MqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACG2QbHbUj8eGpdx5KVIebiwk0jvRj9/3m6BOSzpA7qBXeEunhqr3D11NE7ciGjeHMAAAAAAAM7MIIDNzCCAh+gAwIBAgIBAjANBgkqhkiG9w0BAQsFADA7MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxGTAXBgNVBAMMEFBvbGFyU1NMIFRlc3QgQ0EwHhcNMTkwMjEwMTQ0NDA2WhcNMjkwMjEwMTQ0NDA2WjA0MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxEjAQBgNVBAMMCWxvY2FsaG9zdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMFNo93nzR3RBNdJcriZrA545Do8Ss86ExbQWuTNowCIp+4ea5anUrSQ7y1yej4kmvy2NKwk9XfgJmSMnLAofaHa6ozmyRyWvP7BBFKzNtSj+uGxdtiQwWG0ZlI2oiZTqqt0Xgd9GYLbKtgfoNkNHC1JZvdbJXNG6AuKT2kMtQCQ4dqCEGZ9rlQri2V5kaHiYcPNQEkI7m1234gM8YuG0ka/0LiqEQMef1aoGh5EGA8PhYvai0Re4hjGYi/HZo36Xdh98yeJKQHFkA4/J/EwyEoO79bex8cna8cFPXrEAjyaHT4P6DSYW8tzS1KW2BGiLICIaTla0w+w3lkvEcf36hIBMJcCAwEAAaNNMEswCQYDVR0TBAIwADAdBgNVHQ4EFgQUpQXoZLjc32APUBJNYKhkr02LQ5MwHwYDVR0jBBgwFoAUtFrkpbPe0lL2udWmlQ/rPrzH/f8wDQYJKoZIhvcNAQELBQADggEBAC465FJhPqel7zJngHIHJrqj/wVAxGAFOTF396XKATGAp+HRCqJ81Ry60CNK1jDzk8dv6M6UHoS7RIFiM/9rXQCbJfiPD5xMTejZp5n5UYHAmxsxDaazfA5FuBhkfokKK6jD4Eq91C94xGKb6X4/VkaPF7cqoBBw/bHxawXc0UEPjqayiBpCYU/rJoVZgLqFVP7Px3sva1nOrNx8rPPI1hJ+ZOg8maiPTxHZnBVLakSSLQy/sWeWyazO1RnrbxjrbgQtYKz0e3nwGpu1w13vfckFmUSBhHXH7AAS/HpKC4IH7G2GAk3+n8iSSN71sZzpxonQwVbopMZqLmbBm/7WPLcAAJTfQC2Ek91INP5ihHNzImPOAHJCk+YTO/pQuEnNWwXbdmKAi+IRp671iAwtpkjSxCBXVzKX925F1A66caCOQptlw+9zFukDQgblM2JyAJLG0j6B4RtBTDWJ8ZTMUPHUoLJoEpm8APZgRi//DMRyCKP9pbBLGlDzgUvl0w11LzBAlJHkWau5NoqQBlG7w4HFrKweovskAAFRgAAAAF6HQx248L77RH0Z973tSYNQ8zBsz861CZG5/T09TJz3XodDHe/iJ+cgXb5An3zTdnTBtw3EWAb68T+gCE33GN8AAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAgAAAA==
| 1,674 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/srv_no_keep_cert.txt | // Without MBEDTLS_SSL_KEEP_PEER_CERTIFICATE
AhUAAAMAAAAAAABiAAAAAF6MKhTMqAAgSKCqXrcrmjqOBpxsGO3itQB09YgsSJwXmZB12QlB+wwhiof0mzAN0hupkLxu4Yyc9SgyFoEDPKJk8TiRo8bO2rkEfPItB5lUFkJwzdeuGVMAAACAAABejCoUbOvW/qbIhlAKPDit31OByjhzXYt+rZNtvknHLV6MKhRMr8xnL27SNFX1iypTpQ7/ksAtPGXQjWvkQWfwAAABAAAAAAACAAA=
| 294 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/cli_no_packing.txt | // Without DTLS packing
AhUAAH8AAA4AAAQ8AAAAAF6LCM/MqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACfl0tXNmshIQEqiEflQGnVUKkIFl1on/Mu0pjWes3XwQgdwmy9xMzpVyYU5gBOsOEAAAAAAAM7MIIDNzCCAh+gAwIBAgIBAjANBgkqhkiG9w0BAQsFADA7MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxGTAXBgNVBAMMEFBvbGFyU1NMIFRlc3QgQ0EwHhcNMTkwMjEwMTQ0NDA2WhcNMjkwMjEwMTQ0NDA2WjA0MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxEjAQBgNVBAMMCWxvY2FsaG9zdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMFNo93nzR3RBNdJcriZrA545Do8Ss86ExbQWuTNowCIp+4ea5anUrSQ7y1yej4kmvy2NKwk9XfgJmSMnLAofaHa6ozmyRyWvP7BBFKzNtSj+uGxdtiQwWG0ZlI2oiZTqqt0Xgd9GYLbKtgfoNkNHC1JZvdbJXNG6AuKT2kMtQCQ4dqCEGZ9rlQri2V5kaHiYcPNQEkI7mgM8YuG0ka/0LiqEQMef1aoGh5EGA8PhYvai0Re4hjGYi/HZo36Xdh98yeJKQHFkA4/J/EwyEoO79bex8cna8cFPXrEAjyaHT4P6DSYW8tzS1KW2BGiLICIaTla0w+w3lkvEcf36hIBMJcCAwEAAaNNMEswCQYDVR0TBAIwADAdBgNVHQ4EFgQUpQXoZLjc32APUBJNYKhkr02LQ5MwHwYDVR0jBBgwFoAUtFrkpbPe0lL2udWmlQ/rPrzH/f8wDQYJKoZIhvcNAQELBQADggEBAC465FJhPqel7zJngHIHJrqj/wVAxGAFOTF396XKATGAp+HRCqJ81Ry60CNK1jDzk8dv6M6UHoS7RIFiM/9rXQCbJfiPD5xMTejZp5n5UYHAmxsxDaazfA5FuBhkfokKK6jD4Eq91C94xGKb6X4/VkaPF7cqoBBw/bHxawXc0UEPjqayiBpCYU/rJoVZgLqFVP7Px3sva1nOrNx8rPPI1hJ+ZOg8maiPTxHZnBVLakSSLQy/sWeWyazO1RnrbxjrbgQtYKz0e3nwGpu1w13vfckFmUSBhHXH7AAS/HpKC4IH7G2GAk3+n8iSSN71sZzpxonQwVbopMZqLmbBm/7WPLcAAJRTvlE7NmNNLDESUBoGC+K2AHIKA+/lhdRVF4YcMvvqCBYFB5tj0oyCikftfjNbvjl9YPGqcRXk664YieWv/pz8U1FOENipbjXF9lFhgedG2Xanh/2FwHX5txYiHIJxJeLEKCXp5Sjt9XBvQsrryxLyX9l+zkLKm7bCAcrfk4h/YoqxecAI63isG9vnrS7o07iD/3mOAAFRgAAAAF6LCM+1uRpyaoyfzuNGBJK9DgBWIWtrPpu7KM8qsC/FXosIz/YIPhveZ8Z4IR0g/McAMQwzQoK5tScSE0DD3BwAAAAAAAAAAAAAAAEAAAAAAAAAAwEAAQAAAAAAAgAAAA==
| 1,617 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/v2.19.1.txt | // Context creaded by MbedTLS v.2.19.1
AhMBAH8AAA8AAAGjAAAAAF5iHYLArgAgkQE4V2NJsjbOuO52ws/u75f6Cg126zWeI7a+kaxTqKLbdWWZmW3PP+SflLxBA7Trpb0qZ5MP8+m0leylnLcDt2TtIWR49MOuiJuvVuMJmtwAAAAAAAE2MIIBMjCB2qADAgECAgYBcK9AtOYwCgYIKoZIzj0EAwIwDTELMAkGA1UEAwwCY2EwIBcNMjAwMzA2MDk1MDE4WhgPMjA1NjAyMjYwOTUwMThaMDMxDzANBgNVBAcTBjE2MDAwMTENMAsGA1UECxMEYWNjMTERMA8GA1UEAxMIZGV2aWNlMDEwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAARn0TtinN6/runzIuF2f2uTH1f0mQOFXu3uRPtQji2ObccSsw6Cn9z7XWK9fRgeoOKA0WZC+O9L9IEWieS13ajFMAoGCCqGSM49BAMCA0cAMEQCIFoavpekQjIqubJ09jkMR+iiUpkGdFRla1R7onnc5iEOAiBAvYr8j9QqjpM2jColTS1cI0z29PBbuasq4HI6YCj0wgAAAAAAAAAAAAFeYh2Ct3LnESwmdWzU+xs7vV2Q0T5HJ8y4ckhpO7wOoF5iHYJ38gKFI3Qdc3BR48GV7nuBUKZeI1YJExQchj1WCAY6dEyghLpHAAAAAAAAAAAAAAAAAQAAAAAAAAADAAABAAAAAAACAAAA
| 756 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/def_b64_too_big_1.txt | // Context with added '1234' at the begining to simulate too much data in the base64 code
1234AhUAAH8AAA4AAAQ8AAAAAF6HQx3MqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACG2QbHbUj8eGpdx5KVIebiwk0jvRj9/3m6BOSzpA7qBXeEunhqr3D11NE7ciGjeHMAAAAAAAM7MIIDNzCCAh+gAwIBAgIBAjANBgkqhkiG9w0BAQsFADA7MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxGTAXBgNVBAMMEFBvbGFyU1NMIFRlc3QgQ0EwHhcNMTkwMjEwMTQ0NDA2WhcNMjkwMjEwMTQ0NDA2WjA0MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxEjAQBgNVBAMMCWxvY2FsaG9zdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMFNo93nzR3RBNdJcriZrA545Do8Ss86ExbQWuTNowCIp+4ea5anUrSQ7y1yej4kmvy2NKwk9XfgJmSMnLAofaHa6ozmyRyWvP7BBFKzNtSj+uGxdtiQwWG0ZlI2oiZTqqt0Xgd9GYLbKtgfoNkNHC1JZvdbJXNG6AuKT2kMtQCQ4dqCEGZ9rlQri2V5kaHiYcPNQEkI7mgM8YuG0ka/0LiqEQMef1aoGh5EGA8PhYvai0Re4hjGYi/HZo36Xdh98yeJKQHFkA4/J/EwyEoO79bex8cna8cFPXrEAjyaHT4P6DSYW8tzS1KW2BGiLICIaTla0w+w3lkvEcf36hIBMJcCAwEAAaNNMEswCQYDVR0TBAIwADAdBgNVHQ4EFgQUpQXoZLjc32APUBJNYKhkr02LQ5MwHwYDVR0jBBgwFoAUtFrkpbPe0lL2udWmlQ/rPrzH/f8wDQYJKoZIhvcNAQELBQADggEBAC465FJhPqel7zJngHIHJrqj/wVAxGAFOTF396XKATGAp+HRCqJ81Ry60CNK1jDzk8dv6M6UHoS7RIFiM/9rXQCbJfiPD5xMTejZp5n5UYHAmxsxDaazfA5FuBhkfokKK6jD4Eq91C94xGKb6X4/VkaPF7cqoBBw/bHxawXc0UEPjqayiBpCYU/rJoVZgLqFVP7Px3sva1nOrNx8rPPI1hJ+ZOg8maiPTxHZnBVLakSSLQy/sWeWyazO1RnrbxjrbgQtYKz0e3nwGpu1w13vfckFmUSBhHXH7AAS/HpKC4IH7G2GAk3+n8iSSN71sZzpxonQwVbopMZqLmbBm/7WPLcAAJTfQC2Ek91INP5ihHNzImPOAHJCk+YTO/pQuEnNWwXbdmKAi+IRp671iAwtpkjSxCBXVzKX925F1A66caCOQptlw+9zFukDQgblM2JyAJLG0j6B4RtBTDWJ8ZTMUPHUoLJoEpm8APZgRi//DMRyCKP9pbBLGlDzgUvl0w11LzBAlJHkWau5NoqQBlG7w4HFrKweovskAAFRgAAAAF6HQx248L77RH0Z973tSYNQ8zBsz861CZG5/T09TJz3XodDHe/iJ+cgXb5An3zTdnTBtw3EWAb68T+gCE33GN8AAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAgAAAA==
| 1,687 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/cli_no_keep_cert.txt | // Without MBEDTLS_SSL_KEEP_PEER_CERTIFICATE
AhUAAAMAAAAAAACCAAAAAF6MKhTMqAAgSKCqXrcrmjqOBpxsGO3itQB09YgsSJwXmZB12QlB+wwhiof0mzAN0hupkLxu4Yyc9SgyFoEDPKJk8TiRo8bO2rkEfPItB5lUFkJwzdeuGVMAAAAABiCAy8MWqlj4vnIv0mswJvB35hyCOYWZ+fcZ6t5LzZgXPl6MKhRs69b+psiGUAo8OK3fU4HKOHNdi36tk22+ScctXowqFEyvzGcvbtI0VfWLKlOlDv+SwC08ZdCNa+RBZ/AAAAEAAAAAAAIAAA==
| 338 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/mtu_10000.txt | // MTU=10000
AhUAAH8AAA4AAABtAAAAAF6LDkzMqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABx06kxYooMLGPyUMoB46EF2zTJzmZEM4le5aKihcHpFEfgrX/eWQZFWa7cak79ihwAAACAAAAAAAAAAAAAAAAAAV6LDkz9bigMk9q0WiDmgYhX8ppbfgbtMCfruvVQNiFWXosOTJ3R2+J+TaSChmjtS8sD+y1Zruhe/SJE7y9D+5YAAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAicQAA==
| 306 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/empty.txt | 0 | 1 | jart/cosmopolitan | false |
|
cosmopolitan/third_party/mbedtls/test/data/base64/srv_def.txt | // Server context with default MbedTLS configuration
AhUAAH8AAA4AAABtAAAAAF6HQx3MqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACG2QbHbUj8eGpdx5KVIebiwk0jvRj9/3m6BOSzpA7qBXeEunhqr3D11NE7ciGjeHMAAACAAAAAAAAAAAAAAAAAAV6HQx248L77RH0Z973tSYNQ8zBsz861CZG5/T09TJz3XodDHe/iJ+cgXb5An3zTdnTBtw3EWAb68T+gCE33GN8AAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAgAAAA==
| 346 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/srv_no_mfl.txt | // Without MBEDTLS_SSL_MAX_FRAGMENT_LENGTH
AhUAAHcAAA4AAABsAAAAAF6LDLPMqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0fzGzO1ysljMgZr4gduigvRXr2AK5X8j8c6vHTOpc2ncFS3UN2ojwD2tOaM3+/XIAAACAAAAAAAAAAAAAAAABXosMs1xs+Mj8BIL6v01qtHWV7w+psxGwLctaGSSL0aZeiwyzskPeDCL0isOzh+JoPgzS/mVtMc0GykGpZaFBugAAAAAAAAAAAAAAAQAAAAAAAAADAAABAAAAAAACAAAA
| 332 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/mfl_1024.txt | // MFL=1024
AhUAAH8AAA4AAABtAAAAAF6K+GLMqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACHeeQKPVt9RpB8nLTB6C2AhxRzB0r/OBbXbMPm6jb1rkR+qrXZAUFRvGfGxlqqGWwAAACAAAAAAAAAAAAAAAIAAV6K+GJIXNnpKTr9HZQW6WEH7YSYhhRRqOO6xvf8QL6/Xor4YhOxOJYk23w3AwDvVAofeWnVAfJnExe5ipdSxnAAAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAgAAAA===
| 306 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/srv_no_packing.txt | // Without DTLS packing
AhUAAH8AAA4AAABtAAAAAF6LCM/MqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACfl0tXNmshIQEqiEflQGnVUKkIFl1on/Mu0pjWes3XwQgdwmy9xMzpVyYU5gBOsOEAAACAAAAAAAAAAAAAAAAAAV6LCM+1uRpyaoyfzuNGBJK9DgBWIWtrPpu7KM8qsC/FXosIz/YIPhveZ8Z4IR0g/McAMQwzQoK5tScSE0DD3BwAAAAAAAAAAAAAAAEAAAAAAAAAAwEAAQAAAAAAAgAAAA==
| 317 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/cli_ciphersuite.txt | // TLS-RSA-WITH-AES-256-CCM-8
AhUAAH8AAA4AAAQ8AAAAAF6K4ynAoQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADLBIQUrrPh7jxYz9e55cJvfpOkuBf2ZiVovlYa1Dkwbimp5q/CoWIn48C0x3Yj6N0AAAAAAAM7MIIDNzCCAh+gAwIBAgIBAjANBgkqhkiG9w0BAQsFADA7MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxGTAXBgNVBAMMEFBvbGFyU1NMIFRlc3QgQ0EwHhcNMTkwMjEwMTQ0NDA2WhcNMjkwMjEwMTQ0NDA2WjA0MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxEjAQBgNVBAMMCWxvY2FsaG9zdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMFNo93nzR3RBNdJcriZrA545Do8Ss86ExbQWuTNowCIp+4ea5anUrSQ7y1yej4kmvy2NKwk9XfgJmSMnLAofaHa6ozmyRyWvP7BBFKzNtSj+uGxdtiQwWG0ZlI2oiZTqqt0Xgd9GYLbKtgfoNkNHC1JZvdbJXNG6AuKT2kMtQCQ4dqCEGZ9rlQri2V5kaHiYcPNQEkI7mgM8YuG0ka/0LiqEQMef1aoGh5EGA8PhYvai0Re4hjGYi/HZo36Xdh98yeJKQHFkA4/J/EwyEoO79bex8cna8cFPXrEAjyaHT4P6DSYW8tzS1KW2BGiLICIaTla0w+w3lkvEcf36hIBMJcCAwEAAaNNMEswCQYDVR0TBAIwADAdBgNVHQ4EFgQUpQXoZLjc32APUBJNYKhkr02LQ5MwHwYDVR0jBBgwFoAUtFrkpbPe0lL2udWmlQ/rPrzH/f8wDQYJKoZIhvcNAQELBQADggEBAC465FJhPqel7zJngHIHJrqj/wVAxGAFOTF396XKATGAp+HRCqJ81Ry60CNK1jDzk8dv6M6UHoS7RIFiM/9rXQCbJfiPD5xMTejZp5n5UYHAmxsxDaazfA5FuBhkfokKK6jD4Eq91C94xGKb6X4/VkaPF7cqoBBw/bHxawXc0UEPjqayiBpCYU/rJoVZgLqFVP7Px3sva1nOrNx8rPPI1hJ+ZOg8maiPTxHZnBVLakSSLQy/sWeWyazO1RnrbxjrbgQtYKz0e3nwGpu1w13vfckFmUSBhHXH7AAS/HpKC4IH7G2GAk3+n8iSSN71sZzpxonQwVbopMZqLmbBm/7WPLcAAJQBiQTa148x1XQyGt9vU2JxAHIZ9HxLR87PewpTaslP0qJ4FK6cibG/U4ACVriGQMpNkJo6xRRn5dGyKE5L5iqcLQZ4zwcJT50NYlVQqzlXPArOaAzjVAX4k+TwL/VmNepmn3wvregAADeiGsvvbaAw2P9fhCgwX6Bm0YNzkWQsNwWENa6GoZLzvMM51G44611fFnKoAAFRgAAAAF6K4yksMvMV19qRq+eNokGn0j9Q5tjE88EK8jfM7gksXorjKR6zhXhttFGIFkNNAmmKuuDQGVmX1yCoHiJFonUAAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAgAAAA==
| 1,623 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/srv_cid.txt | // Server, CID 0xDEAD
AhUAAH8AAA8AAABtAAAAAF6MZUPMqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABh7h8/aprLN1fS0KwLkZzKcsa5LNtDW7sYu7d1z7fNetuRjLJpX/A1mTSqeBY7li8AAACAAAAAAAAAAAAAAAAAAV6MZUNak74BhbcgvZ2M8WhZKjQyCix7GJzRs4SqnD7iXoxlQ7YXjsVI0K/xyMOJPkT9ZcPEi/2jHGIte1ZduW4C3q0Cvu8AAAAAAAAAAAAAAAIAAAAAAAAABwAAAQAAAAAAAwAAAA==
| 323 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/cli_no_mfl.txt | // Without MBEDTLS_SSL_MAX_FRAGMENT_LENGTH
AhUAAHcAAA4AAAQ6AAAAAF6LDLPMqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0fzGzO1ysljMgZr4gduigvRXr2AK5X8j8c6vHTOpc2ncFS3UN2ojwD2tOaM3+/XIAAAAAAAM7MIIDNzCCAh+gAwIBAgIBAjANBgkqhkiG9w0BAQsFADA7MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxGTAXBgNVBAMMEFBvbGFyU1NMIFRlc3QgQ0EwHhcNMTkwMjEwMTQ0NDA2WhcNMjkwMjEwMTQ0NDA2WjA0MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxEjAQBgNVBAMMCWxvY2FsaG9zdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMFNo93nzR3RBNdJcriZrA545Do8Ss86ExbQWuTNowCIp+4ea5anUrSQ7y1yej4kmvy2NKwk9XfgJmSMnLAofaHa6ozmyRyWvP7BBFKzNtSj+uGxdtiQwWG0ZlI2oiZTqqt0Xgd9GYLbKtgfoNkNHC1JZvdbJXNG6AuKT2kMtQCQ4dqCEGZ9rlQri2V5kaHiYcPNQEkI7mgM8YuG0ka/0LiqEQMef1aoGh5EGA8PhYvai0Re4hjGYi/HZo36Xdh98yeJKQHFkA4/J/EwyEoO79bex8cna8cFPXrEAjyaHT4P6DSYW8tzS1KW2BGiLICIaTla0w+w3lkvEcf36hIBMJcCAwEAAaNNMEswCQYDVR0TBAIwADAdBgNVHQ4EFgQUpQXoZLjc32APUBJNYKhkr02LQ5MwHwYDVR0jBBgwFoAUtFrkpbPe0lL2udWmlQ/rPrzH/f8wDQYJKoZIhvcNAQELBQADggEBAC465FJhPqel7zJngHIHJrqj/wVAxGAFOTF396XKATGAp+HRCqJ81Ry60CNK1jDzk8dv6M6UHoS7RIFiM/9rXQCbJfiPD5xMTejZp5n5UYHAmxsxDaazfA5FuBhkfokKK6jD4Eq91C94xGKb6X4/VkaPF7cqoBBw/bHxawXc0UEPjqayiBpCYU/rJoVZgLqFVP7Px3sva1nOrNx8rPPI1hJ+ZOg8maiPTxHZnBVLakSSLQy/sWeWyazO1RnrbxjrbgQtYKz0e3nwGpu1w13vfckFmUSBhHXH7AAS/HpKC4IH7G2GAk3+n8iSSN71sZzpxonQwVbopMZqLmbBm/7WPLcAAJMiPbE45oAjg9Rx0iVnQDg2AHHKrrmSMTfVijgZbdL/ZFWYvFMioa7uqW0NmA0bSTxcsieRarndOq5fIdEIzmAgGkdaxJaGNDT105gwwIzUnLRapgP6H6IImSMFPXVp3Zks0zFfrq7aQnQMgc8o5kPqWq1/eYfdq8lysTO8Rgliv96lA/pe1SQmPL1mdChAwCa/4XEAAVGAAABeiwyzXGz4yPwEgvq/TWq0dZXvD6mzEbAty1oZJIvRpl6LDLOyQ94MIvSKw7OH4mg+DNL+ZW0xzQbKQalloUG6AAAAAAAAAAAAAAABAAAAAAAAAAMAAAEAAAAAAAIAAAA=
| 1,632 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/cli_def.txt | // Client context with default MbedTLS configuration
AhUAAH8AAA4AAAQ8AAAAAF6HQx3MqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACG2QbHbUj8eGpdx5KVIebiwk0jvRj9/3m6BOSzpA7qBXeEunhqr3D11NE7ciGjeHMAAAAAAAM7MIIDNzCCAh+gAwIBAgIBAjANBgkqhkiG9w0BAQsFADA7MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxGTAXBgNVBAMMEFBvbGFyU1NMIFRlc3QgQ0EwHhcNMTkwMjEwMTQ0NDA2WhcNMjkwMjEwMTQ0NDA2WjA0MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxEjAQBgNVBAMMCWxvY2FsaG9zdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMFNo93nzR3RBNdJcriZrA545Do8Ss86ExbQWuTNowCIp+4ea5anUrSQ7y1yej4kmvy2NKwk9XfgJmSMnLAofaHa6ozmyRyWvP7BBFKzNtSj+uGxdtiQwWG0ZlI2oiZTqqt0Xgd9GYLbKtgfoNkNHC1JZvdbJXNG6AuKT2kMtQCQ4dqCEGZ9rlQri2V5kaHiYcPNQEkI7mgM8YuG0ka/0LiqEQMef1aoGh5EGA8PhYvai0Re4hjGYi/HZo36Xdh98yeJKQHFkA4/J/EwyEoO79bex8cna8cFPXrEAjyaHT4P6DSYW8tzS1KW2BGiLICIaTla0w+w3lkvEcf36hIBMJcCAwEAAaNNMEswCQYDVR0TBAIwADAdBgNVHQ4EFgQUpQXoZLjc32APUBJNYKhkr02LQ5MwHwYDVR0jBBgwFoAUtFrkpbPe0lL2udWmlQ/rPrzH/f8wDQYJKoZIhvcNAQELBQADggEBAC465FJhPqel7zJngHIHJrqj/wVAxGAFOTF396XKATGAp+HRCqJ81Ry60CNK1jDzk8dv6M6UHoS7RIFiM/9rXQCbJfiPD5xMTejZp5n5UYHAmxsxDaazfA5FuBhkfokKK6jD4Eq91C94xGKb6X4/VkaPF7cqoBBw/bHxawXc0UEPjqayiBpCYU/rJoVZgLqFVP7Px3sva1nOrNx8rPPI1hJ+ZOg8maiPTxHZnBVLakSSLQy/sWeWyazO1RnrbxjrbgQtYKz0e3nwGpu1w13vfckFmUSBhHXH7AAS/HpKC4IH7G2GAk3+n8iSSN71sZzpxonQwVbopMZqLmbBm/7WPLcAAJTfQC2Ek91INP5ihHNzImPOAHJCk+YTO/pQuEnNWwXbdmKAi+IRp671iAwtpkjSxCBXVzKX925F1A66caCOQptlw+9zFukDQgblM2JyAJLG0j6B4RtBTDWJ8ZTMUPHUoLJoEpm8APZgRi//DMRyCKP9pbBLGlDzgUvl0w11LzBAlJHkWau5NoqQBlG7w4HFrKweovskAAFRgAAAAF6HQx248L77RH0Z973tSYNQ8zBsz861CZG5/T09TJz3XodDHe/iJ+cgXb5An3zTdnTBtw3EWAb68T+gCE33GN8AAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAgAAAA==
| 1,646 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/def_bad_b64.txt | // Context with added extra 'A' before '==' add the end to simulate bad length of base64 code
AhUAAH8AAA4AAAQ8AAAAAF6HQx3MqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACG2QbHbUj8eGpdx5KVIebiwk0jvRj9/3m6BOSzpA7qBXeEunhqr3D11NE7ciGjeHMAAAAAAAM7MIIDNzCCAh+gAwIBAgIBAjANBgkqhkiG9w0BAQsFADA7MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxGTAXBgNVBAMMEFBvbGFyU1NMIFRlc3QgQ0EwHhcNMTkwMjEwMTQ0NDA2WhcNMjkwMjEwMTQ0NDA2WjA0MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxEjAQBgNVBAMMCWxvY2FsaG9zdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMFNo93nzR3RBNdJcriZrA545Do8Ss86ExbQWuTNowCIp+4ea5anUrSQ7y1yej4kmvy2NKwk9XfgJmSMnLAofaHa6ozmyRyWvP7BBFKzNtSj+uGxdtiQwWG0ZlI2oiZTqqt0Xgd9GYLbKtgfoNkNHC1JZvdbJXNG6AuKT2kMtQCQ4dqCEGZ9rlQri2V5kaHiYcPNQEkI7mgM8YuG0ka/0LiqEQMef1aoGh5EGA8PhYvai0Re4hjGYi/HZo36Xdh98yeJKQHFkA4/J/EwyEoO79bex8cna8cFPXrEAjyaHT4P6DSYW8tzS1KW2BGiLICIaTla0w+w3lkvEcf36hIBMJcCAwEAAaNNMEswCQYDVR0TBAIwADAdBgNVHQ4EFgQUpQXoZLjc32APUBJNYKhkr02LQ5MwHwYDVR0jBBgwFoAUtFrkpbPe0lL2udWmlQ/rPrzH/f8wDQYJKoZIhvcNAQELBQADggEBAC465FJhPqel7zJngHIHJrqj/wVAxGAFOTF396XKATGAp+HRCqJ81Ry60CNK1jDzk8dv6M6UHoS7RIFiM/9rXQCbJfiPD5xMTejZp5n5UYHAmxsxDaazfA5FuBhkfokKK6jD4Eq91C94xGKb6X4/VkaPF7cqoBBw/bHxawXc0UEPjqayiBpCYU/rJoVZgLqFVP7Px3sva1nOrNx8rPPI1hJ+ZOg8maiPTxHZnBVLakSSLQy/sWeWyazO1RnrbxjrbgQtYKz0e3nwGpu1w13vfckFmUSBhHXH7AAS/HpKC4IH7G2GAk3+n8iSSN71sZzpxonQwVbopMZqLmbBm/7WPLcAAJTfQC2Ek91INP5ihHNzImPOAHJCk+YTO/pQuEnNWwXbdmKAi+IRp671iAwtpkjSxCBXVzKX925F1A66caCOQptlw+9zFukDQgblM2JyAJLG0j6B4RtBTDWJ8ZTMUPHUoLJoEpm8APZgRi//DMRyCKP9pbBLGlDzgUvl0w11LzBAlJHkWau5NoqQBlG7w4HFrKweovskAAFRgAAAAF6HQx248L77RH0Z973tSYNQ8zBsz861CZG5/T09TJz3XodDHe/iJ+cgXb5An3zTdnTBtw3EWAb68T+gCE33GN8AAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAgAAAAA==
| 1,688 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/cli_no_alpn.txt | // Without MBEDTLS_SSL_ALPN
AhUAAH8AAAYAAAQ8AAAAAF6LDSzMqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB1lCUO8B/805UzCOLZzWDAEA8anfLpbuWTrnFSR2puZktvEiR8nXdATN0yKS94oSAAAAAAAAM7MIIDNzCCAh+gAwIBAgIBAjANBgkqhkiG9w0BAQsFADA7MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxGTAXBgNVBAMMEFBvbGFyU1NMIFRlc3QgQ0EwHhcNMTkwMjEwMTQ0NDA2WhcNMjkwMjEwMTQ0NDA2WjA0MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxEjAQBgNVBAMMCWxvY2FsaG9zdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMFNo93nzR3RBNdJcriZrA545Do8Ss86ExbQWuTNowCIp+4ea5anUrSQ7y1yej4kmvy2NKwk9XfgJmSMnLAofaHa6ozmyRyWvP7BBFKzNtSj+uGxdtiQwWG0ZlI2oiZTqqt0Xgd9GYLbKtgfoNkNHC1JZvdbJXNG6AuKT2kMtQCQ4dqCEGZ9rlQri2V5kaHiYcPNQEkI7mgM8YuG0ka/0LiqEQMef1aoGh5EGA8PhYvai0Re4hjGYi/HZo36Xdh98yeJKQHFkA4/J/EwyEoO79bex8cna8cFPXrEAjyaHT4P6DSYW8tzS1KW2BGiLICIaTla0w+w3lkvEcf36hIBMJcCAwEAAaNNMEswCQYDVR0TBAIwADAdBgNVHQ4EFgQUpQXoZLjc32APUBJNYKhkr02LQ5MwHwYDVR0jBBgwFoAUtFrkpbPe0lL2udWmlQ/rPrzH/f8wDQYJKoZIhvcNAQELBQADggEBAC465FJhPqel7zJngHIHJrqj/wVAxGAFOTF396XKATGAp+HRCqJ81Ry60CNK1jDzk8dv6M6UHoS7RIFiM/9rXQCbJfiPD5xMTejZp5n5UYHAmxsxDaazfA5FuBhkfokKK6jD4Eq91C94xGKb6X4/VkaPF7cqoBBw/bHxawXc0UEPjqayiBpCYU/rJoVZgLqFVP7Px3sva1nOrNx8rPPI1hJ+ZOg8maiPTxHZnBVLakSSLQy/sWeWyazO1RnrbxjrbgQtYKz0e3nwGpu1w13vfckFmUSBhHXH7AAS/HpKC4IH7G2GAk3+n8iSSN71sZzpxonQwVbopMZqLmbBm/7WPLcAAJQVUI/Wwt3q4XiqL74wCmkhAHKj0YgCvjZi3GKw0s7PJqjZzzLt+OuroC8Q2XeDf5nKKk8jkolZ+dXUftsPPizFgb2hGuYa4NhxXjiGlUpFEoXm7r78SwGfWxRgH5vJk6W3TdodkxTZkjMoWjlC2PANOHPeClw0szBmly7+s89LFZqnCXgyxE8xlv+l5IYSEPSj7UsmAAFRgAAAAF6LDSwWt0QWgmNg4Zv2yYhf4Pdexpi/QTIqWyD2AQVjXosNLLK1vz/upFHrJlizjH5uSBUJCpQZJczrBgxBmGoAAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAgAA
| 1,618 | 4 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/srv_no_alpn.txt | // Without MBEDTLS_SSL_ALPN
AhUAAH8AAAYAAABtAAAAAF6LDSzMqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB1lCUO8B/805UzCOLZzWDAEA8anfLpbuWTrnFSR2puZktvEiR8nXdATN0yKS94oSAAAACAAAAAAAAAAAAAAAAAAV6LDSwWt0QWgmNg4Zv2yYhf4Pdexpi/QTIqWyD2AQVjXosNLLK1vz/upFHrJlizjH5uSBUJCpQZJczrBgxBmGoAAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAgAA
| 317 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/def_b64_too_big_3.txt | // Context with added '1234' before '==' add the end to simulate too much data in the base64 code
AhUAAH8AAA4AAAQ8AAAAAF6HQx3MqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACG2QbHbUj8eGpdx5KVIebiwk0jvRj9/3m6BOSzpA7qBXeEunhqr3D11NE7ciGjeHMAAAAAAAM7MIIDNzCCAh+gAwIBAgIBAjANBgkqhkiG9w0BAQsFADA7MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxGTAXBgNVBAMMEFBvbGFyU1NMIFRlc3QgQ0EwHhcNMTkwMjEwMTQ0NDA2WhcNMjkwMjEwMTQ0NDA2WjA0MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxEjAQBgNVBAMMCWxvY2FsaG9zdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMFNo93nzR3RBNdJcriZrA545Do8Ss86ExbQWuTNowCIp+4ea5anUrSQ7y1yej4kmvy2NKwk9XfgJmSMnLAofaHa6ozmyRyWvP7BBFKzNtSj+uGxdtiQwWG0ZlI2oiZTqqt0Xgd9GYLbKtgfoNkNHC1JZvdbJXNG6AuKT2kMtQCQ4dqCEGZ9rlQri2V5kaHiYcPNQEkI7mgM8YuG0ka/0LiqEQMef1aoGh5EGA8PhYvai0Re4hjGYi/HZo36Xdh98yeJKQHFkA4/J/EwyEoO79bex8cna8cFPXrEAjyaHT4P6DSYW8tzS1KW2BGiLICIaTla0w+w3lkvEcf36hIBMJcCAwEAAaNNMEswCQYDVR0TBAIwADAdBgNVHQ4EFgQUpQXoZLjc32APUBJNYKhkr02LQ5MwHwYDVR0jBBgwFoAUtFrkpbPe0lL2udWmlQ/rPrzH/f8wDQYJKoZIhvcNAQELBQADggEBAC465FJhPqel7zJngHIHJrqj/wVAxGAFOTF396XKATGAp+HRCqJ81Ry60CNK1jDzk8dv6M6UHoS7RIFiM/9rXQCbJfiPD5xMTejZp5n5UYHAmxsxDaazfA5FuBhkfokKK6jD4Eq91C94xGKb6X4/VkaPF7cqoBBw/bHxawXc0UEPjqayiBpCYU/rJoVZgLqFVP7Px3sva1nOrNx8rPPI1hJ+ZOg8maiPTxHZnBVLakSSLQy/sWeWyazO1RnrbxjrbgQtYKz0e3nwGpu1w13vfckFmUSBhHXH7AAS/HpKC4IH7G2GAk3+n8iSSN71sZzpxonQwVbopMZqLmbBm/7WPLcAAJTfQC2Ek91INP5ihHNzImPOAHJCk+YTO/pQuEnNWwXbdmKAi+IRp671iAwtpkjSxCBXVzKX925F1A66caCOQptlw+9zFukDQgblM2JyAJLG0j6B4RtBTDWJ8ZTMUPHUoLJoEpm8APZgRi//DMRyCKP9pbBLGlDzgUvl0w11LzBAlJHkWau5NoqQBlG7w4HFrKweovskAAFRgAAAAF6HQx248L77RH0Z973tSYNQ8zBsz861CZG5/T09TJz3XodDHe/iJ+cgXb5An3zTdnTBtw3EWAb68T+gCE33GN8AAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAgAAAA1234==
| 1,695 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/cli_min_cfg.txt | // Minimal configuration
AhUAAAMAAAAAAAOeAAAAAF6LZlLMqAAgUGktPmpSPbzRPipeCpYJtp5SNIIjTr3R121WF9AeWN4tmKbRhhv+yPMjY0yWPrHLy7lLLhwNFBwCD6eQ0ULZZ15Fi2Rhae/4ZkAR0BN2iCMAAAAAAAM7MIIDNzCCAh+gAwIBAgIBAjANBgkqhkiG9w0BAQsFADA7MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxGTAXBgNVBAMMEFBvbGFyU1NMIFRlc3QgQ0EwHhcNMTkwMjEwMTQ0NDA2WhcNMjkwMjEwMTQ0NDA2WjA0MQswCQYDVQQGEwJOTDERMA8GA1UECgwIUG9sYXJTU0wxEjAQBgNVBAMMCWxvY2FsaG9zdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMFNo93nzR3RBNdJcriZrA545Do8Ss86ExbQWuTNowCIp+4ea5anUrSQ7y1yej4kmvy2NKwk9XfgJmSMnLAofaHa6ozmyRyWvP7BBFKzNtSj+uGxdtiQwWG0ZlI2oiZTqqt0Xgd9GYLbKtgfoNkNHC1JZvdbJXNG6AuKT2kMtQCQ4dqCEGZ9rlQri2V5kaHiYcPNQEkI7mgM8YuG0ka/0LiqEQMef1aoGh5EGA8PhYvai0Re4hjGYi/HZo36Xdh98yeJKQHFkA4/J/EwyEoO79bex8cna8cFPXrEAjyaHT4P6DSYW8tzS1KW2BGiLICIaTla0w+w3lkvEcf36hIBMJcCAwEAAaNNMEswCQYDVR0TBAIwADAdBgNVHQ4EFgQUpQXoZLjc32APUBJNYKhkr02LQ5MwHwYDVR0jBBgwFoAUtFrkpbPe0lL2udWmlQ/rPrzH/f8wDQYJKoZIhvcNAQELBQADggEBAC465FJhPqel7zJngHIHJrqj/wVAxGAFOTF396XKATGAp+HRCqJ81Ry60CNK1jDzk8dv6M6UHoS7RIFiM/9rXQCbJfiPD5xMTejZp5n5UYHAmxsxDaazfA5FuBhkfokKK6jD4Eq91C94xGKb6X4/VkaPF7cqoBBw/bHxawXc0UEPjqayiBpCYU/rJoVZgLqFVP7Px3sva1nOrNx8rPPI1hJ+ZOg8maiPTxHZnBVLakSSLQy/sWeWyazO1RnrbxjrbgQtYKz0e3nwGpu1w13vfckFmUSBhHXH7AAS/HpKC4IH7G2GAk3+n8iSSN71sZzpxonQwVbopMZqLmbBm/7WPLdei2ZSQwLppTqzs7kieOYQR6DjJItmQ0N/RS3+zTr9wF6LZlL6SQpLewmyja7jXyOWuUqJ6zJQ5b7FfA4PxthlAAABAAAAAAACAAA=
| 1,378 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/mbedtls/test/data/base64/srv_ciphersuite.txt | // TLS-RSA-WITH-AES-256-CCM-8
AhUAAH8AAA4AAABtAAAAAF6K4ynAoQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADLBIQUrrPh7jxYz9e55cJvfpOkuBf2ZiVovlYa1Dkwbimp5q/CoWIn48C0x3Yj6N0AAACAAAAAAAAAAAAAAAAAAV6K4yksMvMV19qRq+eNokGn0j9Q5tjE88EK8jfM7gksXorjKR6zhXhttFGIFkNNAmmKuuDQGVmX1yCoHiJFonUAAAAAAAAAAAAAAAEAAAAAAAAAAwAAAQAAAAAAAgAAAA==
| 323 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzgrep | #!/bin/sh
# Bzgrep wrapped for bzip2,
# adapted from zgrep by Philippe Troin <[email protected]> for Debian GNU/Linux.
## zgrep notice:
## zgrep -- a wrapper around a grep program that decompresses files as needed
## Adapted from a version sent by Charles Levert <[email protected]>
PATH="/usr/bin:$PATH"; export PATH
prog=`echo $0 | sed 's|.*/||'`
case "$prog" in
*egrep) grep=${EGREP-egrep} ;;
*fgrep) grep=${FGREP-fgrep} ;;
*) grep=${GREP-grep} ;;
esac
pat=""
while test $# -ne 0; do
case "$1" in
-e | -f) opt="$opt $1"; shift; pat="$1"
if test "$grep" = grep; then # grep is buggy with -e on SVR4
grep=egrep
fi;;
-A | -B) opt="$opt $1 $2"; shift;;
-*) opt="$opt $1";;
*) if test -z "$pat"; then
pat="$1"
else
break;
fi;;
esac
shift
done
if test -z "$pat"; then
echo "grep through bzip2 files"
echo "usage: $prog [grep_options] pattern [files]"
exit 1
fi
list=0
silent=0
op=`echo "$opt" | sed -e 's/ //g' -e 's/-//g'`
case "$op" in
*l*) list=1
esac
case "$op" in
*h*) silent=1
esac
if test $# -eq 0; then
bzip2 -cdfq | $grep $opt "$pat"
exit $?
fi
res=0
for i do
if test -f "$i"; then :; else if test -f "$i.bz2"; then i="$i.bz2"; fi; fi
if test $list -eq 1; then
bzip2 -cdfq "$i" | $grep $opt "$pat" 2>&1 > /dev/null && echo $i
r=$?
elif test $# -eq 1 -o $silent -eq 1; then
bzip2 -cdfq "$i" | $grep $opt "$pat"
r=$?
else
j=$(echo "$i" | sed 's/\\/&&/g;s/|/\\&/g;s/&/\\&/g')
j=`printf "%s" "$j" | tr '\n' ' '`
# A trick adapted from
# https://groups.google.com/forum/#!original/comp.unix.shell/x1345iu10eg/Nn1n-1r1uU0J
# that has the same effect as the following bash code:
# bzip2 -cdfq "$i" | $grep $opt "$pat" | sed "s|^|${j}:|"
# r=${PIPESTATUS[1]}
exec 3>&1
eval `
exec 4>&1 >&3 3>&-
{
bzip2 -cdfq "$i" 4>&-
} | {
$grep $opt "$pat" 4>&-; echo "r=$?;" >&4
} | sed "s|^|${j}:|"
`
fi
test "$r" -ne 0 && res="$r"
done
exit $res
| 2,054 | 86 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzip2.c | #include "libc/calls/calls.h"
#include "libc/calls/struct/sigaction.h"
#include "libc/calls/struct/stat.h"
#include "libc/calls/struct/stat.macros.h"
#include "libc/errno.h"
#include "libc/log/log.h"
#include "libc/mem/gc.internal.h"
#include "libc/mem/mem.h"
#include "libc/runtime/runtime.h"
#include "libc/stdio/stdio.h"
#include "libc/str/str.h"
#include "libc/sysv/consts/o.h"
#include "libc/sysv/consts/s.h"
#include "libc/sysv/consts/sig.h"
#include "libc/time/struct/utimbuf.h"
#include "libc/time/time.h"
#include "third_party/bzip2/bzlib.h"
/* clang-format off */
/*-----------------------------------------------------------*/
/*--- A block-sorting, lossless compressor bzip2.c ---*/
/*-----------------------------------------------------------*/
/* ------------------------------------------------------------------
This file is part of bzip2/libbzip2, a program and library for
lossless, block-sorting data compression.
bzip2/libbzip2 version 1.0.8 of 13 July 2019
Copyright (C) 1996-2019 Julian Seward <[email protected]>
Please read the WARNING, DISCLAIMER and PATENTS sections in the
README file.
This program is released under the terms of the license contained
in the file LICENSE.
------------------------------------------------------------------ */
#define BZ_UNIX 1
/*---------------------------------------------*/
/*--
Some stuff for all platforms.
--*/
#define ERROR_IF_EOF(i) { if ((i) == EOF) ioError(); }
#define ERROR_IF_NOT_ZERO(i) { if ((i) != 0) ioError(); }
#define ERROR_IF_MINUS_ONE(i) { if ((i) == (-1)) ioError(); }
/*---------------------------------------------*/
/*--
Platform-specific stuff.
--*/
#if BZ_UNIX
#define PATH_SEP '/'
#define MY_LSTAT lstat
#define MY_STAT stat
#define MY_S_ISREG S_ISREG
#define MY_S_ISDIR S_ISDIR
#define APPEND_FILESPEC(root, name) \
root=snocString((root), (name))
#define APPEND_FLAG(root, name) \
root=snocString((root), (name))
#define SET_BINARY_MODE(fd) /**/
#endif /* BZ_UNIX */
/*---------------------------------------------*/
/*--
Some more stuff for all platforms :-)
--*/
typedef char Char;
typedef unsigned char Bool;
typedef unsigned char UChar;
typedef int Int32;
typedef unsigned int UInt32;
typedef short Int16;
typedef unsigned short UInt16;
#define True ((Bool)1)
#define False ((Bool)0)
/*--
IntNative is your platform's `native' int size.
Only here to avoid probs with 64-bit platforms.
--*/
typedef int IntNative;
/*---------------------------------------------------*/
/*--- Misc (file handling) data decls ---*/
/*---------------------------------------------------*/
Int32 verbosity;
Bool keepInputFiles, smallMode, deleteOutputOnInterrupt;
Bool forceOverwrite, testFailsExist, unzFailsExist, noisy;
Int32 numFileNames, numFilesProcessed, blockSize100k;
Int32 exitValue;
/*-- source modes; F==file, I==stdin, O==stdout --*/
#define SM_I2O 1
#define SM_F2O 2
#define SM_F2F 3
/*-- operation modes --*/
#define OM_Z 1
#define OM_UNZ 2
#define OM_TEST 3
Int32 opMode;
Int32 srcMode;
#define FILE_NAME_LEN 1034
Int32 longestFileName;
Char inName [FILE_NAME_LEN];
Char outName[FILE_NAME_LEN];
Char tmpName[FILE_NAME_LEN];
Char *progName;
Char progNameReally[FILE_NAME_LEN];
FILE *outputHandleJustInCase;
Int32 workFactor;
static void panic ( const Char* ) wontreturn;
static void ioError ( void ) wontreturn;
static void outOfMemory ( void ) wontreturn;
static void configError ( void ) wontreturn;
static void crcError ( void ) wontreturn;
static void cleanUpAndFail ( Int32 ) wontreturn;
static void compressedStreamEOF ( void ) wontreturn;
static void copyFileName ( Char*, Char* );
static void* myMalloc ( Int32 );
static void applySavedFileAttrToOutputFile ( IntNative fd );
/*---------------------------------------------------*/
/*--- An implementation of 64-bit ints. Sigh. ---*/
/*--- Roll on widespread deployment of ANSI C9X ! ---*/
/*---------------------------------------------------*/
typedef
struct { UChar b[8]; }
UInt64;
static
void uInt64_from_UInt32s ( UInt64* n, UInt32 lo32, UInt32 hi32 )
{
n->b[7] = (UChar)((hi32 >> 24) & 0xFF);
n->b[6] = (UChar)((hi32 >> 16) & 0xFF);
n->b[5] = (UChar)((hi32 >> 8) & 0xFF);
n->b[4] = (UChar) (hi32 & 0xFF);
n->b[3] = (UChar)((lo32 >> 24) & 0xFF);
n->b[2] = (UChar)((lo32 >> 16) & 0xFF);
n->b[1] = (UChar)((lo32 >> 8) & 0xFF);
n->b[0] = (UChar) (lo32 & 0xFF);
}
static
double uInt64_to_double ( UInt64* n )
{
Int32 i;
double base = 1.0;
double sum = 0.0;
for (i = 0; i < 8; i++) {
sum += base * (double)(n->b[i]);
base *= 256.0;
}
return sum;
}
static
Bool uInt64_isZero ( UInt64* n )
{
Int32 i;
for (i = 0; i < 8; i++)
if (n->b[i] != 0) return 0;
return 1;
}
/* Divide *n by 10, and return the remainder. */
static
Int32 uInt64_qrm10 ( UInt64* n )
{
UInt32 rem, tmp;
Int32 i;
rem = 0;
for (i = 7; i >= 0; i--) {
tmp = rem * 256 + n->b[i];
n->b[i] = tmp / 10;
rem = tmp % 10;
}
return rem;
}
/* ... and the Whole Entire Point of all this UInt64 stuff is
so that we can supply the following function.
*/
static
void uInt64_toAscii ( char* outbuf, UInt64* n )
{
Int32 i, q;
UChar buf[32];
Int32 nBuf = 0;
UInt64 n_copy = *n;
do {
q = uInt64_qrm10 ( &n_copy );
buf[nBuf] = q + '0';
nBuf++;
} while (!uInt64_isZero(&n_copy));
outbuf[nBuf] = 0;
for (i = 0; i < nBuf; i++)
outbuf[i] = buf[nBuf-i-1];
}
/*---------------------------------------------------*/
/*--- Processing of complete files and streams ---*/
/*---------------------------------------------------*/
/*---------------------------------------------*/
static
Bool myfeof ( FILE* f )
{
Int32 c = fgetc ( f );
if (c == EOF) return True;
ungetc ( c, f );
return False;
}
/*---------------------------------------------*/
static
void compressStream ( FILE *stream, FILE *zStream )
{
BZFILE* bzf = NULL;
UChar *ibuf = gc(malloc(5000));
Int32 nIbuf;
UInt32 nbytes_in_lo32, nbytes_in_hi32;
UInt32 nbytes_out_lo32, nbytes_out_hi32;
Int32 bzerr, bzerr_dummy, ret;
SET_BINARY_MODE(stream);
SET_BINARY_MODE(zStream);
if (ferror(stream)) goto errhandler_io;
if (ferror(zStream)) goto errhandler_io;
bzf = BZ2_bzWriteOpen ( &bzerr, zStream,
blockSize100k, verbosity, workFactor );
if (bzerr != BZ_OK) goto errhandler;
if (verbosity >= 2) (fprintf) ( stderr, "\n" );
while (True) {
if (myfeof(stream)) break;
nIbuf = fread ( ibuf, sizeof(UChar), 5000, stream );
if (ferror(stream)) goto errhandler_io;
if (nIbuf > 0) BZ2_bzWrite ( &bzerr, bzf, (void*)ibuf, nIbuf );
if (bzerr != BZ_OK) goto errhandler;
}
BZ2_bzWriteClose64 ( &bzerr, bzf, 0,
&nbytes_in_lo32, &nbytes_in_hi32,
&nbytes_out_lo32, &nbytes_out_hi32 );
if (bzerr != BZ_OK) goto errhandler;
if (ferror(zStream)) goto errhandler_io;
ret = fflush ( zStream );
if (ret == EOF) goto errhandler_io;
if (zStream != stdout) {
Int32 fd = fileno ( zStream );
if (fd < 0) goto errhandler_io;
applySavedFileAttrToOutputFile ( fd );
ret = fclose ( zStream );
outputHandleJustInCase = NULL;
if (ret == EOF) goto errhandler_io;
}
outputHandleJustInCase = NULL;
if (ferror(stream)) goto errhandler_io;
ret = fclose ( stream );
if (ret == EOF) goto errhandler_io;
if (verbosity >= 1) {
if (nbytes_in_lo32 == 0 && nbytes_in_hi32 == 0) {
(fprintf) ( stderr, " no data compressed.\n");
} else {
Char buf_nin[32], buf_nout[32];
UInt64 nbytes_in, nbytes_out;
double nbytes_in_d, nbytes_out_d;
uInt64_from_UInt32s ( &nbytes_in,
nbytes_in_lo32, nbytes_in_hi32 );
uInt64_from_UInt32s ( &nbytes_out,
nbytes_out_lo32, nbytes_out_hi32 );
nbytes_in_d = uInt64_to_double ( &nbytes_in );
nbytes_out_d = uInt64_to_double ( &nbytes_out );
uInt64_toAscii ( buf_nin, &nbytes_in );
uInt64_toAscii ( buf_nout, &nbytes_out );
(fprintf) ( stderr, "%6.3f:1, %6.3f bits/byte, "
"%5.2f%% saved, %s in, %s out.\n",
nbytes_in_d / nbytes_out_d,
(8.0 * nbytes_out_d) / nbytes_in_d,
100.0 * (1.0 - nbytes_out_d / nbytes_in_d),
buf_nin,
buf_nout
);
}
}
return;
errhandler:
BZ2_bzWriteClose64 ( &bzerr_dummy, bzf, 1,
&nbytes_in_lo32, &nbytes_in_hi32,
&nbytes_out_lo32, &nbytes_out_hi32 );
switch (bzerr) {
case BZ_CONFIG_ERROR:
configError(); break;
case BZ_MEM_ERROR:
outOfMemory (); break;
case BZ_IO_ERROR:
errhandler_io:
ioError(); break;
default:
panic ( "compress:unexpected error" );
}
panic ( "compress:end" );
/*notreached*/
}
/*---------------------------------------------*/
static
Bool uncompressStream ( FILE *zStream, FILE *stream )
{
BZFILE* bzf = NULL;
Int32 bzerr, bzerr_dummy, ret, nread, streamNo, i;
UChar *obuf = gc(malloc(5000));
UChar *unused = gc(malloc(BZ_MAX_UNUSED));
Int32 nUnused;
void* unusedTmpV;
UChar* unusedTmp;
nUnused = 0;
streamNo = 0;
SET_BINARY_MODE(stream);
SET_BINARY_MODE(zStream);
if (ferror(stream)) goto errhandler_io;
if (ferror(zStream)) goto errhandler_io;
while (True) {
bzf = BZ2_bzReadOpen (
&bzerr, zStream, verbosity,
(int)smallMode, unused, nUnused
);
if (bzf == NULL || bzerr != BZ_OK) goto errhandler;
streamNo++;
while (bzerr == BZ_OK) {
nread = BZ2_bzRead ( &bzerr, bzf, obuf, 5000 );
if (bzerr == BZ_DATA_ERROR_MAGIC) goto trycat;
if ((bzerr == BZ_OK || bzerr == BZ_STREAM_END) && nread > 0)
fwrite ( obuf, sizeof(UChar), nread, stream );
if (ferror(stream)) goto errhandler_io;
}
if (bzerr != BZ_STREAM_END) goto errhandler;
BZ2_bzReadGetUnused ( &bzerr, bzf, &unusedTmpV, &nUnused );
if (bzerr != BZ_OK) panic ( "decompress:bzReadGetUnused" );
unusedTmp = (UChar*)unusedTmpV;
for (i = 0; i < nUnused; i++) unused[i] = unusedTmp[i];
BZ2_bzReadClose ( &bzerr, bzf );
if (bzerr != BZ_OK) panic ( "decompress:bzReadGetUnused" );
if (nUnused == 0 && myfeof(zStream)) break;
}
closeok:
if (ferror(zStream)) goto errhandler_io;
if (stream != stdout) {
Int32 fd = fileno ( stream );
if (fd < 0) goto errhandler_io;
applySavedFileAttrToOutputFile ( fd );
}
ret = fclose ( zStream );
if (ret == EOF) goto errhandler_io;
if (ferror(stream)) goto errhandler_io;
ret = fflush ( stream );
if (ret != 0) goto errhandler_io;
if (stream != stdout) {
ret = fclose ( stream );
outputHandleJustInCase = NULL;
if (ret == EOF) goto errhandler_io;
}
outputHandleJustInCase = NULL;
if (verbosity >= 2) (fprintf) ( stderr, "\n " );
return True;
trycat:
if (forceOverwrite) {
rewind(zStream);
while (True) {
if (myfeof(zStream)) break;
nread = fread ( obuf, sizeof(UChar), 5000, zStream );
if (ferror(zStream)) goto errhandler_io;
if (nread > 0) fwrite ( obuf, sizeof(UChar), nread, stream );
if (ferror(stream)) goto errhandler_io;
}
goto closeok;
}
errhandler:
BZ2_bzReadClose ( &bzerr_dummy, bzf );
switch (bzerr) {
case BZ_CONFIG_ERROR:
configError(); break;
case BZ_IO_ERROR:
errhandler_io:
ioError(); break;
case BZ_DATA_ERROR:
crcError();
case BZ_MEM_ERROR:
outOfMemory();
case BZ_UNEXPECTED_EOF:
compressedStreamEOF();
case BZ_DATA_ERROR_MAGIC:
if (zStream != stdin) fclose(zStream);
if (stream != stdout) fclose(stream);
if (streamNo == 1) {
return False;
} else {
if (noisy)
(fprintf) ( stderr,
"\n%s: %s: trailing garbage after EOF ignored\n",
progName, inName );
return True;
}
default:
panic ( "decompress:unexpected error" );
}
panic ( "decompress:end" );
return True; /*notreached*/
}
/*---------------------------------------------*/
static
Bool testStream ( FILE *zStream )
{
BZFILE* bzf = NULL;
Int32 bzerr, bzerr_dummy, ret, streamNo, i;
UChar *obuf = gc(malloc(5000));
UChar *unused = gc(malloc(BZ_MAX_UNUSED));
Int32 nUnused;
void* unusedTmpV;
UChar* unusedTmp;
nUnused = 0;
streamNo = 0;
SET_BINARY_MODE(zStream);
if (ferror(zStream)) goto errhandler_io;
while (True) {
bzf = BZ2_bzReadOpen (
&bzerr, zStream, verbosity,
(int)smallMode, unused, nUnused
);
if (bzf == NULL || bzerr != BZ_OK) goto errhandler;
streamNo++;
while (bzerr == BZ_OK) {
BZ2_bzRead ( &bzerr, bzf, obuf, 5000 );
if (bzerr == BZ_DATA_ERROR_MAGIC) goto errhandler;
}
if (bzerr != BZ_STREAM_END) goto errhandler;
BZ2_bzReadGetUnused ( &bzerr, bzf, &unusedTmpV, &nUnused );
if (bzerr != BZ_OK) panic ( "test:bzReadGetUnused" );
unusedTmp = (UChar*)unusedTmpV;
for (i = 0; i < nUnused; i++) unused[i] = unusedTmp[i];
BZ2_bzReadClose ( &bzerr, bzf );
if (bzerr != BZ_OK) panic ( "test:bzReadGetUnused" );
if (nUnused == 0 && myfeof(zStream)) break;
}
if (ferror(zStream)) goto errhandler_io;
ret = fclose ( zStream );
if (ret == EOF) goto errhandler_io;
if (verbosity >= 2) (fprintf) ( stderr, "\n " );
return True;
errhandler:
BZ2_bzReadClose ( &bzerr_dummy, bzf );
if (verbosity == 0)
(fprintf) ( stderr, "%s: %s: ", progName, inName );
switch (bzerr) {
case BZ_CONFIG_ERROR:
configError(); break;
case BZ_IO_ERROR:
errhandler_io:
ioError(); break;
case BZ_DATA_ERROR:
(fprintf) ( stderr,
"data integrity (CRC) error in data\n" );
return False;
case BZ_MEM_ERROR:
outOfMemory();
case BZ_UNEXPECTED_EOF:
(fprintf) ( stderr,
"file ends unexpectedly\n" );
return False;
case BZ_DATA_ERROR_MAGIC:
if (zStream != stdin) fclose(zStream);
if (streamNo == 1) {
(fprintf) ( stderr,
"bad magic number (file not created by bzip2)\n" );
return False;
} else {
if (noisy)
(fprintf) ( stderr,
"trailing garbage after EOF ignored\n" );
return True;
}
default:
panic ( "test:unexpected error" );
}
panic ( "test:end" );
return True; /*notreached*/
}
/*---------------------------------------------------*/
/*--- Error [non-] handling grunge ---*/
/*---------------------------------------------------*/
/*---------------------------------------------*/
static
void setExit ( Int32 v )
{
if (v > exitValue) exitValue = v;
}
/*---------------------------------------------*/
static
void cadvise ( void )
{
if (noisy)
(fprintf) (
stderr,
"\nIt is possible that the compressed file(s) have become corrupted.\n"
"You can use the -tvv option to test integrity of such files.\n\n"
"You can use the `bzip2recover' program to attempt to recover\n"
"data from undamaged sections of corrupted files.\n\n"
);
}
/*---------------------------------------------*/
static
void showFileNames ( void )
{
if (noisy)
(fprintf) (
stderr,
"\tInput file = %s, output file = %s\n",
inName, outName
);
}
/*---------------------------------------------*/
static
void cleanUpAndFail ( Int32 ec )
{
IntNative retVal;
struct MY_STAT statBuf;
if ( srcMode == SM_F2F
&& opMode != OM_TEST
&& deleteOutputOnInterrupt ) {
/* Check whether input file still exists. Delete output file
only if input exists to avoid loss of data. Joerg Prante, 5
January 2002. (JRS 06-Jan-2002: other changes in 1.0.2 mean
this is less likely to happen. But to be ultra-paranoid, we
do the check anyway.) */
retVal = MY_STAT ( inName, &statBuf );
if (retVal == 0) {
if (noisy)
(fprintf) ( stderr,
"%s: Deleting output file %s, if it exists.\n",
progName, outName );
if (outputHandleJustInCase != NULL)
fclose ( outputHandleJustInCase );
retVal = remove ( outName );
if (retVal != 0)
(fprintf) ( stderr,
"%s: WARNING: deletion of output file "
"(apparently) failed.\n",
progName );
} else {
(fprintf) ( stderr,
"%s: WARNING: deletion of output file suppressed\n",
progName );
(fprintf) ( stderr,
"%s: since input file no longer exists. Output file\n",
progName );
(fprintf) ( stderr,
"%s: `%s' may be incomplete.\n",
progName, outName );
(fprintf) ( stderr,
"%s: I suggest doing an integrity test (bzip2 -tv)"
" of it.\n",
progName );
}
}
if (noisy && numFileNames > 0 && numFilesProcessed < numFileNames) {
(fprintf) ( stderr,
"%s: WARNING: some files have not been processed:\n"
"%s: %d specified on command line, %d not processed yet.\n\n",
progName, progName,
numFileNames, numFileNames - numFilesProcessed );
}
setExit(ec);
exit(exitValue);
}
/*---------------------------------------------*/
static
void panic ( const Char* s )
{
(fprintf) ( stderr,
"\n%s: PANIC -- internal consistency error:\n"
"\t%s\n"
"\tThis is a BUG. Please report it to:\n"
"\[email protected]\n",
progName, s );
showFileNames();
cleanUpAndFail( 3 );
}
/*---------------------------------------------*/
static
void crcError ( void )
{
(fprintf) ( stderr,
"\n%s: Data integrity error when decompressing.\n",
progName );
showFileNames();
cadvise();
cleanUpAndFail( 2 );
}
/*---------------------------------------------*/
static
void compressedStreamEOF ( void )
{
if (noisy) {
(fprintf) ( stderr,
"\n%s: Compressed file ends unexpectedly;\n\t"
"perhaps it is corrupted? *Possible* reason follows.\n",
progName );
perror ( progName );
showFileNames();
cadvise();
}
cleanUpAndFail( 2 );
}
/*---------------------------------------------*/
static
void ioError ( void )
{
(fprintf) ( stderr,
"\n%s: I/O or other error, bailing out. "
"Possible reason follows.\n",
progName );
perror ( progName );
showFileNames();
cleanUpAndFail( 1 );
}
/*---------------------------------------------*/
static
void mySignalCatcher ( IntNative n )
{
(fprintf) ( stderr,
"\n%s: Control-C or similar caught, quitting.\n",
progName );
cleanUpAndFail(1);
}
/*---------------------------------------------*/
static
void mySIGSEGVorSIGBUScatcher ( IntNative n )
{
if (opMode == OM_Z)
(fprintf) (
stderr,
"\n%s: Caught a SIGSEGV or SIGBUS whilst compressing.\n"
"\n"
" Possible causes are (most likely first):\n"
" (1) This computer has unreliable memory or cache hardware\n"
" (a surprisingly common problem; try a different machine.)\n"
" (2) A bug in the compiler used to create this executable\n"
" (unlikely, if you didn't compile bzip2 yourself.)\n"
" (3) A real bug in bzip2 -- I hope this should never be the case.\n"
" The user's manual, Section 4.3, has more info on (1) and (2).\n"
" \n"
" If you suspect this is a bug in bzip2, or are unsure about (1)\n"
" or (2), feel free to report it to: [email protected].\n"
" Section 4.3 of the user's manual describes the info a useful\n"
" bug report should have. If the manual is available on your\n"
" system, please try and read it before mailing me. If you don't\n"
" have the manual or can't be bothered to read it, mail me anyway.\n"
"\n",
progName );
else
(fprintf) (
stderr,
"\n%s: Caught a SIGSEGV or SIGBUS whilst decompressing.\n"
"\n"
" Possible causes are (most likely first):\n"
" (1) The compressed data is corrupted, and bzip2's usual checks\n"
" failed to detect this. Try bzip2 -tvv my_file.bz2.\n"
" (2) This computer has unreliable memory or cache hardware\n"
" (a surprisingly common problem; try a different machine.)\n"
" (3) A bug in the compiler used to create this executable\n"
" (unlikely, if you didn't compile bzip2 yourself.)\n"
" (4) A real bug in bzip2 -- I hope this should never be the case.\n"
" The user's manual, Section 4.3, has more info on (2) and (3).\n"
" \n"
" If you suspect this is a bug in bzip2, or are unsure about (2)\n"
" or (3), feel free to report it to: [email protected].\n"
" Section 4.3 of the user's manual describes the info a useful\n"
" bug report should have. If the manual is available on your\n"
" system, please try and read it before mailing me. If you don't\n"
" have the manual or can't be bothered to read it, mail me anyway.\n"
"\n",
progName );
showFileNames();
if (opMode == OM_Z)
cleanUpAndFail( 3 ); else
{ cadvise(); cleanUpAndFail( 2 ); }
}
/*---------------------------------------------*/
static
void outOfMemory ( void )
{
(fprintf) ( stderr,
"\n%s: couldn't allocate enough memory\n",
progName );
showFileNames();
cleanUpAndFail(1);
}
/*---------------------------------------------*/
static
void configError ( void )
{
(fprintf) ( stderr,
"bzip2: I'm not configured correctly for this platform!\n"
"\tI require Int32, Int16 and Char to have sizes\n"
"\tof 4, 2 and 1 bytes to run properly, and they don't.\n"
"\tProbably you can fix this by defining them correctly,\n"
"\tand recompiling. Bye!\n" );
setExit(3);
exit(exitValue);
}
/*---------------------------------------------------*/
/*--- The main driver machinery ---*/
/*---------------------------------------------------*/
/* All rather crufty. The main problem is that input files
are stat()d multiple times before use. This should be
cleaned up.
*/
/*---------------------------------------------*/
static
void pad ( Char *s )
{
Int32 i;
if ( (Int32)strlen(s) >= longestFileName ) return;
for (i = 1; i <= longestFileName - (Int32)strlen(s); i++)
(fprintf) ( stderr, " " );
}
/*---------------------------------------------*/
static
void copyFileName ( Char* to, Char* from )
{
if ( strlen(from) > FILE_NAME_LEN-10 ) {
(fprintf) (
stderr,
"bzip2: file name\n`%s'\n"
"is suspiciously (more than %d chars) long.\n"
"Try using a reasonable file name instead. Sorry! :-)\n",
from, FILE_NAME_LEN-10
);
setExit(1);
exit(exitValue);
}
strncpy(to,from,FILE_NAME_LEN-10);
to[FILE_NAME_LEN-10]='\0';
}
/*---------------------------------------------*/
static
Bool fileExists ( Char* name )
{
FILE *tmp = fopen ( name, "rb" );
Bool exists = (tmp != NULL);
if (tmp != NULL) fclose ( tmp );
return exists;
}
/*---------------------------------------------*/
/* Open an output file safely with O_EXCL and good permissions.
This avoids a race condition in versions < 1.0.2, in which
the file was first opened and then had its interim permissions
set safely. We instead use open() to create the file with
the interim permissions required. (--- --- rw-).
For non-Unix platforms, if we are not worrying about
security issues, simple this simply behaves like fopen.
*/
static
FILE* fopen_output_safely ( Char* name, const char* mode )
{
# if BZ_UNIX
FILE* fp;
IntNative fh;
fh = open(name, O_WRONLY|O_CREAT|O_EXCL, S_IWUSR|S_IRUSR);
if (fh == -1) return NULL;
fp = fdopen(fh, mode);
if (fp == NULL) close(fh);
return fp;
# else
return fopen(name, mode);
# endif
}
/*---------------------------------------------*/
/*--
if in doubt, return True
--*/
static
Bool notAStandardFile ( Char* name )
{
IntNative i;
struct MY_STAT statBuf;
i = MY_LSTAT ( name, &statBuf );
if (i != 0) return True;
if (MY_S_ISREG(statBuf.st_mode)) return False;
return True;
}
/*---------------------------------------------*/
/*--
rac 11/21/98 see if file has hard links to it
--*/
static
Int32 countHardLinks ( Char* name )
{
IntNative i;
struct MY_STAT statBuf;
i = MY_LSTAT ( name, &statBuf );
if (i != 0) return 0;
return (statBuf.st_nlink - 1);
}
/*---------------------------------------------*/
/* Copy modification date, access date, permissions and owner from the
source to destination file. We have to copy this meta-info off
into fileMetaInfo before starting to compress / decompress it,
because doing it afterwards means we get the wrong access time.
To complicate matters, in compress() and decompress() below, the
sequence of tests preceding the call to saveInputFileMetaInfo()
involves calling fileExists(), which in turn establishes its result
by attempting to fopen() the file, and if successful, immediately
fclose()ing it again. So we have to assume that the fopen() call
does not cause the access time field to be updated.
Reading of the man page for stat() (man 2 stat) on RedHat 7.2 seems
to imply that merely doing open() will not affect the access time.
Therefore we merely need to hope that the C library only does
open() as a result of fopen(), and not any kind of read()-ahead
cleverness.
It sounds pretty fragile to me. Whether this carries across
robustly to arbitrary Unix-like platforms (or even works robustly
on this one, RedHat 7.2) is unknown to me. Nevertheless ...
*/
#if BZ_UNIX
static
struct MY_STAT fileMetaInfo;
#endif
static
void saveInputFileMetaInfo ( Char *srcName )
{
# if BZ_UNIX
IntNative retVal;
/* Note use of stat here, not lstat. */
retVal = MY_STAT( srcName, &fileMetaInfo );
ERROR_IF_NOT_ZERO ( retVal );
# endif
}
static
void applySavedTimeInfoToOutputFile ( Char *dstName )
{
# if BZ_UNIX
IntNative retVal;
struct utimbuf uTimBuf;
uTimBuf.actime = fileMetaInfo.st_atime;
uTimBuf.modtime = fileMetaInfo.st_mtime;
retVal = utime ( dstName, &uTimBuf );
ERROR_IF_NOT_ZERO ( retVal );
# endif
}
static
void applySavedFileAttrToOutputFile ( IntNative fd )
{
# if BZ_UNIX
IntNative retVal;
retVal = fchmod ( fd, fileMetaInfo.st_mode );
ERROR_IF_NOT_ZERO ( retVal );
(void) fchown ( fd, fileMetaInfo.st_uid, fileMetaInfo.st_gid );
/* chown() will in many cases return with EPERM, which can
be safely ignored.
*/
# endif
}
/*---------------------------------------------*/
static
Bool containsDubiousChars ( Char* name )
{
# if BZ_UNIX
/* On unix, files can contain any characters and the file expansion
* is performed by the shell.
*/
return False;
# else /* ! BZ_UNIX */
/* On non-unix (Win* platforms), wildcard characters are not allowed in
* filenames.
*/
for (; *name != '\0'; name++)
if (*name == '?' || *name == '*') return True;
return False;
# endif /* BZ_UNIX */
}
/*---------------------------------------------*/
#define BZ_N_SUFFIX_PAIRS 4
const Char* zSuffix[BZ_N_SUFFIX_PAIRS]
= { ".bz2", ".bz", ".tbz2", ".tbz" };
const Char* unzSuffix[BZ_N_SUFFIX_PAIRS]
= { "", "", ".tar", ".tar" };
static
Bool hasSuffix ( Char* s, const Char* suffix )
{
Int32 ns = strlen(s);
Int32 nx = strlen(suffix);
if (ns < nx) return False;
if (strcmp(s + ns - nx, suffix) == 0) return True;
return False;
}
static
Bool mapSuffix ( Char* name,
const Char* oldSuffix,
const Char* newSuffix )
{
if (!hasSuffix(name,oldSuffix)) return False;
name[strlen(name)-strlen(oldSuffix)] = 0;
strcat ( name, newSuffix );
return True;
}
/*---------------------------------------------*/
static
void compress ( Char *name )
{
FILE *inStr;
FILE *outStr;
Int32 n, i;
struct MY_STAT statBuf;
deleteOutputOnInterrupt = False;
if (name == NULL && srcMode != SM_I2O)
panic ( "compress: bad modes\n" );
switch (srcMode) {
case SM_I2O:
copyFileName ( inName, (Char*)"(stdin)" );
copyFileName ( outName, (Char*)"(stdout)" );
break;
case SM_F2F:
copyFileName ( inName, name );
copyFileName ( outName, name );
strcat ( outName, ".bz2" );
break;
case SM_F2O:
copyFileName ( inName, name );
copyFileName ( outName, (Char*)"(stdout)" );
break;
}
if ( srcMode != SM_I2O && containsDubiousChars ( inName ) ) {
if (noisy)
(fprintf) ( stderr, "%s: There are no files matching `%s'.\n",
progName, inName );
setExit(1);
return;
}
if ( srcMode != SM_I2O && !fileExists ( inName ) ) {
(fprintf) ( stderr, "%s: Can't open input file %s: %s.\n",
progName, inName, strerror(errno) );
setExit(1);
return;
}
for (i = 0; i < BZ_N_SUFFIX_PAIRS; i++) {
if (hasSuffix(inName, zSuffix[i])) {
if (noisy)
(fprintf) ( stderr,
"%s: Input file %s already has %s suffix.\n",
progName, inName, zSuffix[i] );
setExit(1);
return;
}
}
if ( srcMode == SM_F2F || srcMode == SM_F2O ) {
MY_STAT(inName, &statBuf);
if ( MY_S_ISDIR(statBuf.st_mode) ) {
(fprintf)( stderr,
"%s: Input file %s is a directory.\n",
progName,inName);
setExit(1);
return;
}
}
if ( srcMode == SM_F2F && !forceOverwrite && notAStandardFile ( inName )) {
if (noisy)
(fprintf) ( stderr, "%s: Input file %s is not a normal file.\n",
progName, inName );
setExit(1);
return;
}
if ( srcMode == SM_F2F && fileExists ( outName ) ) {
if (forceOverwrite) {
remove(outName);
} else {
(fprintf) ( stderr, "%s: Output file %s already exists.\n",
progName, outName );
setExit(1);
return;
}
}
if ( srcMode == SM_F2F && !forceOverwrite &&
(n=countHardLinks ( inName )) > 0) {
(fprintf) ( stderr, "%s: Input file %s has %d other link%s.\n",
progName, inName, n, n > 1 ? "s" : "" );
setExit(1);
return;
}
if ( srcMode == SM_F2F ) {
/* Save the file's meta-info before we open it. Doing it later
means we mess up the access times. */
saveInputFileMetaInfo ( inName );
}
switch ( srcMode ) {
case SM_I2O:
inStr = stdin;
outStr = stdout;
if ( isatty ( fileno ( stdout ) ) ) {
(fprintf) ( stderr,
"%s: I won't write compressed data to a terminal.\n",
progName );
(fprintf) ( stderr, "%s: For help, type: `%s --help'.\n",
progName, progName );
setExit(1);
return;
};
break;
case SM_F2O:
inStr = fopen ( inName, "rb" );
outStr = stdout;
if ( isatty ( fileno ( stdout ) ) ) {
(fprintf) ( stderr,
"%s: I won't write compressed data to a terminal.\n",
progName );
(fprintf) ( stderr, "%s: For help, type: `%s --help'.\n",
progName, progName );
if ( inStr != NULL ) fclose ( inStr );
setExit(1);
return;
};
if ( inStr == NULL ) {
(fprintf) ( stderr, "%s: Can't open input file %s: %s.\n",
progName, inName, strerror(errno) );
setExit(1);
return;
};
break;
case SM_F2F:
inStr = fopen ( inName, "rb" );
outStr = fopen_output_safely ( outName, "wb" );
if ( outStr == NULL) {
(fprintf) ( stderr, "%s: Can't create output file %s: %s.\n",
progName, outName, strerror(errno) );
if ( inStr != NULL ) fclose ( inStr );
setExit(1);
return;
}
if ( inStr == NULL ) {
(fprintf) ( stderr, "%s: Can't open input file %s: %s.\n",
progName, inName, strerror(errno) );
if ( outStr != NULL ) fclose ( outStr );
setExit(1);
return;
};
break;
default:
panic ( "compress: bad srcMode" );
break;
}
if (verbosity >= 1) {
(fprintf) ( stderr, " %s: ", inName );
pad ( inName );
fflush ( stderr );
}
/*--- Now the input and output handles are sane. Do the Biz. ---*/
outputHandleJustInCase = outStr;
deleteOutputOnInterrupt = True;
compressStream ( inStr, outStr );
outputHandleJustInCase = NULL;
/*--- If there was an I/O error, we won't get here. ---*/
if ( srcMode == SM_F2F ) {
applySavedTimeInfoToOutputFile ( outName );
deleteOutputOnInterrupt = False;
if ( !keepInputFiles ) {
IntNative retVal = remove ( inName );
ERROR_IF_NOT_ZERO ( retVal );
}
}
deleteOutputOnInterrupt = False;
}
/*---------------------------------------------*/
static
void uncompress ( Char *name )
{
FILE *inStr;
FILE *outStr;
Int32 n, i;
Bool magicNumberOK;
Bool cantGuess;
struct MY_STAT statBuf;
deleteOutputOnInterrupt = False;
if (name == NULL && srcMode != SM_I2O)
panic ( "uncompress: bad modes\n" );
cantGuess = False;
switch (srcMode) {
case SM_I2O:
copyFileName ( inName, (Char*)"(stdin)" );
copyFileName ( outName, (Char*)"(stdout)" );
break;
case SM_F2F:
copyFileName ( inName, name );
copyFileName ( outName, name );
for (i = 0; i < BZ_N_SUFFIX_PAIRS; i++)
if (mapSuffix(outName,zSuffix[i],unzSuffix[i]))
goto zzz;
cantGuess = True;
strcat ( outName, ".out" );
break;
case SM_F2O:
copyFileName ( inName, name );
copyFileName ( outName, (Char*)"(stdout)" );
break;
}
zzz:
if ( srcMode != SM_I2O && containsDubiousChars ( inName ) ) {
if (noisy)
(fprintf) ( stderr, "%s: There are no files matching `%s'.\n",
progName, inName );
setExit(1);
return;
}
if ( srcMode != SM_I2O && !fileExists ( inName ) ) {
(fprintf) ( stderr, "%s: Can't open input file %s: %s.\n",
progName, inName, strerror(errno) );
setExit(1);
return;
}
if ( srcMode == SM_F2F || srcMode == SM_F2O ) {
MY_STAT(inName, &statBuf);
if ( MY_S_ISDIR(statBuf.st_mode) ) {
(fprintf)( stderr,
"%s: Input file %s is a directory.\n",
progName,inName);
setExit(1);
return;
}
}
if ( srcMode == SM_F2F && !forceOverwrite && notAStandardFile ( inName )) {
if (noisy)
(fprintf) ( stderr, "%s: Input file %s is not a normal file.\n",
progName, inName );
setExit(1);
return;
}
if ( /* srcMode == SM_F2F implied && */ cantGuess ) {
if (noisy)
(fprintf) ( stderr,
"%s: Can't guess original name for %s -- using %s\n",
progName, inName, outName );
/* just a warning, no return */
}
if ( srcMode == SM_F2F && fileExists ( outName ) ) {
if (forceOverwrite) {
remove(outName);
} else {
(fprintf) ( stderr, "%s: Output file %s already exists.\n",
progName, outName );
setExit(1);
return;
}
}
if ( srcMode == SM_F2F && !forceOverwrite &&
(n=countHardLinks ( inName ) ) > 0) {
(fprintf) ( stderr, "%s: Input file %s has %d other link%s.\n",
progName, inName, n, n > 1 ? "s" : "" );
setExit(1);
return;
}
if ( srcMode == SM_F2F ) {
/* Save the file's meta-info before we open it. Doing it later
means we mess up the access times. */
saveInputFileMetaInfo ( inName );
}
switch ( srcMode ) {
case SM_I2O:
inStr = stdin;
outStr = stdout;
if ( isatty ( fileno ( stdin ) ) ) {
(fprintf) ( stderr,
"%s: I won't read compressed data from a terminal.\n",
progName );
(fprintf) ( stderr, "%s: For help, type: `%s --help'.\n",
progName, progName );
setExit(1);
return;
};
break;
case SM_F2O:
inStr = fopen ( inName, "rb" );
outStr = stdout;
if ( inStr == NULL ) {
(fprintf) ( stderr, "%s: Can't open input file %s:%s.\n",
progName, inName, strerror(errno) );
if ( inStr != NULL ) fclose ( inStr );
setExit(1);
return;
};
break;
case SM_F2F:
inStr = fopen ( inName, "rb" );
outStr = fopen_output_safely ( outName, "wb" );
if ( outStr == NULL) {
(fprintf) ( stderr, "%s: Can't create output file %s: %s.\n",
progName, outName, strerror(errno) );
if ( inStr != NULL ) fclose ( inStr );
setExit(1);
return;
}
if ( inStr == NULL ) {
(fprintf) ( stderr, "%s: Can't open input file %s: %s.\n",
progName, inName, strerror(errno) );
if ( outStr != NULL ) fclose ( outStr );
setExit(1);
return;
};
break;
default:
panic ( "uncompress: bad srcMode" );
break;
}
if (verbosity >= 1) {
(fprintf) ( stderr, " %s: ", inName );
pad ( inName );
fflush ( stderr );
}
/*--- Now the input and output handles are sane. Do the Biz. ---*/
outputHandleJustInCase = outStr;
deleteOutputOnInterrupt = True;
magicNumberOK = uncompressStream ( inStr, outStr );
outputHandleJustInCase = NULL;
/*--- If there was an I/O error, we won't get here. ---*/
if ( magicNumberOK ) {
if ( srcMode == SM_F2F ) {
applySavedTimeInfoToOutputFile ( outName );
deleteOutputOnInterrupt = False;
if ( !keepInputFiles ) {
IntNative retVal = remove ( inName );
ERROR_IF_NOT_ZERO ( retVal );
}
}
} else {
unzFailsExist = True;
deleteOutputOnInterrupt = False;
if ( srcMode == SM_F2F ) {
IntNative retVal = remove ( outName );
ERROR_IF_NOT_ZERO ( retVal );
}
}
deleteOutputOnInterrupt = False;
if ( magicNumberOK ) {
if (verbosity >= 1)
(fprintf) ( stderr, "done\n" );
} else {
setExit(2);
if (verbosity >= 1)
(fprintf) ( stderr, "not a bzip2 file.\n" ); else
(fprintf) ( stderr,
"%s: %s is not a bzip2 file.\n",
progName, inName );
}
}
/*---------------------------------------------*/
static
void testf ( Char *name )
{
FILE *inStr;
Bool allOK;
struct MY_STAT statBuf;
deleteOutputOnInterrupt = False;
if (name == NULL && srcMode != SM_I2O)
panic ( "testf: bad modes\n" );
copyFileName ( outName, (Char*)"(none)" );
switch (srcMode) {
case SM_I2O: copyFileName ( inName, (Char*)"(stdin)" ); break;
case SM_F2F: copyFileName ( inName, name ); break;
case SM_F2O: copyFileName ( inName, name ); break;
}
if ( srcMode != SM_I2O && containsDubiousChars ( inName ) ) {
if (noisy)
(fprintf) ( stderr, "%s: There are no files matching `%s'.\n",
progName, inName );
setExit(1);
return;
}
if ( srcMode != SM_I2O && !fileExists ( inName ) ) {
(fprintf) ( stderr, "%s: Can't open input %s: %s.\n",
progName, inName, strerror(errno) );
setExit(1);
return;
}
if ( srcMode != SM_I2O ) {
MY_STAT(inName, &statBuf);
if ( MY_S_ISDIR(statBuf.st_mode) ) {
(fprintf)( stderr,
"%s: Input file %s is a directory.\n",
progName,inName);
setExit(1);
return;
}
}
switch ( srcMode ) {
case SM_I2O:
if ( isatty ( fileno ( stdin ) ) ) {
(fprintf) ( stderr,
"%s: I won't read compressed data from a terminal.\n",
progName );
(fprintf) ( stderr, "%s: For help, type: `%s --help'.\n",
progName, progName );
setExit(1);
return;
};
inStr = stdin;
break;
case SM_F2O: case SM_F2F:
inStr = fopen ( inName, "rb" );
if ( inStr == NULL ) {
(fprintf) ( stderr, "%s: Can't open input file %s:%s.\n",
progName, inName, strerror(errno) );
setExit(1);
return;
};
break;
default:
panic ( "testf: bad srcMode" );
break;
}
if (verbosity >= 1) {
(fprintf) ( stderr, " %s: ", inName );
pad ( inName );
fflush ( stderr );
}
/*--- Now the input handle is sane. Do the Biz. ---*/
outputHandleJustInCase = NULL;
allOK = testStream ( inStr );
if (allOK && verbosity >= 1) (fprintf) ( stderr, "ok\n" );
if (!allOK) testFailsExist = True;
}
/*---------------------------------------------*/
static
void license ( void )
{
(fprintf) ( stderr,
"bzip2, a block-sorting file compressor. "
"Version %s.\n"
" \n"
" Copyright (C) 1996-2019 by Julian Seward.\n"
" \n"
" This program is free software; you can redistribute it and/or modify\n"
" it under the terms set out in the LICENSE file, which is included\n"
" in the bzip2 source distribution.\n"
" \n"
" This program is distributed in the hope that it will be useful,\n"
" but WITHOUT ANY WARRANTY; without even the implied warranty of\n"
" MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n"
" LICENSE file for more details.\n"
" \n",
BZ2_bzlibVersion()
);
}
/*---------------------------------------------*/
static
void usage ( Char *fullProgName )
{
(fprintf) (
stderr,
"bzip2, a block-sorting file compressor. "
"Version %s.\n"
"\n usage: %s [flags and input files in any order]\n"
"\n"
" -h --help print this message\n"
" -d --decompress force decompression\n"
" -z --compress force compression\n"
" -k --keep keep (don't delete) input files\n"
" -f --force overwrite existing output files\n"
" -t --test test compressed file integrity\n"
" -c --stdout output to standard out\n"
" -q --quiet suppress noncritical error messages\n"
" -v --verbose be verbose (a 2nd -v gives more)\n"
" -L --license display software version & license\n"
" -V --version display software version & license\n"
" -s --small use less memory (at most 2500k)\n"
" -1 .. -9 set block size to 100k .. 900k\n"
" --fast alias for -1\n"
" --best alias for -9\n"
"\n"
" If invoked as `bzip2', default action is to compress.\n"
" as `bunzip2', default action is to decompress.\n"
" as `bzcat', default action is to decompress to stdout.\n"
"\n"
" If no file names are given, bzip2 compresses or decompresses\n"
" from standard input to standard output. You can combine\n"
" short flags, so `-v -4' means the same as -v4 or -4v, &c.\n"
# if BZ_UNIX
"\n"
# endif
,
BZ2_bzlibVersion(),
fullProgName
);
}
/*---------------------------------------------*/
static
void redundant ( Char* flag )
{
(fprintf) (
stderr,
"%s: %s is redundant in versions 0.9.5 and above\n",
progName, flag );
}
/*---------------------------------------------*/
/*--
All the garbage from here to main() is purely to
implement a linked list of command-line arguments,
into which main() copies argv[1 .. argc-1].
The purpose of this exercise is to facilitate
the expansion of wildcard characters * and ? in
filenames for OSs which don't know how to do it
themselves, like MSDOS, Windows 95 and NT.
The actual Dirty Work is done by the platform-
specific macro APPEND_FILESPEC.
--*/
typedef
struct zzzz {
Char *name;
struct zzzz *link;
}
Cell;
/*---------------------------------------------*/
static
void *myMalloc ( Int32 n )
{
void* p;
p = malloc ( (size_t)n );
if (p == NULL) outOfMemory ();
return p;
}
/*---------------------------------------------*/
static
Cell *mkCell ( void )
{
Cell *c;
c = (Cell*) myMalloc ( sizeof ( Cell ) );
c->name = NULL;
c->link = NULL;
return c;
}
/*---------------------------------------------*/
static
Cell *snocString ( Cell *root, Char *name )
{
if (root == NULL) {
Cell *tmp = mkCell();
tmp->name = (Char*) myMalloc ( 5 + strlen(name) );
strcpy ( tmp->name, name );
return tmp;
} else {
Cell *tmp = root;
while (tmp->link != NULL) tmp = tmp->link;
tmp->link = snocString ( tmp->link, name );
return root;
}
}
/*---------------------------------------------*/
static
void addFlagsFromEnvVar ( Cell** argList, Char* varName )
{
Int32 i, j, k;
Char *envbase, *p;
envbase = getenv(varName);
if (envbase != NULL) {
p = envbase;
i = 0;
while (True) {
if (p[i] == 0) break;
p += i;
i = 0;
while (isspace((Int32)(p[0]))) p++;
while (p[i] != 0 && !isspace((Int32)(p[i]))) i++;
if (i > 0) {
k = i; if (k > FILE_NAME_LEN-10) k = FILE_NAME_LEN-10;
for (j = 0; j < k; j++) tmpName[j] = p[j];
tmpName[k] = 0;
APPEND_FLAG(*argList, tmpName);
}
}
}
}
/*---------------------------------------------*/
#define ISFLAG(s) (strcmp(aa->name, (s))==0)
IntNative main ( IntNative argc, Char *argv[] )
{
Int32 i, j;
Char *tmp;
Cell *argList;
Cell *aa;
Bool decode;
/*-- Be really really really paranoid :-) --*/
if (sizeof(Int32) != 4 || sizeof(UInt32) != 4 ||
sizeof(Int16) != 2 || sizeof(UInt16) != 2 ||
sizeof(Char) != 1 || sizeof(UChar) != 1)
configError();
/*-- Initialise --*/
outputHandleJustInCase = NULL;
smallMode = False;
keepInputFiles = False;
forceOverwrite = False;
noisy = True;
verbosity = 0;
blockSize100k = 9;
testFailsExist = False;
unzFailsExist = False;
numFileNames = 0;
numFilesProcessed = 0;
workFactor = 30;
deleteOutputOnInterrupt = False;
exitValue = 0;
i = j = 0; /* avoid bogus warning from egcs-1.1.X */
/*-- Set up signal handlers for mem access errors --*/
signal (SIGSEGV, mySIGSEGVorSIGBUScatcher);
# if BZ_UNIX
# ifndef __DJGPP__
signal (SIGBUS, mySIGSEGVorSIGBUScatcher);
# endif
# endif
copyFileName ( inName, (Char*)"(none)" );
copyFileName ( outName, (Char*)"(none)" );
copyFileName ( progNameReally, argv[0] );
progName = &progNameReally[0];
for (tmp = &progNameReally[0]; *tmp != '\0'; tmp++)
if (*tmp == PATH_SEP) progName = tmp + 1;
/*-- Copy flags from env var BZIP2, and
expand filename wildcards in arg list.
--*/
argList = NULL;
addFlagsFromEnvVar ( &argList, (Char*)"BZIP2" );
addFlagsFromEnvVar ( &argList, (Char*)"BZIP" );
for (i = 1; i <= argc-1; i++)
APPEND_FILESPEC(argList, argv[i]);
/*-- Find the length of the longest filename --*/
longestFileName = 7;
numFileNames = 0;
decode = True;
for (aa = argList; aa != NULL; aa = aa->link) {
if (ISFLAG("--")) { decode = False; continue; }
if (aa->name[0] == '-' && decode) continue;
numFileNames++;
if (longestFileName < (Int32)strlen(aa->name) )
longestFileName = (Int32)strlen(aa->name);
}
/*-- Determine source modes; flag handling may change this too. --*/
if (numFileNames == 0)
srcMode = SM_I2O; else srcMode = SM_F2F;
/*-- Determine what to do (compress/uncompress/test/cat). --*/
/*-- Note that subsequent flag handling may change this. --*/
opMode = OM_Z;
if ( (strstr ( progName, "unzip" ) != 0) ||
(strstr ( progName, "UNZIP" ) != 0) )
opMode = OM_UNZ;
if ( (strstr ( progName, "z2cat" ) != 0) ||
(strstr ( progName, "Z2CAT" ) != 0) ||
(strstr ( progName, "zcat" ) != 0) ||
(strstr ( progName, "ZCAT" ) != 0) ) {
opMode = OM_UNZ;
srcMode = (numFileNames == 0) ? SM_I2O : SM_F2O;
}
/*-- Look at the flags. --*/
for (aa = argList; aa != NULL; aa = aa->link) {
if (ISFLAG("--")) break;
if (aa->name[0] == '-' && aa->name[1] != '-') {
for (j = 1; aa->name[j] != '\0'; j++) {
switch (aa->name[j]) {
case 'c': srcMode = SM_F2O; break;
case 'd': opMode = OM_UNZ; break;
case 'z': opMode = OM_Z; break;
case 'f': forceOverwrite = True; break;
case 't': opMode = OM_TEST; break;
case 'k': keepInputFiles = True; break;
case 's': smallMode = True; break;
case 'q': noisy = False; break;
case '1': blockSize100k = 1; break;
case '2': blockSize100k = 2; break;
case '3': blockSize100k = 3; break;
case '4': blockSize100k = 4; break;
case '5': blockSize100k = 5; break;
case '6': blockSize100k = 6; break;
case '7': blockSize100k = 7; break;
case '8': blockSize100k = 8; break;
case '9': blockSize100k = 9; break;
case 'V':
case 'L': license(); break;
case 'v': verbosity++; break;
case 'h': usage ( progName );
exit ( 0 );
break;
default: (fprintf) ( stderr, "%s: Bad flag `%s'\n",
progName, aa->name );
usage ( progName );
exit ( 1 );
break;
}
}
}
}
/*-- And again ... --*/
for (aa = argList; aa != NULL; aa = aa->link) {
if (ISFLAG("--")) break;
if (ISFLAG("--stdout")) srcMode = SM_F2O; else
if (ISFLAG("--decompress")) opMode = OM_UNZ; else
if (ISFLAG("--compress")) opMode = OM_Z; else
if (ISFLAG("--force")) forceOverwrite = True; else
if (ISFLAG("--test")) opMode = OM_TEST; else
if (ISFLAG("--keep")) keepInputFiles = True; else
if (ISFLAG("--small")) smallMode = True; else
if (ISFLAG("--quiet")) noisy = False; else
if (ISFLAG("--version")) license(); else
if (ISFLAG("--license")) license(); else
if (ISFLAG("--exponential")) workFactor = 1; else
if (ISFLAG("--repetitive-best")) redundant(aa->name); else
if (ISFLAG("--repetitive-fast")) redundant(aa->name); else
if (ISFLAG("--fast")) blockSize100k = 1; else
if (ISFLAG("--best")) blockSize100k = 9; else
if (ISFLAG("--verbose")) verbosity++; else
if (ISFLAG("--help")) { usage ( progName ); exit ( 0 ); }
else
if (strncmp ( aa->name, "--", 2) == 0) {
(fprintf) ( stderr, "%s: Bad flag `%s'\n", progName, aa->name );
usage ( progName );
exit ( 1 );
}
}
if (verbosity > 4) verbosity = 4;
if (opMode == OM_Z && smallMode && blockSize100k > 2)
blockSize100k = 2;
if (opMode == OM_TEST && srcMode == SM_F2O) {
(fprintf) ( stderr, "%s: -c and -t cannot be used together.\n",
progName );
exit ( 1 );
}
if (srcMode == SM_F2O && numFileNames == 0)
srcMode = SM_I2O;
if (opMode != OM_Z) blockSize100k = 0;
if (srcMode == SM_F2F) {
signal (SIGINT, mySignalCatcher);
signal (SIGTERM, mySignalCatcher);
# if BZ_UNIX
signal (SIGHUP, mySignalCatcher);
# endif
}
if (opMode == OM_Z) {
if (srcMode == SM_I2O) {
compress ( NULL );
} else {
decode = True;
for (aa = argList; aa != NULL; aa = aa->link) {
if (ISFLAG("--")) { decode = False; continue; }
if (aa->name[0] == '-' && decode) continue;
numFilesProcessed++;
compress ( aa->name );
}
}
}
else
if (opMode == OM_UNZ) {
unzFailsExist = False;
if (srcMode == SM_I2O) {
uncompress ( NULL );
} else {
decode = True;
for (aa = argList; aa != NULL; aa = aa->link) {
if (ISFLAG("--")) { decode = False; continue; }
if (aa->name[0] == '-' && decode) continue;
numFilesProcessed++;
uncompress ( aa->name );
}
}
if (unzFailsExist) {
setExit(2);
exit(exitValue);
}
}
else {
testFailsExist = False;
if (srcMode == SM_I2O) {
testf ( NULL );
} else {
decode = True;
for (aa = argList; aa != NULL; aa = aa->link) {
if (ISFLAG("--")) { decode = False; continue; }
if (aa->name[0] == '-' && decode) continue;
numFilesProcessed++;
testf ( aa->name );
}
}
if (testFailsExist) {
if (noisy) {
(fprintf) ( stderr,
"\n"
"You can use the `bzip2recover' program to attempt to recover\n"
"data from undamaged sections of corrupted files.\n\n"
);
}
setExit(2);
exit(exitValue);
}
}
/* Free the argument list memory to mollify leak detectors
(eg) Purify, Checker. Serves no other useful purpose.
*/
aa = argList;
while (aa != NULL) {
Cell* aa2 = aa->link;
if (aa->name != NULL) free(aa->name);
free(aa);
aa = aa2;
}
return exitValue;
}
/*-----------------------------------------------------------*/
/*--- end bzip2.c ---*/
/*-----------------------------------------------------------*/
| 56,661 | 1,949 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/LICENSE |
--------------------------------------------------------------------------
This program, "bzip2", the associated library "libbzip2", and all
documentation, are copyright (C) 1996-2019 Julian R Seward. All
rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. The origin of this software must not be misrepresented; you must
not claim that you wrote the original software. If you use this
software in a product, an acknowledgment in the product
documentation would be appreciated but is not required.
3. Altered source versions must be plainly marked as such, and must
not be misrepresented as being the original software.
4. The name of the author may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Julian Seward, [email protected]
bzip2/libbzip2 version 1.0.8 of 13 July 2019
--------------------------------------------------------------------------
| 1,896 | 43 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/words1 |
Doing 6 tests (3 compress, 3 uncompress) ...
If there's a problem, things might stop at this point.
| 103 | 5 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/words2 |
Checking test results. If any of the four "cmp"s which follow
report any differences, something is wrong. If you can't easily
figure out what, please let me know ([email protected]).
| 185 | 6 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/blocksort.c | /* clang-format off */
/*-------------------------------------------------------------*/
/*--- Block sorting machinery ---*/
/*--- blocksort.c ---*/
/*-------------------------------------------------------------*/
/* ------------------------------------------------------------------
This file is part of bzip2/libbzip2, a program and library for
lossless, block-sorting data compression.
bzip2/libbzip2 version 1.0.8 of 13 July 2019
Copyright (C) 1996-2019 Julian Seward <[email protected]>
Please read the WARNING, DISCLAIMER and PATENTS sections in the
README file.
This program is released under the terms of the license contained
in the file LICENSE.
------------------------------------------------------------------ */
#include "libc/mem/gc.internal.h"
#include "libc/mem/mem.h"
#include "third_party/bzip2/bzlib_private.inc"
/*---------------------------------------------*/
/*--- Fallback O(N log(N)^2) sorting ---*/
/*--- algorithm, for repetitive blocks ---*/
/*---------------------------------------------*/
/*---------------------------------------------*/
static
__inline__
void fallbackSimpleSort ( UInt32* fmap,
UInt32* eclass,
Int32 lo,
Int32 hi )
{
Int32 i, j, tmp;
UInt32 ec_tmp;
if (lo == hi) return;
if (hi - lo > 3) {
for ( i = hi-4; i >= lo; i-- ) {
tmp = fmap[i];
ec_tmp = eclass[tmp];
for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 )
fmap[j-4] = fmap[j];
fmap[j-4] = tmp;
}
}
for ( i = hi-1; i >= lo; i-- ) {
tmp = fmap[i];
ec_tmp = eclass[tmp];
for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ )
fmap[j-1] = fmap[j];
fmap[j-1] = tmp;
}
}
/*---------------------------------------------*/
#define fswap(zz1, zz2) \
{ Int32 zztmp = zz1; zz1 = zz2; zz2 = zztmp; }
#define fvswap(zzp1, zzp2, zzn) \
{ \
Int32 yyp1 = (zzp1); \
Int32 yyp2 = (zzp2); \
Int32 yyn = (zzn); \
while (yyn > 0) { \
fswap(fmap[yyp1], fmap[yyp2]); \
yyp1++; yyp2++; yyn--; \
} \
}
#define fmin(a,b) ((a) < (b)) ? (a) : (b)
#define fpush(lz,hz) { stackLo[sp] = lz; \
stackHi[sp] = hz; \
sp++; }
#define fpop(lz,hz) { sp--; \
lz = stackLo[sp]; \
hz = stackHi[sp]; }
#define FALLBACK_QSORT_SMALL_THRESH 10
#define FALLBACK_QSORT_STACK_SIZE 100
static
void fallbackQSort3 ( UInt32* fmap,
UInt32* eclass,
Int32 loSt,
Int32 hiSt )
{
Int32 unLo, unHi, ltLo, gtHi, n, m;
Int32 sp, lo, hi;
UInt32 med, r, r3;
Int32 stackLo[FALLBACK_QSORT_STACK_SIZE];
Int32 stackHi[FALLBACK_QSORT_STACK_SIZE];
r = 0;
sp = 0;
fpush ( loSt, hiSt );
while (sp > 0) {
AssertH ( sp < FALLBACK_QSORT_STACK_SIZE - 1, 1004 );
fpop ( lo, hi );
if (hi - lo < FALLBACK_QSORT_SMALL_THRESH) {
fallbackSimpleSort ( fmap, eclass, lo, hi );
continue;
}
/* Random partitioning. Median of 3 sometimes fails to
avoid bad cases. Median of 9 seems to help but
looks rather expensive. This too seems to work but
is cheaper. Guidance for the magic constants
7621 and 32768 is taken from Sedgewick's algorithms
book, chapter 35.
*/
r = ((r * 7621) + 1) % 32768;
r3 = r % 3;
if (r3 == 0) med = eclass[fmap[lo]]; else
if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else
med = eclass[fmap[hi]];
unLo = ltLo = lo;
unHi = gtHi = hi;
while (1) {
while (1) {
if (unLo > unHi) break;
n = (Int32)eclass[fmap[unLo]] - (Int32)med;
if (n == 0) {
fswap(fmap[unLo], fmap[ltLo]);
ltLo++; unLo++;
continue;
};
if (n > 0) break;
unLo++;
}
while (1) {
if (unLo > unHi) break;
n = (Int32)eclass[fmap[unHi]] - (Int32)med;
if (n == 0) {
fswap(fmap[unHi], fmap[gtHi]);
gtHi--; unHi--;
continue;
};
if (n < 0) break;
unHi--;
}
if (unLo > unHi) break;
fswap(fmap[unLo], fmap[unHi]); unLo++; unHi--;
}
AssertD ( unHi == unLo-1, "fallbackQSort3(2)" );
if (gtHi < ltLo) continue;
n = fmin(ltLo-lo, unLo-ltLo); fvswap(lo, unLo-n, n);
m = fmin(hi-gtHi, gtHi-unHi); fvswap(unLo, hi-m+1, m);
n = lo + unLo - ltLo - 1;
m = hi - (gtHi - unHi) + 1;
if (n - lo > hi - m) {
fpush ( lo, n );
fpush ( m, hi );
} else {
fpush ( m, hi );
fpush ( lo, n );
}
}
}
#undef fmin
#undef fpush
#undef fpop
#undef fswap
#undef fvswap
#undef FALLBACK_QSORT_SMALL_THRESH
#undef FALLBACK_QSORT_STACK_SIZE
/*---------------------------------------------*/
/* Pre:
nblock > 0
eclass exists for [0 .. nblock-1]
((UChar*)eclass) [0 .. nblock-1] holds block
ptr exists for [0 .. nblock-1]
Post:
((UChar*)eclass) [0 .. nblock-1] holds block
All other areas of eclass destroyed
fmap [0 .. nblock-1] holds sorted order
bhtab [ 0 .. 2+(nblock/32) ] destroyed
*/
#define SET_BH(zz) bhtab[(zz) >> 5] |= ((UInt32)1 << ((zz) & 31))
#define CLEAR_BH(zz) bhtab[(zz) >> 5] &= ~((UInt32)1 << ((zz) & 31))
#define ISSET_BH(zz) (bhtab[(zz) >> 5] & ((UInt32)1 << ((zz) & 31)))
#define WORD_BH(zz) bhtab[(zz) >> 5]
#define UNALIGNED_BH(zz) ((zz) & 0x01f)
static
void fallbackSort ( UInt32* fmap,
UInt32* eclass,
UInt32* bhtab,
Int32 nblock,
Int32 verb )
{
Int32 ftab[257];
Int32 ftabCopy[256];
Int32 H, i, j, k, l, r, cc, cc1;
Int32 nNotDone;
Int32 nBhtab;
UChar* eclass8 = (UChar*)eclass;
/*--
Initial 1-char radix sort to generate
initial fmap and initial BH bits.
--*/
if (verb >= 4)
VPrintf0 ( " bucket sorting ...\n" );
for (i = 0; i < 257; i++) ftab[i] = 0;
for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
for (i = 0; i < 256; i++) ftabCopy[i] = ftab[i];
for (i = 1; i < 257; i++) ftab[i] += ftab[i-1];
for (i = 0; i < nblock; i++) {
j = eclass8[i];
k = ftab[j] - 1;
ftab[j] = k;
fmap[k] = i;
}
nBhtab = 2 + (nblock / 32);
for (i = 0; i < nBhtab; i++) bhtab[i] = 0;
for (i = 0; i < 256; i++) SET_BH(ftab[i]);
/*--
Inductively refine the buckets. Kind-of an
"exponential radix sort" (!), inspired by the
Manber-Myers suffix array construction algorithm.
--*/
/*-- set sentinel bits for block-end detection --*/
for (i = 0; i < 32; i++) {
SET_BH(nblock + 2*i);
CLEAR_BH(nblock + 2*i + 1);
}
/*-- the log(N) loop --*/
H = 1;
while (1) {
if (verb >= 4)
VPrintf1 ( " depth %6d has ", H );
j = 0;
for (i = 0; i < nblock; i++) {
if (ISSET_BH(i)) j = i;
k = fmap[i] - H; if (k < 0) k += nblock;
eclass[k] = j;
}
nNotDone = 0;
r = -1;
while (1) {
/*-- find the next non-singleton bucket --*/
k = r + 1;
while (ISSET_BH(k) && UNALIGNED_BH(k)) k++;
if (ISSET_BH(k)) {
while (WORD_BH(k) == 0xffffffff) k += 32;
while (ISSET_BH(k)) k++;
}
l = k - 1;
if (l >= nblock) break;
while (!ISSET_BH(k) && UNALIGNED_BH(k)) k++;
if (!ISSET_BH(k)) {
while (WORD_BH(k) == 0x00000000) k += 32;
while (!ISSET_BH(k)) k++;
}
r = k - 1;
if (r >= nblock) break;
/*-- now [l, r] bracket current bucket --*/
if (r > l) {
nNotDone += (r - l + 1);
fallbackQSort3 ( fmap, eclass, l, r );
/*-- scan bucket and generate header bits-- */
cc = -1;
for (i = l; i <= r; i++) {
cc1 = eclass[fmap[i]];
if (cc != cc1) { SET_BH(i); cc = cc1; };
}
}
}
if (verb >= 4)
VPrintf1 ( "%6d unresolved strings\n", nNotDone );
H *= 2;
if (H > nblock || nNotDone == 0) break;
}
/*--
Reconstruct the original block in
eclass8 [0 .. nblock-1], since the
previous phase destroyed it.
--*/
if (verb >= 4)
VPrintf0 ( " reconstructing block ...\n" );
j = 0;
for (i = 0; i < nblock; i++) {
while (ftabCopy[j] == 0) j++;
ftabCopy[j]--;
eclass8[fmap[i]] = (UChar)j;
}
AssertH ( j < 256, 1005 );
}
#undef SET_BH
#undef CLEAR_BH
#undef ISSET_BH
#undef WORD_BH
#undef UNALIGNED_BH
/*---------------------------------------------*/
/*--- The main, O(N^2 log(N)) sorting ---*/
/*--- algorithm. Faster for "normal" ---*/
/*--- non-repetitive blocks. ---*/
/*---------------------------------------------*/
/*---------------------------------------------*/
static
__inline__
Bool mainGtU ( UInt32 i1,
UInt32 i2,
UChar* block,
UInt16* quadrant,
UInt32 nblock,
Int32* budget )
{
Int32 k;
UChar c1, c2;
UInt16 s1, s2;
AssertD ( i1 != i2, "mainGtU" );
/* 1 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
i1++; i2++;
/* 2 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
i1++; i2++;
/* 3 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
i1++; i2++;
/* 4 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
i1++; i2++;
/* 5 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
i1++; i2++;
/* 6 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
i1++; i2++;
/* 7 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
i1++; i2++;
/* 8 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
i1++; i2++;
/* 9 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
i1++; i2++;
/* 10 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
i1++; i2++;
/* 11 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
i1++; i2++;
/* 12 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
i1++; i2++;
k = nblock + 8;
do {
/* 1 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
s1 = quadrant[i1]; s2 = quadrant[i2];
if (s1 != s2) return (s1 > s2);
i1++; i2++;
/* 2 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
s1 = quadrant[i1]; s2 = quadrant[i2];
if (s1 != s2) return (s1 > s2);
i1++; i2++;
/* 3 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
s1 = quadrant[i1]; s2 = quadrant[i2];
if (s1 != s2) return (s1 > s2);
i1++; i2++;
/* 4 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
s1 = quadrant[i1]; s2 = quadrant[i2];
if (s1 != s2) return (s1 > s2);
i1++; i2++;
/* 5 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
s1 = quadrant[i1]; s2 = quadrant[i2];
if (s1 != s2) return (s1 > s2);
i1++; i2++;
/* 6 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
s1 = quadrant[i1]; s2 = quadrant[i2];
if (s1 != s2) return (s1 > s2);
i1++; i2++;
/* 7 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
s1 = quadrant[i1]; s2 = quadrant[i2];
if (s1 != s2) return (s1 > s2);
i1++; i2++;
/* 8 */
c1 = block[i1]; c2 = block[i2];
if (c1 != c2) return (c1 > c2);
s1 = quadrant[i1]; s2 = quadrant[i2];
if (s1 != s2) return (s1 > s2);
i1++; i2++;
if (i1 >= nblock) i1 -= nblock;
if (i2 >= nblock) i2 -= nblock;
k -= 8;
(*budget)--;
}
while (k >= 0);
return False;
}
/*---------------------------------------------*/
/*--
Knuth's increments seem to work better
than Incerpi-Sedgewick here. Possibly
because the number of elems to sort is
usually small, typically <= 20.
--*/
static
Int32 incs[14] = { 1, 4, 13, 40, 121, 364, 1093, 3280,
9841, 29524, 88573, 265720,
797161, 2391484 };
static
void mainSimpleSort ( UInt32* ptr,
UChar* block,
UInt16* quadrant,
Int32 nblock,
Int32 lo,
Int32 hi,
Int32 d,
Int32* budget )
{
Int32 i, j, h, bigN, hp;
UInt32 v;
bigN = hi - lo + 1;
if (bigN < 2) return;
hp = 0;
while (incs[hp] < bigN) hp++;
hp--;
for (; hp >= 0; hp--) {
h = incs[hp];
i = lo + h;
while (True) {
/*-- copy 1 --*/
if (i > hi) break;
v = ptr[i];
j = i;
while ( mainGtU (
ptr[j-h]+d, v+d, block, quadrant, nblock, budget
) ) {
ptr[j] = ptr[j-h];
j = j - h;
if (j <= (lo + h - 1)) break;
}
ptr[j] = v;
i++;
/*-- copy 2 --*/
if (i > hi) break;
v = ptr[i];
j = i;
while ( mainGtU (
ptr[j-h]+d, v+d, block, quadrant, nblock, budget
) ) {
ptr[j] = ptr[j-h];
j = j - h;
if (j <= (lo + h - 1)) break;
}
ptr[j] = v;
i++;
/*-- copy 3 --*/
if (i > hi) break;
v = ptr[i];
j = i;
while ( mainGtU (
ptr[j-h]+d, v+d, block, quadrant, nblock, budget
) ) {
ptr[j] = ptr[j-h];
j = j - h;
if (j <= (lo + h - 1)) break;
}
ptr[j] = v;
i++;
if (*budget < 0) return;
}
}
}
/*---------------------------------------------*/
/*--
The following is an implementation of
an elegant 3-way quicksort for strings,
described in a paper "Fast Algorithms for
Sorting and Searching Strings", by Robert
Sedgewick and Jon L. Bentley.
--*/
#define mswap(zz1, zz2) \
{ Int32 zztmp = zz1; zz1 = zz2; zz2 = zztmp; }
#define mvswap(zzp1, zzp2, zzn) \
{ \
Int32 yyp1 = (zzp1); \
Int32 yyp2 = (zzp2); \
Int32 yyn = (zzn); \
while (yyn > 0) { \
mswap(ptr[yyp1], ptr[yyp2]); \
yyp1++; yyp2++; yyn--; \
} \
}
static
__inline__
UChar mmed3 ( UChar a, UChar b, UChar c )
{
UChar t;
if (a > b) { t = a; a = b; b = t; };
if (b > c) {
b = c;
if (a > b) b = a;
}
return b;
}
#define mmin(a,b) ((a) < (b)) ? (a) : (b)
#define mpush(lz,hz,dz) { stackLo[sp] = lz; \
stackHi[sp] = hz; \
stackD [sp] = dz; \
sp++; }
#define mpop(lz,hz,dz) { sp--; \
lz = stackLo[sp]; \
hz = stackHi[sp]; \
dz = stackD [sp]; }
#define mnextsize(az) (nextHi[az]-nextLo[az])
#define mnextswap(az,bz) \
{ Int32 tz; \
tz = nextLo[az]; nextLo[az] = nextLo[bz]; nextLo[bz] = tz; \
tz = nextHi[az]; nextHi[az] = nextHi[bz]; nextHi[bz] = tz; \
tz = nextD [az]; nextD [az] = nextD [bz]; nextD [bz] = tz; }
#define MAIN_QSORT_SMALL_THRESH 20
#define MAIN_QSORT_DEPTH_THRESH (BZ_N_RADIX + BZ_N_QSORT)
#define MAIN_QSORT_STACK_SIZE 100
static
void mainQSort3 ( UInt32* ptr,
UChar* block,
UInt16* quadrant,
Int32 nblock,
Int32 loSt,
Int32 hiSt,
Int32 dSt,
Int32* budget )
{
Int32 unLo, unHi, ltLo, gtHi, n, m, med;
Int32 sp, lo, hi, d;
Int32 stackLo[MAIN_QSORT_STACK_SIZE];
Int32 stackHi[MAIN_QSORT_STACK_SIZE];
Int32 stackD [MAIN_QSORT_STACK_SIZE];
Int32 nextLo[3];
Int32 nextHi[3];
Int32 nextD [3];
sp = 0;
mpush ( loSt, hiSt, dSt );
while (sp > 0) {
AssertH ( sp < MAIN_QSORT_STACK_SIZE - 2, 1001 );
mpop ( lo, hi, d );
if (hi - lo < MAIN_QSORT_SMALL_THRESH ||
d > MAIN_QSORT_DEPTH_THRESH) {
mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
if (*budget < 0) return;
continue;
}
med = (Int32)
mmed3 ( block[ptr[ lo ]+d],
block[ptr[ hi ]+d],
block[ptr[ (lo+hi)>>1 ]+d] );
unLo = ltLo = lo;
unHi = gtHi = hi;
while (True) {
while (True) {
if (unLo > unHi) break;
n = ((Int32)block[ptr[unLo]+d]) - med;
if (n == 0) {
mswap(ptr[unLo], ptr[ltLo]);
ltLo++; unLo++; continue;
};
if (n > 0) break;
unLo++;
}
while (True) {
if (unLo > unHi) break;
n = ((Int32)block[ptr[unHi]+d]) - med;
if (n == 0) {
mswap(ptr[unHi], ptr[gtHi]);
gtHi--; unHi--; continue;
};
if (n < 0) break;
unHi--;
}
if (unLo > unHi) break;
mswap(ptr[unLo], ptr[unHi]); unLo++; unHi--;
}
AssertD ( unHi == unLo-1, "mainQSort3(2)" );
if (gtHi < ltLo) {
mpush(lo, hi, d+1 );
continue;
}
n = mmin(ltLo-lo, unLo-ltLo); mvswap(lo, unLo-n, n);
m = mmin(hi-gtHi, gtHi-unHi); mvswap(unLo, hi-m+1, m);
n = lo + unLo - ltLo - 1;
m = hi - (gtHi - unHi) + 1;
nextLo[0] = lo; nextHi[0] = n; nextD[0] = d;
nextLo[1] = m; nextHi[1] = hi; nextD[1] = d;
nextLo[2] = n+1; nextHi[2] = m-1; nextD[2] = d+1;
if (mnextsize(0) < mnextsize(1)) mnextswap(0,1);
if (mnextsize(1) < mnextsize(2)) mnextswap(1,2);
if (mnextsize(0) < mnextsize(1)) mnextswap(0,1);
AssertD (mnextsize(0) >= mnextsize(1), "mainQSort3(8)" );
AssertD (mnextsize(1) >= mnextsize(2), "mainQSort3(9)" );
mpush (nextLo[0], nextHi[0], nextD[0]);
mpush (nextLo[1], nextHi[1], nextD[1]);
mpush (nextLo[2], nextHi[2], nextD[2]);
}
}
#undef mswap
#undef mvswap
#undef mpush
#undef mpop
#undef mmin
#undef mnextsize
#undef mnextswap
#undef MAIN_QSORT_SMALL_THRESH
#undef MAIN_QSORT_DEPTH_THRESH
#undef MAIN_QSORT_STACK_SIZE
/*---------------------------------------------*/
/* Pre:
nblock > N_OVERSHOOT
block32 exists for [0 .. nblock-1 +N_OVERSHOOT]
((UChar*)block32) [0 .. nblock-1] holds block
ptr exists for [0 .. nblock-1]
Post:
((UChar*)block32) [0 .. nblock-1] holds block
All other areas of block32 destroyed
ftab [0 .. 65536 ] destroyed
ptr [0 .. nblock-1] holds sorted order
if (*budget < 0), sorting was abandoned
*/
#define BIGFREQ(b) (ftab[((b)+1) << 8] - ftab[(b) << 8])
#define SETMASK (1 << 21)
#define CLEARMASK (~(SETMASK))
static
void mainSort ( UInt32* ptr,
UChar* block,
UInt16* quadrant,
UInt32* ftab,
Int32 nblock,
Int32 verb,
Int32* budget )
{
Int32 i, j, k, ss, sb;
Bool bigDone[256];
Int32 *runningOrder = gc(calloc(256,4));
Int32 *copyStart = gc(calloc(256,4));
Int32 *copyEnd = gc(calloc(256,4));
UChar c1;
Int32 numQSorted;
UInt16 s;
if (verb >= 4) VPrintf0 ( " main sort initialise ...\n" );
/*-- set up the 2-byte frequency table --*/
for (i = 65536; i >= 0; i--) ftab[i] = 0;
j = block[0] << 8;
i = nblock-1;
for (; i >= 3; i -= 4) {
quadrant[i] = 0;
j = (j >> 8) | ( ((UInt16)block[i]) << 8);
ftab[j]++;
quadrant[i-1] = 0;
j = (j >> 8) | ( ((UInt16)block[i-1]) << 8);
ftab[j]++;
quadrant[i-2] = 0;
j = (j >> 8) | ( ((UInt16)block[i-2]) << 8);
ftab[j]++;
quadrant[i-3] = 0;
j = (j >> 8) | ( ((UInt16)block[i-3]) << 8);
ftab[j]++;
}
for (; i >= 0; i--) {
quadrant[i] = 0;
j = (j >> 8) | ( ((UInt16)block[i]) << 8);
ftab[j]++;
}
/*-- (emphasises close relationship of block & quadrant) --*/
for (i = 0; i < BZ_N_OVERSHOOT; i++) {
block [nblock+i] = block[i];
quadrant[nblock+i] = 0;
}
if (verb >= 4) VPrintf0 ( " bucket sorting ...\n" );
/*-- Complete the initial radix sort --*/
for (i = 1; i <= 65536; i++) ftab[i] += ftab[i-1];
s = block[0] << 8;
i = nblock-1;
for (; i >= 3; i -= 4) {
s = (s >> 8) | (block[i] << 8);
j = ftab[s] -1;
ftab[s] = j;
ptr[j] = i;
s = (s >> 8) | (block[i-1] << 8);
j = ftab[s] -1;
ftab[s] = j;
ptr[j] = i-1;
s = (s >> 8) | (block[i-2] << 8);
j = ftab[s] -1;
ftab[s] = j;
ptr[j] = i-2;
s = (s >> 8) | (block[i-3] << 8);
j = ftab[s] -1;
ftab[s] = j;
ptr[j] = i-3;
}
for (; i >= 0; i--) {
s = (s >> 8) | (block[i] << 8);
j = ftab[s] -1;
ftab[s] = j;
ptr[j] = i;
}
/*--
Now ftab contains the first loc of every small bucket.
Calculate the running order, from smallest to largest
big bucket.
--*/
for (i = 0; i <= 255; i++) {
bigDone [i] = False;
runningOrder[i] = i;
}
{
Int32 vv;
Int32 h = 1;
do h = 3 * h + 1; while (h <= 256);
do {
h = h / 3;
for (i = h; i <= 255; i++) {
vv = runningOrder[i];
j = i;
while ( BIGFREQ(runningOrder[j-h]) > BIGFREQ(vv) ) {
runningOrder[j] = runningOrder[j-h];
j = j - h;
if (j <= (h - 1)) goto zero;
}
zero:
runningOrder[j] = vv;
}
} while (h != 1);
}
/*--
The main sorting loop.
--*/
numQSorted = 0;
for (i = 0; i <= 255; i++) {
/*--
Process big buckets, starting with the least full.
Basically this is a 3-step process in which we call
mainQSort3 to sort the small buckets [ss, j], but
also make a big effort to avoid the calls if we can.
--*/
ss = runningOrder[i];
/*--
Step 1:
Complete the big bucket [ss] by quicksorting
any unsorted small buckets [ss, j], for j != ss.
Hopefully previous pointer-scanning phases have already
completed many of the small buckets [ss, j], so
we don't have to sort them at all.
--*/
for (j = 0; j <= 255; j++) {
if (j != ss) {
sb = (ss << 8) + j;
if ( ! (ftab[sb] & SETMASK) ) {
Int32 lo = ftab[sb] & CLEARMASK;
Int32 hi = (ftab[sb+1] & CLEARMASK) - 1;
if (hi > lo) {
if (verb >= 4)
VPrintf4 ( " qsort [0x%x, 0x%x] "
"done %d this %d\n",
ss, j, numQSorted, hi - lo + 1 );
mainQSort3 (
ptr, block, quadrant, nblock,
lo, hi, BZ_N_RADIX, budget
);
numQSorted += (hi - lo + 1);
if (*budget < 0) return;
}
}
ftab[sb] |= SETMASK;
}
}
AssertH ( !bigDone[ss], 1006 );
/*--
Step 2:
Now scan this big bucket [ss] so as to synthesise the
sorted order for small buckets [t, ss] for all t,
including, magically, the bucket [ss,ss] too.
This will avoid doing Real Work in subsequent Step 1's.
--*/
{
for (j = 0; j <= 255; j++) {
copyStart[j] = ftab[(j << 8) + ss] & CLEARMASK;
copyEnd [j] = (ftab[(j << 8) + ss + 1] & CLEARMASK) - 1;
}
for (j = ftab[ss << 8] & CLEARMASK; j < copyStart[ss]; j++) {
k = ptr[j]-1; if (k < 0) k += nblock;
c1 = block[k];
if (!bigDone[c1])
ptr[ copyStart[c1]++ ] = k;
}
for (j = (ftab[(ss+1) << 8] & CLEARMASK) - 1; j > copyEnd[ss]; j--) {
k = ptr[j]-1; if (k < 0) k += nblock;
c1 = block[k];
if (!bigDone[c1])
ptr[ copyEnd[c1]-- ] = k;
}
}
AssertH ( (copyStart[ss]-1 == copyEnd[ss])
||
/* Extremely rare case missing in bzip2-1.0.0 and 1.0.1.
Necessity for this case is demonstrated by compressing
a sequence of approximately 48.5 million of character
251; 1.0.0/1.0.1 will then die here. */
(copyStart[ss] == 0 && copyEnd[ss] == nblock-1),
1007 )
for (j = 0; j <= 255; j++) ftab[(j << 8) + ss] |= SETMASK;
/*--
Step 3:
The [ss] big bucket is now done. Record this fact,
and update the quadrant descriptors. Remember to
update quadrants in the overshoot area too, if
necessary. The "if (i < 255)" test merely skips
this updating for the last bucket processed, since
updating for the last bucket is pointless.
The quadrant array provides a way to incrementally
cache sort orderings, as they appear, so as to
make subsequent comparisons in fullGtU() complete
faster. For repetitive blocks this makes a big
difference (but not big enough to be able to avoid
the fallback sorting mechanism, exponential radix sort).
The precise meaning is: at all times:
for 0 <= i < nblock and 0 <= j <= nblock
if block[i] != block[j],
then the relative values of quadrant[i] and
quadrant[j] are meaningless.
else {
if quadrant[i] < quadrant[j]
then the string starting at i lexicographically
precedes the string starting at j
else if quadrant[i] > quadrant[j]
then the string starting at j lexicographically
precedes the string starting at i
else
the relative ordering of the strings starting
at i and j has not yet been determined.
}
--*/
bigDone[ss] = True;
if (i < 255) {
Int32 bbStart = ftab[ss << 8] & CLEARMASK;
Int32 bbSize = (ftab[(ss+1) << 8] & CLEARMASK) - bbStart;
Int32 shifts = 0;
while ((bbSize >> shifts) > 65534) shifts++;
for (j = bbSize-1; j >= 0; j--) {
Int32 a2update = ptr[bbStart + j];
UInt16 qVal = (UInt16)(j >> shifts);
quadrant[a2update] = qVal;
if (a2update < BZ_N_OVERSHOOT)
quadrant[a2update + nblock] = qVal;
}
AssertH ( ((bbSize-1) >> shifts) <= 65535, 1002 );
}
}
if (verb >= 4)
VPrintf3 ( " %d pointers, %d sorted, %d scanned\n",
nblock, numQSorted, nblock - numQSorted );
}
#undef BIGFREQ
#undef SETMASK
#undef CLEARMASK
/*---------------------------------------------*/
/* Pre:
nblock > 0
arr2 exists for [0 .. nblock-1 +N_OVERSHOOT]
((UChar*)arr2) [0 .. nblock-1] holds block
arr1 exists for [0 .. nblock-1]
Post:
((UChar*)arr2) [0 .. nblock-1] holds block
All other areas of block destroyed
ftab [ 0 .. 65536 ] destroyed
arr1 [0 .. nblock-1] holds sorted order
*/
void BZ2_blockSort ( EState* s )
{
UInt32* ptr = s->ptr;
UChar* block = s->block;
UInt32* ftab = s->ftab;
Int32 nblock = s->nblock;
Int32 verb = s->verbosity;
Int32 wfact = s->workFactor;
UInt16* quadrant;
Int32 budget;
Int32 budgetInit;
Int32 i;
if (nblock < 10000) {
fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
} else {
/* Calculate the location for quadrant, remembering to get
the alignment right. Assumes that &(block[0]) is at least
2-byte aligned -- this should be ok since block is really
the first section of arr2.
*/
i = nblock+BZ_N_OVERSHOOT;
if (i & 1) i++;
quadrant = (UInt16*)(&(block[i]));
/* (wfact-1) / 3 puts the default-factor-30
transition point at very roughly the same place as
with v0.1 and v0.9.0.
Not that it particularly matters any more, since the
resulting compressed stream is now the same regardless
of whether or not we use the main sort or fallback sort.
*/
if (wfact < 1 ) wfact = 1;
if (wfact > 100) wfact = 100;
budgetInit = nblock * ((wfact-1) / 3);
budget = budgetInit;
mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
if (verb >= 3)
VPrintf3 ( " %d work, %d block, ratio %5.2f\n",
budgetInit - budget,
nblock,
(float)(budgetInit - budget) /
(float)(nblock==0 ? 1 : nblock) );
if (budget < 0) {
if (verb >= 2)
VPrintf0 ( " too repetitive; using fallback"
" sorting algorithm\n" );
fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
}
}
s->origPtr = -1;
for (i = 0; i < s->nblock; i++)
if (ptr[i] == 0)
{ s->origPtr = i; break; };
AssertH( s->origPtr != -1, 1003 );
}
/*-------------------------------------------------------------*/
/*--- end blocksort.c ---*/
/*-------------------------------------------------------------*/
| 30,862 | 1,098 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/sample1.bz2 | BZh11AY&SYÌñµ¥ ¾¦ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿàßx > Y ;aÛ»bµÌ6¬ ½ô}mÁè: ëÙÃè ½n½Ý»îÖnMîç¶ ÎJ°ãÛ6ö³Ì¶ë£z±-)³]{wom¹s§[r»¸u°Mt¯co¬}µly;³èhÏ-ÓI»Çµox õN¦ã¯n^ó¶ÞÝïeì7íq½è £^|÷i§lØÂ}ð§{¾¾ìoµõ¾ûãѼ¬ëEDIñ\ ÝkÐô
¼öÞ^øÛçÖÝï;ÛÝ˯yÝM¼åW³ÕOvç«`ÑòûÛÃë|ù +âçw[àç l2[¾ù¾õö»lõ ( UmÇÖuÐ ÛW¶Þ À}P¯u¸Å´Ð¶^÷$ÜÕAìÚÆØÀ /cSïw0FÙµM] M"4Ó@h44ÐidL4ÑÐ bi²S=ð§äÄÊy¡OM4Sðüé¦OE61O"<êm4i¢f
§
OzIâzF
mS5=OÔOSj ÄÐ@ê zh F@ LD¦¦mSMIèmCÒdÒ43A¤z¦z=&ªbDÓÔôѧ¤À hddÄa ÓM144£M14H@ALJxôÈh¦õO(ÓOSÓM#Éè¦Cõ#Ôòê6¡¦dhõh?Tiz&z
Ô =MP4 õ¨ziô ¡ é0©þ§µ0hÒOÐ4ÔÙ4O"jz4ôSÔ
4̦Ôõ6düÔÉ6§©¶é=)êm ÊÒ5 "zOF=CM4F¦ÒOSÓÓSM ê4{E3LÔA"! !< MDò§é¤ôjzj
SÒª=©4ñ'4z2õÐÔmGêM ÔyCÐÓF!¨zÓ@Ó&PdýMCLÔÉê6¡§|fBD«^ͬ1Ë6}uh׳kkb?ò21%vhÑÔHfÀMp4$àÛ÷?T~Y®=2êÒåF¸4û»rérQRLpC01ÈK *C3EiJ(¦F0R,ih±¢¬DUa
Ä-)ôHaAVnÊÁE»a¢å¢Ä·.\¹Jµ-
!¬X¤b«U¢©Z\j9hÅÊÚ4TX,Tq©\Q@b1jåª*®-
¢ÕUÚÁOAØQ¦ ªQ©wpRÑ*\E±X°U"fbÅ}Ùï+
,U û¼Ì@®¹jþtÂgÊ(^A1¢êO¸V|zR£tVÒá5'b\:ch\ÉnG6P3PC@ÔEm0ª) 2#"hb ~U ] *[")¾R*r lµX¸Ê-J[$Ä
¿adHIìÑH«Pc!$ HßANÁìVÉA{êÖ¿ì ;÷?þúÍÃPÔ
2$©4CGÀ >1¹áÉ]*ôM,cI(g· Ë^û/½°OÖmçâÊEéo5«'ö ©Â¥¶îy kC*±:þS?i
ïØ2ºµh©sÁT\j,nÑYÿ0´\e´DRV-´k[J§ÖRª¢¢®R¶±mQ²¹I!h(ª*%*
Q©j4"ÅX[h
¥EjJTlTDª è4TX§ &GMRÙU¨bTFÛ
ÕËaET"*1-²Ø#bµY*-b¶¢(+GõÉQjÊZR±k hÒD´X¥J¨(QRÅ©PXw&%´*V´DQYKFÐkEd¬FÛ%` -¢%£EàÊeZ
ÒÖÌýµÌ¶®í2Ê%Am¥,VÚR¥¶ªÖ)X iªÛ*Ù
©ááV²ÙFRÖµk}9 DjTQj¥¶Uµd³ óS5d½D³în±
Ú<eµLÿ [×àïC
oäû¶ÿE«Ìò¡K?Ò 8ØKÛ¹
-_Hþ ùzbV@_@éôç0g(IÐH "D+$¨@P6|'ìÄP8ÛR¸ª¨#×z®f©ÁÔì1mDh¾·¹ùnLþÛàÌó5´Ør
°©;á'iÝ;ÎîÊó$é"6Xb%´+ mHAAH2 ,",*ÉXdR,#"B², D$$íù~*wiñüwñq ø#ØÓr~5¿ .y$ò
Ãüz¦iIL:âQ´]¦á$èdt8='Uî=K¹à;]ÿ·Mëï ÄèÝR>Õ)ò¿|îÏNè+"(/ÜPù¨úöèá¾ÃPÝÿò辰~90Q £
Å«ïóÐî0A¥Ï²3HÄÿDrûùÂåÅ@o¨
Í*D*xL³ÐøÝLÒ|5þÿq¿öa¤ |{A©àF^ ÞU a<ydSþû¼Än»îsÛ®sïZ»¼°Çtj~²3WÈðÚ×;/Yò(ãíÞ¿f¡éÁúa%ôXÞwrjcx~µÞär&7vRºþýl'ª;|9y¨øùC JHdÜëxí¼ÆmTá 2OüYdç1$ÒE AL4"?lâwgÕ$òeoKGá{´p{¬·àq¢$ AY
jA¤BdU¤RD(@dÁ ¸ó¡ÂÎx~ßãz FAbbÂ*¬,ad(
)V ¤AH,1AAP@b$0Û#w®D·$EoWNð¼Éàyiêû騸_ RDL
$\åSÜz®_N§Î'=84.è=¿ô0!Zõ| NsW8ØrÓÓ®>`~äS rqo Þ¤ªØbISÝM@N·³ð¶sv\8@3Ñ8X²,#$¤
B(¢Á¶¡aE ¤UP
¤¡XJÀY"Å°*¤¬¤ Ê%¬²°PEQª`,bÁª°FD`'àâùXÊÑ!8O¡é¸¯7·ôN'6ZÆ ö;^ÀÖMn
¾4
Ùys ³ 4Ü~ºÅ Ëh²GA9£ù
Üä¯ }4 Àa36e/õ;oÎUç!ˬë»sI¦$X"wÅß!$Í
(eÄF4Ìèé %ÕfÈ
°¸×Êq1ö!Ìu¼:ò¡$* \tpñ»îp¤Ppaw¶þi/ú©Ê)V*Ìo;Îs³¤Á¾ÞÇu¼sv÷J4 _;t,±¡Ò£¡áºA¬NG "2" ÉH,s ï |q'´ä÷û Ã7ó Tÿ˺¿èwøç ÝK¹s÷q¸OÃÎÉÎ}dÐh ìÜúJv<i g1ÐýÔÒ[ôµQô¢q_ÛaØ·û"Û¶Ò_ëÃuûi]¿WÛõ?U¿BÜ8Ï/°Ó_Ûc³~9eS¬; îúzþ'a y<aF«ïÂû»{¥QùÛ'¼]ñÑøWñÃÉ´_>uÜ ¹_I±d>¾ñ}¬Y)%ªÕ7EP>ãù4Êên°^9qλ°Ì|RÆ[%¡s !&â·:²I¢LáÕØa©Pñïâ×ïZìI&ç_.ÉaÁ¾czùÄ.Ñ>É®fflG`CÕ¯5!Z ÎÿFgû_o; åÜ×<oÒ6~oU¥ÄvûÉ;*³¶X"y(,_bHòô¦A¥4ÆPí+èMm²@2yt\3£ç¶ d-X7ç^bdíÓqýXÏ45õòÙõv`yÛXWtî3áRÂþ«KK7<¼m\é|Óº}íu<×1~?ÌëähìÆm~TÎfTNÕîMÎ]DQjwÀ¤ªÕ«T,R»©4Çú/(ÐæaRÝý©¯ð&p«¿¯Öñnç®üjûà=¢5l±¸Ç [¦5¾½>?GËHñ<Z¬ý/TÐ.ñ$ Üóú=ú,uz©I#»É&õ´IRDID ÓðKzäp$ã H¤ê /}ÿx®Æï mï#"¾kO>re³T¥£?
sÏÕÏR4èÕâØñÖ5ÔËûÏ¿ E,µ3¨< tO îGÔmbøL }è°ùHË}ýjô³ÚNmGßɸÃæ»,-S#ìÓì±ïýÏ(½¾?-+ìR åU SÂ
[(D²@ø;z×ä®ðÒP.K¾|ô¢íè¼Ëôá à¾D»pm g_C øP1{õÿ*gÖ¼yÏûeÕ²èi´Ý=MúÀí¾xú¹÷gÎ8+"~rª{Ö ¯®¦` .''/º RìGG³<'î[çÙGîæ9dÒ÷,B rÞ®¯Ajdí)ô¯,ü6ñÞt^>:äxÐX̹j8Õ *M_"Õ9ô²Ó± 9q?m¤Ííýï¿V÷w¶Þº>ÒµYp¯$ÊÔkTÎêµò´åÂÒcb %«)¼¡hæQwínü&*¦ù¥ºG)!®§RAªûCáØ` áûUFümï¿láºÂ*1 á`¼õ7©O³Ö.-)'cçÉï°àK=Áá~a3t¯$
:LØÿ4Ë gôø¾ÙêO¼ç6È31k/:\Ý ÞsÙèOy9À¤²0èBda!æÍN·ÐäY¨U¯¦ÔéI×HÄ/6eQ Ö7#ÍfÓåO.mÔÛµÔ³Op¼Ç, oÝW Æ`iÙ]6^÷qØ ä`\¯V
rtb2Bâ+Ë}ÿ
BáP ÿ(°{¬ç°0S ×XYë%vä_` 6Xêjt}U\Φ¦¨«Y3x8ðÆuRsñPK%ËÙ¤aM«ãá¸àRá_l~«
zS¿vÓOåëþ®má¶ü ¿ë1ñ*I$÷ªYÈå£Î'õO1ð7éùNѬ^X7w¥PÆÈÆ .\¡ï-ÂÉVKÙ,qÅ"Åïòäý/éÿS¡ªÔ ß
±ZFÁY½þÑOl-6àÌOÇ~n-ÑzmÀ| ¹|кnÂÖp>3hÙCt¸+ë|Ã!¹³[ñ:îmÈA¢Ñã631F_R¹P1ʹ½ f\Z
mwÐÖØ)6¯MÅßotØà>uãéRû+",B2$È`Úkè17
%r³ét÷üÇìÒ¥4yFñ³ÜþYâ
|ÿ콿Ùv"$`rìâ#øÔ²çñ}éQ
ϦlÝtðzôq±éD4\þ7Þ?·cÇTBo8o¯ÓiÇ'G÷¹ï8ó îZêùwõò0n çÎ%I!Cþ. x_δ¨ùÝäýYøþß>ÝS`øܽga1¤RqD ¿êo£¹ÝwZrTÏz "0z§e,~S¯
«0rWC øÅÏÁÚ}èç
¢0:cÙuÇêè:ù#qû®Î¾ÜÊK <æëÃÌDnÓëõLݨ*ò_NÆkàtrÍõ*ÿR>nôsxØøk^nOâÞÎÉJ¨
`°¬
ÂùCúôrpÜ#ív\õÎ#÷ÌQw»B Íß¾¨áÔÑ·W´P¹'eDÛ<õÜOaÞîgïÞÔG:DÄ©xwWCÉ N Üä¡C§öEù ¸Çì°Cgñ(ú4ÿôEs1%?B?ÕÛÚüOWS{ËÓµgË]Xä2cÿ¶/ðð¶£Jé>j;´4òÒ¬®akBE®¨£+)º²¾}ÝWþù--Jeõ½ðìÞ[õ7Ê)ÔdäY×UìuîwG.ç_Úr5n î9Bsàÿííç¦`k%@-´kb
X()ÁV¬d£"°H±Y
k )`TÈTBÛcY
diQ0k$$* aU´,(ÚTE)
ÈQ%lc*V¥bA%H°YEªª£H" DED%Ab"`e¨§µ/i'w<,©¬;ô½
ÞD×ÌÁ´ÀaQ³'F0èb¦w"ÜöËqä.v!ôue?=O-`½ÄVï~Ì0S4X¥4©@qrU#
¿ãè3ñõxÒlÞ
¼u0úÝãû,1Ñq?]ÿ9ÁÔ+ {Îë¿¿ÃlöEãISÿx[=½¶ÁÈ©[Ðr¿çæf×Ýyµ
Io å¸ z¦»#Æú/¾8)ËÈæ¡á]ó ¥_|_ìæ*n663s7>×9Ƴ æ[¹±cô칫@-ëíÅB¹oØ&9CÌ)°ÚdpmñÉ} ®%?Ü
Ó©x¿äÅƱ$Ú¤ïÇ&Üòn½Í|S}"ôFù¨¦xêOÖ±ªÕLô?ÃT¾^.J©·ÈúhÛïÀµB¤3ßÜAÿ8ØEË'N*úg!v=ä/Ô"aB
DÝ]0`Ðû ̺ê
_©âünÆÑ8mËìÒþÛì½íë»ÕÜsÆrMúæðühG2ºÙü4Kw´gCÂ#lz-éföX¿n1ÌÖÇÎáRëäuÎåìïó|z·ùËÞ ÔqÐÜy6¯øGÏVÂ Í OTm
¹ÁÙßhý?r]̶2?/óäÌk^ÇsÝsòáûnfÁ]7uÊÒúÑlâG så^JïPì¬èþòÛ$
{å`ßµ/9覼îrXnþ;ÖåªKRËäµÊÈÝ?[ë,JS@CÖZ+7|.%ÔÀ¾cn²¨Âo®a/Y5ù
¤
Ù^8¬\ m½MÂ,güÏïàtvA
©^ÞkÖº©ó«1¶ Kÿ¨róUã£Q²¦Î6»¬í}ÈëÔ¦&$ £÷
DZ32Rð²÷ʵ$2SG൰ð5'Õ³VJ§øïÓ\;G©Äþ@EÛ¨ *"2
"( B+77-7WYYbßÁÎCÛ^¢ß"Ccý7¤í ^[½Èý¾=æC]o=Æxºß7óÃà ÿBýaëýÂRÂbmvÄ«½ö¨#÷;εàÆ÷vfcÂÁ³ÍbñÁ/ÃônÄp åwô¦}þÕN¹óßä1ù ÙJW¹Ñ0Ö0ÈÀµQjô² SJe Í BILØSÞüïÄå.ÉQ5¿ç
Þ½_aåÙX)?þäjÖ ORÏé£ôÔ >áÒDúú],Dû ×íÚ®NwÂBIq»EÝG²ù> ªïàÒz%$ðb¡:òÿ $·Ï«K¤Ai° {,øÞöøT¦USCЩ´Ó ¾AZöLÀH\Õéü&<óêy Õ&à4´»8që®7ôf`jçE÷N{Ò«Sýazs§pÕ>ëäù¥õóy|eKD(pÏÎ÷×b»U(¾â±
À?dùÌ mÚp8Qþï?§Úû¡;£hrf¬jû>ÒùÄ/iMî/±(ä`W÷¤UÇ:W¯á´E×¥]½Kêé
ûÑò±óÒq®
eÊjeZ 2
ÇáM9hUE © CE 3QÑQ´çþ Kñµ¡m÷^NYº^)ÍâÁ:À¶Ð ùIEGQ
J(ÈT;¦F0¦ü)ÑóÇeòcÁ ûü¨a~`ÈÑðóí_ͯô²>;Bt¢ì1Ì|yñ×¥T ¼" ݫߺl[ ¿ èqÑQQhÓ¯¦q§nµq#æµ:rRÝ3ܲVp!Yû|:G
¢¬çzÓi×ãÓ×D+þ§ZÚè°xùªRÇ0ZkÃÀXå·Ûg±{$¾C³HDi0G¸C÷ìs[M*ñ çýõ/@jeÎÀQ¤ÁþPôpb&=Z hW øzÈÑé4ø9² X¼ÝÓ !Çl\J»í>Ï«BcàäÂÚ É^ó-
m
6c #N»º-28a:kV×{ÁxáW]òOS8êþ=fÑ Àä¤ *gÞ|X3CÀÏ;±DIFRrÃ_&|&Z9xÏþõYÌBÓ7'Ôâí]Og>;KÙ²ÏËÞ,8Ú|ت~½æ5Òз¦LÙSØÌ·æ²²t¨ôOaIgwa1&©^ªýþ¹î¨ äôösÁCýĤèÏâÙ?ZüôÒAdê*Kôg §NîZO5{ #ÆÌ×HÞQÌdb@³ÙÔ¿±ðl £óPÆö®!EåÖ »Ò_VW¦xÎvWÒµW¯î¡y×Ó¸ûÌb½iv3¦ið'oÎe Í)E ö# 8FÆæXÊ&2'ó ¾C µ(¦§ïÒ 5yF½¢éoÈèUÅÓ¢td&IXr~¤Fê¦I¢ò¿ýÅ6hù¼¢77ùl)v')óĵ(æ%Aõ<\_1qÆÎÉkõx ´;Y¼+n ¾°b´¼ê åç,ñWÝ·J±rcOI§w;¨¹ ÜVÀXËgàr¶vþïi»V¿«ÚÎYéÕyåEĦznn¤
ÇFzZ÷Lâæ1 ìïÃ+*Ý
ú &V>- ä"ºR¼L¡ïc þEv).%P]Tï¿¿ô,9 #Ƨ˼ØtH÷PBÔTC"Øõ¾¢Ô0HÐ#Óu]ù Íí^kFÞ æwÑ$ÉCÎËZ})ÞDPiÁÉ2 4Bb7É N¸°ÅÅî¶Æ²nÇßt#bCÚÖG@lBhUB E`¹Vn궮ÇcF¸7Iü"ç9Ö«V#¹õ¼ éµÉ$yG]g¢pÝd|ÄZ> ¥Ñ+¦fPMá
Bg&æ ¤)¥j±¼¢,h»<`¾¦iÃJQ)dIKõV"Ï|ÙìºGÄÐu
#²ä\[%9Ý*ák"¿Gø®S¬ôlA1äofüòå"ͼ$ìâí-ÅFÂæf¸`®C»A:=åðÓbL8ë¿DèºÝd;tëÔHKYâQ
ï»[°åä<ùu öÅv^úuÔ>fÜ&ÒXÑ"siô¶4´EcIy0Vü(ôÞ¾«@¸+VDj}8Z)ÿN^×A9M#i0Ã.¦ËíBhâ»8/½0Ãøe(·M³[øù÷J)ºïÊ{wÆOkãõ«á
±°hci´("(¨0DTTQtìÄ8¦¼·Vè¬ùÒvß6ó^¦À)¤Á|t^Ü6¦Ë,þÀî^gkò(«Ë9rI#AèÐÝûIWiQ«
àδâQ¶ka HÿîºmUGÏqë§Ç½ÈFóÛÒd Ô3Ñ
!åì¼|íòÿ9öØô¾Çü®#¤{/ºÀ8¸±Ò¸ÿIQ7»µ½ÅÔ]H Y º#âDÁö&í@¹N`Éúò£¬eù¾ûé{h^*Äò!{ò©Ñ0Úc¡)iâbcÁ2=#½âÈ7Êí© t1¹u1ìê§;è,m"л ü´§Låwkª' ÕÍJ ðqT ¢jp>¾ñçõ&ñû !»ñôÕ/<Gç9¶ôö·ñx¹¸Èel
ïIâjnêA¨gkcyP ò¼¼þé.FÜL~\s+ËVÊÛ8CzZØÒ¡m
1¡í½ðÜu¡UÌ~ÏÞÒüÉ2E-qüi"|Úa6Êìx.(éÒovï)Ák¶oT¯n(¥LÕC·> ¸/ cOÛÙÕ:32á[±/\¹8UiÁNò¼
fÌ.ãf¼UaõV<«£Ù4EßQ*õ{ò
ðF :BÏ
»âr¢|/Þ;ý»a¯ÑX\üN\þ¿(ȵ×õxb¦Y(Á$ PÖ¾D*GþÐ~³3lú©r<rëÊpþ:]ßÔÄdâð~$Ѫ~£:0º¶}`& ðâÖ¡*ÎÞt
\ñc<$x¬Á(ÞÓf/Qüµgt/xÌhÔga Ä>ë×ë÷U½a<"Pª
®
ùã»Zã¯Lû6º(Â]Y×ZÀé²å,Ke
C
lâ;&Gr\*iÐTÔèæKp² ilKÂI[Z'M÷½ùO×ZyÑ)بx|ÛY§ÕA ¨8£(©¥KH¥d5ϨuÙ¢m:åï/qèt¶¢ªV¢Ôêôv*"Éíué¹ü~u{CÁÎàÅ~ÿ»âoÖøøÒ=¯cE·Î¦-hJ*¦IùæäFák¹`Ú{3µ8£o½®ÿVîÙ ýËé/¸T êHÂJf xøîÕA *ì^ï h¾×=ÿK!{7" /Pwåè ÷³ ²H ®Aîh9òä a§ì*ñT-¾ûêG¦¤â|ßY:á»WÝòrwöTíh®¤ç,æÔQú+:³6YûÈ2Ï,!¯
e²³¥)JSÁ6×¥16ÓýÄêNÏçÒ LTË$iEÉnBh@ü'ÛÔc´o}Hþ;ÃbÞfás¥`ÄÄrµ¿&Èl६l Ë¥/C~2Ⱦ|·0%¼='ètñ1elqFã¨ómO÷1úîÏNHrÂç"!3ºá Oñ¾VÄþrÆØi %P#Ó&ãqè°bVÂÀ}AbFº¦!\Ëc8ÖblqLº£m¶áËqÃD\5r+Z8ú kÞWG."}-é)
4añÂ< kmu£Á¬Õ¥\ã
$\a¬,8IüÏì·½Nî)ÖÐÖÄ^U|9ÝC2³ë_p¾¼.Áò¥'fÚV $H)IrB2nEôLÀÆ«S¬¢¨é¯V}ê ÍÛYÝo9§îêâ3,ÕÖ:¸í\dËg&z̦° êÈö xo]+6Sh N·*÷Ùnh»+b WßyGéøZ¯O Èà¾6}'_¥·+ô,%µÇ9¢X«6ýT#ªtÓ Q¸Ue?»#ªb@Z"í&Ò>¾ém? qÜaSV
Òk<©7KúªF
©{ÅÞ ÜÂEIÂntúï×ò®ôOAä¦Ï-sE4´\ªØâB°û#äù}õL!Ô µD¹¡GÚËý/Tâ á0QÁ )õÿÒ ½=&wJf{ª
C
NUU|nzñOR
ÖvÀéµ=ÖUÐ
iK>² 8Ã_ j ZUÙÞ³(ße¶{©¿Z ¦
2ÅÔÕÉÅM¸¢;_JfnÖ°^m(9î&Òn1CÒ©Kªe©êSç¬ÞÕe3/µÐ·Yø/0\_'/$Qß 5çK:Ì
]ÌË:Û &®ô|0 &¶lU"k¶]6·z q ÝsÐRÙÒ" $+¯T ѱæ
'rþ.ÒË°é#ÐRPu+l«Ï $ËÜn¿mÈoj·µÄåg<
å0ï:L¢RóLs6fV2 9 Yp ÊJ8 îÙÀÏu/u@ãÝÌÓæ=G\M.W! fŸMË-PnT¢v·, qñd ðZ2J±U§5 þ[ÖhjS ae §
;LɨÎÞØ0ËÄ2Õ¬aÖaË~¸q7Ë ¡ÕL×u3µ}
stγEíV^v-nw9¯L yùa¹¹ê¸vg»|q÷ÿ¯óé8¼N|'g|Âr×9ÕµÅöâ³Ïõ\. ¸ÏÂ>E-Xý¼0²'êF®Òä[ZòóQÔ½w½×bâæßB~-ë;í ñäíbþÐÄU¤üs3Ñvîu·mÍåW©¨IZÃ)VØ7²öMkÓ໤\/ÃêÙñ4SáCæU÷=eÀb÷Sÿ}Ïá= l@ÁïÝ á/Ë 7GDúC×x$÷Ù@òñ>WÎûØÍmíÅé£)`âOÂuHòÍôÙÅËÍU"ûŤ<*¶5m`å+'ÞZ/Hö(aKìPð¹²&ºC@ IôxÛaÔðéJ¤B6ºC/.Íj (B¢½LQÂ]È(§Ðil +ðÃc¡VV: $c ,ÔêÍDÚ,!¶lq{@DÒngT ¨4-eB@- ¦8UxÈ.L±(k¿×D01n(¼bÁÔð"fw¨¨gcJá4í"qA×hÚ×µa@ÉZ H%)îr(`¬¥|.ûáCª}¡ÝÒ
¾{yËä´kù¨ÚDÝ·èâ*D2ÁM©QåÐÊ:o5£#nN\¥(§yü{úíë¿Î^H÷J£{½± £¬%;SÚöÅ&XçÔËAKyë{"ºxÙ½JæJŵ=BªÙKXÂCÑMÑ*Á`Näm`T-}]l²(pés1`±ì
Y
¥ .(+x0åpÓ±,V^ÆèìÈý£u)¾õ½®«afD@[-xºjïpÔ Q° Z¤¢Î µ
!Bß
-¡·Á(ÀB*ZE° $
-
ÌrÅ6Æ50íT*af$ãIR©É¦ªÅC5ÅÙÞ!sR½lëö¯Ùâ×$̦,ÀíLØ4>,Ø
jk<À±Zv ßÓöþ¯ªÀ|ð½#Æwߧvç¿Àï«ôßÃÜév´´L½ ÖWPCSþâ4y¢tK·Àt¸S{ö½ аy=zLäé£N© à«¡y£JJ:VCȳÛx¸bB³ÒóV3rneQL$
¶¦ (ÇÚ÷« ² aÁÀºPXÊT=
M (Ú]ù(/s»ZKr¢Uã÷±èÓ_~(%abä2)Æ®ð1Vtì
p7*¤¬êEÛdboB¯gSÈ£}ãů&ÈAÚ
dÜ Ld9±&EÒµ6
á2$m/ÄsÖoE í¡CºL. ãIÐì z¶±Ð¨>4]]GBKPõ! åy*år BvWkܼÅ!RÖ
ðѦ6`C@oD©6efÃ4ÄBì K¹¨ë'¨jøEÊ\Q
ã HpHh
VvJ¯|׬±`ðÿé+kÖV¶E`¸xzz<* )¡"xQbzÅ1AåÓð'OÀ Ê|J¿#çkÔÐx+àz8
.|ó3ÔÀK{YÝÈÅKTïzÝLÞÂ}ç{#YjﶻPnB «ÏWâ 9;éY< ¯O6þ Ï{µ/ kE6`Û5 ¥ÕXÅ Ãb¯ = Q g9[h¸$\AhC _ b&C"þäB(Øè:¶ ÌIoCQ4dHHîV©H µÂê¯[|M³*îÙ"8j¥òÕÒ6vɲo `ÕMý¥ g Í_C-spμ¹CùI¼º@ÆÁEhXh,ù¢£ XýH¨¾U- FK"ØÃVÊPT e (Õ©Ö\ê*Ö>Ò¤~ áHßÇ_Jp9SA@½J0$÷ÖX¯°qQÏ]v»®Zª[+.Âg!/,'+ÞÓÝñRiYã »Sµ¤.FØâ!¬3ÆM»gÙ!Zî\]Í7ößn½zéíRÀUjmwµ^?~?
Ä]q/f´Þfb"Í
ðxC°¤¶ö©mG
E»¦#Dëé+59, =qUA@·ë õÿÆý¾ TóLÞ¦n¡d¯ÎA
ýÃõ¦°7MÂC7é`"Æ ë1 1¢QÅù.1á{Z9y`ñÖHHm`Æ]Í.9_éñâwI^ËÓÉ&vpr(Ú¡cîë¤þY2ÂsR#êÇ^½ã©ó>?cI0ªå¡ÂZ0©£¢÷ ù¯ÚÑ[t6tî>þ«ÇO³«XÀÁ
F²6iJ!Ñ,$P¤]<¸¨÷§· =BâI´Ð:2BÄ-VÝ &x>ù«F6XÙÖ>í§xàѺõÊÌ¡Cª< ¶¦þ©pë±F° ðAû,2L¿ +
Ú Â<næñYyÍ(TYi§ e:(Ú/q
¹Á'÷òfÉ Åb bñÓ7ÝÔÀQ-h¥h1¾ôQ1ÆOç[ëC]ýøf¸L3Bõ´óezLõåÔ; Ø)Σt[%@¤QuÌ÷
´Ò Òh~îi¥ÅÈ©|
Ë* çBEL2 (QTQQ
}» M<².S-íJ½zo »IRT,`±´½)U¢Í&kaX~ ~@o' ǤV+caßãhàó¬þ(Õó1Àüp©¾ªÔ*%¡V1Ú'ݳ#CÌCT²S"BYÄ2¯Îy».&h ûô@ÂTJØÇw°a`F$aí´s^®,ÃFè`¸DAi»§qA]ǦJ¬ LqÏB/²Fu&`óL/¡/¤Ãv/è¬ã1b¿ EU8É@^r®Z¹#*Ô£Î0¦©¯ýCK³ÙØ( :ôÈlC«Wa\ $Aø0ß8Ï 6÷4pO¶+N Å ý] Ùéaú¶ g±ßqV)ø¯^ÔÑêºpÒ pÍ%Ö
ܲ~6þ;ÏØuó5ÌîÙ»'dü³!_$©@X()¤(KÇ9á¹G³IÕªM ³AÀ¶WeÅ3qîÖÐ×Ü«ÿÃÐw×DèvñsJËÓµÒç Ý×;ò~7¿uØâàúC!û§¹
vR½S2¡Êd¾<x³
!ß
m Xs½WF1B` ¢ + X g¾
ßWÔæYcQuW ÛkÄ·í,êüG±ÜÞ]¢'?GvÇt¬P©F-E(ÅE©hÕT+»çmJNPÝõ&HáêImk. 'nSï«)ì£Ô\ÛlÇ#Ût d4aÒµ\Ñì¥ úô,2¶ð8 mq*Í<À¸ ,(39ÙUI 1Õ"ßÍE6Í$eU±L±qêPÜÕhâ̺<HÚH)4!*¢ÛHÐTÜ\ªFy¥¨ñFc¥çq³:{ò³4ìEp#|÷çÚÏk+W6
îü!ù:G¾ ùÄeÍÍJöióÈG»6J^vs³YlLyDËÇÕUóþ @ìzÓ¸>4 e/¼ña ÛQ[Yæ;mæKîO±Ëg#GOoìO¶èl=:1oKÝXã¸bOyÁËö
¨Ó~ÑÂ÷¬ÜïÅØ`Ø¢'Oð¯ÞcóL;Î%=V À$P)´6¬ÓIíÏÓ?5b$±¦ÙÙ0óüÏ á×botzâcbïJÂ9ä# qé20¥åñ"I>B^ÒÂoDÃ5$ p>ðý%F©W¢Í§q_ã³tQZÃ0;½ û¼°`Ç÷³aë9ë ºIJSÀH#"ÁI01_]¢ÏÎ7@$ÀؾػF&Ç$H+#ÂMÌê2h°Oáe÷½~3)1{³~Ù· i
ÊuG|ÖUd*ýb¹·Ö¼UA3^=ñ¡Î3vÄ2"ÎB! øÛs;<- .¨rû'$AÌÂtPæ CÐÌÚÛª]ܨ¿.ʨÇrl±Õ§¹§e¯Ié¬ÏÎÍ@°-¿ºá£R)+ì/Û <$©~M,X&)ÅG^^îÍÅÆZ×ß×e GäµËò`ùW@¸^ãDÁã³kø$cEÐÉÉ-f ××·Ó=ôÐX3P2µîÆWZPóMê|l${]Ûà _=*XD^ Ô â?"P8 0@4Iì G®ÿ@wÂÍ=§*x¯jÞ#¦¤òúLâ EÄ<ówÒmû£«M
¢âkUX9ÆXj¦Ø1¹ U8âì¦÷´Ò6Z-m»²h±Twj )lPXªp£¦q
aáEDeoªI¦YÀ©XɺmÞço_WÔ kEäîë©'RÑgÛϤC¤Bý÷ZÈóþ\V{lÑð0Ñ.þåKxl[b½5¤ TC^^Ô¦_*´Gã=ÚLȤNs>w'mñsgº©ÍyFXÑPEÔT±ãI%yÍÓûz0ì`+ôt^d9|f{LUæá»xJeB²ApaY[Q X5v¬*Pd`ÆÇ0¶oRu{uzÓ!wý5GhÙ-å;ØØ íÿ6Hår7#<= `:EȪ/¨¶J¢n°ÙuñBÇPP F¯ÁÄÙÐÍ_S¿º¸þN'rû:][³]ã
ÒèÞ 5àdØn#D( ÿ²¸ NXÔÈò¿ `ý¸ö~¤H%(»»(+1o«x±"N;:Ò&îQéòÎÔ]Ûj¡Â¨oשøtúO]êä¼&cæ°÷4}¢ö>I£\ôÅÀj%£hë9âB~Å4y8ë§mvÔÆ¿#N¾ÓEâð0͹Î`Ã\¬ºcuã@ÙþÅÖ©#òª°dÛáÓ_GK4?£dè©Ñæiÿ{ iõ "CcÓv<
÷RÞ 4!E|*Õ¯yvaWhÈ¡V6©ÄÀÛìy Q·Î2Æò§ÏKÔ¸ì`á½Q Ùãz2û2Ýè¤B <ø$û KøGì=M7KF'/ªµ\%\;þû=ÏjÖPÕAPCµ(Tj±Gd}SQ;y Rȧ¥ê46b²ñ¾ÇÆQ-ÆwËädB³oO¨Üf#CC öÐ å:ÖrÌd£VЪÞüÃP×P¹ûoY³åþ¬´SPF%¥An\Ì¿+G¥wÍú±
Ãe[GPêeX®dÏOCDª2ï÷½?JYÓ³¯/ª¨E&ªåãÄãbÌæÕÌá
"ÖxúS~y9k·õäfs0\áè -]꤫ÊG*´FøE¡8Yýu$Ãueî²v,óçR*Ã}Ô PvqTe$ó¨óZ²Ø
:¿kY;ÊØ«yÍóäZؾõÑj
«®èÚÂFn5S¶·¤Ð×V6#Sü<é3ÛëOºï3^ª½Ë
?NÐ*;é÷´B.ж IìjdÐK#C±sª_g0¢çíëµ`¤AÐõ|JÝ¡ ¯Íñ.x<á"+ó<u& ÆG+^I~_«ÊT5ýòÖ+Úµ æ²á`.çx\1BÃ@Áº%èøÍ,×@9Ah&ï0«/¨? aµ`d
6×
¢5(kÒ\ȱrÑPbV §Gb 9åg¬ ¦&«U)ùw®$½\ÝÑ¡°Ìá'M(;Iª2£mx°20³I+ºHj â'>< :eóÌñO}S uò°ÞBH v:÷TNô©Þ_XëÔ¥â+kBn)íÕIÝ
ÏÀ
&hå
ä9
g_vir£V7T)#¢º·Z÷ä«ä÷¸ñKÖeöP4&e±Íq©QL°Õ*¼5:°ª¦jTÑTP FéÂ8(#FT[jÛêäDÆÔ¬$ÁJÆt0Dnà Óp:Ëô.KYÌ·3õ½¨§ÍÌðx;íõ°8j5 Ðzlño3ºMOf ±µ-:ÒÒQROP{=ÁOUH±aÄîFa?ò,u {AÞHOµ¿ È°bDA`õz=öÜõÍhr+JߪÀÕ"ÛAAÄ®3¤±+ rBwªÀòÌò Ô%QÁÜM&4´Ò({ çøØPË4GWE*iY¶ê«8¡² ´þ ãùcè-ÓtfË9«þÿ=ÕebòWµJ¾:2¤4ì
¯vð¢ý?ÍyÖ¡,1HÌ óZ , TÑC~ÿظýÎwâ¢ÂËTÚl7{1#!U[IèX©Ñ1x@P!
Ï]¥Gkñ¼µÒÂïLãkÃ
ZÄÕçgj4×2½:it¨Oä!ÀFHþJ*1E .r$óµRr
{ØM²AüK½¥-ÝN5P vú^i%¾+m¨¸¢óü ª£C¬ª:i³!²ß ó¾ðÑ°§N¥t'làAtÖÝ<aߣũD¯ÊX×"=qZeÖ°?[Úßý)Ê@ü½gèü>8UAJ*¶(LÀ>&±çA+¨sîuìOJuWð=ÿkd^¨ÊÞ©b±V[XªbÔü"æR²ØаÖLjý]Örwn¨¾ÆWM±a¡3,ɨWP×[¬Ãc9û«ÎBvB¶ª&
ôûbì(Sâ´Cô5ÖÔV.³táå8bëYs;bXfXdæ:Ì¢ 1Ø Rµ8;ZλñßøþTõÖÕºz¯³¤ÑâöggÀÓkWF1¢JÀ KC&v©áòãä!ÔWÜäK/tÆT¿X°~Ìó@á$PY".q2a[!A
3ãs2ÚOÉ]h ¥ C´§~º-dez&wS,Mø µÄù,ÛS
Ñý
dÒ
7Ò 0 øYKB
¦Ù(È¢
ÇmUU(趵E²¬¹A,-
we hÕ ±-+K
6hÐZ0¬klÒª|jJ
¥QHoNRÀc0dÞ©^éi×} k*bXÎm¨XÂBÒ´0"Z¢«Jr³!Ä8ò»êñ´+%8@/ðí$ôêMû
`ìBÕV Ï¢èV 5F
óËÞÕÜ-R½Ýº1\!A0ÍVÜ4TòÓjiãV]YÕqjC²VIzÏ}RôéÇLäMOZ«ÆÙA@Ûfýi%çIËmï¨! Æ0f1$hPÊܤêæµ¼«.;¿@æ7eÅËvUÉ\ÝQq6×-ËLp`\^ÅJ]ÁG$\ã »µöë\ÌÔMMXR 90é¼Ní`¡->4jNò{Ý+8N
ÊaÄx¶rÖ ÃSÔé5tñ£!¶âæn
1|kX`[Dr¬Æ^4ÈU@4âAedÅ*èÈå÷;ïÚå*ûø{9½ï;ìgaD·¨NákÒEhô03K¹
Ö±ÉÂ&jùèÖ"¶Û S2
ú(mÐ1Öò"ή¦ªnkIêk®IÉÅWß »·V¢H(¡ êáJðøÛ\K
ZÖÛÏ%Ýß|CÝÒ |òëÒ=ñvvÁöATû=´ò°e{
'ò yú£ ¹G6¿äÆ 5TíÍ'¨_dÆúסLr»r1ßÇEt¥"=lçA+)· ×Ns_¢ëõ;R±Â¡ãÃs6±;ݽopñÍ£}3¨D7åú]!¡
{. Ûô½ Ï·0U`ÝF,ʨaRJ*9ædë»$Üç³·Ò{Ûf&bQ$$HEBHÁ*²¡éñÉüPõ6ÓzÓ¡`$Õ
hf0fpmY 5bÀÙªãPR4±[°dÓeͪd ¹xïפiîdý°í! ÞAXÐ$kç+dPêêvÕì¯óädÝ=í
Ñ@Äå¥Ä"LøzÈÀþÝÜ£X94Þþ$}N½¥¹E·HÿÐå¦PM¢nµÀÔÑcRà®ç¥:'î$Æ
tbûZÌ4ZL;t÷{ÑÒvÃÅ
¢Î¶rûÌ8<õÊEÂYqö2Õ OrÅJµtì Òïñ5W÷óNɶNãú0yéÒܺCNÀ;t»aŤMÓ¼N^ÿÄE-À *ô4
8{;?˯¥cãÜQÚ +»öí$³Q+ôBÃÌûãá$nkkÉïrP#.f¿.Ò{:qãíðRÆu¸ÅÀ¬<ëé»ÈîÎk[N®.íÀÏ.Ø°ÙJ|î(véMñeLCªw0ÄæÓhpÌk>.³ÄçÛûju ¿ä}.{2íÏo}ë²÷SÞ´º ãpÑê£Ô>Ùåc 2¯#©/wÄ7\ ¹ÃiÌnÕl¸GcnõvìàOuDóc@z|m?öUvpÊ:â SDåYaùöOG÷Ð./Ó.{À0ᢳ½¬£Õ>\}ó½O¬ç;øqïQßâ²{§Ow¼öÞ~Jx1Oï¥ÒÏ0²Ï ÍüßÑx âR½GN©ö]Ó¦¢*%/® õëfå, kZ¬w¶ëÉÛZ "&A4iÜôÆEì<FÝÊͱ³CUlÊ%-bíh:tÌÄÝTLÉ2, .5d R@µALm#Ø8¡m»dÄÇ£;¾«r©V$áÀTøvR5éBî7üoJðÈ_~´ÎþoLèÒb=Þ ,èé2A »vfÊ3k£bGA¢~Nñ]<jA½Òí{Ê
°âóò£MÞEõ
Ý!kM´â'¬eK\ÑéFfkªÍò
PHL|ç&5§K=c+÷^R:KäZ-SNeô¥EÙ¹ÄéÉ»ÈyÔ²`Ä%ëÒæÒÔcJpÚ|*J»ÚVÁýÌî` ZB2(w¹&ƻʤfZî%ú Yz
=¾ÀxùYÖ¾áºR#÷os© Ðíß/ë hص۴*ñë7ÆJëý^
ðmQ
Ò6ÿ¯Jþ
§Þ¶pÙv7íñËqæn£W¿g}Ù"¼©ìèjiö3aEOK@.äÉqþý&Ôpó²ÛÉúªA4/n@Càà wj[6{éµ
¥Ûµ©Í-piïöF8/wUE¶Â
5ÉÐæmúÛûÞ<»s ó4p.b~VßY4£×P{Ï=Râ`a ã¼@Ïó?°¹eç®è3p%fôBGÛ2)f±Ã 7AQ3¤I$GtVF6¸bcaq*fd!#°?5¦@4 ¬»ÔO
"Ã\@Ðn^öXQÀwm¶ÞóæY&9ZÌïUùÔYÍdͺô&Ìgdæ·5üo¨^ »û Ip:rÝÑüöT¼YÜÐS'!(¯d´JZóæyÃ0 ·íÂ.ö!Kn àÊF!D>óPó¡O4(íÛ½ÃIêpÔ)ñð©óözã뤳êK Xá¢2tuóá(xrïâ°èÎZ¬üäØÄLs¬K.3,¸æl ¡ÕãË#"
½ãHØL83']uÕVPS&!gXÑçzys
*ZÚ"ÉæÖ!òPîb0" AIÒÃL(?»»¦»FµÆ©í@ù g3% ÏäBè*o.rpI >yá ý½
8
« ª"=Z6=£>Å='yyµVîÎÕ®
{ÝpÑFFϽ´Òw)n(-/ôP®M¿GIõd *0W8 ÛnÙÜÄ8Ò¨k]æ1E{~s-)BÝ3ò°%,µÄW?/¡£Çy \3&6 &*ÍöGÛ_,:«íÉ;û&qÇÆK«¬)¤ã&¶n n¿ufN8y8 -G9÷ù_ hT-ÀÂIYF $*«R&£¿} g7 ÌFÀ?Pô¸Å¢±©)ß7 T4 íxäÐá¤Ë'«Ë庼î«(2]ØlW`Ò
)i1±¤BËDîd$;ÕHpìeÈE ËÒE>© ¨( =Zl`âCfõCFâÄ5´Ü3 )ÄN¬t¨ é!äàÈc A;X:¡ëxÐ` ¬ |)«a×ÂIO«!(©úYì#Ã}¬¡´õg Îñw;º5 Ë+õô*`°ËT¶Ò¢MÂUZX²Æ´IZhf¡ª)
¬AÎÙ 2¶ÔGHa)Ä<}GííAC< q¹¸W4I ±°Ì[Z 3ërzjö2íÑaÓM4áJÚßJ`qj íÎ&ÚúNÍ\
s''4èèáÕ!ÑC[2²Ê8¤aÏ=S~ ÃÝUï+'$U¥:a
ªÜBµÙàZ¨Ó[äÐCsNì ,fIÀ9,
Q×
¡Ä(ãÓOë'*+b#æ CKßÝé©éìC£¤çϱ ¢¿ÉaC Öæ`' 0Ðf4Ò'L+Æ
ëi¹ºðѳMâ!¦|;ç9ÂSdA~W)E+B2fx:07â`0 ·óÀ¡Ù;$-9e^T·Âº|3W®½)ÃäËܱm«Íî2«¿hóÍ{Lò8ÑJPèã3ºÎÈäx´d@ÄNüâàöÊø+.(Î!L»ÿKðÇÖ®&<äÎ3Pî/Ù
íÜÏÎãNë¾#IéP¿Ý*Ô ¬st5ÿÔl/Qõf¡BàþÆU{;åÑwGpËxLBXÚ0ìÜüH¸y»={yrì-ºÅP4oZ°*",ýΰÎå2 ¡å7ÅÜè`q³cJé ËßeKB½>ïL´À%>>öly.ÊR2*¬PÐtVaùp(´u1ô?'
iBÎBAúthÐ.ëcùª¾â
^ï [ui ɹná-nl½L*¥ÂPò<(_9ÐÞ
+µó::àÔZbg
~-ÌYVß÷iYÕî,KÛø ¢ âa
<SckC¿Yäu&¨¶íMH92üß;¢y°Éø7WuÊÎW7ɾJ bH#RÔÿÝ°ænè©¿eTrÑk½ú1ðî´Ì¡k{.!céËÝÑó~,o, BbçõZe`îý¢µ²ö-¦ÚÖZ½ +]g²U·7NFÚ ß~=aß'Û }ÆÎi µGÀAfØãP¦ð²û/Ö\âÒ¶à:¬¤lû·CÑ{ÚêÕ
öãè§JÚJ±
k`®oÜZð¤,!)*+
D4Ýôµÿ_iÎlíÝ!`8×/I#
Ã:Îë¥ûh'¸¼wp1@AØíÖàbd ¯%ÄÓ3& ³ëÈñOkSÕrC<@ÖS¨Ü;FØÞQE<8çÔÃl9éÓ%-Ü4(õg óµAì4
gnBHBlÛkòJÿ¥ÿÑA$É,_(ºgEíÆØéùõ º¡ó¦àôMøÆ\%ìQJÕU@²J±råÃ*[6ýç§ ®mÌíZl]µ^b! Ú 0Wv
%¦fKþÁ`¬m8Ô:>Êgð>ÕäTxpx6!%á ʪI¾½¾µ-®>Bñ;«oNæuºÐ=Ô \sÍp¡¶G;z£6V;²ASÇÒ¡mFZ?\²[w[~1^Ëã½Ô1ÌÉU¦©ß¢/ JY.¬Ò8^H¶vd¢²" ìS{$#ÁU²ÅÝË´b¬]ÛQÌn¯~çï½S}é
Á:Wf×qºÊ¼Þëù=® ò¶:ü£òt8ðÍå¥yåZ¤!$*içd¼ÃZµù}ÔÙYCëæ@´¶ÉÃsÏkNU&PáEA,
EÊéÞ°§ÇLcÆm-I(Ø$ÈamkLv·X\ð'!ª><±è ýJSbëì´N.Õ#eh'wE<mÑàMºËëæ
JÛEHK44ãÛ¸@WÀp/ @f VÝe5¢s®4 (HæhoäîÉZpmá)¶½íf:Þ¢Qoh-Í´,fgmøuék+þ Öµ ¶G;;V#ÑÃóF<öÍld¡*áJWÝ©R/vVeóû -,0ÍL5û ¡ÕÂzæu@CÊ@º¥ZÍe~X-Ã
ÙT^ü4¡Ë¼¥w×Æ# \ Ò¥áeCè©#Â8Êl¶ "vÜ¿&tËJO¡l £2.*é´·Q7ÍZ¼#ÈÚtËfÔ©b
jgÓ0õ% wg_Ñ]1¯<µUÍ}ÎáH
«OjªúÂÈjÔ·_sïµÒYx$w6ÑY^×ùòFÕ~£µiçÂ!C6íJÅðÜývm§ç6ê´ ê¢=¯ZEÖSÙa4btëL¹0ʬß7÷`©[H±æy5 OÑwï´áê6õ{³nçË´u
Ë£ >±ö¤a«|ñütí ÕÜf¢Å=OÜ2^q?jçÏ·§ÆöB'®*ÄöÅÀPµñÍö\ HÀ Q
+Mä«i
8áÑQûÜ A·?ÁÌBî¡#Xú
8DÝU»rC1 éìKþU/úbì~#]fÒbû7æ õ^¬Eò'Qz¢2ÜFSJ/³Ê?£ªÿaàU`æ;T¦aý_áµõTA ^VsJ°+
·æÑrѳ Zu7ð²!ÕÄ_-ô´À¼F ìíµm öAM·J@¤
7F?À¼Pý!}Ê dßCxh$&¥Ê>-5~±QÄÒzS Ä}bo}|¤ÔüwÙ¦õsë¬o'yY½ºM¦KL¯]Èu²Hkþç© y±H£¨LÙ YëÂ"N îÌð <Ûtä¯ð'µDe ÁÐo~Mfø7Új椯<5:Ô#LÎfÅÆØKclþêÌ.ª=ǽM}ý~êÏàS´ÙZ3# 1 £n BjV%ª¤l£fPv2 MÇ©BÖ9M+V
Ï< dlc
Xe) ¢Y]Ð
` Sÿ£V-©}S ¹M9sSµïÅ @ØX@Å^hu¾Wór÷k¿Aóòe½§ë~Báy ³Øýwém=74^;5:À½:ØT ×ôQß8nFB!¯¹`·w
9½~´Þÿ3A,å0Y) À&îû `%#Z-lÏÙá`ÎIEA°S_»òUl#H .mÝ©j¨¤Ir`)-¨"ÐB$`$¹57¶»5ùH±aµÒÑ!&0ÿ2HÛÞD¢Þ,Û8£ÓïÍQDAäÎ{f|- ;ûrÔ« É©¦ïK;·èqsA\næ4.sRS+ÞNõú/ß5ÌkѬoF ÄõLUÙEi¡Oܤ¼à´P[ ðèÏ1Ù q>V/^@÷.d:¸çÝåéR±¼Ú¡±(ôfÓ¨Ö³ÂÐrØêR ¦HK© qéq<!E2ȨqÊÒ_èYîaýqÒOw
΢ٺ8!
wª4Ûp¦l
)PFØúª i6§f{=Ð4R
¡Ïxv¥F¡#´ yk4Í0EfS^¦Øí¬ðó3UWÖ Ç»½»<4í(ÐÙÒ/¯¿»¥ºÝyiÈw|¼KØØ[ÃBº±F
©©KJ¤D¾87rh^Äd0ÁHNFCÈBgÀ;ëy %þø÷#4 `ç¨
Ü¥=Û!âÇMd~bÊÉu*ýaæy¬E³E¯ Ç#k
/0Ù@»EÞWùR !vê**.0mË
¢ÚÖ Ýì GPªxTÆc ìô¢»~÷ ©âQaa#KÐÄ8Ã[¡¤ÈÒöL`°Å¶
ÓJ2wì(æÌÀÍ JH"RÙ*,=²£°Qâ½mˬKTïg<Þè)ÀpÝuÞªzdßtLÙÑÉÞ° ¥mE
®jój¯Ãj| S¹+
²
©l %]÷(°&¡â³2Ub´PôѱãýIìäº{ÒP¬î!Ñêø$¾åàu9õæò
PØQX;|_ìÉjLPyöí7Äøx·R`ghTZÑ£yzaX ¸bêÏ;wë
²au àk4$~ÄhòUg)ÏQaÉ"Rà<Ãd ç&ØIÂúë6C3K¶±tþkGyíþηí 3ºÊ1#Tn³@=l¼Ó º-1ý$ã>b M0mTÞÜùxu÷¡#ØpIUêêþ.ªi oÜ|Àh¢±=)öÒÕSV äÿ>kÀ0D¨(È¢"d3¯«Fflâ-1ºÌäêMNÆë)}3eÇÅ÷> jM+t+ø©§CM=Ð÷öBªm xÌmñ®ö£E~Ç<6Ú?
ë±³ÿä#£[·îûýF xf¤¿uR!Dè$¢@]iÆelÜH¤±ëÁwѤ,^á&kI¢Éa÷ÒáýBÅØX½ÅÑÕÍx5_+-¹cÖL ¬NÆ ©KÌÚ ..¯ÅLqZÌöhη½×ûZ}4ìC«öG¯Ü<_CGà· £ÉQÛ<]{'[_ÀÐc»!7ôïµ6£sÂálïÜ"Ò¾Õ:øRÅÈ_$öÚ!È=Àwðn´¢OXR{ Ån-}Þ,æÊLëÐÿCøó¾Ú}
ÇõJ³"8(úÄÒµ¥
ÝV|ÿqÜ]VÃÉp3(Ì¢añÉÁ|aoØU< ÙÅ >¢ê~ûúÎìXÍt7XUp£Èep Ã
æ#3¥ÁV"zZjÚ"ónqð¥D ¼§çïÑzı;a<çrN6aS352ÚX+Ã(Æ¥ xÚT±àèè ôÂý²ã0fc|½ÙK¢Ñ³Q`^÷ ¯Ç[£É}¦¥gox
ì
Æ2ÓNçi«$ó-Qµ×ø¾Þý§Ø(JÇÆ|<OQ¨¥ ´ã^¹&Ð ³øÇî8Ê"ô=q¦»D6 w¸òÕêÊÛH8¡Y£å9ô)õ_y:õîyÈÒ%ðþ{$Т¢*&±Â±z3ô *Î>§ÕÏCÐþÁééé,eºûä¯<édýRJD`ĺÿ6õoS¨¥©ÆkNâðrdÄn;;ýÝ\ãç kòbõ.=."r2Äjì@Á¥ÁF çé<)°å Ïî4y~Jq:¥ë<}ìÑoFPH:e5>B¼3Æ»X¢Y»eÓo´fú]yFzLRä¼1Ïl ¡±2
K""øYÔéÈ 3©kÚ²!çÜéxV&Ìàå\ÛÇÖ)ëö·@61)²4²2'oeQ´Øh~Þ¹@/0¨:Ýé\a ÄEZ)C"ª©DÑ3TÕÍUT vîªß4\É pBCVTdV¤X,ænA( nC ¢ EBÄ¢XÃLQ`Û3B]L[K¯'SàFC«îl ¿aé¾÷ÿ
»e|éI¼éÁ0OÅ ÑÜÈ_Ô}XkpóºJU¯?Õ徤üX'ý ¦D}¾òïÓ)hÜáÅtZC ï"}}Òè×{óv?¯&'^!>úxfôüû ùàL& Iõµüùb?bÉÂiM¡Uî|G4Tßò°j÷6~¥HÈ$
8w ÅS´0Ãf#~Æ]ÈÆ×sºñ9³ÊÝmäÁ.ï9}µµµ;R%åö ÁÆ d ÷»¯»ü&bP áüh¢!¥,<ÊÍhº "ÔØÊ<WiSµÆ®ÐË¢7zíÅVñî 5ðK¸mX0þúÙüE¨äbÇí}É9iHȤ7n¾û<þuºóÀ© ¤"P,,I*
`-AAFÑH¯çõ¿B8Éá$Í7ûJÔ¹ÞCêËôí4úÚî"Êïk¶`ÿ'Fd<ÐDË@Qi!±$6.eq?jû÷ðk.i¸ÌÖ³O¥Ù¿ 2<-£ ¦j ¼jÚc~;_ñ©.ïG IN4Y x§ÑûÝ%,8¯¶¡Iñ}|üû l±âÄ ÏØe`¬~_Õ¿Ò}YOíÔE ï([pn·}¹@ù\À!ª÷ ,&ªâþÐE
ª¯ ªP3utC¡ÅÈUAet@1pî;¢h»åó Âqy«½5ÝƳa/´Xý/ÀÐCºÆíû¹¯µf9!ýñq¢¯-È`Áy¾÷¤
8×ØÙú ÐÞN¯ªàz i`1O¹¦M¯pi¾7wv¤©9Ǫà|M
¾ãmýÎÙ_m(¬!$},UBgd0Ë.«|_«ø5å_QÉ£ôÉ&»:ïæÝ6eYñâXB$UG£dvöæs9\××3½C¶êÇduij.ò?¢`Ç9°ª6+ 6ÙðÁÔ¥WÙË=¦Vhr'ÕEÕÓl:êÏ UM2®úG÷¾^½oÀÇ ®sâÉÚô~½=7Li Ã=ù³
SLï{DßûNYlwlÛ^I[k kþcµ tÎÉ8HNº&®÷ednYóô"Ï»·°WÄa³RZõ B è(«3.Ì\«h(¬ÚÒ0 k£É¶îÖ¿nËc{Õnlã½Bgêai6Aj¶ïÛÃrµÖM©ù© Á¥þÃÒj ªSàëܾ4PÎõfûc)ÙÅë SKDOû¶ÓþÖôÿiÇózSá>ø߯ݸ@ÝcÓñb5cÅQ½¼³ s× WÌAJl1@(ÂjOMßøºî/Õì+¯Fh¼ð*¡X
#P:h4 ¼s(B Ì
À!bTFZhaii)d(ÊrÅÕDÇKJD¥<©YhH ) TN(,¢« Z1F(Å-§Á É' È@2 P$Â!$",S p*DH( °D$ ¨c$F2
± D vÞh¾qÇÓÜ1îm©ïÄ@:ðÀ 4(:5URªá(¡B *ð-5»ªÔE:ÜeË!i r j2 "h D ®+¼{YXTv.²bÞ`º"æjå,ÄЪV;(°¢E&¡D*A5aMfCBR®y¤$ÄÞH\Xè <*bg)r^» `°º#E!
`s ÀEæjç¦{Ô4ÌR*
ÁX2IRDF-¡$ÕY$Æ4Øì ( ëìÍC}°q¤ ØôDÁ°AKRØú0X¢Á(ÃP%Ô ®ÝºIrl¡°PE`d¢"Áh©ED!dVɱe,( ÊàøYíDPðI$Fº 8pNÌß` 4:n 7Ø>
©:¥®õï±éàØ«ÓÃUÞÉ"<_. øÔ¦;åñ=~Å÷=oµjo#grßH±
ob·¬ºtãL ü¼ìûíG5®þ6µ×|ôC¿Î7ÖÖ®á«/ ïlZëø:¯²©¥´÷î¼c}8u\jEjmþù íÔz÷§&»W®ßÿ}ÖßF]q'yl ÖóÔÚ7´uTNGmY§îï5üVòûü\Ï?!¤r ¡ôÃ|{òvËNÖ !ð 6Æø¶8qb©DÖ´EXt®Ç/7ó²éCK®5å(6ÄVÒUc æBIF0 $keÏÙ]} êì-[da$ÁÙ>Nã4ó}£jNj|
¨fDÐ4aB "û;£fð`£? 53Ó " CB§ Ñàh¤1®£ÝU«8Óú-5<õæøM§Ñ¼¹É wNQ¦öo%Ó³MVøÚú
Ö7N.Ãh
Ø{«»»µg·=b¾¼Q¥Ó¡*ÈO©B<ql©àáPKÎ|Õ#ëyû}?Bw@ ¯×@
ï¬{eìRÕje»'V©^]ÞÊ)¬, $"¬TrÊñK
V.â-¼ùÌ IËRKÖeHRH(´ì6AxJ
:\Ij =ßQ SùÛ|pjþàÖãpäXÑC`ÚkÜÆ®´B( D÷÷Z0¬AR×å ]i½fÆ*¨M iù·Ak ª°nçt ]Û½w·_¢sÅÍ1J<(sêéjBQ ;iÿkp:iñ~ ý>J9ìwáGn_º·tݼ¼}÷ìB¡ ÛÐè¾ÅÜkÀÉUC Xe ¸ Z%?GAQË5=)wkcÑf·Ì}¨kZÍ
Ó¦´ÂÇ|é¼ÌS{:t×/N9¶»2kH FÉeA&"hìMd§EATLñ³Ê ùEÓë
L²Ä¥Y@ÝmÒFª bÎ 6QÆs>;+Dý'W¥7TDä.øÆ©Wâèbì zùÏ{óR¢Ø¦Ä3º
8aA¥¢=Ò¯DFßAÖVLµãZ\&©jÍvÍtEpÝke¾×«R{ÖôTµI˺ z Í¡¹{ÞO7G úVB©· :húé;ÌTñÒ6 ªw 8äÆò©{ÞÛÈãßLa^RBº ³* 8Óh³"ëoîÑ'½1Æ0Å
J#§UêÍå²`6ÝM [¶ÆAu¸ÛÁÅÃÒ`)ºÓ-VZó¯ )È·'pd ±±
Õ]ãPlµfÐ`F§¢Ì`îxUÊð(ô
>¤hH]ºQ r¦¡Ye-e£Ã:ä©5÷z6å Ji |-MÐ10XzªEþ¢Ãì£$O]ÍTÌW siñ.þNyofVÖIbÊ0EÆ{Ù`¡
VHÁ<{óZÏGî{ß^_hmçÃ<¹Ò,Íé<ü¹{`²§«tµW>¢Ô¤&¦m0QaF4£"fRmJ£Hpæ³:8ïßmö¦ ZÊú´&yÞ¬ÕQÎÕ-¦_
h°0HL"%ÙrlY× ï~eÌ>ÐùT©FÅ{3Ðç]S° Q¹ç|1V(RJ®aRTæ2ï Ý©]¶mð%
¡E±³sÉ¢Æ2>=®kWr·Gy=²uò:ÿ·^D×^£w¤Ì<N²Øø8¤yæã5ÜÍ´tÓÂé4é롼DʪML¥ ,ÛUË&J¢KRB2Tòì#6ðm¾8Òe£àÓËcÐwõYipQ:TA½;§S\-ëH<ð» Z¡zéªÃïC&/²=ñ *ª ìéØ íÖâ 7Ôþ.ÙQÚþª±ëPù,Hõ_²jõµDìÆoϤ@1CHß]¬4ø~®E3C@4-¤b Ô m
½s¶i@ûì 4Ï ræ9o¡Çǵæð1ÓÖ
DQ s=´G"/«Ôܽ6¡ ¨%yÂ'g»2Ú§4Q*̧»I4²D´J<òÊkTìôCdE®SógWh¤X»Þßéy¹Ç%ÑJe
ý_>Â-k\½P$P!;Ñ¢ï,-Äh6»] ¼¶XË
ßh¬e¦Ì«ÏB
É)£ «O8T!YTÕËÔ° V©F.BØÊ,wÒ\¬ºT°7 .öóVîç¨ÇQ·Ö¤¡§¨çÐ , «ªY^¿ã~8üõzÈNy^qææ£Á¢Gê8[ÚW,Ì éUHÚ¹uk´ô^¶3ØR37MgfGB`~Bõ7n'á
)îÞ±)·Um +4éñ ®JB íÚùîõújW0Îô) ¹vµ¢m4eÃ
ÔuTI6D
3HR«Ë"¨&"FD©HÁæ«Uè|D/clU3T<1 Ð7H®JÊïÐfûï4h¦Ó¡ÌfP¾")Ò¸" 8Ï«ÞU(1²WÕ9¾p-°1.Bô¶!8¦~Ïê %x± zéZ¢(LDWÀMÀè¡T7UëÅu.½]ñͺ
ëÄ jîÔØçou3w¦ì," ºmÑ.CÑzê<ÉFfêrÎFæúÊro ØÐ×ô@ñZi-uÝ &Ô ÕXæ»ZØ´ÐDátÆJ(¶KµÍPvA¥¹j×QP dèÌ.´
·iÏDYýøt«ÒØØȦãAh8¥öVèoE+ £.l\®ð
|axÑgëÒжQ; Cs;lû7Ŷ+ Ü ]¶êÈF« · c]TZ¸© 2@³ýßM_ÃÍ7Æ6e¬Î;£.ÞU}Á
0iDU~©Py²ãJlwÂV穵kãlämâ|ùãmΰ¾sÏ[LÖËQ[³T*:Ê,GÑCVïþ
p
bÉT Â)RAUSï ºp7ÏM[çfå üTI²onåd%Ñ:ij2)·'¶ëgY ^Zl¯Ö"ɨÆÀµfÊË2ÊÚаúJÏ|¶"¨Æge TW®¡¤2±t¬5DÕµµâÀæª2ÊF Õë.-)%[HwUvÄ5îhÔ-·jè»N>wL2Ùû CÚíèñ×·Pw1i°GdªaðØfX2UQöÂ`¶
«¨ë½_¥@¼¨ dÓXÚFÕ BT¤:«\G[Úl3÷espÂØKVaÞè u¹pFîZg}*(
»5Z ág6Z4L²g°CòáÍÒµ¼k¥¶ÕXTc+=3¢ ÐPØìâª!
¾ü\]äî$àâ.°£O5Eªº óɤ>BÔKY ÒÑ¥ &"¯ÇÞÓiƦâ÷qá@Mb8Fñw
]-Ø-syCBê¢È÷OTc×\3.Ã4 T¦«^é 4º¶u%VlÀ<kHB~êje¹¤çÏ ¯±YFµ-{¬6ѷƶH_0 VÓºwwI2OVJÙdPkk>r¼éu> ía¨ÞÍ[ü}/ ΦÏö'ç'ÍëøUñó^¢¿<D-½Qý=oêõ|½R{ Äó=²ÏyPõ·®ÆÎÄ®÷ óçä½2G
y:Õu#ªæ½C¯×ùÛûó_5²A Ô5³x¬²Ô|^ý@¸&ÿoÐÿÈ ûpr«± ^ Ôr5ÆÐDñiá$>æ»,'1c#ÁN@ç(0Éx}×л`¡D¬QdPXÊØ©°`µµd
È@P¤©d
B,b#$ H ÍÙùÌÑUþsoð1\71sÒJ¿ù=õ CXÆi¡ s'q(0ë }ó~ÃÔL1° 0éat\G7qÂÓ½-"̵JC¤!åÄã»Þ÷à'>ýD
÷ydQp-" ßDzd0Ù óq²M¢1Î;îh=5@ZÁÔ®¤Yd ¸P: !·Z¹ÌË`ÐN[ÓΡ>;à>j¢³!MIIæIó~Y"QVÏ<>c
ð·MÑK¾þ¯¥PÃxiÆQ·0ÄÛ¦«¤RïÎQÚ÷´õGZÓy|ý{`n.WêÅz³TëY¼?WìeN'ñôù9´ øEÀUCÕ¹°ó¹kT¬Û÷æ4h¶Ð^²å×"Ù°¢m8öJÚm/]ÛPïZUÄÁ9[Þ==]Usº¹Öv¨ÂÌíÍßé£P8©/YeHS*
Ìólb#hvkâBèuÝ¢é4¬5ÂíõNµ¥©ÎÕwlT(é{1Ó7¤O¨ÈÙ/Ò½7Ç0ùÙB¡Ãó èÚñpÔ¤El&ÖuW ËM¬=Uò¼D§Âó»U½'IUÛ c \~ oùû ¼ÿ;ó·o^Û)U¿|ÍØ®×ͬ6sú =ÈÔ¿Øë=½ÑìVg5\fíïjMßÚm&þùÿF¯3·ê½émG'õ³A^l4`>bôº³
³Ò°Ê;uâÔ ä¬Énú`UÙÇF½<y¥Æö"Ã|Oå<ÆÙø¥¾y§ÈEL¦ÖCÒäýðX èã÷©ªÍJ?¼? ë¥ú
ôV>ý>N5ÈÂÙ0ômFµM$ðCYÈD°È= Ò k $¿æ«ºt/àÒlÈZ®õSôI˲ÜÀ5Í!ÖOäè&È&lÆÁ+â-t®ré=·^Ë¥²0{Ê´È@;ì´½JYRJq¾î¾AÖ{Í9¬OÏ¿ {ÁØîÐ
ÍV(I|D§¥FIÀ¾:YFR% 7ÝÈP0t9T.PØÒù-â$ô6öÂ9LçX¢1;Ú¶/;ÍÆäµ5Í 4o4³n¬ôùÉÍE«ój¥'li#!Égn. eµJ*V !k.ø"E>Íþ¿K*6;ÉÀZÔìÁî嬣 -æ"ì:³ÕóÄÔÄI¹A¤UPA]$_^/ï³R1FøMHw5A,
4 " aCÅUN
HP ÜÅQÄìI4 %ÛѪ°\¥ (
¡-'m]3qµÊ
ÞáÌy¨4[pàW É¢ÄZ`ØV n*'I¤ æpÅãEB¿¬Ù" w±ÒHR
)θZ ní
æß¾{sL¦Ì£ÈïÕ§Àµ`¶äAâ<²£ZQ 3Ð`0³12`ÀJ%ia=УR
_sòÈo@ûèF`ίRAr&fDñre±<O
çÃCѲ°* nünyÀÆ ¥GvMöç:7\dC§iÆæf37VS7·F*êÙ¦ÐÒ0ël Õç$"*qF$¢¸I¨&ÊXí-Åloo¯pÛÞç¿©30è¼] ç(ï\`G_/*õÂAÆÝE ¶ÑÓíJÇW @ÏÆØÛ^
ÎÕòmLnjqÄѨ!)AE¿j®àZ°àSheKÕ#¯AÔ[lL°µZ"ê«
¥ (º´$ Ä×^·SÖÎ!êo©
N,,(2º
nXrR±ÊB$Ʊ1 è¢A ÔãÚc<o þJðÙ:+dU¬4£lín½jæá+¿±Sþ>õ×Nú ã½' ×It ¡ P¸%qxVÎí;XÆzÝZó¶f®|ÇÆÂAß B8då# úñ¼ëºðº3ë=2ëÓöË´IÊí²zÚáÔ× ì½×~LeÑâDA)]*XàºdÞÐkÜk RöÐÄÜdée«0©lSQVçÚ~KÉM%Eê î*V Öª¥~£â^ïEʸ÷Æÿùjæxè,¶¦ý&J¸Âüë À(¸ qÈÚlù®<õV9 ²R¢$7ìE¯íºÅ¨w Þ- XE*ô ±9¨è*CÅ+ä¶Õ*<{/Ç áÑ ïêQ˵ÜaÖÀ Üã\¨³z[Ê ÈBÊY3gvè &¶ÜU"îF8\°µhÇ0ïy¤
És.f$t`Is$kT® ¸çãh$³Èð!¡¦4ês«ª HkJ¥<ebnË
@ÉHûL/Eü@'s;aXm7 Gº (ÒËJ¦¥"µHïÌö2'©w²UCÇ©Û·Åã´rñzçÓ§ÅSkVøÁiÞ]/5Ýó.H[y9Ù×[®ìÐØ\áäCmëÍÞð¤U´µ~;fû$då1Ùú½aô.59gÕª¡ ML
ÍK+ÄÕ"jZã,cIfBõKwí^¶Va£>ú£ OmèÍQ&x«
Ù¬GsÉ{v
t (r
@ Mªà ÕÞÉdã ¢Édï";Í"J)J:,½$! B`4¥Lé ~ 2KÂmkfÚ¼IeÌ/yQPÈ£ ú}Nfj4D¹,Êu]¨í¤ò x"¤4ÛkJ¤]RÓT" @Â2âyèx<x[s^ ko QËjõcÝÚØ?A{Eï:|,ê½üGÐ LYsÃþ-}Ðý¥ávþ 3\ÒW±rí
ìÌÍ÷Ö¡ éäY Ý
E]ÉÉÄ$z¤çDüÇS£?SØ£DM¦f1=LðÙûØý®ÍóPõ×4 ë3.jã ÷$O=
¶áRWHÉþ¼êÒĶk a:YM¬ÇI´SÒHlu«föë VWVO¬I-¤yÐ@n²" < 'Yw㣠ô/~Ôyà V½
±wxÑÆÄYØ, l¦p ";7HÅ
2æ¾®²4r`D} ˾bîX´¢'Â(®ÉmJ»#þ§Ån.ñ GAVËDµçóÌ ìºén={åùß5µ3ê¶d³5³B>µÓ8Ó]Jâ(¸F"ÃêV
§ ky-*Á¯wlxñÎÖ¼_9
âríÞ¸ÇÀ»Ù U ÑÑê#Q7»ý¾s1kéPØ=ñlÕ¯í×{SV¤§IOuzÔè±D)Ø»æé ªÁæ
ÅnÊ'þ ´`k È¡ óOUçõ°Ç¿¦¯ú<¢|ú^=Px@=é3ä²jùùlìÁ~Ü aäz¡tsòÄ®ûW¿
R2è|º
` H0üæ)Q¼øûÛ§þ ;vÅØ~Ïüõ!«à1|Ï;ç
mí.0dc2ÀÃ7$]íã²;s¬ýæ_q{¾²o²3ÆæôþV÷¬§ø
È
¿k}×T ÂpþÇáÍ-èÒÎ×ät_Åô
ô@·òîÎ?.äoBÞ¼õ´û¦{ÿtÃii2C [ÞÃáøªW´õÝß{Üp5<ª.÷{êÅ:~Û3kTZò@L¥º-CÁúõò5÷°ãªª§ ¨Fè
-åNÖIdÁ, $Aãípû¾ÏKÍ
·µX¼ØºÝ{vH .w§BoQ I,¸.]y¶§cÂT Ý;î`ê£OX/IIÚ Xc¾3m$ÑfQgrçdÅ
5°A¤
,
*F
B
R"''yä:qö´ÛÎtÌxú¾î¾õ6p× Èçm©»'¼Éîܵ߿gâ¿qÄòrK#BÚE¤»¬îVïÝv·¯EOZ 3̯ jÔÎò?^Uø! HÍû¤Wqúv¦Øß×f¸Æ{ϳZynû¶÷ímvU5ßRGÐÖBB Ä:Só L¡QÏýÅDü¯ÿX};×#öô+ñ¹ÀIÄ~ç_{/Ym
bªjHÞlKe1çaHÛ¯úÙ< õ
*t3¨/!s¦z3yÄ N¨Äsaç~*q&Ð?ÅqiºÞaÃë¯R¿1ôù Ö¼µÈò_IÍÏ<h
ß¼ào\ux U0iðÝRÂýÛ$x0xÅ$RAB
P+*
R #
2B $U¢NÈüwal¯e+õ¶¿$Ûj)j](ü (2oãbÙ¬àe«-Z9SG½ýº
{eÌʺê+TÃL óÈصáÉííÆPóAk ${=ÛötÑCµû·k³ú²jgCí*w{î9Êðüïí7jcðÂÅÂI±]8îÇL;¬E
K´J´%©XÁ¤°¬FU,mª6ËRÑ
Ø,Ы aAEÅb¢°cÄkZYA¨Z
Aklµ[Å
¨´RÖ ,±¶Õµ´J%ª4mYRÄl²¡TB¢ UbÅH"¢(V ÄTD( (¢ETF,c"H² ¶"°QJVkckKDЬ
¶)BaEIBKRj D
TBJÖ(PÅm´¥ ÅX `T+ £eµe«(µ,´kU+,X#HzàÈ r{gEÚãÎ */ÿE )l|kÈĶԿ¹ÁÝã&¾
½úPA _ ×?0÷{nènWð
>q à÷mµõ ±OjÁQE¡lm´j4£*!hµl±¶%£¯ä~Køÿÿ_ æÎ;ì?T}ßóñOÒ{ Ù(.rañÇ ÇØu`¼®8:q!D
ÉYQB,`BTÿ#þpä~ìEsKÊys_å'Ö}¸ÿСÜ'dHüzèT|" ¤ï[Y×Ç˺S-4ìëÜRHæ,=btÛXvòÄ´¶~_Ü{£ªè, mKÿh*P¾I²ôî¾?ÖG±$ú^¯ñUV}
ÝÑçN$^* ñqF@a*@´¤XdYVVLÂC$ Ý°¥>Ç.póòÞßtbF¥9"ø!.ÿÊÔ¥¶Ä;ÎÞøÀFn[óÏÇþ§Öù¼É΢j:RUò7 :d ¯|bxÑã¼Ö¶£`Fø 2i0{PDIõÂDu}
×£J
´ö¢ÑTRÞ Ö¹¸¥´é~9_eÎ}n3
aë óÅÂÊóöÌó` ¶s{Ïo[ïÑøãË9¯'§;»7ÂÝn,}>A¥ìÝA 16Âï{±ÍWuý ³ÎuUm¯
ë:Võ»06ýÅÞ?ËàøÑǽaºì4¿øÀê#-dv}¯ÞÔ8ßüò6|ËÍ?½ïXójUý?m.Ö;3¾3ÚãÂ0-w_hë K·ÏîÑDÞ®Ãèp½oëPóöRßñi¹¯v¥Èõ5Ë"; ã~Y$iH²¬
°°+ R i*_¹àJpÑn¿}ßZ,:féW¡ðÍ£ >OúQ9xsð/õ]+Ö
P4øpì ¯Ó]½[±ÊSO[-ó_ç bÑÁ´¦Ê
-O^N÷®ØLRÅÍpà¾å÷)c<Ô"2T¬+£Â°R,PA`( £$PAP
X²((,F(E*P¶H
[E ²QTd¬` «Â#"$A%b,PX +
Áb²$¬XZPH¤±"Æ`1*S⸮ræ};ßq×d½?åJó»KAìï_ïáY¶³7ºCw]¹´õFa|ÇJ\n-òÍc.ĦC¥k"X)ªüäãú99ÿXúC P D1èïÉ'èHÌÒ(ÄùY¨°Ú:<xQ*¡DE0OècEL8
%")%dU©ñNã~ðï«Ç qYjPÉÛjNû<$mºî\Ýàá¢Øü-3îz¿²VïãÝ×Þ7û^~+
Çü8TÕ®z³BÆjµ»Ï :oæ£æS#ý>þÊOgº>wÇÙì¢ÏÃ^Z#+¹ºFC~ôͲIþFvñSí {&{Ü|Q«ã§ü oÑDùCVí o(YðÒÀPÄ@ÒPÆa&cäÈÞÉÈ~=ù!; 1êþg[áËCe c÷>ÚúØ-µhäÿÜrv:^MäU#ùüÞvìÿ2 ?7!ù¦ò-¢ëk곪°¡Ã
츤¦wêâ|áøW;?ÌÙ×øÔNË?Ñ{¾Þ¯ß¶¾ã4?ûCäf&}·LÿdÈê|ÈEôÅz¥n«ËÀ¯ ²Sb«0ú2 Äøõ
ó8"õÆ¥;M¤Íð}@½Õý/"ÊÖVìoÍ%OñFBuaa
ÿ¦Ü@+°ìV¡]îØï2E ±
U #6_þ.äp¡!ãkJ | 32,347 | 273 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/CHANGES | ------------------------------------------------------------------
This file is part of bzip2/libbzip2, a program and library for
lossless, block-sorting data compression.
bzip2/libbzip2 version 1.0.8 of 13 July 2019
Copyright (C) 1996-2019 Julian Seward <[email protected]>
Please read the WARNING, DISCLAIMER and PATENTS sections in the
README file.
This program is released under the terms of the license contained
in the file LICENSE.
------------------------------------------------------------------
0.9.0
~~~~~
First version.
0.9.0a
~~~~~~
Removed 'ranlib' from Makefile, since most modern Unix-es
don't need it, or even know about it.
0.9.0b
~~~~~~
Fixed a problem with error reporting in bzip2.c. This does not effect
the library in any way. Problem is: versions 0.9.0 and 0.9.0a (of the
program proper) compress and decompress correctly, but give misleading
error messages (internal panics) when an I/O error occurs, instead of
reporting the problem correctly. This shouldn't give any data loss
(as far as I can see), but is confusing.
Made the inline declarations disappear for non-GCC compilers.
0.9.0c
~~~~~~
Fixed some problems in the library pertaining to some boundary cases.
This makes the library behave more correctly in those situations. The
fixes apply only to features (calls and parameters) not used by
bzip2.c, so the non-fixedness of them in previous versions has no
effect on reliability of bzip2.c.
In bzlib.c:
* made zero-length BZ_FLUSH work correctly in bzCompress().
* fixed bzWrite/bzRead to ignore zero-length requests.
* fixed bzread to correctly handle read requests after EOF.
* wrong parameter order in call to bzDecompressInit in
bzBuffToBuffDecompress. Fixed.
In compress.c:
* changed setting of nGroups in sendMTFValues() so as to
do a bit better on small files. This _does_ effect
bzip2.c.
0.9.5a
~~~~~~
Major change: add a fallback sorting algorithm (blocksort.c)
to give reasonable behaviour even for very repetitive inputs.
Nuked --repetitive-best and --repetitive-fast since they are
no longer useful.
Minor changes: mostly a whole bunch of small changes/
bugfixes in the driver (bzip2.c). Changes pertaining to the
user interface are:
allow decompression of symlink'd files to stdout
decompress/test files even without .bz2 extension
give more accurate error messages for I/O errors
when compressing/decompressing to stdout, don't catch control-C
read flags from BZIP2 and BZIP environment variables
decline to break hard links to a file unless forced with -f
allow -c flag even with no filenames
preserve file ownerships as far as possible
make -s -1 give the expected block size (100k)
add a flag -q --quiet to suppress nonessential warnings
stop decoding flags after --, so files beginning in - can be handled
resolved inconsistent naming: bzcat or bz2cat ?
bzip2 --help now returns 0
Programming-level changes are:
fixed syntax error in GET_LL4 for Borland C++ 5.02
let bzBuffToBuffDecompress return BZ_DATA_ERROR{_MAGIC}
fix overshoot of mode-string end in bzopen_or_bzdopen
wrapped bzlib.h in #ifdef __cplusplus ... extern "C" { ... }
close file handles under all error conditions
added minor mods so it compiles with DJGPP out of the box
fixed Makefile so it doesn't give problems with BSD make
fix uninitialised memory reads in dlltest.c
0.9.5b
~~~~~~
Open stdin/stdout in binary mode for DJGPP.
0.9.5c
~~~~~~
Changed BZ_N_OVERSHOOT to be ... + 2 instead of ... + 1. The + 1
version could cause the sorted order to be wrong in some extremely
obscure cases. Also changed setting of quadrant in blocksort.c.
0.9.5d
~~~~~~
The only functional change is to make bzlibVersion() in the library
return the correct string. This has no effect whatsoever on the
functioning of the bzip2 program or library. Added a couple of casts
so the library compiles without warnings at level 3 in MS Visual
Studio 6.0. Included a Y2K statement in the file Y2K_INFO. All other
changes are minor documentation changes.
1.0
~~~
Several minor bugfixes and enhancements:
* Large file support. The library uses 64-bit counters to
count the volume of data passing through it. bzip2.c
is now compiled with -D_FILE_OFFSET_BITS=64 to get large
file support from the C library. -v correctly prints out
file sizes greater than 4 gigabytes. All these changes have
been made without assuming a 64-bit platform or a C compiler
which supports 64-bit ints, so, except for the C library
aspect, they are fully portable.
* Decompression robustness. The library/program should be
robust to any corruption of compressed data, detecting and
handling _all_ corruption, instead of merely relying on
the CRCs. What this means is that the program should
never crash, given corrupted data, and the library should
always return BZ_DATA_ERROR.
* Fixed an obscure race-condition bug only ever observed on
Solaris, in which, if you were very unlucky and issued
control-C at exactly the wrong time, both input and output
files would be deleted.
* Don't run out of file handles on test/decompression when
large numbers of files have invalid magic numbers.
* Avoid library namespace pollution. Prefix all exported
symbols with BZ2_.
* Minor sorting enhancements from my DCC2000 paper.
* Advance the version number to 1.0, so as to counteract the
(false-in-this-case) impression some people have that programs
with version numbers less than 1.0 are in some way, experimental,
pre-release versions.
* Create an initial Makefile-libbz2_so to build a shared library.
Yes, I know I should really use libtool et al ...
* Make the program exit with 2 instead of 0 when decompression
fails due to a bad magic number (ie, an invalid bzip2 header).
Also exit with 1 (as the manual claims :-) whenever a diagnostic
message would have been printed AND the corresponding operation
is aborted, for example
bzip2: Output file xx already exists.
When a diagnostic message is printed but the operation is not
aborted, for example
bzip2: Can't guess original name for wurble -- using wurble.out
then the exit value 0 is returned, unless some other problem is
also detected.
I think it corresponds more closely to what the manual claims now.
1.0.1
~~~~~
* Modified dlltest.c so it uses the new BZ2_ naming scheme.
* Modified makefile-msc to fix minor build probs on Win2k.
* Updated README.COMPILATION.PROBLEMS.
There are no functionality changes or bug fixes relative to version
1.0.0. This is just a documentation update + a fix for minor Win32
build problems. For almost everyone, upgrading from 1.0.0 to 1.0.1 is
utterly pointless. Don't bother.
1.0.2
~~~~~
A bug fix release, addressing various minor issues which have appeared
in the 18 or so months since 1.0.1 was released. Most of the fixes
are to do with file-handling or documentation bugs. To the best of my
knowledge, there have been no data-loss-causing bugs reported in the
compression/decompression engine of 1.0.0 or 1.0.1.
Note that this release does not improve the rather crude build system
for Unix platforms. The general plan here is to autoconfiscate/
libtoolise 1.0.2 soon after release, and release the result as 1.1.0
or perhaps 1.2.0. That, however, is still just a plan at this point.
Here are the changes in 1.0.2. Bug-reporters and/or patch-senders in
parentheses.
* Fix an infinite segfault loop in 1.0.1 when a directory is
encountered in -f (force) mode.
(Trond Eivind Glomsrod, Nicholas Nethercote, Volker Schmidt)
* Avoid double fclose() of output file on certain I/O error paths.
(Solar Designer)
* Don't fail with internal error 1007 when fed a long stream (> 48MB)
of byte 251. Also print useful message suggesting that 1007s may be
caused by bad memory.
(noticed by Juan Pedro Vallejo, fixed by me)
* Fix uninitialised variable silly bug in demo prog dlltest.c.
(Jorj Bauer)
* Remove 512-MB limitation on recovered file size for bzip2recover
on selected platforms which support 64-bit ints. At the moment
all GCC supported platforms, and Win32.
(me, Alson van der Meulen)
* Hard-code header byte values, to give correct operation on platforms
using EBCDIC as their native character set (IBM's OS/390).
(Leland Lucius)
* Copy file access times correctly.
(Marty Leisner)
* Add distclean and check targets to Makefile.
(Michael Carmack)
* Parameterise use of ar and ranlib in Makefile. Also add $(LDFLAGS).
(Rich Ireland, Bo Thorsen)
* Pass -p (create parent dirs as needed) to mkdir during make install.
(Jeremy Fusco)
* Dereference symlinks when copying file permissions in -f mode.
(Volker Schmidt)
* Majorly simplify implementation of uInt64_qrm10.
(Bo Lindbergh)
* Check the input file still exists before deleting the output one,
when aborting in cleanUpAndFail().
(Joerg Prante, Robert Linden, Matthias Krings)
Also a bunch of patches courtesy of Philippe Troin, the Debian maintainer
of bzip2:
* Wrapper scripts (with manpages): bzdiff, bzgrep, bzmore.
* Spelling changes and minor enhancements in bzip2.1.
* Avoid race condition between creating the output file and setting its
interim permissions safely, by using fopen_output_safely().
No changes to bzip2recover since there is no issue with file
permissions there.
* do not print senseless report with -v when compressing an empty
file.
* bzcat -f works on non-bzip2 files.
* do not try to escape shell meta-characters on unix (the shell takes
care of these).
* added --fast and --best aliases for -1 -9 for gzip compatibility.
1.0.3 (15 Feb 05)
~~~~~~~~~~~~~~~~~
Fixes some minor bugs since the last version, 1.0.2.
* Further robustification against corrupted compressed data.
There are currently no known bitstreams which can cause the
decompressor to crash, loop or access memory which does not
belong to it. If you are using bzip2 or the library to
decompress bitstreams from untrusted sources, an upgrade
to 1.0.3 is recommended. This fixes CAN-2005-1260.
* The documentation has been converted to XML, from which html
and pdf can be derived.
* Various minor bugs in the documentation have been fixed.
* Fixes for various compilation warnings with newer versions of
gcc, and on 64-bit platforms.
* The BZ_NO_STDIO cpp symbol was not properly observed in 1.0.2.
This has been fixed.
1.0.4 (20 Dec 06)
~~~~~~~~~~~~~~~~~
Fixes some minor bugs since the last version, 1.0.3.
* Fix file permissions race problem (CAN-2005-0953).
* Avoid possible segfault in BZ2_bzclose. From Coverity's NetBSD
scan.
* 'const'/prototype cleanups in the C code.
* Change default install location to /usr/local, and handle multiple
'make install's without error.
* Sanitise file names more carefully in bzgrep. Fixes CAN-2005-0758
to the extent that applies to bzgrep.
* Use 'mktemp' rather than 'tempfile' in bzdiff.
* Tighten up a couple of assertions in blocksort.c following automated
analysis.
* Fix minor doc/comment bugs.
1.0.5 (10 Dec 07)
~~~~~~~~~~~~~~~~~
Security fix only. Fixes CERT-FI 20469 as it applies to bzip2.
1.0.6 (6 Sept 10)
~~~~~~~~~~~~~~~~~
* Security fix for CVE-2010-0405. This was reported by Mikolaj
Izdebski.
* Make the documentation build on Ubuntu 10.04
1.0.7 (27 Jun 19)
~~~~~~~~~~~~~~~~~
* Fix undefined behavior in the macros SET_BH, CLEAR_BH, & ISSET_BH
* bzip2: Fix return value when combining --test,-t and -q.
* bzip2recover: Fix buffer overflow for large argv[0]
* bzip2recover: Fix use after free issue with outFile (CVE-2016-3189)
* Make sure nSelectors is not out of range (CVE-2019-12900)
1.0.8 (13 Jul 19)
~~~~~~~~~~~~~~~~~
* Accept as many selectors as the file format allows.
This relaxes the fix for CVE-2019-12900 from 1.0.7
so that bzip2 allows decompression of bz2 files that
use (too) many selectors again.
* Fix handling of large (> 4GB) files on Windows.
* Cleanup of bzdiff and bzgrep scripts so they don't use
any bash extensions and handle multiple archives correctly.
* There is now a bz2-files testsuite at
https://sourceware.org/git/bzip2-tests.git
| 12,256 | 357 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzip2recover.c | #include "libc/calls/calls.h"
#include "libc/errno.h"
#include "libc/fmt/fmt.h"
#include "libc/log/log.h"
#include "libc/mem/mem.h"
#include "libc/runtime/runtime.h"
#include "libc/stdio/stdio.h"
#include "libc/str/str.h"
/* clang-format off */
/*-----------------------------------------------------------*/
/*--- Block recoverer program for bzip2 ---*/
/*--- bzip2recover.c ---*/
/*-----------------------------------------------------------*/
/* ------------------------------------------------------------------
This file is part of bzip2/libbzip2, a program and library for
lossless, block-sorting data compression.
bzip2/libbzip2 version 1.0.8 of 13 July 2019
Copyright (C) 1996-2019 Julian Seward <[email protected]>
Please read the WARNING, DISCLAIMER and PATENTS sections in the
README file.
This program is released under the terms of the license contained
in the file LICENSE.
------------------------------------------------------------------ */
/* This program is a complete hack and should be rewritten properly.
It isn't very complicated. */
/* This program records bit locations in the file to be recovered.
That means that if 64-bit ints are not supported, we will not
be able to recover .bz2 files over 512MB (2^32 bits) long.
On GNU supported platforms, we take advantage of the 64-bit
int support to circumvent this problem. Ditto MSVC.
This change occurred in version 1.0.2; all prior versions have
the 512MB limitation.
*/
#ifdef __GNUC__
typedef unsigned long long int MaybeUInt64;
# define MaybeUInt64_FMT "%Lu"
#else
#ifdef _MSC_VER
typedef unsigned __int64 MaybeUInt64;
# define MaybeUInt64_FMT "%I64u"
#else
typedef unsigned int MaybeUInt64;
# define MaybeUInt64_FMT "%u"
#endif
#endif
typedef unsigned int UInt32;
typedef int Int32;
typedef unsigned char UChar;
typedef char Char;
typedef unsigned char Bool;
#define True ((Bool)1)
#define False ((Bool)0)
#define BZ_MAX_FILENAME 2000
Char inFileName[BZ_MAX_FILENAME];
Char outFileName[BZ_MAX_FILENAME];
Char progName[BZ_MAX_FILENAME];
MaybeUInt64 bytesOut = 0;
MaybeUInt64 bytesIn = 0;
/*---------------------------------------------------*/
/*--- Header bytes ---*/
/*---------------------------------------------------*/
#define BZ_HDR_B 0x42 /* 'B' */
#define BZ_HDR_Z 0x5a /* 'Z' */
#define BZ_HDR_h 0x68 /* 'h' */
#define BZ_HDR_0 0x30 /* '0' */
/*---------------------------------------------------*/
/*--- I/O errors ---*/
/*---------------------------------------------------*/
/*---------------------------------------------*/
static void readError ( void )
{
(fprintf) ( stderr,
"%s: I/O error reading `%s', possible reason follows.\n",
progName, inFileName );
perror ( progName );
(fprintf) ( stderr, "%s: warning: output file(s) may be incomplete.\n",
progName );
exit ( 1 );
}
/*---------------------------------------------*/
static void writeError ( void )
{
(fprintf) ( stderr,
"%s: I/O error reading `%s', possible reason follows.\n",
progName, inFileName );
perror ( progName );
(fprintf) ( stderr, "%s: warning: output file(s) may be incomplete.\n",
progName );
exit ( 1 );
}
/*---------------------------------------------*/
static void mallocFail ( Int32 n )
{
(fprintf) ( stderr,
"%s: malloc failed on request for %d bytes.\n",
progName, n );
(fprintf) ( stderr, "%s: warning: output file(s) may be incomplete.\n",
progName );
exit ( 1 );
}
/*---------------------------------------------*/
static void tooManyBlocks ( Int32 max_handled_blocks )
{
(fprintf) ( stderr,
"%s: `%s' appears to contain more than %d blocks\n",
progName, inFileName, max_handled_blocks );
(fprintf) ( stderr,
"%s: and cannot be handled. To fix, increase\n",
progName );
(fprintf) ( stderr,
"%s: BZ_MAX_HANDLED_BLOCKS in bzip2recover.c, and recompile.\n",
progName );
exit ( 1 );
}
/*---------------------------------------------------*/
/*--- Bit stream I/O ---*/
/*---------------------------------------------------*/
typedef
struct {
FILE* handle;
Int32 buffer;
Int32 buffLive;
Char mode;
}
BitStream;
/*---------------------------------------------*/
static BitStream* bsOpenReadStream ( FILE* stream )
{
BitStream *bs = malloc ( sizeof(BitStream) );
if (bs == NULL) mallocFail ( sizeof(BitStream) );
bs->handle = stream;
bs->buffer = 0;
bs->buffLive = 0;
bs->mode = 'r';
return bs;
}
/*---------------------------------------------*/
static BitStream* bsOpenWriteStream ( FILE* stream )
{
BitStream *bs = malloc ( sizeof(BitStream) );
if (bs == NULL) mallocFail ( sizeof(BitStream) );
bs->handle = stream;
bs->buffer = 0;
bs->buffLive = 0;
bs->mode = 'w';
return bs;
}
/*---------------------------------------------*/
static void bsPutBit ( BitStream* bs, Int32 bit )
{
if (bs->buffLive == 8) {
Int32 retVal = putc ( (UChar) bs->buffer, bs->handle );
if (retVal == EOF) writeError();
bytesOut++;
bs->buffLive = 1;
bs->buffer = bit & 0x1;
} else {
bs->buffer = ( (bs->buffer << 1) | (bit & 0x1) );
bs->buffLive++;
};
}
/*---------------------------------------------*/
/*--
Returns 0 or 1, or 2 to indicate EOF.
--*/
static Int32 bsGetBit ( BitStream* bs )
{
if (bs->buffLive > 0) {
bs->buffLive --;
return ( ((bs->buffer) >> (bs->buffLive)) & 0x1 );
} else {
Int32 retVal = getc ( bs->handle );
if ( retVal == EOF ) {
if (errno != 0) readError();
return 2;
}
bs->buffLive = 7;
bs->buffer = retVal;
return ( ((bs->buffer) >> 7) & 0x1 );
}
}
/*---------------------------------------------*/
static void bsClose ( BitStream* bs )
{
Int32 retVal;
if ( bs->mode == 'w' ) {
while ( bs->buffLive < 8 ) {
bs->buffLive++;
bs->buffer <<= 1;
};
retVal = putc ( (UChar) (bs->buffer), bs->handle );
if (retVal == EOF) writeError();
bytesOut++;
retVal = fflush ( bs->handle );
if (retVal == EOF) writeError();
}
retVal = fclose ( bs->handle );
if (retVal == EOF) {
if (bs->mode == 'w') writeError(); else readError();
}
free ( bs );
}
/*---------------------------------------------*/
static void bsPutUChar ( BitStream* bs, UChar c )
{
Int32 i;
for (i = 7; i >= 0; i--)
bsPutBit ( bs, (((UInt32) c) >> i) & 0x1 );
}
/*---------------------------------------------*/
static void bsPutUInt32 ( BitStream* bs, UInt32 c )
{
Int32 i;
for (i = 31; i >= 0; i--)
bsPutBit ( bs, (c >> i) & 0x1 );
}
/*---------------------------------------------*/
static Bool endsInBz2 ( Char* name )
{
Int32 n = strlen ( name );
if (n <= 4) return False;
return
(name[n-4] == '.' &&
name[n-3] == 'b' &&
name[n-2] == 'z' &&
name[n-1] == '2');
}
/*---------------------------------------------------*/
/*--- ---*/
/*---------------------------------------------------*/
/* This logic isn't really right when it comes to Cygwin. */
#ifdef _WIN32
# define BZ_SPLIT_SYM '\\' /* path splitter on Windows platform */
#else
# define BZ_SPLIT_SYM '/' /* path splitter on Unix platform */
#endif
#define BLOCK_HEADER_HI 0x00003141UL
#define BLOCK_HEADER_LO 0x59265359UL
#define BLOCK_ENDMARK_HI 0x00001772UL
#define BLOCK_ENDMARK_LO 0x45385090UL
/* Increase if necessary. However, a .bz2 file with > 50000 blocks
would have an uncompressed size of at least 40GB, so the chances
are low you'll need to up this.
*/
#define BZ_MAX_HANDLED_BLOCKS 50000
MaybeUInt64 bStart [BZ_MAX_HANDLED_BLOCKS];
MaybeUInt64 bEnd [BZ_MAX_HANDLED_BLOCKS];
MaybeUInt64 rbStart[BZ_MAX_HANDLED_BLOCKS];
MaybeUInt64 rbEnd [BZ_MAX_HANDLED_BLOCKS];
Int32 main ( Int32 argc, Char** argv )
{
FILE* inFile;
FILE* outFile;
BitStream* bsIn, *bsWr;
Int32 b, wrBlock, currBlock, rbCtr;
MaybeUInt64 bitsRead;
UInt32 buffHi, buffLo, blockCRC;
Char* p;
strncpy ( progName, argv[0], BZ_MAX_FILENAME-1);
progName[BZ_MAX_FILENAME-1]='\0';
inFileName[0] = outFileName[0] = 0;
(fprintf) ( stderr,
"bzip2recover 1.0.8: extracts blocks from damaged .bz2 files.\n" );
if (argc != 2) {
(fprintf) ( stderr, "%s: usage is `%s damaged_file_name'.\n",
progName, progName );
switch (sizeof(MaybeUInt64)) {
case 8:
(fprintf)(stderr,
"\trestrictions on size of recovered file: None\n");
break;
case 4:
(fprintf)(stderr,
"\trestrictions on size of recovered file: 512 MB\n");
(fprintf)(stderr,
"\tto circumvent, recompile with MaybeUInt64 as an\n"
"\tunsigned 64-bit int.\n");
break;
default:
(fprintf)(stderr,
"\tsizeof(MaybeUInt64) is not 4 or 8 -- "
"configuration error.\n");
break;
}
exit(1);
}
if (strlen(argv[1]) >= BZ_MAX_FILENAME-20) {
(fprintf) ( stderr,
"%s: supplied filename is suspiciously (>= %d chars) long. Bye!\n",
progName, (int)strlen(argv[1]) );
exit(1);
}
strcpy ( inFileName, argv[1] );
inFile = fopen ( inFileName, "rb" );
if (inFile == NULL) {
(fprintf) ( stderr, "%s: can't read `%s'\n", progName, inFileName );
exit(1);
}
bsIn = bsOpenReadStream ( inFile );
(fprintf) ( stderr, "%s: searching for block boundaries ...\n", progName );
bitsRead = 0;
buffHi = buffLo = 0;
currBlock = 0;
bStart[currBlock] = 0;
rbCtr = 0;
while (True) {
b = bsGetBit ( bsIn );
bitsRead++;
if (b == 2) {
if (bitsRead >= bStart[currBlock] &&
(bitsRead - bStart[currBlock]) >= 40) {
bEnd[currBlock] = bitsRead-1;
if (currBlock > 0)
(fprintf) ( stderr, " block %d runs from " MaybeUInt64_FMT
" to " MaybeUInt64_FMT " (incomplete)\n",
currBlock, bStart[currBlock], bEnd[currBlock] );
} else
currBlock--;
break;
}
buffHi = (buffHi << 1) | (buffLo >> 31);
buffLo = (buffLo << 1) | (b & 1);
if ( ( (buffHi & 0x0000ffff) == BLOCK_HEADER_HI
&& buffLo == BLOCK_HEADER_LO)
||
( (buffHi & 0x0000ffff) == BLOCK_ENDMARK_HI
&& buffLo == BLOCK_ENDMARK_LO)
) {
if (bitsRead > 49) {
bEnd[currBlock] = bitsRead-49;
} else {
bEnd[currBlock] = 0;
}
if (currBlock > 0 &&
(bEnd[currBlock] - bStart[currBlock]) >= 130) {
(fprintf) ( stderr, " block %d runs from " MaybeUInt64_FMT
" to " MaybeUInt64_FMT "\n",
rbCtr+1, bStart[currBlock], bEnd[currBlock] );
rbStart[rbCtr] = bStart[currBlock];
rbEnd[rbCtr] = bEnd[currBlock];
rbCtr++;
}
if (currBlock >= BZ_MAX_HANDLED_BLOCKS)
tooManyBlocks(BZ_MAX_HANDLED_BLOCKS);
currBlock++;
bStart[currBlock] = bitsRead;
}
}
bsClose ( bsIn );
/*-- identified blocks run from 1 to rbCtr inclusive. --*/
if (rbCtr < 1) {
(fprintf) ( stderr,
"%s: sorry, I couldn't find any block boundaries.\n",
progName );
exit(1);
};
(fprintf) ( stderr, "%s: splitting into blocks\n", progName );
inFile = fopen ( inFileName, "rb" );
if (inFile == NULL) {
(fprintf) ( stderr, "%s: can't open `%s'\n", progName, inFileName );
exit(1);
}
bsIn = bsOpenReadStream ( inFile );
/*-- placate gcc's dataflow analyser --*/
blockCRC = 0; bsWr = 0;
bitsRead = 0;
outFile = NULL;
wrBlock = 0;
while (True) {
b = bsGetBit(bsIn);
if (b == 2) break;
buffHi = (buffHi << 1) | (buffLo >> 31);
buffLo = (buffLo << 1) | (b & 1);
if (bitsRead == 47+rbStart[wrBlock])
blockCRC = (buffHi << 16) | (buffLo >> 16);
if (outFile != NULL && bitsRead >= rbStart[wrBlock]
&& bitsRead <= rbEnd[wrBlock]) {
bsPutBit ( bsWr, b );
}
bitsRead++;
if (bitsRead == rbEnd[wrBlock]+1) {
if (outFile != NULL) {
bsPutUChar ( bsWr, 0x17 ); bsPutUChar ( bsWr, 0x72 );
bsPutUChar ( bsWr, 0x45 ); bsPutUChar ( bsWr, 0x38 );
bsPutUChar ( bsWr, 0x50 ); bsPutUChar ( bsWr, 0x90 );
bsPutUInt32 ( bsWr, blockCRC );
bsClose ( bsWr );
outFile = NULL;
}
if (wrBlock >= rbCtr) break;
wrBlock++;
} else
if (bitsRead == rbStart[wrBlock]) {
/* Create the output file name, correctly handling leading paths.
(31.10.2001 by Sergey E. Kusikov) */
Char* split;
Int32 ofs, k;
for (k = 0; k < BZ_MAX_FILENAME; k++)
outFileName[k] = 0;
strcpy (outFileName, inFileName);
split = strrchr (outFileName, BZ_SPLIT_SYM);
if (split == NULL) {
split = outFileName;
} else {
++split;
}
/* Now split points to the start of the basename. */
ofs = split - outFileName;
(sprintf) (split, "rec%5d", wrBlock+1);
for (p = split; *p != 0; p++) if (*p == ' ') *p = '0';
strcat (outFileName, inFileName + ofs);
if ( !endsInBz2(outFileName)) strcat ( outFileName, ".bz2" );
(fprintf) ( stderr, " writing block %d to `%s' ...\n",
wrBlock+1, outFileName );
outFile = fopen ( outFileName, "wb" );
if (outFile == NULL) {
(fprintf) ( stderr, "%s: can't write `%s'\n",
progName, outFileName );
exit(1);
}
bsWr = bsOpenWriteStream ( outFile );
bsPutUChar ( bsWr, BZ_HDR_B );
bsPutUChar ( bsWr, BZ_HDR_Z );
bsPutUChar ( bsWr, BZ_HDR_h );
bsPutUChar ( bsWr, BZ_HDR_0 + 9 );
bsPutUChar ( bsWr, 0x31 ); bsPutUChar ( bsWr, 0x41 );
bsPutUChar ( bsWr, 0x59 ); bsPutUChar ( bsWr, 0x26 );
bsPutUChar ( bsWr, 0x53 ); bsPutUChar ( bsWr, 0x59 );
}
}
(fprintf) ( stderr, "%s: finished\n", progName );
return 0;
}
/*-----------------------------------------------------------*/
/*--- end bzip2recover.c ---*/
/*-----------------------------------------------------------*/
| 15,223 | 521 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/compress.c | /* clang-format off */
/*-------------------------------------------------------------*/
/*--- Compression machinery (not incl block sorting) ---*/
/*--- compress.c ---*/
/*-------------------------------------------------------------*/
/* ------------------------------------------------------------------
This file is part of bzip2/libbzip2, a program and library for
lossless, block-sorting data compression.
bzip2/libbzip2 version 1.0.8 of 13 July 2019
Copyright (C) 1996-2019 Julian Seward <[email protected]>
Please read the WARNING, DISCLAIMER and PATENTS sections in the
README file.
This program is released under the terms of the license contained
in the file LICENSE.
------------------------------------------------------------------ */
/* CHANGES
0.9.0 -- original version.
0.9.0a/b -- no changes in this file.
0.9.0c -- changed setting of nGroups in sendMTFValues()
so as to do a bit better on small files
*/
#include "third_party/bzip2/bzlib_private.inc"
/*---------------------------------------------------*/
/*--- Bit stream I/O ---*/
/*---------------------------------------------------*/
/*---------------------------------------------------*/
void BZ2_bsInitWrite ( EState* s )
{
s->bsLive = 0;
s->bsBuff = 0;
}
/*---------------------------------------------------*/
static
void bsFinishWrite ( EState* s )
{
while (s->bsLive > 0) {
s->zbits[s->numZ] = (UChar)(s->bsBuff >> 24);
s->numZ++;
s->bsBuff <<= 8;
s->bsLive -= 8;
}
}
/*---------------------------------------------------*/
#define bsNEEDW(nz) \
{ \
while (s->bsLive >= 8) { \
s->zbits[s->numZ] \
= (UChar)(s->bsBuff >> 24); \
s->numZ++; \
s->bsBuff <<= 8; \
s->bsLive -= 8; \
} \
}
/*---------------------------------------------------*/
static
__inline__
void bsW ( EState* s, Int32 n, UInt32 v )
{
bsNEEDW ( n );
s->bsBuff |= (v << (32 - s->bsLive - n));
s->bsLive += n;
}
/*---------------------------------------------------*/
static
void bsPutUInt32 ( EState* s, UInt32 u )
{
bsW ( s, 8, (u >> 24) & 0xffL );
bsW ( s, 8, (u >> 16) & 0xffL );
bsW ( s, 8, (u >> 8) & 0xffL );
bsW ( s, 8, u & 0xffL );
}
/*---------------------------------------------------*/
static
void bsPutUChar ( EState* s, UChar c )
{
bsW( s, 8, (UInt32)c );
}
/*---------------------------------------------------*/
/*--- The back end proper ---*/
/*---------------------------------------------------*/
/*---------------------------------------------------*/
static
void makeMaps_e ( EState* s )
{
Int32 i;
s->nInUse = 0;
for (i = 0; i < 256; i++)
if (s->inUse[i]) {
s->unseqToSeq[i] = s->nInUse;
s->nInUse++;
}
}
/*---------------------------------------------------*/
static
void generateMTFValues ( EState* s )
{
UChar yy[256];
Int32 i, j;
Int32 zPend;
Int32 wr;
Int32 EOB;
/*
After sorting (eg, here),
s->arr1 [ 0 .. s->nblock-1 ] holds sorted order,
and
((UChar*)s->arr2) [ 0 .. s->nblock-1 ]
holds the original block data.
The first thing to do is generate the MTF values,
and put them in
((UInt16*)s->arr1) [ 0 .. s->nblock-1 ].
Because there are strictly fewer or equal MTF values
than block values, ptr values in this area are overwritten
with MTF values only when they are no longer needed.
The final compressed bitstream is generated into the
area starting at
(UChar*) (&((UChar*)s->arr2)[s->nblock])
These storage aliases are set up in bzCompressInit(),
except for the last one, which is arranged in
compressBlock().
*/
UInt32* ptr = s->ptr;
UChar* block = s->block;
UInt16* mtfv = s->mtfv;
makeMaps_e ( s );
EOB = s->nInUse+1;
for (i = 0; i <= EOB; i++) s->mtfFreq[i] = 0;
wr = 0;
zPend = 0;
for (i = 0; i < s->nInUse; i++) yy[i] = (UChar) i;
for (i = 0; i < s->nblock; i++) {
UChar ll_i;
AssertD ( wr <= i, "generateMTFValues(1)" );
j = ptr[i]-1; if (j < 0) j += s->nblock;
ll_i = s->unseqToSeq[block[j]];
AssertD ( ll_i < s->nInUse, "generateMTFValues(2a)" );
if (yy[0] == ll_i) {
zPend++;
} else {
if (zPend > 0) {
zPend--;
while (True) {
if (zPend & 1) {
mtfv[wr] = BZ_RUNB; wr++;
s->mtfFreq[BZ_RUNB]++;
} else {
mtfv[wr] = BZ_RUNA; wr++;
s->mtfFreq[BZ_RUNA]++;
}
if (zPend < 2) break;
zPend = (zPend - 2) / 2;
};
zPend = 0;
}
{
register UChar rtmp;
register UChar* ryy_j;
register UChar rll_i;
rtmp = yy[1];
yy[1] = yy[0];
ryy_j = &(yy[1]);
rll_i = ll_i;
while ( rll_i != rtmp ) {
register UChar rtmp2;
ryy_j++;
rtmp2 = rtmp;
rtmp = *ryy_j;
*ryy_j = rtmp2;
};
yy[0] = rtmp;
j = ryy_j - &(yy[0]);
mtfv[wr] = j+1; wr++; s->mtfFreq[j+1]++;
}
}
}
if (zPend > 0) {
zPend--;
while (True) {
if (zPend & 1) {
mtfv[wr] = BZ_RUNB; wr++;
s->mtfFreq[BZ_RUNB]++;
} else {
mtfv[wr] = BZ_RUNA; wr++;
s->mtfFreq[BZ_RUNA]++;
}
if (zPend < 2) break;
zPend = (zPend - 2) / 2;
};
zPend = 0;
}
mtfv[wr] = EOB; wr++; s->mtfFreq[EOB]++;
s->nMTF = wr;
}
/*---------------------------------------------------*/
#define BZ_LESSER_ICOST 0
#define BZ_GREATER_ICOST 15
static
void sendMTFValues ( EState* s )
{
Int32 v, t, i, j, gs, ge, totc, bt, bc, iter;
Int32 nSelectors=0, alphaSize, minLen, maxLen, selCtr;
Int32 nGroups, nBytes;
/*--
UChar len [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
is a global since the decoder also needs it.
Int32 code[BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
Int32 rfreq[BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
are also globals only used in this proc.
Made global to keep stack frame size small.
--*/
UInt16 cost[BZ_N_GROUPS];
Int32 fave[BZ_N_GROUPS];
UInt16* mtfv = s->mtfv;
if (s->verbosity >= 3)
VPrintf3( " %d in block, %d after MTF & 1-2 coding, "
"%d+2 syms in use\n",
s->nblock, s->nMTF, s->nInUse );
alphaSize = s->nInUse+2;
for (t = 0; t < BZ_N_GROUPS; t++)
for (v = 0; v < alphaSize; v++)
s->len[t][v] = BZ_GREATER_ICOST;
/*--- Decide how many coding tables to use ---*/
AssertH ( s->nMTF > 0, 3001 );
if (s->nMTF < 200) nGroups = 2; else
if (s->nMTF < 600) nGroups = 3; else
if (s->nMTF < 1200) nGroups = 4; else
if (s->nMTF < 2400) nGroups = 5; else
nGroups = 6;
/*--- Generate an initial set of coding tables ---*/
{
Int32 nPart, remF, tFreq, aFreq;
nPart = nGroups;
remF = s->nMTF;
gs = 0;
while (nPart > 0) {
tFreq = remF / nPart;
ge = gs-1;
aFreq = 0;
while (aFreq < tFreq && ge < alphaSize-1) {
ge++;
aFreq += s->mtfFreq[ge];
}
if (ge > gs
&& nPart != nGroups && nPart != 1
&& ((nGroups-nPart) % 2 == 1)) {
aFreq -= s->mtfFreq[ge];
ge--;
}
if (s->verbosity >= 3)
VPrintf5( " initial group %d, [%d .. %d], "
"has %d syms (%4.1f%%)\n",
nPart, gs, ge, aFreq,
(100.0 * (float)aFreq) / (float)(s->nMTF) );
for (v = 0; v < alphaSize; v++)
if (v >= gs && v <= ge)
s->len[nPart-1][v] = BZ_LESSER_ICOST; else
s->len[nPart-1][v] = BZ_GREATER_ICOST;
nPart--;
gs = ge+1;
remF -= aFreq;
}
}
/*---
Iterate up to BZ_N_ITERS times to improve the tables.
---*/
for (iter = 0; iter < BZ_N_ITERS; iter++) {
for (t = 0; t < nGroups; t++) fave[t] = 0;
for (t = 0; t < nGroups; t++)
for (v = 0; v < alphaSize; v++)
s->rfreq[t][v] = 0;
/*---
Set up an auxiliary length table which is used to fast-track
the common case (nGroups == 6).
---*/
if (nGroups == 6) {
for (v = 0; v < alphaSize; v++) {
s->len_pack[v][0] = (s->len[1][v] << 16) | s->len[0][v];
s->len_pack[v][1] = (s->len[3][v] << 16) | s->len[2][v];
s->len_pack[v][2] = (s->len[5][v] << 16) | s->len[4][v];
}
}
nSelectors = 0;
totc = 0;
gs = 0;
while (True) {
/*--- Set group start & end marks. --*/
if (gs >= s->nMTF) break;
ge = gs + BZ_G_SIZE - 1;
if (ge >= s->nMTF) ge = s->nMTF-1;
/*--
Calculate the cost of this group as coded
by each of the coding tables.
--*/
for (t = 0; t < nGroups; t++) cost[t] = 0;
if (nGroups == 6 && 50 == ge-gs+1) {
/*--- fast track the common case ---*/
register UInt32 cost01, cost23, cost45;
register UInt16 icv;
cost01 = cost23 = cost45 = 0;
# define BZ_ITER(nn) \
icv = mtfv[gs+(nn)]; \
cost01 += s->len_pack[icv][0]; \
cost23 += s->len_pack[icv][1]; \
cost45 += s->len_pack[icv][2]; \
BZ_ITER(0); BZ_ITER(1); BZ_ITER(2); BZ_ITER(3); BZ_ITER(4);
BZ_ITER(5); BZ_ITER(6); BZ_ITER(7); BZ_ITER(8); BZ_ITER(9);
BZ_ITER(10); BZ_ITER(11); BZ_ITER(12); BZ_ITER(13); BZ_ITER(14);
BZ_ITER(15); BZ_ITER(16); BZ_ITER(17); BZ_ITER(18); BZ_ITER(19);
BZ_ITER(20); BZ_ITER(21); BZ_ITER(22); BZ_ITER(23); BZ_ITER(24);
BZ_ITER(25); BZ_ITER(26); BZ_ITER(27); BZ_ITER(28); BZ_ITER(29);
BZ_ITER(30); BZ_ITER(31); BZ_ITER(32); BZ_ITER(33); BZ_ITER(34);
BZ_ITER(35); BZ_ITER(36); BZ_ITER(37); BZ_ITER(38); BZ_ITER(39);
BZ_ITER(40); BZ_ITER(41); BZ_ITER(42); BZ_ITER(43); BZ_ITER(44);
BZ_ITER(45); BZ_ITER(46); BZ_ITER(47); BZ_ITER(48); BZ_ITER(49);
# undef BZ_ITER
cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16;
cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16;
cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
} else {
/*--- slow version which correctly handles all situations ---*/
for (i = gs; i <= ge; i++) {
UInt16 icv = mtfv[i];
for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv];
}
}
/*--
Find the coding table which is best for this group,
and record its identity in the selector table.
--*/
bc = 999999999; bt = -1;
for (t = 0; t < nGroups; t++)
if (cost[t] < bc) { bc = cost[t]; bt = t; };
totc += bc;
fave[bt]++;
s->selector[nSelectors] = bt;
nSelectors++;
/*--
Increment the symbol frequencies for the selected table.
--*/
if (nGroups == 6 && 50 == ge-gs+1) {
/*--- fast track the common case ---*/
# define BZ_ITUR(nn) s->rfreq[bt][ mtfv[gs+(nn)] ]++
BZ_ITUR(0); BZ_ITUR(1); BZ_ITUR(2); BZ_ITUR(3); BZ_ITUR(4);
BZ_ITUR(5); BZ_ITUR(6); BZ_ITUR(7); BZ_ITUR(8); BZ_ITUR(9);
BZ_ITUR(10); BZ_ITUR(11); BZ_ITUR(12); BZ_ITUR(13); BZ_ITUR(14);
BZ_ITUR(15); BZ_ITUR(16); BZ_ITUR(17); BZ_ITUR(18); BZ_ITUR(19);
BZ_ITUR(20); BZ_ITUR(21); BZ_ITUR(22); BZ_ITUR(23); BZ_ITUR(24);
BZ_ITUR(25); BZ_ITUR(26); BZ_ITUR(27); BZ_ITUR(28); BZ_ITUR(29);
BZ_ITUR(30); BZ_ITUR(31); BZ_ITUR(32); BZ_ITUR(33); BZ_ITUR(34);
BZ_ITUR(35); BZ_ITUR(36); BZ_ITUR(37); BZ_ITUR(38); BZ_ITUR(39);
BZ_ITUR(40); BZ_ITUR(41); BZ_ITUR(42); BZ_ITUR(43); BZ_ITUR(44);
BZ_ITUR(45); BZ_ITUR(46); BZ_ITUR(47); BZ_ITUR(48); BZ_ITUR(49);
# undef BZ_ITUR
} else {
/*--- slow version which correctly handles all situations ---*/
for (i = gs; i <= ge; i++)
s->rfreq[bt][ mtfv[i] ]++;
}
gs = ge+1;
}
if (s->verbosity >= 3) {
VPrintf2 ( " pass %d: size is %d, grp uses are ",
iter+1, totc/8 );
for (t = 0; t < nGroups; t++)
VPrintf1 ( "%d ", fave[t] );
VPrintf0 ( "\n" );
}
/*--
Recompute the tables based on the accumulated frequencies.
--*/
/* maxLen was changed from 20 to 17 in bzip2-1.0.3. See
comment in huffman.c for details. */
for (t = 0; t < nGroups; t++)
BZ2_hbMakeCodeLengths ( &(s->len[t][0]), &(s->rfreq[t][0]),
alphaSize, 17 /*20*/ );
}
AssertH( nGroups < 8, 3002 );
AssertH( nSelectors < 32768 &&
nSelectors <= BZ_MAX_SELECTORS,
3003 );
/*--- Compute MTF values for the selectors. ---*/
{
UChar pos[BZ_N_GROUPS], ll_i, tmp2, tmp;
for (i = 0; i < nGroups; i++) pos[i] = i;
for (i = 0; i < nSelectors; i++) {
ll_i = s->selector[i];
j = 0;
tmp = pos[j];
while ( ll_i != tmp ) {
j++;
tmp2 = tmp;
tmp = pos[j];
pos[j] = tmp2;
};
pos[0] = tmp;
s->selectorMtf[i] = j;
}
};
/*--- Assign actual codes for the tables. --*/
for (t = 0; t < nGroups; t++) {
minLen = 32;
maxLen = 0;
for (i = 0; i < alphaSize; i++) {
if (s->len[t][i] > maxLen) maxLen = s->len[t][i];
if (s->len[t][i] < minLen) minLen = s->len[t][i];
}
AssertH ( !(maxLen > 17 /*20*/ ), 3004 );
AssertH ( !(minLen < 1), 3005 );
BZ2_hbAssignCodes ( &(s->code[t][0]), &(s->len[t][0]),
minLen, maxLen, alphaSize );
}
/*--- Transmit the mapping table. ---*/
{
Bool inUse16[16];
for (i = 0; i < 16; i++) {
inUse16[i] = False;
for (j = 0; j < 16; j++)
if (s->inUse[i * 16 + j]) inUse16[i] = True;
}
nBytes = s->numZ;
for (i = 0; i < 16; i++)
if (inUse16[i]) bsW(s,1,1); else bsW(s,1,0);
for (i = 0; i < 16; i++)
if (inUse16[i])
for (j = 0; j < 16; j++) {
if (s->inUse[i * 16 + j]) bsW(s,1,1); else bsW(s,1,0);
}
if (s->verbosity >= 3)
VPrintf1( " bytes: mapping %d, ", s->numZ-nBytes );
}
/*--- Now the selectors. ---*/
nBytes = s->numZ;
bsW ( s, 3, nGroups );
bsW ( s, 15, nSelectors );
for (i = 0; i < nSelectors; i++) {
for (j = 0; j < s->selectorMtf[i]; j++) bsW(s,1,1);
bsW(s,1,0);
}
if (s->verbosity >= 3)
VPrintf1( "selectors %d, ", s->numZ-nBytes );
/*--- Now the coding tables. ---*/
nBytes = s->numZ;
for (t = 0; t < nGroups; t++) {
Int32 curr = s->len[t][0];
bsW ( s, 5, curr );
for (i = 0; i < alphaSize; i++) {
while (curr < s->len[t][i]) { bsW(s,2,2); curr++; /* 10 */ };
while (curr > s->len[t][i]) { bsW(s,2,3); curr--; /* 11 */ };
bsW ( s, 1, 0 );
}
}
if (s->verbosity >= 3)
VPrintf1 ( "code lengths %d, ", s->numZ-nBytes );
/*--- And finally, the block data proper ---*/
nBytes = s->numZ;
selCtr = 0;
gs = 0;
while (True) {
if (gs >= s->nMTF) break;
ge = gs + BZ_G_SIZE - 1;
if (ge >= s->nMTF) ge = s->nMTF-1;
AssertH ( s->selector[selCtr] < nGroups, 3006 );
if (nGroups == 6 && 50 == ge-gs+1) {
/*--- fast track the common case ---*/
UInt16 mtfv_i;
UChar* s_len_sel_selCtr
= &(s->len[s->selector[selCtr]][0]);
Int32* s_code_sel_selCtr
= &(s->code[s->selector[selCtr]][0]);
# define BZ_ITAH(nn) \
mtfv_i = mtfv[gs+(nn)]; \
bsW ( s, \
s_len_sel_selCtr[mtfv_i], \
s_code_sel_selCtr[mtfv_i] )
BZ_ITAH(0); BZ_ITAH(1); BZ_ITAH(2); BZ_ITAH(3); BZ_ITAH(4);
BZ_ITAH(5); BZ_ITAH(6); BZ_ITAH(7); BZ_ITAH(8); BZ_ITAH(9);
BZ_ITAH(10); BZ_ITAH(11); BZ_ITAH(12); BZ_ITAH(13); BZ_ITAH(14);
BZ_ITAH(15); BZ_ITAH(16); BZ_ITAH(17); BZ_ITAH(18); BZ_ITAH(19);
BZ_ITAH(20); BZ_ITAH(21); BZ_ITAH(22); BZ_ITAH(23); BZ_ITAH(24);
BZ_ITAH(25); BZ_ITAH(26); BZ_ITAH(27); BZ_ITAH(28); BZ_ITAH(29);
BZ_ITAH(30); BZ_ITAH(31); BZ_ITAH(32); BZ_ITAH(33); BZ_ITAH(34);
BZ_ITAH(35); BZ_ITAH(36); BZ_ITAH(37); BZ_ITAH(38); BZ_ITAH(39);
BZ_ITAH(40); BZ_ITAH(41); BZ_ITAH(42); BZ_ITAH(43); BZ_ITAH(44);
BZ_ITAH(45); BZ_ITAH(46); BZ_ITAH(47); BZ_ITAH(48); BZ_ITAH(49);
# undef BZ_ITAH
} else {
/*--- slow version which correctly handles all situations ---*/
for (i = gs; i <= ge; i++) {
bsW ( s,
s->len [s->selector[selCtr]] [mtfv[i]],
s->code [s->selector[selCtr]] [mtfv[i]] );
}
}
gs = ge+1;
selCtr++;
}
AssertH( selCtr == nSelectors, 3007 );
if (s->verbosity >= 3)
VPrintf1( "codes %d\n", s->numZ-nBytes );
}
/*---------------------------------------------------*/
void BZ2_compressBlock ( EState* s, Bool is_last_block )
{
if (s->nblock > 0) {
BZ_FINALISE_CRC ( s->blockCRC );
s->combinedCRC = (s->combinedCRC << 1) | (s->combinedCRC >> 31);
s->combinedCRC ^= s->blockCRC;
if (s->blockNo > 1) s->numZ = 0;
if (s->verbosity >= 2)
VPrintf4( " block %d: crc = 0x%08x, "
"combined CRC = 0x%08x, size = %d\n",
s->blockNo, s->blockCRC, s->combinedCRC, s->nblock );
BZ2_blockSort ( s );
}
s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]);
/*-- If this is the first block, create the stream header. --*/
if (s->blockNo == 1) {
BZ2_bsInitWrite ( s );
bsPutUChar ( s, BZ_HDR_B );
bsPutUChar ( s, BZ_HDR_Z );
bsPutUChar ( s, BZ_HDR_h );
bsPutUChar ( s, (UChar)(BZ_HDR_0 + s->blockSize100k) );
}
if (s->nblock > 0) {
bsPutUChar ( s, 0x31 ); bsPutUChar ( s, 0x41 );
bsPutUChar ( s, 0x59 ); bsPutUChar ( s, 0x26 );
bsPutUChar ( s, 0x53 ); bsPutUChar ( s, 0x59 );
/*-- Now the block's CRC, so it is in a known place. --*/
bsPutUInt32 ( s, s->blockCRC );
/*--
Now a single bit indicating (non-)randomisation.
As of version 0.9.5, we use a better sorting algorithm
which makes randomisation unnecessary. So always set
the randomised bit to 'no'. Of course, the decoder
still needs to be able to handle randomised blocks
so as to maintain backwards compatibility with
older versions of bzip2.
--*/
bsW(s,1,0);
bsW ( s, 24, s->origPtr );
generateMTFValues ( s );
sendMTFValues ( s );
}
/*-- If this is the last block, add the stream trailer. --*/
if (is_last_block) {
bsPutUChar ( s, 0x17 ); bsPutUChar ( s, 0x72 );
bsPutUChar ( s, 0x45 ); bsPutUChar ( s, 0x38 );
bsPutUChar ( s, 0x50 ); bsPutUChar ( s, 0x90 );
bsPutUInt32 ( s, s->combinedCRC );
if (s->verbosity >= 2)
VPrintf1( " final combined CRC = 0x%08x\n ", s->combinedCRC );
bsFinishWrite ( s );
}
}
/*-------------------------------------------------------------*/
/*--- end compress.c ---*/
/*-------------------------------------------------------------*/
| 20,591 | 674 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/sample1.ref | ÷À ; è TeX output 1995.07.01:1517 ÿÿÿÿ gÌ\ ý¯3¤ 2Ì\ ýäÜ\Npó°ìK ff ff cmbx14ºBeyïondLËProtÇwotyp8eImpÒÆlementa>tions:¤ÌÍfý>PïoÒÆlymorphiéccLËPro â!jectionAnäalys8is¡ E.forLËGlasgoïwHaskell"Û% ¶ 3óò"V
cmbx10»JulianÕTSew®9ard© ¥îóßê<x
cmtt10Á[email protected]õi xzó%o´Ç cmr9ÐDepart¾9men·¤tTofCompußtºîe ÞrScience¤ %Viò×ctßor'xiaTUniv¾9e Þrs äityofMancheAÇstºîe Þr¡
ëZOxfordTRoad,Manc¾9heAÇstºîe ÞrTM139PL,UK. mkHsçó&t : cmbx9ÑAÿhb Kstract.xµ ÐBuildinßgdúe ect¾9iveabNstractin·¤tºîe ÞrpretersdúrequireAÇscarefulaÄÍt-¡Hsçtºîen·¤t¾9ionRÜtßobAÇotThth¾9eoryandenßginee Þr'xingRÜi äsNsueAÇs.ThetTheoryofabNstract¡Hsçin·¤tºîe Þrpret¾9aÄÍtion®Õi äsw¾9elldØevelop äeAÇd,bußttTheenßginee Þr'xing®Õs äidØehasf äallenbe-¡Hsçhin¾9dq
somewhaÄÍt,anußnfortunÈaÄÍtºîeq
even·¤tgiventThaÄÍtabNstractin·¤tºîe ÞrpretaÄÍtioni äs¡HsçpAÇotºîen·¤t¾9ially©Öakeytºîechnoå±logyfordØeclaraÄÍtivelanßguagecompilaÄÍtion.Thi äs¡Hsçpap äe ÞrshÈo¾9wstThetThinkinßgb äeÕ>hindtThedØeAÇs äignandimpå±lemen·¤taÄÍtionofa¡Hsç rst-ordØe Þr,ãÎpAÇoå±lymorphiò×cpro ject¾9ionanÈalys. erforHask¾9ell,capabå±leofdØe-¡Hsçtºîect¾9inßg²heNadstr'xiò×ctneAÇsNs,andtThe Þreforesuitabå±leforsuppAÇortinßgallknown¡Hsçstr'xiò×ctn¾9eAÇsNs-relaÄÍtºîedª¹transformÈat¾9ions.Developmen·¤tculminÈaÄÍtºîeAÇdinasucceAÇsNs-¡HsçfulPÓtr'xialinst¾9allaÄÍtionPÓinv¾9e Þrs äion0.19oftTh¾9eGlasgowHaskellCompile Þr,¡Hsçan¾9dº¥tThesystºîemhasb äeenus. eAÇdtßoanÈalysearanßgeofHask¾9ellprograms,¡HsçincludinßgTaneNarlie Þrv¾9ers äionofitâfs. elf,13000lin¾9eAÇslonßg."»Ð, ó(ÂÖN cmbx12Ó1
Inftro` d uctionx, óKñ`y
cmr10²Th¸ãe#pas tdÕTecade#hass1ÇeenadramÃaÀ tiñÆcimprovemen±ÇtintUhep#e
«rformÃanceoflazy¦, fuÜrnct¸ãionÃal®languageG s,not¸ãabãlyHaskell,asimpãlemen±ÇtÜror shavedÕTevelop#eG dwaystÜro¦, mÃapÝ÷su¸ãchlanÜrguageG secien±ÇtUlyontÜros toG c¸ãkarchitµUectureG s.Neve
«rtUheleG s qs,tUheys till¦, ruÜrnÅÅanordÕTe
«rofmÃagnit¸ãudeslo¸ãwe
«rÅÅtUhantUheG irimp#e
«raÀ tivecouÜrn±ÇtµUe
«rpartà s,and,wor s1Çe,¦, itÔQloG okslik¸ãetUhep#e
«rformÃanceimprovemen±Çtà saretailinÜrgo .Fÿ*ªurtUhe
«rincre qas1ÇeG sin¦, p#e
«rformÃanceV´dÕTepen¸ãdon ndinÜrgwaystÜrorepãlacecopyinÜrgbyupG dÜraÀ tµUe-in-pãlace,and¦, lazy´evÿqÇaluaÀ t¸ãionbys tr*«iñÆctevÿqÇaluaÀ tion,whenpG o qss#ibãle.´A¢cr*«itiñÆcalelemen±ÇtintUhi#sis¦, tUh¸ãeUUs1ÇemÃan±ÇtiñÆcanÃalys1ÇeG swhic¸ãhdi#sõTcove
«rwhensuchtransformÃaÀ tionsarevÿqÇalid. ; Su¸ãcceG s qsfulPNus1Çeofs tr*«iñÆctneG s qsandshar*«inÜrganÃalys1ÇeG sincompile
«r sdÕTeman¸ãdscare-¦, ful² cons#idÕTe
«raÀ t¸ãionoftUheenÜrginee
«r*«ing² cons train±Çtà simpG o qs1Çed² bys1ÇeparaÀ tµUecompilat¸ãion,¦, an¸ãdVæbytUhelimitµUeG dcompuÜrtingVæreG sourcesa¸ãvÿqÇailabãle.Section 2oftUhi#spape
«rexam-¦, in¸ãeG sYòsuchcons train±Çtà sindÕTetail,asawayofgene
«raÀ tinÜrgus1Çefulmetr*«iñÆcswitUhwhic¸ãh¦, tÜroías qs1ÇeG sspG oss#ibilit¸ãiesíintUh¸ãedÕTes#ignspace.Bas1ÇedontUhi#s,w¸ãeouÜrtlin¸ãeinSec-¦, t¸ãion 3HÖtUhedÕTeG s#ignofapoãlymorphiñÆc,bac¸ãkwardss tr*«iñÆctneG s qsanÃalys1Çe
«rforHaskell.¦, Th¸ãeanÃalys1Çe
«rwasins talleG dinGlasgowHaskell0.19,andshÃowsanuÜrnpreceG dÕTen-¦, tµUeG d¹1pr*«iñÆce-p#e
«rformÃanceraÀ t¸ãio.Section 4preG s1Çen±Çtà stUhereG sulÜrtà softUhi#sexpe
«r*«im¸ãen±Çtand¦, concludÕTeG s.RËAlÜrtUhÃoughourpr*«imaryconce
«r#niss tr*«iñÆctn¸ãeG s qsanÃalysisofHask¸ãell,tUheG s1Çe¦, idÕTe qasH=h¸ãavewidÕTe
«rappãliñÆcabilitytÜroallab qs tract-in±ÇtµUe
«rpretaÀ tionbas1ÇeG danÃalyseG sfor * gÌ\ ý¯3¤ 2Ì\ ýäÜR ²fuÜrnct¸ãionÃalâolanguageG s,an¸ãdshÃouldin±ÇtµUe
«res ttUhÃo qs1Çeconce
«r#n¸ãedb¸ãytUhes1ÇeeminÜrglylarge¤ R gapUUb#et¸ãweentUhetUheoryandpractiñÆceofab qs tractin±ÇtµUe
«rpretaÀ tion.© wa Re qal,)Ñusa¸ãbãleanÃalys1ÇeG sdi e
«rf*«romprotÜrotyp#eimpãlemen±ÇtaÀ tionsins1Çeve
«ralways.¡R Th¸ãeN/anÃalys#ish¸ãastÜroruninre qasonÃa¸ãbãletimeandmemoryÿ*ª,evenwhenpreG s1Çen±ÇtµUedwitUh¡R uÜrnre qasonÃa¸ãbãle2oinputà s;itshÃould\ t"pro¸ãp#e
«rlyin±ÇtotUh¸ãeexi#s tinÜrgcompile
«rf*«rame-¡R w¸ãorà k,xØvi#s-a-viss1ÇeparaÀ tµUecompilat¸ãion,anditshÃoulddoagoG odjobforimport¸ãan±Çt¡R lanÜrguagep-fe qaÀ t¸ãureG s,partiñÆcularlysuÜrm-of-proG ductà styp#eG s,poãlymorphi#sman¸ãdhighe
«r-¡R ordÕTe
«rEÅfuÜrnct¸ãions.Wÿ*ªeshÃortUlyexaminetUhecons1ÇequenceG softUheG s1Çecons train±Çtà sinsome¡R dÕTet¸ãail.¦a Th¸ãeeúmÃainfoG cusoftUhi#spape
«risonglobaldÕTeG signtradÕTeo s.Bas1ÇeG dontUh¸ãaÀ t¡R di#sõTcus qsion,gðw¸ãeouÜrtUlineapartiñÆcularlye ectivepG oãlymorphiñÆcpro 8jectionanÃalys1Çe
«r¡R for¢ Hask¸ãell,andshÃowsomereG sulÜrtà sf*«romit.TheanÃalys1Çe
«r'sdÕTeG s#igndet¸ãailsare¡R bG otUhàëin±ÇtµUe
«res t¸ãinÜrgandvoãluÜrminous,butnotap¸ãpropr*«iaÀ tµUehe
«re,soreferenceG stÜromore¡R tUhÃoroughA
tre qaÀ t¸ãmen±Çtà saregiventUhroughÃouÜrt{th¸ãe r stpG ortofcalli#sproba¸ãbãlytUhe¡R aÿuÜrtUhÃor'sUUPhDth¸ãeG s#is [Sew948ç]. UéR »Arc®9hitª"ecturalÜ>Ove Drview-ȲThi#s9ôpape
«rdividÕTeG ss1ÇemÃan±Çt¸ãiñÆcanalys#issys tµUemsin±ÇtÜro¡R t¸ãwoH¢conceptualpartà s:anab qs tractin±ÇtµUe
«rpreter,H¢whiñÆc¸ãhgene
«raÀ tµUeG srecur s#iveequaÀ tions¡R o¸ãve
«r`somedomÃains,anda xpG oin±ÇtµUe
«r,whiñÆchremoveG srecur s#ionf*«romtUheequaÀ tions,¡R tUh¸ãe
«reÕTby×5mÃakinÜrgth¸ãemus1ÇefultÜrocompile
«r s.Asusual,werequiretUhedomÃainstÜrob#e¡R of6 nitµUeh¸ãeG ight6tÜroguaran±Çteete
«rminÃaÀ t¸ãionof xpG oin±ÇtinÜrg,andfurtUhe
«rreG s tr*«iñÆcttUhem¡R tÜroUUb#edis tr*«ibuÜrt¸ãiveUUlaÀ tÿtiñÆceG stÜromÃake xpG oin±ÇtinÜrge qas#ie
«r.¦a Sev¸ãe
«ralÐ$di eren±ÇtsõTc¸ãhemeG sfor xpoin±Çt¸ãinÜrghaveb#eenpropG o qs1Çed.Th¸ãeFÿ*ªron±Çtie
«r s¡R algor*«itUhmb'clev¸ãe
«rlyexpãloità smonotÜroniñÆcitytÜrobuildsyn±ÇtactiñÆcallyuÜrniquerepreG s1Çen±Çta-¡R t¸ãions,© tUhustr*«iviali#sinÜrgtUh¸ãedÕTetµUectionof xpG oin±Çtà s.IntroG d¸ãuced© byClackandPeytÜron¡R Jon¸ãeG s [PC87 ],tUhealgor*«itUhmhasb#eenmUuchtuÜrneG dove
«rtUheye qar s [Mar92 Z,HuÜrn91 o],¡R an¸ãd¾suppG ortà shighe
«rordÕTer xpG oin±Çt¸ãinÜrg.As1Çecondlineofenquiryi#stUhaÀ toflazy¡R xpG oin±Çt¸ãinÜrg,6whe
«retUhe xpG oin±Çti#sonlycompuÜrtµUedwh¸ãe
«reneeG dÕTed,ondÕTemÃan¸ãd.The¡R preci#s1Çeù1or*«iginsoflazy xpG oin±Çt¸ãinÜrgaredÕTebaÀ tabãle,ù1buÜrttwoe qarlypreG s1Çen±ÇtaÀ tions¡R are·Åd¸ãuetÜrotUheCousotà s [CC78qÊ]andtÜroJoneG sandMycroft [JM86N=].ExtµUens#ions¡R tÜroð¨high¸ãe
«r-ordÕTer xpG oin±Çt¸ãinÜrgareshÃownbyFÿ*ªe
«rgusonandHugheG s [FH93!],andby¡R Ro qs1Çen¸ãdÜrahl [Ros93j].ÎTh¸ãeworà kofHankinandLeMûG etaye
«ron\lazytyp#eG s" [HM94ª¯]¡R i#sUUalsorelaÀ tµUeG d.¦a In8×tUhi#spape
«rw¸ãetakeatUhirdapproach:compuÜrtaÀ tionofcompãletµUe xpG oin±Çtà s¡R b¸ãy4öus#inÜrgatµUe
«rmrewr*«itesys temtÜrotransforms1ÇemÃan±Çt¸ãiñÆcallyequivÿqÇalenttµUe
«rmstÜro¡R syn±Çt¸ãactiñÆcally8|idÕTentiñÆcal8|normÃalforms.Cons1ÇeldÕTeG sõTcr*«ib#es8|asimpãlerewr*«itµUe
«rfort¸ãwo-¡R pG oin±ÇtÚulaÀ tÿt¸ãiñÆcesus1ÇedinYÿ*ªaleHask¸ãell [Con91Ç!],andtUhetµUechniquewasextµUendÕTeG dtÜro¡R otUh¸ãe
«rëËlaÀ tÿtiñÆceG sin [Sew948ç],Section5.Rewr*«itµUe-bas1ÇeG d xpoin±ÇtµUe
«r scannot,ingen¸ãeral,¡R soãlv¸ãeUUhighe
«r-ordÕTerequaÀ t¸ãions,buÜrt,asweshalls1Çee,tUhi#smÃaynotmaÀ tÿtµUe
«rmUu¸ãch.¦a NoG c¸ãke
«r [Noc938è]ѶshÃowsaworà kinÜrganÃalys1Çe
«r,baseG don\a¸ãb qs tractred¸ãuction",¡R wh¸ãe
«re8tµUerm-rewr*«itinÜrg8i#sus1ÇeG dtoexecutµUetUh¸ãeprogramus#ingsom¸ãeab qs tracts1Çe-¡R mÃan±Çt¸ãiñÆcs. dBycompar*«i#son,ourtµUe
«rm-rewrit¸ãinÜrgi#sus1ÇeG dtodÕTetµUect xpG oin±Çtà s,an¸ãd¡R tUh¸ãe
«re-vi#sacle qardis t¸ãinction-vbetween-vtUheab qs tractin±ÇtµUe
«rpretaÀ tionand xpG oin±ÇtinÜrg¡R act¸ãivitieG s.¦a Th¸ãe preci#s1ÇenÃaÀ tureofab qs tractin±ÇtµUe
«rpretaÀ tionsi#sdÕTetµUe
«rmineG d,nÃaÀ turallyÿ*ª,by : gÌ\ ý¯3¤ 2Ì\ ýäÜ, ²tUh¸ãe¾transformÃaÀ tiontÜrob#esuppG ortµUed.On¸ãepartiñÆcularlyimpG ortan±ÇtcharactµUe
«r*«i#sa-¤ , t¸ãionZÄi#stUhelaÀ tÿtiñÆceG stÜrowhic¸ãhdi e
«ren±Çttyp#eG saremÃapp#eG d.IntUhes#impãleG s tcas1Çe,¡, allRnon-fuÜrnct¸ãionÃaltyp#eG scouldbemÃap¸ãpeG dtÜroat¸ãwo-poin±ÇtRlaÀ tÿtiñÆce,witUhth¸ãepG oin±Çtà s¡, repreG s1Çen±Çt¸ãinÜrgRpnodÕTemÃandandwe qakhe qadnormÃalform(WHNF)RodÕTeman¸ãdreG sp#ect-¡, iv¸ãely¡ins tr*«iñÆctneG s qsanÃalys#is.¡Fÿ*ªoras#impãleshar*«inÜrganÃalys#is,¡wemightus1Çea3-¡, pG oin±Çt!äc¸ãhain,dÕTenotinÜrgnorefe
«renceG s,exactUlyonerefe
«rence,andtwoormore¡, refe
«renceG s.¿óSimpãlea¸ãb qs tractions¿óliketUheG s1ÇearerouÜrtinelyus1ÇeG dinexi#s tinÜrgHaskell¡, compile
«r s [Con91Ç!,¬úPJ93Å].¬úTh¸ães#impãliñÆcityoftUheab qs tractionsmÃakeG stUheG s1ÇeanÃalyseG s¡, c¸ãhe qapUUandreliabãle,soweshallnotcons#idÕTe
«rtUhemfurtUhe
«r. +«; A¬ªmore¬ÁpG o¸ãwe
«rfulanÃalys#ismigh¸ãtaÀ tÿtµUempttÜrogivedÕTetaileG dinformÃaÀ tionabG ouÜrt¡, fuÜrnct¸ãionsÁ?dÕTe qalingwitUhs tru¸ãctureG dtyp#eG ssuchasli#s tà s,treeG s,orwhaÀ tµUeve
«rprogram-¡, m¸ãe
«r s7^caretÜrodÕTe ne.LaÀ tÿtiñÆceG sab qs tractinÜrgsuchtyp#eG sgrowinaccordÜrancewitUhth¸ãe¡, compãlexit¸ãyapoftUhÃo qs1Çetyp#eG s,sotUhe
«rei#snoarbitrarycuÜrto appG oin±Çtbey¸ãondapwhiñÆch¡, allLDdÕTet¸ãailsareignoreG d.InotUhe
«rwords,tUhe
«rei#sapG o qssibilit¸ãyLDofs1ÇeeG inÜrgarbitrar*«ily¡, f#arô\insidÕTe"dÜraÀ t¸ãas tructureG s.Thedowns#idÕTeistUh¸ãaÀ tth¸ãeG s1ÇelaÀ tÿtiñÆceG scananddoget¡, v¸ãe
«ry&Çlarge,sotUheanÃalys#is&ÇbecomeG s&Çexpensive.&ÇIntUhi#ss1Çense,&ÇsemÃan±ÇtiñÆc&Çanalys#isis¡, aQpart¸ãiñÆcularlyin±Çtractabãleproblem,b#ecaÿus1ÇetUh¸ãelaÀ tt¸ãiñÆces#izeG sandtUhusQamouÜrn±Çtof¡, e ort*KrequireG dcangro¸ãwexpon¸ãen±Çtially*KwitUhcompãlexit¸ãyoftyp#eG s.Fÿ*ªorexampãle,if¡, an&itµUemoft¸ãyp#eÁ(Int,?ýInt,Int)&²ismoG dÕTelled&b¸ãya9pG oin±ÇtlaÀ tÿtiñÆce,(2ÛWó
!",
cmsy10¸²2¸²2)ÿó O!â
cmsy7·?À²,¡, addinÜrgB³jus ton¸ãemoreÁInt²totUh¸ãetupãlee ectivelydouUbãleG sth¸ãelaÀ tÿtiñÆces#ize,giv-¡, inÜrg[f(2縲2¸²2¸²2)ÿ·?À².Th¸ãeco qs tà sofhighe
«rordÕTers1ÇemÃan±Çt¸ãiñÆcanalys1ÇeG sarealmo qs t¡, legen¸ãdÜraryÿ*ª,wkbutev¸ãen r stordÕTe
«ranÃalys1ÇeG scanb#ecom¸ãeexces qs#iv¸ãelyexpensiv¸ãe.Get-¡, t¸ãinÜrg
re qasonÃabãlep#e
«rformÃancesometimeG srequires\w¸ãorà klimitinÜrg"{tUhrowinÜrgaway¡, dÕTet¸ãailUUwhiñÆchab qs tractin±ÇtµUe
«rpretaÀ tionwouldotUhe
«rwi#s1ÇepiñÆckup.!@½, Ó2
Cons trainftÔËs onvia bÙledÆfe` s0 ignsÚW, »2.1 üSepara¶ftª"eÕTCompilat®9ionÚW, ²Cur*«iouslyóenough,s1ÇeparaÀ tµUecompilat¸ãioni#stUhebiggeG s ts#inÜrglesourceofdÕTes#ign¡, cons train±Çtà s.O©AO§con¸ãvenientO©waytÜroviewamUult¸ãi-moG duleprogrami#sasadirectµUeG d,¡, roG otµUed,úúpo qss#ibãlycycliñÆcgraph,witUharcsre
ect¸ãinÜrgimpG ortdÕTepen¸ãdencieG s,úútUheÁMain¡, ²moG d¸ãuleGåaÀ ttUhe\tÜrop",andtUheHaskellÁPrelude²aÀ ttUhebG otÿtÜromü^ÿóÙ R cmr7±1|s².CompilaÀ tionofa¡, moG d¸ãule³.ÁM³²caÿus1ÇestUh¸ãecompile
«rtÜrore qadth¸ãesourcetµUextofÁM³²andin±ÇtµUe
«rf#ace leG sof¡, moG d¸ãulesÐimmediaÀ tµUelyÐb#elowÁM²,andemitcoG dÕTeandin±ÇtµUe
«rf#ace leG sforÁM².IntµUe
«rf#ace¡, leG sÊareus1Çedb¸ãytUhecompile
«rtÜrocommUuniñÆcaÀ tµUereG sultà sofs1ÇemÃan±Çt¸ãiñÆcanalys1ÇeG sacro qss¡, moG d¸ãule ÐbouÜrndar*«ieG s. ÐIntUheab qs1ÇenceofinformÃaÀ tionabG ouÜrtimportµUeden±Çt¸ãities, ÐtUhe
«re¡, i#sâìalw¸ãaysasafeas qsuÜrmptionwhiñÆchcanb#emÃadÕTe.Thisf*«ram¸ãeworà kâìimpG o qs1Çess1Çev¸ãe
«ral¡, limit¸ãaÀ tions:®¬2@»{= ²Th¸ãet in±ÇtµUe
«rf#ace leG soughttÜrob#elimitµUeG dtoare qasonÃa¸ãbãles#ize,otUhe
«rwi#s1ÇetUhe¡= compile
«r\fmÃaysp#en¸ãdalotoftimere qadinÜrgtUhem.Fÿ*ªorexampãle,GlasgowHaskell¡= 0.19's®/ÁPrelude²in±ÇtµUe
«rf#aceisa¸ãbG ouÜrt100klong,an¸ãdre qadingits#igni can±ÇtUlyslo¸ãws¡= compile
«rUUs t¸ãartupforsmÃallmoG dules., Ù ff 8çÏ
LÍ ü-=ó)¹Aa¨ cmr6Ô1 ?üÐItTi äscon¾9venien·¤tTtßoasNsum¾9eallmoAÇdulesTimporttTh¾9eó1ߤN cmtt9ÜPreludeÐ. *^ gÌ\ ý¯3¤ 2Ì\ ýäÜX@»{c ²InformÃaÀ t¸ãion×only
owsupwards,tÜrowardsÁMain².Fÿ*ªorqueG s tionsoftUheform¤ c \hÃo¸ãwQ6i#sen±ÇtityXPôgoinÜrgtob#eus1ÇeG d?",w¸ãealsoneeG dinformÃaÀ tion
owsdownward¡c f*«romUUÁMain².¡X@»{c ²Tÿ*ªoÄâcompileamoG d¸ãuleÁM²,itshÃouldsucetÜrore qadtUhein±ÇtµUe
«rf#aceG sformod¸ãules¡c imm¸ãeG diaÀ tµUelyÖçb#elowÁM².Wÿ*ªece
«rtainlywan±ÇttÜroavoidre qadinÜrgalltUhein±ÇtµUe
«rf#aceG s¡c in½tUh¸ãedownwardclo qsureofÁM²:forÁMain²,tUhaÀ tcouldme qanreadinÜrgtUh¸ãeen±Çtire¡c s1ÇetUUofin±ÇtµUe
«rf#aceG s.© ûR »Mu×t®9uallyèÕrecur-s(äivemoQÇdules<;²Exi#s t¸ãinÜrgDæimpãlemen±ÇtaÀ tionsdÕTe qalwitUhmuÜrt¸ãually¡R recur s#iv¸ãecÆmoG dulescÆint¸ãwocÆways.Onei#stÜrocompileallmoG dulescÆinagrouptÜro-¡R getUh¸ãe
«r,Ãacle qansoãluÜrtion,aswitUhYÿ*ªaleHaskell's\compilaÀ tionuÜrnità s".TheotUhe
«r¡R i#sptÜrocompilee qac¸ãhmoG duleintUhegroups1ÇeparaÀ tµUelyÿ*ª,uÜrn±Çtilin±ÇtµUe
«rf#ace leG ss tabili#s1Çe,¡R dÕTenot¸ãinÜrg¥La xeG dpoin±Çt.Thi#sm¸ãe qanstUhaÀ tatle qas ton¸ãemoG dulewillhavetÜrob#e¡R compileG d?NwitUhze
«ros1ÇemÃan±Çt¸ãiñÆcknowleG dgeoftUheotUhe
«r s,witUhth¸ãecompile
«rmÃak-¡R inÜrg{w¸ãor st-cas1Çeas qsuÜrmpt¸ãions.Theup qshÃotoftUhi#sistUh¸ãaÀ t,fors1ÇemÃan±ÇtiñÆcanÃalys1ÇeG s¡R in¸ãvoãlvinÜrgUU xpG oin±Çting,UUtUhe xpG oin±Çtà sb#einÜrgcomputµUeG dmÃayb#esuUbo¸ãptimÃal.¦R »2.2 üCompßJletª"eÕTorminimº}alfu×nct®9iongraphs?ûR ²FixpG oin±Çt¸ãinÜrg1]byminimÃalfuÜrnctiongraphsü^ÿ±2 в(MFGs)buildstUheminimÃals1Çetof¡R arguÜrm¸ãen±Çt-reG sultÖpair só
b>
cmmi10µG²neeG dÕTedÖtÜroevÿqÇaluaÀ tµUetUhe xpG oin±ÇtaÀ tasp#eci carguÜrmen±Çt¡R µxÿót}\Ê cmti7Åinit
¹².c/Th¸ãeinitialgraphi#s¸f²(µxÿÅinit
¹µ;ª¨¸>²)¸gü^ÿ±3|s².Ate qachitµUe
«raÀ tion,reG sulÜrtà sforallargum¸ãen±Çtà s¡R in4tUh¸ãecurren±ÇtgraphµGÿó 0er cmmi7´n ²²arere-evÿqÇaluaÀ tµUeG d,givinÜrgµGÿ´n±+1².WhenanappãliñÆcaÀ tionof¡R aùAfuÜrnct¸ãiontosom¸ãeargum¸ãen±Çtµx²i#sencoun±ÇtµUe
«reG d,tUh¸ãeexi#s tinÜrggraphµGÿ´nj¿²i#ss1Çe qarcheG d¡R forsÛacorreG spon¸ãdinÜrgsÛresult.sÛIftUh¸ãaÀ tµx²i#snotpreG s1Çen±Çt,th¸ãereG sulÜrti#stakenas¸>²and¡R tUh¸ãe¼9pair(µx;ª¨¸>²)i#sins1Çe
«rtµUeG din±ÇtÜroµGÿ´n±+1².TheproG ces qs¼9rep#eaÀ tà suÜrn±Çt¸ãilµG²s tabili#s1ÇeG s,¡R wh¸ãe
«reupG onUUµG²(µxÿÅinit
¹²)dÕTelive
«r stUherequireG dvÿqÇalue.Asanexampãle,cons#idÕTe
«r:©+Dýç¹ #xóý ':
cmti10Äf ¾Ñ²:: ¥R»[»2þ¢_ÿ·?¿ó2?
ظ!Ç»2þ¢_ÿ·?¿ó2?
ÄÀ²] Y¨ #xÄfå¬x ¾Ñ²=ëô ¥R»ó ú±u
cmex10«8 ¥R»< ¥R»:óæd ¯°¸?7ÊsÄifBÒ?µxDz=¸?¡ ¯°Älift òز(Älift²(»0²)) â¹È¸uã²(Älift õ«²(¸?²)8à¸t²(µfÚ§¸?²))7ÊsÄifBÒ?µxDz=Älift¼Ã²(¸?²)¡ ظàµxã¸u²(Älift õ«²(¸?²)8à¸t²(µfÚ§x²))7ÊsÄotherwise¦R ²Giv¸ãenæµxÿÅinitÞv²=%_Älift
²(¸?²),wehaveµGÿ±0¡Ò²=%_¸f²(Älift õ«²(¸?²)µ;ª¨¸>²)¸g².EvÿqÇaluaÀ tinÜrg(µf8îÄlift.²(¸?²))giveG s¡R reG sulÜrtÁêÄlift òز(Älift²(»0²))4½dan¸ãdÁêanewpair(¸?µ;ª¨¸>²),soµGÿ±1C²=Ǹf²(¸?µ;¸>²)µ;²(Älift õ«²(¸?²)µ;Älift òز(Älift²(»0²)))¸g².¡R ItµUe
«raÀ t¸ãinÜrg4ÜagaingiveG sµGÿ±2
b¾²=æK¸f²(¸?µ;ª¨¸?²)µ;²(Älift õ«²(¸?²)µ;Älift òز(Älift²(»0²)))¸g4ܲandµGÿ±3
b¾²=æKµGÿ±2|s²,so¡R µG²(µxÿÅinit
¹²)Ç=Älift¼Ã²(Älift õ«²(0)).¡a InDtUhi#sexampãle,th¸ãerequireG danswe
«rwasobtaineG dbyevÿqÇaluaÀ tinÜrgµfWª²aÀ ttwo¡R ouÜrtÆofità sfourargum¸ãen±ÇtpG ointà s.Wh¸ãentUhearguÜrmen±ÇtlaÀ tÿtiñÆceG scon±ÇtaintUhÃousands¡R of]pG oin±Çtà s,tUh¸ãehÃop#eistUh¸ãaÀ tonlyatinyminor*«ityofarguÜrmen±Çt-reG sult]pair sneeG dtÜro¡R b#eUUcompuÜrtµUeG d.¡a MF¸ãGsh>achieve\lazy" xpG oin±ÇtinÜrgb#ecaÿus1ÇetUheymÃakeexpãliñÆcittUhedÕTep#endence¡R b#et¸ãween?inpuÜrtan¸ãdoutʪputpG oin±Çtà s.Not¸ãiñÆcehÃowtUhealgor*«itUhmi#slimitµUeG dtÜro r stR « ff 8çÏ
LÍ ü-=Ô2 ?üÐATfußnct¾9ion'sgraphi äsnomoretThanacoå±llectionofargußmen·¤t-reAÇsultTpairsforit. ü-=Ô3 ?üó,©±Ê cmsy9×>TÐifmÈaximalT xpAÇoin·¤tâfsaresough¾9t,×?ÐforminimÈal xpoin·¤tâfs. @¨ gÌ\ ý¯3¤ 2Ì\ ýäÜ, ²ordÕTe
«rª6fuÜrnct¸ãions:highe
«rordÕTer xpG oin±Çt¸ãinÜrgwouldrequirecompar*«inÜrgcompãletµUefunc-¤ , t¸ãionrepreG s1Çen±ÇtaÀ tions,whiñÆchi#sprecis1Çelywh¸ãaÀ tlazy xpG oin±ÇtinÜrgi#sdÕTeG sign¸ãedtÜroa¸ãvoid.¡, Nev¸ãe
«rtUheleG s qs,ÅbyextµUendinÜrgtUhenotionofdÕTep#endencyÅb#etweeninpuÜrtà sandouÜrtʪputà s,¡, Fÿ*ªe
«rguson an¸ãdHugheG s [FH93!]havesucceG s qsfullygene
«rali#s1ÇeG dMFGstÜroworà kintUhe¡, high¸ãe
«rTordÕTercas1Çe,callinÜrgtUh¸ãemconcretµUedaÀ t¸ãas tructureG s(CDSs),andRo qs1ÇendÜrahl¡, repG ortà sUUs#imilarresulÜrtà s [Ro qs93j].¡; Fÿ*ªuÜrnct¸ãionÃal6typ#eG sab qs tracttÜrodomÃainswitUhsoman¸ãypG oin±Çtà stUhaÀ tlazy xpG oin±Çt-¡, inÜrgpÂcanmÃak¸ãeanenormousdi e
«renceforhighe
«rordÕTeranÃalys#is.pÂFÿ*ªergusonan¸ãd¡, Hugh¸ãeG sUUgive gureG sfortUhef#amousÁfoldr²-Áconcat²exampãle:©³;¿÷Áfoldr?ý::(a->b->b)->b->[a]->b¡¡;¿÷foldr?ýfa[]=a¡;¿÷foldr?ýfa(x:xs)=fx(foldrfaxs)¡¡;¿÷concat?ý::[[a]]->[a]¡;¿÷concat?ý=foldr(++)[]¦, ²wh¸ãe
«rePÁ(++)²i#stUheHaskellli#s t-appendPope
«raÀ tÜror.PUsingPaBHA-s t¸ãyleforwardab-¡, s tract¦µin±ÇtµUe
«rpret¸ãaÀ tion [BHA85 []requireG sbuildinÜrganins tanceofÁfoldr²intUhedo-¡, mÃain=Ô[»4J¸!»4¸!»4²]¸!»4¸!»6¸!»4².Thi#sgiv¸ãeG sanarguÜrmen±ÇtlaÀ tÿtiñÆceofalmo qs t¡, 600,000Ø1pG oin±Çtà s.CompuÜrt¸ãaÀ tionØ1oftUh¸ãeent¸ãirefuÜrnctiongraphtakeG sontUheordÕTe
«r¡, ofGanhÃourus#inÜrgtUh¸ãef*«ron±Çtie
«r salgor*«itUhm [FH93!],whe
«re qaswitUhCDSscompuÜrting¡, jus t#tUhÃo qs1Çepartà sn¸ãeeG dÕTed#tÜrodetµUe
«rmin¸ãetUheen±Çtire xpG oin±ÇtofÁconcat²takeG stwoor¡, tUhree¬ s1Çecon¸ãdsuÜrndÕTe
«rs#imilarcircuÜrms tanceG s.Fÿ*ªormorecompãlexfuÜrnctionspaceG stUhe¡, di e
«renceUUi#sev¸ãengre qaÀ tµUer.¡; Giv¸ãen"suchanove
«rwhelminÜrgp#e
«rformÃanceadvÿqÇan±Çtage,iti#stµUemptinÜrgtofor-¡, get en±Çt¸ãirelyabG ouÜrtanyotUhe
«r xpG oin±ÇtinÜrgsõTcheme.Yÿ*ªetin±ÇtµUegraÀ tionofCDS qbas1ÇeG d¡, xpG oin±Çt¸ãinÜrg.+proves.+trouUbãlesome.+whenvieweG df*«romawidÕTe
«rfram¸ãeworà k.The
«reare¡, t¸ãwoÚas-yetuÜrnreG soãlvedÚi#s qsues.Fir stUlyÿ*ª,Úasdi#sõTcus qs1Çedb#elo¸ãw,wehaveadÕTeepdeG s#ire¡, tÜroÞQa¸ãvoidmonomorphiñÆcanÃalys1ÇeG sofanykind.CDSsaspreG s1Çen±ÇtµUedsof#ararepurely¡, monomorphiñÆc.;¯Becaÿus1ÇeoftUh¸ãeneeG dtÜroclo qs1Çelyexpo qs1ÇedÕTep#en¸ãdencies;¯b#et¸ãweensuUb-¡, partà s©¿oftUh¸ãeinpuÜrtandsuUb-partà softh¸ãeouÜrtʪput,©¿iti#snotcle qarhÃowtUheymÃayb#e¡, us1ÇeG dý,inapoãlymorphiñÆcw¸ãayÿ*ª.For r st-ordÕTe
«rý,MF¸ãG-styleý, xpG oin±ÇtinÜrg,pG oãlymorph-¡, i#smQ¹isnotaprobãlem:K¸ãuUbiak [KHL91 "]hasimpãlemen±ÇtµUeG dapoãlymorphiñÆcpro 8ject¸ãion¡, anÃalys1Çe
«rUUwitUhMF¸ãG xpG oin±ÇtinÜrgintUheGlasgowHaskellcompile
«r.¡; AÈmoreøimm¸ãeG diaÀ tµUeprobãlemwitUhlazy xpoin±Çt¸ãinÜrgi#shÃowtÜrodÕTe qalwitUhmoG dules.¡, AdScrudÕTedWsõTc¸ãhemei#stÜroexpG ortwhaÀ tµUeve
«rpartà softUheab qs tractfuÜrnctiongraphhave¡, b#een{SaggregaÀ tµUeG dwhils tcompilinÜrgtUh¸ãedÕTe ningmoG d¸ãule.If,compilingsom¸ãeotUhe
«r¡, moG d¸ãule,êtUhecompile
«rneeG dstÜroknowtUhe xpG oin±ÇtaÀ tsomepG oin±ÇtforwhiñÆchno¡, informÃaÀ t¸ãionÒi#savÿqÇailabãle,iti#ssometimeG spo qss#ibãleÒtÜromÃak¸ãeasafees t¸ãimÃaÀ tµUeus#inÜrg¡, monotÜroniñÆcit¸ãyUUandtUheinformÃaÀ tionwhiñÆchÄis²avÿqÇailabãle.¡; Fÿ*ªorò!exampãle,h¸ãavinÜrgò!expG ortµUedµGÌj²=¸f²(µxÿ±1|sµ;ª¨fßùxÿ±1²)µ;²(µxÿ±2µ;fßùxÿ±2²)¸gò!²w¸ãemÃaywi#shtÜro¡, kno¸ãw`(µfõ xÿ±3|s²)intUhecas1Çewhe
«reµxÿ±3 ]ð¸vá}µxÿ±1 Ó²andµxÿ±3 ]ð¸vá}µxÿ±2|s².Sinceµf«ï²i#smonotÜroniñÆc¡, itGGfoãllo¸ãwstUhaÀ tµfmâxÿ±3ÖƸvZSµfxÿ±1ú²andGGµfxÿ±3ÖƸvZSµfxÿ±2|s²,an¸ãdsoµfxÿ±3ÖƸvZS²(µfxÿ±1V¸uÚ+µfxÿ±2|s²).¡, Pro¸ãvidÕTeG d/õweareworà kinÜrginaf*«rameworà kwhe
«reove
«reG s timÃaÀ tioni#ssafe,tUhisgiv¸ãeG s¡, anUUap¸ãproximÃaÀ tµUevÿqÇalueforµfÚ§xÿ±3|s². V gÌ\ ý¯3¤ 2Ì\ ýäÜa ²Cle qarlyÿ*ª,üítUh¸ãebigge
«rth¸ãeexpG ortµUedüíµG²,th¸ãeb#etÿtµUe
«rth¸ãeeG s timÃaÀ tµUesüítUhaÀ tcanb#emÃadÕTe¤ R f*«romÔTit.BuÜrttUh¸ãewhÃoãlepurpG o qs1ÇeofMFGsi#stÜrokeepµG²assmÃallaspG o qss#ibãle,¡R con±Çt¸ãaininÜrgûp#e
«rhap qsahandfulofpG oin±Çtà souÜrtoftUhÃousandsofcandidÜraÀ tµUeG s.Thi#s¡R milit¸ãaÀ tµUeG s3Oagains tmÃakinÜrggoodap¸ãproximÃaÀ tions.3OWÿ*ªor s1Çe,notalltUh¸ãepoin±Çtà sinµG¡R ²mÃayb#eus1ÇeG dinmakinÜrgtUh¸ãeapproximÃaÀ tion:intUheexampãleabG ove,wearelimitµUeG d¡R tÜroUUus#ingpG oin±Çtà s¸f²(µy[Ù;ª¨fÚ§y²)Ǹ2µG0¸jµxÿ±3C¸vǵy[Ù¸g².¡a A>ås1Çecon¸ãd,?!equallyuÜrneG difying?!soãlution?!i#stÜroexpG ortnotonlyµG²,buttUh¸ãere-¡R cur s#iv¸ãeïGdomÃainequaÀ tionf*«romwhenceitcame{oreventUhesourcetµUextwhiñÆch¡R b#egaÀ tdtUh¸ãeequat¸ãion.Then,whenµG²cannotanswe
«raqueryÿ*ª,iti#sextµUen¸ãdÕTeG d,intUhe¡R mÃann¸ãe
«r:ùdÕTeG sõTcr*«ib#eda¸ãbove,:ùasrequireG d.IftUheab qs tractin±ÇtµUe
«rpretaÀ tionsgetlarge,¡R d¸ãuÜrmping®/tUhemin±ÇtÜrointµUe
«rf#ace leG smÃaynotbepract¸ãiñÆcal.ThissõTc¸ãheme®/alsoh¸ãasa¡R morexsuUbtlew¸ãe qakneG ss.xAhcrucialins#ighti#stUhaÀ t ndinÜrgtUhe xpG oin±ÇtofadomÃain¡R equaÀ t¸ãion¬ÐmÃakeG sits tandonità sown:itnolonÜrge
«rreferenceG san¸ãyotUhe
«requaÀ tion.¡R Cons#idÕTe
«rÍtUh¸ãefoãllowinÜrgtUhreemoG dulesÍdÕTe ninÜrgrecur s#ivefuÜrnctionsÁf²,Ág²andÁh²witUh¡R correG spon¸ãdinÜrgUUequaÀ tionsÁf#²,Ág#²andÁh#²:©¤ma¿÷Ámodule?ýF(f)where{D?Ùf=...f...$¿ë}¡a¿÷module?ýG(g)where{importF;¿÷g=...g...f...}¡a¿÷module?ýH(h)where{importG;¿÷h=...h...g...}¦R ²DuÜrmpingUUtUh¸ãeuÜrnsoãlveG ddomÃainequaÀ tionsin±ÇtÜrointµUe
«rf#ace(Á.hi²) leG sgiv¸ães:¦a¿÷ÁF.hi:¿÷f#?ý=...f#...¡a¿÷G.hi:¿÷g#?ý=...g#...f#...¡a¿÷H.hi:¿÷h#?ý=...h#...g#...¦R ²Wh¸ãenóªmoG duleÁHó²i#scompileG ditmÃayben¸ãeceG s qsarytÜroextµUendtUhefuÜrnctiongraph¡R forNôÁg#².Th¸ãetrouUbãlei#sthi#sm¸ãe qansreadinÜrgin±ÇtµUe
«rf#aceÁF.hi²ev¸ãentUhÃoughth¸ãetµUextof¡R moG d¸ãule¹úÁH¹Ó²do#esnotdirectUlyrefe
«rtÜroÁF²:ingen¸ãeral,itmigh¸ãtb#eneceG s qsarytÜroreadall¡R in±ÇtµUe
«rf#aceG sØintUh¸ãedownwardclo qsureofÁH².AnysõTchemewhiñÆchexpG ortà sin±ÇtÜrointµUe
«rf#ace¡R leG sÕrefe
«rencestÜrofunct¸ãionsinotUhe
«rmoG dulesÕsu e
«r stUh¸ãesameprobãlem.MÜre
«rely¡R inlininÜrg?]refe
«renceG stootUh¸ãe
«requaÀ tionsdo#eG snothelp,astUhi#smÃakeG stUhein±ÇtµUe
«rf#aceG s¡R con±Çt¸ãainUUeve
«rytUhinÜrgb#elowtUhemintUhehie
«rarchyÿ*ª,andhenceve
«rylarge:¦a¿÷ÁF.hi:¿÷f#?ý=...f#...¡¡a¿÷G.hi:¿÷g#?ý=letrecf#=...f#.../?åin...g#...f#...¡¡a¿÷H.hi:¿÷h#?ý=letrecf#=...f#.../?åin¡ ¥ÿÐletrec?ýg#=...g#...f#...
úin...g#...h#...¦R ²Becaÿus1ÇeÃÊoftUh¸ãeG sediculÜrt¸ãieG s,lazy xpoin±Çt¸ãinÜrgdo#esnots1ÇeemtÜro tw¸ãellinan¡R en¸ãvironmen±ÇtUUwhe
«res1ÇeparaÀ tµUecompilat¸ãioni#stUhenorm. ¤mR »2.3 üP®9oßJlymorphiï¥cÕTorMonomorphic?¦R ²P¸ãarametr*«iñÆc~VpG oãlymorphi#smisanimpG ort¸ãan±Çtelemen±ÇtoftUhetyp#esys tµUemsofmoG dÕTe
«rn¡R fuÜrnct¸ãionÃalUUlanguageG s.Giv¸ãenaparametr*«iñÆcallypG oãlymorphicfuÜrnct¸ãion,wecould: kJ gÌ\ ý¯3¤ 2Ì\ ýäÜ2@»{= ²ReG doÂÝtUh¸ãeanÃalys#isÂÝfore qachdi e
«ren±Çtins tan±ÇtiaÀ tionoftUhefuÜrnction.Thi#sis¤ = equivÿqÇalen±ÇtßtÜroexpan¸ãdingouttUh¸ãeprogramin±Çtoacoãllect¸ãionofmonomorphiñÆc¡= ins t¸ãanceG sUUb#eforeanÃalysis.© ÅÙ2@»{= ²AnÃalys1Çe&´tUh¸ãefuÜrnctiononce,andus1ÇepG oãlymorphiñÆcinvÿqÇar*«iancereG sulÜrtà stodÕTe qal¡= witUhUUdi e
«ren±Çtlyins t¸ãan±ÇtiaÀ tµUeG dus1ÇeslaÀ tµUe
«ron.Q, Anæoft-quotµUeG ddi#sadvÿqÇan±Çt¸ãageoftUheforme
«rapproachi#stUhaÀ tpG oãlymorphiñÆcfuÜrnctions¡, mÃayãDb#eanalys1ÇeG dman¸ãytimeG s,whiñÆchi#swas tµUeful.IntUhewor stãDcas1Çe,tUhenUuÜrmÿ|qb#e
«rof¡, ins t¸ãanceG sàcanb#eexpon¸ãen±ÇtialàintUh¸ãelenÜrgthofth¸ãeprogram.Neve
«rtUheleG s qs,suchb#e-¡, h¸ãaviourtfdo#eG snotap¸ãpe qartÜrooG ccur.Me qasurem¸ãen±Çtà sbyMarà kJoneG sofs#ixsuUb qs tan±Çtial¡, programs6{intUh¸ãeÁnofib²suitµUe [Par92qË]suggeG s tatwofoãldincre qas1ÇeintUhenUuÜrmÿ|qb#e
«rof¡, bin¸ãdinÜrg¯group qs [Jon93±Ì].Fÿ*ªurtUhe
«r,onlys#impãlelis t-h¸ãandlinÜrg¯funct¸ãionslikeÁmap²and¡, ÁfoldrS¨²h¸ãavealargenUuÜrmÿ|qb#e
«rofins tanceG s,andsuchfuÜrnctionsareoftµUeninlineG dby¡, o¸ãptimi#sinÜrg°ícompile
«r san¸ãywayÿ*ª.°íSomonomorphiñÆcanÃalys#is°ímaynotact¸ãuallyinvoãlve¡, mUu¸ãch%dupãliñÆcaÀ tionofworà k.Ob qs1Çe
«rvealsotUhaÀ ts#incetUheab qs tractin±ÇtµUe
«rpretaÀ tionsof¡, t¸ãyp#eG s×õoftµUenmÃap qsman¸ãytyp#eG stÜrotUhesamelaÀ tÿtiñÆce,monomorphi#saÀ tionontUhebas#is¡, ofUUlaÀ tÿt¸ãiñÆceG scaus1ÇeG sev¸ãenles qsexpans#ion.¦; Moreqs1Çe
«r*«iousi#s,onceagain,tUh¸ãein±ÇtµUeract¸ãionofmonomorphi#saÀ tionwitUhmoG d-¡, uleG s.^RFÿ*ªoramod¸ãuleÁM^O²export¸ãinÜrgapoãlymorphiñÆcfuÜrnct¸ãionÁf²,wecaneG itUhe
«ranÃalys1Çe¡, ÁfîɲaÀ talltUh¸ãeins tanceG sitwillgetus1ÇedaÀ t,orw¸ãecanwaituÜrn±ÇtilallmoG dulesîÉaboveîÉÁM¡, ²are¼³compileG dan¸ãdre qanÃalys1ÇeÁf²onanas-neeG dÕTed¼³bas#is.BotUhsõTc¸ãhemeG sareuÜrnÃaÀ tÿtract-¡, iv¸ãe,æÏtUhe r stb#ecaÿus1ÇeitrequireG sado¸ãwnward(ÁMain²tÜroÁPrelude²)pas qstUhroughth¸ãe¡, moG d¸ãuleìggraphtÜroes t¸ãabãli#shìginstan±ÇtiaÀ tions,ìgtUhes1Çecondb#ecaÿus1ÇeoftUheneeG dtÜrocarry¡, arouÜrn¸ãdUUÁf²'ssourcetµUextwhencompilinÜrgmoG dulesUUaboveUUÁM².¦; P¸ãoãlymorphiñÆc\ÓanÃalys#iscircuÜrm¸ãven±Çtà sbG otUhprobãlemsb#ecaÿus1ÇeasinÜrgleanÃalysis¡, s1Çe
«rv¸ãeG sÈ[allquer*«ieG s,ev¸ãentUhÃo qs1Çefromdi e
«ren±ÇtmoG d¸ãules.È[Wÿ*ªorà kbyBaraki,HugheG s¡, an¸ãdmLaÿuÜrnchbury [Bar93 ,HL92b!»X](tÜromen±ÇtionbuÜrtafew)haseG s tabãli#shedmtµUech-¡, niqueG s0#forbotUhforw¸ãardandbackwardpG oãlymorphiñÆcs tr*«ictn¸ãeG s qsanÃalys1Çes.Bac¸ãk-¡, w¸ãard¯%anÃalys1ÇeG slendtUhems1ÇelveG spartiñÆcularlywelltÜrosuchanapproach:Section5¡, of [Sew948ç]ËdÕTeG sõTcr*«ib#essu¸ãchananÃalys#isinconsidÕTe
«ra¸ãbãledet¸ãail.Baraki'sworà kindiñÆc-¡, aÀ tµUeG sÕþhÃo¸ãwsomeforwardanÃalys1ÇeG smayb#emadÕTepG oãlymorphiñÆc: [Sew948ç],Sect¸ãion3¡, dÕTeG sõTcr*«ib#esUUanimpãlem¸ãen±ÇtaÀ tion.¦; Fÿ*ªord r stordÕTe
«rfuÜrnct¸ãions,pG oãlymorphiñÆctµUechniqueG sgivetUhesamereG sulÜrtà sas¡, monomorphiñÆc82anÃalys#is:tUh¸ãeyareexact.BuÜrtinth¸ãehighe
«rordÕTercas1Çe,accuracy¡, mÃayäÍb#elo qs t.Fÿ*ªorbac¸ãkwardäÍanalys1ÇeG s,whiñÆc¸ãhareinhe
«ren±ÇtUly r st-ordÕTer,äÍtUhi#smÃay¡, b#eÇaccept¸ãabãle.Fÿ*ªorotUhe
«ranÃalys1ÇeG s,tUhemÃagnitudÕTeoftUhi#sprobãlemhasyettÜrob#e¡, quan±Çt¸ãi eG d.!Ý<, »2.4 üHigh®9e DrÕTor r-stÕTordÎîer?Ý<, ²High¸ãe
«r½ ordÕTer xpG oin±Çt¸ãinÜrgi#sdicultb#ecaÿus1ÇetUh¸ãelaÀ tt¸ãiñÆces#izeG sforfuÜrnctionspaceG s¡, gro¸ãw8ãsorapidlyÿ*ª.Forexampãle,ins tr*«iñÆctn¸ãeG s qsanÃalys#is,8ãanitµUemoftyp#eÁ[Int]?ý->[Int]¡, ²migh¸ãt±ab qs tracttÜrodomÃain[»4\¸!»4²],whiñÆc¸ãhhas35pG oin±Çtà s.AddinÜrgas1Çecondpara-¡, m¸ãetµUe
«ro«oftUhesametyp#egiveG sdomÃain[»4Ǹ!»4¸!»4²],o«witUh24,696poin±Çtà s,anincre qas1Çe¡, of¾Úo¸ãve
«r700timeG s.ThenUuÜrmÿ|qb#e
«rofpG oin±Çtà sin[»4võ¸!»4¸!»4¸!»4²]i#sce
«rt¸ãainlyve
«ry | gÌ\ ý¯3¤ 2Ì\ ýäÜR ²large.ÂoMan¸ãyfuÜrnctionÃalparametµUe
«r shavetyp#eG smorecompãliñÆcaÀ tµUedtUh¸ãanthi#s,an¸ãd¤ R calculaÀ t¸ãinÜrgUUcompãletµUe xpG oin±Çtà sintUheG irpres1Çencei#simpract¸ãiñÆcal.¡a FixpG oin±Çt¸ãinÜrgøÖbytµUe
«rmrewr*«itinÜrgsometimeG sf#ailsintUhepreG s1ÇenceoffuÜrnctionÃal¡R param¸ãetµUe
«r s.¥ IntUhegene
«ralcas1Çe,highe
«rordÕTerequaÀ t¸ãionscannotb#esoãlveG d,b#ecaÿus1Çe¡R tUh¸ãeG iræ xpoin±Çtà sdÕTep#en¸ãdontUhe xpG oin±Çtà softUhefuÜrnctionÃalparametµUe
«r s.Theusual¡R m¸ãetUhÃoG dÕofrewr*«itinÜrgadjacen±ÇtapproximÃaÀ tionstÜronormÃalformf#ailstodÕTetµUectan¡R o¸ãve
«rall ` xpG oin±Çtb#ecaÿus1ÇesuUb qsequen±Çtap¸ãproximÃaÀ tions `contain `sometµUe
«rminvoãlvinÜrg¡R atöfuÜrnct¸ãionÃalparametµUe
«rappãlieG dmoreandmoretimeG s.Thi#soccur s,forexampãle,¡R inUU xpG oin±Çt¸ãinÜrgforwardsab qs tractionsofÁfoldr²:©HÙa¿÷Áfoldr#(n)¿÷=?ý\faxs->...f(fÿô...(fE)...)...¡¡a¿÷foldr#(n+1)?ý=\faxs->...f(f(f...(fE)...))...¦R ²wh¸ãe
«re ÁEë²i#ssomearbitrarytµUe
«rm,andÁfoldr#(n)²andÁfoldr#(n+1)²dÕTenotµUetwo¡R adjacen±Çt1ºap¸ãproximÃaÀ tionstÜrotUhe xpG oin±Çt.He
«re,Áf²i#safuÜrnctionÃalparametµUe
«rb#eG inÜrg¡R wrap¸ãp#eG d£moreandmoretimeG sarouÜrndÁE²,tUhe
«reÕTbymÃakinÜrgsyn±ÇtactiñÆcdÕTetµUectionof¡R aÅú xpG oin±Çtimpo qss#ibãle.ÅúOfcour s1Çe,iftUh¸ãetµUe
«rmrewr*«ite
«ri#sextrem¸ãelycleve
«ritcan¡R dÕTetµUect¦#tUh¸ãaÀ t,forsomesuitabãlylargeµn²,Áfæ ü\p´n¥b²=MÄÄ x¡ÁfR²,soitcanreplaceÁf 3ä²(Ä xÄÝÁfÚ²)b¸ãy¡R Ä x`>1Áfh«à²an¸ãd-²tUhe
«reÕTbygene
«raÀ tµUenormÃalformswhiñÆchdÕTep#endexpãliñÆcitUlyonÁf²'s xpG oin±Çt.¡R Th¸ãeprequireG dpaÀ tÿtµUe
«r#nmÃat¸ãchinÜrgpi#str*«iñÆc¸ãky{notsosimpãlefordouUblyrecur s#iv¸ãe¡R tµUe
«rmsØ_{an¸ãdweneeG dtÜrodÕTecideØ_onasuitabãleµn².ThevÿqÇalueofµn²dÕTep#endsontUhe¡R fuÜrnct¸ãionÜspaceinqueG s tion{cle qarlyÿ*ª,weneeG daquiñÆckalgor*«itUhmforgivinÜrga¡R goG odo¸ãve
«reG s timÃaÀ tµUeoftUhefuÜrnctionspace'sheG ight.NielsonandNielsonloG okedaÀ t¡R tUhi#süprobãlem [NN92 ],buÜrtth¸ãeG irworà kcangiveexceG s qs#ivelylargeeG s timÃaÀ tµUesüandi#s¡R ofÆ[limitµUeG dap¸ãpãliñÆcabilityÿ*ª.Æ[AÆ>morefuÜrn¸ãdamen±ÇtalÆ[probãlemi#spG olymorphi#sm:intUh¸ãaÀ t¡R cas1Çe,ã¾µn²vÿqÇar*«ieG switUhth¸ãeins tan±ÇtiaÀ tion,sotUhenotionofcompuÜrtingã¾as#inÜrglevÿqÇalue¡R forUUiti#snons1Çense.¡a Nev¸ãe
«rtUheleG s qs,Æforhigh¸ãerordÕTerequaÀ t¸ãionswhiñÆchdonotdÕTep#endontUhe xpG oin±Çtà s¡R of1tUh¸ãeG irfuÜrnctionÃalparametµUe
«r s,te
«rmbas1ÇeG d xpoin±Çt¸ãinÜrgworà kswellandcanb#e¡R tUhÃousan¸ãdsäoftimeG sche qap#e
«rtUhanus#inÜrgf*«ron±Çtie
«r s.SuchequaÀ tionscanb#egene
«raÀ tµUeG d,¡R forÕexampãle,f*«romtUh¸ãeforwardsab qs tractionsofÁmap²andÁfilter²([Sew948ç],Section¡R 4.3.5). HÙR »InÄëdÎîefenceof r-stÄëorde Dranº}alys(äis²Thi#s%«pape
«rargueG sagains thigh¸ãerordÕTer¡R anÃalys1ÇeG s.^ÅWh¸ãenmod¸ãulesarealsot¸ãaken^Åin±ÇtÜroaccoun±Çt,tUh¸ãenuÜrmÿ|qb#e
«rofdÕTeG signcon-¡R s train±Çtà só§b#ecom¸ãeG sintÜroãle
«ra¸ãble.ó§Cansuchas tµUepb#ejust¸ãi eG d?Wÿ*ªell,takeninawidÕTe
«r¡R con±ÇtµUext,9:mÃayb#e.High¸ãe
«rordÕTerfuÜrnct¸ãionsdÕTefe qaÀ tadvÿqÇanceG dcodÕTegen¸ãe
«raÀ tion9:tµUech-¡R niqueG s,Zlik¸ãear*«itycheckavoidÜrance,unÿ|qbG o¸ãxingan¸ãdargum¸ãen±Çtà sinregi#s tµUe
«rs,Zsince¡R tUh¸ãey®repreG s1Çen±ÇtcallstÜrocompãletµUelyunkno¸ãwnfunct¸ãions.AÿqÇugus tà s qson [Aug93]®sug-¡R geG s tà s>tUh¸ãaÀ tcallinÜrgaknownfuÜrnctionco qs tà shalfasmUuchascallinÜrganunkno¸ãwn¡R on¸ãe.¡a Th¸ãe ô(Haskell)compile
«rcommUuÜrnitygotÜrocons#idÕTe
«rabãletrouUbletÜrogetr*«idof¡R callsUUtÜrohigh¸ãe
«rordÕTerfuÜrnct¸ãions.Fÿ*ªorexampãle:¦X@»{c ²Simpãle non-recur s#iv¸ãecomÿ|qbinÃaÀ tÜrorslik¸ãeÁ(.)²andÁthenSѲareinlineG d(inGlasgow¡c Hask¸ãell). À gÌ\ ý¯3¤ 2Ì\ ýäÜ2@»{= ²PreludÕTeuDfuÜrnct¸ãionswhiñÆchpas qsfuÜrnctionÃalparametµUe
«r salonÜrgunc¸ãhangeG d,uDlike¤ = ÁmapUU²an¸ãdÁfoldr²,areuÜrnfoãldÕTeG dtoformsp#ecialis1ÇeG dUUv¸ãe
«r sions(inYÿ*ªaleHask¸ãell).©
E2@»{= ²Ov¸ãe
«rloadÕTeG düefuÜrnctionsaresp#ecialis1ÇeG daÀ ttUh¸ãeirus1Çeins t¸ãances,aÀ tle qas twitUhin¡= s#inÜrgleÚÈmoG d¸ãules(Glasgo¸ãwandChalme
«r s).Thi#savoidsagre qaÀ tdÕTealoftUh¸ãe¡= high¸ãe
«ruGordÕTermÃac¸ãhine
«rywhiñÆchi#softµUenas qsoG ciaÀ teduGwitUhimpãlem¸ãen±ÇtaÀ tionsuGof¡= o¸ãve
«rloadinÜrg.Ï, Nelan [Nel91¸ç]ìødÕTeG sõTcr*«ib#esaÀ tsom¸ãelenÜrgtUhtµUechniqueG sforwhaÀ thetµUe
«rmeG dÄ rsti c-¡, ation²:æltUh¸ãeaÿuÜrtomÃaÀ tiñÆcælremovÿqÇalofhighe
«rordÕTerfuÜrnct¸ãions.AltUhÃoughcon¸ãve
«r s#ionælof¡, high¸ãe
«r-ordÕTeriprogramstÜro r st-orde
«rii#s,ingen¸ãeral,impG o qss#ibãle,iprogramm¸ãer s,b¸ãy¡, an¸ãd83large,us1Çehighe
«r-ordÕTer#neG s qs83ince
«rtainidiomÃaÀ tiñÆcwayswhiñÆchÄarÿ}'e²amenÃabãletÜro¡, r st¸ãi caÀ tionýDus#inÜrgNelan'smÃac¸ãhine
«ryÿ*ª.ýDThismÃac¸ãhine
«ryÿ*ª,ýDcomÿ|qbineG dwitUhaggres qs#iv¸ãe¡, inlininÜrg,´canb#eremÃarà kñÆa¸ãbãlye ective.EvenwitUhÃouÜrtus#ing r st¸ãi caÀ tion,´mUuchof¡, tUh¸ãeUUoptimi#s1ÇeG dcodÕTede qalÜrtwitUhins#ideGlasgo¸ãwHaskelli#spurely r stordÕTe
«r.¦; Fÿ*ªromÐAas tr*«iñÆctn¸ãeG s qsanÃalys#isÐApoin±Çtofview, r stÐAordÕTe
«ranÃalys#isÐAh¸ãastwomÃa 8jor¡, advÿqÇan±Çt¸ãageG s: 2@»{= ²FixpG oin±Çt¸ãinÜrg¸Ôi#se qasie
«r.Th¸ãef*«ron±Çtie
«r salgor*«itUhmruÜrnsre qasonÃabãlyquiñÆcklyfor¡= r stñRordÕTe
«rexampãleG s ([Sew948ç],Sect¸ãion3),andtµUe
«rmrewr*«itebas1ÇeG d xpoin±Çt¸ãinÜrg¡= i#sîáguaran±ÇtµUeeG dtÜrow¸ãorà k.Comput¸ãingcompãletµUefunct¸ãiongraphsdo#eG snotlook¡= quitµUeÊsobadintUh¸ãe r stÊordÕTe
«rcas1Çe,anddoinÜrgsomÃakeG smod¸ãulese qas#ie
«rtÜro¡= dÕTe qalUUwitUh.¦2@»{= ²P¸ãoãlymorphiñÆc6Ègene
«rali#saÀ tiongiveG sexactresulÜrtà s.MonomorphiñÆcanÃalys#isan¸ãd¡= ità sUUaÀ tÿtµUen¸ãdÜran±ÇtmoG dule-relaÀ tµUedUUprobãlemscanb#eavoidÕTeG den±Çtirelyÿ*ª.%¿, Ó3
Th e Defr9ive` dDes0 ign $Y, »3.1 üOv®9e Drview$Y, ²Cons#idÕTe
«r*«inÜrgtUh¸ãedeG s#igncons train±Çtà s,itlookslik¸ãea r st-ordÕTe
«r,poãlymorphiñÆcanÃa-¡, lys#isïcompuÜrt¸ãingcompãletµUe xeG dpoin±Çtà smigh¸ãtformapãlaÿus#iblebas#isforaw¸ãorà kinÜrg¡, sys tµUem,çksotUhi#siswh¸ãaÀ thasb#eencons tructµUeG d.AÿqÇb qs tractin±Çte
«rpret¸ãaÀ tionçkproG duces¡, tµUe
«rmsâinwh¸ãaÀ tcanb#econsidÕTe
«reG dtÜrobeana¸ãb qs tractlamÿ|qbG dÜra-calculus,and xpG oin±Çt-¡, inÜrgõHi#sdon¸ãewitUhatµUe
«rm-rewr*«iteõHsys temwhiñÆc¸ãhtransformss1ÇemÃan±ÇtiñÆcallyequivÿqÇalen±Çt¡, tµUe
«rmsUUtÜrosyn±Çt¸ãactiñÆcallyUUidÕTentiñÆcalUUnormÃalforms.¦; Th¸ãeXanÃalys1Çe
«rformspartoftUheGlasgowHaskellcompile
«r,andop#e
«raÀ tµUeG sona¡, dÕTeG sugared´£Hask¸ãellformloG o qs1Çelyrefe
«rredtÜroasCore.Coreallo¸ãwslamÿ|qbdÜratµUe
«rms,¡, ap¸ãpãliñÆcaÀ tions,íalitµUe
«rals,loG calbin¸ãdinÜrgs,one-levelpaÀ tÿtµUe
«r#nmÃat¸ãchinÜrgía(Ácase²s)an¸ãdcon-¡, s tru¸ãctÜror¬ÒappãliñÆcaÀ tions.Typ#einformÃaÀ tionsuppãlieG dbypreviouscompile
«rphas1ÇeG s¡, m¸ãe qans ftUhetyp#e(andhencetUheab qs tractdomÃain)assoG ciaÀ tµUedwitUhev¸ãe
«rysub#ex-¡, preG s qs#ion(\iskno¸ãwn.TheCoretreei#sannotaÀ tµUeG dwitUhth¸ães tr*«iñÆctneG s qsinformÃaÀ tion¡, compuÜrtµUeG d,Á^mÃakingita¸ãvÿqÇailabãletÜrosuUb qs1Çequen±ÇttransformÃaÀ tionpas qs1ÇeG s,andtÜrotUhe¡, in±ÇtµUe
«rf#ace-pr*«int¸ãinÜrgbmÃachineryÿ*ª,bsootUh¸ãermoG d¸ãulesbcanknowabG ouÜrttUhes tr*«iñÆctneG s qsof¡, fuÜrnct¸ãionsUUintUhi#sone.
¦b gÌ\ ý¯3¤ 2Ì\ ýäÜR »3.2 üTh®9eÕTab µs-tractin¦ tª"e Drpreta¶ftion³R ²AÿqÇb qs tract)in±ÇtµUe
«rpret¸ãaÀ tionsfors tr*«iñÆctneG s qsanÃalys#ish¸ãavehi#s tÜror*«iñÆcallybeencaÀ tµUegor-¤ R i#s1ÇeG dBasforw¸ãardorbackward [Hug90 >],alÜrtUhÃoughth¸ãeapp#e qaranceofrelaÀ tionÃalana-¡R lys1ÇeG sûi#sno¸ãwbãlurr*«inÜrgtUhaÀ tdi#s tinction.BackwardanÃalys1ÇeG sgene
«raÀ tµUeinformÃat¸ãion¡R a¸ãbG ouÜrtÞáfunctionÞáargumen±Çtà sÞágivenknowleG dgeofsomeprop#e
«rtyoftUheappãliñÆcaÀ tion¡R asÞawhÃoãle.Fÿ*ªorexample,bac¸ãkwardÞs tr*«iñÆctneG s qsanÃalys#isofanµn²-arguÜrm¸ãen±Çtfunct¸ãion¡R proG d¸ãucesH3µn²mÃap qs,on¸ãeforeac¸ãharguÜrmen±Çt,mÃappinÜrgdÕTemÃandonanappãliñÆcaÀ tiontÜro¡R dÕTemÃan¸ãdñ»one qacharguÜrmen±Çt.AstUhi#simpãlieG s,th¸ãefuÜrndamen±Çtalñ»ab qs tracten±ÇtitieG sare¡R pG oin±Çtà s inlaÀ tÿt¸ãiñÆces,wh¸ãe
«redi eren±ÇtpG ointà sdÕTenotµUedi e
«rentdÕTemÃan¸ãdsor\neeG dÕTed-¡R n¸ãeG s qs"forsomedÜraÀ tas tructure.Iti#susualtÜro(aÀ tle qas tpG otµUen±Çtially)allowe qach¡R di e
«ren±Çt*çconcretµUet¸ãyp#etÜrohaveità sownlaÀ tÿtiñÆceofab qs tractdÕTemÃands,inordÕTe
«rtUhaÀ t¡R w¸ãeUUcandodÕTetaileG danÃalys1ÇeswitUhdÜraÀ t¸ãas tructureG s.© PWa AlÜrtUhÃoughÛth¸ãe r ststr*«iñÆctn¸ãeG s qsanÃalys1Çesw¸ãe
«reoftUheforwardstyp#e,laÀ tµUe
«rdÕTe-¡R v¸ãelopmen±Çt{TsuggeG s tµUedbac¸ãkwardsanÃalys#ismigh¸ãtbequiñÆc¸ãke
«randgiveas#impãle
«r¡R tre qaÀ t¸ãmen±Çt$7ofpG oãlymorphi#sm,an¸ãdpractiñÆcalworà ks1ÇeemstÜrob#e qartUhisouÜrt ([Sew948ç],¡R Sect¸ãioníâ5).Thefewpap#e
«r sshÃowinÜrghÃows tr*«iñÆctneG s qsinformÃaÀ tioncanb#eus1ÇeG dtÜro¡R gen¸ãe
«raÀ tµUec&b#etÿterc&coG dÕTe [PJ93ñË,Hal93 ªG]alleitUh¸ãe
«rsugges torimpãlytUh¸ãaÀ tbackwards¡R informÃaÀ t¸ãionF.i#swhaÀ ti#sactuallyus1Çeful.Tÿ*ªakentÜrogetUhe
«r,tUhecas1ÇeforbuildinÜrga¡R bac¸ãkwardsUUab qs tractin±ÇtµUe
«rpretaÀ tions1Çeemsove
«rwhelminÜrg.¦a Spaceäblimit¸ãaÀ tionsprecludÕTemUuchdi#sõTcus qsionoftUh¸ãeab qs tractin±ÇtµUe
«rpretaÀ tion.¡R Suce¾±ittÜrosaytUh¸ãaÀ titi#sfairlycon¸ãven±ÇtionÃal:¾±tUheove
«ralls tructurei#ssimilartÜro¡R tUh¸ãaÀ tpreG s1Çen±ÇtµUedb¸ãyJohnHugheG sin [Hug90 >],alÜrtUhÃoughth¸ãemechani#smfordÕTe qalinÜrg¡R witUh¸ØdÜraÀ t¸ãas tructureG s,cons tructÜrors¸Øandcas1ÇetµUe
«rmsi#sdi eren±Çt.AswitUhan¸ãypurely¡R bac¸ãkward¬
anÃalys#is,high¸ãe
«r-ordÕTeranÃalys#isisimpG o qss#ibãle,sow¸ãenÃaivelyas qsuÜrmetUhaÀ t¡R allUUuÜrnkno¸ãwnfunct¸ãionsdonotdÕTemÃandtUheG irarguÜrmen±Çtà saÀ tall.¦a Man¸ãypbackwardab qs tractin±ÇtµUe
«rpretaÀ tionsgotÜroagre qaÀ tdÕTealoftrouUbãletÜromoG dÕTel¡R dÜraÀ t¸ãas tructureG swell,tUhe
«reÕTbyinducinÜrgcons#idÕTe
«rabãlecompliñÆcaÀ t¸ãionintUhemÃachine
«ry¡R whiñÆc¸ãh×dÕTe qalswitUhdÜraÀ tas tructureG s{cons tructÜrorfunct¸ãionsandÁcase²s.Fÿ*ªortuÜrnÃaÀ tµUely,¡R tUh¸ãeYpreG s1Çen±ÇtaÀ tioncanb#esimpãli eG db¸ãytUheob qs1Çe
«rvÿqÇaÀ tiontUhaÀ t,providÕTeG dtUheab qs trac-¡R t¸ãion»nofÁcase²sandcons tructÜrorfunct¸ãionsob#eysce
«rtaincons train±Çtà s,itdo#eG sn'tmÃaÀ t-¡R tµUe
«r <aÀ tallwh¸ãattUh¸ãeyare.Soth¸ãebackwardsab qs tractioncanb#especi eG dwitUhÃouÜrt¡R sayinÜrgiDan¸ãytUhingmUu¸ãchabG ouÜrtdaÀ t¸ãas tructureG s.SuUb qs1Çequen±ÇtparametµUe
«r*«i#saÀ tionsof¡R it?ïproG d¸ãucecompãletµUe,worà kñÆabãleab qs tractin±ÇtµUe
«rpretaÀ tions,anddi e
«ren±Çtparamet-¡R e
«r*«i#saÀ t¸ãions7canproG ducein±ÇtµUe
«rpretaÀ tionsgivinÜrgve
«rydi eren±Çtlev¸ãelsofdÕTetailfor¡R dÜraÀ t¸ãaºs tructureG s.Thi#smod¸ãularapproachandsomeparametµUe
«r*«i#saÀ tionsofitare¡R dÕTev¸ãelop#eG dUUin [Sew948ç],Sect¸ãion5;weouÜrtUlineonesuchparametµUe
«r*«i#saÀ tionshÃortUlyÿ*ª.¦a An'impG ort¸ãan±Çtfe qaÀ tureoftUheab qs tractioni#stUhaÀ tsuitabãleparametµUe
«r*«i#saÀ tions¡R proG d¸ãuceçpoãlymorphiñÆcallyin¸ãvÿqÇar*«ian±ÇtintµUe
«rpret¸ãaÀ tions.çPoãlymorphiñÆcinvÿqÇar*«iancef#acil-¡R it¸ãaÀ tµUeG sÙs1ÇeparateÙcompilat¸ãion,asdi#sõTcus qs1ÇeG dinSection 2.3,anditalsome qanstUhes#ize¡R of tµUe
«rmsgen¸ãeraÀ tµUeG db¸ãy(hence,tUheco qs tof Ç )ab qs tractin±ÇtµUe
«rpretaÀ tioni#snotrelaÀ tµUeG d¡R tÜroÃ6tUh¸ãeins tan±ÇtiaÀ tion.Thi#sisinmÃarà k¸ãeG dcon±Çtras ttÜro,forexampãle,Wÿ*ªadle
«r'sor*«iginal¡R non-
aÀ t¢*in±ÇtµUe
«rpret¸ãation [Wÿ*ªad87 ],¢*inwhiñÆchab qs tractionofÁcase²expreG s qs#ionscould¡R gen¸ãe
«raÀ tµUektermskwhÃo qs1Çes#izeG sgro¸ãwexpon¸ãen±ÇtiallykwitUhth¸ães#izeofth¸ãeins tan±ÇtiaÀ tinÜrg¡R t¸ãyp#eG s.¦a Bac¸ãkwards{s tr*«iñÆctneG s qsanÃalys1Çesw¸ãorà k,inas1Çense,b¸ãydÕTetµUectinÜrgf*«reevÿqÇaria¸ãbãleG sin ¹ø gÌ\ ý¯3¤ 2Ì\ ýäÜ, ²expreG s qs#ions.õBecaÿus1Çemos tvÿqÇar*«ia¸ãbãleG sdonotapp#e qarf*«reeinmos texpreG ss#ions,a¤ , nÃaiv¸ãeÝâanalys#iswilltµUen¸ãdtÜrogene
«raÀ tµUemÃanyhUugetµUe
«rmswhiñÆchtr*«iviallyreG ducetÜro¡, ¸?²,h®tUh¸ãepG oin±ÇtdÕTenotinÜrgze
«rodÕTemÃand.Still,gene
«raÀ tinÜrgtUheG s1ÇetUhinÜrgs,th¸ãenreG ducinÜrg¡, tUh¸ãem,ÕtakeG se ort,anditproveG svÿqÇaluabãletÜroplan±Çtce
«rt¸ãainkeyrewr*«itµUeruleG sins#idÕTe¡, tUh¸ãeaab qs tractin±ÇtµUe
«rpreteraità s1ÇelftÜros#idÕTeG s tµUeptUh¸ãeproces qs{atr*«ivialmodi caÀ t¸ãiontÜrotUhe¡, coG dÕTe.îIncorporaÀ t¸ãinÜrgfouroftUhemo qs tpG opulars#impãlerewr*«itµUeruleG sdramÃaÀ tiñÆcally¡, cuÜrtà sÂtUh¸ães#izeofgene
«raÀ tµUeG dte
«rmsan¸ãdsoexpandstUheranÜrgeofsourcefunct¸ãionsfor¡, whiñÆc¸ãhUUab qs tractin±ÇtµUe
«rpretaÀ tioncanb#edoneinre qasonÃabãletime. p, »Th®9eÖWHe µad-Str1iï¥ctParametª"e Dr1i(äsa¶ftionLÛ²Ournimpãlem¸ãen±ÇtaÀ tionus1ÇeG sapo¸ãwe
«rful¡, param¸ãetµUe
«r*«i#saÀ tion½ dÕTeG signeG d½ tÜrogiv¸ãedÕTetaileG dresulÜrtà sfortUh¸ãevÿqÇas tmÃa 8jor*«ityofdÜraÀ ta¡, dÕTeclaraÀ t¸ãionsòËaHaskellprogramme
«rcouldre qasonÃabãlyus1Çe.Thi#sisincon±Çtras t¡, tÜroÎÒtUh¸ãeoftµUen-limiteG dÎÒrangeoft¸ãyp#eG swhiñÆchotUhe
«rimpãlemen±ÇtaÀ tionscandÕTe qalwitUh,¡, som¸ãetimeG sDíjus tli#stà s [HH91 ],som¸ãetimeG sDíafulle
«rranÜrgeofdaÀ t¸ãadÕTeclarat¸ãionswhe
«re¡, cons tru¸ãctÜrorÌêargumen±Çtà sÌêmÃayb#eoneoftUhetyp#evÿqÇar*«iabãleG s,orarecur s#ivecalltÜrotUhe¡, t¸ãyp#e,\ buÜrtnotUhingels1Çe ([Sew918ç],Sect¸ãion6).TheparametµUe
«r*«i#saÀ tioni#sdÕTeG sign¸ãed\ tÜro¡, dÕTetµUect¶.h¸ãe qads tr*«iñÆctneG s qs.Wÿ*ªewan±ÇtµUeG dtÜromoveawayf*«romtUheprotÜrotyp#es tageand¡, cre qaÀ tµUeäÍananÃalys#isäÍwhiñÆc¸ãh(1)giveG sus1ÇefulinformÃaÀ tionfor,e ectivelyÿ*ª,any(non-¡, fuÜrnct¸ãionÃally-typ#eG d){codÕTef*«ragm¸ãen±Çt,and(2)gene
«raÀ tµUeG sinformÃat¸ãiontÜrosuppG ortall¡, kno¸ãwn[ s tr*«iñÆctneG s qs-relaÀ tµUedtransformÃaÀ t¸ãions{hencetUheneeG dforhe qad-s tr*«iñÆctneG ss.¡, Th¸ãeUreG sulÜrti#stUhaÀ ttUheparametµUe
«r*«i#saÀ tioni#sraÀ tUhe
«rcompãliñÆcaÀ tµUeG d,sowewilltryand¡, con¸ãveyUUtUheeG s qs1Çen±ÇtialidÕTe qaswitUhanexampãle. j; Th¸ãee¶parametµUe
«r*«i#saÀ tiondÕTe
«r*«iveG sf*«romBur#n'sidÕTe qaofevÿqÇaluaÀ tiontransforme
«r s.¡, [Sew918ç]Ipgen¸ãe
«rali#s1ÇeG dtUhistÜrow¸ãorà kforawidÕTe
«rrangeofdaÀ t¸ãatyp#eG s,and [Sew948ç]¡, furtUh¸ãe
«r¯extµUendÕTeG dittÜrodetµUecth¸ãe qad-s tr*«iñÆctneG ss.¯Letuscons#idÕTe
«rlis tà s.Lis tà sa¸ãb qstract¡, tÜroÆtUhreecoãllect¸ãionsofpG oin±Çtà s:botÿtÜrom(ÁB²),dÕTenot¸ãingnoevÿqÇaluaÀ t¸ãion,tUhes1ÇetÁW[a]²,¡, dÕTenot¸ãinÜrgð7evÿqÇaluaÀ tiontÜrowe qakhe qadnormÃalform,andtUhen,ifaconscelli#spro-¡, d¸ãuceG d,Î|evÿqÇaluaÀ tionoftUhe r stelem¸ãen±ÇtwitUhÁa²,andtUhes1ÇetÁS[a][b]²,dÕTenotinÜrg¡, evÿqÇaluaÀ t¸ãion4²oftUhecompãletµUes tructureoftUheli#s t,evÿqÇaluaÀ tionoftUhe r st4²elemen±Çt¡, witUhÁa²an¸ãdallth¸ãereG s twithÁb².Ifw¸ãemoG dÕTelin±ÇtµUege
«r swithth¸ãetwoevÿqÇaluaÀ tÜror sÁ0¡, ²(no-evÿqÇal)UUan¸ãdÁ1²(eval),tUh¸ãelaÀ tÿtiñÆceforÁ[Int]²b#ecomeG s:Y© Ù?ÁS[1][1]¡ Óÿ /$¿ë\¡ ¹¿¯S[1][0]?ñS[0][1]¡ ¾ÿ¬/ÿô\ î/¡ ©ÿ¸W[1]?ñS[0][0]¡ ¾ÿ¬\ÿô/¡ Ä?©W[0]¡ ο£|¡ ο£BC?; ²Fÿ*ªorÛ exampãle,ÁW[1]²i#sah¸ãe qad-s tr*«iñÆctevÿqÇaluaÀ tÜror,evaluaÀ t¸ãinÜrgtow¸ãe qakhe qadnormÃal¡, form,
]an¸ãdtUhehe qadÁInt²tÜroG o,ifpo qss#ibãle.
]ÁS[0][1]²m¸ãe qanevÿqÇaluaÀ tµUetUheen±Çtireli#s t¡, s tru¸ãcture,u¤andallÁInt²sexcepttUhe r st.ÁSuY²(Stru¸ãcture)evÿqÇaluaÀ tÜror smÃain±ÇtaintUhe¡, h¸ãe qad/non-head/©elemen±Çtdi#s tinctionsotUhaÀ t,forexampãle,whenali#s tiskno¸ãwntÜro Òü gÌ\ ý¯3¤ 2Ì\ ýäÜR ²b#e*cdÕTemÃan¸ãdeG dbotUhtÜroÁW[1]²an¸ãdÁS[0][1]²,weknowwecandÕTemÃandtUheli#s ttÜro¤ R ÁS[1][1]ÒDz(whiñÆc¸ãhi#sÁW[1]¸t3ÆÁS[0][1]%ó±²).InotUhe
«rwords,tUhi#sme qanstUhehe qad-elemen±Çt¡R informÃaÀ t¸ãion.{onaÁW.q²(WHNF)evÿqÇaluatÜror.{i#snot(n¸ãeceG s qsar*«ily)obãlitµUe
«rateG d.{wh¸ãeniti#s¡R comÿ|qbin¸ãeG dUUwitUhanÁS²evÿqÇaluaÀ tÜror.© $a Th¸ãe ªsõTchemegene
«rali#s1ÇeG sinsev¸ãe
«raldirections.Recur s#ivetyp#eG switUhmoreth¸ãan¡R on¸ãe.Ëtyp#evÿqÇar*«iabãlearemoG dÕTelledwitUhth¸ãesameÁB²/ÁW²/ÁS.²coãllectionofpG oin±Çtà s,witUh¡R tUh¸ãe(¸ÁW(²andÁS(²pG oin±Çtà scont¸ãaininÜrgmUult¸ãipãleparametµUe
«r*«i#sinÜrgpG oin±Çtà s,raÀ tUh¸ãe
«rth¸ãanjus t¡R on¸ães8andtworeG sp#ectivelyaswitUhli#s tà s.LaÀ tÿtiñÆceG sfornon-recur s#ivetyp#eG somittUhe¡R ÁS¹u²pG oin±Çtà s,¹buÜrtareotUh¸ãe
«rwi#s1ÇeidÕTent¸ãiñÆcal.Cons tructÜrors¹oftµUenhave\cons tan±Çt"typ#eG s¡R {$tUhÃo qs1Çenotm¸ãen±ÇtioninÜrg$typ#evÿqÇar*«iabãleG s{forarguÜrmen±Çtà s,orhavearguÜrmen±Çtà sin¡R whiñÆc¸ãhßtUhetyp#evÿqÇar*«iabãleG sandrecur s#iveins tanceG softUhetyp#eapp#e qarbur*«ieG dinsidÕTe¡R arbitrary§lev¸ãelsof\in±ÇtµUe
«rveninÜrg"typ#eG s.ManyprogramsalsoempãloymUuÜrtually¡R recur s#iv¸ãesÐtypeG s.sÐAlltUh¸ães1ÇecaseG scanb#eh¸ãandled,sÐalÜrtUhÃoughth¸ãeymÃaketUhepreci#s1Çe¡R dÕTet¸ãails<ÓoftUheparametµUe
«r*«i#saÀ tionraÀ tUhe
«rcompãliñÆcaÀ tµUeG d.Thi#sparametµUe
«r*«i#saÀ tion,and¡R tUhusUUth¸ãedÕTe
«r*«iveG din±ÇtµUe
«rpretaÀ tion,i#spG oãlymorphiñÆcallyinvÿqÇar*«ian±Çt. U´R »3.3 üFixpQÇoin¦ t®9in×gU´R ²OnceTw¸ãeregardtUheouÜrtʪputToftUheab qs tractin±ÇtµUe
«rpreterTasatµUerminsom¸ãe\ab qs tract¡R lamÿ|qbG dÜraY$calculus",an¸ãdweknowwewan±ÇttÜrocomparesuchtµUe
«rmsfors1ÇemÃan±ÇtiñÆc¡R equalit¸ãyÿ*ª,Ƕits1ÇeemsnÃaÀ turaltÜroinveG s tigaÀ tµUetUhepG o qss#ibilityǶofbuildinÜrgas1ÇemÃan±ÇtiñÆcs-¡R preG s1Çe
«rvinÜrgàtransformÃaÀ t¸ãionengin¸ãe.Wÿ*ªegiveonlytUhebareG s tsuÜrmmÃaryhe
«re{for¡R dÕTet¸ãails,UUs1Çee [Sew948ç],Section4.SomeimpG ortan±ÇtpG ointà sare:DX@»{c ²Tÿ*ªe
«rms+arebuilÜrtf*«romasmÃalls1Çelect¸ãionofcons tructions.Lamÿ|qbG dÜras,vÿqÇar*«iabãleG s¡c an¸ãdBappãliñÆcaÀ tionsin±ÇtroG duceandrefe
«rtÜrovÿqÇar*«iabãleG s,andappãlyab qs tractfuÜrnctions¡c tUhusIform¸ãeG d.\Cons tructionÃal"tµUe
«rmsdÕTenotinÜrg¸?²,tUheliftinÜrgofsomeotUhe
«r¡c tµUe
«rmMèan¸ãdtupãlinÜrgareus1ÇeG dtobuildvÿqÇalueG sinliftµUedan¸ãdprod¸ãuctMèlaÀ tÿtiñÆces,Mèand¡c tUh¸ãe
«re=areacorreG spondinÜrg=s1Çetof\dÕTeG s tructionÃal"tµUe
«rmswhiñÆchtµUeG s tlifteG d-laÀ tÿt¸ãiñÆce¡c pG oin±Çtà s ûfor¸?²,uÜrn¸ãdoliftinÜrgs,ands1ÇelectcompG onen±Çtà sf*«romtupãleG s.FinÃallyÿ*ª,joins¡c an¸ãdUUmeetà softµUe
«rmsarealloweG d.¦X@»{c ²Th¸ãeLdtµUe
«rmsares tronÜrgly-typ#eG d,usinÜrgwh¸ãaÀ tamoun±Çtà stoana¸ãb qs tractve
«r s#ion¡c ofîõtUh¸ãeMilne
«r-Hindleytyp#esys tµUem.Wÿ*ªell-formeG dtµUe
«rmsmUus tb#ewell-typ#eG d,¡c an¸ãdAmUus talsob#emonotÜroniñÆcwithreG sp#ecttÜroth¸ãeG irf*«reevÿqÇaria¸ãbãleG s.Thetyp#e¡c sys tµUem[3incorpG oraÀ tes[3anot¸ãionofparametr*«iñÆcpG oãlymorphi#sm.Theab qs tractin-¡c tµUe
«rpreterÔìexpãloità stUhi#sb¸ãymÃappinÜrgpG oãlymorphi#smintUhesourceprogramon±ÇtÜro¡c pG oãlymorphi#sm ËintUh¸ãeab qs tracttµUe
«rms,whiñÆchgiveG spoãlymorphiñÆcanÃalys#is Ëes-¡c s1Çen±Çt¸ãiallyUUforf*«ree.¦X@»{c ²Th¸ãeY3rewr*«itµUe
«rprop#e
«rconsis tà sofasõTc¸ãheG dulinÜrgY3mechanism,Y3whiñÆchs1Çelectà sre-¡c dÕTexeG s6an¸ãdappãlieG srewr*«itµUerulestÜrotUh¸ãem,andtUherewr*«itµUeruleG stUhems1ÇelveG s.¡c Th¸ãeasõTcheG dule
«rdÕTetµUermin¸ãeG stUhereG ductionordÕTe
«r,whiñÆchhasamÃa 8jorb#e qar*«inÜrgon¡c p#e
«rformÃance.·Th¸ãerearea¸ãbG ouÜrt ftyruleG s,mÃanywitUhcompãlexs#idÕTeconditions.¡c Since®²tUh¸ãeruleG sarecodÕTedinHask¸ãell,tUheycanus1ÇetUhefullpG owe
«rofHaskell¡c paÀ tÿtµUe
«r#n-mÃat¸ãchinÜrg.íTherewr*«itµUe
«ri#scompãliñÆcaÀ teG dsom¸ãewhaÀ tbytUheneeG dtÜropro-¡c pG ogaÀ tµUeaTan¸ãdus1ÇepartialknowleG dge(ie,i#s/isaTnot¸?²)oftUhevÿqÇalueG sofsuUbtµUe
«rms¡c inUUordÕTe
«rtÜrore qac¸ãhnormÃalform.
ç gÌ\ ý¯3¤ 2Ì\ ýäÜ, »Makin×gt
Th®9erewr1itª"e DrworÛ2kwellfʲOnce« anormÃalformh¸ãasb#eendÕTecideG d« onand¤ , suit¸ãabãle.çrewr*«itµUeruleG sgen¸ãe
«raÀ teG d,tUh¸ãe
«rei#ss tilltUhei#s qsueofhÃowtUheruleG saretÜrob#e¡, ap¸ãpãlieG d.ÂThi#sboilsdo¸ãwntÜroaprobabãly-irreconcilableÂcon
iñÆctb#etweeninne
«rmo qs t-¡, r stÇcan¸ãdouÜrtµUe
«rmo qs t- rstÇcrewr*«itinÜrg.BotUhs traÀ tµUegieG sworà kwellmUuchoftUhetime,¡, buÜrt¥þbG otUhalsosu e
«rf*«rompaÀ thÃoãlogiñÆcalin±ÇtµUe
«ract¸ãionsb#etweentµUe
«rmsemitÿteG db¸ãy¡, tUh¸ãe°ab qs tractin±ÇtµUe
«rpreter°an¸ãdsomeoftUherewr*«itµUeruleG s.IntUheG s1ÇecaseG s,rewr*«it¸ãinÜrg¡, canpØt¸ãakeasmÃalltµUe
«rmandexpanditexpG onen±ÇtiallytÜroagigan±ÇtiñÆcin±ÇtµUe
«rmeG diaÀ te¡, tµUe
«rmÅnb#eforeempãlo¸ãyinÜrgsomeotUhe
«rruletÜroshr*«inkittoanotUh¸ãe
«rsmÃalltµUerm.Th¸ãe¡, e ectªñonp#e
«rformÃanceisdisas trous.Getÿt¸ãinÜrgroun¸ãdtUhi#sprobãlemrequireG sahybr*«id¡, reG d¸ãuctionYÐs traÀ tµUegywhiñÆc¸ãhtr*«iestÜroa¸ãvoidYÐknownpaÀ tUhÃoãlogiñÆcalcas1ÇeG s.Thi#sworà kswell,¡, alÜrtUhÃough'©dÕTecidingontUh¸ãespãlitrequireG sagre qaÀ tdÕTealofdÕTet¸ãaileG dinveG s tigaÀ tionin±ÇtÜro¡, tUh¸ãeUUpreci#s1ÇedynÃamiñÆcsofth¸ãereG ductionsys tµUemasappãlieG dtÜrore qali#s tiñÆcworà kloads.© Âó; Wÿ*ªaÀ t¸ãchinÜrgwÅtUherewr*«itµUe
«raÀ tworà kreve qaleG danotUhe
«rin±ÇtµUereG s t¸ãinÜrg,but,inretro qsp#ect,¡, uÜrnsurpr*«i#singÆfact:tUh¸ãeab qs tractin±ÇtµUe
«rpreter'sÆ\v¸ãoG cabulary"oftµUe
«rm-comÿ|qbinÃaÀ tions¡, emitÿtµUeG d
i#spart¸ãiñÆcularlylimiteG d.Th¸ãesamesmÃallcoãllectionofidiomsoG ccur sove
«r¡, an¸ãdove
«ragain.SomeoftUheG s1Çeidiomsareextremelycommon,buÜrttUheyarealso¡, quitµUeõbig.Bigte
«rmsareap#erformÃancelia¸ãbility;õcons#is tµUen±ÇtUlysmÃallte
«rmsten¸ãdtÜro¡, giv¸ãe¬mUuchb#etÿtµUe
«rpe
«rformÃance.Th¸ãaÀ tmak¸ãeG sitaÀ tÿtractivetÜrocapturesuchidioms¡, inÔÿsp#ecial,n¸ãewtµUe
«rms,andadjus ttUherewr*«itµUeruleG saccordinÜrglyÿ*ª.Thi#sshÃouldbe¡, don¸ãeÕïspar*«inÜrglyÿ*ª,s#incetUhetµUe
«rmrewr*«ite
«rb#ecom¸ãeG scompãliñÆcaÀ teG db¸ãyhavinÜrgtodÕTe qal¡, witUhÓmulÜrt¸ãipãlerepreG s1Çen±ÇtaÀ tionsoftUhesametµUe
«rm.Still,captur*«inÜrgjus ttwocommon¡, idiomslik¸ãetUhi#shasgivenp#e
«rformÃancegainsve
«ryroughlyontUheordÕTe
«rof25¡, t¸ãimeG sUUforsom¸ãeinpuÜrtà s.¦; Ev¸ãen?witUhthi#str*«iñÆc¸ãke
«ryÿ*ª,?the?ab qs tractin±ÇtµUe
«rpreter?cansom¸ãetimeG s?emittµUermsso¡, large®ªtUh¸ãeyswamptUherewr*«itµUe
«r.IntUhi#ssit¸ãuaÀ tion®ªitish¸ãelpfultÜrodÕTevis1Çeaw¸ãaytÜro¡, pruÜrn¸ãeçtµUe
«rmssotUhemo qs timpG ortan±ÇtinformÃaÀ tioni#sretaineG d,whils tdramÃaÀ tiñÆcally¡, shr*«inkinÜrgªðtUh¸ãetµUe
«rm.Ofcour s1Çe,dÕTe ningwh¸ãaÀ tinformÃat¸ãioni#simpG ortan±ÇtandhÃow¡, safet¸ãy.i#spreG s1Çe
«rved.dÕTep#endsen±ÇtirelyontUheab qs tractin±ÇtµUe
«rpretaÀ tion.Fÿ*ªortUhi#skind¡, ofKÒs tr*«iñÆctn¸ãeG s qsanÃalys#is,KÒiti#ssafetÜrorepãlaceanytµUe
«rmby¸?²,s#ince¸?²charactµUe
«r*«i#s1ÇeG s\no¡, dÕTemÃan¸ãd".ÊòThesõTchemeempãloyeG dpruÜrneG stµUe
«rmsafte
«rasp#eci eG ddÕTeptUhofn¸ães tµUed¡, ÁWÚ8²orÚ[ÁS²cons tru¸ãctionshasb#eens1Çeen.ThisdÕTeptUh-bas1ÇeG dpruÜrning,whils tcrudÕTe,i#s¡, f*«requen±ÇtUlyä²e ect¸ãive,buÜrtdo#eG snotworà kwellforve
«rywidÕTe,shallowtµUe
«rms.Fÿ*ªurtUhe
«r¡, in¸ãveG s tigaÀ tion¤in±ÇtÜroclev¸ãe
«rer¤prunings traÀ tµUegieG s,an¸ãdtUheG irrelaÀ tionshiptÜrowidÕTening,¡, couldUUb#ew¸ãortUhwhile.!ÎÀ, »3.4 üIn¦ tª"e Drf(äacin×gÕTt
Th®9eab µs-tractin¦ tª"e DrpreterÕTan®9d xpQÇoin¦ tª"erÎÀ, ²AllÏ<impãlem¸ãen±ÇtaÀ tionwasdoneintUhelazyfuÜrnctionÃallanÜrguageHaskell.Pe
«rform-¡, ance5Kpro linÜrgrev¸ãe qaleG danimport¸ãan±Çtf#act:hÃowwelltUhesys tµUemasawhÃoãleworà ks¡, dÕTep#en¸ãdsmhe qavilyonhÃowmUuchoftUheab qs tractin±ÇtµUe
«rpreter'smouÜrtʪputtUh¸ãe xpG oin±ÇtµUe
«r¡, (h¸ãence,½mtUherewr*«itµUe
«r)neeG dstÜros1Çee.IftUhe xpG oin±ÇtµUe
«ri#sve
«rycleve
«ritmÃayignore¡, mo qs tɦoftUh¸ãein±ÇtµUe
«rpreter'sɦouÜrtʪput.Buts#incewr*«it¸ãingtUh¸ãein±ÇtµUe
«rpreterɦinHask¸ãell¡, mÃak¸ãeG s"ÝitdÕTeman¸ãd-dr*«iven,"Ýcleve
«r#neG s qsontUhe xpG oin±ÇtµUe
«r'spartsaveG sagre qaÀ tdÕTeal¡, ofe(exp#ens1ÇeintUh¸ãein±ÇtµUe
«rpretaÀ tionità s1Çelf.ItseemssafetÜrosaytUh¸ãaÀ tth¸ãep#e
«rformÃance¡, reG sulÜrtà suHreportµUedb#elo¸ãwcouldneve
«rhaveb#eenachieveG d,norevenapproacheG d, ý¢ gÌ\ ý¯3¤ 2Ì\ ýäÜR ²h¸ãadk7tUhein±ÇtµUe
«rpreterk7b#eenwr*«itÿtµUeninas triñÆctlanÜrguage,SML,forexampãle.Fÿ*ªutUh¸ãe
«r¤ R dÕTet¸ãailsUUareavÿqÇailabãlein [Sew948ç],Section4.© ÷a Th¸ãeØ commen±Çtà stUhreeparagraphsbackregardinÜrgidiomsandtUhetµUe
«rmrewr*«ite
«r¡R b#elieüÀamorefuÜrn¸ãdamen±ÇtalüÀdÕTeG s#ign
awwhiñÆchlimità sp#e
«rformÃance:s1Çer*«iousan¸ãd¡R extµUens#iv¸ãeQ¹shar*«inÜrglo qss1ÇeG s.Th¸ãeidiom-spotÿt¸ãinÜrgtr*«iñÆckgiveG sbigp#e
«rformÃancespeeG d¸ãup qs¡R pr*«imÃarily¸b#ecaÿus1Çeita¸ãvoids¸dupãliñÆcaÀ tionofarbitrar*«ilylargesuUbtµUe
«rms.ManyoftUhe¡R cas1ÇeG s=ÑoftUh¸ãeab qs tractin±ÇtµUe
«rpreter=Ñd¸ãupãliñÆcaÀ tete
«rmsin¸ãdi#sõTcr*«iminÃaÀ telyÿ*ª.AlltUhi#spG oin±Çtà s¡R tÜroÚÈan¸ãeeG dforexpãliñÆcitshar*«inÜrgintµUe
«rms:non-recur s#iveab qs tractÁlet²s.MoG difyinÜrg¡R tUh¸ãeÃËtµUe
«rmrewr*«ite
«rtÜrow¸ãorà kwitUhÁlet²ssoun¸ãdsleG s qstUhans traightforward,soitmight¡R b#ezuh¸ãelpfultÜrobG orrowkeyidÕTe qasf*«romtUhecall-by-neeG dlamÿ|qbdÜracalculusdÕTesõTcr*«ib#ed¡R in [AFMü^ÿ±+£²95'Õ]].¦a GoG od>+p#e
«rformÃancehinÜrgeG songen¸ãeraÀ tinÜrg>+smÃalltµUermsan¸ãdkeepinÜrgtUhemsmÃall¡R tUhroughÃouÜrt/<th¸ãeG irvÿqÇar*«iousmÃanÜrglings.IdÕTe qallyÿ*ª,tUh¸ães#izeofth¸ãeab qs tractin±ÇtµUe
«rpreter's¡R ouÜrtʪputFshÃouldb#epro¸ãpG ortionalFonlytÜrotUh¸ães#izeofth¸ãesourceprogram.Thi#sis¡R proba¸ãbãlyÑuÜrnre qali#s tiñÆc.Neve
«rtUheleG s qs,dÕTes#ign¸ãe
«r sofab qs tractin±ÇtµUe
«rpretaÀ tionswould¡R b#e>w¸ãelladvis1ÇeG dtÜros tr*«iv¸ãeto¸ãwards>tUhi#sgoal.Asanexampãle,PhilWÿ*ªadle
«r'sor*«i-¡R ginÃala"non-
aÀ ts tr*«iñÆctn¸ãeG s qsanalys#isa"sõTc¸ãheme [Wÿ*ªad87 ]gaveanin±ÇtµUe
«rpretaÀ tionofÁcase¡R ²expreG s qs#ionseHwhiñÆc¸ãhexpandsexpG onen±ÇtiallywitUhth¸ães#izeofins tan±ÇtiaÀ tinÜrgtyp#eG s.This¡R ren¸ãdÕTe
«r sÝitimpractiñÆcalforallbuÜrttUhetinieG s tprograms([Sew948ç],Section5.8).Our¡R bac¸ãkwardsåf*«rameworà ki#spG oãlymorphiñÆcallyinvÿqÇar*«ian±Çt,soitavoidstUhaÀ tpartiñÆcular¡R hÃorror,×õbuÜrtits t¸ãillhaspãlen±ÇtyofpG otµUen±Çtialforoptimi#saÀ tionus#inÜrgab qs tractÁlet²s.¡R Th¸ãevÒpG oin±ÇtoftUhi#sexampãleistUh¸ãaÀ t,withalitÿtlecare,mu¸ãchvÒofth¸ãe\expG onen±Çtialnes qs"¡R canUUb#eenÜrgin¸ãee
«reG dawayÿ*ª,givinÜrgsuUb qs tan±Çtialp#e
«rformÃanceben¸ãe tà s. è7R Ó4
Re` sulÐ tÔËsÑR »4.1 üInÕTt
Th®9esmº}allÑR ²Th¸ãe6wtµUechnoãlogydÕTeG sõTcr*«ib#eda¸ãbove6wwascons tructµUeG dins#idÕTeapurpo qs1Çe-builÜrtdÕTev¸ãel-¡R o¸ãpmen±Çt-`f*«rameworà k.Thef*«rameworà ki#saquiñÆck-and-dirtyimpãlemen±ÇtaÀ tionoftUhe¡R f*«ron±Çt&Åpartofacompile
«rforano¸ãverloadinÜrg-f*«ree&ÅsuUb qs1ÇetofHask¸ãell,dÕTeG s#igned&ÅtÜro¡R f#acilit¸ãaÀ tµUeúexpe
«r*«imen±ÇtaÀ tion.úA¤higher-ordÕTerúremovÿqÇaltransformÃaÀ tionintUhes tyle¡R of³LNelan [Nel91¸ç]allo¸ãws r st-ordÕTe
«r³LanÃalys1ÇeG sofprogramsmakinÜrgsuUb qs t¸ãan±Çtial³Lus1Çe¡R of Áhigh¸ãe
«r-ordÕTerfuÜrnct¸ãions.AllanÃalys1ÇeG swe
«redonemonomorphiñÆcallyÿ*ª,tÜromÃake¡R compar*«i#son¶ÛwitUhaforw¸ãardin±ÇtµUe
«rpretaÀ tionf#aire
«r.Fÿ*ªortUhebackwardsanÃalys1ÇeG s,¡R ofLþcour s1Çe,tUh¸ãe
«rei#snoin±Çtr*«insiñÆcre qasontÜrous1ÇemonomorphicanÃalys#is.LþFÿ*ªourinpuÜrtà s¡R w¸ãe
«reUUus1ÇeG d:gÛX@»{c ÁavlTree²:UUins1Çe
«rt¸ãionofitµUemsin±ÇtÜroanAþãVLtree(44lineG s).¦X@»{c Álife²:XÔLaÿuÜrnc¸ãhbury'simpãlemen±ÇtaÀ tionofConway's\life"s#imUulaÀ tion(311lineG s).¦X@»{c Áfft²:ðFÿ*ªas tfour*«ie
«rtransform,fromHartµUel'sb#enc¸ãhmÃarà ksuite [HL92a À](421¡c lin¸ãeG s).¦X@»{c Áida²:UUSoãlv¸ãeG stUhe15-puzzle,alsof*«romHartµUel'ssuite(728lin¸ãeG s).Mäa Álife²,MÁfft²an¸ãdÁida²aresuUb qs tan±ÇtialinpuÜrtà s.QuotµUeG ds#izesareaftµUe
«rins1Çert¸ãionof¡R suit¸ãabãleiÑpreludÕTefuÜrnct¸ãions.TheymÃakesuUb qs tan±Çtialus1Çeofhighe
«r-ordÕTeriÑfuÜrnctions, gÌ\ ý¯3¤ 2Ì\ þjà Íä?þ «ÑFÿ Ìorw´Cards à°EvÿhalTÿ Ìrans wHe KadStr-qiðÚct¤ Z˶ÐProgramHLÏ ff ff \Tim¾9eHLÏ ff ¸gÌReAÇs äidHLÏ ff ff ܤøTim¾9eHLÏ ff ý¹ReAÇs äidHLÏ ff ff!EåTim¾9eHLÏ ffA©¦ReAÇs äidYeP³5 ff U³1keÜavlTree(ÌLÏ ff ff;V`Ð9.58HLÏ ffc,É1514HLÏ ff ff Â0.23HLÏ ff ¬"öó3¼j¹ cmti9Þ197HLÏ ff ff Ì?¯Ð0.27HLÏ ff ðÃãÞ200¡ ÆÜlife(ÌLÏ ff ff2dÐ359.20HLÏ ff^Ë11203HLÏ ff ff Â2.01HLÏ ff ¬m´628HLÏ ff ff Ì?¯2.97HLÏ ff ðÃãÞ615¡ ÞÜfft(ÌLÏ ff ff6¶bÐ28.76HLÏ ffbÉ!Þ1473HLÏ ff ff ÂÐ6.38HLÏ ff §jÞ1473HLÏ ff ff Ì?¯Ð8.38HLÏ ff ì
ûÞ1524¡ ÞÜida(ÌLÏ ff ff6¶bÐ920+HLÏ ffW[54000+HLÏ ff ff Â9.32HLÏ ff §jÞ1725HLÏ ff ff Ì?¯Ð7.70HLÏ ff ì
ûÞ1734:³3, ÑTÿ Ìa´Cbá´le1.¬ßÐP¾9e ÞrformÈanceofabNstractin·¤tºîe Þrpreters¬ß(t¾9imeins. econds,reAÇs äidØenciesinKb¾9ytºîes).¤ , It¾9aliò×ci äs. eAÇd®2 guresin¾9diò×caÄÍtºîep äeNakres äidØenciesdØe n¾9edb¾9ypreprocesNs äinßgph¾9as. es,raÄÍtTh¾9e Þrth¾9an¡, a¾9bNstractí>in·¤tºîe ÞrpretaÄÍtionor xpAÇoin·¤tinßg.TheÑFÿ Ìorw´CardsÐanÈalys äisofÜidaÐdidnotcompå±letºîe¡, ev¾9enTin54megabytºîeAÇsofheNap."ó, ²whiñÆc¸ãh;vtUhe r st¸ãi e
«rhastÜroworà kquitµUehardtÜroremove,andwhiñÆchcaÿus1ÇeG stUheinpuÜrtto¤ , tUh¸ãeä7ab qs tractin±ÇtµUe
«rpreterä7pro¸ãp#ertÜrob#econsidÕTe
«ra¸ãbãlybiggertUh¸ãanth¸ãeuÜrn±ÇtransformeG d¡, sourceG s.© ¦ê; Th¸ãepNanÃalys1Çe
«rwaswr*«itÿtµUenins tandÜrardHaskell1.2,compileG dwitUhGlasgow¡, Hask¸ãellbS0.19\Á-O²",andruÜrnonaquiet64-megabytµUeSuÜrnSparc10/31running¡, SuÜrnOSv4.1.3.vOAgen¸ãe
«raÀ tionÃalgarbagecoãllectÜrorwasus1ÇeG d,andhe qaps#izeG swe
«re¡, s1ÇetyetÜrotryan¸ãdkeepgarbagecoãllectionco qs tà sb#elow10%,alÜrtUhÃoughforlarge
«rreG s-¡, idÕTencieG sÎ.tUhi#sisdiculÜrt.Tim¸ãeG sun¸ãdÕTe
«rs#ixtys1Çecondsareave
«rageG dove
«rs#ixruÜrns.¡, Th¸ãeyKfincludÕTetUhepreproG ces qs#inÜrgKftimesKfofpar s#inÜrg,dÕTeG sugar*«ing,t¸ãyp#echecking,Kfmono-¡, morphi#saÀ t¸ãiongand r st¸ãi caÀ tion,buÜrtinnocas1ÇedotUheG s1Çeexceed20%oftUh¸ãetÜrotal.¡, Tÿ*ªa¸ãbãle 1UUshÃowstUhereG sulÜrtà s,us#ingtUhreedi e
«ren±Çta¸ãb qs tractintµUe
«rpret¸ãaÀ tions:¨2@»{= He µadStr1iï¥ct²:ah¸ãe qads tr*«iñÆct,backwardsin±ÇtµUe
«rpretaÀ tionpreci#s1ÇelyasdÕTeG sõTcr*«ibed¡= inUUtUhi#spape
«r.¦2@»{= Evÿ\ralTÿ
«rans²:¼anotUh¸ãe
«rbackwardsin±ÇtµUe
«rpretaÀ tion,formeG d,aswitUhHe qadStr*«iñÆct,¡= us#inÜrg'ktUh¸ãegene
«r*«iñÆcfram¸ãeworà k'kdÕTeG sõTcrib#ed'ka¸ãbove,'kbuÜrtus#ingas#impãle
«rc¸ãharactµUer-¡= i#saÀ t¸ãionSofdÜrat¸ãas tructureG s,es qs1Çen±Çt¸ãiallyagene
«rali#saÀ tionofGeo Bur#n'sEvÿqÇalu-¡= aÀ t¸ãionUUTÿ*ªransforme
«r s.¦2@»{= Fÿ
«orw®9ards²: Àaforw¸ãardsBHA-s tylein±ÇtµUe
«rpreter, ÀwitUhh¸ãandlinÜrg ÀofdaÀ t¸ãas truc-¡= t¸ãureG sÇtasdÕTesõTcr*«ib#edin [Sew918ç].Th¸ãedÜraÀ ta-s tructurehandlinÜrgcanb#econsidÕTe
«reG d¡= inUUas1ÇenseUUof\equivÿqÇalen±Çt"dÕTet¸ãailtÜrotUhaÀ tofEvÿqÇalTÿ*ªrans.ô¾, Eac¸ãhin±ÇtµUe
«rpreterw¸ãasme qasureG dwitUharewr*«itµUe-bas1Çed xpoin±ÇtµUe
«rdÕTes#ign¸ãedsp#ecially¡, for®±it.Th¸ãerewr*«itµUe
«r sareve
«rys#imilar,andbyus#inÜrgtUhesamekindofoptimi#saÀ tions¡, inUUe qac¸ãhwehÃop#etÜromÃaketUhecompar*«i#sonre qasonÃabãlyf#air.¦; Th¸ãeG s1ÇeÙ1me qasuremen±Çtà smÃakecle qarjus twhaÀ tanadvÿqÇan±ÇtagetUhebackwardsin±ÇtµUe
«r-¡, pret¸ãaÀ tions/have{tUheEvÿqÇalTÿ*ªransanÃalys#isofÁlife²ruÜrnsalmo qs tt¸ãwohUuÜrndreG dtimeG s¡, f#as tµUe
«r6©tUh¸ãanth¸ãeforwardsanÃalys#is,6©andinaf*«ractionoftUhespace.TheHe qadStr*«iñÆct¡, in±ÇtµUe
«rpret¸ãaÀ tion-i#snotsigni can±ÇtUlyslo¸ãwe
«r-than-the-EvÿqÇalTÿ*ªransv¸ãe
«r s#ion.Thiscom¸ãeG s¡, as'abitofasurpr*«i#s1Çe,sinceon¸ãemightexp#ectittÜroproG ducemUuchmoredÕTetail,¡, an¸ãdl¿takecorreG spon¸ãdinÜrglylonge
«r.Insp#ect¸ãionofoutʪputà srev¸ãe qalstUhaÀ titdo#eG sn't¡, alw¸ãaysap ndagre qaÀ tdÕTealmores tr*«iñÆctn¸ãeG sstUh¸ãanth¸ãeEvÿqÇalTÿ*ªransanÃalys#is.An¸ãdquitµUe *. gÌ\ ý¯3¤ 2Ì\ ýäÜR ²wh¸ãy²tUheHe qadStr*«iñÆctanÃalys#isshÃouldsom¸ãetimeG sb#equiñÆcke
«r(forÁida²)i#smys tµUe
«r*«ious,¤ R pG o qss#ibãlyUUd¸ãuetÜrotUhepreci#s1ÇedÕTetailsofreG ductionpaÀ tUhsinth¸ãetµUe
«rmrewr*«ite
«r s.©qmR »4.2 üInÕTt
Th®9elargeqmR ²AftµUe
«rextens#iv¸ãetuÜrningintUh¸ãedÕTevelopmen±Çtf*«rameworà k,tUhe(pG oãlymorphiñÆc)He qad-¡R Str*«iñÆcty}in±ÇtµUe
«rpretery}an¸ãdità s xpG oin±ÇtµUerw¸ãereins t¸ãalleG dinGlasgowHaskell0.19tÜro¡R as qs1ÇeG ss¹+tUh¸ãeviabilityofsuchs tr*«iñÆctneG s qsanÃalys#is¹+\intUhelarge".In±ÇtµUegraÀ tionaddÕTeG d¡R a¸ãbG ouÜrt¯¨5700non-bãlank,non-commen±ÇtlineG sofcodÕTetÜroanexi#s t¸ãingtot¸ãalofabG ouÜrt¡R 50000.]Becaÿus1ÇetUh¸ãecompile
«ri#swelldÕTeG s#igned,]in±ÇtµUegraÀ tionwasremÃarà kñÆabãlycle qan,¡R witUhÈth¸ãesmÃalleG s tofmodi caÀ t¸ãionstÜroexi#s tinÜrgcoG dÕTe.Theexi#s tinÜrgf*«rameworà kfor¡R transmitÿt¸ãinÜrg=-pragmÃaÀ tiñÆcinformÃaÀ tionb#etweenmoG dules=-wasextµUendÕTeG dtÜroallowfull¡R in±ÇtµUe
«rmoG d¸ãule\anÃalys#is;giv¸ãentUhearguÜrmen±Çtà spreG s1ÇentµUed\inSect¸ãion 2,tUheexp#e
«r*«imen±Çt¡R w¸ãouldUUhaveb#eenlargelywortUhleG s qshadtUhi#sbeenomitÿtµUeG d.¡a CompilinÜrg ¾Glasgo¸ãw'simpãlemen±ÇtaÀ tionoftUheHaskellÁPrelude²,pãlussomeotUhe
«r¡R gen¸ãe
«ral-purpG o qs1ÇeIølibrar*«ies,tÜrot¸ãallinga¸ãbG out4000lin¸ãeG s,takeG ssomefourhÃour sona¡R SuÜrn·«SparcSt¸ãaÀ tionIPX,roughlyadouUbãlinÜrgofth¸ãeno-anÃalys#ist¸ãime.A·he qaps#ize¡R ofbT24m¸ãegabytµUeG sbTprovedbTmoretUh¸ãanadÕTequaÀ tµUe,and,pãle qas#inÜrglyÿ*ª,tUhe
«rewasnoneeG d¡R tÜroijreG sorttotUh¸ãetree-pruningdÕTeG sõTcr*«ib#edijinSect¸ãion 3.3.Ane qarlie
«rve
«r s#ionoftUhe¡R anÃalys1Çe
«r,sinità sdÕTev¸ãelopmen±Çtsf*«ramework,scons tituÜrtings13000lin¸ãeG sin28mod¸ãules,¡R w¸ãas®suUb qs1Çequen±ÇtlycompileG d.25mod¸ãulesw¸ãen±ÇttUhroughwithnoprobãlems,whils t¡R tUhreeUUrequireG dpruÜrning.¡a Byt7an¸ãys tandÜrards,suchexp#e
«r*«imen±ÇtaÀ tionwitUhre qalcompile
«r sandre qalpro-¡R gramsglen¸ãdsmÃa 8jorcreG dibilitytÜrotUheenÜrginee
«r*«inggdÕTeG sõTcrib#edgintUhispape
«r.Ob-¡R s1Çe
«rvÿqÇaÀ t¸ãion\oftUhein±ÇtµUe
«rpreter\an¸ãd xpG oin±ÇtµUergrap¸ãpãlinÜrgwitUhnon-to¸ãyinputà sle qadto¡R mÃan¸ãy5Hre nemen±Çtà s,andtÜrotUhesuggeG s tionsforfurtUhe
«rdÕTevelopmen±ÇttÜrowardstUhe¡R en¸ãdUUofSection 3.4.¦R »4.3 üConclus(äionsqmR ²Th¸ãe`»ab qs tractin±ÇtµUe
«rpreter`»an¸ãd xpG oin±ÇtinÜrgmechani#smouÜrtUlineG dabG ovehaveb#een¡R dÕTev¸ãelop#eG dXandtuÜrneG dbyruÜrnningtUh¸ãemove
«rapproximÃaÀ tµUelytwen±ÇtytUhÃousandlineG s¡R ofQ½Hask¸ãellsourcecoG dÕTe.As qs1Çess#inÜrgQ½tUh¸ãeviabilityofnewsõTchemeG sonlyonsmÃallex-¡R ampãleG sorus#inÜrgpape
«ranÃalys1ÇeG scanbemisle qadinÜrg.GoG odengin¸ãee
«r*«ingrequireG snot¡R onlyFsup¸ãpG ortinÜrgtUheory{ofwhiñÆchtUhe eldshÃowsnoshÃortage{buÜrtalsoextµUens-¡R iv¸ãe8quan±ÇtitaÀ tiveanÃalys#isonre qalis t¸ãiñÆc-sizeG dinpuÜrtà s.Th¸ãerelaÀ tivelackofe ective¡R impãlem¸ãen±ÇtaÀ tionsIofs tr*«iñÆctn¸ãeG s qsandotUhe
«rs1ÇemÃan±ÇtiñÆcanÃalys1ÇeG sforHaskellhighlightà s¡R tUh¸ãeUUneeG dforfurtUhe
«raÀ tÿtµUen±ÇtiontÜroengin¸ãee
«r*«ingi#s qsueG sina¸ãbs tractin±ÇtµUe
«rpret¸ãaÀ tion.¡a Us#inÜrgYçtUh¸ãeG s1Çepr*«incipãles,apoãlymorphiñÆcpro 8ject¸ãionanÃalys1Çe
«rforHaskellhasb#een¡R cre qaÀ tµUeG d.ÇTh¸ãeanÃalys1Çe
«ri#se ective,robus t,reliabãle,tur#nsingoG odÇpe
«rformÃances,¡R an¸ãd«hasb#eenus1ÇeG dtÜrosuppG ortres1Çe qarc¸ãhinaÿuÜrtomÃaÀ t¸ãiñÆcs tr*«ict¸ãi caÀ tionofHaskell¡R programsü^ÿ±4|s².´QItalsolaysouÜrtadÕTeG s#ignwitUhconsidÕTe
«ra¸ãbãlepG otµUen±Çtialforre nemen±Çt,¡R part¸ãiñÆcularlyí¶witUhreG sp#ecttÜrobuildingmoreeconomiñÆcala¸ãb qs tractin±ÇtµUe
«rpretaÀ tions,¡R an¸ãdGÄtÜro xingsh¸ãar*«ingprobãlemsintUh¸ãe xpG oin±ÇtinÜrgmechani#sm.Fÿ*ªurtUhe
«rdÕTevelopmen±Çt¡R mÃayUUyieldimpreG s qs#iv¸ães tr*«iñÆctneG s qsandshar*«inÜrganÃalys1ÇeG sforHaskell.R ä ff 8çÏ
LÍ ü-=Ô4 ?üÐDeni äsTHo¾9we,Departmen·¤tofCompußting,TImp äe Þr'xialCoå±llege,Lon¾9don. A gÌ\ ý¯3¤ 2Ì\ ýäÜ, ÓRefefrence` s#f, Ð[AFMü-=Ô+ nÐ95]ZóxZenÈaÐ'Ar'xioå±la,MaÄÍt§3tThiasFÿ:«elleAÇi äs. en,JohnMaraist,Mart¾9inOdØe Þrskyÿ:«,an¾9dPhilip¤ Xa²Wÿ:«adle Þr.MAØocall-b¾9y-neeAÇdØlamPbdßacalculus.MInÞ22ndUSymposiumonPrinciples¡Xa²of6ProgrammingLanguagesÐ,ûSanFÿ:«ranci äsö!co,California,JanTuary1995.A¾9CM¡Xa²PreAÇsNs.¡, [Aÿ|rug93]Xa²LennÈart¯LAÿ|rugustâfsNson.ä¢Impå±lem¾9en·¤tinßghaskellove Þrloadinßg.ä¢InÞProceedingsÛ¹of¡Xa²the¶ïFÿJªunctionalProgramming¶ïLanguagesandComputerAÃrchitectureConfer-¡Xa²ence,N<Copenhagen,DenmarkÐ,TJußn¾9e1993.¡, [Bar93]Xa²GeØbreAÇs. elasNs äieÅØBaraki.ügÞAÃbstract1InterpretationofPolymorphicHigher-Order¡Xa²FÿJªunctionsÐ.PhD»tTh¾9eAÇs äis, Departmen·¤tofCompußtºîe ÞrScience,Unive Þrs äityof¡Xa²Glasgo¾9w,MçLilybankGardØens,GlasgowG128QQ,UK,Fÿ:«eØbruary1993.ÂfAlso¡Xa²a¾9vÿ|railabå±leTasaGlasgo¾9wTÿ:«echRepAÇortFP-93-07.¡, [BHA85]Xa²G.L.n¸Bur än,C.L.Hankin,an¾9dS. Aÿ|rbramskyÿ:«.Ü+ThetTheoryofstr'xiò×ctneAÇsNsanÈalys äis¡Xa²for}high¾9e Þr-ordØerfußnct¾9ions.&4InÞProceedingsRoftheWorkshoponProgramsRas¡Xa²DataäòObjectsÐ,¹UpageAÇs42{62,DIKU,Co¾9p äenhagen,¹UDenmÈarâfk,17{19Octßobe Þr¡Xa²1985.TSpr'xinßge Þr-Vÿ:«erlagLNCS217.¡, [CC78]Xa²CousotÀan¾9dCousot.úCStaÄÍtiò×cdØetºîe ÞrminÈaÄÍtionofdynÈamiò×cprop äe ÞrtieAÇsofrecurs äive¡Xa²proAÇced¾9ures.(vInÆE.J.NeuhÈoå±ld,eAÇditßor,ÞFÿJªormalð£DescriptionofProgramming¡Xa²ConceptsÐ.TNortTh-Hoå±llan¾9d,1978.¡, [Con91]Xa²Ch¾9arleAÇs¨ÞCons. el.ñ®Fÿ:«aststr'xiò×ctn¾9eAÇsNsanÈalys äis¨ÞviasymPboå±liò×c xpoin·¤titºîe ÞraÄÍt¾9ion.ñ®Un-¡Xa²puTbå±li äsh¾9eAÇd.} Yÿ:«aleUnive Þrs äityÿ:«,Departmen·¤tofCompußtºîe ÞrScience,SeptemPb äe Þr¡Xa²1991.¡, [FH93]Xa²Alex¬QFÿ:«e Þrgusonan¾9dJohnHugheAÇs.òõFÿ:«astabNstractin·¤tºîe ÞrpretaÄÍtionus äinßgs. equen-¡Xa²t¾9ial\algor'xitThms.íýInÞProceedingsªoftheChalmersProgrammingªMethodology¡Xa²Group¯¸WinterMeetingÐ,jJanTuary1993.UñDepart¾9men·¤tjofCompußtºîe ÞrScienceAÇs,¡Xa²Ch¾9alme ÞrsTUnivers äityTofTÿ:«ec¾9hnoå±logy.¡, [Hal93]Xa²CordØelia V.ZHall.KUs äinßgstr'xiò×ctn¾9eAÇsNsanÈalysisinpract¾9iò×cefordßaÄÍtastructureAÇs.¡Xa²In{John T.O'Donn¾9ellandKevinHammond,eAÇditßors,ÞGlasgowþWorkshop¡Xa²on¡FÿJªunctionalProgrammingÐ,ÔwWÿ:«orâfkshÈo¾9pNsinCompußting,ÔwAyr,ScotTland,July¡Xa²1993.TSpr'xinßge Þr-Vÿ:«erlag.¡, [HH91]Xa²SeØbast¾9ianºHußn·¤tandChr'xi äsHankin.FixeAÇdpoin·¤tâfsan¾9df'xront¾9ie Þrs:anewp äe Þr-¡Xa²sp äect¾9ive.
ÃÞJournal0SofFÿJªunctionalProgrammingÐ,ôÇ1(1):91{120,JanTuary1991.¡, [HL92a]Xa²Pietºîe Þr H.çøHartelan¾9dKo äen G.Lanßgendo äen. BenchmÈarâfkingçøimpå±lemen·¤taÄÍtions¡Xa²of(flazyfußnct¾9ionÈallanguageAÇs.MTÿ:«ec¾9hniò×calreport,Depart¾9men·¤t(fofCompußtºîe Þr¡Xa²Systºîems,ê¾Fÿ:«aculßt¾9yofMaÄÍtThemÈatiò×csê¾andCompußtºîe ÞrScience,Unive Þrs äityofAm-¡Xa²stºîe Þrdßam,TDecemPb äer1992.¡, [HL92b]Xa²Johnæ Hugh¾9eAÇsandJohnLa§3ußnchburyÿ:«. çPro jectionsforpAÇoå±lymorphiò×c rst-¡Xa²ordØe Þrþòstr'xiò×ctn¾9eAÇsNsanÈalys äis.InþòÞMathematical9ªStructuresinComputerScienceÐ,¡Xa²v¾9oå±lußme 2,TpageAÇs301{326,1992.¡, [HM94]Xa²C. L.B9Hankinan¾9dD.LeM¾ªû¡Xet¾9aye Þr.Der'xivinßgB9algoritThmsfromt¾9yp äeinfe Þrence¡Xa²systºîems:(Aÿ|rp¾9på±liò×caÄÍtiontßostr'xiò×ctneAÇsNsanÈalys äis.InÞProceedings¯ÞofPOPL'94Ð,¡Xa²1994.¡, [Hug90]Xa²JohnHugh¾9eAÇs.¡Compile-timeanÈalys äisoffußnct¾9ionÈalprograms.¡InDavid A.¡Xa²Tÿ:«ur än¾9e Þr,ó
eAÇditßor,ÞResearchðxTÿJªopicsinFunctionalProgrammingÐ.ó
Addi äson-¡Xa²Wÿ:«eAÇsley¨DPuTbå±li äshinßgCompan¾9y,1990.Ï®FromtTh¾9e1987YeNarofProgramminßg,¡Xa²Univ¾9e Þrs äityTofTÿ:«exas,Aÿ|rust¾9in,Tÿ:«exas.¡, [Hußn91]Xa²SeØbast¾9ianHußn·¤t.¯2ÞAÃbstract¸InterpretationofFÿJªunctionalLanguages:FÿJªrom¡Xa²Theory?ftoPracticeÐ.'ÞPhDtTh¾9eAÇs äis,ÄImpe Þr'xialCoå±llege,Univ¾9ers äityÄofLondon,¡Xa²1991. W+ gÌ\ ý¯3¤ 2Ì\ ýäÜR Ð[JM86]~a²NeAÇil D. Jon¾9esan¾9dAlanMycroft.îpDaÄÍta
owanÈalys äisofap¾9på±liò×caÄÍtiveprograms¤ ~a²us äinßg¬·minimÈalfunct¾9iongraphs:Aÿ|rbr'xidgeAÇdve Þrs äion.óInÞThirteenthîAÃCMîSym-¡~a²posiumÓ/onPrinciplesofProgrammingLanguages,St.Petersburg,FloridaÐ,¡~a²pageAÇsT296{306,1986.¡R [Jon93]~a²Marâfk Pÿ:«.«LJon¾9eAÇs.òPartialevÿ|raluaÄÍtionfordiò×ctionÈary-f'xreeove Þrloadinßg.òTÿ:«echniò×cal¡~a²RepAÇort×RR-959,Depart¾9men·¤t×ofCompußtºîe ÞrScience,Yÿ:«aleUniv¾9ers äityÿ:«,×Aÿ|rpr'xil¡~a²1993.¡R [KHL91]~a²R. K¾9uTbiak,ÃJ.HugheAÇs,ÃandJ. La§3ußnchburyÿ:«.nÒA¦prototyp äeÃimpå±lemen·¤taÄÍtionof¡~a²pro ject¾9ion-bas. eAÇd§Ï rst-ordØe ÞrpAÇoå±lymorphiò×cstr'xiò×ctn¾9eAÇsNsanÈalys äis.ÎRInR. Heldßal,¡~a²eAÇditßor,RìÞDraftrProceedingsofFÿJªourthAÃnnualGlasgowWorkshoponFunc-¡~a²tionalN<ProgrammingÐ,TpageAÇs322{343,Sky¾9e,Aÿ|rugust13{151991.¡R [Mar92]~a²Chr'xi ästßo¾9phe Þr CharleAÇst6Martin.4ÞAÃlgorithms¥mforFindingFixpointsinAbstract¡~a²InterpretationÐ.¢PhDî¥tTh¾9eAÇs äis,îÝImpe Þr'xialCoå±llege,Univ¾9ers äityîÝofLondon,Jußne¡~a²1992.¡R [Nel91]~a²George C.TNelan.ÒÞFirsti cationÐ.PhDTatTh¾9eAÇs äis,Ar'xizonÈaSt¾9aÄÍtºîeUnive Þrs äityÿ:«,1991.¡R [NN92]~a²F. NielsonD an¾9dH.R.Nielson. FinitºîeneAÇsNsconditionsfor xeAÇdpoin·¤titºîe Þra-¡~a²t¾9ion.|¦Tÿ:«echniò×calgrepAÇort,Compußtºîe ÞrScienceDepart¾9men·¤t,gAarhTusUniv¾9ers äityÿ:«,¡~a²DenmÈarâfk,TFÿ:«eØbruary1992.¡R [NoAÇc93]~a²Er'xiò×cÖNoAÇc¾9ke Þr.Striò×ctneAÇsNsÖanÈalys äisusinßga¾9bNstractreAÇduction.InÞProceedingsof¡~a²FPCA93,N<Copenhagen,DenmarkÐ,TJußn¾9e1993.¡R [P¾9ar92]~a²Will/¥P¾9artain.c TheÜnofibÐb äenchmÈarâfksuitºîeofhaskellprograms.c InÞFifth¡~a²AÃnnualN<GlasgowWorkshoponFÿJªunctionalProgramming,N<AyrÐ,T1992.¡R [PC87]~a²SimonÁP¾9eytßonJoneAÇsandChr'xi äsClack.Findinßg xpAÇoin·¤tâfsinabNstractin·¤tºîe Þr-¡~a²pret¾9aÄÍtion.Ó.InVkS. Aÿ|rbramskyan¾9dC.L.Hankin,eAÇditßors,ÞAÃbstractÍInterpretation¡~a²ofR`DeclarativeLanguagesÐ,0kCompußtºîe Þrsan¾9dTheAÇirAÿ|rppå±liò×caÄÍtions,chaptºîe Þr 11,¡~a²pageAÇsT246{265.Elli äsHorw¾9ood,1987.¡R [PJ93]~a²WillnP¾9artainandSimonL. PeytßonJoneAÇs."EMßeNasur'xingtTh¾9ee ectiveneAÇsNsofa¡~a²s äimpå±leáastr'xiò×ctn¾9eAÇsNsanÈalys. e Þr.InJohn T.O'DonnellandKevinHammond,eAÇd-¡~a²itßors,@&ÞGlasgowuWorkshoponFÿJªunctionalProgrammingÐ,Wÿ:«orâfkshÈo¾9pNsinCom-¡~a²pußt¾9ing,TAyr,ScotTland,July1993.Spr'xinßge Þr-Vÿ:«erlag.¡R [RoNs93]~a²MadsÆúRoNs. en¾9dßahl.+2Highe Þr-ordØerÆúchaotiò×citºîe ÞraÄÍtions. equenceAÇs.+2InÞPLILP'93Ð,¡~a²pageAÇsT332{345,Tÿ:«allinn,Estßonia,1993.Spr'xinge Þr-Vÿ:«erlagTLNCS714.¡R [Sew91]~a²Julian+ÓSew¾9ard.WºTÿ:«owardsastr'xiò×ctneAÇsNsanÈalys. e Þrforhaskell:Pußt§3ting+ÓtTheory¡~a²in·¤tßoÜpract¾9iò×ce.·Mastºîe Þr'stTheAÇs äis,ÜUnive ÞrsityÜofMancheAÇstºîe Þr,Departmen·¤tof¡~a²Compußtºîe ÞrÌScience,1991.ªAvÿ|raila¾9bå±leasUnive Þrs äityofMancheAÇstºîe ÞrTÿ:«echniò×cal¡~a²RepAÇortTUMCS-92-2-2.¡R [Sew94]~a²Julian)Sew¾9ard.¥¤ÞAÃbstractÈLInterpretation:AÈ-QuantitativeAssessmentÐ.¥¤PhD¡~a²tTh¾9eAÇs äis, ¤Departmen·¤tofCompußtºîe ÞrScience,Unive Þrs äityofMancheAÇstºîe Þr,Oxford¡~a²Road,TManc¾9heAÇstºîe ÞrM139PL,UK,Octßob äer1994.¡R [Wÿ:«ad87]~a²Pÿ:«.L.Wadle Þr.óeStr'xiò×ctn¾9eAÇsNsanÈalys äisonnon-
aÄÍtdomÈains(b¾9yabNstractin·¤tºîe Þrpret-¡~a²aÄÍt¾9ionove Þr nitºîedomÈains).InS. Aÿ|rbramskyandC.L.Hankin,eAÇditßors,ÞAÃb-¡~a²stractÛ+InterpretationofDeclarativeLanguagesÐ,®±c¾9haptºîe Þr 12,pageAÇs266{275.¡~a²Elli äsTHorw¾9oAÇodLtd.,Chiò×c¾9heAÇstºîe Þr,Wÿ:«estSusNs. ex,Enßglan¾9d,1987.K3gR Thi äsTart¾9iò×clewasproAÇcesNs. edTus äinßgtTheLýó5ü«ÔA © ÐTþuAïÿEXmÈacropackò×agewitThLLNCSstyleø kÂÀ ; ègÌ\ ó3¼j¹ cmti9ó1ߤN cmtt9ó,©±Ê cmsy9ó)¹Aa¨ cmr6ó(ÂÖN cmbx12ó&t : cmbx9ó%o´Ç cmr9ót}\Ê cmti7óý ':
cmti10óßê<x
cmtt10óò"V
cmbx10ó°ìK ff ff cmbx14ó
!",
cmsy10ó O!â
cmsy7ó
b>
cmmi10ó 0er cmmi7óKñ`y
cmr10óÙ R cmr7ó ú±u
cmex10ù Êßßßßßßß | 98,696 | 634 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/crctable.c | /*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-â
âvi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :viâ
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ¡
â Copyright 2021 Justine Alexandra Roberts Tunney â
â â
â Permission to use, copy, modify, and/or distribute this software for â
â any purpose with or without fee is hereby granted, provided that the â
â above copyright notice and this permission notice appear in all copies. â
â â
â THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL â
â WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED â
â WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE â
â AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL â
â DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR â
â PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER â
â TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR â
â PERFORMANCE OF THIS SOFTWARE. â
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ*/
#ifdef TINY
uint32_t BZ2_crc32Table[256];
static textstartup void BZ2_crc32Table_init() {
unsigned i, j, u;
for (i = 0; i < 256; ++i) {
u = i << 24;
for (j = 8; j; --j) {
if ((int32_t)u < 0) {
u = (u << 1) ^ 0x04c11db7;
} else {
u <<= 1;
}
}
BZ2_crc32Table[i] = u;
}
if (BZ2_crc32Table[0] || BZ2_crc32Table[255] != 0xb1f740b4) {
__builtin_trap();
}
}
const void *const BZ2_crc32Table_ctor[] initarray = {
BZ2_crc32Table_init,
};
#else
const uint32_t BZ2_crc32Table[256] = {
0x00000000, 0x04c11db7, 0x09823b6e, 0x0d4326d9, 0x130476dc, 0x17c56b6b,
0x1a864db2, 0x1e475005, 0x2608edb8, 0x22c9f00f, 0x2f8ad6d6, 0x2b4bcb61,
0x350c9b64, 0x31cd86d3, 0x3c8ea00a, 0x384fbdbd, 0x4c11db70, 0x48d0c6c7,
0x4593e01e, 0x4152fda9, 0x5f15adac, 0x5bd4b01b, 0x569796c2, 0x52568b75,
0x6a1936c8, 0x6ed82b7f, 0x639b0da6, 0x675a1011, 0x791d4014, 0x7ddc5da3,
0x709f7b7a, 0x745e66cd, 0x9823b6e0, 0x9ce2ab57, 0x91a18d8e, 0x95609039,
0x8b27c03c, 0x8fe6dd8b, 0x82a5fb52, 0x8664e6e5, 0xbe2b5b58, 0xbaea46ef,
0xb7a96036, 0xb3687d81, 0xad2f2d84, 0xa9ee3033, 0xa4ad16ea, 0xa06c0b5d,
0xd4326d90, 0xd0f37027, 0xddb056fe, 0xd9714b49, 0xc7361b4c, 0xc3f706fb,
0xceb42022, 0xca753d95, 0xf23a8028, 0xf6fb9d9f, 0xfbb8bb46, 0xff79a6f1,
0xe13ef6f4, 0xe5ffeb43, 0xe8bccd9a, 0xec7dd02d, 0x34867077, 0x30476dc0,
0x3d044b19, 0x39c556ae, 0x278206ab, 0x23431b1c, 0x2e003dc5, 0x2ac12072,
0x128e9dcf, 0x164f8078, 0x1b0ca6a1, 0x1fcdbb16, 0x018aeb13, 0x054bf6a4,
0x0808d07d, 0x0cc9cdca, 0x7897ab07, 0x7c56b6b0, 0x71159069, 0x75d48dde,
0x6b93dddb, 0x6f52c06c, 0x6211e6b5, 0x66d0fb02, 0x5e9f46bf, 0x5a5e5b08,
0x571d7dd1, 0x53dc6066, 0x4d9b3063, 0x495a2dd4, 0x44190b0d, 0x40d816ba,
0xaca5c697, 0xa864db20, 0xa527fdf9, 0xa1e6e04e, 0xbfa1b04b, 0xbb60adfc,
0xb6238b25, 0xb2e29692, 0x8aad2b2f, 0x8e6c3698, 0x832f1041, 0x87ee0df6,
0x99a95df3, 0x9d684044, 0x902b669d, 0x94ea7b2a, 0xe0b41de7, 0xe4750050,
0xe9362689, 0xedf73b3e, 0xf3b06b3b, 0xf771768c, 0xfa325055, 0xfef34de2,
0xc6bcf05f, 0xc27dede8, 0xcf3ecb31, 0xcbffd686, 0xd5b88683, 0xd1799b34,
0xdc3abded, 0xd8fba05a, 0x690ce0ee, 0x6dcdfd59, 0x608edb80, 0x644fc637,
0x7a089632, 0x7ec98b85, 0x738aad5c, 0x774bb0eb, 0x4f040d56, 0x4bc510e1,
0x46863638, 0x42472b8f, 0x5c007b8a, 0x58c1663d, 0x558240e4, 0x51435d53,
0x251d3b9e, 0x21dc2629, 0x2c9f00f0, 0x285e1d47, 0x36194d42, 0x32d850f5,
0x3f9b762c, 0x3b5a6b9b, 0x0315d626, 0x07d4cb91, 0x0a97ed48, 0x0e56f0ff,
0x1011a0fa, 0x14d0bd4d, 0x19939b94, 0x1d528623, 0xf12f560e, 0xf5ee4bb9,
0xf8ad6d60, 0xfc6c70d7, 0xe22b20d2, 0xe6ea3d65, 0xeba91bbc, 0xef68060b,
0xd727bbb6, 0xd3e6a601, 0xdea580d8, 0xda649d6f, 0xc423cd6a, 0xc0e2d0dd,
0xcda1f604, 0xc960ebb3, 0xbd3e8d7e, 0xb9ff90c9, 0xb4bcb610, 0xb07daba7,
0xae3afba2, 0xaafbe615, 0xa7b8c0cc, 0xa379dd7b, 0x9b3660c6, 0x9ff77d71,
0x92b45ba8, 0x9675461f, 0x8832161a, 0x8cf30bad, 0x81b02d74, 0x857130c3,
0x5d8a9099, 0x594b8d2e, 0x5408abf7, 0x50c9b640, 0x4e8ee645, 0x4a4ffbf2,
0x470cdd2b, 0x43cdc09c, 0x7b827d21, 0x7f436096, 0x7200464f, 0x76c15bf8,
0x68860bfd, 0x6c47164a, 0x61043093, 0x65c52d24, 0x119b4be9, 0x155a565e,
0x18197087, 0x1cd86d30, 0x029f3d35, 0x065e2082, 0x0b1d065b, 0x0fdc1bec,
0x3793a651, 0x3352bbe6, 0x3e119d3f, 0x3ad08088, 0x2497d08d, 0x2056cd3a,
0x2d15ebe3, 0x29d4f654, 0xc5a92679, 0xc1683bce, 0xcc2b1d17, 0xc8ea00a0,
0xd6ad50a5, 0xd26c4d12, 0xdf2f6bcb, 0xdbee767c, 0xe3a1cbc1, 0xe760d676,
0xea23f0af, 0xeee2ed18, 0xf0a5bd1d, 0xf464a0aa, 0xf9278673, 0xfde69bc4,
0x89b8fd09, 0x8d79e0be, 0x803ac667, 0x84fbdbd0, 0x9abc8bd5, 0x9e7d9662,
0x933eb0bb, 0x97ffad0c, 0xafb010b1, 0xab710d06, 0xa6322bdf, 0xa2f33668,
0xbcb4666d, 0xb8757bda, 0xb5365d03, 0xb1f740b4,
};
#endif
| 5,638 | 94 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/README.cosmo | DESCRIPTION
bzip2 is a lossless compression algorithm that's slower than deflate
but achieves better compression ratios w/ BurrowsâWheeler transform.
ORIGIN
commit 6a8690fc8d26c815e798c588f796eabe9d684cf0 (HEAD, tag: bzip2-1.0.8)
Author: Mark Wielaard <[email protected]>
Date: Sat Jul 13 17:17:58 2019 +0200
Prepare for 1.0.8 release.
| 352 | 12 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/README |
This is the README for bzip2/libzip2.
This version is fully compatible with the previous public releases.
------------------------------------------------------------------
This file is part of bzip2/libbzip2, a program and library for
lossless, block-sorting data compression.
bzip2/libbzip2 version 1.0.8 of 13 July 2019
Copyright (C) 1996-2019 Julian Seward <[email protected]>
Please read the WARNING, DISCLAIMER and PATENTS sections in this file.
This program is released under the terms of the license contained
in the file LICENSE.
------------------------------------------------------------------
Complete documentation is available in Postscript form (manual.ps),
PDF (manual.pdf) or html (manual.html). A plain-text version of the
manual page is available as bzip2.txt.
HOW TO BUILD -- UNIX
Type 'make'. This builds the library libbz2.a and then the programs
bzip2 and bzip2recover. Six self-tests are run. If the self-tests
complete ok, carry on to installation:
To install in /usr/local/bin, /usr/local/lib, /usr/local/man and
/usr/local/include, type
make install
To install somewhere else, eg, /xxx/yyy/{bin,lib,man,include}, type
make install PREFIX=/xxx/yyy
If you are (justifiably) paranoid and want to see what 'make install'
is going to do, you can first do
make -n install or
make -n install PREFIX=/xxx/yyy respectively.
The -n instructs make to show the commands it would execute, but not
actually execute them.
HOW TO BUILD -- UNIX, shared library libbz2.so.
Do 'make -f Makefile-libbz2_so'. This Makefile seems to work for
Linux-ELF (RedHat 7.2 on an x86 box), with gcc. I make no claims
that it works for any other platform, though I suspect it probably
will work for most platforms employing both ELF and gcc.
bzip2-shared, a client of the shared library, is also built, but not
self-tested. So I suggest you also build using the normal Makefile,
since that conducts a self-test. A second reason to prefer the
version statically linked to the library is that, on x86 platforms,
building shared objects makes a valuable register (%ebx) unavailable
to gcc, resulting in a slowdown of 10%-20%, at least for bzip2.
Important note for people upgrading .so's from 0.9.0/0.9.5 to version
1.0.X. All the functions in the library have been renamed, from (eg)
bzCompress to BZ2_bzCompress, to avoid namespace pollution.
Unfortunately this means that the libbz2.so created by
Makefile-libbz2_so will not work with any program which used an older
version of the library. I do encourage library clients to make the
effort to upgrade to use version 1.0, since it is both faster and more
robust than previous versions.
HOW TO BUILD -- Windows 95, NT, DOS, Mac, etc.
It's difficult for me to support compilation on all these platforms.
My approach is to collect binaries for these platforms, and put them
on the master web site (https://sourceware.org/bzip2/). Look there. However
(FWIW), bzip2-1.0.X is very standard ANSI C and should compile
unmodified with MS Visual C. If you have difficulties building, you
might want to read README.COMPILATION.PROBLEMS.
At least using MS Visual C++ 6, you can build from the unmodified
sources by issuing, in a command shell:
nmake -f makefile.msc
(you may need to first run the MSVC-provided script VCVARS32.BAT
so as to set up paths to the MSVC tools correctly).
VALIDATION
Correct operation, in the sense that a compressed file can always be
decompressed to reproduce the original, is obviously of paramount
importance. To validate bzip2, I used a modified version of Mark
Nelson's churn program. Churn is an automated test driver which
recursively traverses a directory structure, using bzip2 to compress
and then decompress each file it encounters, and checking that the
decompressed data is the same as the original.
Please read and be aware of the following:
WARNING:
This program and library (attempts to) compress data by
performing several non-trivial transformations on it.
Unless you are 100% familiar with *all* the algorithms
contained herein, and with the consequences of modifying them,
you should NOT meddle with the compression or decompression
machinery. Incorrect changes can and very likely *will*
lead to disastrous loss of data.
DISCLAIMER:
I TAKE NO RESPONSIBILITY FOR ANY LOSS OF DATA ARISING FROM THE
USE OF THIS PROGRAM/LIBRARY, HOWSOEVER CAUSED.
Every compression of a file implies an assumption that the
compressed file can be decompressed to reproduce the original.
Great efforts in design, coding and testing have been made to
ensure that this program works correctly. However, the complexity
of the algorithms, and, in particular, the presence of various
special cases in the code which occur with very low but non-zero
probability make it impossible to rule out the possibility of bugs
remaining in the program. DO NOT COMPRESS ANY DATA WITH THIS
PROGRAM UNLESS YOU ARE PREPARED TO ACCEPT THE POSSIBILITY, HOWEVER
SMALL, THAT THE DATA WILL NOT BE RECOVERABLE.
That is not to say this program is inherently unreliable.
Indeed, I very much hope the opposite is true. bzip2/libbzip2
has been carefully constructed and extensively tested.
PATENTS:
To the best of my knowledge, bzip2/libbzip2 does not use any
patented algorithms. However, I do not have the resources
to carry out a patent search. Therefore I cannot give any
guarantee of the above statement.
WHAT'S NEW IN 0.9.0 (as compared to 0.1pl2) ?
* Approx 10% faster compression, 30% faster decompression
* -t (test mode) is a lot quicker
* Can decompress concatenated compressed files
* Programming interface, so programs can directly read/write .bz2 files
* Less restrictive (BSD-style) licensing
* Flag handling more compatible with GNU gzip
* Much more documentation, i.e., a proper user manual
* Hopefully, improved portability (at least of the library)
WHAT'S NEW IN 0.9.5 ?
* Compression speed is much less sensitive to the input
data than in previous versions. Specifically, the very
slow performance caused by repetitive data is fixed.
* Many small improvements in file and flag handling.
* A Y2K statement.
WHAT'S NEW IN 1.0.x ?
See the CHANGES file.
I hope you find bzip2 useful. Feel free to contact the developers at
[email protected]
if you have any suggestions or queries. Many people mailed me with
comments, suggestions and patches after the releases of bzip-0.15,
bzip-0.21, and bzip2 versions 0.1pl2, 0.9.0, 0.9.5, 1.0.0, 1.0.1,
1.0.2 and 1.0.3, and the changes in bzip2 are largely a result of this
feedback. I thank you for your comments.
bzip2's "home" is https://sourceware.org/bzip2/
Julian Seward
[email protected]
Cambridge, UK.
18 July 1996 (version 0.15)
25 August 1996 (version 0.21)
7 August 1997 (bzip2, version 0.1)
29 August 1997 (bzip2, version 0.1pl2)
23 August 1998 (bzip2, version 0.9.0)
8 June 1999 (bzip2, version 0.9.5)
4 Sept 1999 (bzip2, version 0.9.5d)
5 May 2000 (bzip2, version 1.0pre8)
30 December 2001 (bzip2, version 1.0.2pre1)
15 February 2005 (bzip2, version 1.0.3)
20 December 2006 (bzip2, version 1.0.4)
10 December 2007 (bzip2, version 1.0.5)
6 Sept 2010 (bzip2, version 1.0.6)
27 June 2019 (bzip2, version 1.0.7)
13 July 2019 (bzip2, version 1.0.8)
| 7,451 | 197 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/makefile.msc | # Makefile for Microsoft Visual C++ 6.0
# usage: nmake -f makefile.msc
# K.M. Syring ([email protected])
# Fixed up by JRS for bzip2-0.9.5d release.
CC=cl
CFLAGS= -DWIN32 -MD -Ox -D_FILE_OFFSET_BITS=64 -nologo
OBJS= blocksort.obj \
huffman.obj \
crctable.obj \
randtable.obj \
compress.obj \
decompress.obj \
bzlib.obj
all: lib bzip2 test
bzip2: lib
$(CC) $(CFLAGS) -o bzip2 bzip2.c libbz2.lib setargv.obj
$(CC) $(CFLAGS) -o bzip2recover bzip2recover.c
lib: $(OBJS)
lib /out:libbz2.lib $(OBJS)
test: bzip2
type words1
.\\bzip2 -1 < sample1.ref > sample1.rb2
.\\bzip2 -2 < sample2.ref > sample2.rb2
.\\bzip2 -3 < sample3.ref > sample3.rb2
.\\bzip2 -d < sample1.bz2 > sample1.tst
.\\bzip2 -d < sample2.bz2 > sample2.tst
.\\bzip2 -ds < sample3.bz2 > sample3.tst
@echo All six of the fc's should find no differences.
@echo If fc finds an error on sample3.bz2, this could be
@echo because WinZip's 'TAR file smart CR/LF conversion'
@echo is too clever for its own good. Disable this option.
@echo The correct size for sample3.ref is 120,244. If it
@echo is 150,251, WinZip has messed it up.
fc sample1.bz2 sample1.rb2
fc sample2.bz2 sample2.rb2
fc sample3.bz2 sample3.rb2
fc sample1.tst sample1.ref
fc sample2.tst sample2.ref
fc sample3.tst sample3.ref
clean:
del *.obj
del libbz2.lib
del bzip2.exe
del bzip2recover.exe
del sample1.rb2
del sample2.rb2
del sample3.rb2
del sample1.tst
del sample2.tst
del sample3.tst
.c.obj:
$(CC) $(CFLAGS) -c $*.c -o $*.obj
| 1,552 | 64 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzdiff | #!/bin/sh
# sh is buggy on RS/6000 AIX 3.2. Replace above line with #!/bin/ksh
# Bzcmp/diff wrapped for bzip2,
# adapted from zdiff by Philippe Troin <[email protected]> for Debian GNU/Linux.
# Bzcmp and bzdiff are used to invoke the cmp or the diff pro-
# gram on compressed files. All options specified are passed
# directly to cmp or diff. If only 1 file is specified, then
# the files compared are file1 and an uncompressed file1.gz.
# If two files are specified, then they are uncompressed (if
# necessary) and fed to cmp or diff. The exit status from cmp
# or diff is preserved.
PATH="/usr/bin:/bin:$PATH"; export PATH
prog=`echo $0 | sed 's|.*/||'`
case "$prog" in
*cmp) comp=${CMP-cmp} ;;
*) comp=${DIFF-diff} ;;
esac
OPTIONS=
FILES=
for ARG
do
case "$ARG" in
-*) OPTIONS="$OPTIONS $ARG";;
*) if test -f "$ARG"; then
FILES="$FILES $ARG"
else
echo "${prog}: $ARG not found or not a regular file"
exit 1
fi ;;
esac
done
if test -z "$FILES"; then
echo "Usage: $prog [${comp}_options] file [file]"
exit 1
fi
set $FILES
if test $# -eq 1; then
FILE=`echo "$1" | sed 's/.bz2$//'`
bzip2 -cd "$FILE.bz2" | $comp $OPTIONS - "$FILE"
STAT="$?"
elif test $# -eq 2; then
case "$1" in
*.bz2)
case "$2" in
*.bz2)
F=`echo "$2" | sed 's|.*/||;s|.bz2$||'`
tmp=`mktemp "${TMPDIR:-/tmp}"/bzdiff.XXXXXXXXXX` || {
echo 'cannot create a temporary file' >&2
exit 1
}
bzip2 -cdfq "$2" > "$tmp"
bzip2 -cdfq "$1" | $comp $OPTIONS - "$tmp"
STAT="$?"
/bin/rm -f "$tmp";;
*) bzip2 -cdfq "$1" | $comp $OPTIONS - "$2"
STAT="$?";;
esac;;
*) case "$2" in
*.bz2)
bzip2 -cdfq "$2" | $comp $OPTIONS "$1" -
STAT="$?";;
*) $comp $OPTIONS "$1" "$2"
STAT="$?";;
esac;;
esac
else
echo "Usage: $prog [${comp}_options] file [file]"
exit 1
fi
exit "$STAT"
| 2,140 | 77 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzgrep.1 | \"Shamelessly copied from zmore.1 by Philippe Troin <[email protected]>
\"for Debian GNU/Linux
.TH BZGREP 1
.SH NAME
bzgrep, bzfgrep, bzegrep \- search possibly bzip2 compressed files for a regular expression
.SH SYNOPSIS
.B bzgrep
[ grep_options ]
.BI [\ -e\ ] " pattern"
.IR filename ".\|.\|."
.br
.B bzegrep
[ egrep_options ]
.BI [\ -e\ ] " pattern"
.IR filename ".\|.\|."
.br
.B bzfgrep
[ fgrep_options ]
.BI [\ -e\ ] " pattern"
.IR filename ".\|.\|."
.SH DESCRIPTION
.IR Bzgrep
is used to invoke the
.I grep
on bzip2-compressed files. All options specified are passed directly to
.I grep.
If no file is specified, then the standard input is decompressed
if necessary and fed to grep.
Otherwise the given files are uncompressed if necessary and fed to
.I grep.
.PP
If
.I bzgrep
is invoked as
.I bzegrep
or
.I bzfgrep
then
.I egrep
or
.I fgrep
is used instead of
.I grep.
If the GREP environment variable is set,
.I bzgrep
uses it as the
.I grep
program to be invoked. For example:
for sh: GREP=fgrep bzgrep string files
for csh: (setenv GREP fgrep; bzgrep string files)
.SH AUTHOR
Charles Levert ([email protected]). Adapted to bzip2 by Philippe
Troin <[email protected]> for Debian GNU/Linux.
.SH "SEE ALSO"
grep(1), egrep(1), fgrep(1), bzdiff(1), bzmore(1), bzless(1), bzip2(1)
| 1,297 | 57 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bz_internal_error.c | /*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-â
âvi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :viâ
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ¡
â Copyright 2021 Justine Alexandra Roberts Tunney â
â â
â Permission to use, copy, modify, and/or distribute this software for â
â any purpose with or without fee is hereby granted, provided that the â
â above copyright notice and this permission notice appear in all copies. â
â â
â THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL â
â WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED â
â WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE â
â AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL â
â DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR â
â PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER â
â TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR â
â PERFORMANCE OF THIS SOFTWARE. â
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ*/
void bz_internal_error(int err) {
__builtin_trap();
}
| 1,893 | 23 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzmore | #!/bin/sh
# Bzmore wrapped for bzip2,
# adapted from zmore by Philippe Troin <[email protected]> for Debian GNU/Linux.
PATH="/usr/bin:$PATH"; export PATH
prog=`echo $0 | sed 's|.*/||'`
case "$prog" in
*less) more=less ;;
*) more=more ;;
esac
if test "`echo -n a`" = "-n a"; then
# looks like a SysV system:
n1=''; n2='\c'
else
n1='-n'; n2=''
fi
oldtty=`stty -g 2>/dev/null`
if stty -cbreak 2>/dev/null; then
cb='cbreak'; ncb='-cbreak'
else
# 'stty min 1' resets eof to ^a on both SunOS and SysV!
cb='min 1 -icanon'; ncb='icanon eof ^d'
fi
if test $? -eq 0 -a -n "$oldtty"; then
trap 'stty $oldtty 2>/dev/null; exit' 0 2 3 5 10 13 15
else
trap 'stty $ncb echo 2>/dev/null; exit' 0 2 3 5 10 13 15
fi
if test $# = 0; then
if test -t 0; then
echo usage: $prog files...
else
bzip2 -cdfq | eval $more
fi
else
FIRST=1
for FILE
do
if test $FIRST -eq 0; then
echo $n1 "--More--(Next file: $FILE)$n2"
stty $cb -echo 2>/dev/null
ANS=`dd bs=1 count=1 2>/dev/null`
stty $ncb echo 2>/dev/null
echo " "
if test "$ANS" = 'e' -o "$ANS" = 'q'; then
exit
fi
fi
if test "$ANS" != 's'; then
echo "------> $FILE <------"
bzip2 -cdfq "$FILE" | eval $more
fi
if test -t; then
FIRST=0
fi
done
fi
| 1,259 | 62 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzlib.h | #ifndef _BZLIB_H
#define _BZLIB_H
#include "libc/stdio/stdio.h"
#define BZ_RUN 0
#define BZ_FLUSH 1
#define BZ_FINISH 2
#define BZ_OK 0
#define BZ_RUN_OK 1
#define BZ_FLUSH_OK 2
#define BZ_FINISH_OK 3
#define BZ_STREAM_END 4
#define BZ_SEQUENCE_ERROR (-1)
#define BZ_PARAM_ERROR (-2)
#define BZ_MEM_ERROR (-3)
#define BZ_DATA_ERROR (-4)
#define BZ_DATA_ERROR_MAGIC (-5)
#define BZ_IO_ERROR (-6)
#define BZ_UNEXPECTED_EOF (-7)
#define BZ_OUTBUFF_FULL (-8)
#define BZ_CONFIG_ERROR (-9)
#define BZ_MAX_UNUSED 5000
#if !(__ASSEMBLER__ + __LINKER__ + 0)
COSMOPOLITAN_C_START_
typedef struct {
char *next_in;
unsigned int avail_in;
unsigned int total_in_lo32;
unsigned int total_in_hi32;
char *next_out;
unsigned int avail_out;
unsigned int total_out_lo32;
unsigned int total_out_hi32;
void *state;
void *(*bzalloc)(void *, int, int);
void (*bzfree)(void *, void *);
void *opaque;
} bz_stream;
/*-- Core (low-level) library functions --*/
int BZ2_bzCompressInit(bz_stream *, int, int, int);
int BZ2_bzCompress(bz_stream *, int);
int BZ2_bzCompressEnd(bz_stream *);
int BZ2_bzDecompressInit(bz_stream *, int, int);
int BZ2_bzDecompress(bz_stream *);
int BZ2_bzDecompressEnd(bz_stream *);
/*-- High(er) level library functions --*/
typedef void BZFILE;
BZFILE *BZ2_bzReadOpen(int *, FILE *, int, int, void *, int);
void BZ2_bzReadClose(int *, BZFILE *);
void BZ2_bzReadGetUnused(int *, BZFILE *, void **, int *);
int BZ2_bzRead(int *, BZFILE *, void *, int);
BZFILE *BZ2_bzWriteOpen(int *, FILE *, int, int, int);
void BZ2_bzWrite(int *, BZFILE *, void *, int);
void BZ2_bzWriteClose(int *, BZFILE *, int, unsigned int *, unsigned int *);
void BZ2_bzWriteClose64(int *, BZFILE *, int, unsigned int *, unsigned int *,
unsigned int *, unsigned int *);
int BZ2_bzBuffToBuffCompress(char *, unsigned int *, char *, unsigned int, int,
int, int);
int BZ2_bzBuffToBuffDecompress(char *, unsigned int *, char *, unsigned int,
int, int);
/*--
Code contributed by Yoshioka Tsuneo ([email protected])
to support better zlib compatibility.
This code is not _officially_ part of libbzip2 (yet);
I haven't tested it, documented it, or considered the
threading-safeness of it.
If this code breaks, please contact both Yoshioka and me.
--*/
const char *BZ2_bzlibVersion(void);
BZFILE *BZ2_bzopen(const char *, const char *);
BZFILE *BZ2_bzdopen(int, const char *);
int BZ2_bzread(BZFILE *, void *, int);
int BZ2_bzwrite(BZFILE *, void *, int);
int BZ2_bzflush(BZFILE *);
void BZ2_bzclose(BZFILE *);
const char *BZ2_bzerror(BZFILE *, int *);
COSMOPOLITAN_C_END_
#endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */
#endif /* _BZLIB_H */
| 2,836 | 92 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzlib.c | /* clang-format off */
/*-------------------------------------------------------------*/
/*--- Library top-level functions. ---*/
/*--- bzlib.c ---*/
/*-------------------------------------------------------------*/
/* ------------------------------------------------------------------
This file is part of bzip2/libbzip2, a program and library for
lossless, block-sorting data compression.
bzip2/libbzip2 version 1.0.8 of 13 July 2019
Copyright (C) 1996-2019 Julian Seward <[email protected]>
Please read the WARNING, DISCLAIMER and PATENTS sections in the
README file.
This program is released under the terms of the license contained
in the file LICENSE.
------------------------------------------------------------------ */
/* CHANGES
0.9.0 -- original version.
0.9.0a/b -- no changes in this file.
0.9.0c -- made zero-length BZ_FLUSH work correctly in bzCompress().
fixed bzWrite/bzRead to ignore zero-length requests.
fixed bzread to correctly handle read requests after EOF.
wrong parameter order in call to bzDecompressInit in
bzBuffToBuffDecompress. Fixed.
*/
#include "libc/calls/calls.h"
#include "libc/mem/mem.h"
#include "third_party/bzip2/bzlib_private.inc"
/*---------------------------------------------------*/
/*--- Compression stuff ---*/
/*---------------------------------------------------*/
/*---------------------------------------------------*/
#ifndef BZ_NO_STDIO
void BZ2_bz__AssertH__fail ( int errcode )
{
fprintf(stderr,
"\n\nbzip2/libbzip2: internal error number %d.\n"
"This is a bug in bzip2/libbzip2, %s.\n"
"Please report it to: [email protected]. If this happened\n"
"when you were using some program which uses libbzip2 as a\n"
"component, you should also report this bug to the author(s)\n"
"of that program. Please make an effort to report this bug;\n"
"timely and accurate bug reports eventually lead to higher\n"
"quality software. Thanks.\n\n",
errcode,
BZ2_bzlibVersion()
);
if (errcode == 1007) {
fprintf(stderr,
"\n*** A special note about internal error number 1007 ***\n"
"\n"
"Experience suggests that a common cause of i.e. 1007\n"
"is unreliable memory or other hardware. The 1007 assertion\n"
"just happens to cross-check the results of huge numbers of\n"
"memory reads/writes, and so acts (unintendedly) as a stress\n"
"test of your memory system.\n"
"\n"
"I suggest the following: try compressing the file again,\n"
"possibly monitoring progress in detail with the -vv flag.\n"
"\n"
"* If the error cannot be reproduced, and/or happens at different\n"
" points in compression, you may have a flaky memory system.\n"
" Try a memory-test program. I have used Memtest86\n"
" (www.memtest86.com). At the time of writing it is free (GPLd).\n"
" Memtest86 tests memory much more thorougly than your BIOSs\n"
" power-on test, and may find failures that the BIOS doesn't.\n"
"\n"
"* If the error can be repeatably reproduced, this is a bug in\n"
" bzip2, and I would very much like to hear about it. Please\n"
" let me know, and, ideally, save a copy of the file causing the\n"
" problem -- without which I will be unable to investigate it.\n"
"\n"
);
}
exit(3);
}
#endif
/*---------------------------------------------------*/
static
int bz_config_ok ( void )
{
if (sizeof(int) != 4) return 0;
if (sizeof(short) != 2) return 0;
if (sizeof(char) != 1) return 0;
return 1;
}
/*---------------------------------------------------*/
static
void* default_bzalloc ( void* opaque, Int32 items, Int32 size )
{
void* v = malloc ( items * size );
return v;
}
static
void default_bzfree ( void* opaque, void* addr )
{
if (addr != NULL) free ( addr );
}
/*---------------------------------------------------*/
static
void prepare_new_block ( EState* s )
{
Int32 i;
s->nblock = 0;
s->numZ = 0;
s->state_out_pos = 0;
BZ_INITIALISE_CRC ( s->blockCRC );
for (i = 0; i < 256; i++) s->inUse[i] = False;
s->blockNo++;
}
/*---------------------------------------------------*/
static
void init_RL ( EState* s )
{
s->state_in_ch = 256;
s->state_in_len = 0;
}
static
Bool isempty_RL ( EState* s )
{
if (s->state_in_ch < 256 && s->state_in_len > 0)
return False; else
return True;
}
/*---------------------------------------------------*/
int BZ2_bzCompressInit
( bz_stream* strm,
int blockSize100k,
int verbosity,
int workFactor )
{
Int32 n;
EState* s;
if (!bz_config_ok()) return BZ_CONFIG_ERROR;
if (strm == NULL ||
blockSize100k < 1 || blockSize100k > 9 ||
workFactor < 0 || workFactor > 250)
return BZ_PARAM_ERROR;
if (workFactor == 0) workFactor = 30;
if (strm->bzalloc == NULL) strm->bzalloc = default_bzalloc;
if (strm->bzfree == NULL) strm->bzfree = default_bzfree;
s = BZALLOC( sizeof(EState) );
if (s == NULL) return BZ_MEM_ERROR;
s->strm = strm;
s->arr1 = NULL;
s->arr2 = NULL;
s->ftab = NULL;
n = 100000 * blockSize100k;
s->arr1 = BZALLOC( n * sizeof(UInt32) );
s->arr2 = BZALLOC( (n+BZ_N_OVERSHOOT) * sizeof(UInt32) );
s->ftab = BZALLOC( 65537 * sizeof(UInt32) );
if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) {
if (s->arr1 != NULL) BZFREE(s->arr1);
if (s->arr2 != NULL) BZFREE(s->arr2);
if (s->ftab != NULL) BZFREE(s->ftab);
if (s != NULL) BZFREE(s);
return BZ_MEM_ERROR;
}
s->blockNo = 0;
s->state = BZ_S_INPUT;
s->mode = BZ_M_RUNNING;
s->combinedCRC = 0;
s->blockSize100k = blockSize100k;
s->nblockMAX = 100000 * blockSize100k - 19;
s->verbosity = verbosity;
s->workFactor = workFactor;
s->block = (UChar*)s->arr2;
s->mtfv = (UInt16*)s->arr1;
s->zbits = NULL;
s->ptr = (UInt32*)s->arr1;
strm->state = s;
strm->total_in_lo32 = 0;
strm->total_in_hi32 = 0;
strm->total_out_lo32 = 0;
strm->total_out_hi32 = 0;
init_RL ( s );
prepare_new_block ( s );
return BZ_OK;
}
/*---------------------------------------------------*/
static
void add_pair_to_block ( EState* s )
{
Int32 i;
UChar ch = (UChar)(s->state_in_ch);
for (i = 0; i < s->state_in_len; i++) {
BZ_UPDATE_CRC( s->blockCRC, ch );
}
s->inUse[s->state_in_ch] = True;
switch (s->state_in_len) {
case 1:
s->block[s->nblock] = (UChar)ch; s->nblock++;
break;
case 2:
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
break;
case 3:
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
break;
default:
s->inUse[s->state_in_len-4] = True;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = ((UChar)(s->state_in_len-4));
s->nblock++;
break;
}
}
/*---------------------------------------------------*/
static
void flush_RL ( EState* s )
{
if (s->state_in_ch < 256) add_pair_to_block ( s );
init_RL ( s );
}
/*---------------------------------------------------*/
#define ADD_CHAR_TO_BLOCK(zs,zchh0) \
{ \
UInt32 zchh = (UInt32)(zchh0); \
/*-- fast track the common case --*/ \
if (zchh != zs->state_in_ch && \
zs->state_in_len == 1) { \
UChar ch = (UChar)(zs->state_in_ch); \
BZ_UPDATE_CRC( zs->blockCRC, ch ); \
zs->inUse[zs->state_in_ch] = True; \
zs->block[zs->nblock] = (UChar)ch; \
zs->nblock++; \
zs->state_in_ch = zchh; \
} \
else \
/*-- general, uncommon cases --*/ \
if (zchh != zs->state_in_ch || \
zs->state_in_len == 255) { \
if (zs->state_in_ch < 256) \
add_pair_to_block ( zs ); \
zs->state_in_ch = zchh; \
zs->state_in_len = 1; \
} else { \
zs->state_in_len++; \
} \
}
/*---------------------------------------------------*/
static
Bool copy_input_until_stop ( EState* s )
{
Bool progress_in = False;
if (s->mode == BZ_M_RUNNING) {
/*-- fast track the common case --*/
while (True) {
/*-- block full? --*/
if (s->nblock >= s->nblockMAX) break;
/*-- no input? --*/
if (s->strm->avail_in == 0) break;
progress_in = True;
ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) );
s->strm->next_in++;
s->strm->avail_in--;
s->strm->total_in_lo32++;
if (s->strm->total_in_lo32 == 0) s->strm->total_in_hi32++;
}
} else {
/*-- general, uncommon case --*/
while (True) {
/*-- block full? --*/
if (s->nblock >= s->nblockMAX) break;
/*-- no input? --*/
if (s->strm->avail_in == 0) break;
/*-- flush/finish end? --*/
if (s->avail_in_expect == 0) break;
progress_in = True;
ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) );
s->strm->next_in++;
s->strm->avail_in--;
s->strm->total_in_lo32++;
if (s->strm->total_in_lo32 == 0) s->strm->total_in_hi32++;
s->avail_in_expect--;
}
}
return progress_in;
}
/*---------------------------------------------------*/
static
Bool copy_output_until_stop ( EState* s )
{
Bool progress_out = False;
while (True) {
/*-- no output space? --*/
if (s->strm->avail_out == 0) break;
/*-- block done? --*/
if (s->state_out_pos >= s->numZ) break;
progress_out = True;
*(s->strm->next_out) = s->zbits[s->state_out_pos];
s->state_out_pos++;
s->strm->avail_out--;
s->strm->next_out++;
s->strm->total_out_lo32++;
if (s->strm->total_out_lo32 == 0) s->strm->total_out_hi32++;
}
return progress_out;
}
/*---------------------------------------------------*/
static
Bool handle_compress ( bz_stream* strm )
{
Bool progress_in = False;
Bool progress_out = False;
EState* s = strm->state;
while (True) {
if (s->state == BZ_S_OUTPUT) {
progress_out |= copy_output_until_stop ( s );
if (s->state_out_pos < s->numZ) break;
if (s->mode == BZ_M_FINISHING &&
s->avail_in_expect == 0 &&
isempty_RL(s)) break;
prepare_new_block ( s );
s->state = BZ_S_INPUT;
if (s->mode == BZ_M_FLUSHING &&
s->avail_in_expect == 0 &&
isempty_RL(s)) break;
}
if (s->state == BZ_S_INPUT) {
progress_in |= copy_input_until_stop ( s );
if (s->mode != BZ_M_RUNNING && s->avail_in_expect == 0) {
flush_RL ( s );
BZ2_compressBlock ( s, (Bool)(s->mode == BZ_M_FINISHING) );
s->state = BZ_S_OUTPUT;
}
else
if (s->nblock >= s->nblockMAX) {
BZ2_compressBlock ( s, False );
s->state = BZ_S_OUTPUT;
}
else
if (s->strm->avail_in == 0) {
break;
}
}
}
return progress_in || progress_out;
}
/*---------------------------------------------------*/
int BZ2_bzCompress ( bz_stream *strm, int action )
{
Bool progress;
EState* s;
if (strm == NULL) return BZ_PARAM_ERROR;
s = strm->state;
if (s == NULL) return BZ_PARAM_ERROR;
if (s->strm != strm) return BZ_PARAM_ERROR;
preswitch:
switch (s->mode) {
case BZ_M_IDLE:
return BZ_SEQUENCE_ERROR;
case BZ_M_RUNNING:
if (action == BZ_RUN) {
progress = handle_compress ( strm );
return progress ? BZ_RUN_OK : BZ_PARAM_ERROR;
}
else
if (action == BZ_FLUSH) {
s->avail_in_expect = strm->avail_in;
s->mode = BZ_M_FLUSHING;
goto preswitch;
}
else
if (action == BZ_FINISH) {
s->avail_in_expect = strm->avail_in;
s->mode = BZ_M_FINISHING;
goto preswitch;
}
else
return BZ_PARAM_ERROR;
case BZ_M_FLUSHING:
if (action != BZ_FLUSH) return BZ_SEQUENCE_ERROR;
if (s->avail_in_expect != s->strm->avail_in)
return BZ_SEQUENCE_ERROR;
progress = handle_compress ( strm );
if (s->avail_in_expect > 0 || !isempty_RL(s) ||
s->state_out_pos < s->numZ) return BZ_FLUSH_OK;
s->mode = BZ_M_RUNNING;
return BZ_RUN_OK;
case BZ_M_FINISHING:
if (action != BZ_FINISH) return BZ_SEQUENCE_ERROR;
if (s->avail_in_expect != s->strm->avail_in)
return BZ_SEQUENCE_ERROR;
progress = handle_compress ( strm );
if (!progress) return BZ_SEQUENCE_ERROR;
if (s->avail_in_expect > 0 || !isempty_RL(s) ||
s->state_out_pos < s->numZ) return BZ_FINISH_OK;
s->mode = BZ_M_IDLE;
return BZ_STREAM_END;
}
return BZ_OK; /*--not reached--*/
}
/*---------------------------------------------------*/
int BZ2_bzCompressEnd ( bz_stream *strm )
{
EState* s;
if (strm == NULL) return BZ_PARAM_ERROR;
s = strm->state;
if (s == NULL) return BZ_PARAM_ERROR;
if (s->strm != strm) return BZ_PARAM_ERROR;
if (s->arr1 != NULL) BZFREE(s->arr1);
if (s->arr2 != NULL) BZFREE(s->arr2);
if (s->ftab != NULL) BZFREE(s->ftab);
BZFREE(strm->state);
strm->state = NULL;
return BZ_OK;
}
/*---------------------------------------------------*/
/*--- Decompression stuff ---*/
/*---------------------------------------------------*/
/*---------------------------------------------------*/
int BZ2_bzDecompressInit
( bz_stream* strm,
int verbosity,
int small )
{
DState* s;
if (!bz_config_ok()) return BZ_CONFIG_ERROR;
if (strm == NULL) return BZ_PARAM_ERROR;
if (small != 0 && small != 1) return BZ_PARAM_ERROR;
if (verbosity < 0 || verbosity > 4) return BZ_PARAM_ERROR;
if (strm->bzalloc == NULL) strm->bzalloc = default_bzalloc;
if (strm->bzfree == NULL) strm->bzfree = default_bzfree;
s = BZALLOC( sizeof(DState) );
if (s == NULL) return BZ_MEM_ERROR;
s->strm = strm;
strm->state = s;
s->state = BZ_X_MAGIC_1;
s->bsLive = 0;
s->bsBuff = 0;
s->calculatedCombinedCRC = 0;
strm->total_in_lo32 = 0;
strm->total_in_hi32 = 0;
strm->total_out_lo32 = 0;
strm->total_out_hi32 = 0;
s->smallDecompress = (Bool)small;
s->ll4 = NULL;
s->ll16 = NULL;
s->tt = NULL;
s->currBlockNo = 0;
s->verbosity = verbosity;
return BZ_OK;
}
/*---------------------------------------------------*/
/* Return True iff data corruption is discovered.
Returns False if there is no problem.
*/
static
Bool unRLE_obuf_to_output_FAST ( DState* s )
{
UChar k1;
if (s->blockRandomised) {
while (True) {
/* try to finish existing run */
while (True) {
if (s->strm->avail_out == 0) return False;
if (s->state_out_len == 0) break;
*( (UChar*)(s->strm->next_out) ) = s->state_out_ch;
BZ_UPDATE_CRC ( s->calculatedBlockCRC, s->state_out_ch );
s->state_out_len--;
s->strm->next_out++;
s->strm->avail_out--;
s->strm->total_out_lo32++;
if (s->strm->total_out_lo32 == 0) s->strm->total_out_hi32++;
}
/* can a new run be started? */
if (s->nblock_used == s->save_nblock+1) return False;
/* Only caused by corrupt data stream? */
if (s->nblock_used > s->save_nblock+1)
return True;
s->state_out_len = 1;
s->state_out_ch = s->k0;
BZ_GET_FAST(k1); BZ_RAND_UPD_MASK;
k1 ^= BZ_RAND_MASK; s->nblock_used++;
if (s->nblock_used == s->save_nblock+1) continue;
if (k1 != s->k0) { s->k0 = k1; continue; };
s->state_out_len = 2;
BZ_GET_FAST(k1); BZ_RAND_UPD_MASK;
k1 ^= BZ_RAND_MASK; s->nblock_used++;
if (s->nblock_used == s->save_nblock+1) continue;
if (k1 != s->k0) { s->k0 = k1; continue; };
s->state_out_len = 3;
BZ_GET_FAST(k1); BZ_RAND_UPD_MASK;
k1 ^= BZ_RAND_MASK; s->nblock_used++;
if (s->nblock_used == s->save_nblock+1) continue;
if (k1 != s->k0) { s->k0 = k1; continue; };
BZ_GET_FAST(k1); BZ_RAND_UPD_MASK;
k1 ^= BZ_RAND_MASK; s->nblock_used++;
s->state_out_len = ((Int32)k1) + 4;
BZ_GET_FAST(s->k0); BZ_RAND_UPD_MASK;
s->k0 ^= BZ_RAND_MASK; s->nblock_used++;
}
} else {
/* restore */
UInt32 c_calculatedBlockCRC = s->calculatedBlockCRC;
UChar c_state_out_ch = s->state_out_ch;
Int32 c_state_out_len = s->state_out_len;
Int32 c_nblock_used = s->nblock_used;
Int32 c_k0 = s->k0;
UInt32* c_tt = s->tt;
UInt32 c_tPos = s->tPos;
char* cs_next_out = s->strm->next_out;
unsigned int cs_avail_out = s->strm->avail_out;
Int32 ro_blockSize100k = s->blockSize100k;
/* end restore */
UInt32 avail_out_INIT = cs_avail_out;
Int32 s_save_nblockPP = s->save_nblock+1;
unsigned int total_out_lo32_old;
while (True) {
/* try to finish existing run */
if (c_state_out_len > 0) {
while (True) {
if (cs_avail_out == 0) goto return_notr;
if (c_state_out_len == 1) break;
*( (UChar*)(cs_next_out) ) = c_state_out_ch;
BZ_UPDATE_CRC ( c_calculatedBlockCRC, c_state_out_ch );
c_state_out_len--;
cs_next_out++;
cs_avail_out--;
}
s_state_out_len_eq_one:
{
if (cs_avail_out == 0) {
c_state_out_len = 1; goto return_notr;
};
*( (UChar*)(cs_next_out) ) = c_state_out_ch;
BZ_UPDATE_CRC ( c_calculatedBlockCRC, c_state_out_ch );
cs_next_out++;
cs_avail_out--;
}
}
/* Only caused by corrupt data stream? */
if (c_nblock_used > s_save_nblockPP)
return True;
/* can a new run be started? */
if (c_nblock_used == s_save_nblockPP) {
c_state_out_len = 0; goto return_notr;
};
c_state_out_ch = c_k0;
BZ_GET_FAST_C(k1); c_nblock_used++;
if (k1 != c_k0) {
c_k0 = k1; goto s_state_out_len_eq_one;
};
if (c_nblock_used == s_save_nblockPP)
goto s_state_out_len_eq_one;
c_state_out_len = 2;
BZ_GET_FAST_C(k1); c_nblock_used++;
if (c_nblock_used == s_save_nblockPP) continue;
if (k1 != c_k0) { c_k0 = k1; continue; };
c_state_out_len = 3;
BZ_GET_FAST_C(k1); c_nblock_used++;
if (c_nblock_used == s_save_nblockPP) continue;
if (k1 != c_k0) { c_k0 = k1; continue; };
BZ_GET_FAST_C(k1); c_nblock_used++;
c_state_out_len = ((Int32)k1) + 4;
BZ_GET_FAST_C(c_k0); c_nblock_used++;
}
return_notr:
total_out_lo32_old = s->strm->total_out_lo32;
s->strm->total_out_lo32 += (avail_out_INIT - cs_avail_out);
if (s->strm->total_out_lo32 < total_out_lo32_old)
s->strm->total_out_hi32++;
/* save */
s->calculatedBlockCRC = c_calculatedBlockCRC;
s->state_out_ch = c_state_out_ch;
s->state_out_len = c_state_out_len;
s->nblock_used = c_nblock_used;
s->k0 = c_k0;
s->tt = c_tt;
s->tPos = c_tPos;
s->strm->next_out = cs_next_out;
s->strm->avail_out = cs_avail_out;
/* end save */
}
return False;
}
/*---------------------------------------------------*/
__inline__ Int32 BZ2_indexIntoF ( Int32 indx, Int32 *cftab )
{
Int32 nb, na, mid;
nb = 0;
na = 256;
do {
mid = (nb + na) >> 1;
if (indx >= cftab[mid]) nb = mid; else na = mid;
}
while (na - nb != 1);
return nb;
}
/*---------------------------------------------------*/
/* Return True iff data corruption is discovered.
Returns False if there is no problem.
*/
static
Bool unRLE_obuf_to_output_SMALL ( DState* s )
{
UChar k1;
if (s->blockRandomised) {
while (True) {
/* try to finish existing run */
while (True) {
if (s->strm->avail_out == 0) return False;
if (s->state_out_len == 0) break;
*( (UChar*)(s->strm->next_out) ) = s->state_out_ch;
BZ_UPDATE_CRC ( s->calculatedBlockCRC, s->state_out_ch );
s->state_out_len--;
s->strm->next_out++;
s->strm->avail_out--;
s->strm->total_out_lo32++;
if (s->strm->total_out_lo32 == 0) s->strm->total_out_hi32++;
}
/* can a new run be started? */
if (s->nblock_used == s->save_nblock+1) return False;
/* Only caused by corrupt data stream? */
if (s->nblock_used > s->save_nblock+1)
return True;
s->state_out_len = 1;
s->state_out_ch = s->k0;
BZ_GET_SMALL(k1); BZ_RAND_UPD_MASK;
k1 ^= BZ_RAND_MASK; s->nblock_used++;
if (s->nblock_used == s->save_nblock+1) continue;
if (k1 != s->k0) { s->k0 = k1; continue; };
s->state_out_len = 2;
BZ_GET_SMALL(k1); BZ_RAND_UPD_MASK;
k1 ^= BZ_RAND_MASK; s->nblock_used++;
if (s->nblock_used == s->save_nblock+1) continue;
if (k1 != s->k0) { s->k0 = k1; continue; };
s->state_out_len = 3;
BZ_GET_SMALL(k1); BZ_RAND_UPD_MASK;
k1 ^= BZ_RAND_MASK; s->nblock_used++;
if (s->nblock_used == s->save_nblock+1) continue;
if (k1 != s->k0) { s->k0 = k1; continue; };
BZ_GET_SMALL(k1); BZ_RAND_UPD_MASK;
k1 ^= BZ_RAND_MASK; s->nblock_used++;
s->state_out_len = ((Int32)k1) + 4;
BZ_GET_SMALL(s->k0); BZ_RAND_UPD_MASK;
s->k0 ^= BZ_RAND_MASK; s->nblock_used++;
}
} else {
while (True) {
/* try to finish existing run */
while (True) {
if (s->strm->avail_out == 0) return False;
if (s->state_out_len == 0) break;
*( (UChar*)(s->strm->next_out) ) = s->state_out_ch;
BZ_UPDATE_CRC ( s->calculatedBlockCRC, s->state_out_ch );
s->state_out_len--;
s->strm->next_out++;
s->strm->avail_out--;
s->strm->total_out_lo32++;
if (s->strm->total_out_lo32 == 0) s->strm->total_out_hi32++;
}
/* can a new run be started? */
if (s->nblock_used == s->save_nblock+1) return False;
/* Only caused by corrupt data stream? */
if (s->nblock_used > s->save_nblock+1)
return True;
s->state_out_len = 1;
s->state_out_ch = s->k0;
BZ_GET_SMALL(k1); s->nblock_used++;
if (s->nblock_used == s->save_nblock+1) continue;
if (k1 != s->k0) { s->k0 = k1; continue; };
s->state_out_len = 2;
BZ_GET_SMALL(k1); s->nblock_used++;
if (s->nblock_used == s->save_nblock+1) continue;
if (k1 != s->k0) { s->k0 = k1; continue; };
s->state_out_len = 3;
BZ_GET_SMALL(k1); s->nblock_used++;
if (s->nblock_used == s->save_nblock+1) continue;
if (k1 != s->k0) { s->k0 = k1; continue; };
BZ_GET_SMALL(k1); s->nblock_used++;
s->state_out_len = ((Int32)k1) + 4;
BZ_GET_SMALL(s->k0); s->nblock_used++;
}
}
}
/*---------------------------------------------------*/
int BZ2_bzDecompress ( bz_stream *strm )
{
Bool corrupt;
DState* s;
if (strm == NULL) return BZ_PARAM_ERROR;
s = strm->state;
if (s == NULL) return BZ_PARAM_ERROR;
if (s->strm != strm) return BZ_PARAM_ERROR;
while (True) {
if (s->state == BZ_X_IDLE) return BZ_SEQUENCE_ERROR;
if (s->state == BZ_X_OUTPUT) {
if (s->smallDecompress)
corrupt = unRLE_obuf_to_output_SMALL ( s ); else
corrupt = unRLE_obuf_to_output_FAST ( s );
if (corrupt) return BZ_DATA_ERROR;
if (s->nblock_used == s->save_nblock+1 && s->state_out_len == 0) {
BZ_FINALISE_CRC ( s->calculatedBlockCRC );
if (s->verbosity >= 3)
VPrintf2 ( " {0x%08x, 0x%08x}", s->storedBlockCRC,
s->calculatedBlockCRC );
if (s->verbosity >= 2) VPrintf0 ( "]" );
if (s->calculatedBlockCRC != s->storedBlockCRC)
return BZ_DATA_ERROR;
s->calculatedCombinedCRC
= (s->calculatedCombinedCRC << 1) |
(s->calculatedCombinedCRC >> 31);
s->calculatedCombinedCRC ^= s->calculatedBlockCRC;
s->state = BZ_X_BLKHDR_1;
} else {
return BZ_OK;
}
}
if (s->state >= BZ_X_MAGIC_1) {
Int32 r = BZ2_decompress ( s );
if (r == BZ_STREAM_END) {
if (s->verbosity >= 3)
VPrintf2 ( "\n combined CRCs: stored = 0x%08x, computed = 0x%08x",
s->storedCombinedCRC, s->calculatedCombinedCRC );
if (s->calculatedCombinedCRC != s->storedCombinedCRC)
return BZ_DATA_ERROR;
return r;
}
if (s->state != BZ_X_OUTPUT) return r;
}
}
AssertH ( 0, 6001 );
return 0; /*NOTREACHED*/
}
/*---------------------------------------------------*/
int BZ2_bzDecompressEnd ( bz_stream *strm )
{
DState* s;
if (strm == NULL) return BZ_PARAM_ERROR;
s = strm->state;
if (s == NULL) return BZ_PARAM_ERROR;
if (s->strm != strm) return BZ_PARAM_ERROR;
if (s->tt != NULL) BZFREE(s->tt);
if (s->ll16 != NULL) BZFREE(s->ll16);
if (s->ll4 != NULL) BZFREE(s->ll4);
BZFREE(strm->state);
strm->state = NULL;
return BZ_OK;
}
/*---------------------------------------------------*/
/*--- File I/O stuff ---*/
/*---------------------------------------------------*/
#define BZ_SETERR(eee) \
{ \
if (bzerror != NULL) *bzerror = eee; \
if (bzf != NULL) bzf->lastErr = eee; \
}
typedef
struct {
FILE* handle;
Char buf[BZ_MAX_UNUSED];
Int32 bufN;
Bool writing;
bz_stream strm;
Int32 lastErr;
Bool initialisedOk;
}
bzFile;
/*---------------------------------------------*/
static Bool myfeof ( FILE* f )
{
Int32 c = fgetc ( f );
if (c == EOF) return True;
ungetc ( c, f );
return False;
}
/*---------------------------------------------------*/
BZFILE* BZ2_bzWriteOpen
( int* bzerror,
FILE* f,
int blockSize100k,
int verbosity,
int workFactor )
{
Int32 ret;
bzFile* bzf = NULL;
BZ_SETERR(BZ_OK);
if (f == NULL ||
(blockSize100k < 1 || blockSize100k > 9) ||
(workFactor < 0 || workFactor > 250) ||
(verbosity < 0 || verbosity > 4))
{ BZ_SETERR(BZ_PARAM_ERROR); return NULL; };
if (ferror(f))
{ BZ_SETERR(BZ_IO_ERROR); return NULL; };
bzf = malloc ( sizeof(bzFile) );
if (bzf == NULL)
{ BZ_SETERR(BZ_MEM_ERROR); return NULL; };
BZ_SETERR(BZ_OK);
bzf->initialisedOk = False;
bzf->bufN = 0;
bzf->handle = f;
bzf->writing = True;
bzf->strm.bzalloc = NULL;
bzf->strm.bzfree = NULL;
bzf->strm.opaque = NULL;
if (workFactor == 0) workFactor = 30;
ret = BZ2_bzCompressInit ( &(bzf->strm), blockSize100k,
verbosity, workFactor );
if (ret != BZ_OK)
{ BZ_SETERR(ret); free(bzf); return NULL; };
bzf->strm.avail_in = 0;
bzf->initialisedOk = True;
return bzf;
}
/*---------------------------------------------------*/
void BZ2_bzWrite
( int* bzerror,
BZFILE* b,
void* buf,
int len )
{
Int32 n, n2, ret;
bzFile* bzf = (bzFile*)b;
BZ_SETERR(BZ_OK);
if (bzf == NULL || buf == NULL || len < 0)
{ BZ_SETERR(BZ_PARAM_ERROR); return; };
if (!(bzf->writing))
{ BZ_SETERR(BZ_SEQUENCE_ERROR); return; };
if (ferror(bzf->handle))
{ BZ_SETERR(BZ_IO_ERROR); return; };
if (len == 0)
{ BZ_SETERR(BZ_OK); return; };
bzf->strm.avail_in = len;
bzf->strm.next_in = buf;
while (True) {
bzf->strm.avail_out = BZ_MAX_UNUSED;
bzf->strm.next_out = bzf->buf;
ret = BZ2_bzCompress ( &(bzf->strm), BZ_RUN );
if (ret != BZ_RUN_OK)
{ BZ_SETERR(ret); return; };
if (bzf->strm.avail_out < BZ_MAX_UNUSED) {
n = BZ_MAX_UNUSED - bzf->strm.avail_out;
n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
n, bzf->handle );
if (n != n2 || ferror(bzf->handle))
{ BZ_SETERR(BZ_IO_ERROR); return; };
}
if (bzf->strm.avail_in == 0)
{ BZ_SETERR(BZ_OK); return; };
}
}
/*---------------------------------------------------*/
void BZ2_bzWriteClose
( int* bzerror,
BZFILE* b,
int abandon,
unsigned int* nbytes_in,
unsigned int* nbytes_out )
{
BZ2_bzWriteClose64 ( bzerror, b, abandon,
nbytes_in, NULL, nbytes_out, NULL );
}
void BZ2_bzWriteClose64
( int* bzerror,
BZFILE* b,
int abandon,
unsigned int* nbytes_in_lo32,
unsigned int* nbytes_in_hi32,
unsigned int* nbytes_out_lo32,
unsigned int* nbytes_out_hi32 )
{
Int32 n, n2, ret;
bzFile* bzf = (bzFile*)b;
if (bzf == NULL)
{ BZ_SETERR(BZ_OK); return; };
if (!(bzf->writing))
{ BZ_SETERR(BZ_SEQUENCE_ERROR); return; };
if (ferror(bzf->handle))
{ BZ_SETERR(BZ_IO_ERROR); return; };
if (nbytes_in_lo32 != NULL) *nbytes_in_lo32 = 0;
if (nbytes_in_hi32 != NULL) *nbytes_in_hi32 = 0;
if (nbytes_out_lo32 != NULL) *nbytes_out_lo32 = 0;
if (nbytes_out_hi32 != NULL) *nbytes_out_hi32 = 0;
if ((!abandon) && bzf->lastErr == BZ_OK) {
while (True) {
bzf->strm.avail_out = BZ_MAX_UNUSED;
bzf->strm.next_out = bzf->buf;
ret = BZ2_bzCompress ( &(bzf->strm), BZ_FINISH );
if (ret != BZ_FINISH_OK && ret != BZ_STREAM_END)
{ BZ_SETERR(ret); return; };
if (bzf->strm.avail_out < BZ_MAX_UNUSED) {
n = BZ_MAX_UNUSED - bzf->strm.avail_out;
n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
n, bzf->handle );
if (n != n2 || ferror(bzf->handle))
{ BZ_SETERR(BZ_IO_ERROR); return; };
}
if (ret == BZ_STREAM_END) break;
}
}
if ( !abandon && !ferror ( bzf->handle ) ) {
fflush ( bzf->handle );
if (ferror(bzf->handle))
{ BZ_SETERR(BZ_IO_ERROR); return; };
}
if (nbytes_in_lo32 != NULL)
*nbytes_in_lo32 = bzf->strm.total_in_lo32;
if (nbytes_in_hi32 != NULL)
*nbytes_in_hi32 = bzf->strm.total_in_hi32;
if (nbytes_out_lo32 != NULL)
*nbytes_out_lo32 = bzf->strm.total_out_lo32;
if (nbytes_out_hi32 != NULL)
*nbytes_out_hi32 = bzf->strm.total_out_hi32;
BZ_SETERR(BZ_OK);
BZ2_bzCompressEnd ( &(bzf->strm) );
free ( bzf );
}
/*---------------------------------------------------*/
BZFILE* BZ2_bzReadOpen
( int* bzerror,
FILE* f,
int verbosity,
int small,
void* unused,
int nUnused )
{
bzFile* bzf = NULL;
int ret;
BZ_SETERR(BZ_OK);
if (f == NULL ||
(small != 0 && small != 1) ||
(verbosity < 0 || verbosity > 4) ||
(unused == NULL && nUnused != 0) ||
(unused != NULL && (nUnused < 0 || nUnused > BZ_MAX_UNUSED)))
{ BZ_SETERR(BZ_PARAM_ERROR); return NULL; };
if (ferror(f))
{ BZ_SETERR(BZ_IO_ERROR); return NULL; };
bzf = malloc ( sizeof(bzFile) );
if (bzf == NULL)
{ BZ_SETERR(BZ_MEM_ERROR); return NULL; };
BZ_SETERR(BZ_OK);
bzf->initialisedOk = False;
bzf->handle = f;
bzf->bufN = 0;
bzf->writing = False;
bzf->strm.bzalloc = NULL;
bzf->strm.bzfree = NULL;
bzf->strm.opaque = NULL;
while (nUnused > 0) {
bzf->buf[bzf->bufN] = *((UChar*)(unused)); bzf->bufN++;
unused = ((void*)( 1 + ((UChar*)(unused)) ));
nUnused--;
}
ret = BZ2_bzDecompressInit ( &(bzf->strm), verbosity, small );
if (ret != BZ_OK)
{ BZ_SETERR(ret); free(bzf); return NULL; };
bzf->strm.avail_in = bzf->bufN;
bzf->strm.next_in = bzf->buf;
bzf->initialisedOk = True;
return bzf;
}
/*---------------------------------------------------*/
void BZ2_bzReadClose ( int *bzerror, BZFILE *b )
{
bzFile* bzf = (bzFile*)b;
BZ_SETERR(BZ_OK);
if (bzf == NULL)
{ BZ_SETERR(BZ_OK); return; };
if (bzf->writing)
{ BZ_SETERR(BZ_SEQUENCE_ERROR); return; };
if (bzf->initialisedOk)
(void)BZ2_bzDecompressEnd ( &(bzf->strm) );
free ( bzf );
}
/*---------------------------------------------------*/
int BZ2_bzRead
( int* bzerror,
BZFILE* b,
void* buf,
int len )
{
Int32 n, ret;
bzFile* bzf = (bzFile*)b;
BZ_SETERR(BZ_OK);
if (bzf == NULL || buf == NULL || len < 0)
{ BZ_SETERR(BZ_PARAM_ERROR); return 0; };
if (bzf->writing)
{ BZ_SETERR(BZ_SEQUENCE_ERROR); return 0; };
if (len == 0)
{ BZ_SETERR(BZ_OK); return 0; };
bzf->strm.avail_out = len;
bzf->strm.next_out = buf;
while (True) {
if (ferror(bzf->handle))
{ BZ_SETERR(BZ_IO_ERROR); return 0; };
if (bzf->strm.avail_in == 0 && !myfeof(bzf->handle)) {
n = fread ( bzf->buf, sizeof(UChar),
BZ_MAX_UNUSED, bzf->handle );
if (ferror(bzf->handle))
{ BZ_SETERR(BZ_IO_ERROR); return 0; };
bzf->bufN = n;
bzf->strm.avail_in = bzf->bufN;
bzf->strm.next_in = bzf->buf;
}
ret = BZ2_bzDecompress ( &(bzf->strm) );
if (ret != BZ_OK && ret != BZ_STREAM_END)
{ BZ_SETERR(ret); return 0; };
if (ret == BZ_OK && myfeof(bzf->handle) &&
bzf->strm.avail_in == 0 && bzf->strm.avail_out > 0)
{ BZ_SETERR(BZ_UNEXPECTED_EOF); return 0; };
if (ret == BZ_STREAM_END)
{ BZ_SETERR(BZ_STREAM_END);
return len - bzf->strm.avail_out; };
if (bzf->strm.avail_out == 0)
{ BZ_SETERR(BZ_OK); return len; };
}
return 0; /*not reached*/
}
/*---------------------------------------------------*/
void BZ2_bzReadGetUnused
( int* bzerror,
BZFILE* b,
void** unused,
int* nUnused )
{
bzFile* bzf = (bzFile*)b;
if (bzf == NULL)
{ BZ_SETERR(BZ_PARAM_ERROR); return; };
if (bzf->lastErr != BZ_STREAM_END)
{ BZ_SETERR(BZ_SEQUENCE_ERROR); return; };
if (unused == NULL || nUnused == NULL)
{ BZ_SETERR(BZ_PARAM_ERROR); return; };
BZ_SETERR(BZ_OK);
*nUnused = bzf->strm.avail_in;
*unused = bzf->strm.next_in;
}
/*---------------------------------------------------*/
/*--- Misc convenience stuff ---*/
/*---------------------------------------------------*/
/*---------------------------------------------------*/
int BZ2_bzBuffToBuffCompress
( char* dest,
unsigned int* destLen,
char* source,
unsigned int sourceLen,
int blockSize100k,
int verbosity,
int workFactor )
{
bz_stream strm;
int ret;
if (dest == NULL || destLen == NULL ||
source == NULL ||
blockSize100k < 1 || blockSize100k > 9 ||
verbosity < 0 || verbosity > 4 ||
workFactor < 0 || workFactor > 250)
return BZ_PARAM_ERROR;
if (workFactor == 0) workFactor = 30;
strm.bzalloc = NULL;
strm.bzfree = NULL;
strm.opaque = NULL;
ret = BZ2_bzCompressInit ( &strm, blockSize100k,
verbosity, workFactor );
if (ret != BZ_OK) return ret;
strm.next_in = source;
strm.next_out = dest;
strm.avail_in = sourceLen;
strm.avail_out = *destLen;
ret = BZ2_bzCompress ( &strm, BZ_FINISH );
if (ret == BZ_FINISH_OK) goto output_overflow;
if (ret != BZ_STREAM_END) goto errhandler;
/* normal termination */
*destLen -= strm.avail_out;
BZ2_bzCompressEnd ( &strm );
return BZ_OK;
output_overflow:
BZ2_bzCompressEnd ( &strm );
return BZ_OUTBUFF_FULL;
errhandler:
BZ2_bzCompressEnd ( &strm );
return ret;
}
/*---------------------------------------------------*/
int BZ2_bzBuffToBuffDecompress
( char* dest,
unsigned int* destLen,
char* source,
unsigned int sourceLen,
int small,
int verbosity )
{
bz_stream strm;
int ret;
if (dest == NULL || destLen == NULL ||
source == NULL ||
(small != 0 && small != 1) ||
verbosity < 0 || verbosity > 4)
return BZ_PARAM_ERROR;
strm.bzalloc = NULL;
strm.bzfree = NULL;
strm.opaque = NULL;
ret = BZ2_bzDecompressInit ( &strm, verbosity, small );
if (ret != BZ_OK) return ret;
strm.next_in = source;
strm.next_out = dest;
strm.avail_in = sourceLen;
strm.avail_out = *destLen;
ret = BZ2_bzDecompress ( &strm );
if (ret == BZ_OK) goto output_overflow_or_eof;
if (ret != BZ_STREAM_END) goto errhandler;
/* normal termination */
*destLen -= strm.avail_out;
BZ2_bzDecompressEnd ( &strm );
return BZ_OK;
output_overflow_or_eof:
if (strm.avail_out > 0) {
BZ2_bzDecompressEnd ( &strm );
return BZ_UNEXPECTED_EOF;
} else {
BZ2_bzDecompressEnd ( &strm );
return BZ_OUTBUFF_FULL;
};
errhandler:
BZ2_bzDecompressEnd ( &strm );
return ret;
}
/*---------------------------------------------------*/
/*--
Code contributed by Yoshioka Tsuneo ([email protected])
to support better zlib compatibility.
This code is not _officially_ part of libbzip2 (yet);
I haven't tested it, documented it, or considered the
threading-safeness of it.
If this code breaks, please contact both Yoshioka and me.
--*/
/*---------------------------------------------------*/
/*---------------------------------------------------*/
/*--
return version like "0.9.5d, 4-Sept-1999".
--*/
const char * BZ2_bzlibVersion(void)
{
return BZ_VERSION;
}
#ifndef BZ_NO_STDIO
/*---------------------------------------------------*/
#if defined(_WIN32) || defined(OS2) || defined(MSDOS)
# include <fcntl.h>
# include <io.h>
# define SET_BINARY_MODE(file) setmode(fileno(file),O_BINARY)
#else
# define SET_BINARY_MODE(file)
#endif
static
BZFILE * bzopen_or_bzdopen
( const char *path, /* no use when bzdopen */
int fd, /* no use when bzdopen */
const char *mode,
int open_mode) /* bzopen: 0, bzdopen:1 */
{
int bzerr;
char unused[BZ_MAX_UNUSED];
int blockSize100k = 9;
int writing = 0;
char mode2[10] = "";
FILE *fp = NULL;
BZFILE *bzfp = NULL;
int verbosity = 0;
int workFactor = 30;
int smallMode = 0;
int nUnused = 0;
if (mode == NULL) return NULL;
while (*mode) {
switch (*mode) {
case 'r':
writing = 0; break;
case 'w':
writing = 1; break;
case 's':
smallMode = 1; break;
default:
if (isdigit((int)(*mode))) {
blockSize100k = *mode-BZ_HDR_0;
}
}
mode++;
}
strcat(mode2, writing ? "w" : "r" );
strcat(mode2,"b"); /* binary mode */
if (open_mode==0) {
if (path==NULL || strcmp(path,"")==0) {
fp = (writing ? stdout : stdin);
SET_BINARY_MODE(fp);
} else {
fp = fopen(path,mode2);
}
} else {
#ifdef BZ_STRICT_ANSI
fp = NULL;
#else
fp = fdopen(fd,mode2);
#endif
}
if (fp == NULL) return NULL;
if (writing) {
/* Guard against total chaos and anarchy -- JRS */
if (blockSize100k < 1) blockSize100k = 1;
if (blockSize100k > 9) blockSize100k = 9;
bzfp = BZ2_bzWriteOpen(&bzerr,fp,blockSize100k,
verbosity,workFactor);
} else {
bzfp = BZ2_bzReadOpen(&bzerr,fp,verbosity,smallMode,
unused,nUnused);
}
if (bzfp == NULL) {
if (fp != stdin && fp != stdout) fclose(fp);
return NULL;
}
return bzfp;
}
/*---------------------------------------------------*/
/*--
open file for read or write.
ex) bzopen("file","w9")
case path="" or NULL => use stdin or stdout.
--*/
BZFILE * BZ2_bzopen
( const char *path,
const char *mode )
{
return bzopen_or_bzdopen(path,-1,mode,/*bzopen*/0);
}
/*---------------------------------------------------*/
BZFILE * BZ2_bzdopen
( int fd,
const char *mode )
{
return bzopen_or_bzdopen(NULL,fd,mode,/*bzdopen*/1);
}
/*---------------------------------------------------*/
int BZ2_bzread (BZFILE* b, void* buf, int len )
{
int bzerr, nread;
if (((bzFile*)b)->lastErr == BZ_STREAM_END) return 0;
nread = BZ2_bzRead(&bzerr,b,buf,len);
if (bzerr == BZ_OK || bzerr == BZ_STREAM_END) {
return nread;
} else {
return -1;
}
}
/*---------------------------------------------------*/
int BZ2_bzwrite (BZFILE* b, void* buf, int len )
{
int bzerr;
BZ2_bzWrite(&bzerr,b,buf,len);
if(bzerr == BZ_OK){
return len;
}else{
return -1;
}
}
/*---------------------------------------------------*/
int BZ2_bzflush (BZFILE *b)
{
/* do nothing now... */
return 0;
}
/*---------------------------------------------------*/
void BZ2_bzclose (BZFILE* b)
{
int bzerr;
FILE *fp;
if (b==NULL) {return;}
fp = ((bzFile *)b)->handle;
if(((bzFile*)b)->writing){
BZ2_bzWriteClose(&bzerr,b,0,NULL,NULL);
if(bzerr != BZ_OK){
BZ2_bzWriteClose(NULL,b,1,NULL,NULL);
}
}else{
BZ2_bzReadClose(&bzerr,b);
}
if(fp!=stdin && fp!=stdout){
fclose(fp);
}
}
/*---------------------------------------------------*/
/*--
return last error code
--*/
static const char *bzerrorstrings[] = {
"OK"
,"SEQUENCE_ERROR"
,"PARAM_ERROR"
,"MEM_ERROR"
,"DATA_ERROR"
,"DATA_ERROR_MAGIC"
,"IO_ERROR"
,"UNEXPECTED_EOF"
,"OUTBUFF_FULL"
,"CONFIG_ERROR"
,"???" /* for future */
,"???" /* for future */
,"???" /* for future */
,"???" /* for future */
,"???" /* for future */
,"???" /* for future */
};
const char * BZ2_bzerror (BZFILE *b, int *errnum)
{
int err = ((bzFile *)b)->lastErr;
if(err>0) err = 0;
*errnum = err;
return bzerrorstrings[err*-1];
}
#endif
/*-------------------------------------------------------------*/
/*--- end bzlib.c ---*/
/*-------------------------------------------------------------*/
| 45,840 | 1,574 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzip2.txt |
NAME
bzip2, bunzip2 - a block-sorting file compressor, v1.0.8
bzcat - decompresses files to stdout
bzip2recover - recovers data from damaged bzip2 files
SYNOPSIS
bzip2 [ -cdfkqstvzVL123456789 ] [ filenames ... ]
bunzip2 [ -fkvsVL ] [ filenames ... ]
bzcat [ -s ] [ filenames ... ]
bzip2recover filename
DESCRIPTION
bzip2 compresses files using the Burrows-Wheeler block
sorting text compression algorithm, and Huffman coding.
Compression is generally considerably better than that
achieved by more conventional LZ77/LZ78-based compressors,
and approaches the performance of the PPM family of sta-
tistical compressors.
The command-line options are deliberately very similar to
those of GNU gzip, but they are not identical.
bzip2 expects a list of file names to accompany the com-
mand-line flags. Each file is replaced by a compressed
version of itself, with the name "original_name.bz2".
Each compressed file has the same modification date, per-
missions, and, when possible, ownership as the correspond-
ing original, so that these properties can be correctly
restored at decompression time. File name handling is
naive in the sense that there is no mechanism for preserv-
ing original file names, permissions, ownerships or dates
in filesystems which lack these concepts, or have serious
file name length restrictions, such as MS-DOS.
bzip2 and bunzip2 will by default not overwrite existing
files. If you want this to happen, specify the -f flag.
If no file names are specified, bzip2 compresses from
standard input to standard output. In this case, bzip2
will decline to write compressed output to a terminal, as
this would be entirely incomprehensible and therefore
pointless.
bunzip2 (or bzip2 -d) decompresses all specified files.
Files which were not created by bzip2 will be detected and
ignored, and a warning issued. bzip2 attempts to guess
the filename for the decompressed file from that of the
compressed file as follows:
filename.bz2 becomes filename
filename.bz becomes filename
filename.tbz2 becomes filename.tar
filename.tbz becomes filename.tar
anyothername becomes anyothername.out
If the file does not end in one of the recognised endings,
.bz2, .bz, .tbz2 or .tbz, bzip2 complains that it cannot
guess the name of the original file, and uses the original
name with .out appended.
As with compression, supplying no filenames causes decom-
pression from standard input to standard output.
bunzip2 will correctly decompress a file which is the con-
catenation of two or more compressed files. The result is
the concatenation of the corresponding uncompressed files.
Integrity testing (-t) of concatenated compressed files is
also supported.
You can also compress or decompress files to the standard
output by giving the -c flag. Multiple files may be com-
pressed and decompressed like this. The resulting outputs
are fed sequentially to stdout. Compression of multiple
files in this manner generates a stream containing multi-
ple compressed file representations. Such a stream can be
decompressed correctly only by bzip2 version 0.9.0 or
later. Earlier versions of bzip2 will stop after decom-
pressing the first file in the stream.
bzcat (or bzip2 -dc) decompresses all specified files to
the standard output.
bzip2 will read arguments from the environment variables
BZIP2 and BZIP, in that order, and will process them
before any arguments read from the command line. This
gives a convenient way to supply default arguments.
Compression is always performed, even if the compressed
file is slightly larger than the original. Files of less
than about one hundred bytes tend to get larger, since the
compression mechanism has a constant overhead in the
region of 50 bytes. Random data (including the output of
most file compressors) is coded at about 8.05 bits per
byte, giving an expansion of around 0.5%.
As a self-check for your protection, bzip2 uses 32-bit
CRCs to make sure that the decompressed version of a file
is identical to the original. This guards against corrup-
tion of the compressed data, and against undetected bugs
in bzip2 (hopefully very unlikely). The chances of data
corruption going undetected is microscopic, about one
chance in four billion for each file processed. Be aware,
though, that the check occurs upon decompression, so it
can only tell you that something is wrong. It can't help
you recover the original uncompressed data. You can use
bzip2recover to try to recover data from damaged files.
Return values: 0 for a normal exit, 1 for environmental
problems (file not found, invalid flags, I/O errors, &c),
2 to indicate a corrupt compressed file, 3 for an internal
consistency error (eg, bug) which caused bzip2 to panic.
OPTIONS
-c --stdout
Compress or decompress to standard output.
-d --decompress
Force decompression. bzip2, bunzip2 and bzcat are
really the same program, and the decision about
what actions to take is done on the basis of which
name is used. This flag overrides that mechanism,
and forces bzip2 to decompress.
-z --compress
The complement to -d: forces compression,
regardless of the invocation name.
-t --test
Check integrity of the specified file(s), but don't
decompress them. This really performs a trial
decompression and throws away the result.
-f --force
Force overwrite of output files. Normally, bzip2
will not overwrite existing output files. Also
forces bzip2 to break hard links to files, which it
otherwise wouldn't do.
bzip2 normally declines to decompress files which
don't have the correct magic header bytes. If
forced (-f), however, it will pass such files
through unmodified. This is how GNU gzip behaves.
-k --keep
Keep (don't delete) input files during compression
or decompression.
-s --small
Reduce memory usage, for compression, decompression
and testing. Files are decompressed and tested
using a modified algorithm which only requires 2.5
bytes per block byte. This means any file can be
decompressed in 2300k of memory, albeit at about
half the normal speed.
During compression, -s selects a block size of
200k, which limits memory use to around the same
figure, at the expense of your compression ratio.
In short, if your machine is low on memory (8
megabytes or less), use -s for everything. See
MEMORY MANAGEMENT below.
-q --quiet
Suppress non-essential warning messages. Messages
pertaining to I/O errors and other critical events
will not be suppressed.
-v --verbose
Verbose mode -- show the compression ratio for each
file processed. Further -v's increase the ver-
bosity level, spewing out lots of information which
is primarily of interest for diagnostic purposes.
-L --license -V --version
Display the software version, license terms and
conditions.
-1 (or --fast) to -9 (or --best)
Set the block size to 100 k, 200 k .. 900 k when
compressing. Has no effect when decompressing.
See MEMORY MANAGEMENT below. The --fast and --best
aliases are primarily for GNU gzip compatibility.
In particular, --fast doesn't make things signifi-
cantly faster. And --best merely selects the
default behaviour.
-- Treats all subsequent arguments as file names, even
if they start with a dash. This is so you can han-
dle files with names beginning with a dash, for
example: bzip2 -- -myfilename.
--repetitive-fast --repetitive-best
These flags are redundant in versions 0.9.5 and
above. They provided some coarse control over the
behaviour of the sorting algorithm in earlier ver-
sions, which was sometimes useful. 0.9.5 and above
have an improved algorithm which renders these
flags irrelevant.
MEMORY MANAGEMENT
bzip2 compresses large files in blocks. The block size
affects both the compression ratio achieved, and the
amount of memory needed for compression and decompression.
The flags -1 through -9 specify the block size to be
100,000 bytes through 900,000 bytes (the default) respec-
tively. At decompression time, the block size used for
compression is read from the header of the compressed
file, and bunzip2 then allocates itself just enough memory
to decompress the file. Since block sizes are stored in
compressed files, it follows that the flags -1 to -9 are
irrelevant to and so ignored during decompression.
Compression and decompression requirements, in bytes, can
be estimated as:
Compression: 400k + ( 8 x block size )
Decompression: 100k + ( 4 x block size ), or
100k + ( 2.5 x block size )
Larger block sizes give rapidly diminishing marginal
returns. Most of the compression comes from the first two
or three hundred k of block size, a fact worth bearing in
mind when using bzip2 on small machines. It is also
important to appreciate that the decompression memory
requirement is set at compression time by the choice of
block size.
For files compressed with the default 900k block size,
bunzip2 will require about 3700 kbytes to decompress. To
support decompression of any file on a 4 megabyte machine,
bunzip2 has an option to decompress using approximately
half this amount of memory, about 2300 kbytes. Decompres-
sion speed is also halved, so you should use this option
only where necessary. The relevant flag is -s.
In general, try and use the largest block size memory con-
straints allow, since that maximises the compression
achieved. Compression and decompression speed are virtu-
ally unaffected by block size.
Another significant point applies to files which fit in a
single block -- that means most files you'd encounter
using a large block size. The amount of real memory
touched is proportional to the size of the file, since the
file is smaller than a block. For example, compressing a
file 20,000 bytes long with the flag -9 will cause the
compressor to allocate around 7600k of memory, but only
touch 400k + 20000 * 8 = 560 kbytes of it. Similarly, the
decompressor will allocate 3700k but only touch 100k +
20000 * 4 = 180 kbytes.
Here is a table which summarises the maximum memory usage
for different block sizes. Also recorded is the total
compressed size for 14 files of the Calgary Text Compres-
sion Corpus totalling 3,141,622 bytes. This column gives
some feel for how compression varies with block size.
These figures tend to understate the advantage of larger
block sizes for larger files, since the Corpus is domi-
nated by smaller files.
Compress Decompress Decompress Corpus
Flag usage usage -s usage Size
-1 1200k 500k 350k 914704
-2 2000k 900k 600k 877703
-3 2800k 1300k 850k 860338
-4 3600k 1700k 1100k 846899
-5 4400k 2100k 1350k 845160
-6 5200k 2500k 1600k 838626
-7 6100k 2900k 1850k 834096
-8 6800k 3300k 2100k 828642
-9 7600k 3700k 2350k 828642
RECOVERING DATA FROM DAMAGED FILES
bzip2 compresses files in blocks, usually 900kbytes long.
Each block is handled independently. If a media or trans-
mission error causes a multi-block .bz2 file to become
damaged, it may be possible to recover data from the
undamaged blocks in the file.
The compressed representation of each block is delimited
by a 48-bit pattern, which makes it possible to find the
block boundaries with reasonable certainty. Each block
also carries its own 32-bit CRC, so damaged blocks can be
distinguished from undamaged ones.
bzip2recover is a simple program whose purpose is to
search for blocks in .bz2 files, and write each block out
into its own .bz2 file. You can then use bzip2 -t to test
the integrity of the resulting files, and decompress those
which are undamaged.
bzip2recover takes a single argument, the name of the dam-
aged file, and writes a number of files
"rec00001file.bz2", "rec00002file.bz2", etc, containing
the extracted blocks. The output filenames are
designed so that the use of wildcards in subsequent pro-
cessing -- for example, "bzip2 -dc rec*file.bz2 > recov-
ered_data" -- processes the files in the correct order.
bzip2recover should be of most use dealing with large .bz2
files, as these will contain many blocks. It is clearly
futile to use it on damaged single-block files, since a
damaged block cannot be recovered. If you wish to min-
imise any potential data loss through media or transmis-
sion errors, you might consider compressing with a smaller
block size.
PERFORMANCE NOTES
The sorting phase of compression gathers together similar
strings in the file. Because of this, files containing
very long runs of repeated symbols, like "aabaabaabaab
..." (repeated several hundred times) may compress more
slowly than normal. Versions 0.9.5 and above fare much
better than previous versions in this respect. The ratio
between worst-case and average-case compression time is in
the region of 10:1. For previous versions, this figure
was more like 100:1. You can use the -vvvv option to mon-
itor progress in great detail, if you want.
Decompression speed is unaffected by these phenomena.
bzip2 usually allocates several megabytes of memory to
operate in, and then charges all over it in a fairly ran-
dom fashion. This means that performance, both for com-
pressing and decompressing, is largely determined by the
speed at which your machine can service cache misses.
Because of this, small changes to the code to reduce the
miss rate have been observed to give disproportionately
large performance improvements. I imagine bzip2 will per-
form best on machines with very large caches.
CAVEATS
I/O error messages are not as helpful as they could be.
bzip2 tries hard to detect I/O errors and exit cleanly,
but the details of what the problem is sometimes seem
rather misleading.
This manual page pertains to version 1.0.8 of bzip2. Com-
pressed data created by this version is entirely forwards
and backwards compatible with the previous public
releases, versions 0.1pl2, 0.9.0, 0.9.5, 1.0.0, 1.0.1,
1.0.2 and above, but with the following exception: 0.9.0
and above can correctly decompress multiple concatenated
compressed files. 0.1pl2 cannot do this; it will stop
after decompressing just the first file in the stream.
bzip2recover versions prior to 1.0.2 used 32-bit integers
to represent bit positions in compressed files, so they
could not handle compressed files more than 512 megabytes
long. Versions 1.0.2 and above use 64-bit ints on some
platforms which support them (GNU supported targets, and
Windows). To establish whether or not bzip2recover was
built with such a limitation, run it without arguments.
In any event you can build yourself an unlimited version
if you can recompile it with MaybeUInt64 set to be an
unsigned 64-bit integer.
AUTHOR
Julian Seward, [email protected]
https://sourceware.org/bzip2/
The ideas embodied in bzip2 are due to (at least) the fol-
lowing people: Michael Burrows and David Wheeler (for the
block sorting transformation), David Wheeler (again, for
the Huffman coder), Peter Fenwick (for the structured cod-
ing model in the original bzip, and many refinements), and
Alistair Moffat, Radford Neal and Ian Witten (for the
arithmetic coder in the original bzip). I am much
indebted for their help, support and advice. See the man-
ual in the source distribution for pointers to sources of
documentation. Christian von Roques encouraged me to look
for faster sorting algorithms, so as to speed up compres-
sion. Bela Lubkin encouraged me to improve the worst-case
compression performance. Donna Robinson XMLised the docu-
mentation. The bz* scripts are derived from those of GNU
gzip. Many people sent patches, helped with portability
problems, lent machines, gave advice and were generally
helpful.
| 18,997 | 392 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/dlltest.dsp | # Microsoft Developer Studio Project File - Name="dlltest" - Package Owner=<4>
# Microsoft Developer Studio Generated Build File, Format Version 5.00
# ** ÒWµÈ¢Å¾³¢ **
# TARGTYPE "Win32 (x86) Console Application" 0x0103
CFG=dlltest - Win32 Debug
!MESSAGE ±êÍLøÈÒ²¸Ì§²ÙÅÍ èܹñB ±ÌÌßÛ¼Þª¸ÄðËÞÙÄÞ·é½ßÉÍ NMAKE ðgpµÄ¾³¢B
!MESSAGE [Ò²¸Ì§²ÙÌ´¸½Îß°Ä] ºÏÝÄÞðgpµÄÀsµÄ¾³¢
!MESSAGE
!MESSAGE NMAKE /f "dlltest.mak".
!MESSAGE
!MESSAGE NMAKE ÌÀsÉ\¬ðwèÅ«Ü·
!MESSAGE ºÏÝÄÞ ×²ÝãÅϸÛÌÝèðè`µÜ·Bá:
!MESSAGE
!MESSAGE NMAKE /f "dlltest.mak" CFG="dlltest - Win32 Debug"
!MESSAGE
!MESSAGE IðÂ\ÈËÞÙÄÞ Ó°ÄÞ:
!MESSAGE
!MESSAGE "dlltest - Win32 Release" ("Win32 (x86) Console Application" p)
!MESSAGE "dlltest - Win32 Debug" ("Win32 (x86) Console Application" p)
!MESSAGE
# Begin Project
# PROP Scc_ProjName ""
# PROP Scc_LocalPath ""
CPP=cl.exe
RSC=rc.exe
!IF "$(CFG)" == "dlltest - Win32 Release"
# PROP BASE Use_MFC 0
# PROP BASE Use_Debug_Libraries 0
# PROP BASE Output_Dir "Release"
# PROP BASE Intermediate_Dir "Release"
# PROP BASE Target_Dir ""
# PROP Use_MFC 0
# PROP Use_Debug_Libraries 0
# PROP Output_Dir "Release"
# PROP Intermediate_Dir "Release"
# PROP Ignore_Export_Lib 0
# PROP Target_Dir ""
# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
# ADD CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
# ADD BASE RSC /l 0x411 /d "NDEBUG"
# ADD RSC /l 0x411 /d "NDEBUG"
BSC32=bscmake.exe
# ADD BASE BSC32 /nologo
# ADD BSC32 /nologo
LINK32=link.exe
# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /out:"minibz2.exe"
!ELSEIF "$(CFG)" == "dlltest - Win32 Debug"
# PROP BASE Use_MFC 0
# PROP BASE Use_Debug_Libraries 1
# PROP BASE Output_Dir "dlltest_"
# PROP BASE Intermediate_Dir "dlltest_"
# PROP BASE Target_Dir ""
# PROP Use_MFC 0
# PROP Use_Debug_Libraries 1
# PROP Output_Dir "dlltest_"
# PROP Intermediate_Dir "dlltest_"
# PROP Ignore_Export_Lib 0
# PROP Target_Dir ""
# ADD BASE CPP /nologo /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
# ADD CPP /nologo /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
# ADD BASE RSC /l 0x411 /d "_DEBUG"
# ADD RSC /l 0x411 /d "_DEBUG"
BSC32=bscmake.exe
# ADD BASE BSC32 /nologo
# ADD BSC32 /nologo
LINK32=link.exe
# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /out:"minibz2.exe" /pdbtype:sept
!ENDIF
# Begin Target
# Name "dlltest - Win32 Release"
# Name "dlltest - Win32 Debug"
# Begin Source File
SOURCE=.\bzlib.h
# End Source File
# Begin Source File
SOURCE=.\dlltest.c
# End Source File
# End Target
# End Project
| 3,423 | 94 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/release-update.sh | #!/bin/bash
# Script to run after a release has been tagged, signed and pushed
# to git. Will do a fresh checkout, verify the git tag, do fresh
# build/dist, sign the dist with gpg, create a backup copy in HOME,
# upload the tar.gz and sig to sourceware, checkout bzip2-htdocs,
# copy over the new changes, manual, etc. and git push that to update
# https://sourceware.org/bzip2/
# Any error is fatal
set -e
# We take one argument, the version (e.g. 1.0.7)
if [ $# -ne 1 ]; then
echo "$0 <version> (e.g. 1.0.7)"
exit 1
fi
VERSION="$1"
echo
echo " === NOTE === "
echo
echo "Requires a sourceware account in the bzip2 group."
echo
echo "Make sure the git repo was tagged, signed and pushed"
echo "If not, please double check the source tree is release ready first"
echo "You probably want to run ./prepare-release.sh $VERSION first."
echo "Then do:"
echo
echo " git tag -s -m \"bzip2 $VERSION release\" bzip2-$VERSION"
echo " git push --tags"
echo
read -p "Do you want to continue creating/uploading the release (yes/no)? "
if [ "x$REPLY" != "xyes" ]; then
echo "OK, till next time."
exit
fi
echo "OK, creating and updating the release."
# Create a temporary directoy and make sure it is cleaned up.
tempdir=$(mktemp -d) || exit
trap "rm -rf -- ${tempdir}" EXIT
pushd "${tempdir}"
# Checkout
git clone git://sourceware.org/git/bzip2.git
cd bzip2
git tag --verify "bzip2-${VERSION}"
git checkout -b "$VERSION" "bzip2-${VERSION}"
# Create dist (creates bzip2-${VERSION}.tar.gz)
make dist
# Sign (creates bzip2-${VERSION}.tar.gz.sig)
gpg -b bzip2-${VERSION}.tar.gz
# Create backup copy
echo "Putting a backup copy in $HOME/bzip2-$VERSION"
mkdir $HOME/bzip2-$VERSION
cp bzip2-${VERSION}.tar.gz bzip2-${VERSION}.tar.gz.sig $HOME/bzip2-$VERSION/
# Upload
scp bzip2-${VERSION}.tar.gz bzip2-${VERSION}.tar.gz.sig \
sourceware.org:/sourceware/ftp/pub/bzip2/
ssh sourceware.org "(cd /sourceware/ftp/pub/bzip2 \
&& ln -sf bzip2-$VERSION.tar.gz bzip2-latest.tar.gz \
&& ln -sf bzip2-$VERSION.tar.gz.sig bzip2-latest.tar.gz.sig \
&& ls -lah bzip2-latest*)"
# Update homepage, manual, etc.
cd "${tempdir}"
git clone ssh://sourceware.org/git/bzip2-htdocs.git
cp bzip2/CHANGES bzip2/bzip.css bzip2-htdocs/
cp bzip2/bzip.css bzip2/bzip2.txt bzip2/manual.{html,pdf} bzip2-htdocs/manual/
cd bzip2-htdocs
# Update version in html pages.
sed -i -e "s/The current stable version is bzip2 [0-9]\.[0-9]\.[0-9]\+/The current stable version is bzip2 ${VERSION}/" *.html */*.html
git commit -a -m "Update for bzip2 $VERSION release"
git show
git push
# Cleanup
popd
trap - EXIT
exit
| 2,598 | 91 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/sample2.ref | ÷À ; è TeX output 1995.10.19:1430 ÿÿÿÿ ºâ ý? £ þ ÷dßdóÂÖN ff cmbx12¼StrictnessffAnalysisIø4aGrandeVitesse:¤ ¼¦RewritingfftherulesoftheEvÿaluationTþ¦fransformersgame¡5ÈóX«Q ff cmr12»Second³/draft:D>OctobdCer19,1995.Commen¼tsarewelcomed.úÆ=ó
!",
cmsy10¸y È@ó(Kñ`y
ó3
cmr10ÓJulian¦fSew²!ard¤
5)JDepartmen²!t¦fofComputerScience,UniversityofManchester,M139PL,UK¡ °>?ó7ßê<x
ó3
cmtt10â[email protected] ú þ" íºâóñkAH
cmssbx10¹Abstract©´íºâóo´Ç cmr9ºThisl¾papAÇerpresen¾9tsthedesignofastrictnessanalyserpri-¤
íºâmarilyuin¾9tendedtoassistintheparallelisationofHaskell¡íºâprograms.åôTheqàanalysergeneratesdetailedevÿ|raluationtrans-¡íºâformerâ'informationsuitableforuseinaparallelgraphre-¡íºâductionssmac¾9hine.6ÍBytuningthedesigntohandlecommon¡íºâcasesH'rapidlyÿ:«,TÛw¾9eachievegoAÇodH'performanceo¾9verarangeof¡íºârealisticö~testinputs,.Èofsizesuptoathousandlines.¿îP¾9er-¡íºâformanceó/ guresarepresen¾9ted.¶ Fÿ:«rommeasuringthetime¡íºâit!Stak¾9esGlasgowHaskell0.10tocompilethosesamepro-¡íºâgrams,ªitw3isapparen¾9tthattheanalyserissucientlyquick¡íºâtoߥbAÇeapproac¾9hingthepoin¾9twhereincorporatingitin¾9toa¡íºâHask¾9ellTcompilerisaviablepropAÇosition.
íºâOurstrictnessanalysercon¾9tainsthreema jorinnovÿ|rations.¡íºâFirstlyÿ:«,îw¾9eà employamixedforwardandbackwardsanaly-¡íºâsis,l
whic¾9h'allowsustodopro jectionanalysiseveninthe¡íºâpresence¼Fofhigherorderfunctions.ESecondlyÿ:«,æw¾9esolvethe¡íºâresultingÕ¹recursiv¾9edomainequationsusingasophisticated¡íºâterm ±rewritingsystem,Nlwhic¾9h,as ±farasweknow,Nlhasabilities¡íºâfar9~bAÇey¾9ondpreviousrewritebasedsolversinabstractinter-¡íºâpretationÈsystems.ªFinallyÿ:«,×xw¾9eavoidmanyofthediculties¡íºâof|ôhigherorderanalysisb¾9yautomaticallytransformingout¡íºâmostThigherorderfunctionsbAÇeforeanalysisbegins.-íºâ¹1üIntroFfduction¦íºâºHigher-order,Zûnon-
at,dstrictnessanalysistec¾9hniqueshaveac-¡íºâquired¡areputationforbAÇeingtooexpensiv¾9eforuseinpro-¡íºâductionÂscompilers. ÐThisisapit¾9yÿ:«,Ósincemanysuchfunctions¡íºâbAÇeha¾9veãinrelativ¾9elysimpleways,~whichsuggeststheirab-¡íºâstractTbAÇeha¾9viourcouldbedivinedwithoutm¾9uchTdicultyÿ:«.
íºâOneãofthemainthemeswhic¾9hcharacterisedthepast¡íºâdecade'sadvÿ|rancesinhardw¾9areandsoftwarepAÇerformance¡íºâis5£thatofmeasuremen¾9t-leaddesign.}\ThisschoAÇolofthought¡íºâbasesØdesignonmeasuringwhatprogramsdomostoften,¡íºâandWQmakingthesecommonactivitiesasfastaspAÇossible,}Rev¾9en¡íºâatïtheexpAÇenseofslo¾9wingdownlesscommonopAÇerations.¡íºâThese,Ôideas,r´elabAÇoratedinHennessy&P¾9atterson[HP90zú],íºâÀ ff _ÿ 34
+büûró °Ü0n cmsy5¶YóÙ R cmr7±My}^ap7 ologiesforthedog-roughtÈãypesetting.|ÂThiswillbe xedin later±ÈvÈãersionsofthepap7 er. fh þ" õºâºpla¾9yedî
acen¾9tralroleintheRISCî{revolution,öHandhavebAÇeen¤
õºâtak¾9enÏ
uprecentlybythefunctionalprogrammingcommu-¡ õºânit¾9yT[PHHP93#µø][Par92Ç].©
õºâWÿ:«e©Ûpresen¾9t,¿Zindetail,thedesignofafaststrictnessanalyser¡ õºâforßHask¾9ell,ôÁdealingwithhigher-orderfunctionsandgen-¡ õºâeratingvøevÿ|raluationtransformerinformationsuitableforuse¡ õºâinUparallelgraphreductionsystems[Bur87ã][Bur91].ãsPre-¡ õºâliminary5expAÇerimen¾9tshavebAÇeenencouraging.}Fÿ:«orexample,¡ õºârunningincompiledHask¾9ellonaSunSparc-10,« a618line¡ õºâprogram}Xw¾9asanalysedin44seconds.T|Ofthis,Yroughlyhalf¡ õºâw¾9asdevotedtoparsing,U¢desugaringandtypAÇechecking,U¢ex-¡ õºâpAÇensesRwhic¾9hanycompilerwouldincur.Ò¨Asanaive rst¡ õºâimplemen¾9tation,jthereÞÿisamplescopAÇeforperformanceim-¡ õºâpro¾9vement.¦ õºâThisXpapAÇerarguesinfa¾9vourXofameasuremen¾9t-leadapproach¡ õºâfor¢qtheimplemen¾9tationofsemanticanalysistechniquesfor¡ õºâfunctionalßlanguages.
UAÞôma joremphasisistofeedtheanal-¡ õºâyserLÈthekindsofprogramspAÇeoplereallywrite,Z¥ratherthan¡ õºâbasingØïdesigndecisionsontheusualMic¾9keyØïMouseexam-¡ õºâplesý¬oAÇccurringsofrequen¾9tlyinpapersonthesub ject.ÕxTÿ:«o¡ õºâthisËend,¿ètestinputsha¾9veËbAÇeentak¾9enfromthebenc¾9hmark¡ õºâsuitesTofHartel[HL92÷l]andP¾9artain[Par92Ç].¦ õºâSuc¾9h?®anapproachrevealssomeinterestingfacts.~Fÿ:«orex-¡ õºâample,Õçw¾9e¯cdiscoveredthemainlimitationonanalyserpAÇer-¡ õºâformance#¼w¾9asnotthenecessitytoiteratetoanddetect x-¡ õºâpAÇoin¾9ts,¨ asÐhadbeenassumedb¾9ysomanytheoretics.îïRather,¡ õºâitaàw¾9asthesheersizeofthetermsgeneratedduringtheab-¡ õºâstractcBin¾9terpretationphase.;ByintroAÇducingalittlemore¡ õºâin¾9telligenceþGintothatphase,8termsizeiscutdramaticallyÿ:«,¡ õºâgivingTacorrespAÇondingperformanceincrease.¦ õºâSimilarlyÿ:«,hpAÇolymorphismXisdealtwithb¾9ythecrudemecha-¡ õºânismÁofamonomorphisationpassbAÇeforeanalysis./·Previous¡ õºâw¾9orkers,pincludingmyself,assumedthisw¾9asa\badthing"¡ õºâ(see¿[HH91 >]and[Sew93/]),гandputm¾9uch¿e ortin¾9todevising¡ õºâpAÇolymorphic¢analysismethods[Bar91 U].5Yÿ:«etthefearedcode¡ õºâexplosion,ÒitÁíseems,simplydoAÇesnothappen. £Measuremen¾9ts¡ õºâb¾9y<MarkJonesona13000lineHaskellprogram{thesource¡ õºâcoAÇdeTDofthisanalyser{rev¾9ealthatonlyaveryfewpAÇoly-¡ õºâmorphicGfunctions,TforexampleóMߤN cmtt9ëMmapºandëMfoldrº,areusedat¡ õºâalargen¾9umbAÇerofinstances.µCertainlyÿ:«,¿monomorphisation¡ õºâdoAÇeswÎnotcausean¾9ynoticeableperformanceproblemsforthis¡ õºâanalyser.#¸Am m¾9uchmbAÇetterreasonfordislikingmonomorphic¡ õºâanalyses#isthattheysigni can¾9tlycomplicatelifewhenmoAÇd-¡ õºâulesTappAÇearonthescene. * ºâ ý? £ ý íºâ¹1.1G·OverviewLÎofpapFfermíºâºTheIremainderofthein¾9troAÇductionisdevotedtoanoverview¤
íºâofTtheanalyser,henceforthreferredtoasóNt : cmbx9ëNAnnaº.©
íºâSection2dealswithtec¾9hnicalpreliminaries./Inparticular,¡íºâw¾9e nexaminehowtypAÇesinthesourceprogramaremappedto¡íºâabstract
Èdomainssuitableforthecon¾9trolofparallelevÿ|ralua-¡íºâtion.¦íºâTheÏ~abstractin¾9terpretationusedformsthesub jectofsec-¡íºâtione<3. 'Adåvÿ|rarian¾9tofthepro jectionanalysisdescribAÇedin¡íºâsection,ê6of[Hug87ó'],rÐthetec¾9hniqueisamixedbackwards¡íºâandàforw¾9ardsanalysis,þÂwiththeaimofpAÇerformingback-¡íºâw¾9ards 4analysis.Bysupplyingjustenough\forwards"infor-¡íºâmationlîtoturnfunctionsin¾9to rstclasscitizens,theanalysis¡íºâdealsÇ sensiblywithhigher-orderfunctions,ókpartialapplica-¡íºâtionsTandfunctionsinsidedatastructures.¦íºâSectionöÇ4presen¾9ts,/$indetail,theelabAÇoratetermrewriting¡íºâsystemlusedtodetect xedpAÇoin¾9tsintherecursivedomain¡íºâequationsTgeneratedb¾9ytheabstractinterpreter.¦íºâFÿ:«unctionalf¢programmersha¾9vef¢longobserv¾9edthatlargeparts¡íºâofztheprogramstheywritecanbAÇemec¾9hanicallytransformed¡íºâtoeçha¾9venohigher-orderfunctions.(Annaexploitsthisto¡íºâgoAÇode ect,³transforminga¾9wayasman¾9yhigher-orderfunc-¡íºâtionsiaspAÇossiblebeforeanalysis.Ç"Commonhigherorderfunc-¡íºâtionsc|whic¾9hencapsulateparticularformsofrecursion,wsuch¡íºâasg ëMfoldrº,{aretriviallyremo¾9ved.ÌEveng moredicultforms,¡íºâlik¾9eP$themonadssobAÇelovedincertainquarters[Wÿ:«ad92¿]are¡íºâtransformable.)ªNev¾9ertheless,
someodicultiesremain.Sec-¡íºâtionÂo5discussesallthisindetail. ÎWÿ:«ealsoloAÇokbrie
yatthe¡íºâmonomorphiser.¦íºâFinallyÿ:«,/²in÷9section6,allthesegoAÇodies÷9aredra¾9wntogether¡íºâwith@adiscussionofthesystem'spAÇerformance,k andofrelated¡íºâandTfurtherw¾9ork.Úíºâ¹1.2G·OverviewLÎoftheanalyser'sfrontendmíºâºAnnapisalargeHask¾9ellprogram,B·consistingofmorethan¡íºâ130007lines.¿OpAÇerationissimple.Annareadsasourcepro-¡íºâgramCyonthestandardinput,OandpAÇerformsextensiv¾9etrans-¡íºâformations»ñontheprogram,ÍÒprin¾9tingitoutatvÿ|rariouspAÇoints¡íºâon1Ðthew¾9ayÿ:«.qåFinally,8ïthe1Ðstrictnessinformationisgenerated¡íºâandTprin¾9ted.¦íºâThey¦languageacceptedisasubsetofHask¾9ell.IfMissingfea-¡íºâtures arean¾9ythingtodowithoverloading,CmoAÇdulesorarrays.¡íºâBecauseÒàofthese,à+o eringuparbitraryHask¾9ellprogramsfor¡íºâanalysis«isadiculttask:çGallo¾9verloading«hastobAÇeresolv¾9ed¡íºâb¾9yóhand,*atediousbusiness.µ«ThelackofmoAÇdulesupport¡íºâdoAÇesrnotpro¾9vermuchofaproblem,(sincemultimoAÇduleinputs¡íºâarensimplyconcatenatedin¾9toonemassiveprogram,moAÇdulo¡íºâsolving|ÍtheoAÇddrenamingproblemalongthew¾9ayÿ:«.RÚAnna¡íºâkno¾9ws`YnothingabAÇouttheHaskellprelude,sandtherelevÿ|rant¡íºâpartsÕofthistoAÇoneedtobeinsertedin¾9totheinputs.AÕvery¡íºâfew(opAÇerationsaretak¾9enasprimitive:AÏëM(+)º,l¯ëM(-)º,ëM(*)(ºand¡íºâëM(/)º,~all{Çoft¾9ypAÇeëMInt¹->Int->Intº,comparisons{ÇëM(<)º,ëM(<=)º,¡íºâëM(==)º,n¾ëM(/=)º,ëM(>)EºandëM(>=)º,n¾oft¾9ypAÇeëMInt¹->Int->Boolº,and¡íºâcon¾9version=ífunctionsëMchrºandëMordºoft¾9ypAÇeëMInt¹->Char=íºand¡íºâëMChar¹->Int¦ÍºrespAÇectiv¾9elyÿ:«.ÐÚA¦§vÿ|ralidprogrammustsupplya¡íºâbinding»forëMmainº,Í butunlik¾9eaHaskellprogram,Í thismaybAÇe¡íºâofTan¾9ytypAÇe.¦íºâDespiteiÉthismeagrecollectionofprimitiv¾9es,¾æAnnaknows¡íºâabAÇoutfmostofthebuilt-inHask¾9elltypAÇes,includingbooleans,¡íºâc¾9haracters,Tstrings,listsGáandtuples.´AlthoughsomeimpAÇor- ý õºâtan¾9tÜ»featuresofHaskellaremissing,è
thesubsetallowsAnna¤
õºâto:CbAÇefedreal-w¾9orldprogramsofconsiderablecomplexityÿ:«,¡ õºâalbAÇeitTaftersomeconsiderablemassaging.©
õºâProbablyg)thebAÇestw¾9ayg)tothinkofAnnaisasaframew¾9ork¡ õºâfor¡Itryingoutnewanalysistec¾9hniques.ÀNHence,ÄFthesystem¡ õºâlogically%Ýconsistsoft¾9wo%Ýparts:=theanalysispropAÇer,)ÿandthe¡ õºâsuppAÇortinguÏframew¾9ork.=àTheinterfacebAÇetweenthetwois¡ õºâreasonablyÃVclean,Ó¼soc¾9hangingthenatureoftheanalysiscan¡ õºâbAÇeÍudonewithoutm¾9uchÍuupheavÿ|ral.DÓThissectionfoAÇcusseson¡ õºâtheTsuppAÇortingframew¾9ork.¦ õºâBecause×'w¾9ewanttoexercisetheanalysesonfunctionalpro-¡ õºâgramsT'ofrealisticsize,zÊthesuppAÇortingframew¾9orkisnecessar-¡ õºâily¼Ûlargeandcomplex.þòIndeed,Îtheanalysispartiscurren¾9tly¡ õºâtheè¶smallerofthet¾9wo.Theè¶frameworkcontainsagoAÇodly¡ õºâpartÁofwhatonemigh¾9texpAÇectto ndinafull-scalecom-¡ õºâpilerTforthesamelanguage:ÐOäóP©±Ê cmsy9ëP :âºFÿ:«ollo¾9wing=
theparsingstage,÷desugaringandpattern¡ :âmatc¾9hing0ãtransformationsarecarriedout.o Thesepro-¡ :âduceÝyëNCoreº,Oaminimalfunctionallanguageusedas¡ :âan
-in¾9termediateformintheGlasgowHaskellcom-¡ :âpilerî[PHHP93#µø],ö\andt¾9ypicaloftheintermediateforms¡ :âof|Ïvÿ|rariousothercompilers,®forexampletheChalmers¡ :âHask¾9ell-B¶}Compiler¶§[Aug87ó']. hAllfurthertransforma-¡ :âtionsòpriortostrictnessanalysispropAÇerareCore-to-¡ :âCoreTtransformations.©34äëP :âºAMÌdepAÇendancyN analysisphasesplitstheprogramup¡ :âin¾9toµyminimalmutuallyrecursivegroups, andmarks¡ :ânon-recursiv¾9eM>bindingsassuch.Ä.Allsubsequenttrans-¡ :âformationsBarerequiredtomain¾9taindepAÇendancyorder.¦äëP :âºAÍzcrudeÍbute ectiv¾9eCoresimpli cationpassremoves¡ :âun¾9used
ºbindings, Øandsubstitutesinconstantbindings¡ :âonly:usedonce.ÆThishelpstocleanuptherathermessy¡ :âoutput`-ofthedesugarer.üûTheformerfeatureisuseful¡ :âfor;debuggingtheanalyser.ÓÞBecauseabindingforëMmain¡ :âºm¾9ustìbAÇesupplied,Îthesimpli erwilleventuallyremove¡ :âall´bindingsnotreac¾9hablefromëMmainº.êIftheanalyseris¡ :âseen¹tomalfunction,¬ arbitrarysubsectionsoftheinput¡ :âprogram canbAÇediscardedsimplyb¾9ychangingthebAÇody¡ :âof¥ëMmainº,Éun¾9tilwhatremainsissmallenoughtomake¡ :âdebuggingTviable.¦äëP :âºRemo¾9ving.nestedenvironmentsmakessubsequent¡ :âtransformationsi®andanalysessimpler.ã9Tÿ:«othisend,the¡ :âprogramVis
attenedoutb¾9yamoAÇdi edJohnsson-style¡ :âlam¾9bAÇda-lifter[Joh85Ä9],¥!followedbyanotherdepAÇendancy¡ :âanalysisTpass.¦äëP :âºThe Ûprogramisno¾9wtypAÇechecked,¼usingastandard¡ :âMilner-Hindleyinferencerderiv¾9edfromChapter9of¡ :âP¾9eyton
uJones'bAÇook
u[Pey87Hª].lÒEverynoAÇdeintheCore¡ :âtree;hasat¾9ypAÇeexpressionattached.hAlthoughacom-¡ :âplete mannotationisratherexpAÇensiv¾9e, ³itisessentialfor¡ :âsubsequen¾9tTpasses.¦äëP :âºTheþNsinglemostcomplicatedtransformation,8higher-¡ :âorderôfunctionremo¾9vÿ|ral(alsoknownasspAÇecialisation¡ :âorz rsti cation)no¾9wfollows.(âThepresentnaiveim-¡ :âplemen¾9tation,|xdescribAÇedg×inSection5,isslo¾9wbutcor-¡ :ârect.cMosté¥ifnotallofthehigher-ordernessoft¾9ypi-¡ :âcalQprogramscanbAÇeremo¾9ved.Ñ>ThisQtransformationis¡ :âcomplicated¹yb¾9ytheneedtomaintaintypAÇeannotations¡ :âcorrectlyÿ:«. çjã2 ºâ ý? £ ý ûäëP:âºFinallyÿ:«,Stheºprogramismonomorphised.g¡Thispassis¤
:âquic¾9kandrelativelypainless,\eventhoughathirdtrip¡:âthroughÓthedepAÇendancyanalyserissubsequen¾9tlyre-¡:âquired.©ÙíºâMost£compilersw¾9ouldwanttomangletheoutputofthe¡íºâdesugarer5rinquitedi eren¾9twaystogenerategoAÇod5rcode.ÑÏFÿ:«or-¡íºâtunatelyÿ:«,Ñ it«iseasytoseeho¾9wtheoutputofthestrictness¡íºâanalyserççpropAÇerpertainstothedesugaredprogram.)Only¡íºât¾9woTtransformationsgiv¾9emuchtrouble:ØûäëP:âºLam¾9bAÇda-liftingpsimplymovesbindingsfrominnerlev-¡:âelsVétothetoplev¾9el,|ÿandaddsextraparameters.Ü÷Witha¡:âlittle¢bbAÇookk¾9eeping,¹_itispossibletok¾9eeptrackofwhere¡:ânestedpbindingsendedup,rsothatstrictnessinforma-¡:âtionTcanbAÇerelatedbac¾9ktothem.×xûäëP:âºHigher-order1tfunctionremo¾9vÿ|ralwillonlyeverremove¡:âhigher-orderNTfunctionswhic¾9hhavebAÇecomeirrelevÿ|rant¡:âbAÇecauseGofspecialisation.³ All rst-orderfunctionsare¡:âpreserv¾9ed.
gwWÿ:«e.Varereallyonlyinterestedinderiv-¡:âingXevÿ|raluationtransformersforthe rstorderfunc-¡:âtions.$ëThism}isbAÇecausethedemandpropagatedacross¡:âaÿ/higher-orderfunctionlargelydepAÇendsonwhatthe¡:âhigher-order@Eparameteris.ÕkSoexploitingdemandprop-¡:âagationXacrosshigher-orderfunctionsmeansrun¾9time¡:âmanipulation×ofevÿ|raluationtransformers,|aserious¡:âcomplicationTforparallelgraphreductionsystems.¦íºâBuilding¿Áandmain¾9tainingtheframeworkisatiresome,ÐÞtime¡íºâconsumingz°task.èäOnecouldalsoargueallthate ortw¾9asun-¡íºânecessarilyÿ:«,%_bAÇecause"*theGlasgo¾9wHaskellteamhavespAÇeci -¡íºâcallyþdesignedtheircompilerasabasisforexpAÇerimen¾9tslike¡íºâthis,º5andf vÿ|ralian¾9tlysuppAÇortedthosebraveenoughtotake¡íºâthem¡´up[PHHP93#µø].ÁInretrospAÇect,ÄÌtherearethreereasons¡íºâwh¾9yTAnnawasnotbuiltintoGlasgowHaskell:Øø 1.:âA¾9tÏçthetimeworkonAnnabAÇegun,þinthesummerof¡:â1991, ÖGlasgo¾9w's ¼compiler(version0.02)wasinstillin¡:âtheTproAÇcessofdev¾9elopment.©×xø 2.:âUn¾9tilgFrecentlyÿ:«,»Ãtheanalyserwasrelativelyfeeble,»Ãso¡:âtheú¹needtofeeditrealisticHask¾9ellprogramshasonly¡:ârecen¾9tlyTarisen.¦ø 3.:âThe
ÏmostimpAÇortan¾9treason,¢though,is
Ïthis:ÔAnnahad¡:âbAÇeenêdev¾9elopedusingMarkJones'marv¾9ellousinterac-¡:âtiv¾9e¯?environment,êGofer.úiMergingAnnaintotheGlas-¡:âgo¾9wÀ Haskellworldwouldhavemeantcompilingwith¡:âayêHask¾9ellcompilerandthiswouldeasilyhaveputan¡:âorderm£ofmagnitudeontheedit-compile-runcycletime.ÙíºâAsÅAnnabAÇecomesmoreandmorepo¾9werful,ÕwtheÅincentiveto¡íºâbuild'itin¾9toarealcompilergrows. êThisisde nitelyalong¡íºâtermTob jectiv¾9e. íºâ¹2üTÿ,ÌechnicalLÎp¹reliminaries´íºâ2.1G·SomeLÎterminologymíºâºThe ÿanalyser'sfron¾9tendproAÇducesaëNCoreÅsyn´Ctaxtreeº, *in¡íºâwhic¾9hReverynoAÇdeisdecoratedwithitstypAÇe.Ò¥Thisisfedto¡íºâtheoëNabstract¢bin´CterpreterºpropAÇer,Bµwhic¾9htranslatestoan¡íºâabstract9=form:dBëNrecursiv´CeÜádomainequationsº.,TheëN x-¡íºâpK¼oin´Cterºsolv¾9estheseequationsbyiteratingtotheirgreatest ý õºâ xednépAÇoin¾9ts,
Ndetectingequalityofadjacentapproximations¤
õºâb¾9y³reducingthemtoëNnormalÿformºusingtheëNtermrewrit-¡ õºâingÊsystemº,Tandcomparingthosenormalforms.
õºâThereTaret¾9woTkindsofabstracten¾9tityÿ:«.©ÐOäëP :âëNCon´Ctextseºdenoteanamoun¾9tofevÿ|raluationthatshould¡ :âbAÇeàUappliedtoadatastructureorfunction. }sThese¡ :âare DsometimesreferredtoasëNdemandsºorëNbac´Ckwards¡ :âvÿhaluesº,á¦but
w¾9ewillstickwithëNcon´CtextºwherepAÇos-¡ :âsible.ÑÊWÿ:«eürlaterin¾9troAÇduceaHaskelltypAÇeëMContextºto¡ :âmoAÇdelTcon¾9texts.34äëP :âëNAbstractCFvÿhaluesÕzºamoun¾9ttosometrickerywewillin-¡ :âtroAÇduceøÙtodealwithhigherorderfunctions.òAnalter-¡ :ânativ¾9eýname,['whichisagainavoidedwherepAÇossible,¡ :âis"ëNforw´Card vÿhalueº.D*ThecorrespAÇondingHask¾9elltypAÇeis¡ :âëMAbsValº.¦ õºâThis?¿papAÇerisprimarilyconcernedwithdisco¾9vering?¿how¡ õºâsourceÝ(languagefunctionsbAÇeha¾9veÝ(viz-a-vizcon¾9texts.síNev-¡ õºâertheless,ßgthe¶ýoutputoftheabstractin¾9terpreterisoneab-¡ õºâstractEÙvÿ|raluepAÇerCorefunction.×GCon¾9textsandabstractvalues¡ õºâin¾9tertwine,Öfso¯ÉtheëMContextºandëMAbsValºt¾9ypAÇesaremutually¡ õºârecursiv¾9e.ÄThe÷Üabstractinterpreteritselfisde nedasthe¡ õºâfunctionTëMZºinsection3.6.1.©
õºâCon¾9textsandabstractvÿ|raluesare,¤Zinasense,stronglyt¾9ypAÇed.¡ õºâEac¾9h£BcontextisamembAÇerofaparticularëNcon´Ctext udomainº,¡ õºâandnSmostopAÇerationsoncon¾9textsareonlymeaningfuliftheir¡ õºâopAÇerandsÿ8aredra¾9wnfromparticulardomains.Abstractvÿ|ral-¡ õºâueszÌarealsostronglyt¾9ypAÇed.L×Althoughthedomainsforab-¡ õºâstractuvÿ|raluesare,[¼strictlyspAÇeaking,di eren¾9tfromcontext¡ õºâdomains,£Âw¾9e]willignoreabstractvÿ|raluedomains.í Instead,w¾9e¡ õºâonlyýconsidercon¾9textdomains,³§henceforthreferredtosim-¡ õºâplyTasëNdomainsº,Tandpretendthatforeac¾9hdomainthereis¡ õºâaTfamilyofcon¾9texts,andafamilyofabstractvÿ|ralues.¦ õºâFÿ:«orZ}eac¾9hMilner-HindleytypAÇe,kÇthereisacorrespondingdo-¡ õºâmain.}+In5general,=¢therema¾9ybAÇemanydi erenttypAÇeswhich¡ õºâmap´Ütothesamedomain.ûThenextsectionde nes,ܾinfor-¡ õºâmallyÿ:«,Äthis°`mapping.úÉWethenre nethemappingsligh¾9tlyin¡ õºâsectionT2.2.4,andformaliseitinsection2.2.5.©5 õºâ¹2.2 G·DomainsLÎfo¹rprojectionanalysism õºâºA@ primary@*aimoftheseanalysesistogenerateinformation¡ õºâusefulÕúforexploitingaparallelmac¾9hine.RTÿ:«othisend,â¦weuse¡ õºâdomains9³whic¾9harebAÇestviewedasageneralisationofthe¡ õºâevÿ|raluationâétransformersin¾9troAÇducedbyBurn[Bur87ã]. ¢These¡ õºâareTin¾9troAÇducedbyexample.¦ õºâ¹2.2.1úíBaseLÎt¹ypFfesm õºâºBase¥t¾9ypAÇesëMIntºandëMCharºaremappedtoat¾9wo¥point¥domain¡ õºâëM2¹={0,1}º,Ú8with²ØëM0ºmeaning\donotevÿ|raluatethis"andëM1¡ õºâºmeaningn·\evÿ|raluatefully".äæInthiscaseonlyÿ:«,
fullevaluationis¡ õºâthe§Usameasevÿ|raluationtow¾9eakheadnormalform(WHNF).¦ õºâ¹2.2.2úíNon-recursiveLÎstructuredt¹ypFfesm õºâºConsiderDÕthein¾9terpretationofafamiliarnon-recursivestruc-¡ õºâturedmBt¾9ypAÇe:ÌMëM(Int,¹Int)º.$;Wÿ:«eneedtomodeltheevÿ|raluators¡ õºâfor¤thecompAÇonen¾9tsofthepairseparatelyÿ:«,øsotheremustbAÇe¡ õºâaÃproAÇductin¾9volved:wÿëM(2¹x2)º.%ÆAnÃevÿ|raluatorcorresponding çjã3 <à ºâ ý? £ ý íºâºtoAØan¾9ysuchpAÇointwould rsthavetoevÿ|raluatethepairclo-¤
íºâsure~ëtoWHNF,soitcouldgetitshandsontheindividual¡íºâcompAÇonen¾9ts.
ÕSoàwereallyneeda fthpAÇointrepresentingan¡íºâevÿ|raluatorõwhic¾9hdoAÇesnothingatall.×Theoverallinterpreta-¡íºâtionTisëMLift¹(2x2)º.
íºâA¾9tFóthispAÇointitisconvenienttointroAÇduceanotationfor¡íºâpAÇoin¾9tsçåtobeusedthroughoutthispaper.
KThebottompoin¾9t¡íºâof¶theabAÇo¾9ve¶domainiswrittenasanunderscore,UÎëM_º. The¡íºâother¼·fourarewrittenintheformëMU[x,¹y]ºwheretheëMU¡íºâºstands\Vfor\gouptheëMLiftº",VandtheëMxºandëMyºaretherelevÿ|ran¾9t¡íºâproAÇduct »componen¾9ts.5¥Theoverallcollectionofevÿ|raluatorsis¡íºâth¾9usZVwrittenëM{_,¹U[0,0],U[0,1],U[1,0],U[1,1]}ZVºwith¡íºâtheTfollo¾9wingordering:©ÐO_ òëMU[1,1]¡Zg\/ Y\¡>
ØU[0,1]%Ì°U[1,0]¡Zg\\ Y/¡_ òU[0,0]¡mM´|¡mM´_¦íºâºHo¾9w \doAÇesthisgeneralisetoarbitrarynon-recursivestruc-¡íºâtured%t¾9ypAÇes?K¢Wÿ:«ell,(þverysimplyÿ:«.K¢A% non-recursivestructured¡íºât¾9ypAÇeÆismodelledb¾9ythesingleliftingoftheproductofwhat-¡íºâev¾9er=FitstypAÇevÿ|rariablesareboundto.GFÿ:«urtherdetailsareir-¡íºârelevÿ|ran¾9t.3 That'sÇbAÇecauseweobservetheguidingrulethat¡íºâallãÂob jectscorrespAÇondingtoaparticulart¾9ypevÿ|rariableare¡íºâtreated6ïasasingleen¾9tityÿ:«.AThis6ïruleisimpAÇosedforthepur-¡íºâpAÇose
ofk¾9eepingthingsreasonablystraightforward.k°Fÿ:«orex-¡íºâample,Tgiv¾9en:¦ûç¤ëMdata¹Fooab=MkFooab¡9TB|¹MkAa¡9TB|¹MkBb¡¡ûç¤data¹Grokabc=MkGrokabc¡G|¹GrokodileDundeeaaabbc¦íºâºa±~vÿ|ralueofëM(Foo¹IntInt)±~ºismappAÇedtoëMLift¹(2x2)º,¡íºâandSëM(Grok¹IntIntInt)ºtoëMLift(2x2x2)º.
×|More¡íºâcomplicated{parameterisationsgiv¾9erisetomorecom-¡íºâplicatedÑdomains. QThet¾9ypAÇeëM(Grok¹Int(FooIntInt)¡íºâ(Grok¹IntIntInt))i®ºhasa91pAÇoin¾9tdomain¡íºâëMLift¹(2xLift(2x2)xLift(2x2x2))º.
íºâItúKisw¾9orthunderstandingthatthenumbAÇerofproductcom-¡íºâpAÇonen¾9tsãýisequaltothenumbAÇeroftypAÇevÿ|rariables,§anden-¡íºâtirely ®unrelatedtothen¾9umbAÇer ®ofparametersofan¾9ypartic-¡íºâularg[constructor.
AgFcon¾9textëMU[1,0,0]ºappliedtoanob ject¡íºâofµt¾9ypAÇeëM(Grok¹IntIntInt)µºmeans:)1evÿ|raluatetheob jectto¡íºâthe·| rstconstructor.çThen,àifitisaëMMkGrokº,evÿ|raluatethe¡íºâ rst{5argumen¾9t.NOtherwise,itmustbAÇeaëMGrokodileDundeeº,¡íºâso&Eevÿ|raluatethe rstthreeparameters.ODWÿ:«etreatthe rst¡íºâargumen¾9tÎtoëMMkGrokºandthe rstthreeofëMGrokodileDundee¡íºâºas¸dasingleen¾9tity¸dbAÇecausetheyallcorrespondtothesame¡íºât¾9ypAÇeTvÿ|rariable,ëMaº,inthedeclaration.5íºâ¹2.2.3 úíRecursiveLÎstructuredt¹ypFfesmíºâºSoQQfar,`Qthingsarereasonablystraigh¾9tforward.ÐhButQQde ning¡íºâevÿ|raluators1forrecursiv¾9etypAÇesisamine eld,8®partlybecause¡íºâthereexaresoman¾9yalternativeformulations[Wÿ:«ad87¿][WH87±].¡íºâAsv¸ithappAÇens,Ïtheform¾9ulationusedinAnnaisatrivial ý õºâvÿ|rariationJÕoftherulefornon-recursiv¾9etypAÇes,sUbutjusti cation¤
õºâisTnotsoeasyÿ:«.
õºâThe#§ruleisiden¾9ticaltothenon-recursivecase,g;exceptfor¡ õºâtheïÖfollo¾9wingmoAÇdi cation: ±thesingleliftingoftheproduct,¡ õºâwritten¥+ëMLiftº,É isreplacedb¾9yadoublelifting,ëMLift2º.ËõNo¾9w,¡ õºâgiv¾9enTthepseudo-declaration©ÐOç¤ëMdata¹[a]=[]¡.mê|¹a:[a]¦ õºâºitTiseasytoseethatthedomainforëM[Int]ºisëMLift2¹(2)º,c¶a¡ õºâfour@pAÇoin¾9tdomaincorrespondingpreciselytothein¾9terpreta-¡ õºâtionforthatt¾9ypAÇemadebyWÿ:«adler[Wad87¿]andlaterjusti-¡ õºâ ed!b¾9yBurn[Bur87ã].ËExtendingthenotationoftheprevious¡ õºâsection,Dqw¾9e7writethepAÇointsinthisdomainasëM{_,¹U_,UU[0]¡ õºâºandÝ®ëMUU[1]}º,Äunderstandingthemtodenotetheevÿ|raluators¡ õºâwhic¾9hTBurncalledëM{E0,¹E1,E2TºandëME3}º:¦äëP :âëM_º: pDoTnotevÿ|raluateatall(ëME0º).©34äëP :âëMU_º:¹Evÿ|raluateæasfarasthe rstconstructor,üthatis,to¡ :âw¾9eakTheadnormalform(ëME1º).¦äëP :âëMUU[0]º: pEvÿ|raluateTtheen¾9tirestructureofthelist(ëME2º).¦äëP :âëMUU[1]º:˺Evÿ|raluateìùtheen¾9tirestructureofthelist,"âand¡ :âallTtheelemen¾9ts(ëME3º).ÐO õºâInTgeneral,{!arecursiv¾9etypAÇeofëMnºparametershasevÿ|raluatorsof¡ õºâtheþ formëM{_,¹U_ºandëMUU[x1...xn]}º.TheëMUU[x1...xn]¡ õºâºpAÇoin¾9tsOdenoteevÿ|raluatingtheentirestructure,^,andthenap-¡ õºâplying«Hevÿ|raluatorëMx1ºtoeac¾9hob jectcorrespAÇondingtothe rst¡ õºâparameter,WëMx2¬ºtoob jectscorrespAÇondingtothesecondpa-¡ õºârameter,³Cand`zsoon.ýâWÿ:«ewillsee,inSection4,thatthis¡ õºâconceptual¸partitioningofallrecursiv¾9edomainpAÇointsinto¡ õºâthree#sectionsiscrucialtothew¾9orkingofthetermrewriting¡ õºâsystembusedtodetect xpAÇoin¾9ts.ô Similarlyÿ:«,´thenon-recursive¡ õºâpAÇoin¾9ts¼ãmaybAÇepartitionedintotwo:ð7ëM{_ºandëMU[x1¹...xn]}º.©
õºâTheºguidingprinciple,#>originallystatedb¾9yWÿ:«adler,isto¡ õºâmoAÇdelttherecursiv¾9etypAÇesbylettingthesub-evÿ|raluators¡ õºâin')ëMUU[...]ºvÿ|raluesbAÇerepresen¾9tative')oftheleastde ned¡ õºâelemen¾9tóèofthattypAÇeinthestructure.¸,Imaginewe¡ õºâha¾9ve©Õalistoft¾9ypAÇeëM[(Int,¹Int)]º,ôwhichinducesdo-¡ õºâmainªvëMLift2¹(Lift(2x2))º,Ͼandw¾9eknowthatevÿ|raluator¡ õºâëMUU[U[0,1]]°ºisthestrongestthatcansafelybAÇeapplied(that¡ õºâis,mwithout³dangerofnon-termination)tothelist.õzNo¾9w¡ õºâsuppAÇose Âw¾9eobtainanotherlistforwhichëMUU[U[1,0]]ºisthe¡ õºâstrongestßsafeevÿ|raluator,MÄandappAÇendittotheoriginal.ÉIWhat¡ õºâisôHthebAÇestevÿ|raluatorthatcanbeappliedtothenewlist?¡ õºâItO}cannotbAÇeeitheroftheoriginals,sincethatrisksnon-¡ õºâtermination.'HThenGmostw¾9ecanevÿ|raluateanyparticularele-¡ õºâmen¾9tluwhilstremainingsafeisëMU[0,0]º,=sothebAÇestthatcan¡ õºâbAÇeappliedtothelistasawholeisëMUU[U[0,0]]º{thegreat-¡ õºâestfÉlo¾9werbAÇoundofthevÿ|raluesfortheoriginallists.ÏWÿ:«adler¡ õºâsummarisedSthisb¾9ystatingthatalistischaracterised\by¡ õºâits¦Ùleastde nedelemen¾9t"butweneedtobAÇemoreprecise:¡ õºâa listisc¾9haracterisedbythegreatestevÿ|raluatorthatcan¡ õºâsafelyDbAÇeappliedtoan¾9yelement,Peevenifastrongerevÿ|ralua-¡ õºâtorIcouldbAÇeappliedtospeci celemen¾9ts.Ø~Thesameprinciple¡ õºâgeneralisesSÔtostructuredt¾9ypAÇesofanynumbAÇerofparameters,¡ õºâwith^thegreatest-lo¾9wer-bAÇound^characterisationoAÇccurringin-¡ õºâdepAÇenden¾9tlyTforeachparameter.¦ õºâThis(abstraction,FËwhilstsimple,assumesthatprogramstreat¡ õºâallð elemen¾9tsofthesametypAÇeinsideastructureinthesame çjã4 [ ºâ ý? £ ý íºâºw¾9ayÿ:«. ForåÜexample,ï[itassumeslistproAÇcessingfunctionstreat¤
íºâallèÍelemen¾9tsinthelistthesamewayÿ:«.
FunctionsèÍnotplaying¡íºâalongÁ withthisma¾9yinducebad,Ñ÷butsafe,results. ^Consider:¤ÐOûç¤ëMtail¹(x:xs)=xs¡íºâºIf¿^w¾9eapplyaëMUU[1]ºevÿ|raluatortoëM(tail¹zs)º,éàwhatcanwe¤
íºâevÿ|raluate%ëMzsºwith?ãUnfortunatelyÿ:«,©ÙnotëMUU[1]º,sincetheele-¡íºâmen¾9t"thatëMtailºthrowsawaymightjusthavebAÇeentheone-¡íºâand-only¥þnon-terminatingëMIntºinthelist.ÎmErringonthe¡íºâsideààofsafet¾9ythusrestrictstheevÿ|raluatorforëMzsºtoëMUU[0]º,¡íºâand%îlosesallthepAÇoten¾9tialparallelisminevÿ|raluatingtheele-¡íºâmen¾9ts +intherestofthelist.3ôOneupshotofthis, alsonoted¡íºâb¾9y/RWÿ:«adler,uÒisthatde ningfunctionsdirectlybypattern-¡íºâmatc¾9hing ×isessentialtogetgoAÇod ×results.ùúIntheexample¡íºâbAÇelo¾9w,Âthe1analysergivesamuchbAÇetterresultforëMsum1ºthan¡íºâëMsum2º,Tdespitethemha¾9vingidenticalstrictnesspropAÇerties.©ÐOûç¤ëMsum1¹[] Y=0¡ûç¤sum1¹(x:xs) s,=x+sum1xs¡¡ûç¤sum2¹xs Y=ifæXnullxs¡BÇnthen s,0¡BÇnelse s,head¹xs+sum2(tailxs)¦íºâºAáórelatedâ defectistheinabilit¾9yofthesedomainstocapture¡íºâtheK@notionofheadstrictness.¾3AK2headstrictfunctionisone¡íºâwhic¾9hÆ>evÿ|raluatesthe rstiteminalistwheneveritevÿ|raluates¡íºâthe 'listasfarasthe rstconstructor,IÛanddisco¾9vers 'itto¡íºâbAÇenon-nil.}ªHeadstrictnessisusefulinasequen¾9tialimple-¡íºâmen¾9tation,soîanextensionofthedomainstocapturethese¡íºâpropAÇertiesTw¾9ouldincreasetheusefulscopeofthisanalyser.©5íºâ¹2.2.4 úíMoFfdifyingLÎthenotationmíºâºThe,ÀabAÇo¾9vemappingassignsdomainëMLift¹()ºtoall¡íºâen¾9umeration ¹AtypAÇes, b:forexamplethefamiliartypAÇe¡íºâëMdata¹Bool=False|Trueº.<<Observ¾9eÊthatëMLift¹()ºisiso-¡íºâmorphicôtothet¾9wo-pAÇointôdomainusedforbaset¾9ypes,®and¡íºârigh¾9tlyTso. pAfterall,wecould,conceptuallyÿ:«,de ne¤ÐOíºâëMdata¹Int=...-3|-2|-1|0|1|2|3...¡íºâºandTw¾9e'dcertainlyexpAÇectatwo-pAÇointdomainforit!
íºâThisãisomorphismcanbAÇeusedtosimplifythedomainstruc-¤
íºâture,¶~andÈth¾9usthestrictnessanalysisitself.ôìWÿ:«eforgetabAÇout¡íºâdomainÁëM2º, andinsteadmapbaset¾9ypAÇesëMIntºandëMCharºto¡íºâëMLift¹()º,Ówith8ípAÇoin¾9tsëM{_,U[]}ºreplacingëM{0,1}º.;Hence-¡íºâforthTthenewnotationisused.¦íºâ¹2.2.5 úíSumma¹rymíºâºLetöëMD(t)ºdenotethedomainforsomet¾9ypAÇeëMtº.-LetëMtypeName¡íºâºbAÇeV5thenameofsomestructuredt¾9ype,fmandëMte1¹...tenV5ºbe¡íºâsomeTarbitraryt¾9ypAÇeexpressions. pëMDºisde nedas:ÐOûç¤ëMD(Int),Â=¹Lift()¡ûç¤D(Char) s,=¹Lift()¡¡ûç¤D(typeName¹te1...ten)¡
f=¹Lift s,(D(te1)x...xD(ten))¡if¹typeNamedenotesanon-recursivetype ý ¤
f=¹Lift2(D(te1)x...xD(ten))¡if¹typeNamedenotesarecursivetypeR³ õºâºThemconceptofafunction-vÿ|raluedcon¾9textseemsrathermean-¡ õºâingless,Tandisleftunde nedun¾9tilsection3.2.! õºâ¹2.2.6úíRestrictionsLÎonstructuredt¹ypFfesm õºâºTheÂastutereaderma¾9yhavenoticedtheexamplesabAÇove¡ õºâha¾9ve6bAÇeenratherrestricted.ô»Inparticular,¶
noneofthemhad¡ õºâconstan¾9tØ~typAÇesasanargumenttoanyconstructor.)Butthis¡ õºâsituationÂ7iscommonplace,Ò×forexampleastheëMIntºcon¾9veying¡ õºâbalancingTinformationinthefollo¾9wingtreedeclaration:©kÒç¤ëMdata¹AVLTreeab¡f=¹ALeaf¡f|¹ANodeInt(AVLTreeab)ab(AVLTreeab)¦ õºâºInsteadðiofextendingthedomain-generatingrulestoco¾9ver¡ õºâsuc¾9h¦cases,¹zitissimplertofactoriseouttheo endingëMIntº,¡ õºâgeneratingTasecondt¾9ypAÇeëMAVLTree2º:¦ç¤ëMdata¹AVLTree2iab¡f=¹ALeaf2¡f|¹ANode2i(AVLTree2iab)ab(AVLTree2iab)¦ õºâ(AVLTree2¹Intab) ½(ºisanisomorphic¡ õºât¾9ypAÇe]toëM(AVLTree¹ab)º,²ßat]thesametypAÇebeingat¾9ypefor¡ õºâwhic¾9htweknowhowtogenerateanabstractdomain.æØConve-¡ õºânien¾9tlyÿ:«,Þ±Milner-Hindley¶ltypAÇecheckersareamenabletosuch¡ õºâsubstitutions.
õºâFinallyÿ:«,yNobserv¾9eeOthattherearecertaintypAÇesforwhichitis¡ õºâhardTtodeviseasensiblesetofevÿ|raluators,forexample:¦ç¤ëMdata¹Fooab¡f=¹MkFooab(Foo(Fooab)(Fooab))¦ õºâºTheDsolutionadoptedinAnnaissimplytodeemtheseille-¡ õºâgal.ÍWÿ:«e¸ requirethat,àÐinat¾9ypAÇedeclaration,argumen¾9tson¡ õºâconstructorse"areeithersimplevÿ|rariables(here,yëMaºorëMbº),ora¡ õºâsimpleÁìrecursiv¾9einstanceofthestructure(here,íëMFoo¹abº).¡ õºâTheseþwrestrictionsseeminconsequen¾9tialforrealprograms,¡ õºâandTha¾9vebAÇeenreportedquiteindependan¾9tlyin[KHL91 (Ô].! õºâ¹2.3 G·TheLÎCo¹redatatypFfem õºâºThe5extensiv¾9elymangledsourceprogrameventuallypassed¡ õºâtotheabstractin¾9terpreterisatypAÇe-annotatedtree,¾Vrepre-¡ õºâsen¾9tingíÃasimplefunctionallanguage.@EachnoAÇdeinthetree¡ õºâcarries Fwithitanannotation.½GTheHask¾9elldatatypAÇeused¡ õºâisáìparameterisedo¾9veráìbAÇoththet¾9ypeoftheannotations,ì4and¡ õºâtheTt¾9ypAÇeoftheidenti ernames:¦ç¤ëMtype¹AnnExprab¡f=¹(b,AnnExpr'ab)¡¡ç¤data¹AnnExpr'ab¡f=¹AVarîa¡f|¹AConstr s,a¡f|¹ALitîInt¡f|¹AAp Y(AnnExprab)(AnnExprab)¡f|¹ALetîBool[AnnBindab](AnnExprab) çjãº5 zõ ºâ ý? £ ý
fëM|¹ACaseæX(AnnExprab)[AnnAltab]¤
f|¹ALamî[a](AnnExprab)¡¡ûç¤type¹AnnBindab¡
f=¹(a,AnnExprab)¡¡ûç¤type¹AnnAltab¡
f=¹(a,([a],AnnExprab))âíºâºTheÈ rstandsecondparametersonanëMAnnExprºt¾9ypAÇearefor¡íºâtheG iden¾9ti erandannotationtypAÇesrespectiv¾9elyÿ:«.±ËForG exam-¡íºâple,Fif<Uthet¾9ypAÇeofidenti ersisëMIdº,FandthatoftypAÇeexpres-¡íºâsionsJ·ëMTExprº,Xthet¾9ypAÇeofthecorrespondingCoreexpression¡íºâisTëM(AnnExpr¹IdTExpr)º.©
íºâMost³casesarestraigh¾9tforward.÷The³ëMAVarºtermrepresen¾9ts¡íºâan Ûiden¾9tifer,!=whilstëMAConstrºrepresentsaconstructorname.¡íºâLiteral=vÿ|raluesarerepresen¾9tedbyëMALitº,G
andapplicationsby¡íºâëMAApº.ÛÕLam¾9bAÇdaStermsarerepresentedbyëMALamº,zFwhichcanbind¡íºâanTarbitraryn¾9umbAÇerTofformalparameters.¦íºâThatllea¾9vesthetwotrickyones.]·Alet/recexpressionis¡íºârepresen¾9tedc1byëMALetº,¶¨whichhasabAÇoolean
agindicating¡íºâwhetherû thisisarecursiv¾9ebinding, Kalistofbindings,anda¡íºâmainÐexpressioninwhic¾9hthosebindingscanbAÇeused.DEach¡íºâbindingSäisaniden¾9ti erpairedwiththevÿ|ralueitisbAÇound¡íºâto.À_Caseö¤expressions,.÷denotedb¾9yëMACaseº,con¾9tainaswitch¡íºâexpression,Randz alistofalternativ¾9es.JÑEachz alternativeisa¡íºâtriple±ofconstructorname,¾constructorargumen¾9tsandthe¡íºâappropriatevrigh¾9t-handside.óÑTheuseofnestedpairsismore¡íºâcon¾9venientTforcoAÇdingpurposes.¦íºâAll7phasesdo¾9wnstreamofthelambAÇda-lifterexploitcertain¡íºâassumptions-abAÇouttheformoftheprogram.cÆThemostim-¡íºâpAÇortan¾9t,§arethattherearenonestedëMALetsº,[0thattheprogram¡íºâisfindepAÇendancyorder,¦kandthatnoiden¾9ti erisunde ned¡íºâorTm¾9ultiplyde nedinthesamescopAÇe.yxíºâ¹2.4G·CompilingLÎpa¹rallelcoFfdemíºâºEvÿ|raluationÓÅtransformersaresuppAÇosedlyexploitedb¾9ycom-¡íºâpiling³ÿm¾9ultiplecopiesofeachfunction,Ûªuptoonecopyfor¡íºâeac¾9h·kcontextinwhichtheresultmightbAÇedemanded.µFÿ:«or¡íºâeac¾9hcopyÿ:«,qcompile-timeanalysisindicateshowmuchde-¡íºâmandÙpropagatestotheparametersofthefunction,í:and¡íºâth¾9us showmuchtheargumentstothecallmaybAÇeevÿ|raluated¡íºâbAÇeforeæéthecall. ÷Inthismanner,ð2demandpropagationispre-¡íºâserv¾9edTasfarasthisstyleofstaticanalysismakespAÇossible.¡íºâOfcourse,Ú0allthisisdoneinpursuitoftheo¾9verallgoal:¡íºâmaximisinga~a¾9vÿ|railableparallelism. íAnequallyimpAÇortantis-¡íºâsue,2«not,Ídiscussedhere,isho¾9wtoavoidexcessive ne-grain¡íºâparallelism.¦íºâAllq.w¾9ellandgoAÇod,H#butq.thepAÇotentialforcoAÇdeexplo-¡íºâsionx¥rendersanaiv¾9eimplementationimpractical. FbCon-¡íºâsidersafunctiondeliv¾9eringaresultofthecontrivedtypAÇe¡íºâëM(Grok¹Int2(FooIntInt)(GrokIntIntInt))ºdiscussed¡íºâinîsection2.2.2.æ>Sincethedomainhas91pAÇoin¾9ts,Ôitwould¡íºâappAÇearrnecessarytocompile90v¾9ersionsofthecode,ùomit-¡íºâtingçêthev¾9ersionfornodemandatallontheoutput.
MBurn's¡íºâearlyw¾9orksimplyignoredtheproblembyrestrictingitself¡íºâtoó¶listsofëMIntº,+Nforwhic¾9hatmost3copiesofcoAÇdearere-¡íºâquired.7aQuiteÈúwhattodoabAÇoutcomplext¾9ypes,õãwhichÈúin-¡íºâduce.ÃproAÇductdomains,5 ornon-trivialinstan¾9tiationsoflists,¡íºâisTnotclear.¦íºâThis½unsatisfactorystateofa airscantosomeexten¾9tbAÇe¡íºâalleviated·b¾9yrestrictingourselvestocompilingjustasubset ý õºâof"ÜallthepAÇossiblev¾9ersionsofeachfunction.EThen,f=when¤
õºâtheËîoutputofafunctionisdemandedinacon¾9textforwhich¡ õºânoë½v¾9ersionhasbAÇeencompiled,ôtheversionusedisthatcom-¡ õºâpiledkaforthegreatestdemandlessthanthedemandw¾9ere-¡ õºâquired.«Observ¾9eE½thatthechoiceofalternativeisnotneces-¡ õºâsarily3unique,`Qbut,pro¾9videdwecompiledinafullysequential¡ õºâ(that4Õis,<¶WHNF4Ídemand)v¾9ersion,analternativ¾9eisatleast¡ õºâguaran¾9teed±9toexist.ð Ofcourse,Ø2somepAÇotentialparallelism¡ õºâma¾9ywellbAÇelost:!ÏsuchisthepriceforrestrictingthecoAÇde¡ õºâexplosionTtoatolerablemagnitude.©
õºâTheFØcen¾9tralquestion,p%then,isFØwhichversionstocompilecoAÇde¡ õºâfor.NoOne{TpAÇersonwhohasv¾9entured{Tintothisquagmireis¡ õºâMin¾9tchev.£Fÿ:«orÇìhisMScdissertation[Min92o],×gMin¾9tchevÇìbuilt¡ õºâaá@sim¾9ulationofaparallelgraphreductionmachine,;which¡ õºâunderstandsáthreelev¾9elsofdemand:6noneatall, Åweakhead¡ õºânormalgÊformdemand,|gandfulldemand.ÑAnimmediatead-¡ õºâvÿ|ran¾9tageÙlisthatthesepAÇointsapplytoallstructuredtypAÇes,¡ õºâincluding!Ôtuplesandcomplexinstan¾9tiationsoftypAÇes,Randare¡ õºâth¾9us¨¢morewidelyapplicablethanBurn'sscheme.Ö[Encour-¡ õºâaginglyÿ:«,ï$ev¾9enÃwithsofewevÿ|raluators,Min¾9tchevÃfoundthat¡ õºâsubstan¾9tial¿amountsofparallelactivityweregenerated,мvÿ|ral-¡ õºâidating·&hisapproac¾9h.åRecently·&ithasbAÇeensuggestedthat¡ õºâa#Ófourthevÿ|raluatormigh¾9tbAÇepro tablyincluded:9nevaluation¡ õºâofýKtheen¾9tirestructureofarecursivetypAÇe,7Ibutnoevÿ|ralua-¡ õºâtionM ofthecompAÇonen¾9ts.ÅSThismakesnosense,[³ofcourse,in¡ õºâaYTnon-recursiv¾9etypAÇe,jTor,alternativelyÿ:«,oneYTcanregarditas¡ õºâequivÿ|ralen¾9tTtotheWHNFevaluator,inthiscase.¦ õºâA.öfurther/ÄcomplicationiswhattodoabAÇoutpolymor-¡ õºâphicfunctions. s|Wÿ:«ema¾9ycompilethreeversionsofthe¡ õºâëMreverseª ºfunction,Ï:w¾9orkingfromtheevÿ|raluatorsofthesim-¡ õºâplest
instance,¡±butthenwhatdow¾9edogivenanevÿ|raluator¡ õºâëMUU[U[1,0]]G*ºappliedtoauseofëMreverseºatnon-baseinstance¡ õºâëM[(Int,¹Int)]->[(Int,Int)]º?aêSuce,}ittosa¾9ythata¡ õºâpAÇossiblesolutionisonlytocompilev¾9ersionsofpolymorphic¡ õºâfunctionsð½basedontheirevÿ|raluatorsforsimplestinstances,¡ õºâandÂausesafeappro¾9ximationtechniquesbasedonConcmaps¡ õºâtoä`handlethenon-baseinstances. See[HH91 >],î*section5,for¡ õºâan@in¾9troAÇductiontoConcmaps.ÕMyMScdissertation[Sew91/]¡ õºâindicates#ho¾9wConcmapsareusefulinmattersofpAÇolymor-¡ õºâphism,Tathemeexploredfurtherin[Sew93/].¦ õºâNo¾9w,ê¹ifàthecompilerisonlygoingtomakecoAÇdeforafewof¡ õºâall äthepAÇossibleevÿ|raluatorsforafunctionreturninganob ject¡ õºâof)bcomplext¾9ypAÇe,.fwhatisthepoin¾9tofdoingstrictnessanal-¡ õºâysisUÛwiththefullcomplemen¾9tofevÿ|raluators?ÞAfterall,eüthis¡ õºâamoun¾9ts×atodoingadetailedanalysis,åthenthrowingaway¡ õºâmostçofthedetailinthe nalansw¾9er.÷)Itwouldcertainly¡ õºâbAÇeJØm¾9uchquickerjusttoworkwiththosefewevÿ|raluatorswe¡ õºâare\reallyin¾9terestedin.òsNevertheless,°doingthatriskslosing¡ õºâin¾9termediate°detail,¥and,ultimatelyÿ:«,parallelism,compared¡ õºâwith/theexpAÇensiv¾9eapproach.òBuildinganabstractinterpre-¡ õºâtationgXfortheelc¾9heapAÇoapproachmightalsobAÇeratherdif-¡ õºâ cult,;andsthein¾9terpreterwouldhavetobAÇerewrittenevery¡ õºâtime®theparticularsubsetofin¾9terestingevÿ|raluatorschanged.¦ õºâAx nalin¾9terestingcaveatpAÇertainstohigher-orderfunctions.¡ õºâAs6Üexplainedto¾9wards6Ütheendofsection1.2,=itloAÇoksdif-¡ õºâ cultÄ4toexploitparallelisminhigher-orderfunctionsifw¾9e¡ õºâdoénotw¾9antétoengageincomplicatedmanipulationofevÿ|ral-¡ õºâuation¬transformersatrun-time.¦xOnecanthereforerea-¡ õºâsonablyÈÞarguethatthehigher-orderremo¾9vÿ|raltransformation¡ õºâ( rsti cation)describAÇedinsection5enhancesparallelism.¡ õºâWhat& rsti cationdoAÇesistodisco¾9ver&staticallysomeofthe¡ õºâfunctionalÃparameterspassedtohigher-orderfunctions,Óäand¡ õºâspAÇecialise;themaccordinglyÿ:«,Ltgenerating rst-orderreplace- çjã6 § ºâ ý? £ ý íºâºmen¾9ts.KøTheseÏ×canthenbAÇeparallelisedinthenormalwayÿ:«,¤
íºâwithout8Vha¾9vingtoresorttocomplicatedrun-timemachineryÿ:«.¡íºâMa¾9ybAÇe,Ô¦then,thisÄztransformationshouldbeincorporatedas¡íºâaTmatterofcoursein¾9togoAÇodTparallelisingcompilers.-íºâ¹3üTheLÎabstractinterp¹retation´íºâ3.1G·Prelimina¹ries¤míºâ3.1.1 úíTheLÎnotionoffo¹rwardsLÎandbackw¹ards¡íºâºSeman¾9tic`êanalysesoffunctionallanguagesseemtofallinto¤
íºât¾9woÔvcamps:³forwardsandbackwards.YÕTÿ:«oseetheintuitive¡íºâmeaningTofthis,considerafunctionapplication:¤ÐOûç¤ëM(f¹xyz)¡íºâºAèforw¾9ardèanalysisgeneratesinformationabAÇoutëMfºwhich¤
íºâtellsMÑuspropAÇertiesoftheapplicationëM(f¹xyz)MѺifw¾9eknow¡íºâthe¤epropAÇertiesoftheindividualargumen¾9ts,È)ëMxº,ëMy¤eºandëMzº.ɤIn¡íºâotherÙw¾9ords,
¬theanalysispropagatesinformationóR¼j¹ cmti9ëRforwards¡íºâºthroughªµfunctions.ÜFÿ:«orw¾9ardanalysestendtobAÇeexpensiv¾9e¡íºâbAÇecauseзtheyha¾9veзtoconsiderallpossiblein¾9teractionsbe-¡íºât¾9ween²¢arguments.ô[Ontheotherhand,Ùöonegetsaveryde-¡íºâtailedTpictureofwhatisgoingon.©
íºâAù§bac¾9kwardú$analysis,sXbycontrast,sXgeneratesinformation¡íºâabAÇoutÑúëMfºwhic¾9htellsusthepropertiesoftheindividualargu-¡íºâmen¾9tsHëMxº,qëMyºandëMzºifweknowsomepropAÇertyoftheapplication¡íºâëM(f¹xyz)º.ñThat
×is,Vabac¾9kwards
×analysispropagatesprop-¡íºâerties®4ëRbackwardsºthroughfunctions.úBac¾9kwardanalysesmay¡íºâbAÇe2c¾9heapertodo,_÷buttheyma¾9yalsogivelessdetailedresults.¦íºâNo¾9w,åforÙreasonswhichwillshortlybAÇecomeapparent,åAnna¡íºâdoAÇesÅuacom¾9binedforwardandbackwardanalysis.ÐTheprop-¡íºâerties\>whic¾9hAnnapropagatesforwardsthroughfunctions¡íºâare{theabstractvÿ|ralues,whilstthosewhic¾9h
owbackwards¡íºâareh
con¾9texts.â®Tÿ:«osetthestage,¶observecriticallythatëRAÃnna's¡íºâmain¥±purposeistodeterminethebackwardsbehaviourof¡íºâthesourcelanguagefunctionsº.ÒTheÈzpresenceofforw¾9ard(ab-¡íºâstract)÷ vÿ|raluesisanecessaryevilwhic¾9henablesustodeal¡íºâcleanlyÚ[withhigher-orderfunctions.kThediscussionwhic¾9h¡íºâno¾9wsæfollowsmakesmoresenseifyoukeepaclearnotionthat¡íºâabstract=xvÿ|raluescorrespAÇondtoaforw¾9ards
owofinformation,¡íºâwhilstTcon¾9textscorrespAÇondtoabackwards
ow.5íºâ¹3.1.2 úíALÎfundamentalp¹roblemwithbackwardsanalysismíºâºBac¾9kwardsØ.strictnessanalysisw¾9ouldbAÇestraightforward,¡íºâw¾9ere_itnotforthehigher-ordernatureofthelanguageunder¡íºâanalysis. pTÿ:«oTseetheproblem,considerëMapplyº:¤ÐOûç¤ëMapply¹fx=fx¡íºâºGiv¾9enhôsomedemandonauseofapplyÿ:«,}ÜëM(apply¹gy)º,what¤
íºâdemand [ma¾9ybAÇepropagatedtoëMyº?
Withoutknowinghow¡íºâëMg8ºpropagatesdemandtoitsargumen¾9t,1theonlysafeanswer¡íºâisE\none".«Ho¾9wever,òknowingwhatëMgºisimplieshavinga¡íºâforw¾9ardáµ
owofinformation,ìaswellasthebackward
owof¡íºâdemandTw¾9estartedwith.¦íºâThingsº«loAÇokgrimmerwhenw¾9eputfunctionsinsidedata¡íºâstructures,Tthen shthemoutandapplythem:ÐOûç¤ëM1¹+(headxs(y+1)) ý õºâºwhere½åëMxs¹::[Int->Int]º.$Thereisnow¾9aytotellwhat¤
õºâdemandTcouldbAÇepropagatedtoëMyº.©
õºâTheí solutionreallyliesinbuildingacom¾9binedbackwards¡ õºâand¯×forw¾9ardsanalysis.ëøWÿ:«ray[Wÿ:«ra85:C]madeastartonthe¡ õºâproblem,YÿbutLDittoAÇokthew¾9orkofHughes[Hug87ó']togener-¡ õºâaliseOWÿ:«ra¾9y'sresultstothepAÇointofgeneralapplicabilityÿ:«.ÚThe¡ õºâresulting÷analysisisratherhardtounderstand,0)so,rather¡ õºâthan×attemptingahead-onassault,¥¸w¾9eloAÇok rstatunder-¡ õºâlyingTissues,startingo withsomenewconcepts.ºç õºâ¹3.2 G·F¹unctionLÎcontextsm õºâºDealing-øwithfunctionspropAÇerlymeansturningthemin¾9to¡ õºâ rst-classÂlcitizensforthepurpAÇosesoftheabstractin¾9ter-¡ õºâpreter.Section2.2discussedthenotionofdemand(orcon-¡ õºâtext)Q/onadatastructure.ÐWÿ:«eno¾9wextendthenotionof¡ õºâcon¾9textTtofunctions.¦ õºâSince
Êacon¾9textreallydenotesademandforevÿ|raluation, æthe¡ õºâidea¶ ofafunctioncon¾9textseemsprettymeaningless:]ßafter¡ õºâall,¹§ho¾9wÉcanafunctionbAÇeevÿ|raluated?¦ÐButimaginewede-¡ õºâ ned¼#afunctioncon¾9textasapair,å×containingtheabstract¡ õºâvÿ|ralueRÚoftheargumen¾9t,b<andthecontextfortheresultofan¡ õºâapplicationÁofthefunction. ·Bymakingtheanalysisfully¡ õºâcurriedv3fromno¾9won,kwecanconsiderallfunctionsashav-¡ õºâingæ;justoneargumen¾9t. ½Then,ï§forexample,thecon¾9textona¡ õºâfunctionToft¾9woTarguments,suchasëMapplyº,loAÇokslike:©Y ç¤ëM(abstract¹valueoffirstargument,¡f(abstract¹valueofsecondargument,¡Íücontext¹onresult)¡ç¤)¦ õºâºSuc¾9hQªaschemewouldsolvetheproblemoutlinedabAÇove,`¿by¡ õºâsupplyingÌDthevÿ|ralueofthe rstparameter,Úáallo¾9wingdemand¡ õºâtoúêbAÇepropagatedon¾9tothesecondparameter.¢Thisabstract¡ õºâvÿ|ralueaofthe rstparameterisjusttherelevan¾9tcontextfunc-¡ õºâtion,ßbutöwhatoftheabstractvÿ|ralueofthesecond,non-¡ õºâfunctionalͶparameter?Wÿ:«ell,Ü w¾9earesimplynotinterestedin¡ õºâit,Tsow¾9emapittothe1-pAÇointdomain.
õºâTheÌÝw¾9orldnowbAÇecomespopulatedb¾9ytwospAÇeciesofvÿ|ralues:¦äëP :âëNCon´Ctexts±º(alsocalledbac¾9kwards±vÿ|ralues,¬evaluatorsor¡ :âdemands).QIn'whatfollo¾9ws,+}we'oftensa¾9y\context"or¡ :â\con¾9text+on"whenitwouldbAÇemorenaturaltosay¡ :â\demand"àÐor\demandon".
ïThiscon¾9ventionàÐhasbAÇeen¡ :âadoptedÑÆbAÇecauseofawishtoha¾9veÑÆjustonetermfor¡ :âeac¾9hTconcept. ûî :âCon¾9textsrUarethe rstkindofabstractentityreferred¡ :âto>ôinsection2.1.QFÿ:«ornon-functionvÿ|ralues,\theyare¡ :âas~discussedinsection2.2.íFÿ:«orfunctionvÿ|ralues,³they¡ :âareHÀapairwhic¾9hwewriteasëM(Fnc¹ac)º,whereHÀëMFnc¡ :âºremindsæthatthisisaëNFÿ ÌuNction}·Con´Ctextº,åëMaºisthe¡ :âabstract¯3vÿ|ralueoftheargumen¾9tandëMcºisthecontexton¡ :âthe9
result.Henceforth,A÷vÿ|rariablesdenotingcon¾9textsor¡ :âcon¾9textTmapshave'c'astheir rstletter.÷ÜäëP :âëNAbstract @vÿhalues£º(alsocalledforw¾9ardsvÿ|ralues).ö[These¡ :âare¬thesecondkindofabstracten¾9tity¬describAÇedinsec-¡ :âtionê2.1.÷Theyaredesignedpurelytocon¾9veyêcontexts¡ :âto=^an¾9yplaceinvolvingacalltoanunknownfunction,¡ :âsuc¾9hôasinthetwoproblematicexamplesabAÇove.zOThe¡ :âabstract+vÿ|raluesofnon-functionob jectsarealw¾9ays+irrel-¡ :âevÿ|ran¾9t¤ãandaremappAÇedtoa1-poin¾9tdomain,»`whosesin-¡ :âgleG°pAÇoin¾9tisdenotedëM#º,pÒforthetimebeing.×äTheabstract çjã7 ·7 ºâ ý? £ ýõ¦dÂlÎíºâ¾S4 fföÌ̤ÿþÌÍwÙ ~Ù ff·328ÚÍ ffC,¡¤
fffg
ff33üÿþºDe ningTequation "V¡
ffp·Disassem¾9blesTa..."½¤
ff ß
proAÇducingTthe...a
fffg
ff©fh ffC,¡
fffg
ffhæ
ff Ùût
ffC,
fffg
ff¤
¤
fffg
ff33üÿþëMFncA s,(Fnc¹ac)=a33¡
ffp·ºfunctionalTcon¾9text @O
ff ß
abstractTvÿ|ralueoftheargumen¾9t'õ¡
fffg
ff¡¤
fffg
ff33üÿþëMFncC s,(Fnc¹ac)=c33¡
ffp·ºfunctionalTcon¾9text @O
ff ß
con¾9textTontheresultPR
fffg
ff¡¤
fffg
ff33üÿþëMFvalA¹(Fvalca)=a¡
ffp·ºfunctionalTabstractvÿ|ralue33
ff ß
abstractTvÿ|raluemap: pargumen¾9ttoresult33
fffg
ff¡¤
fffg
ff33üÿþëMFvalC¹(Fvalca)=c¡
ffp·ºfunctionalTabstractvÿ|ralue33
ff ß
con¾9textTmap: presulttoargument @O
fffg
ff¡
fffg
ffhæ
ff Ùût
ffC,
fffg
ff¦ ffC,;ÌÌ TTÿ:«ableT1: pSelectorfunctionsforfunctionalen¾9tities
öff ~Ù ffx@ fföÌÌ
Y þ¦d:âvÿ|ralue2&ofafunction-valuedob jectisalsoapair(but¤
:âquite7îunrelatedtoëMFncºpairs),ÀwrittenëM(Fval¹ca)º,¡:âwithJ¡ëMFvalºremindingusthisisaëNFÿ Ìunctional£jabstract¡:âVþÑALueº.ë=Theît¾9wocompAÇonentsarebAÇothmaps.ë=The¡:â rstvcompAÇonen¾9t,æëMcº,mapsthecon¾9textonthefunction¡:âto7;con¾9textontheargument,c§whilstëMaºmapstheabstract¡:âvÿ|ralue5ëoftheargumen¾9ttotheabstractvalueofthere-¡:âsult.É
Vÿ:«ariablesNÝdenotingabstractvÿ|raluesorabstract¡:âvÿ|ralueTmapsha¾9veT'a'astheir rstletter.íºâNoticenho¾9wthetwokindsofvÿ|raluesaremutuallyrecursive.¡íºâTheo¾9veralloutputoftheabstractinterpreterisoneab-¡íºâstractB}vÿ|raluepAÇerCorefunction.£ëEac¾9habstractvaluecon-¡íºâtains®®enoughinformationtopropagatedemandfromthe¡íºâo¾9verall½ýresulttoeac¾9hofthearguments,Ïueveninthepresence¡íºâofhÉfunctionalparameters.ÎTheseconceptsareconfusing,}¦so¡íºâsome>2examplesareinorder.ÔºFirst,i9de nefourselectorsëMFncAº,¡íºâëMFncCº,ØëMFvalAØtºandëMFvalCºtodisassem¾9bleëMFncºsandëMFvalºs,äwith¡íºâthe¯bAÇeha¾9viourshowninTÿ:«able1.úHopAÇefully,Ãôtheirnameswill¡íºâserv¾9eTasareminderoftheirmeaning.©
íºâLet's ©startwiththesimplestfunctionimaginable:¡íºâëMid¹::Int->Intº.ðThe
Óonlyremotelyin¾9terestingthingwe¡íºâcanîsa¾9yabAÇoutëMidºisthatitsimplypropagatesthecontexton¡íºâits4£resulttothecon¾9textonitsargument.z]So,<wsuppAÇosingwe¡íºâno¾9wXwritedownamappingfromthecontextontheresult¡íºâtoTthecon¾9textontheargument,weget:¤y®ûç¤ëM(\c¹->c)¡íºâºLet's]ÃbAÇeclearwhatthisis.õ½It'sëRnotºacon¾9text,oßandit'salso¤
íºâëRnotË{ºanabstractvÿ|ralue.ÒIt'samapfromcon¾9textstocontexts.¦íºâBut×that'snotgoAÇod×enough.aúWÿ:«esaidearlierthatAnna¡íºâproAÇduces êoneabstractvÿ|ralueperCorefunction.32Sowhatdo¡íºâw¾9e«(proAÇduceforëMidº?ÝíFÿ:«orastart,ÐsinceëMidºisafunction,w¾9e¡íºâm¾9ust²Wgetafunctionalabstractvÿ|ralue:êñanëMFvalºterm.ûqItmust¡íºâloAÇokTlik¾9e:©ûç¤ëMid¹=Fvalcontext_map¡+'abstract_value_map¦íºâºNo¾9w,É the¶contextmap,É aswejustmentioned,É mapsthecon-¡íºâtext]ªonëMidºtothecon¾9textonëMidº'sargument.ß7Andthecontext¡íºâon÷±ëMidº,ýsinceëMidºisafunction,m¾9ustbAÇeafunctioncontext,ýof¡íºâtheøÜformëM(Fnc¹ac)º,1¾whereøÜëMcºisthebitw¾9e'rereallyafter.¡íºâThis &giv¾9esacontextmapofëM(\c¹->FncCc)º, Úso &we'venow¡íºâgot:¦ûç¤ëMid¹=Fval(\c->FncCc)¡+'abstract_value_map þ¦d õºâºWhat¸ñoftheabstractvÿ|raluemap?HIttellsuswhattheab-¤
õºâstractYvÿ|ralueofëMidº'sresultisgiv¾9entheabstractvalueofëMidº's¡ õºâargumen¾9t.Ý°But,;/for ithisinstanceofëMidº,theresultt¾9ypAÇeis¡ õºâëMIntº.e¦Allnon-functiont¾9ypAÇeshaveacorrespAÇondingabstract¡ õºâvÿ|ralue,õdenotedí²ëM#º,ina1-pAÇoin¾9tdomain.:Sowedon'tactually¡ õºâcareÞ@whattheabstractvÿ|ralueofëMidºis{itcanonlybAÇeëM#ºan¾9y-¡ õºâw¾9ayÿ:«.oThat·Tmeans,ßÔafterinstallingtheabstractvÿ|raluemap,¡ õºâw¾9eYcouldwriteeitherofthefollowing,j²althoughthesecond¡ õºâisTalittleclearer:©ÐOç¤ëMid¹=Fval(\c->FncCc)¡3'(\a¹->a)¡¡ç¤id¹=Fval(\c->FncCc)¡3'(\a¹->#)¦ õºâºIf&ây¾9ouareconfused,kEgonofurther!QItisbAÇettertoreturn¡ õºâtotthestartofthissection,Kconsideragainthemeaningsof¡ õºâcon¾9texts6Øandabstractvÿ|ralues,?9anditerateuntiltheexample¡ õºâmak¾9esTsense.
õºâMo¾9vingTontoëM(+)¹::Int->Int->IntTºgives:¦ç¤ëM(+)¹=Fval(\c1->FncC(FncCc1))¡7á(\a1¹->Fval(\c2->FncCc2)¡uM´(\a2¹->#))¦ õºâºThisÕ¨timecurryingcomesin¾9toplayÿ:«.]kThat'swhytheterm¡ õºâwhic¾9hQmapstheabstractvÿ|ralueofthe rstargumenttothe¡ õºâabstractèvÿ|ralueoftheresultreturnsaëMFvalºterm:Ââthe\re-¡ õºâsult"oØherehast¾9ypAÇeëMInt¹->Intº.+ûClearlyÿ:«,yëM(+)oغsimplyprop-¡ õºâagates5 con¾9textontheoverallresulttobAÇotharguments,¡ õºâwhic¾9h§iswhythecontextmapsforthetwoarguments¡ õºâare%+ëM(\c1¹->FncC(FncCc1))ºandëM(\c2->FncCc2)º.KõIf¡ õºâthisseemsalittlem¾9ysterious,*íbAÇearinmindthatboth¡ õºâëM(FncC¹(FncCc1))XºandëM(FncC¹c2)ºrefertothecon¾9texton¡ õºâtheOf nalresult.
ʧThat'sbAÇecauseëMc1ºbindstoacon¾9text¡ õºâinM¬ëMInt¹->Int->Intº,ÛÁwhic¾9hisnecessarilyoftheform¡ õºâëM(Fnc¹#(Fnc#cc))ܺwhereëMccºisthecon¾9textonthe nal¡ õºâresult.òeSimilarlyÿ:«,°nëMc24ºisacon¾9textoftypAÇeëMInt¹->Intº,°nhaving¡ õºâthe~;formëM(Fnc¹#cc)~;ºwhereëMccºisagainthecon¾9textonthe¡ õºâ nalTresult.
õºâNo¾9wÛ?forsomethingaltogethermoreadventurous:ÿfthefamil-¡ õºâiarªxëMapplyºfunction,ÏÁatt¾9ypAÇeëM(Int¹->Int)->Int->Intº.¡ õºâThisÔÈexampleiseasiertofollo¾9wifonebAÇearsinmindthat¡ õºâëM(apply¹fx)íºreducesimmediatelytoëM(f¹x)º,soan¾9ycontext¡ õºâappliedöÖtotheformerexpressionalsoappliesdirectlytothe¡ õºâlatter.ZWhatá¢theratherformidabletermbAÇelo¾9wdoesisto¡ õºâroute[thecon¾9textfromtheresultofcallingëMapplyºtothe¡ õºâresultTofcallingthehigher-orderparameter. çjã8 Ör ºâ ý? £ ý ûç¤ëMapply¹=Fval(\c1->Fnc(FncA(FncCc1))¤
rJ(FncC¹(FncCc1)))¡9TB(\a1¹->Fval(\c2->(FvalCa1)¡ (Fnc¹(FncAc2)¡ ´-~(FncC¹c2))¡vÀà(\a2¹->(FvalAa1)a2))jíºâºFirstHfofall,Õ*considerwhatthefunctioncon¾9textëMc1ºwill¡íºâget3bAÇoundtom¾9ustlooklik¾9e: -ëM(Fnc¹a_ho(Fnc#c_final))¡íºâºwhere¹ëMa_hoºustheabstract(orforw¾9ard)vÿ|ralueofthefunc-¡íºâtionalºparameterandëMc_finalºisthecon¾9textontheresult¡íºâofÈ applyingthisfunctionalparametertosomething.4ÏNo¾9w,¡íºâtermNëM(\c1¹->Fnc(FncA(FncCc1))(FncC(FncCc1)))¡íºâºmapsì;con¾9textonëMapplyºtocontextonthe rstparameter.¡íºâAsythisisafunctionalparameter,¹Bitmak¾9essensethatthis¡íºâexpression4 isbuiltfromaëMFncº.ÑXSojustwhatcon¾9textispropa-¡íºâgatedÐntothefunctionalparameter?yWÿ:«ell,Þ6theabstractvÿ|ralue¡íºâm¾9uståîbAÇethesameastheabstractvÿ|ralueofthesecondpa-¡íºârameter¬½toëMapplyº,Òandthisvÿ|ralue(whic¾9hmustbAÇeëM#º)isex-¡íºâtracted´qb¾9ythetermëM(FncA¹(FncCc1))´qºSimilarlyÿ:«,Ü8thecon-¡íºâtextssontheresultofthefunctionalparameterm¾9ustbAÇethe¡íºâsameøsasthecon¾9textontheoverallresultofëMapplyº,þ9givenby¡íºâëM(FncC¹(FncCc1))º.©
íºâEv¾9erythingelseiseasiertofollow.Ç
Vÿ:«ariableëMa1ºwillgetbAÇound¡íºâto ctheabstractvÿ|ralueofthefunctionalparameter,'whic¾9h¡íºâm¾9ust"bAÇeaëMFvalºterm.
SoëM(FvalC¹a1)ºreturnsthemapused¡íºâb¾9yÇdthefunctionalparametertotranslatecontextonitselfto¡íºâcon¾9text½onits rstargument.¬Themapisappliedtothe¡íºâsameÜYfunctioncon¾9textaswasbuiltintheprecedingpara-¡íºâgraph,;except3áthatreferencestoëM(FncC¹c1)ºarereplacedb¾9y¡íºâëMc2º,Twhic¾9histhesamething.¦íºâFinallyÿ:«,ëÆtheÀâabstractvÿ|ralueoftheresultisgiv¾9enbyapply-¡íºâingæJtheabstractvÿ|raluemapofthefunctionalparameter,¡íºâëM(FvalA¹a1)º,to¦theabstractvÿ|ralueofthesecondparameter,¡íºâëMa2º.¦íºâTw¾9oA improvementsarepAÇossible.ÎFirstlyÿ:«,Ltheabstractvÿ|ralue¡íºâof+theresultm¾9ustsimplybAÇeëM#º,0~sincetheresulttypAÇeisëMIntº.¡íºâSecondlyÿ:«,examinationC~ofthede nitionofëMFncAC0ºandëMFncC¡íºâºsho¾9wsu'thatëM(Fnc¹(FncAc)(FncCc))u'ºisequivÿ|ralentsimply¡íºâtoTëMcº. pTheimpro¾9vedTversionis:©jûç¤ëMapply¹=Fval(\c1->FncCc1)¡9TB(\a1¹->Fval(\c2->(FvalCa1)c2)¡vÀà(\a2¹->#))¦íºâºThemec¾9hanismfordealingwithfunctionsandapplications¡íºâisjLthehardestpartoftheabstractin¾9terpretertounderstand.¡íºâA1õlittle2/timespAÇen¾9tmakingsenseofthislastexampleisawise¡íºâin¾9vestment.
íºâWh¾9yGisitnecessarytopropagatedemandintofunctional¡íºâparameters? pWÿ:«ell,Tconsider:¦ûç¤ëMadd1¹x=apply(+x)1¦íºâºIfë5demandisn'tpropagatedin¾9toëMapplyº'sfunctionalparame-¡íºâter,$there XwillbAÇenodemandontermëM(+¹x)ºandnoneonëMxº,¡íºâgiving [theimpressionthatëMadd1ºisnotstrict, whenreallyit¡íºâis.
eíºâ¹3.3G·Mo¹reLÎabFfoutabstractvaluesmíºâºAll:onon-functionexpressionsyieldanabstractvÿ|ralueinaunit¡íºâdomain.Ï3Ho¾9wever,Ê{vÿ|ralue¦@ëM#º,usedintheexamplesabAÇo¾9ve,Ê{is ý õºâtoAÇoË indiscriminating.=TheHask¾9elldeclarationforabstract¤
õºâvÿ|raluesTloAÇoks(almost)lik¾9ethis:©ÐOç¤ëMdata¹AbsVal¡f=¹ANonRec s,[AbsVal]¡f|¹ARecî[AbsVal]¡f|¹FvalîContextAbsVal¡¡f|¹AbsVar,ÂId¡f|¹AbsLam,ÂIdAbsVal¡f|¹AbsApæXAbsValAbsVal¡¡f|¹FncAîContext¡f|¹FvalAæXAbsVal¡f|¹SelAîIntAbsVal¡f|¹AMeetæX[AbsVal]¦ õºâºThe¢ëMARecºandëMANonRecºtermsde neabstractvÿ|ralues¡ õºâforø3recursiv¾9eandnon-recursivetypAÇes,°êrespectivelyÿ:«. Å
In¡ õºâbAÇoth¬cases,¾theassociatedlistofëMAbsValºsaretheab-¡ õºâstractvÿ|raluesoftheparametersofthet¾9ypAÇe. èFÿ:«orex-¡ õºâample,|þaÜtermoft¾9ypAÇeëM[(Int,¹Int)]ºhasabstractvÿ|ralue¡ õºâëM(Rec¹[NonRec[NonRec[],NonRec[]]])º,½giv¾9enpthatëMInt¡ õºâºisNFtreatedasanen¾9umerationandthusmapstoëM(NonRec¹[])º.¡ õºâIt
ÔisimpAÇortan¾9ttorealisethatthisvÿ|ralueisstillunitaryÿ:«,Tlike¡ õºâëM#º,ÊbutHhastheaddedadvÿ|ran¾9tagethatitcanbAÇedisassem-¡ õºâbled~torev¾9ealitsunitarysubAÇcomponents,vas~necessitatedby¡ õºâtheµabstractin¾9terpretationofëMcaseºstatements.üConstructor¡ õºâëMSelATºisusedforthis,withmeaning:©ÐOç¤ëMSelA¹n(ARecæX[a1...an...ak]) s,=an¡ç¤SelA¹n(ANonRec[a1...an...ak]) s,=an¦ õºâFvalº,pµëMFncA^[ºand^nëMFvalAºw¾9ereintroAÇducedintheprevioussec-¡ õºâtion.ÎÒëMAbsVarº,[
ëMAbsLam,{ºandëMAbsApºallo¾9wreferencestoabstract-¡ õºâvÿ|ralued°qvariables,8andforthecreationandapplicationof¡ õºâabstract-vÿ|raluedg9mappings. Observ¾9ethatweoftenomit¡ õºâëMAbsVarîRºandëMAbsApº,$whenthemeaningisob¾9vious,andab-¡ õºâbreviateTëM(AbsLam¹ae)ºtoëM(\a->e)º.
õºâConsiderTagain¤ÐOç¤ëM1¹+(headxs(y+1))¡ õºâºwheretÕëMxs¹::[Int->Int]º.:ôWÿ:«eexpAÇectëMxsºtoha¾9vebAÇeen¤
õºâbAÇoundÔ*toanabstractvÿ|raluewhic¾9hcansupplyasensible¡ õºâcon¾9text-mapping:$function.àOnceagain,CXwecharacterisethe¡ õºâlistF0b¾9ytheleastelement,othistimetheleastcontextfunction,¡ õºâinTit. pSo,suppAÇosing¤ÐOç¤ëMxs¹=[id,id]whereidx=x¡ õºâºtheTabstractvÿ|ralueofëMxsºwillbAÇe:¡ç¤ëMARec¹[ s,Fval(\c1->FncCc1)©
ATB(\a1¹->ANonRec[]) s,]¡ õºâºTheìÅe ectoftheëMheadºfunctionistowrapëMSelA¹1ºaround¦ õºâthisöterm,makingtheabstractvÿ|ralueofëMidºa¾9vailablewhere¦ õºâitTisneeded. pBut,no¾9w,ifëMxsºwerede nedas¡ç¤ëMxs¹=[id,const]whereidxî=x¦p const¹x s,=42 çjãº9
óÆ ºâ ý? £ ý íºâºw¾9e²needtobAÇemorecautious.òµSincetheabstractinterpre-¤
íºâtationybcannotdistinguishitemsinlists,Òew¾9emustarrange¡íºâthat´öthefunctionwhic¾9hemergesfromthelistrepresentsthe¡íºâw¾9eakerbevÿ|raluator:¶ùëMconstº.=Thatrequiresthelistasawhole¡íºâtoTha¾9vevÿ|ralue:©Zûûç¤ëMARec¹[ s,Fval(\c1->_)¡9TB(\a1¹->ANonRec[]) s,]¦íºâºThe2upshotofallthisisthattheabstractvÿ|ralueofalist¡íºâcon¾9taining ©functionsischaracterisedbytheleastfunction¡íºâinʾthelist,øwiththeprincipleextendinganalogouslytoall¡íºâother8structures.i Inordertocarrythatout,ßðagreatest-¡íºâlo¾9wer-bAÇound¯operationisneededforabstractvÿ|ralues.úThisis¡íºâwhatTtheëMAMeetºtermisfor.ìÃíºâ¹3.4G·Mo¹reLÎabFfoutcontextsmíºâºThisæ.isagoAÇodæ.poin¾9tatwhichtowheelintheHaskelldecla-¡íºâration0&forcon¾9texts.læUnfortunatelyÿ:«,6ÛitisevenmorecumbAÇer-¡íºâsomeTthantheëMAbsValºdeclaration. pNev¾9ertheless:¦ûç¤ëMdata¹Context¡
f=¹Stop1¡
f|¹Up1 Y[Context]¡
f|¹Stop2¡
f|¹Up2¡
f|¹UpUp2æX[Context]¡
f|¹Fnc YAbsValContext¡¡
f|¹FncCîContext¡
f|¹FvalCæXAbsVal¡¡
f|¹CJoinæX[Context]¡
f|¹CMeetæX[Context]¡¡
f|¹CtxVar,ÂId¡
f|¹CtxLam,ÂIdContext¡
f|¹CtxApæXContextContext¡¡
f|¹SelUîIntContext¡
f|¹SelUUæXIntContext¡
f|¹CaseUæXContextContextContext¡
f|¹CaseUU,ÂContextContextContextContext¡¡
f|¹DefUîContext¡
f|¹DefUUæXContext¦íºâºTheS rstsixareforbuildingliteralcon¾9texts.Õ«ëMStop1ºand¡íºâëMUp1yOºpAÇertaintopoin¾9tsinëMLift¹(D1x...xDn)º,withyOëMStop1¡íºâºrepresen¾9ting§thebAÇottompoin¾9tëM_º,Y|andëM(Up1¹[x1...xn])¡íºâºrepresen¾9tingthepAÇointëMU[x1¹...xn]º.Similarlyÿ:«,TëMStop2º,ëMUp2¡íºâºand$uëM(UpUp2¹[x1...xn])ºrepresen¾9tthepAÇointsëM_º,h=ëMU_ºand¡íºâëMUU[x1¹...xn] &ºinthedomainëMLift2¹(D1x...xDn)º.ɶëMFnc¡íºâºiseusedforbuildingfunction-vÿ|raluedcon¾9texts,¦/asdiscussedin¡íºâsectionHj3.2.µ³Finallyÿ:«,U0ëMDefUH]ºandëMDefUUºexisttohelptheterm¡íºârewritingTsystem,asdescribAÇedinsection4.4.©
íºâëMFncC(åºand)!ëMFvalCºw¾9erealsodiscussedinsection3.2.Í´ëMCJoinºand¡íºâëMCMeet]=ºunsurprisinglydenotetheleastuppAÇerandgreatest¡íºâlo¾9werTbAÇoundsoftheirrespectiv¾9eargumentlists.¦íºâëMCtxVarº,ÙæëMCtxLamL0ºandëMCtxApºareexactequivÿ|ralen¾9tstothe¡íºâëMAbsVarº,"åëMAbsLamìûºandëMAbsApºdiscussedinsection3.3.£fThey¡íºâpro¾9videÿ¤awaytoreferencecontext-vÿ|raluedvariables,úandal-¡íºâlo¾9w8thecreationandapplicationofcontext-vÿ|raluedmaps. ý õºâOnce¡again,«notethatw¾9eoftenomitëMCtxVarºandëMCtxApº,¤
õºâwhen³themeaningisob¾9vious,ƺandabbreviateëM(CtxLam¹ce)¡ õºâºtoTëM(\c¹->e)º.
õºâFÿ:«arù%anda¾9wayù%themostin¾9terestingconstructsarethelast¡ õºâfour.¢yëMCaseUAöºandBëMCaseUUºallo¾9wpartialdisassemblyofvÿ|ralues¡ õºâin6mëMLift¹(D1x...xDn)ºandëMLift2(D1x...xDn)ºre-¡ õºâspAÇectiv¾9elyÿ:«,
fin;Éthemannerdiscussedinsection2.2.3.ÎThe¡ õºâexactTseman¾9ticsare:©´ºç¤ëMCaseU¹Stop1,Âxy s,=x¡ç¤CaseU¹(Up1_)xy s,=y¡¡ç¤CaseUU¹Stop2îxyz s,=x¡ç¤CaseUU¹Up2!xyz s,=y¡ç¤CaseUU¹(UpUp2_)xyz s,=z¦ õºâºNoteüdthattheswitc¾9hvÿ|raluesarerestrictedtobAÇeingindo-¡ õºâmains½ëMLift¹(D1x...xDn)ºandëMLift2(D1x...xDn)¡ õºâºrespAÇectiv¾9elyÿ:«.Switch¾
vÿ|raluesfroman¾9yotherdomainconsti-¡ õºâtute$´anill-formedcon¾9text.JëMCaseU$°ºandëMCaseUUºtermsdenote¡ õºâaîmappingfromtheirswitc¾9hexpressionstooneoftheal-¡ õºâternativ¾9es.ò(As<such,C¶awell-formedëMCaseUýºorëMCaseUUºm¾9ust¡ õºâdenote7aamonotonicmapping,åsow¾9eimpAÇosethesemantic¡ õºâconstrain¾9tTthatëMx
`°ëPvÆëMy Ý"ëPvÆëMzK\º.
õºâAs~,y¾9oumightsuspAÇect,aëMSelU~ºandëMSelUUºareselectorsinthe¡ õºâspiritTofëMSelAº,discussedinsection3.3. pSeman¾9ticsare:¦ç¤ëMSelU s,n¹(Up1,Â[x1...xn...xk])=xn¡ç¤SelUU¹n(UpUp2[x1...xn...xk])=xn¦ õºâºBut åthereisav¾9erystrongsemanticconstrainthere:+itis¡ õºâillegalÂ'toapplyëMSelUºorëMSelUUºtoavÿ|ralueunlessthatvalueis¡ õºâpro¾9vÿ|rablyEequivalentEtoanëMUp1¹[...]ºorëMUpUp2[...]ºvÿ|ralue¡ õºârespAÇectiv¾9elyÿ:«.¦ùThisCmeans,O
forsomearbitrarycontextëMcº,O
the¡ õºâfollo¾9wingTexpressionsarelikelytobAÇeill-formed:¦ç¤ëMSelU s,n¹c¡ç¤SelUU¹nc¦ õºâºThe×>oneandonlyw¾9ay×>tomak¾9ethemwell-formedistowrap¡ õºâtherappropriatespAÇeciesofëMCaseºtermaroundthem,Élea¾9ving¡ õºâtheTëMSelºinthegreatest-vÿ|raluearm:¦ç¤ëMCaseU s,c¹(...whatever...)(SelUnc)¡¡ç¤CaseUU¹c(...whatever...)(...whatever...)¡~Àà(SelUU¹nc)¦ õºâºInìbAÇothcases,RthetermëM(Sel¹nc)ìºma¾9ynotappearinan¾9y¡ õºâplaceÔømark¾9ed\ëM...whatever...º".[]NotethattheëMSelºterm¡ õºâma¾9y2appAÇearanywherewithinthegreatest-vÿ|raluearm,yçand¡ õºâis|notrestrictedtothetoplev¾9el,³asthisexampleseemsto¡ õºâsuggest.þ' õºâ¹3.5 G·Constructo¹rLÎfunctionsandcasestatementsm õºâºThesource-languagetrappingsofstructuredt¾9ypAÇesgiverise¡ õºâtoNôsomeofthemorein¾9terestingpartsoftheabstractinter-¡ õºâpreter,NOandBêw¾9arrantasectiontothemselves.¥1First,NOthough,¡ õºâsomeTterminologyÿ:«. pAstructuredt¾9ypAÇeisde nedlikethis:¦ç¤ëMdata¹typeNamev1...vk=C1t11...t1m¡uM´|î...¡uM´|¹Cnt1n...tnm åäº10
ºâ ý? £ ý íºâºThisde nesat¾9ypAÇecalledëMtypeNameº,¿©paramterisedbytypAÇe¤
íºâvÿ|rariablesÎ@ëMv1ºtoëMvkº,ÜxwithconstructorsëMC1ºtoëMCnº.¿Thet¾9ypAÇeex-¡íºâpressions÷ýëMt11ºtoëMtnmº,ýÛwhic¾9hformtheargumentstothecon-¡íºâstructors,ñ areÅhea¾9vilyconstrainedinthemannerdiscussed¡íºâin
1section2.2.6:*theyma¾9yonlybAÇeeitheroneofthetypAÇe¡íºâvÿ|rariables,i
ëMv1¹...vkº,orXLadirectrecursiv¾9ecalltothetypAÇe:¡íºâëM(typeName¹v1...vk)º.
íºâBecause ofthisconstrain¾9t,¹each constructorargumen¾9tina¡íºâvÿ|ralid&ìde nitioncanbAÇeclassi edeitherasarecursiv¾9ecallëMRecº,¡íºâorYasoneofthet¾9ypAÇevÿ|rariables,jëMVar¹nºwhereëMnºisanumbAÇer¡íºâdenotingTwhic¾9hvÿ|rariable. pFÿ:«orexample,thede nition©ÐOûç¤ëMdata¹AVLTreeiab¡
f=¹ALeaf¡
f|¹ANodei(AVLTreeiab)ab(AVLTreeiab)¦íºâºcan,Tinprinciple,bAÇerewrittenas¦ûç¤ëMdata¹AVLTree(of3typevariables)¡
f=¹ALeaf¡
f|¹ANode(Var1)Rec(Var2)(Var3)Rec¦íºâºWÿ:«e)
no¾9wde netwostrangefunctions,-øëMargkindºandëMupdateº,¡íºâtoÓassistinthediscussionbAÇelo¾9w. W Neitheraremeantto¡íºâbAÇe¿ implemen¾9table.Rather,éxtheyserveasconvenientnota-¡íºâtionalêRdevices, andarebAÇestillustratedb¾9yexample.jThey¡íºâare§ÍbAÇothmeaninglessunlesstheparticularconstructorap-¡íºâplicationTtheyareassoAÇciatedwithisstated.
íºâëMargkind
ºtellsuswhatpartofadatat¾9ypAÇeagivenconstruc-¡íºâtor×ìargumen¾9tcorrespAÇondsto:ý¼eitheracertaintypAÇevÿ|rariable,¡íºâorý3arecursiv¾9einstanceofthetypAÇe.eFÿ:«orexample,bearingin¡íºâmind~ thedeclarationabAÇo¾9ve,Pgiven~ theconstructorapplica-¡íºâtionTëM(ANode¹ilabr)º:¦ûç¤ëMargkind¹i=Var1¡ûç¤argkind¹l=Rec¡ûç¤argkind¹a=Var2¡ûç¤argkind¹b=Var3¡ûç¤argkind¹r=Rec¦íºâupdateG ºreplacesaparticularvÿ|ralueinasuppliedlistwith¡íºâanothervÿ|ralue.It ndsoutwhic¾9hloAÇcationtoupdateb¾9y¡íºâusing wëMargkindº,J@expAÇectinganansw¾9eroftheformëM(Var¹i)º,¡íºâwhereupAÇonBëMiºisusedasthelocation.¤ Itisin¾9vÿ|ralidtouse¡íºâëMupdateëºinaw¾9ayëwhichwouldcausethecalltoargkind¡íºâtoÖ_returnëMRecº. _Again,F¡usingtheconstructorapplication¡íºâëM(ANode¹ilabr)º:¦ûç¤ëMupdate¹i"my",Â["the","cat","sat"]¡
f=¹["my", s,"cat","sat"]¡¡ûç¤update¹a"dog" s,["the","cat","sat"]¡
f=¹["the","dog","sat"]¡¡ûç¤update¹b"ran" s,["the","cat","sat"]¡ZÐ=¹["the","cat","ran"]¦íºâºBut¦ûç¤ëMupdate¹lxxs¡ûç¤update¹rxxs¦íºâºareTbAÇothillegalsinceëMargkind¹lº=ëMargkindrº=ëMRecº. ý õºâThe$ÊexampleusedëMupdateºtoreplacew¾9ordsinalistthereofto¤
õºâemphasiseC6ëMupdateº'spAÇolymorphicnature.¦NotethatëMupdate¡ õºâºisÏalw¾9aysusedwithaconstructorwrappAÇedroundthe nal¡ õºâlistö¸argumen¾9t.<Thisconstructorisre-attachedtotheresult:©¹ç¤ëMupdate¹i"my"¡(SomeConstructor¹["the","cat","sat"])¡f=¹(SomeConstructor["my", s,"cat","sat"])¦ õºâºFÿ:«or`
thesak¾9eofclarityÿ:«,r¸thisinconsequentialdetailishence-¡ õºâforthTignored.
õºâRecallwªfromsection2.2.5thatfunctionëMDwOºreturnsthedo-¡ õºâmainÌ.assoAÇciatedwithaparticulart¾9ype.@ýFÿ:«ourmorehandy¡ õºâfunctionswcofsimilarilkareëMtopº,çëMbotº,ëMtopfvwcºandëMwhnfº.BThe¡ õºâ rst´t¾9wosimplygeneratethegreatestandleastcontextsina¡ õºâparticular5©domain.ÑâëMtopfv(D)5pºgeneratesthegreatestabstract¡ õºâvÿ|ralueTindomainëMDº.¦ç¤ëMtop¹(Lift s,(D1x...xDn))¡f=¹Up1,Â[top(D1)...top(Dn)]¡ç¤top¹(Lift2(D1x...xDn))¡f=¹UpUp2[top(D1)...top(Dn)]¡ç¤top¹(Ds->Dt)¡f=¹(\c->top(Ds))¡¡ç¤bot¹(Lift s,(D1x...xDn))¡f=¹Stop1¡ç¤bot¹(Lift2(D1x...xDn))¡f=¹Stop2¡ç¤bot¹(Ds->Dt)¡f=¹(\c->bot(Ds))¡¡ç¤topfv¹(Lift s,(D1x...xDn))¡f=¹ANonRec[topfv(D1)...topfv(Dn)]¡ç¤topfv¹(Lift2(D1x...xDn))¡f=¹ARecæX[topfv(D1)...topfv(Dn)]¡ç¤topfv¹(Ds->Dt)¡f=¹Fval(\c->top(Ds))¡3'(\a¹->topfv(Dt))¦ õºâwhnf(D)
ºis£thew¾9eakheadnormalformevÿ|raluatorfordomain¡ õºâëMDº.TThisonlymak¾9essenseforcertainvÿ|raluesofëMDº:¦ç¤ëMwhnf¹(Lift s,(D1x...xDn))¡f=,ÂUp1¹[bot(D1)...bot(Dn)]¡ç¤whnf¹(Lift2(D1x...xDn))¡f=¹UpUp2[bot(D1)...bot(Dn)]¦ õºâºFinallyÿ:«,Tfortherecord,aCoreëMcaseºexpressionloAÇokslik¾9e¦ç¤ëMcase¹switchExpressionof¡fC1¹p11...p1m->rhs1¡3'...¡fCn¹p1n...pnm->rhsn¦ õºâºwhereX%itisassumedthatallconstructorsarepresen¾9t.ääThis¡ õºâisTassuredb¾9ythepattern-matchingphaseofthedesugarer.
õºâTheí fourfollo¾9wingsectionsdoAÇcumentthe
owofabstract¡ õºâvÿ|ralues^andcon¾9textsthroughconstructorapplicationsand¡ õºâëMcase¤'ºexpressions.ö¶Insomew¾9ays,ºÊthe¤'twoareoppAÇosites:ãÚcon-¡ õºâstructorkapplicationsbuildstructures,O1whilstëMcaseºexpres-¡ õºâsionsMdisassem¾9blethem.~ZAninterestingdualityarisesfrom¡ õºâthis.ÌThe
o¾9wofabstractvÿ|raluesthoughcaseexpressions¡ õºâis uncannilysimilartothe
o¾9wofcontextsvÿ|raluesthrough¡ õºâconstructors,Tandvicev¾9ersa. åä11 & ºâ ý? £ ý íºâ¹3.5.1 úíConstructo¹rLÎfunctions:fhabstractvaluepropagationmíºâºHo¾9w 1doabstractvÿ|ralues
owthroughaconstructor?4The¤
íºâdiscussion§Éofsection3.3impliedthatthetheëM(:)ºfunction¡íºâm¾9ustTbAÇehavesomethinglike:¤ehûç¤ëM(:)¹=\xxs->AMeet[xs,ARec[x]]¡íºâºObserv¾9e¦thattheapparentlypAÇolymorphicnatureofthisdef-¤
íºâinition©isinciden¾9tal.ï7Ingeneral,¨Ìgivenanarity-nconstructor¡íºâëMCöºandùargumen¾9tsëMa1¹...anùºwhereëM(C¹a1...an)::tauº,¡íºâtheTforw¾9ardbAÇehaviourofCis:©ehûç¤ëM\a1¹...an->AMeet[e1...en]¡¡ûç¤ei¹=ai¡if¹argkindai=Rec¡¡
f=¹ARec(updateaiaitopfv(D(tau)))¡if,Âargkind¹ai==Varx¡and s,C¹isfromarecursivetype¡¡
f=¹ANonRec(updateaiaitopfv(D(tau)))¡if,Âargkind¹ai==Varx¡and s,C¹isfromanon-recursivetype¦íºâºNullaryfconstructorssimplyacquirethetopabstractvÿ|ralue¡íºâof¸therelevÿ|ran¾9tdomain(bAÇearinmindthat,Ëforadomainnot¡íºâcon¾9tainingófunctionspaces,³thisisthesameasthebAÇottom¡íºâpAÇoin¾9t). pTheTëM[]ºcaseforëM[Int]º,forexample,is:¦ûç¤ëM[]¹=topfv(D([Int]))¡
f=¹topfv(Lift2(Lift()))¡
f=¹ARec[ANonRec[]]¦íºâºTheÃ3motiv¾9einallthisistoensurethattheabstractvÿ|ralueof¡íºâaconstructorapplicationisc¾9haracterised,µforeachparame-¡íºâterisingTt¾9ypAÇe,bytheleastvÿ|ralueofthattypAÇe.
íºâAsK[anexample,×consideranob ject¡íºâofþt¾9ypAÇeëM(AVLTree¹IntIntInt)º.oContextsþforthattypAÇe¡íºâare®ædra¾9wnfromthedomainëMLift2¹(Lift()xLift()x¡íºâLift¹())º.
#ÀWÿ:«eÄexpAÇecttheabstractvÿ|raluereturnedb¾9y¡íºâbAÇothþ¾theëMALeafºandëMANodeºconstructorstobeoftheform¡íºâëMARec¹[ii,aa,bb]ͺwhereëMiiºrepresen¾9tstheleastabstract¡íºâvÿ|ralueQofan¾9yob jectcorrespAÇondingtotypAÇevÿ|rariableëMiºinthe¡íºât¾9ypAÇeTAde nition,cüandsimilarlyforëMaaºandëMbbº.Ù7So,atthisin-¡íºâstan¾9tiation, Wtheabstractvÿ|raluebAÇehaviouroftheconstructors¡íºâis:©J®ûç¤ëMALeaf¹=ARec[ANonRec[],ANonRec[],ANonRec[]]¡¡ûç¤ANode¡ûç¤=¹\ilabr->¡ZÐAMeet¡ZÐ[¹ARec[i,/?ÜANonRec[],ANonRec[]],¡Íül,¡ÍüARec¹[ANonRec[],a,/?ÜANonRec[]],¡ÍüARec¹[ANonRec[],ANonRec[],b*F],¡Íür¡ZÐ]¦íºâºNon-recursiv¾9e`~typAÇesaredealtwithinanexactlyanalogous¡íºâmanner.ÒJFÿ:«or6âexample,c`thebAÇeha¾9viourofthepairingconstruc-¡íºâtorTatt¾9ypAÇeëMInt¹->Int->(Int,Int)Tºis ý ç¤ëM(,)¤
ç¤=¹\xy->¡
ZÐAMeet¡
ZÐ[¹ANonRec[x,/?ÜANonRec[]],¡ÍüANonRec¹[ANonRec[],y*F]¡
ZÐ]© q õºâºIf_¨y¾9ourinstinctstellyouthisismuchadoabAÇoutnothing,þyou¡ õºâare;!correct.ØSincealltheseexamplesbuildstructureswith-¡ õºâout¦ïem¾9bAÇeddedfunctionspaces,½theresultvÿ|raluesareunitaryÿ:«,¡ õºâandTma¾9ybAÇewritten:¦ç¤ëM[] s,=/?ÜARec¹[ANonRec[]]¡ç¤(:)¹=\xxs->ARec[ANonRec[]]¡¡ç¤(,)¹=\xy->ANonRec[ANonRec[],ANonRec[]]¡¡ç¤ALeaf¹=ARec[ANonRec[],ANonRec[],ANonRec[]]¡ç¤ANode¹=\ilabr->¡)´TARec¹[ANonRec[],ANonRec[],ANonRec[]]? õºâ¹3.5.2úíConstructo¹rLÎfunctions:fhcontextpropagationm õºâºTheQnameofthegamehereistosa¾9ywhatcontextpropagates¡ õºâfromManon-n¾9ullaryconstructortoitsarguments.fZIntuiting¡ õºâ rstTonëM[Int]º,ëM(:)ºexhibitsthefollo¾9wingbAÇehaviour:¦ õºâëMDemand¹on(x:xs) YDemandonxDemandonxs¡ õºâ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~¡ ÿ.UU[U[]]FßÊU[]B&4UU[U[]]¡ ÿ.UU[_]PRö_K`UU[_]¡ ÿ.U_^¸_K`_¡ ÿ._c9N_K`_¦ õºâºA÷½ëMUU[U[]]÷źcon¾9textcausesevÿ|raluationoftheentirestructure¡ õºâof,pthelist,27andalltheëMIntºsinittoAÇo.aÅSow¾9emaypropagate¡ õºâëMU[]!ºtoëMxºandëMUU[U[]]ºtothetailofthelist.¤ÖThesame¡ õºâreasoning9explainsthepropagationofaëMUU[_]ºcon¾9text.Ó3Now,¡ õºâwhat`iofëMU_º?à"Thisevÿ|raluatorsimplyevaluatestoWHNF,that¡ õºâis,the, rstýØconstructor,andgiv¾9esup.Sozerocontextmay¡ õºâbAÇeÈýpropagatedtoeitherheadortail.þSimilarlyÿ:«,ØBzerocon¾9text¡ õºâpropagatesTfromzerocon¾9textonëM(x:xs)º.
õºâIs;thereapatternhere? Thecon¾9textonëMxsºisthatsameas¡ õºâtheÜMcon¾9textonëM(x:xs)ºexceptattheWHNFÜpAÇoint,
whilst¡ õºâthe#'con¾9textonëMxºis\ëMyº"intheëMUU[y]ºcases,&andnoneother-¡ õºâwise.áÊThis¬rlatteropAÇerationcouldberegardedasdropping¡ õºâther double-lifting,É*andselectingthe rstproAÇductcompo-¡ õºânen¾9t.Wÿ:«ritingÍÁthecontextonëM(x:xs)ºasëMalphaº,ÜcontextonëMx¡ õºâºandTëMxsºrespAÇectiv¾9elycouldbewrittenas:¦ç¤ëMDropUU¹1alpha¡ç¤ZapWHNF¹alpha¦ õºâºImplemen¾9tingºZëMDropUU¹íºandëMZapWHNFºdirectlycausesma jor¡ õºâproblems³intheterm-rewritingsystem.»Fÿ:«ortunately,Jthe¡ õºâëMCaseUUTºandëMSelUUºprimitiv¾9escanbAÇeusedinstead:¦ útxëMDropUU¹nalpha=CaseUUalpha__(SelUUnalpha)¡ útxZapWHNF¹alpha s,=CaseUUalpha__alpha¦ õºâºAnalogisingtheinformalargumen¾9tleadstoageneralrule.¡ õºâGiv¾9en@anarity-ëMnºconstructorëMC?´ºandargumentsëMa1¹...an¡ õºâºwhereS$ëM(C¹a1...an)::tauº,¢con¾9textëMalphaºonthecon-¡ õºâstructorTapplicationproAÇducescon¾9textonëMaiºasfollows: åä12
=ý ºâ ý? £ ý ûç¤ëMai s,=¹ZapWHNFalpha¤
A(if,Âargkind¹ai==Rec¡¡Íü=¹DropUUxalpha¡A(if,Âargkind¹ai==Varx¡A(and s,C¹isfromarecursivetype¡¡Íü=¹DropUxalpha¡A(if,Âargkind¹ai==Varx¡A(and s,C¹isfromanon-recursivetype¹'íºâºThe}iëMAVLTreeºexampleatinstanceëM(AVLTree¹IntIntInt)¡íºâºbAÇeha¾9vesLqasfollo¾9wsforacontextëMalphaºappliedto¡íºâëM(ANode¹ilabr)º:©s]ûç¤ëMVariable!Demand¡ûç¤~~~~~~~~~~~~~~~~~~~~~~~~~~~~~¡ûç¤iB&4DropUU¹1alpha¡ûç¤lB&4ZapWHNF s,alpha¡ûç¤aB&4DropUU¹2alpha¡ûç¤bB&4DropUU¹3alpha¡ûç¤rB&4ZapWHNF s,alpha¦íºâºCon¾9text9%propagationfornon-recursivetypAÇesbeha¾9ves9%ina¡íºâsimilarN¬manner,]exceptthatitisnolongerpAÇossibletogen-¡íºâerate)]ëMZapWHNFº,andthedrop-selectopAÇeratoronlydropsone¡íºâpAÇoin¾9t,ö%insteadîYoftwo.rThisopAÇerator,ö%calledëMDropUº,isimple-¡íºâmen¾9tedTas¤¹'ûç¤ëMDropU¹nalpha s,=CaseUalpha_(SelUnalpha)¡íºâºFÿ:«orÿ7acon¾9textëMalphaºappliedtoëM(x,¹y)::(Int,Int)º,£the¤
íºâcon¾9textsÒËpropagatedtoëMxºandëMyºareëM(DropU¹1alpha)Ò˺and¡íºâëM(DropU¹2alpha)TºrespAÇectiv¾9elyÿ:«.
íºâTÿ:«ranslationgvofëMDropUº,ëMDropUUgJºandëMZapWHNFºin¾9totheëMCaseºand¡íºâëMSel
ݺprimitiv¾9esrequiressomepassingaroundofdomains,[so¡íºâthat¥theappropriatekindofbAÇottomvÿ|raluescanbeman¾9ufac-¡íºâtured.ÿíºâ¹3.5.3 úíCaseLÎexp¹ressions:fhabstractvaluepropagationmíºâºTheæQtaskhereisto gureoutwhatabstractvÿ|raluestoat-¡íºâtac¾9hôÚtoconstructorvÿ|rariablesinacaseexpression,ûYgiventhe¡íºâabstractTUvÿ|ralueoftheswitc¾9hexpression.ÙrThesolutionisre-¡íºâmarkÿ|rably`äsimilartopropagationofcon¾9textstoconstructor¡íºâargumen¾9ts,^3andO followsathemewhichshouldbAÇebecoming¡íºâfamiliar. pGiv¾9enTacaseexpression©¹'ûç¤ëMcase¹swof¡
f...¡
fC¹a1...an->rhs¡
f...¦íºâºandL¹anabstractvÿ|ralueassoAÇciatedwithëMswºofëMfswº,tØtheabstract¡íºâvÿ|ralueTassoAÇciatedwithëMaiºis¦ûç¤ëMai s,=¹fsw¡A(if,Âargkind¹ai==Rec¡¡Íü=¹SelAxfsw¡A(if,Âargkind¹ai==Varx¦íºâºLetwØtheabstractvÿ|ralueoftheswitc¾9hexpressionbAÇedenoted¡íºâëMfswº. pFÿ:«orTëM[Int]ºw¾9ehave: ý ç¤ëMcase¹swof¤
f[]î-> s,rhs1¡f(x:xs)¹-> s,rhs2¤ õºâºgivingTbindingsof¡ç¤ëMx s,--->SelA¹1fsw©
ç¤xs¹---> s,fsw¡ õºâ(AVLTree¹IntIntInt)Tºgiv¾9es:¡ç¤ëMcase¹swof¦fALeaf8³->¹rhs1¦fANode¹ilabr s,->rhs2¦¦ç¤i s,--->SelA¹1fsw¦ç¤l s,--->fsw¦ç¤a s,--->SelA¹2fsw¦ç¤b s,--->SelA¹3fsw¦ç¤r s,--->fsw¡ õºâºFinallyÿ:«,TëM(Int,¹Int)ºgiv¾9es:¡ç¤ëMcase¹swof¦f(x,¹y) s,->rhs1¦¦ç¤x s,--->SelA¹1fsw¦ç¤y s,--->SelA¹2fsw¤ô õºâ¹3.5.4úíCaseLÎexp¹ressions:fhcontextpropagationm õºâºThisÑösectionestablishesho¾9wcontextonaëMcaseºexpression¦ õºâpropagatesktocon¾9textontheswitchexpression. ¦First,Àa¦ õºâsubsidiaryTresult.¡ õºâ¹F¹orwardsLÎpropagationofcontextsthoughconstructorsm õºâºGiv¾9en5%aconstructorapplicationëM(C¹a1...an)::tauº,aüthe¦ õºâmethoAÇdGofsection3.5.2cantellusho¾9wcontextonthisap-¦ õºâplicationC¸mapstocon¾9textonëMa1¹...anº.§However,OQweC¸now¦ õºâneedHgtoruntheproAÇcessinrev¾9erse.µªGivenHgsomecon¾9texts¦ õºâëMc1¹...cnLºonëMa1¹...anº,´w¾9eLwantto ndthegreatestcon-¦ õºâtextõÈëMalphaºthatma¾9ybAÇeputontheapplication,üconstrained¦ õºâso thatthecon¾9textsthatsection3.5.2indicateswouldthen¦ õºâpropagateºtoëMa1¹...anººarelessthanorequalëMc1¹...cn¦ õºâºrespAÇectiv¾9elyÿ:«.
õºâTheñ§follo¾9wingschemeiso ered,øÉagainwithoutjusti cation.¦ õºâIfTëMCºisfromarecursiv¾9etypAÇe:¤ç¤ëMalpha¹=CJoin[Up2,CMeet[e1...en]]¦¦ç¤ei¹=ai¦if,Âargkind¹ai==Rec¦¦f=¹updateaiaitop(D(tau))¦if,Âargkind¹ai==Varx¡ õºâºIfpëMCPºisfromanon-recursiv¾9etypAÇe,¯6ëM(argkind¹ai)ºcannotbe¦ õºâëMRecº,Tsothissimpli esto:¡ç¤ëMalpha¹=CMeet[e1...en]¦¦ç¤ei¹=updateaiaitop(D(tau))¦if,Âargkind¹ai==Varx åäº13 U ºâ ý? £ ý íºâºFinallyÿ:«,Tforn¾9ullaryconstructors,likeëM[]º:¤kûç¤ëMalpha¹=ctop(D(tau))¡íºâºExamples: pgiv¾9enTëM(a1,¹a2)::(Int,Int)º,w¾9eget¡ûç¤ëMalpha¹=CMeet[Up1[c1,æXU[]],©
GUp1¹[U[],,Âc2]]¡íºâ(a1:a2)¹::[Int]Tºgiv¾9es¡ûç¤ëMalpha¹=CJoin[Up2,¦GCMeet¹[UpUp2[c1],¦mM´c2¹]¦>
Ø]¡íºâ[]¹::[Int]Tºgiv¾9es¡ûç¤ëMalpha¹=UpUp2[Up1[]]¡íºâ(ANode¹a1a2a3a4a5)::(ATreeIntIntInt)Tºgiv¾9es¡ûç¤ëMalpha¹=CJoin¦!´T[¹Up2,¦+'CMeet¹[UpUp2[c1,æXU[],,ÂU[]],¦Pô0c2,¦Pô0UpUp2¹[U[],,Âc3,æXU[]],¦Pô0UpUp2¹[U[],,ÂU[],c4 s,],¦Pô0c5¹]¦!´T]ëíºâ¹UsingLÎthelemmamíºâºAnd»ino¾9wtoreturntothemaintheme.¯AtthispAÇoint,äîit's¦íºânecessary{¸toin¾9troAÇduceafunctionwewillseealotmoreof¦íºâlater.ßThe¾yfunctionëMC¾Mºtellsusho¾9wmuchcontextispropa-¦íºâgateds]toavÿ|rariableëMxºwhencon¾9textëMalphaºispropagatedto¦íºâsome>ÓarbitraryexpressionëMeº.îOfcourse,I3ifëMxºdoAÇesnotoccur¦íºâfreeTinëMeº,theansw¾9erisnone. pWÿ:«ewritethisas¡ûç¤ëMC¹x[e]rhoalpha¡íºâºwith¿theëMeºinsquarebrac¾9kets¿toemphasisethatëMC¿bºregards¦íºâitm¦asasyn¾9tacticob ject.%fAsbAÇecomesapparentlater,»ëMCmºalso¦íºârequiresanen¾9vironmentëMrhoºwhic¾9hsuppliesabstractvÿ|ralues¦íºâforTallfreevÿ|rariablesinëMeº.
íºâRecallTthataëMcaseºexpressionloAÇokslik¾9ethis:¡ûç¤ëMcase¹swof¦
fC1¹p11...p1m->rhs1¦
f...¦
fCn¹p1n...pnm->rhsn¡íºâºNo¾9w,SgivenïcontextëMalphaºoverall,Swhatisthecontexton¦íºâëMswº?`aTheÖ¤ rststepisto ndthecon¾9textonëMp11¹...pnmº.¦íºâTheseTcon¾9textaregivenby:¡ûç¤ëM(C¹p11[rhs1]rho1alpha),Â...¦ûç¤(C¹p1m[rhs1]rho1alpha)¦¦ûç¤...¦¦ûç¤(C¹p1n[rhsn]rhonalpha),Â...¦ûç¤(C¹pnm[rhsn]rhonalpha) ý õºâºFÿ:«orD=eac¾9hparticularconstructor,Oötheoriginalenviron-¤
õºâmen¾9tÑõëMrhoºisaugmentedwithabstractvÿ|raluebindingsfor¡ õºâthe0vÿ|rariablesassoAÇciatedwiththatconstructor,vÌgenerating¡ õºâëMrho1¹...rhonº.Theseëvÿ|raluesarederiv¾9edfromtheabstract¡ õºâvÿ|ralueåoftheswitc¾9hexpression,ïasdescribAÇedinsection3.5.3.©
õºâTheôHnextstepisto gureoutwhatcon¾9textcanbAÇesafely¡ õºâappliedwËtoeac¾9hconstructor,hknowingthecontextsontheir¡ õºâindividual.4argumen¾9ts.gThemethoAÇddescribedinthelemma¡ õºâis}Ùapplied,×úonceforeac¾9hconstructor,tothecon¾9textsfor¡ õºâëMp11¹...pnm®ºjustcomputed,TJgivingëMalpha1¹...alphanº.¡ õºâThese<mvÿ|raluesarecom¾9binedtogivetheoverallcontexton¡ õºâëMswTºas:¤ÐOç¤ëMCMeet¹[alpha1...alphan]¡ õºâºUsing6uëMCMeetºtomergethesevÿ|raluesre
ectsthefactthatw¾9e¤
õºâcannotØkno¾9wwhichalternativewillbAÇeselectedatcompile¡ õºâtime.ÿThe½bAÇestsafevÿ|raluewhic¾9hcanbeobtainedistheleast¡ õºâofTan¾9yofalternatives.¦ õºâUnfortunatelyÿ:«,*¹thereó?isonespAÇecialcasewherethisform¾9u-¡ õºâlation¤"iswrong.ÈÙWhentheswitc¾9hexpressionisofare-¡ õºâcursiv¾9eètypAÇe,élikeëM[Int]º,éone ndsthatpropagatingzero¡ õºâcon¾9text¼®ontotheëMcaseºexpressionproAÇducesnon-zerocontext¡ õºâonx!theswitc¾9hexpression.D×ThisunsaferesultcanbAÇetraced¡ õºâtoá7thecaseforrecursiv¾9etypAÇesbeingoftheformëMalphaº=¡ õºâëMCJoin¹[Up2,...]º,swhic¾9h
ûimpAÇosesaminimumvÿ|ralueofëMUp2¡ õºâºon²ºthecon¾9textcontributedbyeachconstructor.ô¡Simply¡ õºâthro¾9wingo½awaytheëMUp2ºclampingbitcausesmoreproblems¡ õºâthan@¨itsolv¾9es.kA@bAÇettersolutionistoexplicitlyimposethe¡ õºârequiredæ¯conditionthatzeroo¾9verallæ¯contextproAÇduceszero¡ õºâcon¾9textì7ontheswitchexpression.¡RecallingthatëMalphaºis¡ õºâtheTo¾9verallcontext,thisisdonebywriting¤ÐOç¤ëMCaseU¹alpha_(CMeet[alpha1...alphan])¡ õºâºor¡ç¤ëMCaseUU¹alpha_(CMeet[alpha1...alphan])©
JÇn(CMeet¹[alpha1...alphan])¡ õºâºdepAÇendingCÝonthedomainofëMalphaº.ÖThepossibleduplication¦ õºâof theëM(CMeet¹[alpha1...alphan]) ºtermisregrettable,¦ õºâand@EcouldpAÇoten¾9tiallycausema jorperformanceproblems.¦ õºâSectionT6.1sho¾9wshowthesemaybAÇeavoided.
õºâThe®øcomplicationsinthisbusinessseemendless.é\Wÿ:«eha¾9ve¦ õºâjustTcreatedy¾9etanotherproblem. pConsider:¡ç¤ëMlet s,id¹y=yin¦case¹eof¦)´T[] Y->¹id¦)´T(x:xs) s,->¹id¡ õºâºThismíëMcaseºexpressionreturnsafunction,whic¾9hispAÇerfectly¦ õºâlegitimate.ý:Butµtheo¾9verallµcontextonit,ݨëMalphaº,willbAÇea¦ õºâfunction Êcon¾9text,Iganditisquitemeaninglesstoscrutinise¦ õºâsuc¾9h avÿ|raluewithëMCaseU ºorëMCaseUUº.Alittlethough¾9treveals¦ õºâayDsimplesolution.H?TheëMcaseºexpressionreturnsafunction,¦ õºâwhic¾9h^Cwill,áeventuallyÿ:«,bAÇe^Cappliedtosomething.ßjWhatreally¦ õºâmattersJisthecon¾9textonthe nalresultofthatapplication:¦ õºâifínon-zero,MÏitmeanstheëMcaseºexpressionwillev¾9entuallyíhave¦ õºâtoú5bAÇeen¾9tered,ÿ¢inordertogenerateafunctionwhichinturn¦ õºâgeneratesýsomeresulttosatisfythedemand.ð¨So,¬Ballw¾9eneed¦ õºâdo,Ùªif²fëMalphaºisafunctioncon¾9text,istestthe nalcon¾9text åä14 hp ºâ ý? £ ý íºâºencapsulatedYinëMalphaº,¡YratherthanëMalphaºitself.ì Gettingthe¤
íºâ nalx\con¾9textoutofanëMnº-arityfunctioncontextiseasilydone¡íºâb¾9yÌ
wrappingëMnFncCÌVºselectorsroundit.BSocontextonthe¡íºâswitc¾9hTexpression,intermsofëMalphaº,nowloAÇokslike:©«ûç¤ëMCaseUU¹(FncC(FncC.....(FncCalpha).....))¡ ú¾_¡ ú¾(CMeet¹[alpha1...alphan])¡ ú¾(CMeet¹[alpha1...alphan])¦íºâºTheÁ²n¾9umbAÇerofëMFncCºsisequaltothearityofëMalphaº,ÒlifëMalpha¡íºâºhappAÇens+tobeafunctioncon¾9text._!ëMcaseºexpressionsreturn-¡íºâing=åfunctionsseemtobAÇerarities,hüsousuallytherewillbezero¡íºâëMFncCºs.ü The´ZcorrespAÇondingmodi cationoftheëMCaseU´Aºv¾9ersion¡íºâisLob¾9vious,®èanditonlyremainstosaythatchoAÇosingbet¾9ween¡íºâtheÐ.t¾9wonowdepAÇendsonthe nalcontextencapsulatedin¡íºâëMalphaTºwhenëMalphaºisafunctioncon¾9text.
íºâAsélourlongjourneythroughtheforestofsuppAÇortingma-¡íºâc¾9hineryò¢comestoaclose,ùsothe naldestinationdrawsinto¡íºâsigh¾9t:ítheKde nitionoftheabstractinterpreterpropAÇer.¿,Wÿ:«e¡íºâpauseÀGbutbrie
ytotak¾9erespiteinthefollowingexample,¡íºâthenTem¾9barkupAÇonthe nalstraight: psection3.6.¦ûç¤ëMcase¹vsof¡
f[] Y->¹0¡
f(x:xs) s,->¹x¦íºâºClearlyÿ:«,ÿkëMvs¹::[Int]ùðºandtheo¾9verallùðtypAÇeisëMIntº.OSoacon-¡íºâtext« ëMalphaºplacedontheresultm¾9ustbAÇeindomainëMLift¹()º,¡íºâwithDtheresultingcon¾9textonëMvsºinëMLift2¹(Lift())º.¨ÁSec-¡íºâtionÝï3.5.4indicatesthattheëM[]ºcasecon¾9tributescontext¡íºâëMUpUp2¹[Up1[]]º.ØNo¾9w,þNpropagatingøëMalphaºtotheëM(:)ºalter-¡íºânativ¾9e¯ÜputscontextëMalphaºonëMxºandëMStop2º(thatis,Ä'none)on¡íºâëMxsº.ÙCom¾9bining"thesetwo,³Õagainusingsection3.5.4,sho¾9ws¡íºâthatTthecon¾9textpropagatedbythisalternativeis:¦ZÐëMCJoin¹[Up2,CMeet[alpha,Stop2]]¡ûç¤=¹CJoin[Up2,Stop2]¡ûç¤=¹Up2¦íºâºThisTgiv¾9esoverallcontextonëMvsºas:¦ZÐëMCaseU¹alphaStop2¡>
Ø(CMeet¹[UpUp2[Up1[]],Up2])¡¡ûç¤=¹CaseUalphaStop2Up2¦íºâºThat'sþin¾9tuitivelycorrect:Ñwithnodemandontheresulting¡íºâëMIntº,RÐthere'sFno(ëMStop2º)demandontheincominglist.¯ÿOth-¡íºâerwise, Ûw¾9eè&mayevÿ|raluatethelisttoWHNFçð(ëMUp2º), Ûthatis,¡íºâtoúdthe rstconstructor.uItisapit¾9ythesedomainscan'ttell¡íºâusw?abAÇoutthehead-strictnesshere:àGgiv¾9ennon-zerodemand,¡íºâit's~Ýob¾9viouswecannotonlyevÿ|raluatetothe rstconstruc-¡íºâtor, Êbutû§canalsoevÿ|raluatethe rstelemen¾9tofthelistifitis¡íºânon-empt¾9yÿ:«..íºâ¹3.6G·De ningLÎtheabstractinterp¹retermíºâºSectionJ3.5.4in¾9troAÇducedthecontext- ndingfunctionëMCº.Wÿ:«e¡íºâno¾9waugmentthiswithëMZº,theabstractinterpreteritself.dPëMC¡íºâºtak¾9escJanyCoreexpression,æacontextonthatexpression,æand¡íºâavÿ|rariable,¤andreturnstheresultingcon¾9textonthevariable.¡íºâëMZø¯ºtak¾9esø·anyCoreexpression,þpandreturnstheabstractvÿ|ralue¡íºâofÇ thatexpression.XSincetheforw¾9ardandbackward
owsof¡íºâinformationÛÔarehea¾9vilyintertwined,
tëMCÛ¡ºandëMZºarem¾9utually¡íºârecursiv¾9e. pInTacalltoëMCºorëMZ ý ç¤C¹x[e]rhoalpha¤
ç¤Z,Â[e]¹rho©¦à õºâx³Uºisavÿ|rariable,ÚÔëMeºisaCoreexpression,ëMalphaºisacon¾9text,¡ õºâandëMrhoºisanen¾9vironmentbindingallfreevÿ|rariablesinëMeºto¡ õºâabstractÆâvÿ|ralues.1Asimplemen¾9ted,óEbAÇothfunctionscarryan¡ õºâextra.ßparameterusedtohelpgeneratenewvÿ|rariablenames.¡ õºâëMC Rºalso TcarriesthedomainofëMxºsoitcangeneratetheappro-¡ õºâpriatebAÇottomvÿ|raluewhenneeded.rôRecallalsothataCore¡ õºâexpression·isapair,Ééthe rstpartofwhic¾9histhetypAÇeofthe¡ õºâexpression,TandthesecondtheexpressionpropAÇer.- õºâ¹3.6.1úíDe nitionLÎofëMZm õºâºThe:»abstractvÿ|ralueofaliteralisavalueintheappropriate¡ õºâone-pAÇoin¾9tTdomain.¦ç¤ëMZ¹(tau,ALitn)rho s,=ANonRec[]¦ õºâºVÿ:«ariablesTha¾9vetheirvÿ|raluesloAÇokedup.¦ç¤ëMZ¹(tau,AVarv)rho s,=rhov¦ õºâºApplications÷arealittlemoretric¾9kyÿ:«.\YFirst,Útheabstract¡ õºâvÿ|ralueæôofthefunctioniscreated.PFÿ:«romthat,\theabstract-¡ õºâvÿ|ralue-mapô0isextractedusingëMFvalAº,,úÑandappliedtotheab-¡ õºâstractêvÿ|ralueoftheargumen¾9ttogivetheabstractvÿ|ralueof¡ õºâtheTresult.¦ç¤ëMZ¹(tau,AApfe)rho¡f=¹AbsAp(FvalA(Zfrho))(Zerho)¦ õºâºLam¾9bAÇdaüytermsarealotmoretrickyÿ:«.ÑÞLetëMaºandëMcºdenote¡ õºânewTvÿ|rariables.¦ç¤ëMZ¹(tau,ALam[x]e)rho¡f=¹Fval(CtxLamc(Cxerho_c(FncC(CtxVarc))))¡3'(AbsLam¹a(Zerho_a))¡where¡)´Trho_c¹=rho{x->FncA(CtxVarc)}¡)´Trho_a¹=rho{x->AbsVara}¦ õºâºAnëMFvalºisreturned.!Its rstcompAÇonen¾9tisamapfromthe¡ õºâfunctionªcon¾9textëMcºonëM(\x.e)ºtothecontextonparameter¡ õºâëMx.i>ºBearinmindthatëMcºwillgetbAÇoundtoatermofthe¡ õºâformeÉëM(Fnc¹aacc)º,yçwhereëMaaºistheabstractvÿ|raluesupplied¡ õºâfor ëMx,ºandëMccºisthecon¾9textonëMe.ºSothecontextonëMx¡ õºâºis¦foundb¾9y ndingëMCAºofëMxºinëMeº,ûúwithëMrhoºaugmentedby¡ õºâbindingïTëMxºtoëMaa,ºthatis,öîtoëMFncA¹(CtxVarc)º,andïTwiththe¡ õºâcon¾9text
zonthebAÇody
zofthefunction, ëMeº,equal
ztoëMccº, thatis,¡ õºâëMFncC¹(CtxVarc)º.©
õºâTheôJsecondëMFvalºcompAÇonen¾9tmapstheabstractvÿ|ralueëMaºofëMx¡ õºâºto½µtheabstractvÿ|ralueofëMe.ºThisiseasilydoneb¾9ycomputing¡ õºâëMZTºofëMeº,withëMrhoºmoAÇdi edtobindëMxºtoëMAbsVar¹aº.¦ õºâTheTëMACaseºcaseisquiteeasy:©¦àç¤ëMZ¹(tau,ACasesw[(cname1,(pars1,rhs1))...¡Xô0(cnamen,¹(parsn,rhsn))])¡frho¡f=¹AMeet[Zrhs1rho1...Zrhsnrhon]¦ õºâºThexaugmen¾9tedenvironmentsëMrhoi(1¹<=i<=n)xºareob-¡ õºâtained Rb¾9yextendingëMrhoºtoprovidebindingsforëMparsiºin åä15 ò ºâ ý? £ ý íºâºviewofthevÿ|ralueofëMZ¹swrhoº,êSusingthemethoAÇdofsec-¤
íºâtionT3.5.3.
íºâFinallyÿ:«,¾Pthe¨ëMAConstrºcase.ø.Althoughsections3.5.1and3.5.2¡íºâcompletelyr doAÇcumen¾9tabstractvÿ|ralueandcontext
ows¡íºâthroughÌconstructors,í*w¾9easyethavenowayofcreating¡íºâabstractbûvÿ|raluesforconstructors.fStartingfromageneral¡íºâconstructorTapplication¤\ûç¤ëMC¹e1...en¡íºâºw¾9eTdesiretobuild¡ûç¤ëMFval¹(\c1->f1(FncC^nc1))¤
(\a1¹->Fval(\c2->f2(FncC^(n-1)c2))¡(\a2¹->...¡9TB...¡9TB...¹->Fval(\cn->fn(FncC^1cn))¡rJ(\an¹->aresultant)...))©\íºâºwhere-ñëMFncC^i¹eºmeansëMFncC-êºappliedëMiºtimestoëMe.ºObserv¾9e¡íºâthatj¢eac¾9huseofëMFncCjºhereisoftheformëMFncC^i¹cjºwhere¡íºâëMi¹+j==n+1º,»Fandsoallthesetermssimplydenotethe¡íºâcon¾9text` ontheresultoftheconstructorapplication.üÇWhat¡íºâsectionP3.5.2pro¾9videsisawaytocomputetheëMnºcontext¡íºâmaps,ý÷ëMf1¹...fnº.±-Section>3.5.1generatesatermofthe¡íºâform¦ûç¤ëM\a1¹...\an->aresultant¦íºâºand+ÁbAÇet¾9weenthem,ñ\that'sallthat'sneeded.
_¸Asthis¡íºâisìÈratherconfusing,¢¤here'sacoupleofexamples. ¢ËFÿ:«or¡íºâëM(:)¹::Int->[Int]->[Int]:¦ûç¤Fval¹(\c1->DropUU1(FncC(FncCc1)))¡(\a1¹->Fval(\c2->ZapWHNF(FncCc2))¡Pô0(\a2¹->ARec[ANonRec[]]))¦íºâºFÿ:«orTëM(,)¹::Int->Int->(Int,Int)º:¦ûç¤ëMFval¹(\c1->DropU1(FncC(FncCc1)))¡(\a1¹->Fval(\c2->DropU2(FncCc2))¡Pô0(\a2¹->ANonRec[ANonRec[],¡ ¡G&ANonRec¹[]]))ìùíºâ¹3.6.2 úíDe nitionLÎofëMCmíºâºPropagationTofacon¾9textontoaconstanthasnoe ect:¦ûç¤ëMC¹x(tau,ALitn)rhoalpha¡
f=¹bot(domain-of-x)¦íºâºTheTvÿ|rariablecaseis:¦ûç¤ëMC¹x(tau,AVarv)rhoalpha¡
f=¹ifæXx==v¡then s,alpha¡else s,bot¹(domain-of-x)¦íºâºAsØbAÇefore,9theapplicationandlam¾9bdacasesareabitmind¡íºâbAÇending.¦ûç¤ëMC¹x(tau,ALam[y]e)rhoalpha¡
f=¹Cxerho2(FncCalpha)¡where¡!´Trho2¹=rho{y->FncAalpha} ý õºâºHere,9OëMalpha2 ºisafunctioncon¾9textbAÇeingappliedtoëM(\y.e).¤
õºâºAssuming@ßthatëMxºandëMyºarenotthesamevÿ|rariable(the¡ õºâlam¾9bAÇda-lifterÐassuresthis),ÿIcontextonëMxºinëM(\y.e)ºcanbAÇe¡ õºâfound Ïfromthecon¾9textonëMxºinëMeº.SinceëMalphaºisafunction¡ õºâcon¾9text,¢ëMFncA¹alphak,ºisanabstractvÿ|raluewhichëMyºisbAÇound¡ õºâto,TgeneratingëMrho2.FncC¹alphaºisthecon¾9textonëMeºitself.©ÐOç¤ëMC¹x(tau,AApfe)rhoalpha¡f=¹CJoin[Cxfalpha_frho,¡ATBC¹xealpha_erho]¡where¡)´Talpha_f¹=Fnc(Zerho)alpha¡)´Talpha_e¹=CtxAp(FvalC(Zfrho))alpha_f¦ õºâºTÿ:«o·Òdealwithapplications,Êobserv¾9ethatëMxºmayoAÇccurinboth¡ õºâtheª°functionandargumen¾9texpressions,Ðsoweneedtocol-¡ õºâlect¿upthecon¾9textsfromëMfºandëMeº,ÐUand\addthemtogether"¡ õºâusing©ëMCJoinº.ópTheonlyproblemis guringoutwhatcon-¡ õºâtextv®propagatestoëMfºandëMeº.@~Recallthatafunctioncon-¡ õºâtextúconsistsoftheabstractvÿ|ralueoftheargumen¾9t,ÿñandthe¡ õºâcon¾9textx1ontheresult.EHence,ÐèthecontextonëMfºmustbAÇe¡ õºâëMFnc¹(Zerho)alphaº. PThedôcon¾9textonëMeºisequaltothe¡ õºâcon¾9textlythatëMfºwouldpropagatetoitsargument,ÂBandwe¡ õºâkno¾9wÔthatthecontextonëMfºisëMalpha_f.ºSo,C4webuildthe¡ õºâabstractíin¾9terpretationforëMfºwithëMZ¹frhoº,õextractíthecon-¡ õºâtextìUmapusingëMFvalCº,andapplythattoëMalpha_fº.ÆAlltold,¡ õºâthat'sTëMCtx¹(FvalC(Zfrho))alpha_fº.
õºâDueëWtotheheroice ortsofsection3.5.4,ó½therathercompli-¡ õºâcatedTëMcaseºclauseisstatedquitesuccinctly:¦ç¤ëMC¹x(tau,ACasesw[(cname1,(pars1,rhs1))...¡bg\(cnamen,¹(parsn,rhsn))])¡Íürho¹alpha¡f=¹CJoin[Cxswrhoalpha_sw,¡ATBCMeet¹[Cxrhs1rho1alpha...¡g òC¹xrhsnrhonalpha¡]Æ]¡7á]¦ õºâºHere,Ý"ëMalpha_swµ,ºisthecon¾9textonëMsw,ºgivenëMalphaºcontext¡ õºâon¦ÅtheëMcaseºexpressionitself,¼âascomputedb¾9ythemethoAÇdof¡ õºâsectionT3.5.4.©
õºâAs¸
bAÇefore,ËtheëMrhoi(1¹<=i<=n)¸
ºareobtainedb¾9yextend-¡ õºâingëMrhoºtopro¾9videbindingsforëMparsiºinviewofthevÿ|ralue¡ õºâofTëMZ¹swrhoº,usingthemethoAÇdofsection3.5.3.¦ õºâVÿ:«ariable ëMxºcanappAÇearinboththeswitc¾9hexpression,J[and¡ õºâan¾9y&¯ofthealternatives.
PTÿ:«odealwiththeformer,«con-¡ õºâtext»onëMswºiscomputedaspAÇersection3.5.4,äandthiscon-¡ õºâtextb0propagatedin¾9toëMsw.ºContextforëMxºinalterativeëMiºis¡ õºâëMC¹xrhsirhoialphaº,Ìpbut§Ñsincew¾9ecan'tsaywhichalter-¡ õºâativ¾9e:willactuallybAÇeselected,ñwemusttakethegreatest¡ õºâlo¾9werè'bAÇoundo¾9verè'allalternativ¾9es.éFinallyÿ:«, Ûtheswitchand¡ õºâalterativ¾9eàcontextsareonceagain\added"usingëMCJoinº.IAs¡ õºâwith5theëMZ5ºclauseforëMcaseºrhoisextendedtopro¾9videbind-¡ õºâingsTforthevÿ|rariablesassoAÇciatedwitheac¾9hconstructor.¦ õºâFinallyÿ:«,DµtheëMAConstrºcase.ôAlltheactualw¾9orkofdealing¡ õºâwithÚÞcon¾9text
owthroughconstructorsisdoneinthecorre-¡ õºâspAÇonding?³ëMZ?¨ºclause.Allw¾9eneeddohereisobservethatëMxºis¡ õºânev¾9erTfreeinanyconstructor,andsoreturnzerocontext:ÐOç¤ëMC¹x(tau,AConstrc)rhoalpha¡f=¹bot(domain-of-x) åäº16 ºâ ý? £ ý íºâ¹4üTheLÎtermrewritingsystem´íºâ4.1G·IntroFfductionmíºâºFÿ:«or*eac¾9hCorefunction,o=theabstractinterpreterproAÇduces¤
íºâan¡EëMAbsValºterm.õÀRecursiv¾9egroupsoftermsrequire xpAÇoint-¡íºâing,-jwhic¾9h(isdoneinastraightforwardmanner.V>Theinitial¡íºâappro¾9ximationvÿforafunctionindomainëMDv¤ºisëMatop(D)º,so¡íºâthehé xpAÇoin¾9tingproducesthegreatest xpoin¾9t./Althoughit¡íºâmigh¾9tôÒseemalittleunusualtoseekthegreatest xedpAÇoint,¡íºâbAÇear»inmindthatthisapproac¾9hrepresentsstartingo from¡íºâa)ôdangerousvÿ|ralue,YëMatop(D))¸ºanditeratingone'sw¾9ay)ôtosafet¾9yÿ:«.¡íºâInÔôforw¾9ardanalysesinthestyleof[Sew91/],Ûdangerisrep-¡íºâresen¾9tedI:bytheleastpAÇointinthedomains,V3and xpAÇointing¡íºâyields³/theleast xedpAÇoin¾9t.öInanycase,Ú¦thisdiscussionis¡íºâratherW¨academic,h>sincew¾9ecanclaimtobAÇelookingforleast¡íºâ xpAÇoin¾9ts¯Uheretoosimplyb¾9yturningallthedomainsupside-¡íºâdo¾9wnpñ{astheyare nite,Ùcompletelattices,suc¾9hatrickis¡íºâquiteTallo¾9wable.©
íºâThe)termrewriterexistsbAÇecauseoftheneedtocompareap-¡íºâpro¾9ximationsXduring xpAÇointing.é}Fÿ:«ornon-recursiveterms,¡íºâthereºóis,ÍstrictlyspAÇeaking,noneedtousetherewriter.þPNev-¡íºâertheless,bAÇecause²Rwhatemergesfromtheabstractin¾9ter-¡íºâpreterfisusuallygrosslyredundan¾9t,ºÔalltermsaresub ject¡íºâtoJBrewriting,}andtherecursiv¾9eonesaresubsequently x-¡íºâpAÇoin¾9ted.¦íºâWhat therewriterdoAÇesistotransformeac¾9hpossibleterm¡íºâin¾9toÂ}anormalform,Ósuchthatsemanticallyequivÿ|ralentforms¡íºâmap9ðtothesamenormalform.EDetectionof xedpAÇoin¾9ts¡íºâis;Úthenasimplematterofdetectingsyn¾9tacticequalityof¡íºâthenormalforms.%øFÿ:«orhigherorderterms,YLunfortunately,¡íºâthisximpliesanabilit¾9ytosolvethehaltingproblem.DWÿ:«e¡íºâthereforeVdealwithhigherorderfunctionsasdescribAÇedin¡íºâsectionj¦5,Éandrestrictourselv¾9estogeneratinguniquenormal¡íºâforms)Ôfortheabstractin¾9terpretationsof rstorderfunctions,¡íºâsomethingTwhic¾9his,fortunatelyÿ:«,decidable.¦íºâTheÑátermrewriterpropAÇerisanelaboratesystemwhic¾9hgen-¡íºâeratesa,normalformsb¾9yapplyingmanyloAÇcaltransformations¡íºâtov¥aterm.@bWhennomoretransformationscanbAÇeapplied,¡íºâtheMätermisdeemedtobAÇeinnormalform.Æ!Eac¾9hkindofal-¡íºâlo¾9wablejÓtransformationisencapsulatedinaso-calledrewrite¡íºârule.óÜEac¾9h]#rulemustimplementasemanticallyinvÿ|rariant¡íºâtransformation. »¸Sectionõ3.2in¾9troAÇducedafewequalities,¡íºâwhic¾9h,Twhengivenadirectionalityÿ:«,bAÇecomerewriterules:©ÐOûç¤ëMFncA¹(Fncac)î===>,Âa¡ûç¤FncC¹(Fncac)î===>,Âc¡ûç¤FvalA¹(Fvalca),Â===>a¡ûç¤FvalC¹(Fvalca),Â===>c¦íºâºMost(×rulesarecomplicatedb¾9ythepresenceofside-¡íºâconditions:¦ûç¤ëMFnc¹(FncAc1)(FncCc2),Â===>c1¡ûç¤provided¡
fc1¹==c2¦íºâºThese6yexamplesillustratetheproblemofwhethertosimplify¡íºâterms~startingfromthelea¾9ves~(innermost- rst)orfromthe¡íºâroAÇotMÁ(outermost- rst).Å·Since,Üinthesecondexample,the¡íºâruleF¾onlyappliesifsubtermsëMc1ºandëMc2ºarepro¾9vÿ|rablyequal,¡íºâinnermost- rstÆ9rewritingseemsnecessaryÿ:«. / Butthesame¡íºâstrategyJµappliedtoëMFvalC¹(Fvalca))Jµºcouldw¾9astealot ý õºâofÛ¯e ortsimplifyingëMa,ºonlytothro¾9witawayÿ:«,ç7sooutermost-¤
õºâ rstTmigh¾9tgivebAÇetterperformance.©
õºâPro¾9vidingÚDtherulesare nitelycon
uentandterminating,¡ õºâbAÇoth:approac¾9hesstillgivethesamenormalforms.Observe¡ õºâho¾9weverðthatwhatev¾9erapproachisused,ù×multiplepasses¡ õºâo¾9ver'thetreewill,Zingeneral,bAÇeneededtoarriv¾9eatnor-¡ õºâmalÿçform.Ü)ThedecisioncanthereforebAÇebasedpurelyon¡ õºâwhic¾9heverschemegivesbAÇetterperformance.¸HExperimen¾9ta-¡ õºâtion~"sho¾9wedthatoutermost- rstrewritingwasuptoten¡ õºâtimesZDslo¾9werthaninnermost- rstforrealisticallysizedterms¡ õºâemitted?b¾9ytheabstractinterpreter.1AlthoughitwouldbAÇe¡ õºâfoAÇolishBotoclaimthatthisisalw¾9aysBoso,ltheevidencesuggested¡ õºâanb innermost- rstsc¾9hemewouldusuallybAÇemuchquicker,
÷so¡ õºâanTinnermost- rstsc¾9hemeü-=ó*¹Aa¨ cmr6Õ1?ûºwasTadopted.5 õºâ¹4.2 G·P¹erformingLÎasinglesimpli cationpassm õºâºBecause¿¾theëMAbsValºandëMContextºt¾9ypAÇesaremutuallyre-¡ õºâcursiv¾9e,ÖËthe°termrewriterpropAÇerconsistsoftwofunctions¡ õºâofÂGt¾9ypAÇeëMAbsVal¹->AbsValÂGºandëMContext¹->Contextº,íeach¡ õºâofqwhic¾9hpAÇerformsmultipleinnermost- rstsimpli cation¡ õºâpassesN¦withanauxiliaryfunction.Ú6Whenstabilit¾9yisreached,¡ õºâitgômeansnormalformhasbAÇeenac¾9hieved.OThisgôsectiondis-¡ õºâcussesÛWho¾9wthoseauxiliaryfunctionswork.nxFÿ:«orsimplicityÿ:«,¡ õºâthey¬!aretreatedasasinglefunction,ÑÔcalledëMsimpº,w¾9orking¡ õºâonTtheunionofëMAbsValºandëMContextº,calledëMTermº.¦ õºâTÿ:«oiþmaximisepAÇerformance,)eac¾9hpassofëMsimpºtriestodoas¡ õºâm¾9uchéÑaspAÇossible, ðsoastominimisethen¾9umberéÑofpasses¡ õºârequired.AMeasuremen¾9ts6showedthevÿ|rastma jorityofterms¡ õºâreac¾9hÅ#normalforminonepass,ñandnotermhasbAÇeenob-¡ õºâserv¾9edTtorequiremorethanthreepasses.¦ õºâTheL?individualrewriterulesareclassi edin¾9togroups(rep-¡ õºâresen¾9tedÅïaslists)bytheroAÇotsymbAÇolofthetermwhichthey¡ õºârewrite.¼±TheJ¿mec¾9hanismwhichdirectstheapplicationof¡ õºârewriteðÖrulesensuresthateac¾9hruleisonlyappliedtoterms¡ õºâpAÇossessingxÈtherelevÿ|ran¾9trootsym¾9bol.FÌEachxÈruleisimple-¡ õºâmen¾9tedTasafunctionoftypAÇeëMTerm¹->MaybeTermº,Twhere:¤ÐOç¤ëMdata¹Maybea=Nothing|Justa¡ õºâºAsbAÇecomesclearshortlyÿ:«, "w¾9eneedtoknowwhethertheap-¤
õºâplicationq¡ofarewriterulehashadan¾9ye ect.1VWÿ:«ecould¡ õºâmak¾9eì6eachrulehavetypAÇeëMTerm¹->Termºandcomparethe¡ õºâterm
bAÇeforeandafterapplication,öbutthisseemsabom-¡ õºâinably.inecien¾9t,tÚbAÇecausetheruleitself\knows"whenit¡ õºâhas¹`madeac¾9hange.Therefore,âcwe¹`encoAÇdethatkno¾9wledge¡ õºâin³Ythereturnvÿ|ralueb¾9ypassingbackëMNothingºifthereisno¡ õºâc¾9hange.ÖObserveS^thatthereturnedëMMaybe¹Termºvÿ|ralueisin-¡ õºâstan¾9tly¨disassembledusingaHaskellcaseexpression,¾Sto nd¡ õºâout¹whethertherulehassucceeded.ä Therefore,>aHask¾9ell¡ õºâimplemen¾9tationíwhichreturnsconstructorsinregisters,õlike¡ õºâGlasgo¾9w¦Haskell[PJ92L ],¸:neveractuallybuildstheëMNothing¡ õºâºorTëMJustºclosureintheheap,apleasinglittleeciencyÿ:«.¦ õºâLet9oëMtºdenoteaterm,uandëMrulesfor(t)ºdenotethelistof õºâ@ ff _ÿ ×
r}üûróZ cmr5°1Y±One 5ofthesharp7 erwitsinthefunctionalprogrammingcommÈãu-¤ nitÈãyÿZª,±Èonreadinganearlydraft,commented: HoÈãw %couldyouletsuchawonderfulexampleofself-¡ referenceAègobÈãyunremarked?hðIAÌthoughtitwasabsolutely¡ marvÈãelous :thatyoudecidedtouseaninnermost- rst¡ scÈãhemeA¥inthetermrewriterwhichis,Xafterall,thewhole¡ p7 oinÈãtøofAnna'sexistanceintheRealWÿZªorldoutsideit-¡ self !¡ åäº17 ²È ºâ ý? £ ý íºâºrewriteÐrulesrelevÿ|ran¾9ttotheroAÇotsymbAÇolofëMt.simp(t)ºis¤
íºâcomputedTasfollo¾9ws:©ÐOûç¤ëMsimp(t)¡
f=¹schedule(t_inner_simp)¡where¡!´Tt_inner_simp¡/á=¹twithsimpappliedtot'ssubterms¡¡ûç¤schedule(t)¡
f=¹rewrite_with(rulesfor(t),t)¡¡ûç¤rewrite_with([],¹t)¡
f=¹t¡¡ûç¤rewrite_with((rule:rules),¹t)¡
f=¹case(rulet)of¡!´TNothing¹->rewrite_with(rules,t)¡!´TJust¹t2->schedule(t2)¦íºâºFirstlyÿ:«,6$ëMtº'süasubtermsaresimpli ed,givingëMt_inner_simp.¡íºâºThis"óispassedtoin¾9termediaryëMscheduleº,f[whichexamines¡íºâthe¼roAÇotsym¾9boltodeterminetherelevÿ|ran¾9tlistofrewrite¡íºârules. )OëMscheduleÄIºpassestherulesanditsargumen¾9tto¡íºâëMrewrite_withº,¬whic¾9hzÂworksitswaythroughthelistofrules.¡íºâIf2ºitrunsoutofrules,`
itsimplyreturnstheterm.ÐçButifthere¡íºâisÞ arule,éitisappliedtotheterm.
4Thiseitherhasnoe ect,¡íºâin÷whic¾9hcasethenextruleistried,/oritproAÇducesanew¡íºâterm'eëMt2º.R¢No¾9wëMt2ºmaywellhaveadi erentroAÇotsymbAÇol,¡íºâwhic¾9h¶Ýwouldinvÿ|ralidatealltheremainingrules.üóSorewriting¡íºâofTëMt2ºiscon¾9tinuedTbypassingitbacktoëMscheduleº.
íºâThe mnete ectofëMschedule(t)ºisth¾9ustokeepapplying¡íºârewrite¯rulestotheroAÇotofëMtºun¾9tilnoapplicablerulescan¡íºâbAÇe5¢found.
}ZThisprocessdealsproperlywithc¾9hangesin¡íºâtheôroAÇotsym¾9bol.¸®ObserveôthatthecalltoëMscheduleºfrom¡íºâëMrewrite_withHSºisnotnecessaryforcorrectness.µmWÿ:«ecould¡íºâsimply+´returnëMt2ºatthispAÇoin¾9t.ÎWhatthiswouldmeanisthat¡íºâan¾9y8ípAÇossiblerewritesofëMt2ºwouldbAÇedelayeduntilthenext¡íºâsimpli cation7Îpass,d ratherthanbAÇeingdonestraigh¾9tawayÿ:«.ÒSo¡íºâomitting~there-sc¾9heduleimpliesmoresimpli cationpasses¡íºâandTaseriouslossofeciencyÿ:«.5íºâ¹4.3G·DealingLÎwithlambFfdasandapplicationsmíºâºTheépresenceofëMAbsLamº,^²ëMAbsApºandëMAbsVarºtermsin¾9tro-¡íºâducesÖ?theneedtopAÇerformlam¾9bdacalculus-lik¾9esubsti-¡íºâtution. *Whatçfollo¾9wsappliesequallytothedualcon-¡íºâstructions°ªëMCtxLamº,ëMCtxApºandëMCtxVarº.îsInparticular,¡íºâëMsimp|UºneedstobAÇeabletodealwithtermsoftheform¡íºâëM(AbsAp¹(AbsLamve)a)º. pNaturallyÿ:«,w¾9eÛàcanreachdi-¡íºârectlyBéfortheblunderbusssolution:
wdeviseafunction¡íºâëMsubst(e,v,a)XºtoreplacefreeoAÇccurrencesofëMvºinëMeºwithëMa,¡íºâºandTemplo¾9yitintherewriterule:¦ûç¤ëMAbsAp¹(AbsLamve)a,Â===>subst(e,v,a)¦íºâºTw¾9oAdefectsareapparent. ðFirstlyÿ:«,LsinceëMsimpºiscommitted¡íºâto8Ðdoinginnermost- rstsimpli cation,dëbAÇothfunctionandar-¡íºâgumen¾9tBaresimpli edextensivelybAÇeforesubstitutionbegins.¡íºâOurßhandsareno¾9wtied:èµwecannotmakethelambAÇda/apply¡íºâtermãereductionan¾9ylazier.¤Ineciencyisthesecondcom-¡íºâplain¾9t.0Thisq]schemedemandsacompletesubstitutionpass¡íºâo¾9verTëMeºforev¾9eryargument. ý õºâAnR±altogethernicersolutionistoforgetabAÇoutëMsubstºandthe¤
õºârewrite»drule.Instead,äèw¾9eequipëMsimpºwithanenvironment¡ õºâëMenv?oºwhic¾9hbindsëMAbsº-vÿ|rariablestovalues.ÀNo¾9w,õgive?oëMsimp¡ õºâºa©coupleofspAÇecialcases.ØöTheseomittheusualsimpli ca-¡ õºâtion·ofsubterms,½Oandb¾9ypassthegeneralrewritingmecha-¡ õºânism.¥6InAthisw¾9ayAweregainprecisecontrolovertheorder¡ õºâofý×rewrites,andnoseparatesubstitutionpassesareneeded.¡ õºâVÿ:«ariablesTaresimplyloAÇok¾9edup:¤ÐOç¤ëMsimp¹env(AbsVarv)=envv¡ õºâºOnÝencoun¾9teringëM(AbsAp¹fa)º,îweÝneedtotryandturnëMf¤
õºâºin¾9to ³anëM(AbsLam¹ve)º.>The ³obviouswaytodothisisby¡ õºâapplyingôÒëMsimpºtoëMfº,ûSbutthisw¾9ouldbAÇeabigwasteoftimeif¡ õºâëMf×ãºisinthatformalreadyÿ:«.õSothereisaspAÇecialc¾9heck×ãforthis¡ õºâcase.¼Theämen¾9vironmentisthenaugmentedwithabinding¡ õºâfor³¹ëMvº,ÛRandsimpli cationcon¾9tinues³¹withëMeº.÷Byc¾9hoAÇosingto¡ õºâbindíÉëMvºtoëMaºorëMsimp¹envaº,õ²w¾9eíÉcanagainvÿ|rarythestrictness¡ õºâofy;thesc¾9heme.H$ThelatterchoicegivesbAÇetterperformance,¡ õºâsoTthespAÇecialcaseforëM(AbsAp¹fa)Tºis:©ÐOç¤ëMsimp¹env(AbsApfa)¡f=¹letsa=simpenva¡.mêsf¹=simpenvf¡in¡case¹fof¡)´TAbsLam¹ve¡7á->¹simpenv{v:->sa}e¡)´Tother¡7á->¹casesfof¡T:AbsLam¹v2e2¡bg\->¹simpenv{v2:->sa}e2¡T:other¡bg\->¹AbsApsfsa¦ õºâºIfòÁëMfºsimplyrefusestobAÇerewrittenin¾9toanëMAbsLamº,ù«theterm¡ õºâhas,òitssubtermssimpli edandisthenreturnedas-is.cJThis¡ õºâisDzconsisten¾9twithhownormalcasesaredealtwith,Csince¡ õºâthereTarenomoreëMAbsApºrewriterules.
õºâAn-ëMAbsVarºconstructcanrefernotjusttovÿ|rariablesbAÇound¡ õºâb¾9y=asurroundingëMAbsLamº,butalsototheabstractvÿ|ralues¡ õºâof6/otherfunctions.Tÿ:«odealwiththese,~fw¾9e\preload"the¡ õºâëMAbsº-en¾9vironment°FwithsuitablebindingsbAÇeforestartingsim-¡ õºâpli cation.}òFinallyÿ:«,ènote*thatthedualëMCtxº-constructions¡ õºâareü¿dealtwithinthesamew¾9ayÿ:«,6soü¿ëMsimpºcarriest¾9woü¿envi-¡ õºâronmen¾9ts,HËrather>thanjustone.óTheonlydi erenceisthat¡ õºâaþëMCtxVarºcanonlyrefertoëMCtxLamºbAÇoundvÿ|rariables.nThese¡ õºât¾9worÙenvironmentsarehenceforthreferredtoasëMaenvºand¡ õºâëMcenvTºrespAÇectiv¾9elyÿ:«.5 õºâ¹4.4 G·AvoidingLÎin niteb¹ranching¤m õºâ4.4.1úíALÎnaiveapp¹roach¡ õºâºSection323.4in¾9troAÇducedtheëMCaseU3*ºandëMCaseUUºconstructions¤
õºâas¹yoneofthefundamen¾9talmechanismsfordisassembling¡ õºâcon¾9texts.u AØserious8problemwhichbAÇecomesapparentas¡ õºâsoAÇonUÄasonestarts xpoin¾9tingisthepoten¾9tialforin nite¡ õºâbranc¾9hing. pFixpAÇointingTproducesexpressionslik¾9e¦ç¤ëMCaseU¹e(CaseUewx)(CaseUeyz)¦ õºâºwhic¾9hTisequivÿ|ralentto: åä18 Ó¦ ºâ ý? £ ý ûç¤ëMCaseU¹ewz©ÐOíºâºWÿ:«e¶©cangetroundthisb¾9ydesigningthenormalformsothat¤
íºâfor ±atermëM(CaseU¹eab)º,
neither ±subtermëMaºnorëMbºma¾9ydo¡íºâafÕëMCaseUfÀºonëMeº.òTÿ:«oac¾9hievefÕthisnormalisationrequiresusing¡íºâpartialfkno¾9wledgeabAÇoutthevÿ|ralueofëMeºwhensimplifyingëMa¡íºâºandTëMbº.
íºâTÿ:«o@óimplemen¾9tthis,Úwecouldadoptthefollowingscheme.¡íºâGiv¾9e^#ëMsimpºyetanotherenvironment,°VëMselenvº,which^#maps¡íºâswitc¾9h
expressionsseeninsurroundingëMCaseUÿºandëMCaseUUs¡íºâºtoN"partialinformationabAÇouttheirvÿ|ralue.ÆÚWhenanested¡íºâëMCases ºexpressionisencoun¾9tered,3loAÇokupitsswitchvÿ|raluein¡íºâëMselenvº.`¥If,thereisacorrespAÇondingen¾9tryÿ:«,1¿thisëMCaseºexpres-¡íºâsion¿m¾9ustbAÇeexaminingacontextwhichhasalreadybAÇeen¡íºâloAÇok¾9edÖat,¸vsotheëMCaseºexpressionisreplacedbywhichever¡íºâarmé;thetableen¾9trysaysiscorrect.$Fÿ:«orexample, 4givena¡íºâcall¦ûç¤ëMsimp¹selenv(CaseUe(CaseUewx)(CaseUeyz))¦íºâºsimpli cation,ËofëM(CaseU¹ewx),˺isdonewithëMselenvºbinding¡íºâëMe/ºtoëMStop1º,]zandsimpli cationofëM(CaseU¹eyz)/ºisdonewith¡íºâëMselenv`LºbindingëMeºtosomevÿ|ralueoftheformëMUp1¹[...]º.àThis¡íºâpartial_$informationabAÇoutëMeºimmediatelyallo¾9wsthesystem¡íºâto(reducethet¾9wo(subtermstoëMwºandëMzºrespAÇectiv¾9elyÿ:«.qìProp-¡íºâagationûìofinformationabAÇoutëMCaseUUûåºselectorvÿ|raluesisdone¡íºâanalogouslyÿ:«.
íºâëMselenv(cºisaugmen¾9tedeachtimeaëMCaseU(^ºorëMCaseUUºis\gone¡íºâpast". ?îAË problemËÓiswhathappAÇenswhenw¾9egopast¡íºâaÙÍëM(CtxLam¹ve)º,Jësincethisw¾9ouldinvÿ|ralidateanykeysin¡íºâëMselenv9ºcon¾9tainingfreevÿ|rariableëMvº." RemembAÇerthatthekeys¡íºâareüarbitraryexpressions,5²ratherthanmerevÿ|rariables.ÐAn¡íºâexpAÇensiv¾9e£Wsolutionisto lteroutall(keyÿ:«,º$vÿ|ralue)pairswhich¡íºâreferàtoëMvº,nbutthat'so¾9verkill.~HItàisc¾9heapAÇertocompletely¡íºâempt¾9y{°ëMselenvºateveryëMCtxLamº.OThisdoAÇesn'tloseinforma-¡íºâtionkbAÇecausetheabstractin¾9terpreterneverbuildscontext¡íºâexpressions÷ewherew¾9eneedtomaintainselectorinformation¡íºâacrossëMCtxLamºbAÇoundaries.ñ
Fÿ:«orexample,®Sitnev¾9erbuildsany-¡íºâthingTlik¾9e:¦ûç¤ëMCaseU¹s1(\c1->...(CaseUs2....))¡&mê(\c2¹->...(CaseUs2....))5íºâ¹4.4.2 úíGeneralisingLÎtheschememíºâºAlittle¾though¾9tshowsoursolution,¾whilstpAÇerfectlywork-¡íºâable,µDis@toAÇow¾9eak.ôiWÿ:«eneedamoregeneralwaytopropagate¡íºâso-calledëá\ëMselenvºinformation"around,!ascanbAÇeseenb¾9y¡íºâconsidering:¦ûç¤ëMCMeet¹[e,UpUp2[Stop1,Stop1]]¦íºâºInitiallyÿ:«,Òit¬UloAÇokslik¾9enothingmorecanbedonewiththis.¡íºâBut ®if,ab¾9yloAÇokinginëMselenvº,w¾9ecanshowthatëMeºhasan¡íºâëMUpUp2¹[...]Tºvÿ|ralue,then:¦ZÐëMCMeet¹[e,UpUp2[Stop1,Stop1]]¡ûç¤=¹UpUp2[Stop1,Stop1]¦íºâºWhat}tw¾9ereallyneedisageneralmechanismforpropagat-¡íºâingÓTëMselenvºinformation.VqTÿ:«obAÇefullygeneral,Ôw¾9ewillhave¡íºâtoW¯searc¾9hëMselenvºforeachtermëMsimpºencounters.ãThispro-¡íºâcessÆÀcanbAÇerolledin¾9tothegeneralmechanismofëMsimpº,óby ý õºâsearc¾9hing«ÄëMselenvºafterëMsimpºrunsoutofapplicablerewrite¤
õºârules.5ÂWÿ:«e ÅexpAÇecttodisco¾9ver Ånothingaboutthevÿ|rastma-¡ õºâjorit¾9yXµofterms,iinwhichcaseëMsimpºactsasbAÇefore.æBut,ifor¡ õºâaluc¾9kyfew,? ëMselenvºtellsusalittleabAÇouttheterm:øÉitis¡ õºâeither>jëMStop1º,°ëMStop2º,ëMUp2º,ëMUp1¹[...]ºorëMUpUp2[...]º.³In¡ õºâthe¼Ô rstthreecases,Îw¾9ecanobviouslyreplacethetermwith¡ õºâtherelevÿ|ran¾9tvalue,õbuttheothert¾9woareproblematic.'Ho¾9w¡ õºâcany w¾9eexploitpartialinformationlikethis?GConceptuallyÿ:«,¡ õºâw¾9e%needtoaddafoAÇotnotetothevÿ|raluesaying, ûforexample,¡ õºâ\Pÿ:«.S.)£Thisvÿ|ralueiskno¾9wntobAÇeëMUpUp2¹[...]º",.·andmodify¡ õºâtheTrewriterulestotak¾9eaccountofsuchfoAÇotnotes.
õºâThisLHallsoundsratherclumsyÿ:«,Zbutthereisaneatsolution.¡ õºâRecall
qsection3.4in¾9troAÇducedëMDefU
1ºandëMDefUUº.ëMDefºsstand¡ õºâforg\de nitely",¶ýandarein¾9tendedasawayofattachingsuch¡ õºâaTèfoAÇotnotetoavÿ|ralue.Û-Thein¾9tuitiveTèreadingofëM(DefU¹e)ºis¡ õºâ\I'mnotsurewhattheexactvÿ|ralueofëMeºis,¢¾butI
ódokno¾9wit's¡ õºâanzòëMUp1¹[...]ºvÿ|ralue".MISono¾9w,YondiscoveringfromëMselenv¡ õºâºthatx¶atermëMcºhasanëMUp1¹[...]ºorëMUpUp2[...]ºvÿ|ralue,w¾9e¡ õºâmerelyèµneedtowrapëMcºinëMDefUè~ºorëMDefUUºrespAÇectiv¾9elyÿ:«.All¡ õºâthat/remainstodoismoAÇdifyrewriterulestotak¾9eaccountof¡ õºâëMDefUBHºandBTëMDefUUºasappropriate.£pThismec¾9hanismsubsumes¡ õºâtheTpreviousone. pConsideragain:©½ìç¤ëMsimp¹selenv¡(CaseU¹e(CaseUewx)(CaseUeyz))¦ õºâºIgnoringÀpAÇossiblec¾9hangestoëMwº,ëMxº,ëMyÀºandëMzº,ëMsimpºtranforms¡ õºâthisTto:¦ç¤ëMCaseU¹e(CaseUStop1wx)(CaseU(DefUe)yz)¦ õºâºApplicationToftherewriterules¦ç¤ëMCaseU¹Stop1æXab,Â===>a¡ç¤CaseU¹(DefUe)ab,Â===>b¦ õºâºyieldsTthedesiredresult:¦ç¤ëMCaseU¹ewz¦ õºâºRecall&theotherexample,j,inwhic¾9hëMselenvºbindsëMeºtoan¡ õºâëMUpUp2¹[...]Tºvÿ|ralue:¦ç¤ëMCMeet¹[e,UpUp2[Stop1,Stop1]]¦ õºâºAfterÎ}wrappingëMDefUUÎMºaroundëMeº,üÇthefollo¾9wingsequenceof¡ õºârewritesTispAÇossible:¦
ZÐëMCMeet¹[DefUUe,UpUp2[Stop1,Stop1]]¡¡ç¤=¹UpUp2[CMeet[SelUU1e,Stop1],¡3'CMeet¹[SelUU2e,Stop1]]¡¡ç¤=¹UpUp2[Stop1,Stop1]¦ õºâºAgain,ôåtheÈ/desiredresultisobtained.5Allw¾9ehadtodois¡ õºâincludeTarewriterulederiv¾9edfromthis:¦ç¤ëMCMeet¹[UpUp2[x1,x2], s,UpUp2[y1,y2]]¡f===>,ÂUpUp2¹[CMeet[x1,y1],¡Xô0CMeet¹[x2,y2]]¦ õºâºBy\moAÇdifyingtherulesothatoneoftheinitialtermsis¡ õºâëM(DefUU¹e)º,ÛHandÌÄbAÇearinginmindthemeaningsofëMDefUU̲ºand¡ õºâëMSelUUTº(seesection3.4),onecaneasilysho¾9wthat: åä19 îs ºâ ý? £ ý ûç¤ëMCMeet¹[DefUUe, s,UpUp2[y1,y2]]¤
f===>,ÂUpUp2¹[CMeet[SelUU1e,y1],¡Pô0CMeet¹[SelUU2e,y2]]©ÐOíºâºAllinall,úaratherelegan¾9tsolutiontoatrickyproblem.¡íºâThereTisjustone nalca¾9veat. pConsider:¦ûç¤ëMsimp¹selenv(CaseUeab)¦íºâºIfùFw¾9ecannot ndavÿ|ralueforëMeºinëMselenvº,þãtheëMCaseUù?ºexpres-¡íºâsionÍma¾9ystillbAÇeremovÿ|rablebythefollowingmeans.E:Find¡íºâinÔëMselenvºak¾9eyëMkºforwhichwecanprovethatëMkëPvzgëMe
3ýº,¡íºâandæ(forwhic¾9hëMkºisbAÇoundtosomeëMUp1¹[...]ºvÿ|ralue.ìSoëMe¡íºâºm¾9ust&alsobindtosomeëMUp1¹[...]ºvÿ|ralue,*Csowecanreplace¡íºâëM(CaseU¹eab)àºb¾9yëM(CaseU¹(DefUe)ab)º.'ëMCaseUUºsàare,Ãas¡íºâev¾9er,W¬analogous.»ªSoJgwemightbAÇeabletodojustalittlebit¡íºâbAÇetter ¼m¾9ytakingmonotonicityofkeysintoaccountwhen¡íºâsearc¾9hingTëMselenvº.5íºâ¹4.5G·AvoidingLÎanexpFfonentialexplosionmíºâºAlthough4¶w¾9ehaveavoidednon-terminationviain nite¡íºâbranc¾9hing,ïanother³insidiousproblemlurks:.termswhich¡íºâexpand,expAÇonen¾9tiallyforawhile,º"beforeshrinkingbac¾9kto¡íºâa#compactnormalform.ÝSuc¾9hbAÇehaviourcausestheterm¡íºârewriterÂltorunoutofmemorysimplifyingseeminglyin-¡íºâsigni can¾9t¸expressions.yTheproblemmanifestsitself,àonce¡íºâagain,nwith\ÃëMCaseU\±ºandëMCaseUUºterms.ò¾Thenormalformre-¡íºâquiresª¸thattheswitc¾9hexpressioncannotitselfbAÇeaëMCaseUªºor¡íºâëMCaseUUº,Tgivingrisetosomerulesoftheform:¦ûç¤ëMCaseUU¹(CaseUUabcd)efg¡ûç¤===>¡ûç¤CaseUU¹a(CaseUUbefg)¡&mê(CaseUU¹cefg)¡&mê(CaseUU¹defg)¦íºâºTheÐzproblemoAÇccursbecauseofthew¾9ayÐzëMrewrite_withºat-¡íºâtempts5toapplyrewriterulestotheroAÇottermun¾9tilnomore¡íºâcanËbAÇefound.óÔIfëMaºisitselfaëMCaseUUºterm,DhëMrewrite_with¡íºâºwillîéimmediatelyreapplytherule,¥Mtreblingtheexpres-¡íºâsionÆÿsizeagain. 1rItw¾9ouldbAÇebettertolooktoseeif¡íºâw¾9eåâcandosomesimpli cationsontheëM(CaseUU¹befg)º,¡íºâëM(CaseUU¹cefg)køºandëM(CaseUU¹defg)køºtermsëRbeforekøºse-¡íºâlectingFÖanotherrewriterulefortheroAÇotterm.°öThere'sa¡íºâv¾9eryyZgoAÇodc¾9hancewecan,bAÇecauseitislikelythatwealready¡íºâkno¾9wüËenoughabAÇoutëMbº,³ëMcºandëMdºtoeliminatetheirassociated¡íºâëMCaseUUºs.iÙIt/"ma¾9yalsoturnoutthatëMaºisthesameasëMbº,5ëMcºor¡íºâëMdº,TandthisishelpfultoAÇo.
íºâImplemen¾9tingoÍthisisnotonlyeasyÿ:«,Æjbutessential.+ÚWhen¡íºâëMrewrite_withI$ºdetectsthatarewriterulehascreateda¡íºâëMCaseUU3ºterm,»Îit4 doAÇesnotimmediatelyseekoutanother¡íºârewriteàarulefortheroAÇotterm.}Instead,$ittriestorewrite¡íºâthesubtermsasm¾9uchaspAÇossible,¬Âandonlythenlooksagain¡íºâat3<theroAÇotterm.v'Thisminormodi cationpro¾9ves3<verysuc-¡íºâcessfulTata¾9voidingTexpAÇonentialexplosions.5íºâ¹4.6G·Tÿ,ÌypFfe-speci cLÎëMAbsVal¹optimisationmíºâºTheì abstractvÿ|ralues(ëMAbsValsº)ofallnon-function-spaceob-¡íºâjectsarepAÇoin¾9tsinaonepoin¾9tdomain.£(Therefore,¸ forany¡íºâëMAbsVal
Xºatall, ifw¾9ecandeterminethattheob ject'sdomain¡íºâisÈ+non-functional,ôàw¾9ecanmanufactureanequivÿ|ralentvÿ|ralue ý õºâfrom)@ëMARecºandëMANonRecº.X3Thisisextremelyuseful.Thedef-¤
õºâinition/cofëMAbsValº,5çpresen¾9tedinsection3.3,isaugmen¾9tedso¡ õºâw¾9e¥.canidentifythedomainforanyterm.ËÿThisisdoneby¡ õºâtagging^Æeac¾9hëMAbsValºwithacontextdomainvÿ|ralue,Jexceptfor¡ õºâtheTëMARecºandëMANonRecºcases,wherethedomainisob¾9vious.
õºâTheëMsimpºactionforëMAbsValºsno¾9wbAÇeginsbyextractingthe¡ õºâcon¾9text®domain,¯andbuildingaliteralreplacementifappro-¡ õºâpriate. pLetTëMdomainof(a)ºbAÇethedomainofëMaº.©7ç¤ëMsimp¹a¡f=¹leta_ctx_domain=domainof(a)¡in¡ifæXunitary_ctx_domain(a_ctx_domain)¡then s,unit_value(a_ctx_domain)¡else s,(...¹doasbefore...)¡¡ç¤unitary_ctx_domain¹(Lift s,(D1x...xDn))¡f=¹unitary_ctx_domain(D1)&&...&&¡unitary_ctx_domain(Dn)¡¡ç¤unitary_ctx_domain¹(Lift2(D1x...xDn))¡f=¹unitary_ctx_domain(D1)&&...&&¡unitary_ctx_domain(Dn)¡¡ç¤unitary_ctx_domain¹(Ds->Dt)¡f=¹False¡¡ç¤unit_value¹(Lift s,(D1x...xDn))¡f=¹ANonRec[unit_value(D1)...unit_value(Dn)]¡¡ç¤unit_value¹(Lift2(D1x...xDn))¡f=¹ARecæX[unit_value(D1)...unit_value(Dn)]¦ õºâºThisTw¾9orks ne,¤gbut,asTusual,weTcandoalittlebAÇetter.¡ õºâPresen¾9ted&withatermalreadycompAÇosedentirelyofëMARec¡ õºâºandøëMANonRecºs,¯qthesc¾9hemereturnsacopyoftheterm,¯qgiving¡ õºâak
pAÇoten¾9tiallossofsharing. Aj±smallmodi cationdetects¡ õºâsuc¾9hTtermsandreturnsthemas-is. õºâ¹4.7 G·Imp¹rovingLÎtherepresentationofcontexts:fhëMApplyETm õºâºFÿ:«or;tman¾9ytrivial-loAÇokingfunctions,Dütheabstractinterpreter¡ õºâemitswaremarkÿ|rablycum¾9bAÇersomeandunintuitive-loAÇoking¡ õºâterm.ÝÂExaminationYJoftermsfrom rstorderfunctionssho¾9ws¡ õºâaèsw¾9aytocutdowntheirsizes.
zSinceallabstractvÿ|raluespAÇer-¡ õºâtainingà¶totheargumen¾9tsandresultofa rstorderfunction¡ õºâareH
unitaryÿ:«,T·theonlythingonecanaskabAÇoutitisho¾9wthe¡ õºâcon¾9textùontheresultpropagatestoeachargument.òüSuppAÇos-¡ õºâingÕw¾9ehaveëMfº,¼a rstorderfunctionofóO5ù" cmmi9ëOmºarguments,¼andwe¡ õºâw¾9ant^tokno¾9wwhatcontextpropagatestotheëOnº'thargument¡ õºâifaØtheresultisdemandedincon¾9textëMalphaº.ýAtpresent,túwe¡ õºâgetTalargetermoftheform:¦ç¤ëMCtxAp s,(FvalC¹(AbsAp(GetA...(AbsAp(FvalAf)¡¼-~a1)¡zv...¡kÚai)¡$ú¾))¡¡$ú¾(Fnc¹aj...(Fncamalpha)...)¦ õºâºwhereáëMi ²(º=d±ëOnbëP º1áandëMjº=d±ëOnbº+1.WhatáthisdoAÇesittouse¡ õºâthe©ªëM(AbsAp¹(GetA...))ºconstructionëOn6äëP º1timestosupply¡ õºâthew rstëOnOëP º1wabstractvÿ|ralueargumen¾9ts,whichwexpAÇosesthe åä20 Ö ºâ ý? £ þ§þ ÿiíºâ ÿefg fföÌÌÿþÌÍ )³40³2 ff þäÿþ33ëMFsqDiff¤
ìÉ=¹(Fval(\c1->(CJOIN¡^ùU(ApplyET#0¹F+(ApplyET#1F*(FncC(FncCc1))))¡^ùU(ApplyET#0¹F-(ApplyET#0F*(FncC(FncCc1))))))¡/¹y(\a1¹->(Fval(\c2->(CJOIN¡ ¡ (ApplyET#1¹F+(ApplyET#1F*(FncCc2)))¡ ¡ (ApplyET#1¹F-(ApplyET#0F*(FncCc2)))))¡qß(\a2¹->(ANonRec[])))))¡¡33FsqDiff¡ ìÉ=¹(Fval(\c1->(CJOIN¡^ùU{(FvalC¹F+)¡c²ë(Fnc¹(ANonRec[])(Fnc(ANonRec[]){(FvalC{*(FvalAF*)(ANonRec[])*})¡
(Fnc¹(ANonRec[])(FncC(FncCc1)))}))}¡^ùU{(FvalC¹F-)¡c²ë(Fnc¹(ANonRec[])(Fnc(ANonRec[]){(FvalCF*)¡
(Fnc¹(ANonRec[])(Fnc(ANonRec[])¡2(FncC¹(FncCc1))))}))}))¡/¹y(\a1¹->(Fval(\c2->(CJOIN¡ ¡ {(FvalC¹{*(FvalAF+)(ANonRec[])*})¡ ¥Ù (Fnc¹(ANonRec[]){(FvalC{*(FvalAF*)(ANonRec[])*})¡ ÿA(Fnc¹(ANonRec[])(FncCc2))})}¡ ¡ {(FvalC¹{*(FvalAF-)(ANonRec[])*})¡ ¥Ù (Fnc¹(ANonRec[]){(FvalCF*)¡ ÿA(Fnc¹(ANonRec[])(Fnc(ANonRec[])(FncCc2)))})}))¡qß(\a2¹->(ANonRec[]))))) ^®rºFigureT1: pAbstractin¾9terpretationofëMsqDiffº,withandwithoutusingëMApplyET¡öff0³2 ff * fföÌÌ X þÃþíºâëOnº'thªcon¾9textmap.ÚxThisisthenappliedtoëMalphaºwrappAÇed¤
íºâupNÍinac¾9hainofëM(Fnc¹...)ºconstructionswhichsupplythe¡íºâremainingTëOm8ëP ëOnëP º1abstractvÿ|ralueargumen¾9ts.©
íºâThis^seemsanenormouslyw¾9astefulwaytosaywhatamounts¡íºâto:¤ÚÂûç¤ëMApplyET¹nfalpha¡íºâºThat##is,S\extracttheëOnº'thcon¾9textmapfromëMfºandapplyitto¤
íºâtheM¯con¾9textëMalphaº".ÅWÿ:«ell,[Æalmost.InM¯fact,ëMfº'sëOnº'thcon¾9text¡íºâmapïHexpAÇectstobeappliednotdirectlytoëMalphaº,öäbuttothe¡íºâtermèëM(Fnc¹aj...(Fncamalpha)...)º.³+ItloAÇoksat rst¡íºâlik¾9e~weneedtoincludetheabstractvÿ|raluesëMajºtoëMamºinthe¡íºâëMApplyET=ºterm.'Fÿ:«ortunately,
that=æisa¾9voidable:msince=æthey¡íºâare9vallunitaryÿ:«,~w¾9eshouldneverneedtoknowwhatthey¡íºâare.÷Instead,·w¾9e<ÖsimplyrecordintheëMApplyET<ºtermhow¡íºâman¾9y8Iofthese\trailing"argumentsthereare.
OWhenthe¡íºâtermê%rewriter nallygetsholdofëMfº'sëOnº'thcon¾9textmap, Zit¡íºâusesTthisn¾9umbAÇerTtobuildasuitable\dumm¾9yterm"¤ÚÂûç¤ëM(Fnc¹Error...(FncErroralpha)...)¡íºâºto~üwhic¾9hitappliestherelevÿ|rantcontextmap.YhIne ect,fwe¤
íºâa¾9voided9storingthosetrailingargumen¾9ts,ïandfakedthem¡íºâinstead,F using<^ëMErrorºterms,bAÇecausew¾9ecanguaranteethey¡íºâwillònev¾9erbAÇeused.¹JFÿ:«romthisitfollowsthatitisanerror¡íºâforTëMErrorºtoappAÇearinthenormalformofan¾9yterm.¦íºâUseî°ofëMApplyETîwºshrinksman¾9ytermsdramaticallyÿ:«,%anden-¡íºâhances ÇthetimeandspacepAÇerformanceoftheanalyser.>ÉAs¡íºâanTexample,Figure1sho¾9wstheabstractinterpretationofÚÂûç¤ëMsqDiff¹xy=(x+y)*(x-y) þÃþ õºâºwithLÎandwithoutusingëMApplyETº.Ofcourse,Zwhenthede -¤
õºânitionsÖofëM(+)º,®vëM(-)ºandëM(*)ºaresubstitutedin,bAÇothterms¡ õºâreduce'Ztothesamething.RNotethatëM(CtxAp¹e1e2)'Zºand¡ õºâëM(AbsAp¹e1e2)õoºarewrittenasëPfëMe1¹e2ëPgºandëPfëM*e1e2*ëPgºre-¡ õºâspAÇectiv¾9elyÿ:«.5 õºâ¹4.8 G·No¹rmalLÎformsandterminationpropFferties©m õºâºSho¾9wing÷thatthetermrewritingsystemalwaysterminates,¡ õºâand\`proAÇducesnormalforms,^isimportan¾9t.ÞÉFÿ:«orasystemwith¡ õºâasB½man¾9yrewriterulesandcomplicationsasthis,NproAÇducing¡ õºâa ªcorrectnessargumen¾9tisaformidabletask.ùrWÿ:«ehopAÇeto¡ õºâinclude¦oneinalaterv¾9ersionofthispapAÇer.¯fAlsotobe¡ õºâincludedEwillbAÇealistingoftherewriterules,
alongwith¡ õºâtheirDassoAÇciatedproofsofcorrectness.©ôThereareatpresen¾9t¡ õºâinTtheregionofsixt¾9yrewriterules.- õºâ¹5Firsti cationLÎandmonomo¹rphisation´ õºâ5.1 G·IntroFfduction¦ õºâºAlthough¹· rstorderfunctionsareeasilyhandledb¾9yterm-¡ õºârewriting based xpAÇoin¾9ting,Áøhigherorderrecursivefunctions¡ õºâgiv¾9eTtrouble,astypi edbyfoldr:©ÐOç¤ëMfoldr¹fa[] Y=a¡ç¤foldr¹fa(x:xs) s,=fx(foldrfaxs)¦ õºâºNaiv¾9ely\Í xpAÇointingthisgivesanseriesofapproximations¡ õºâin whic¾9haterminvolvingfunctionalparameterëMfºisapplied¡ õºâev¾9erJ(moretimestoaninitialterm.Ø·Thetermrewritercannot åä21 % ºâ ý? £ ý íºâºsho¾9wÕ½thattwoapproximationsarethesame,Ösoa xpAÇoint¤
íºâis-apparen¾9tlyneverreached.eHWhat'sreallygoingonisthat¡íºâtheT xpAÇoin¾9tofëMfoldrºdependsonthe xpoin¾9tofëMfº.©
íºâThere lareonlyt¾9wo lwaysroundthis.=¸The rstistoiter-¡íºâateenoughtimestobAÇesurethatthe xpoin¾9tiscertainly¡íºâreac¾9hed.ÐWÿ:«orkQZbyNielsonandNielson[NN92 >]givessafe¡íºâlo¾9weröbAÇoundsonthen¾9umberöofiterationsneeded.À>Unfor-¡íºâtunatelyÿ:«,Wthe¼expAÇenseofdoingthismak¾9esitunattractive.¡íºâNoteTalsothatthisapproac¾9hdemandsmonomorphisation.¦íºâTheM9secondsolutionrequiresustosupplyavÿ|ralueforëMfºbAÇe-¡íºâfore% xpAÇoin¾9tingëMfoldr,ºsothatweare,»Yine ect,nolonger¡íºâdealing¿xwithahigher-orderfunction.ÜTherearen¾9umerous¡íºâw¾9aysT¾todothis,dsomeratherobscureinthattheypartially¡íºâsubstituteg?infunctionalparametersaspartofthe xpAÇoin¾9t-¡íºâing¶hproAÇcess[ëN?sº].ÿBycon¾9trast, Annaadoptsacompletely¡íºâstraigh¾9tforwardpäapproach:Ótransformthesourceprogram.¡íºâProgramñvtransformationisapAÇopularsub ject,(~andvÿ|rarious¡íºâpapAÇers¶describehigher-orderfunctionremo¾9vÿ|ral(alsoknown¡íºâasÐ rsti cationorspAÇecialisation)[CD91þä]¡8[Nel
º].Thesc¾9heme¡íºâpresen¾9tedTbAÇelowisbasedonworkbyGeorgeNelan[Nel
º].¦íºâNotÀ allfunctionalparameterscanbAÇeremo¾9ved. ÇFÿ:«orÀ exam-¡íºâple,õrecursiv¾9eí functionswhichhaveaccumulatingfunctional¡íºâparametersIarenottransformable, Æatleastwiththesc¾9heme¡íºâbAÇelo¾9w:©:¢ûç¤ëMf¹gx=ifæXx==0¡!´Tthen s,g¹1¡!´Telse s,x¹*f(\y->gx+y)(x-1)¦íºâºWÿ:«e _justifythisdesigndecisiononthebasisthatthevÿ|rast¡íºâma jorit¾9yYoffunctionsthatpAÇeoplereallywritecanbe rsti-¡íºâ ed,TandGåthevÿ|rastma jorit¾9yoftherestcanbAÇehandledbya¡íºâsecondary=§mec¾9hanismoutlinedinsection6.4.jIndoingthis¡íºâw¾9e±YimplicitlyappAÇealtothemeasurement-leadapproachto¡íºâdesignÔ¼discussedinthein¾9troAÇduction.Z©Wÿ:«eonlyneedtore-¡íºâmo¾9vePÛfunctionalparametersforrecursiv¾9efunctions,_½but,as¡íºâbAÇecomesfclear,¬thismeans rstifyingnon-recursiv¾9efunctions¡íºâtoAÇo.æíºâ¹5.2G·Firsti cationLÎb¹yexamplesmíºâºFÿ:«orþcthemomen¾9t,x§let'suseëMfoldrºasarunningexample.¡íºâGiv¾9enTauseofëMfoldrº,like¦ûç¤ëMsum¹xs=foldr(+)0xs¦íºâºw¾9e ½canunfoldfunctionalparameterëM(+)ºandidentityëM0ºinto¡íºâëMfoldrº,TgivinganewfunctionëMfoldrSpecº:¦ûç¤ëMsum¹xs=foldrSpecxs¡¡ûç¤foldrSpec¹[] Y=0¡ûç¤foldrSpec¹(x:xs) s,=x+foldr(+)0xs¦íºâºAndno¾9w,E%foldingthebAÇodyofëMfoldrSpecºgiveswhatwereally¡íºâw¾9ant:¦ûç¤ëMsum¹xs=foldrSpecxs¡¡ûç¤foldrSpec¹[] Y=0¡ûç¤foldrSpec¹(x:xs) s,=x+foldrSpecxs¦íºâºTheh5k¾9eytosuccesshereistheeasewithwhichthatlast¡íºâfold4 w¾9asdone.xÈIngeneral,;Îfoldingisatrickybusiness,;Îwith ý õºâno4`guaran¾9teeoftermination.yHowever,|"byrestrictingthe¤
õºâfunctionssw¾9edealwith, wecanguaranteetomakethefold¡ õºâstep¶terminating,ÞÔandtrivialtocarryout. Therestriction¡ õºâisÒPthatthefunctionm¾9ustpassalongallparameterswhich¡ õºâw¾9e¹wanttospAÇecialiseinthesamepositioninrecursiv¾9ecalls¡ õºâasytheyappAÇearedintheargumen¾9ts.+ßFÿ:«orexample,ÂinëMfoldrº,¡ õºâbAÇothTëMaºandëMfºsatisfythis.
õºâIn³fact,:w¾9eonlywanttosubstituteinfunctionalparameters.¡ õºâSoTthetransformationofëMsumºisreally:©ÐOç¤ëMsum¹xs=foldrSpec0xs¡¡ç¤foldrSpec¹a[] Y=a¡ç¤foldrSpec¹a(x:xs) s,=x+foldrSpecaxs¦ õºâºAºlittleûterminologyÿ:«.ƨThefunctionorrecursiv¾9egroupoffunc-¡ õºâtions¯3-forexample,à ëMfoldrº-forwhic¾9hfunctionalparameters¡ õºâareÝ·bAÇeingremo¾9vedÝ·iscalledtheëNtargetLÂgroupº. æAndafunc-¡ õºâtionTcon¾9tainingacalltoatargetgroupiscalledaëNsourceº.
õºâTheOxrestrictiononvÿ|ralidtargetsseemstobAÇethis:·thefunc-¡ õºâtionÍm¾9ustpassalongallfunctionalparametersunchangedin¡ õºâall~recursiv¾9ecalls.´ïGeneralisingthistodealwithmutually¡ õºârecursiv¾9eÃRtargetsrequiresthenotionofaëNconstan´CtU argu-¡ õºâmen´Ctßsetº. ¨Callinggarecursiv¾9egroupingeneralcausescalls¡ õºâwithin'thegroup, andaconstan¾9targumentsetgathersto-¡ õºâgether&margumen¾9tswhichareguaranteedtohavethesame¡ õºâvÿ|ralueTforev¾9erysub-call. pFÿ:«orexample,given¦ç¤ëMf¹xyz s,=fyyz+gzx¡ç¤g¹abæX=faba+gab¦ õºâºaæÔlittlethough¾9tshowsëMfº'sthirdargumentandëMgº's rstargu-¡ õºâmen¾9tsarealwaysthesame,µ{givingaconstantargumentset¡ õºâwritteng ëM{f.3,¹g.1}º.Afögroupcanha¾9veg morethanoneset,¡ õºâasTthefollo¾9wingtrivialexampleshows:¦ç¤ëMf¹xy s,=gxy¡ç¤g¹ab s,=fab¦ õºâºConstan¾9tmïargumentsetscanbAÇecomputedusingasimple¡ õºâabstractË>in¾9terpretationdescribAÇedbelo¾9w.¾Whatisimportan¾9t¡ õºâhere Iisthatforarecursiv¾9etargetgrouptobAÇespecialisable,¡ õºâallñbfunctionalparametersinthegroupm¾9ustbAÇeconstantar-¡ õºâgumen¾9ts.ýCertainµotherconstraintsalsoapplyÿ:«.ýWeµreturn¡ õºâtoTtheselater.
õºâTheTfollo¾9wingexamplebreaksournicescheme:¦ç¤ëMmap¹f[] Y=[]¡ç¤map¹f(x:xs) s,=fx:mapfxs¡¡ç¤addN¹nxs=map(+n)xs¦ õºâºFÿ:«oldingTandunfoldingasabAÇo¾9veTgives¦ç¤ëMaddN¹nxs=mapSpecxs¡¡ç¤mapSpec¹[] Y=[]¡ç¤mapSpec¹(x:xs) s,=(x+n):mapSpecxs¦ õºâºwhic¾9hÛisclearlywrongbAÇecauseëMnºisunde nedinëMmapSpecº.¡ õºâWhat?jw¾9eneedtodoispassalongallfreelambAÇda-bound¡ õºâvÿ|rariablesѸinthespAÇecialisingvalueëM(+¹n)ºasnewparameters,¡ õºâinTast¾9ylereminiscentoflambAÇda-lifting: åä22 8 ºâ ý? £ ý ûç¤ëMaddN¹nxs=mapSpecnxs¤
¡ûç¤mapSpec¹n[] Y=[]¡ûç¤mapSpec¹n(x:xs) s,=(x+n):mapSpecnxs©åíºâºNev¾9erthelessPØthisstillallowsustogetourknickersinatwist.¡íºâInd%thefollo¾9wing(admittedlycontrived)example,·Ùwemay¡íºâselectTeitherëMincºorëMgºasasourcetotransform rst:¦ûç¤ëMapply¹fx s,=fx¡ûç¤g¹ab Y=applyab¡¡ûç¤inc¹y Y=g(+1)y¦íºâºDoingTg rstgiv¾9es:¦ûç¤ëMapplySpec¹x s,=ax¡ûç¤g¹ab%Ì°=applySpecb¡¡ûç¤inc¹y%Ì°=g(+1)y¦íºâºNo¾9wmÅweneedtointroAÇducefreevÿ|rariablesofthespecialising¡íºâvÿ|ralueTëMaºasanewparametertoëMapplySpecº:¦ûç¤ëMapplySpec¹ax s,=ax¡ûç¤g¹ab/?Ü=applySpecab¡¡ûç¤inc¹y/?Ü=g(+1)y¦íºâºWhereupAÇonuitshouldbeeminen¾9tlyclearthatwe'veachieved¡íºâexactlyÀnothing!
µOurmistak¾9ewastoselectasourcefor¡íºâwhic¾9hçúthespAÇecialisingvÿ|raluehadfunction-valuedfreevari-¡íºâables,
since}åpassingthemasnewparameterstoëMapplySpec¡íºâºmeansõëMapplySpecºisstillahigher-orderfunction.ôPThemoral¡íºâisbTclear:¶qonlytransformsourcesforwhic¾9hthefreelambAÇda-¡íºâbAÇoundÒrvÿ|rariablesofthespecialisingvÿ|raluearenothigher-¡íºâorder.ÅA¿second¿Æob¾9viousconstraintonsourcecallsisthat¡íºâthe¿callshouldbAÇesucien¾9tlyappliedforallfunction-vÿ|ralued¡íºâparametersTtobAÇevisible.©
íºâIn5ïwhatfollo¾9ws,bwe5ïassumethatnamingissuesaredealtwith¡íºâcorrectlyÿ:«.T=In'îparticular,,thefreevÿ|rariablesinanspAÇecialising¡íºâvÿ|ralueÎneedtobAÇerenamedbeforetheycanbesafelyinserted¡íºâasTnewparametersofthespAÇecialisedtarget.¦íºâThe²4algorithmbAÇelo¾9wrequirestheprogramtobestrati ed¡íºâin¾9to øminimalmutuallyrecursivegroups,;áandtopAÇologically¡íºâsorted.%
Wÿ:«e2adopttheusualcon¾9vention2thattheprogram¡íºâisbIwrittentop-to-bAÇottom,uwithan¾9ygivenfunctionreferring¡íºâonlyotoitso¾9wngroup,«Ðifrecursive,«ÐandgroupsabAÇoveit.ðyThe¡íºâroAÇotTexpressionisrigh¾9tatthebottom.¦íºâSpAÇecialisation(oftargetgroupsma¾9yresultinsomegroups¡íºâbAÇecomingÐunreac¾9hablefromëMmainº.ãThesegroupsshouldbe¡íºâremo¾9ved.í4A°more°@dicultproblemisho¾9wtoinsertanew¡íºâgroup,ûÍresultingfromspAÇecialisationofanexistinggroup,¡íºâin¾9to theprogramsoastomaintaindepAÇendancyÿ:«.ÿ7Itturns¡íºâout ðthatt¾9wo ðdi erentbAÇehavioursarepAÇossible.?EIntheusual¡íºâcase,Tthenewgroup\splits"a¾9wayTfromthesourcegroup:åûç¤ëMletrecæXmap¹f[] Y=[]¡+'map¹f(x:xs) s,=fx:mapfxs¡ûç¤in¹let¡+'square¹x Y=x*x¡ûç¤in¹let¡+'squareList¹xs=mapsquarexs¡ûç¤in¹... ý õºâºSinceL®thespAÇecialisedtargetëMmapSpecºreferstoëMsquareº,
w¾9e¤
õºâm¾9ustplaceitafterëMsquareº.sKTÿ:«akingthisargumenttoits¡ õºâconclusionüEsho¾9wsweshouldplaceany\splitting"groupim-¡ õºâmediatelyTbAÇeforethesourcegroup:©ÐOç¤ëMlet!square¹x%Ì°=x*x¡ç¤in¹letrec¡3'mapSpec¹[] Y=[]¡3'mapSpec¹(x:xs) s,=squarex:¡4 mapSpec¹xs¡ç¤in¹let¡3'squarelist¹xs,Â=mapSpecxs¡ç¤in¹...¦ õºâºSourcesTgivingriseto\joining"spAÇecialisationsareun¾9usual:¦ç¤ëMletrecæXmap¹f[] Y=[]¡3'map¹f(x:xs) s,=fx:mapfxs¡ç¤in¹letrec¡3'squareList¹xs¡ATB=¹map(head.squareList.unit)xs¡ç¤in¹...¦ õºâºHere,~ theX8de nitionsofëM(.)º,ëMheadºandëMunitºareunimpAÇortan¾9t.¡ õºâBecause ºthespAÇecialisingvÿ|ralueëM(head.squareList.unit)¡ õºâºrefersz¶tothesourcegroupfromwhic¾9hitoriginates,there-¡ õºâsultingâáspAÇecialisationofëMmapºwillalsorefertoëMsquareListº,¡ õºâandâKthatinturnmeansthespAÇecialisationshouldbemerged¡ õºâin¾9toTthesourcegroup:¦ç¤ëMletrec¡fsquareList¹xs,Â=mapSpecxs¡fmapSpec¹[] Y=[]¡fmapSpec¹(x:xs) s,=(head.squareList.unit)x:¡g òmapSpec¹xs¡ç¤in¹...¦ õºâºSince{·onlyrecursiv¾9esourcegroupscanrefertothemselves,¡ õºâspAÇecialisationsBcorrespondingtosourcesinnon-recursiv¾9e¡ õºâgroupsTnev¾9erexhibitthis\joining"bAÇehaviour.5 õºâ¹5.3 G·AnLÎalgo¹rithmm õºâºThePùproAÇcedurebelo¾9wisrepeatedun¾9tilnomorevÿ|ralid(source,¡ õºâtarget)ÒpairscanbAÇefound.T9Assho¾9wnbyNelan[Nel
º],èthe¡ õºâorder) inwhic¾9hthesepairsareselectedmakesnodi erence.¡ õºâUn¾9usedÕtargetsshouldbAÇedeleted,°"butagainitdoesn'tmak¾9e¡ õºâan¾9yTdi erencewhen. pAsarunningexample,wetake:¦ ÿ.ëMletrec¡
ZÐmap1¹fg(x:y:xys) s,=fx:gy:map2gfxys¡
ZÐmap1¹fg_/?Ü=[]¡¡
ZÐmap2¹gf(x:y:xys) s,=gx:fy:map1fgxys¡
ZÐmap2¹gf_/?Ü=[]¡ ÿ.in¹let¡
ZÐaddmul¹pqxs!=map1(+p)(*q)xsÐO º1. :âFind&´avÿ|ralidtargetgroup,k andavalidsourcegroup¡ :âwhic¾9hTreferstothetargetgroup.ÌÍg¤ëMTarget¹group,Â={map1,map2}¡g¤Source¹group,Â={addmul},referstomap1 åäº23 Rè ºâ ý? £ ý ø º2.:âIfdthetargetgroupisrecursiv¾9e,£çcomputeitsconstant¤
:âargumen¾9t½Ðsets(seesection5.4).ãInrealityÿ:«,çîthiscom-¡:âputationÉ$hastobAÇeperformedatstep(1). 7áIfnon-¡:ârecursiv¾9e,¿$manufactureiûa\fak¾9e"singletonsetlisting¡:âallThigher-orderparametersasconstan¾9t.©ª_g¤ëMConst¹argsets s,={{map1.1,map2.2},¡pç\{map1.2,¹map2.1}}¦ø º3.:âIn¾9ventAanewsetofnamesforthespAÇecialisedtarget¡:âgroup.¦g¤ëMNew¹names s,={map1Spec,map2Spec}¦ø º4.:âDetermine,çfromÛltheconstan¾9targumentset,çwhichar-¡:âgumen¾9ts¿YinthesourcecallsitearethespAÇecialisingvÿ|ral-¡:âues.² ExtractG8theirfreelam¾9bAÇda-boundG8vÿ|rariablesand¡:ârename.¦g¤ëMOriginal:¡!:specialising¹values={(+p),(*q)}¡!:free¹variables Y={p,q}¡¡g¤Renamed:¡!:specialising¹values={(+pnew),(*qnew)}¡!:free¹variables Y={pnew,qnew}¦ø º5.:âRebuild½thesourcecallb¾9ydeletingthespAÇecialisation¡:âvÿ|ralues,Åninserting±tfreevariablesasnewparameters,Ånand¡:âc¾9hangingÀ+thecalledfunctiontoitsnewname,êáasde-¡:âterminedTinstep(3).¦g¤ëMRebuilt¹sourcecall s,=map1Specpqxs¦ø º6.:âBuild2vthespAÇecialisedtargetgroup,_Östartingwithacop¾9y¡:âof$theoriginaltargetgroup.JAFÿ:«oreac¾9hrecursivecall¡:âinsideTáthegroup,dÄmoAÇdifythatcallinasimilarw¾9ayTáto¡:âho¾9wTthesourcecallwasmoAÇdi edinstep(5).¦:âëMRebuilt¹targetgroup:¡¡g¤map1Spec¹pnewqnew(x:y:xys)¡ f=¹(x+pnew):(y*qnew):¡gt0map2Spec¹pnewqnewrest¡g¤map1Spec¹pnewqnew_¡ f=¹[]¡¡g¤map2Spec¹pnewqnew(x:y:xys)¡ f=¹(x*qnew):(y+pnew):¡gt0map1Spec¹pnewqnewrest¡g¤map2Spec¹pnewqnew_¡ f=¹[]¦ø º7.:âDetermineZgwhetherthespAÇecialisedtargetgroupshould¡:âsplit»orjoin,¦b¾9y ndingoutwhetherthespAÇecialisation¡:âvÿ|raluesfcon¾9tainedanyreferencetothesourcegroup.¡:âAugmen¾9tTprogramappropriatelyÿ:«.¦g¤ëMSpecialisation¹vals{(+p),(*q)}don't¡g¤refer¹to{addmul},sonewgroupsplits.âíºâºAqùvÿ|ralidrnon-recursiv¾9etargetgroupmustconsistofasingle¡íºâhigherHØorderfunction.¶ûAHÊvÿ|ralidrecursiv¾9etargetgroupsatis-¡íºâ esTallthefollo¾9wing: ý äëP :âºAllÚfunctionsinthegroupha¾9veÚatleastonefunctional¤
:âparameter.©8äëP :âºEac¾9h¤lfunctionalparameterinthegroupisamembAÇer¡ :âofsexactlyoneofthegroup'sconstan¾9targumentsets.¡ :âThis|impliesthatallin¾9tra-groupcallsmustbAÇesu-¡ :âcien¾9tlyTappliedtoexpAÇoseallfunctionalarguments.¦äëP :âºEac¾9h¦âconstantargumentsetmustmentionexactlyone¡ :âargumen¾9t¤Çforeachfunctioninthegroup.ÊÊThisdisal-¡ :âlo¾9ws'Úcertaincontrivedpathologicalcaseswhichwould¡ :âotherwiseTseriouslycomplicatethealgorithm.¤W õºâATvÿ|ralidsourcecallsitesatis esthefollo¾9wing:¡äëP :âºTheTsiteisacalltoavÿ|ralidtargetgroup.¦äëP :âºTheBpapplicationm¾9usthavesucientargumentstosup-¤
:âplyTallhigherorder(spAÇecialisable)argumen¾9ts.¦äëP :âºFÿ:«orÛ7eac¾9hspAÇecialisableargument,¯noneofthefree¡ :âlam¾9bAÇda-bound& vÿ|rariablesmaybAÇe,jNorcontain,jNafunc-¡ :âtionTspace.©W õºâAlthough/itloAÇokseasyonpaper,uqimplemen¾9tingthisalgo-¡ õºârithms3istric¾9kyÿ:«.6 Takings3intoaccountthemechanismsfor¡ õºâdetectingëbconstan¾9targumentsandmaintainingtypAÇeanno-¡ õºâtations, ÍtheèèHask¾9ellimplementationapproaches1500lines¡ õºâofTcoAÇde.*£ õºâ¹5.4 G·ComputingLÎconstanta¹rgumentsetsm õºâºAõ¦simpleõ®abstractin¾9terpretationisused.ãEachfunctioncall¡ õºâinkÏthegroupisabstractedtoexpAÇosetheparametersitpasses¡ õºâalong:¦ç¤ëMf¹xyz s,=fyyz+gzx¡ç¤g¹abæX=faba+gab¦ õºâºPhrasedTabstractlyÿ:«,thisbAÇecomes:¦ç¤ëMf:¹callsf[#2,#2,#3]¡fcalls¹g[#3,#1]¡¡ç¤g:¹callsf[#1,#2,#1]¡fcalls¹g[#1,#2]¦ õºâºNo¾9wè;weiteratetoa xedpAÇoint,ñ@gatheringacompletesetof¡ õºâtheopAÇossiblevÿ|raluesofeac¾9hargument.í$Thereisalistforeach¡ õºâfunction,£andeac¾9hlistcontainsasetofpAÇossiblevÿ|raluesfor¡ õºâeac¾9hTargument. pInitiallyÿ:«,eachargumentcanonlybAÇeitself:¦ç¤ëMF0¹=[{f.1},{f.2},{f.3}]¡ç¤G0¹=[{g.1},{g.2}]¦ õºâºA¾9tå¹eachiteration,ï?newapproximationsarecomputedbyus-¡ õºâingEÉtheabstractv¾9ersionsoffunctionstoloAÇokuppossible¡ õºâargumen¾9t\setsintheexistingapproximation.ð¥Also,m¿theex-¡ õºâistingTappro¾9ximationismergedinwholesale:¦ç¤ëMF1¹=F0U[{f.2},{f.2},{f.3}]¡)´TU¹[{g.1},{g.2},{g.1}]¡f=¹[{f.1,f.2,g.1},{f.2,g.2},{f.3,g.1}]¡¡ç¤G1¹=G0U[{f.3},{f.1}] åäº24 i ºâ ý? £ ý !´TëMU¹[{g.1},{g.2}]¤
f=¹[{f.3,g.1},{f.1,g.2}]¡¡ûç¤F2¹=F1U[{f.2,g.2},{f.2,g.2},{f.3,g.1}]¡+'[¹{f.3,g.1},{f.1,g.2},{f.3,g.1}]¡
f=¹[{f.1,f.2,f.3,g.1,g.2},¡ ú¾{f.1,¹f.2,g.2},{f.3,g.1}]¡¡ûç¤G2¹=G1U[{f.3,g.1},{f.1,f.2,g.1}]¡!´TU¹[{f.3,g.1},{f.1,g.2}]¡
f=¹[{f.3,g.1},{f.1,f.2,g.1,g.2}]©YíºâºEv¾9entuallyg<thisproAÇcessstabilises,{¶givingthefollo¾9wingpos-¡íºâsibleTargumen¾9tvÿ|ralues:¦ûç¤ëMf.1 s,could¹havevaluef.1,f.2,f.3,g.1,g.2¡ûç¤f.2 s,could¹havevaluef.1,f.2,f.3,g.1,g.2¡ûç¤f.3 s,could¹havevaluef.3,g.1¡ûç¤g.1 s,could¹havevaluef.3,g.1¡ûç¤g.2 s,could¹havevaluef.1,f.2,f.3,g.1,g.2¦íºâºSoE3w¾9ehavetwocandidateconstantargumentsets:¡íºâëM{f.1,¹f.2,f.3,g.1,g.2}ºandëM{f.3,¹g.1}º.d{Wÿ:«ereject¡íºâthe` rstbAÇecauseitdoesnotmen¾9tioneachfunctionexactly¡íºâonce.DeducingëthatëM{f.1,¹f.2,f.3,g.1,g.2}ëºisacon-¡íºâstan¾9tÉargumentsetiscorrect,Ø¿butonlyundertheconditions¡íºâthat,Êñfor¸Xtheinitialcallin¾9tothegroup,ëMf.1¹==f.2==f.3º,¡íºâif^UëMfºw¾9ascalled,porëMg.1¹==g.2^UºforaninitialcalltoëMgº.÷sThis¡íºâlea¾9vesëM{f.3,¹g.1}ºasthesoleconstan¾9targumentsetforthis¡íºârecursiv¾9eTgroup.
íºâA#¥glaring#â
a¾9wistheinabilitytoabstractfunctioncallswhich¡íºâdo an¾9ythingmorethanpassparametersunchanged.ZInthis¡íºâcase,ë¢aá5spAÇecialvÿ|ralueëMUnknownºisusedtodenotethatw¾9ecan-¡íºânotbAÇesurewhatthevÿ|ralueofthisargumen¾9tis.ù±Fÿ:«orexample¦ûç¤ëMf¹xy=fx(y+1)+fyx¦íºâºabstractsTto¦ûç¤ëMf:¹callsf[#1,Unknown]¡
fcalls¹f[#2,#1]¦íºâºDuringç xpAÇoin¾9ting,EÊëMUnknownºannihilatesanyothervÿ|raluesina¡íºâset.ÐFÿ:«or;Éexample,EfasetëM{f.1,¹g.2,Unknown};ɺisequivÿ|ralen¾9t¡íºâsimplytoëM{Unknown}º.îëMUnknownºrepresen¾9tsanargumentof¡íºâuncertain\Êorigin,n¨sow¾9edisallowanyconstantargumentset¡íºâcon¾9tainingTit.¥íºâ¹5.5G·PreservingLÎt¹ypFfeannotationsmíºâºSincegAnnaw¾9orkswithtypAÇeannotatedCoreexpressions,¡íºâw¾9eÅòneedtogotoalittletroubletotransformtheannota-¡íºâtions-gtoAÇo.dªA¾9t rstglance,3lthislookslik¾9easimplematterof¡íºâmoAÇdifyingFhfunctiont¾9ypespertainingtospecialisedfunctions,¡íºâb¾9yÉdeletingtypAÇesofspecialisedargumen¾9tsandinsertingthe¡íºât¾9ypAÇesJoffreevÿ|rariablesbeingpassedasextraparameters.¡íºâThis.isindeedcorrect,M¤butthere'smoretoit. þRecallthe¡íºâpreviousTde nitionofëMfoldrº. pThet¾9ypAÇecheckerTinfers:¦ûç¤ëMfoldr¹::(a->b->b)->b->[a]->b¦íºâºGiv¾9en[)Ltheusual¡íºâHask¾9ell!de nitionofëM(++)¹::[c]->[c]->[c]º,dw¾9ecan¡íºâde ne ý ç¤ëMconcat¹=foldr(++)[]¤ÐO õºâºwhic¾9hTspAÇecialisesto:¡ç¤ëMfoldrSpec¹a[] Y=a¤
ç¤foldrSpec¹a(x:xs) s,=x++foldrSpecaxs¡¡ç¤concat¹=foldrSpec[]ÐO õºâºMerelyXaddinganddeletingargumen¾9ttypAÇesgivesëMfoldrSpec¡ õºâºann`apparen¾9ttypAÇeëMb¹->[a]->bº,¢whichn`istoAÇogen-¡ õºâeral. !Wÿ:«e»äneedtounifythet¾9ypAÇeofspecialisingvÿ|ralue¡ õºâëM(++)º,ÑëM[c]¹->[c]->[c]Þ½ºwiththet¾9ypAÇeofthefunc-¡ õºâtionalãparameteritreplaces,×BëMa¹->b->bº,andãapply¡ õºâthe¡EresultingsubstitutionëM{a¹->[c],b->[c]}¡Eºtothe¡ õºâannotationsòonëMfoldrSpecº.´0Thisgiv¾9esëMfoldrSpec¹::¡ õºâ[c]¹->[[c]]->[c]º,Tasrequired.©
õºâSuc¾9h+trickeryshouldnotcomeasacompletesurprise.öAf-¡ õºâterÁall,Â\theMilner-Hindleyt¾9ypAÇerulesforanapplicationof¡ õºâëMf¹::(T1->T2)-!ºtoëMa¹::T3-!ºrequireuni cationofëMT1ºwith¡ õºâëMT3º. pThat'sTe ectiv¾9elywhatisgoingonhere.¦ õºâThe]Àneedtopreserv¾9etypAÇeannotationsisama jornuisance¡ õºâfromû°theimplemen¾9tationviewpAÇoint,5Gbecauseû°moretimeis¡ õºâspAÇen¾9tgqin xinguptypAÇesthandoingthetransformation¡ õºâpropAÇer.àWÿ:«orkaâtoimpro¾9veaâeciencyisapriorit¾9y.àThesc¾9heme¡ õºâdescribAÇedhabo¾9veisa rstimplementationinwhichcorrect-¡ õºânessTw¾9asmoreimpAÇortantthaneciencyÿ:«.©5 õºâ¹5.6 G·Monomo¹rphisationm õºâºByÝcomparisonwith rsti cation,«\monomorphisationissim-¡ õºâple.;÷Monomorphisation Öisat¾9wo-phase ÖproAÇcess.The rst¡ õºâpassJfconductswhatamoun¾9tstoadepth- rstsearchfrom¡ õºâëMmaind©ºtodisco¾9verd©allrequiredinstances.
nThesecondpass¡ õºâclonesÁ×coAÇde,,÷c¾9hangesfunctionnamesaccordinglyandre-¡ õºâstoresTdepAÇendancyorder.¦ õºâ¹5.6.1úíCollectingLÎtheinstancesm õºâºIõÓamö
indebtedtoMarkJonesforsuggestingthefollo¾9wing¡ õºâalgorithm.GYWÿ:«ex÷carryasetëMinstancesºtoaccum¾9ulatethe¡ õºâev¾9entualg|result,¼andastac¾9këMtoVisitºrecordingplaceswe¡ õºâneedÒLtovisit.Elemen¾9tsofëMinstancesºandëMtoVisitºarepairs¡ õºâofz(functionname,ôCt¾9ypAÇeexpression)specifyingaparticu-¡ õºâlarCinstanceofafunction.§8Thet¾9ypAÇeexpressionsarealways¡ õºâmonomorphic.
õºâSinceB
ëMmainºma¾9ybAÇeofanytypAÇe,Í6wetriviallymonomor-¡ õºâphise£zitb¾9ysubstitutinganytypAÇevÿ|rariableswithëMIntº.ÆáThis¡ õºâgiv¾9es ªasingleinitialvÿ|ralueforëMtoVisitº,! withëMinstancesºini-¡ õºâtiallyH bAÇeingempt¾9yÿ:«.´The nalvÿ|ralueofëMinstancesºisthen¡ õºâëMsearch(instances,¹toVisit)º,Twhere:ÐO õºâëMsearch(instances,¹toVisit)¡ç¤=¹ifæX[toVisitisempty]¡
ZÐthen s,instances¡
ZÐelse¡
ZÐlet,Ânext¹=headtoVisit¡
ZÐinæXifnext¹`elem`instances¡F
Ø[We've¹alreadybeenhere]¡
ZÐthen s,search(instances,¹tailtoVisit)¡
ZÐelse s,[Get¹thefunctionspecifiedbynext.¡.mêFind¹outwhatinstancesofother åäº25 ~ ºâ ý? £ ý &mêëMfunctions¹arecalled. s,Addthese¤
&mêinstances¹to(tailtoVisit)giving¡&mêtoVisitAug,¹andthendo]¡&mêsearch({next}¹Uinstances,toVisitAug)¤zÁíºâºFÿ:«orTexample,giv¾9en¡ûç¤ëMid¹x s,=x¤
ûç¤f¹x,Â=idx¡ûç¤main s,=¹id42+ord(f'c')¤zÁíºâºtheTalgorithmrunsthroughthesestates:¡
fëMinstancesYÆ"toVisit¤
íºâ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~¡íºâ{}zÙ<[(main,¹Int)]¡¡íºâ{(main,¹Int)}FßÊ[(id,,ÂInt->Int),¡vÀà(f,æXChar¹->Char)]¡¡íºâ{(main,¹Int),FßÊ[(f,æXChar->Char)]¡òtx(id,,ÂInt¹->Int)}¡¡íºâ{(main,¹Int),FßÊ[(id,,ÂChar->Char)]¡òtx(id,,ÂInt¹->Int),¡òtx(f,æXChar¹->Char)}¡¡íºâ{(main,¹Int),FßÊ[]¡òtx(id,,ÂInt¹->Int),¡òtx(id,,ÂChar¹->Char),¡òtx(f,æXChar¹->Char)}zÁíºâºThisgiv¾9estwoinstancesforëMidº.ÜBecausetheabstractinter-¡íºâpretation´oft¾9ypAÇesmapsbothëMIntºandëMCharºtothet¾9wo´point¡íºâdomain,¥onlyÓ.oneofthoseinstancesisneededforanalysis¡íºâpurpAÇoses.ú In_9general,±²w¾9ecanexploitthefactthatmany¡íºâdi eren¾9t@RtypAÇesareassignedthesamedomaintoreducethe¡íºâprogram±expansioncausedb¾9ymonomorphisation.Fÿ:«arand¡íºâa¾9wayètheeasiestw¾9ayètodothisistotransformthet¾9ypAÇean-¡íºânotationsñntodomainannotationsbAÇeforemonomorphisation,¡íºâusingùýtheresultsofsection2.2.5.ST¾9ypAÇevÿ|rariablesaresimply¡íºâreplacedTb¾9ydomainvÿ|rariables.òëíºâ¹5.6.2 úíCloningLÎcoFfdemíºâºThis¨èisfairlytrivial.×+Eac¾9hfunctionisduplicatedoncepAÇer¡íºâinstance,ܶwith´Öappropriatenewnames.úõThefunctionbAÇod-¡íºâies#\ha¾9vetheircallsitesmoAÇdi edtorefertoappropriately¡íºânamed_2instancesinpreviousgroups,qªandthisone,ifrecur-¡íºâsiv¾9e.\ThenÐthebAÇodiesÐhavethetypAÇevÿ|rariablesintheiranno-¡íºâtationsçãsubstitutedappropriatelyforeac¾9hdi erentinstance¡íºârequired.¶eTheûen¾9tireprogramcanbAÇeprocessedinasingle¡íºâtop-to-bAÇottomTpass.©
íºâTheËonlysligh¾9tlytrickyproblemisrebuildingrecursive¡íºâgroups0soastomain¾9taindepAÇendancyÿ:«.For0non-recursive¡íºâclones,/thisÃ
iseasyÿ:«,butbAÇecauseoftheexistanceofcer-¡íºâtain2Äcon¾9trivedrecursivefunctions,: maintainingdepAÇendancy¡íºâinó«therecursiv¾9ecasecanbAÇecomplicated.·vWÿ:«eavoidthese¡íºâproblems"db¾9ylumpingalltheclonesarisingfromarecursive¡íºâfunctionÿgroupin¾9toasingleëMletrecº,:andpassingthepro-¡íºâgramTathirdtimethoughthedepAÇendancyanalyser.¦íºâDespite8hthesecomplications,,themonomorphiserisex-¡íºâtremelyaÞquic¾9kanddoAÇesnotproveasigni cantlimitation¡íºâonTpAÇerformance. ý õºâ¹6Discussion´ õºâºThisÙÎsectiondra¾9wstogetherthedetailedtechnicalthreads¤
õºâexpAÇoundedinthepreviousthreesections,b¾9ypresenting¡ õºâsomeäkpAÇerformanceresults,1andlookingatrelatedandfur-¡ õºâtherÈxw¾9ork.5ÜButwebAÇeginbyloAÇokingatsomeperformance¡ õºâissues.t õºâ¹6.1 G·PuttingLÎitalltogetherm õºâºThro¾9wing°realisticallysizedprogramsattheanalyserre-¡ õºâv¾9ealed½psomepAÇerformanceproblemswhichweretracedto¡ õºânicetiesXüinthein¾9terfacebAÇetweentheabstractinterpreterand¡ õºâtheTtermrewriter.©
õºâP¾9erformanceòrproblemsappAÇearwhenthetermrewritingsys-¡ õºâtemu,isfedagigan¾9tictermtosimplifyÿ:«.;ùUsually,"suchu,terms¡ õºâreduce-tosomethingquitetrivial.eHItisimpAÇortan¾9ttorealise¡ õºâthat}0theabstractin¾9terpreterwillgenerateabsolutelyenor-¡ õºâmousúUterms,3espAÇeciallyfromsourcetextwhic¾9hhasdeeply¡ õºânestedBÊfunctioncallsordeeplynestedëMcaseºexpressions,læbAÇoth¡ õºâofËwhic¾9harequitecommon.>÷Fÿ:«orexample,ù thebiggerpro-¡ õºâgrams2men¾9tionedinsection6.2generatedtermswhich,_êwhen¡ õºâprett¾9y-printed#inthest¾9yleusedinthispapAÇer,&coveredliter-¡ õºâallyTtensofA4pages.¦ õºâAnalysis²¾ofaprogramproAÇceedsasfollo¾9ws.ôFirst,Úthepro-¡ õºâgramLispassedinitsen¾9tiretyLthroughtheabstractin¾9ter-¡ õºâpreter,0generatingÄ«acorrespAÇondingcollectionofrecursiv¾9e¡ õºâequations\õ(orterms).óTTheseequationsareh¾9ugelyredun-¡ õºâdan¾9t`Ðandaresimpli edindividuallyÿ:«,³®withoutreferenceto¡ õºâeac¾9hnother.¾Finallyÿ:«,òôthe xpAÇointingsystemtravelsalong¡ õºâthe_úgroupsofequations,²£accum¾9ulatinganenvironmentof¡ õºâ\solv¾9ed"Ìequations.¦×Aªsolvedequationisself-contained:#_it¡ õºâdoAÇes2ònotrefertotheabstractin¾9terpretationofanyother¡ õºâfunction.ëÌSolvinggnon-recursiv¾9eequationsisasimplematter¡ õºâofÊ\substitutingintheabstractin¾9terpretationsofotherfunc-¡ õºâtions, 7andÖsimplifying.,öFÿ:«orrecursiv¾9efunctions,thisstageis¡ õºâfollo¾9wedTby xpAÇointing.¦ õºâWhatÐreallyruinspAÇerformanceisnot xpoin¾9ting,C.butthe¡ õºâinitialúsimpli cationoftermswhic¾9hemergefromtheab-¡ õºâstractèein¾9terpreter.¤Thisproblemwaslargelyalleviatedby¡ õºâgivingwªtheabstractin¾9terpreteralittlemoreintelligence,?in¡ õºâtheTformof:îtäëP :âºThe#t¾9ypAÇe-speci cëMAbsValºrewritesdescribedinsec-¡ :âtionT4.6.BFäëP :âºAëkno¾9wledgeIofkeyëMContextºrewriterules.]PInpar-¡ :âticular,~9the6 rulesforëMcaseºstatemen¾9tsgeneratelarge¡ :âexpressions xin¾9volvingëMCMeetº,"ëMCJoinº,ëMStop1ºandëMStop2º.¡ :âAÔhandfulÔyofrulesem¾9bAÇodyingÔysimplefactssuchas¡ :âëMCMeet¹[...Stop2...]==Stop2Tºw¾9ereadded. ¡# :âBet¾9weenYêthem,gthesizesoftermsgeneratedw¾9eresome-¡ :âtimesÙcutb¾9ytwoordersofmagnitude,JandpAÇerfor-¡ :âmanceTw¾9asmuchimproved.îu õºâAmsecondm±pAÇerformanceproblemw¾9astracedtotheinitialsim-¡ õºâpli cationM²oftermsemergingfromtheabstractin¾9terpreter.¡ õºâThese=¬termsaresimpli edwithoutreferencetoeac¾9hother.¡ õºâItïÚturnsouttobAÇebettertosimplifyatermonlywhen¡ õºâw¾9eñxknowthesolvedvÿ|raluesoftheothertermsitrefersto,¡ õºâbAÇecauseVkno¾9wingthesevÿ|raluesmakesthe naltermmuch¡ õºâsmaller.ÑIn§e ect,Ëpthisisac¾9hieved§simplyb¾9yomittingthis¡ õºâsimpli cation?Wpassaltogether.zFÿ:«oratleastoneinput,IØanal-¡ õºâysisTtimew¾9ascutbyafactorof ve. åä26 d ºâ ý? £ þ ¦d¸lÎíºâ´S4 fföÌ̤ÿþÌÍ Ù Ù ff32àÐÍ ffÍF§¡
fffg
ff6ý
ffX¦G
fffg
ffz3ñºFÿ:«orTacompleterun Zw
fffg
ff ýIAnalysisTonlyV
fffg
ffW5áCompilingTwithëMghc-0.10 }
fffg
ff¤fhZ¦G ffr `¤
fffg
ff33üÿþºProgramH³¡
ff>2Lines33
fffg
ffkg&Time33
ff ÚClaim33
ff Ê|´Space33
fffg
ff ùTime33
ff++SClaim33
fffg
ff[FwTime33
ff{%äanalysisTtimeas%33
fffg
ff¡ ffÍF§ÿþ
fffg
ff6ý
ffX¦G
fffg
ff
¬ú
ff º[
ff æÐÀ
fffg
ff×s
ffH
fffg
ffuK
ffËF§
fffg
ff¤
¤
fffg
ff33üÿþconcat0¡
ff?ì ëO<Tº1033
fffg
ffiL©0.42Ts33
ff 1.485TM33
ff É4´47.2Tk33
fffg
ff ÷w"0.18Ts33
ff"±0.586TM33
fffg
ffY+ú0.92Ts33
ff²Ò19T%33
fffg
ff¡¤
fffg
ff33üÿþzip3 ô
¡
ff?ì ëO<Tº1033
fffg
ffiL©0.52Ts33
ff 1.793TM33
ff É4´56.1Tk33
fffg
ff ÷w"0.17Ts33
ff"±0.570TM33
fffg
ffY+ú1.00Ts33
ff²Ò17T%33
fffg
ff¡¤
fffg
ff33üÿþw¾9ang Ó¡
ffE38533
fffg
ffd¬«23.62Ts33
ff æ85.396TM33
ff Ķ908.8Tk33
fffg
ff ÷w"9.15Ts33
ff
15.861TM33
fffg
ffTü43.61Ts33
ff²Ò21T%33
fffg
ff¡¤
fffg
ff33üÿþw¾9ave4main¡
ffE61933
fffg
ffd¬«43.40Ts33
ff F116.207TM33
ff ¿ô¸2897.7Tk33
fffg
ff ò×$21.62Ts33
ff
43.239TM33
fffg
ffOëþ199.29Ts33
ff²Ò11T%33
fffg
ff¡¤
fffg
ff33üÿþag2hs¼:¡
ff@ó 104733
fffg
ff` 208.95Ts33
ff F275.245TM33
ff ¿ô¸9653.8Tk33
fffg
ff î7&126.42Ts33
ffq 135.335TM33
fffg
ffOëþ100.68Ts33
ffhÔ126T%33
fffg
ff¡
fffg
ff6ý
ffX¦G
fffg
ff
¬ú
ff º[
ff æÐÀ
fffg
ff×s
ffH
fffg
ffuK
ffËF§
fffg
fffh ffÍF§EÌÌ ¸/Tÿ:«ableT2: pSomepAÇerformance guresforëNAnna
öff Ù ff @ fföÌÌ öY þ%¦díºâ¹6.2G·AbsoluteLÎpFferfo¹rmanceresultsmíºâºFiv¾9eÿWtestprogramswereused.ÚxThe rsttwo,9×ëMconcatºand¤
íºâëMzip3º,Zareutterlytrivialandw¾9ereincludedascomparison¡íºâagainstÛì gurespresen¾9tedin[Sew93/].p7ëMwangºandëMwave4main¡íºâºareHtak¾9enfromPieterHartel'sbAÇenchmarksuite[HL92÷l].íThe¡íºâbiggest²one,ÙíëMag2hsº,ispreproAÇcessorforadialectofHask¾9ell¡íºâaugmen¾9tedðwithattributegrammar[Joh87Ä9]facilities,¥Öwrit-¡íºâtenÃb¾9yDavidRushall. %Theanalyserwascompiledwith¡íºâChalmersÙîHask¾9ell-BÙ»0.999.4, with
agsëM-fpbu¹-Oº,andrun¡íºâusingèçaneigh¾9tmegabyteheapforallexceptëMag2hsº, Ëwhich¡íºârequired~¢asixteenmegab¾9yteheap.XYA~generationalgarbage¡íºâcollectorW×w¾9asemployed.ãøTÿ:«estswererunonalightlyloaded¡íºâSun¨Sparc10/31,¤Ëandeac¾9htestwaspAÇerformedatleastthree¡íºâtimes. pTimesTareuserCPUseconds.©
íºâSimplyà measuringo¾9verallà runtimesisnotparticularlyhelp-¡íºâful,mbAÇecause[w¾9ereallywanttoestablishhowexpAÇensivethis¡íºâanalyser¢w¾9ouldbAÇeifemployedinaHaskellcompiler.|ZIt¡íºâseemsv²reasonabletoconsiderthe\bAÇorder"bet¾9weenv²thefron¾9t¡íºâend andtheanalyseritselfasthepAÇoin¾9twherethetypAÇe-¡íºâc¾9heckerØÁproAÇducesat¾9ype-annotatedCoretree,äÞsince,atØÁleast¡íºâinq±Glasgo¾9wHaskell,ÈÈthecompilerproAÇducesthistreeany-¡íºâw¾9ayÿ:«.Sowepresent guresnotonlyforacompleterun,but¡íºâalso §fortheanalysisphasepropAÇer.6Thelattercategoryco¾9v-¡íºâersÇ_ rsti cation,Öömonomorphisation,abstractin¾9terpretation¡íºâand¼ xpAÇoin¾9ting,DÛallofwhicharelegitimateanalysisexpAÇenses.¦íºâTÿ:«o assesswhetherornotw¾9eareapproachingtherightball-¡íºâpark,C§w¾9e;timedGlasgowHaskell0.10compilingtheprograms¡íºâin¾9to®*C,andcomparedthosetimeswiththeanalysisphase¡íºâtimeá^ofAnna. Thecompileroptionsw¾9ereëM-O2¹-Cº.Compiler¡íºâsemispace¡sizesw¾9ere3megabytesforthesmalltwo,ªsand8¡íºâmegab¾9ytes¸¡forthebigthree:c thisturnedouttobAÇeplentyÿ:«.¡íºâThe¢timesrepAÇortedforGlasgo¾9wHaskellareforthecompiler¡íºâpropAÇer,£(thatis,thatpartofthecompilerwhic¾9hisitselfwrit-¡íºâtenfinHask¾9ell,ëandwhichtranslatestheoutputoftheYÿ:«acc¡íºâparserTin¾9toC.¦íºâTÿ:«able¿À2presen¾9tsthe gures.µThemaximumresidency g-¡íºâures½w¾9ereobtainedusingacopyingcollectorwithheapsizes¡íºâset¯onlyjustbigenough.êðThisquan¾9tity¯isomittedforthe¡íºâanalysis-only° guresbAÇecauseofthedicultiesofdeciding¡íºâon Èho¾9wtodividespaceexpAÇensesbet¾9ween Èthefron¾9tendand¡íºâtheTanalysisphase.¦íºâFÿ:«or¯{thebigthree,Ötimesare,v¾9eryroughlyÿ:«,dividedequally¡íºâbAÇet¾9weenâÿthefron¾9tendandanalysisphases. ©ëMag2hsºhasarel-¡íºâativ¾9elyØlargeanalysistimeincomparisontoitssize.f
This¡íºâis4bAÇecauseitmak¾9esconsiderableuseoflazypatternmatch-¡íºâing,FÆwhic¾9h °translatestoalargequantityofcomplexCore þ%¦d õºâexpressions.ÓìTheseR}inturngeneratesomelarge,¡Çcomplex¤
õºâsets(zofequationsforthe xpAÇoin¾9tertosolve.UâA(3technique¡ õºâmen¾9tioned9ìinsection6.4mighthelphere.9Fÿ:«orthelarger¡ õºâproblems,¢spacex4consumptionisofconcern.èMuc¾9h,ifnotthe¡ õºâma jorit¾9yÿ:«,©@of«thespaceusedisrelatedtofront-endproAÇcess-¡ õºâing,+andfitseemslik¾9elythattheanalysisitselfisrelatively¡ õºâc¾9heapÞonspace.¶Fÿ:«urtherinvestigationwithaheappro ler¡ õºâisTnecessaryÿ:«.©
õºâThe±resultsofcomparinganalysistimewitharunofGlasgo¾9w¡ õºâHask¾9ellUeonthesameprogramareintriguing.ÜvThetestsareat¡ õºâleastøfairinthesensethatbAÇothAnnaandtheHask¾9ellcom-¡ õºâpilerÄarewritteninHask¾9ell,
{soneitherhasanunfairadvÿ|ran-¡ õºâtage.ñàJust£b¾9ythemselves,¯-itisalittleunusualthatëMghcºcom-¡ õºâpiledÍëMag2hsºinalmosthalfthetimeittoAÇokforëMwave4mainº.¡ õºâIt+ma¾9ybAÇethattheheavyuseofnumericoverloadinginëMwang¡ õºâºandµëMwave4mainºhasslo¾9wedµdownëMghcºasitwillhavehad¡ õºâtoîûgenerateandoptimiselargequan¾9titiesofdictionaryhan-¡ õºâdlingbdcoAÇde.àËëMag2hsº,.b¾9ycomparison,ismostlystringhandling:¡ õºâthereÜÌislittleo¾9verloadingÜÌinit.rÙAnnahasanaiv¾9eviewof¡ õºâtheÐKHask¾9ellnumbAÇers{itonlyknowsabAÇoutëMIntº,ÿsoitwill¡ õºânot)ôha¾9veseenanysuchnumericoverloading.ZQInorderto¡ õºâmak¾9e¨Annaacceptthesetwoprograms,Ëwehadtostripout¡ õºâtheäextensiv¾9etypAÇesignatureswhichhadbAÇeenplacedthere¡ õºâexpresselyvxtoeliminaten¾9umericoverloading.?ÝThesefactors¡ õºâma¾9y8·wellhaveconspiredtogiveAnnaaremarkÿ|rablygoAÇodrel-¡ õºâativ¾9e#showingforëMwangºandëMwave4mainº,§Walthoughitishard¡ õºâtoÂèbAÇeliev¾9etheyaccountforallthedi erencebAÇetween11%¡ õºâ(ëMwave4mainº)Tand126%(ëMag2hsº).¦ õºâBecause½ëMwangºandëMwave4mainºaremac¾9hine-generated¡ õºâHask¾9ell,LJtheALexpressionsinthemarereasonablysimpleand¡ õºâsmall.·By8Ácomparison,Athedesugaredv¾9ersionofëMag2hsºcon-¡ õºâtainedusomev¾9erylargeexpressionsandsomequitecompli-¡ õºâcated-±structuredt¾9ypAÇes.eWÿ:«atching-±thebeha¾9viourofAnna¡ õºâonÞ³thisexample,é itisclearthatthema jorit¾9yoftheanalysis¡ õºâtimeJïisspAÇen¾9t xpoin¾9tingasinglelargegroupofaboutt¾9wenty¡ õºâfunctionsµÀwhic¾9harosefromtheextensiveuseoflazypattern¡ õºâmatc¾9hing.~ÀIt6seemsplausiblethatthisparticulargroupdid¡ õºânotãcausean¾9ysimilardicultytoëMghcº,¾ÇanditmayalsobAÇe¡ õºâpAÇossiblex£thatëMghcº'sdesugarerdidabetterjobthanAnna's¡ õºâinqCtranslatingthepatternmatc¾9hing.0<Nevertheless,>theqCdis-¡ õºâparit¾9yçinrelativeanalysis/compilecostsbAÇetweenëMag2hsºand¡ õºâtheòÔothert¾9woòÔbigexamplesisaw¾9arningthatweshouldnot¡ õºâread¡\toAÇom¾9uch¡\intothesemeasurementsbAÇeyondthepAÇerhaps¡ õºâhearteningò]conclusionthatw¾9eareindeedapproachingthe¡ õºârigh¾9tTballparkforanalyserpAÇerformance. åä27 ´ ºâ ý? £ ý íºâ¹6.3G·RelatedLÎw¹orkmíºâºMycroft'sò originalw¾9ork[Myc80¸|]onapplyingabstractinter-¤
íºâpretationûÍtotheanalysisoffunctionalprogramsspark¾9edo ¡íºâin¾9tense[éworkonforwardanalyses.Þ¢A[¹forwardstrictnessanal-¡íºâysiskktellsusthede nednessofafunctionapplicationgiv¾9en¡íºâthe±¿de nednessoftheargumen¾9ts.û>LandmarkpapAÇersinclude¡íºâthe*Burn-Hankin-Abramskyw¾9ork[BHA85 ¬b]whichputhigher¡íºâorderanalysisona rmtheoreticalfoAÇoting,TPandWÿ:«adler's¡íºâpapAÇerÌÓ[Wÿ:«ad87¿]whic¾9hshowedhowonemightdealsensibly¡íºâwith.sum-of-proAÇductst¾9ypes.èýImplementors.madem¾9uch.of¡íºâ nding¤ xpAÇoin¾9tsusingtheFÿ:«rontiersalgorithm,º¼massagingit¡íºâextensiv¾9elymètodealwithhigherorderfunctions[HH91 >],esum-¡íºâof-proAÇducts~#t¾9ypes[Sew91/]andpolymorphism[Sew93/].VÜDe-¡íºâspiteѽthisandothertric¾9keryѽ[HH92 >][Sew92/],ßBfron¾9tiersfailed¡íºâto deliv¾9erusablepAÇerformanceforhigh-de nitionstrictness¡íºâanalysispäforan¾9ythingotherthantrivialinputs,Èandthereare¡íºâgoAÇod¬õtheoreticalreasonsforbAÇelievingthesituationcannot¡íºâbAÇeTimpro¾9ved.©
íºâStarting{ataroundthesametime,íanothersc¾9hoAÇolofthought¡íºâw¾9asþÐdevelopingbackwards,Qorpro jection,analyses.ïAþÊbac¾9k-¡íºâw¾9ards·analysisshowshowthesemanticquantityinquestion¡íºâ-Jphere,W·demandforevÿ|raluation-propagatesfromafunction¡íºâapplication@totheindividualargumen¾9ts.Õ\Hughes[Hug90ó']ar-¡íºâgues¼Ûthatbac¾9kwards¼Ûanalysesareinheren¾9tlymoreecient¡íºâthanU[forw¾9ardones,e]bAÇecausethefunctionspaceswithwhich¡íºâthe¯Àanalysesdealaresmallerinthebac¾9kwards¯Àcase.úPro jec-¡íºâtionêãanalysisdealseasilywithsum-of-proAÇductst¾9ypes, Gand¡íºâcapturesÔZcertainpropAÇerties,Dsuc¾9hashead-strictness,that¡íºâseemtoeludeforw¾9ardanalyses.¶AãgoAÇodreferenceforpro-¡íºâjectionÞanalysisis[WH87±].v¯Laterw¾9orkshowedhowtodo¡íºâmak¾9e+únon-
atpro jectionanalysispAÇolymorphic[Hug³+],q¤and¡íºâaÚñsuccessfulnon-
at, WpAÇolymorphicpro jectionanalyserw¾9as¡íºâbuiltTin¾9toGlasgowHaskell[KHL91 (Ô].¦íºâDespiteãÔthesesuccesses,tpro jectionanalysesha¾9veãÔafunda-¡íºâmen¾9tal #inabilitytodealwithhigherorderfunctions.÷ÞFÿ:«ol-¡íºâlo¾9wingËtheleadofWÿ:«ray[Wÿ:«ra85:C],ù.Hughesde nedamixed¡íºâanalysisô|whic¾9hwasforwardsforthehigherorderbitsand¡íºâbac¾9kwardsSforev¾9erythingelse[Hug87ó'].×Doingthisgivesan¡íºâanalysisr+whic¾9hdealswithhigher-ordernesswhilstretaining¡íºâtheäinheren¾9teciencyofbackwardanalysis.íKRecentlyÿ:«,¤.other¡íºâw¾9orkersÌQhavebAÇeguntoexploretherelationshipbet¾9weenfor-¡íºâw¾9ardÒÉandbackwardanalysis[Bur90ã][HL90÷l][DW90N].TÐThe¡íºâanalysis³ÁdescribAÇedinthispaperisamodi cationofHughes'¡íºâoriginalTmixedanalysis.¦íºâMean¾9while,=pAÇeoplexhavebAÇeenlookingatotherw¾9aysofsolv-¡íºâingvÝrecursiv¾9edomainequations.A TherehasbAÇeenadiscern-¡íºâableJshiftto¾9wardsJtermorien¾9tedapproaches.»üFÿ:«ergusonand¡íºâHughesö#dev¾9elopAÇed\concretedatastructures"(CDSs)[ëN?sº]¡íºâbased7
onCurien'sw¾9orkonsequentialalgorithms[Cur86¯õ].¡íºâCDSsÎdealwithhigher-ordernessb¾9yregardingahigheror-¡íºâder#%functionascon¾9tainingaCDS#!interpreterforeachfunc-¡íºâtional®0parameter.çThisisreallyadisguisedw¾9ay®0ofsubsti-¡íºâtutinginfunctionalparametersbAÇefore xpoin¾9ting.ìÿWhether¡íºâornotCDSscandeliv¾9eraviable xpAÇointingmechanismre-¡íºâmainsþtobAÇeseen.îmEarlyimplemen¾9tationshintedatspace¡íºâproblems,but®Dthesema¾9ynowhavebAÇeensolved[Hug93ó'].¡íºâCDSs/·canalsobAÇeview¾9edasahigher-ordergeneralisation¡íºâofÁÁtheminimalfunctiongraphsc¾9hemeoriginallydescribAÇed¡íºâb¾9yE§NeilJones[JM86zú].jMinimalfunctiongraphsareused¡íºâin=ÄtheSeman¾9tiqueanalyser[KHL91 (Ô]builtintoGlasgow¡íºâHask¾9ellT[PHHP93#µø].¦íºâTheütermrewritingbased xpAÇoin¾9terdescribedherew¾9as, ý õºâinÅpart,¾¡inspiredb¾9yCharlesConsel'sstrictnessanalyserin¤
õºâtheG¿Yÿ:«aleHask¾9ellcompiler[Gro92ÀP].³±Consel'spapAÇer[Con91±¼],¡ õºâwhic¾9hÎseemstohavepassedbyalmostunnoticed,µdescribAÇed¡ õºâa7#successful,ifsimple,strictnessanalysersolving xpAÇoin¾9t¡ õºâequationsYb¾9ytermrewriting.Inviewofhowwellthisand¡ õºâConsel's}ásystemw¾9ork,,itispAÇerhapsapitythatPeytonJones¡ õºâet;almadedisparagingremarksabAÇoutterm-based xpoin¾9t-¡ õºâingTintheirseminalfron¾9tierspapAÇer[PC879].5 õºâ¹6.4 G·F¹urtherLÎworkm õºâºAnna'sN¾pAÇerformanceisencouraging.ÈNev¾9ertheless,there's¡ õºâstillê¿alongw¾9ayê¿togobAÇeforeevÿ|raluationtransformerinfor-¡ õºâmationBÙcanbAÇegeneratedautomaticallyinproductioncom-¡ õºâpilers. pThreeTa¾9venuesofdevelopmentneedtobAÇepersued.ÐOäëP :âëNEnhancemen´Ctjeofapplicabilityÿ Ì.È]ºAnna'smostw¾9orry-¡ :âing®alimitationisherinabilit¾9ytodealwithhigherorder¡ :âfunctionsÛwhic¾9hcannotbAÇe rsti ed.ôA½possiblepartial¡ :âsolutionÉMistoiteratethese(or,Ømorepreciselyÿ:«,justthe¡ :ânast¾9yÂwbits)asmanytimesasisnecessarytoguaran-¡ :âteeGÔa xpAÇoin¾9t.×ðTheworkofNielsonandNielson[NN92 >]¡ :âgiv¾9es7ethemagicnumbAÇerofiterationsneeded.ÒvFÿ:«ormany¡ :âcommon'forms,ñ[thisn¾9umbAÇer'isreasonablylo¾9w,and¡ :âitZseemsreasonabletoexpAÇectthisapproac¾9htoyield¡ :âw¾9orthwhileTresults.©
:âIt·eisalsonecessarytoremo¾9ve·esomeoftheexcessiv¾9ere-¡ :âstrictionsJionuser-de neddatat¾9ypAÇesdiscussedinsec-¡ :âtion\ô2.2.6.óQThisdoAÇesnotappeartobeparticularly¡ :âdicult.òKubiak\etal[KHL91 (Ô]managedthisquite¡ :âsuccessfullyÿ:«.34äëP :âëNEnhancemen´CtgofpK¼erformance.÷ÙºThe§re nemen¾9tsof¡ :âsection=6.1ha¾9ve=donealottoimpro¾9ve=thesystem's¡ :âpAÇerformance.¡Nev¾9ertheless,someAprogramswetried¡ :ârecen¾9tlyÖ-inexcessofathousandlines-runmore¡ :âslo¾9wlyîÀthanonewouldlike.¨µInvestigationsarebAÇeing¡ :âmade.¦ :âFixpAÇoin¾9tingL½largegroupsoffunctionscouldconciev-¡ :âablyðbAÇeacceleratedb¾9yreducingthegrouptoa\mini-¡ :âmalTform" rst. pFÿ:«orexample,giv¾9en©ÌÍg¤ëMa¹=...a...b...¡g¤b¹=...c...¡g¤c¹=...c...d...¡g¤d¹=...a...¦ :âºw¾9e`®canremoveëMbºandëMdºbysubstitutingthemintoëMaºand¡ :âëMc åºrespAÇectiv¾9elyÿ:«. ThishalvesthenumbAÇeroffunctionsin¡ :âtheÿ2groupbAÇeing xpoin¾9ted.Ú OncethesolutionstoëMa¡ :âºandÆlëMcºha¾9veÆlbAÇeengenerated,Ö4w¾9eobtainvÿ|raluesforëMbºand¡ :âëMdTºb¾9ystraightforwardback-substitution.
:âNoteG thatthistec¾9hniquemaybAÇeusedinanysitua-¡ :âtion¥¿in¾9volving xpAÇointingmutuallyrecursivegroupsof¡ :âequations.µÆTheÆideastemsfromananalogywiththe¡ :âGauss-Jordan¨methoAÇdforsolvingsim¾9ultaneouslinear¡ :âequations.zíIn4Óthiscase,<³arecursiv¾9egroupcanonlybAÇe¡ :âreducedItothepAÇoin¾9twhereeveryequationinthegroup¡ :ârefersödirectlytoitself{nofurther.ÀHAfterthat,.î x-¡ :âpAÇoin¾9tingx isunavoidable.DWhetherornotthisrenders¡ :âa spAÇeedupdependsontherelativ¾9ecostsofsubstitution,¡ :âbac¾9kTsubstitutionand xpAÇointing. åä28 ÜÑ ºâ ý? £ ý ûäëP:âëNDealing¦withmoK¼dulesº. 5MoAÇdulesÈZareanunmiti-¤
:âgatedÇn¾9uisanceformanykindsofhighpAÇoweredseman-¡:âticxManalysesandoptimisations.E\Inparticular,Ñ moAÇd-¡:âulesÑcausebigdicultiesforan¾9ykindofwhatJohn¡:âYÿ:«oung(termed\collectingin¾9terpretations"[You89-Ò].TÂA¡:âcollectingTin¾9terpretationisessentiallyaglobalanal-¡:âysis. vøMan¾9yÞ,compiletimeoptimisationsarelimited¡:âb¾9y$themoAÇdulestructure.IøFÿ:«orexample,hMsomeofthe¡:âmoreÄirecen¾9tschemesforcompilingoverloadingef-¡:â cien¾9tly [Jon93Ä9][Aug93ó']requireglobalanalysisfor¡:âfullÊ=applicabilit¾9yÿ:«. ;,ThepAÇointofallthisisthatthe¡:âmonomorphisation+and rsti cationtransformations¡:âusedTinAnnaalsorequireaglobalview. Ûk:âThere"isanurgen¾9tneedtodevisesophisticatedcom-¡:âpilation×wsystemswhic¾9hmaintainenoughintermoAÇdule¡:âcomm¾9unication?tomakeglobalanalysespAÇossible.?De-¡:âv¾9elopment»fofsuc¾9haframeworkwouldbAÇene tnotonly¡:âstrictnessoªanalysis,@butman¾9yaspAÇectsofcompiletime¡:âoptimisation.©¨Suc¾9h¼acompilermightworkbydump-¡:âing^øalotofinformationin¾9toamoAÇdule'sinterface le,¡:âenoughAtodowhatev¾9eranalysesweneed. úThiswould¡:âreally©justbAÇeanextensionofthesc¾9hemesusedal-¡:âreadya
intheChalmersandGlasgo¾9wcompilers,sûwhich¡:âdumpù{functionarit¾9yandrudimentarystrictnessinfor-¡:âmation¯in¾9tointerface les.µThequestionisnotre-¡:âally@ whetherw¾9ecouldconstructsuchasystem,Óbut¡:âwhether¯thequan¾9tity¯ofinformationdumpAÇedin¾9toin-¡:âterface3ú lescouldbAÇelimitedsucien¾9tlytorenderthe¡:âsc¾9hemeTpractical.©µíºâ¹Ackno¹wledgements´íºâºThanks9ÍtoBillMitc¾9hellforadviceonbuildingtermrewrit-¡íºâing
systems, ¬andtoBarneyHilk¾9enforaninvÿ|raluableinsight¡íºâregardingseparatecompilationsystems.ê MarkJonespro-¡íºâvidedñman¾9yinterestingcommentsabAÇoutmonomorphisation¡íºâandOz rsti cation,^andoutlinedtheinstance-collectingalgo-¡íºârithm߯ofSection5.6.1.
Geo reyBurnandDenisHo¾9we߯were¡íºâsucien¾9tly8ÖbravetoexpAÇerimentwiththeimplementation,¡íºâandTpro¾9videdusefulfeedback.
íºâDenisÛ³Ho¾9wereadanearlydraftinminutedetail. :Hisexten-¡íºâsiv¾9e³|andsometimesamusingü-=Õ2Þ#ºcommentsprovedveryhelpful¡íºâinTmakingthepresen¾9tationclearer.¦íºâ¹ReferencesÅíºâº[Aug87]fL.|Augustsson.ëRCompilingJ´LazyFÿJªunctionalLan-¡fguages,lPartfIIº.hPhD/¶thesis,6WChalmers/¼Tÿ:«ekniskÿ|ra¡fHû`ogsk¾9ola,TGotebAÇorg,Sw¾9eden,1987.©¶Öíºâ[Aug93]fLennart¤êAugustsson.bImplemen¾9tinghaskellover-¡floading.-ðIn ÍëRProceedingsAEoftheFÿJªunctionalPro-¡fgramming`LanguagesandComputerAÃrchitecture¡fConference,N<Copenhagen,Denmarkº,TJune1993.¦íºâ[Bar91]fG.³úBaraki.íuA³noteonabstractin¾9terpretation¡fofäQpAÇolymorphicfunctions. }InR.J.M.Hughes,¡feditor,÷íëRProceedingsôÑofthe fthAÃCMô§conference¡fon6¨FÿJªunctionalLanguagesandComputerAÃrchi-¡ftectureº,Fn¾9umbAÇer:ã523inLectureNotesinCom-¡fputer{Science,&pages367{378,Cam¾9bridge,Mas-¡fsac¾9husetts,T26{30August1991.Springer-Vÿ:«erlag.íºââ ff _ÿ ×
r}üûr°2Y±See±Ètheotherfo7 otnote. ý õºâº[BHA85]#fG.L.0Burn,ܧC.L.Hankin,andS.Abramskyÿ:«.¤
#fTheàtheoryofstrictnessanalysisforhigher-order¡#ffunctions.MIn~QëRProceedingsõoftheWorkshopon¡#fProgramsÈ÷asDataObjectsº,¼Fpagesâ42{62,DIKU,¡#fCopAÇenhagen,ÚøDenmark,17{19ØOctober1985.¡#fSpringer-Vÿ:«erlagTLNCS217.©ÕV õºâ[Bur87]#fG.L.ìüBurn.Ø ëRAÃbstract))InterpretationandthePar-¡#falxälelþìEvaluationofFÿJªunctionalLanguagesº.VÉPhD¡#fthesis,ÏImpAÇerial7PCollege,Univ¾9ersityofLondon,¡#fMarc¾9hT1987.¦ õºâ[Bur90]#fG.L.}ÃBurn.QA}¨relationshipbAÇet¾9ween}Ãabstractin-¡#fterpretationk{andpro jectionanalysis.òInëR17th²)AÃn-¡#fnualF×AÃCMFÕSymposiumonthePrinciplesofPro-¡#fgrammingkLanguagesº,l¢pages[,151{156,SanFÿ:«ran-¡#fcisco,T17{19Jan¾9uary1990.ACM.¦ õºâ[Bur91]#fG.L.yoBurn.°ëRLazy¾úFÿJªunctionalLanguages:øbAÃbstract¡#fInterpretation<andCompilationº.ÎResearc¾9hIÔMono-¡#fgraphsinP¾9arallelandDistributedComputing.¡#fPitmanÝÈinassoAÇciationwithMITݺPress,èå1991.¿CTÿ:«o¡#fappAÇear.¦ õºâ[CD91]#fWÿ:«ei-Ngan¸ChinandJohnDarlington.¸Remo¾9ving¡#fhigher-orderPþexpressionsb¾9yprogramtransforma-¡#ftion. Chin
zisatNUS,SingapAÇoreandDarlington¡#fat<|ImpAÇerial,FFLondon.P¾9ossiblypublished,Fÿ:«ebru-¡#faryT1991.¦ õºâ[Con91]#fCharlesíÏConsel. ®Fÿ:«aststrictnessanalysisvia¡#fsym¾9bAÇolicJU xpointJUiteration.²¤Unpublished.Yÿ:«ale¡#fUniv¾9ersityÿ:«,9 Department[ofComputerScience,¡#fSeptem¾9bAÇerT1991.¦ õºâ[Cur86]#fPÿ:«.-L.ZCurien.è8ëRCategoricalãCombinators,ÍSequen-¡#ftialùAÃlgorithmsAndFÿJªunctionalProgrammingº.¡#fResearc¾9h\¼NotesinTheoreticalComputerSci-¡#fenceseries.PitmanPublishingLimited,°ÀLondon,¡#f1986.¦ õºâ[D¾9W90]#fKei¬UDa¾9visandPhilipWÿ:«adler.n¨Strictnessanalysis¡#fin¢Ü4d._7InëRInå proceedingsofthe1990GlasgowAyr¡#fFPN<Workshop(??)º,T1990.¦ õºâ[Gro92]#fTheJÝYÿ:«aleHask¾9ellGroup.¹WTheyalehaskellusers¡#fman¾9ual,Tversiony2.0-bAÇeta,August1992.¦ õºâ[HH91]#fSebastian²Hun¾9tandChrisHankin.#ØFixedpAÇoints¡#fandçæfron¾9tiers:ÁanewpAÇerspective. /ëRJournalúüof¡#fFÿJªunctionalò-Programmingº,Å01(1):91±&{120,Jan¾9uary¡#f1991.¦ õºâ[HH92]#fSebastian¸7Hun¾9tandChrisHankin.Approximate¡#f xed¾pAÇoin¾9tsinabstractinterpretation.XInëRFÿJªourth¡#fEuropeann{SymposiumonProgramming,vRennes,¡#fFÿJªranceº,T1992.ÎLNCS582.¦ õºâ[HL90]#fR.J.M.5íHughesandJ.Launc¾9hburyÿ:«.zóTo¾9wards5íre-¡#flatingß±forw¾9ardsandbackwardsanalyses.Â`InëRPro-¡#fceedingsVoftheThirdAÃnnualGlasgowWorkshop¡#fonYßFÿJªunctionalProgrammingº,%(pages!ý145{155,Ul-¡#flapAÇool,TScotland,13{15August1990.¦ õºâ[HL92]#fPieterWH.HartelandKoAÇenG.Langendoen.¡#fBenc¾9hmarking implementationsoflazyfunc-¡#ftionalz£languages.G´Tÿ:«ec¾9hnicalrepAÇort,öDepartment¡#fofFhComputerSystems,Fÿ:«acult¾9yofMathematics¡#fandÇComputerScience,
£Univ¾9ersityÇofAmster-¡#fdam,TDecem¾9bAÇer1992. åä29 þ ºâ ý? £ ý íºâº[HP90]fJohnSL.HennessyandDa¾9vidA.Patterson.ÝõëRCom-¤
fputer}AÃrchitecture:¿A} QuantitativeApproachº.¡fMorgan36KaufmannPublishers,:®Inc.,San36Mateo,¡fCA,T1990.©34íºâ[Hug]fJohn3hHughes.©Pro jectionsforpAÇolymorphicstrict-¡fnessQ(analysis.ÌInëRIn
7SpringerVÿJªerlagLNCS
)389º.¡fYÿ:«earTandconferencenotestablished.¦íºâ[Hug87]fJohnHughes.Bac¾9kwardsanalysisoffunctional¡fprograms.tTÿ:«ec¾9hnical>RepAÇortCSC/87/R3,SøUni-¡fv¾9ersity\ofGlasgo¾9w,ÞÝDepartment\ofComputing¡fScience,TMarc¾9h1987.¦íºâ[Hug90]fJohnÞHughes. jþCompile-timeanalysisoffunc-¡ftional programs.
¾InDa¾9vidA.Tÿ:«urner,Úedi-¡ftor,KFëRResearchf$TÿJªopicsinFunctionalProgrammingº.¡fAddison-Wÿ:«esleyAûPublishingCompan¾9y, #1990.¡fFÿ:«romÐthe1987YearofProgramming,ÞKUniv¾9ersity¡fofTTÿ:«exas,Austin,Texas.¦íºâ[Hug93]fJohn7ÃHughes.kPrivÿ|ratecomm¾9unicationregarding¡fcdss,T1993.¦íºâ[JM86]fNeilD.JonesandAlanMycroft.PÇData
o¾9wanal-¡fysisÏofapplicativ¾9eprogramsusingminimalfunc-¡ftionôgraphs: Abridgedv¾9ersion.ämInëRUnknown,6)but¡fde nitelyN<inanAÃCMproceedingsº,T1986.¦íºâ[Joh85]fT.7Johnsson.ÒULam¾9bAÇdalifting: ú6Tÿ:«ransform-¡fingÇNprogramstorecursiv¾9eequations. 'InJ.-Pÿ:«.¡fJouannaud,8editor,ëRProceedingsà"oftheConfer-¡fenceöÌonFÿJªunctionalProgrammingLanguagesand¡fComputer§íAÃrchitectureº,ëpages190{203,Nancyÿ:«,¡fFÿ:«rance,TSeptem¾9bAÇer1985.¦íºâ[Joh87]fT.üJohnsson. ÄdA¾9ttributegrammarsasafunc-¡ftionalV#programmingparadigm.ÚïInG.Kahn,fVed-¡fitor,ø$ëRProceedings,µoftheFÿJªunctionalProgramming¡fLanguagesÓandComputerAÃrchitectureConfer-¡fenceº,Ïpages½154{173.Springer-Vÿ:«erlagLNCS½q274,¡fSeptem¾9bAÇerT1987.¦íºâ[Jon93]fMark0¡Jones.f P¾9artialevÿ|raluationfordictionary-¡ffree _o¾9verloading.÷Unpublisheddraft.Yÿ:«aleUni-¡fv¾9ersityÿ:«,g DepartmentV³ofComputerScience,April¡f1993.¦íºâ[KHL91]fR.' Kubiak,W+J.Hughes,andJ.Launc¾9hburyÿ:«.VA'cpro-¡ftot¾9ypAÇe$®implementationofpro jection-based rst-¡forder¥¼pAÇolymorphicstrictnessanalysis.cçInR.Hel-¡fdal,×@editor,ëRDraftÜÌProceedingsofFÿJªourthAÃnnual¡fGlasgow)WorkshoponFÿJªunctionalProgrammingº,¡fpagesT322{343,Sky¾9e,August13{151991.¦íºâ[Min92]fSa¾9vÿ|raMintchev.I A}parallelstg-machine.I Master's¡fthesis,Ü6Departmen¾9t<ofComputerScience,Uni-¡fv¾9ersityTofManc¾9hester,UK,SeptembAÇer1992.¦íºâ[Myc80]fA.ºMycroft. Theoryandpracticeoftransform-¡fing:
call-b¾9y-needintocall-by-vÿ|ralue.4InëR4thoøInter-¡fnationalïüSymposiumonProgrammingº,ÃGpages®Ã269¡f{281,luP¾9aris,April'Õ1980.Springer-Vÿ:«erlagLNCS¡f83.¦íºâ[Nel]fGeorge+FC.Nelan.[4Firsti cation.Date+Funkno¾9wn,¡fbut`
m¾9ustbAÇe1992orafter.BasedonNelan'sPhD¡fthesis.TArizonaStateUniv¾9ersityÿ:«. ý õºâ[NN92]#fF.ÌíNielsonandH.R.Nielson.<íFinitenesscondi-¤
#ftionsFýfor xedpAÇoin¾9titeration.ÌTÿ:«echnicalrepAÇort,¡#fComputer§ìScienceDepartmen¾9t,ÌAarhus§ìUniver-¡#fsit¾9yÿ:«,TDenmark,February1992.©34 õºâ[P¾9ar92]#fWill®P¾9artain.ÓATheëMnofibºbAÇenchmarksuite¡#fofÒühask¾9ellprograms. DÀInëRFifthÓAÃnnualGlas-¡#fgow{rWorkshoponFÿJªunctionalProgramming,¥Ayrº,¡#f1992.¦ õºâ[PC87]#fSimonà!P¾9eytonJonesandChrisClack.v&Finding¡#f xpAÇoin¾9ts/Èinabstractinterpretation.£¡InS.Abram-¡#fskyùÌandC.L.Hankin,ÿNeditors,ëRAÃbstract4ðInterpre-¡#ftation8IofDeclarative8ILanguagesº,8Computersýqand¡#fTheirø'Applications,0Ûc¾9hapter11,pages246{265.¡#fEllisTHorw¾9oAÇod,1987.¦ õºâ[P¾9ey87]#fS.L.rDP¾9eytonJones.ëRThe¸eImplementationofFÿJªunc-¡#ftionald¨ProgrammingLanguagesº.{wPren¾9tice-Hall$In-¡#fternational!SeriesinComputerScience.Pren¾9tice-¡#fHallTIn¾9ternational(UK)Ltd,London,1987.¦ õºâ[PHHP93]#fS.L.¯EP¾9eytonJones,ïCordeliaV¯+Hall,KevinHam-¡#fmond,´÷andaÖWillP¾9artain.ø¯Theglasgowhaskell¡#fcompiler:Úa§tec¾9hnicaloverview.C+InëRProceedingsÕ<of¡#ftheþDUKþ0JoinFÿJªrameworkforInformationTechol-¡#fogy,N<Keeleº,T1993.¦ õºâ[PJ92]#fS.L.P¾9eytonJones.2©Implementinglazyfunctional¡#flanguagesc£onstoAÇc¾9khardware:¹
thespinelesstag-¡#flessÕJG-Mac¾9hine.±këRJournalcofFÿJªunctionalProgram-¡#fmingº,T2(2):127{202,April1992.¦ õºâ[Sew91]#fJulianÖnSew¾9ard.³GTÿ:«owardsastrictnessanalyserfor¡#fhask¾9ell:#PuttingÔtheoryintopractice.TMaster's¡#fthesis,#Univ¾9ersity ¹ofManc¾9hester,Department ¹of¡#fComputerScience,´E1991.T
Avÿ|railableasUniv¾9ersity¡#fofTManc¾9hesterTÿ:«echnicalRepAÇortUMCS-92-2-2.¦ õºâ[Sew92]#fJulian¦àSew¾9ard.eÂPolymorphic,¼÷higherorderstrict-¡#fness|ianalysisusingfron¾9tiers. UnpublishedpapAÇer,¡#f1992.¦ õºâ[Sew93]#fJulianÔ Sew¾9ard.R#Polymorphicstrictnessanalysis¡#fusingØfron¾9tiers. ZRInëRProceedingsì×oftheSympo-¡#fsiumÛonPartialEvaluationandSemanticsbased¡#fProgramtáManipulation,¾PEPM93,Copenhagen,¡#fDenmarkº,TJune1993.¦ õºâ[Wÿ:«ad87]#fPÿ:«.L.dªWadler.:Strictnessanalysisonnon-
atdo-¡#fmains ï(b¾9yabstractinterpretationover nitedo-¡#fmains).ÏàIn¨US.AbramskyandC.L.Hankin,Íedi-¡#ftors,-ðëRAÃbstract`SInterpretationofDeclarativeLan-¡#fguagesº,zc¾9hapterÿí12,pages266{275.EllisHor-¡#fw¾9oAÇodsÓLtd.,ËsChichester,Wÿ:«estsÓSussex,England,¡#f1987.¦ õºâ[Wÿ:«ad92]#fPhilipcWÿ:«adler.ü-Theessenceoffunctionalpro-¡#fgramming.=;Inx×ëRProceedingsíofthe19thAÃnnual¡#fSymposiumÖqonPrinciplesofProgrammingLan-¡#fguages,N<SantaFÿJªe,NewMexicoº,T1992.¦ õºâ[WH87]#fPÿ:«.")WadlerandR.J.M.Hughes.@ Pro jectionsfor¡#fstrictness)@analysis.U,InG.Kahn,.;editor,ëRProceed-¡#fings=3oftheFÿJªunctionalProgramming=3Languages¡#fandr~ComputerAÃrchitecturer~Conferenceº,ÿpages¡#f385{407.N`Springer-Vÿ:«erlagLNCSNQ274,\£Septem¾9bAÇer¡#f1987. åä30 w ºâ ý? £ ý íºâº[Wÿ:«ra85]fS.ëC.Wÿ:«ra¾9y.~\Aªnewëstrictnessdetectionalgorithm.¤
fIn'ìëRProceedings_RoftheWorkshoponImplementa-¡ftions~öofFÿJªunctionalLanguages,¨jAspenas,Sweden.¡fAÃvailableN<asChalmersPMGreportN<17º,T1985.34íºâ[Yÿ:«ou89]fJ.H.¬aYÿ:«oung.n¼ëRTheíÌTheoryandPracticeofSeman-¡fticÄProgramAÃnalysisforHigher-OrderFÿJªunc-¡ftional%
ProgrammingLanguagesº.ÐÀPhDèwthesis,ñyDe-¡fpartmen¾9tTofComputerScience,djYÿ:«aleUniversityÿ:«,¡fMa¾9yT1989. åä31ø 9.À ; èºâåºâ óR¼j¹ cmti9óP©±Ê cmsy9óO5ù" cmmi9óNt : cmbx9óMߤN cmtt9ó7ßê<x
ó3
cmtt10ó*¹Aa¨ cmr6ó(Kñ`y
ó3
cmr10óÂÖN ff cmbx12óX«Q ff cmr12óo´Ç cmr9óñkAH
cmssbx10ó
!",
cmsy10ó °Ü0n cmsy5óÙ R cmr7óZ cmr5ù ;øßßßßßßß | 212,340 | 546 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/spewG.c | #include "libc/stdio/rand.h"
#include "libc/stdio/stdio.h"
/* clang-format off */
/* spew out a thoroughly gigantic file designed so that bzip2
can compress it reasonably rapidly. This is to help test
support for large files (> 2GB) in a reasonable amount of time.
I suggest you use the undocumented --exponential option to
bzip2 when compressing the resulting file; this saves a bit of
time. Note: *don't* bother with --exponential when compressing
Real Files; it'll just waste a lot of CPU time :-)
(but is otherwise harmless).
*/
/* ------------------------------------------------------------------
This file is part of bzip2/libbzip2, a program and library for
lossless, block-sorting data compression.
bzip2/libbzip2 version 1.0.8 of 13 July 2019
Copyright (C) 1996-2019 Julian Seward <[email protected]>
Please read the WARNING, DISCLAIMER and PATENTS sections in the
README file.
This program is released under the terms of the license contained
in the file LICENSE.
------------------------------------------------------------------ */
#define _FILE_OFFSET_BITS 64
/* The number of megabytes of junk to spew out (roughly) */
#define MEGABYTES 5000
#define N_BUF 1000000
char buf[N_BUF];
int main ( int argc, char** argv )
{
int ii, kk, p;
srandom(1);
setbuffer ( stdout, buf, N_BUF );
for (kk = 0; kk < MEGABYTES * 515; kk+=3) {
p = 25+random()%50;
for (ii = 0; ii < p; ii++)
printf ( "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa" );
for (ii = 0; ii < p-1; ii++)
printf ( "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb" );
for (ii = 0; ii < p+1; ii++)
printf ( "ccccccccccccccccccccccccccccccccccccc" );
}
fflush(stdout);
return 0;
}
| 1,767 | 55 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/words3 |
If you got this far and the 'cmp's didn't complain, it looks
like you're in business.
To install in /usr/local/bin, /usr/local/lib, /usr/local/man and
/usr/local/include, type
make install
To install somewhere else, eg, /xxx/yyy/{bin,lib,man,include}, type
make install PREFIX=/xxx/yyy
If you are (justifiably) paranoid and want to see what 'make install'
is going to do, you can first do
make -n install or
make -n install PREFIX=/xxx/yyy respectively.
The -n instructs make to show the commands it would execute, but
not actually execute them.
Instructions for use are in the preformatted manual page, in the file
bzip2.txt. For more detailed documentation, read the full manual.
It is available in Postscript form (manual.ps), PDF form (manual.pdf),
and HTML form (manual.html).
You can also do "bzip2 --help" to see some helpful information.
"bzip2 -L" displays the software license.
| 945 | 31 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzlib_private.inc | #include "third_party/bzip2/bzlib.h"
#define BZ_NO_STDIO
/* clang-format off */
/*-------------------------------------------------------------*/
/*--- Private header file for the library. ---*/
/*--- bzlib_private.h ---*/
/*-------------------------------------------------------------*/
/* ------------------------------------------------------------------
This file is part of bzip2/libbzip2, a program and library for
lossless, block-sorting data compression.
bzip2/libbzip2 version 1.0.8 of 13 July 2019
Copyright (C) 1996-2019 Julian Seward <[email protected]>
Please read the WARNING, DISCLAIMER and PATENTS sections in the
README file.
This program is released under the terms of the license contained
in the file LICENSE.
------------------------------------------------------------------ */
/*-- General stuff. --*/
#define BZ_VERSION "1.0.8, 13-Jul-2019"
typedef char Char;
typedef unsigned char Bool;
typedef unsigned char UChar;
typedef int Int32;
typedef unsigned int UInt32;
typedef short Int16;
typedef unsigned short UInt16;
#define True ((Bool)1)
#define False ((Bool)0)
#ifndef __GNUC__
#define __inline__ /* */
#endif
#ifndef BZ_NO_STDIO
extern void BZ2_bz__AssertH__fail ( int errcode );
#define AssertH(cond,errcode) \
{ if (!(cond)) BZ2_bz__AssertH__fail ( errcode ); }
#if BZ_DEBUG
#define AssertD(cond,msg) \
{ if (!(cond)) { \
fprintf ( stderr, \
"\n\nlibbzip2(debug build): internal error\n\t%s\n", msg );\
exit(1); \
}}
#else
#define AssertD(cond,msg) /* */
#endif /* BZ_DEBUG */
#define VPrintf0(zf) \
fprintf(stderr,zf)
#define VPrintf1(zf,za1) \
fprintf(stderr,zf,za1)
#define VPrintf2(zf,za1,za2) \
fprintf(stderr,zf,za1,za2)
#define VPrintf3(zf,za1,za2,za3) \
fprintf(stderr,zf,za1,za2,za3)
#define VPrintf4(zf,za1,za2,za3,za4) \
fprintf(stderr,zf,za1,za2,za3,za4)
#define VPrintf5(zf,za1,za2,za3,za4,za5) \
fprintf(stderr,zf,za1,za2,za3,za4,za5)
#else /* BZ_NO_STDIO */
extern void bz_internal_error ( int errcode );
#define AssertH(cond,errcode) \
{ if (!(cond)) bz_internal_error ( errcode ); }
#define AssertD(cond,msg) do { } while (0)
#define VPrintf0(zf) do { } while (0)
#define VPrintf1(zf,za1) do { } while (0)
#define VPrintf2(zf,za1,za2) do { } while (0)
#define VPrintf3(zf,za1,za2,za3) do { } while (0)
#define VPrintf4(zf,za1,za2,za3,za4) do { } while (0)
#define VPrintf5(zf,za1,za2,za3,za4,za5) do { } while (0)
#endif /* BZ_NO_STDIO */
#define BZALLOC(nnn) (strm->bzalloc)(strm->opaque,(nnn),1)
#define BZFREE(ppp) (strm->bzfree)(strm->opaque,(ppp))
/*-- Header bytes. --*/
#define BZ_HDR_B 0x42 /* 'B' */
#define BZ_HDR_Z 0x5a /* 'Z' */
#define BZ_HDR_h 0x68 /* 'h' */
#define BZ_HDR_0 0x30 /* '0' */
/*-- Constants for the back end. --*/
#define BZ_MAX_ALPHA_SIZE 258
#define BZ_MAX_CODE_LEN 23
#define BZ_RUNA 0
#define BZ_RUNB 1
#define BZ_N_GROUPS 6
#define BZ_G_SIZE 50
#define BZ_N_ITERS 4
#define BZ_MAX_SELECTORS (2 + (900000 / BZ_G_SIZE))
/*-- Stuff for randomising repetitive blocks. --*/
extern Int32 BZ2_rNums[512];
#define BZ_RAND_DECLS \
Int32 rNToGo; \
Int32 rTPos \
#define BZ_RAND_INIT_MASK \
s->rNToGo = 0; \
s->rTPos = 0 \
#define BZ_RAND_MASK ((s->rNToGo == 1) ? 1 : 0)
#define BZ_RAND_UPD_MASK \
if (s->rNToGo == 0) { \
s->rNToGo = BZ2_rNums[s->rTPos]; \
s->rTPos++; \
if (s->rTPos == 512) s->rTPos = 0; \
} \
s->rNToGo--;
/*-- Stuff for doing CRCs. --*/
extern UInt32 BZ2_crc32Table[256];
#define BZ_INITIALISE_CRC(crcVar) \
{ \
crcVar = 0xffffffffL; \
}
#define BZ_FINALISE_CRC(crcVar) \
{ \
crcVar = ~(crcVar); \
}
#define BZ_UPDATE_CRC(crcVar,cha) \
{ \
crcVar = (crcVar << 8) ^ \
BZ2_crc32Table[(crcVar >> 24) ^ \
((UChar)cha)]; \
}
/*-- States and modes for compression. --*/
#define BZ_M_IDLE 1
#define BZ_M_RUNNING 2
#define BZ_M_FLUSHING 3
#define BZ_M_FINISHING 4
#define BZ_S_OUTPUT 1
#define BZ_S_INPUT 2
#define BZ_N_RADIX 2
#define BZ_N_QSORT 12
#define BZ_N_SHELL 18
#define BZ_N_OVERSHOOT (BZ_N_RADIX + BZ_N_QSORT + BZ_N_SHELL + 2)
/*-- Structure holding all the compression-side stuff. --*/
typedef
struct {
/* pointer back to the struct bz_stream */
bz_stream* strm;
/* mode this stream is in, and whether inputting */
/* or outputting data */
Int32 mode;
Int32 state;
/* remembers avail_in when flush/finish requested */
UInt32 avail_in_expect;
/* for doing the block sorting */
UInt32* arr1;
UInt32* arr2;
UInt32* ftab;
Int32 origPtr;
/* aliases for arr1 and arr2 */
UInt32* ptr;
UChar* block;
UInt16* mtfv;
UChar* zbits;
/* for deciding when to use the fallback sorting algorithm */
Int32 workFactor;
/* run-length-encoding of the input */
UInt32 state_in_ch;
Int32 state_in_len;
BZ_RAND_DECLS;
/* input and output limits and current posns */
Int32 nblock;
Int32 nblockMAX;
Int32 numZ;
Int32 state_out_pos;
/* map of bytes used in block */
Int32 nInUse;
Bool inUse[256];
UChar unseqToSeq[256];
/* the buffer for bit stream creation */
UInt32 bsBuff;
Int32 bsLive;
/* block and combined CRCs */
UInt32 blockCRC;
UInt32 combinedCRC;
/* misc administratium */
Int32 verbosity;
Int32 blockNo;
Int32 blockSize100k;
/* stuff for coding the MTF values */
Int32 nMTF;
Int32 mtfFreq [BZ_MAX_ALPHA_SIZE];
UChar selector [BZ_MAX_SELECTORS];
UChar selectorMtf[BZ_MAX_SELECTORS];
UChar len [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
Int32 code [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
Int32 rfreq [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
/* second dimension: only 3 needed; 4 makes index calculations faster */
UInt32 len_pack[BZ_MAX_ALPHA_SIZE][4];
}
EState;
/*-- externs for compression. --*/
extern void
BZ2_blockSort ( EState* );
extern void
BZ2_compressBlock ( EState*, Bool );
extern void
BZ2_bsInitWrite ( EState* );
extern void
BZ2_hbAssignCodes ( Int32*, UChar*, Int32, Int32, Int32 );
extern void
BZ2_hbMakeCodeLengths ( UChar*, Int32*, Int32, Int32 );
/*-- states for decompression. --*/
#define BZ_X_IDLE 1
#define BZ_X_OUTPUT 2
#define BZ_X_MAGIC_1 10
#define BZ_X_MAGIC_2 11
#define BZ_X_MAGIC_3 12
#define BZ_X_MAGIC_4 13
#define BZ_X_BLKHDR_1 14
#define BZ_X_BLKHDR_2 15
#define BZ_X_BLKHDR_3 16
#define BZ_X_BLKHDR_4 17
#define BZ_X_BLKHDR_5 18
#define BZ_X_BLKHDR_6 19
#define BZ_X_BCRC_1 20
#define BZ_X_BCRC_2 21
#define BZ_X_BCRC_3 22
#define BZ_X_BCRC_4 23
#define BZ_X_RANDBIT 24
#define BZ_X_ORIGPTR_1 25
#define BZ_X_ORIGPTR_2 26
#define BZ_X_ORIGPTR_3 27
#define BZ_X_MAPPING_1 28
#define BZ_X_MAPPING_2 29
#define BZ_X_SELECTOR_1 30
#define BZ_X_SELECTOR_2 31
#define BZ_X_SELECTOR_3 32
#define BZ_X_CODING_1 33
#define BZ_X_CODING_2 34
#define BZ_X_CODING_3 35
#define BZ_X_MTF_1 36
#define BZ_X_MTF_2 37
#define BZ_X_MTF_3 38
#define BZ_X_MTF_4 39
#define BZ_X_MTF_5 40
#define BZ_X_MTF_6 41
#define BZ_X_ENDHDR_2 42
#define BZ_X_ENDHDR_3 43
#define BZ_X_ENDHDR_4 44
#define BZ_X_ENDHDR_5 45
#define BZ_X_ENDHDR_6 46
#define BZ_X_CCRC_1 47
#define BZ_X_CCRC_2 48
#define BZ_X_CCRC_3 49
#define BZ_X_CCRC_4 50
/*-- Constants for the fast MTF decoder. --*/
#define MTFA_SIZE 4096
#define MTFL_SIZE 16
/*-- Structure holding all the decompression-side stuff. --*/
typedef
struct {
/* pointer back to the struct bz_stream */
bz_stream* strm;
/* state indicator for this stream */
Int32 state;
/* for doing the final run-length decoding */
UChar state_out_ch;
Int32 state_out_len;
Bool blockRandomised;
BZ_RAND_DECLS;
/* the buffer for bit stream reading */
UInt32 bsBuff;
Int32 bsLive;
/* misc administratium */
Int32 blockSize100k;
Bool smallDecompress;
Int32 currBlockNo;
Int32 verbosity;
/* for undoing the Burrows-Wheeler transform */
Int32 origPtr;
UInt32 tPos;
Int32 k0;
Int32 unzftab[256];
Int32 nblock_used;
Int32 cftab[257];
Int32 cftabCopy[257];
/* for undoing the Burrows-Wheeler transform (FAST) */
UInt32 *tt;
/* for undoing the Burrows-Wheeler transform (SMALL) */
UInt16 *ll16;
UChar *ll4;
/* stored and calculated CRCs */
UInt32 storedBlockCRC;
UInt32 storedCombinedCRC;
UInt32 calculatedBlockCRC;
UInt32 calculatedCombinedCRC;
/* map of bytes used in block */
Int32 nInUse;
Bool inUse[256];
Bool inUse16[16];
UChar seqToUnseq[256];
/* for decoding the MTF values */
UChar mtfa [MTFA_SIZE];
Int32 mtfbase[256 / MTFL_SIZE];
UChar selector [BZ_MAX_SELECTORS];
UChar selectorMtf[BZ_MAX_SELECTORS];
UChar len [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
Int32 limit [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
Int32 base [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
Int32 perm [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
Int32 minLens[BZ_N_GROUPS];
/* save area for scalars in the main decompress code */
Int32 save_i;
Int32 save_j;
Int32 save_t;
Int32 save_alphaSize;
Int32 save_nGroups;
Int32 save_nSelectors;
Int32 save_EOB;
Int32 save_groupNo;
Int32 save_groupPos;
Int32 save_nextSym;
Int32 save_nblockMAX;
Int32 save_nblock;
Int32 save_es;
Int32 save_N;
Int32 save_curr;
Int32 save_zt;
Int32 save_zn;
Int32 save_zvec;
Int32 save_zj;
Int32 save_gSel;
Int32 save_gMinlen;
Int32* save_gLimit;
Int32* save_gBase;
Int32* save_gPerm;
}
DState;
/*-- Macros for decompression. --*/
#define BZ_GET_FAST(cccc) \
/* c_tPos is unsigned, hence test < 0 is pointless. */ \
if (s->tPos >= (UInt32)100000 * (UInt32)s->blockSize100k) return True; \
s->tPos = s->tt[s->tPos]; \
cccc = (UChar)(s->tPos & 0xff); \
s->tPos >>= 8;
#define BZ_GET_FAST_C(cccc) \
/* c_tPos is unsigned, hence test < 0 is pointless. */ \
if (c_tPos >= (UInt32)100000 * (UInt32)ro_blockSize100k) return True; \
c_tPos = c_tt[c_tPos]; \
cccc = (UChar)(c_tPos & 0xff); \
c_tPos >>= 8;
#define SET_LL4(i,n) \
{ if (((i) & 0x1) == 0) \
s->ll4[(i) >> 1] = (s->ll4[(i) >> 1] & 0xf0) | (n); else \
s->ll4[(i) >> 1] = (s->ll4[(i) >> 1] & 0x0f) | ((n) << 4); \
}
#define GET_LL4(i) \
((((UInt32)(s->ll4[(i) >> 1])) >> (((i) << 2) & 0x4)) & 0xF)
#define SET_LL(i,n) \
{ s->ll16[i] = (UInt16)(n & 0x0000ffff); \
SET_LL4(i, n >> 16); \
}
#define GET_LL(i) \
(((UInt32)s->ll16[i]) | (GET_LL4(i) << 16))
#define BZ_GET_SMALL(cccc) \
/* c_tPos is unsigned, hence test < 0 is pointless. */ \
if (s->tPos >= (UInt32)100000 * (UInt32)s->blockSize100k) return True; \
cccc = BZ2_indexIntoF ( s->tPos, s->cftab ); \
s->tPos = GET_LL(s->tPos);
/*-- externs for decompression. --*/
extern Int32
BZ2_indexIntoF ( Int32, Int32* );
extern Int32
BZ2_decompress ( DState* );
extern void
BZ2_hbCreateDecodeTables ( Int32*, Int32*, Int32*, UChar*,
Int32, Int32, Int32 );
| 12,848 | 482 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/decompress.c | /* clang-format off */
/*-------------------------------------------------------------*/
/*--- Decompression machinery ---*/
/*--- decompress.c ---*/
/*-------------------------------------------------------------*/
/* ------------------------------------------------------------------
This file is part of bzip2/libbzip2, a program and library for
lossless, block-sorting data compression.
bzip2/libbzip2 version 1.0.8 of 13 July 2019
Copyright (C) 1996-2019 Julian Seward <[email protected]>
Please read the WARNING, DISCLAIMER and PATENTS sections in the
README file.
This program is released under the terms of the license contained
in the file LICENSE.
------------------------------------------------------------------ */
#include "third_party/bzip2/bzlib_private.inc"
/*---------------------------------------------------*/
static
void makeMaps_d ( DState* s )
{
Int32 i;
s->nInUse = 0;
for (i = 0; i < 256; i++)
if (s->inUse[i]) {
s->seqToUnseq[s->nInUse] = i;
s->nInUse++;
}
}
/*---------------------------------------------------*/
#define RETURN(rrr) \
{ retVal = rrr; goto save_state_and_return; };
#define GET_BITS(lll,vvv,nnn) \
case lll: s->state = lll; \
while (True) { \
if (s->bsLive >= nnn) { \
UInt32 v; \
v = (s->bsBuff >> \
(s->bsLive-nnn)) & ((1 << nnn)-1); \
s->bsLive -= nnn; \
vvv = v; \
break; \
} \
if (s->strm->avail_in == 0) RETURN(BZ_OK); \
s->bsBuff \
= (s->bsBuff << 8) | \
((UInt32) \
(*((UChar*)(s->strm->next_in)))); \
s->bsLive += 8; \
s->strm->next_in++; \
s->strm->avail_in--; \
s->strm->total_in_lo32++; \
if (s->strm->total_in_lo32 == 0) \
s->strm->total_in_hi32++; \
}
#define GET_UCHAR(lll,uuu) \
GET_BITS(lll,uuu,8)
#define GET_BIT(lll,uuu) \
GET_BITS(lll,uuu,1)
/*---------------------------------------------------*/
#define GET_MTF_VAL(label1,label2,lval) \
{ \
if (groupPos == 0) { \
groupNo++; \
if (groupNo >= nSelectors) \
RETURN(BZ_DATA_ERROR); \
groupPos = BZ_G_SIZE; \
gSel = s->selector[groupNo]; \
gMinlen = s->minLens[gSel]; \
gLimit = &(s->limit[gSel][0]); \
gPerm = &(s->perm[gSel][0]); \
gBase = &(s->base[gSel][0]); \
} \
groupPos--; \
zn = gMinlen; \
GET_BITS(label1, zvec, zn); \
while (1) { \
if (zn > 20 /* the longest code */) \
RETURN(BZ_DATA_ERROR); \
if (zvec <= gLimit[zn]) break; \
zn++; \
GET_BIT(label2, zj); \
zvec = (zvec << 1) | zj; \
}; \
if (zvec - gBase[zn] < 0 \
|| zvec - gBase[zn] >= BZ_MAX_ALPHA_SIZE) \
RETURN(BZ_DATA_ERROR); \
lval = gPerm[zvec - gBase[zn]]; \
}
/*---------------------------------------------------*/
Int32 BZ2_decompress ( DState* s )
{
UChar uc;
Int32 retVal;
Int32 minLen, maxLen;
bz_stream* strm = s->strm;
/* stuff that needs to be saved/restored */
Int32 i;
Int32 j;
Int32 t;
Int32 alphaSize;
Int32 nGroups;
Int32 nSelectors;
Int32 EOB;
Int32 groupNo;
Int32 groupPos;
Int32 nextSym;
Int32 nblockMAX;
Int32 nblock;
Int32 es;
Int32 N;
Int32 curr;
Int32 zt;
Int32 zn;
Int32 zvec;
Int32 zj;
Int32 gSel;
Int32 gMinlen;
Int32* gLimit;
Int32* gBase;
Int32* gPerm;
if (s->state == BZ_X_MAGIC_1) {
/*initialise the save area*/
s->save_i = 0;
s->save_j = 0;
s->save_t = 0;
s->save_alphaSize = 0;
s->save_nGroups = 0;
s->save_nSelectors = 0;
s->save_EOB = 0;
s->save_groupNo = 0;
s->save_groupPos = 0;
s->save_nextSym = 0;
s->save_nblockMAX = 0;
s->save_nblock = 0;
s->save_es = 0;
s->save_N = 0;
s->save_curr = 0;
s->save_zt = 0;
s->save_zn = 0;
s->save_zvec = 0;
s->save_zj = 0;
s->save_gSel = 0;
s->save_gMinlen = 0;
s->save_gLimit = NULL;
s->save_gBase = NULL;
s->save_gPerm = NULL;
}
/*restore from the save area*/
i = s->save_i;
j = s->save_j;
t = s->save_t;
alphaSize = s->save_alphaSize;
nGroups = s->save_nGroups;
nSelectors = s->save_nSelectors;
EOB = s->save_EOB;
groupNo = s->save_groupNo;
groupPos = s->save_groupPos;
nextSym = s->save_nextSym;
nblockMAX = s->save_nblockMAX;
nblock = s->save_nblock;
es = s->save_es;
N = s->save_N;
curr = s->save_curr;
zt = s->save_zt;
zn = s->save_zn;
zvec = s->save_zvec;
zj = s->save_zj;
gSel = s->save_gSel;
gMinlen = s->save_gMinlen;
gLimit = s->save_gLimit;
gBase = s->save_gBase;
gPerm = s->save_gPerm;
retVal = BZ_OK;
switch (s->state) {
GET_UCHAR(BZ_X_MAGIC_1, uc);
if (uc != BZ_HDR_B) RETURN(BZ_DATA_ERROR_MAGIC);
GET_UCHAR(BZ_X_MAGIC_2, uc);
if (uc != BZ_HDR_Z) RETURN(BZ_DATA_ERROR_MAGIC);
GET_UCHAR(BZ_X_MAGIC_3, uc)
if (uc != BZ_HDR_h) RETURN(BZ_DATA_ERROR_MAGIC);
GET_BITS(BZ_X_MAGIC_4, s->blockSize100k, 8)
if (s->blockSize100k < (BZ_HDR_0 + 1) ||
s->blockSize100k > (BZ_HDR_0 + 9)) RETURN(BZ_DATA_ERROR_MAGIC);
s->blockSize100k -= BZ_HDR_0;
if (s->smallDecompress) {
s->ll16 = BZALLOC( s->blockSize100k * 100000 * sizeof(UInt16) );
s->ll4 = BZALLOC(
((1 + s->blockSize100k * 100000) >> 1) * sizeof(UChar)
);
if (s->ll16 == NULL || s->ll4 == NULL) RETURN(BZ_MEM_ERROR);
} else {
s->tt = BZALLOC( s->blockSize100k * 100000 * sizeof(Int32) );
if (s->tt == NULL) RETURN(BZ_MEM_ERROR);
}
GET_UCHAR(BZ_X_BLKHDR_1, uc);
if (uc == 0x17) goto endhdr_2;
if (uc != 0x31) RETURN(BZ_DATA_ERROR);
GET_UCHAR(BZ_X_BLKHDR_2, uc);
if (uc != 0x41) RETURN(BZ_DATA_ERROR);
GET_UCHAR(BZ_X_BLKHDR_3, uc);
if (uc != 0x59) RETURN(BZ_DATA_ERROR);
GET_UCHAR(BZ_X_BLKHDR_4, uc);
if (uc != 0x26) RETURN(BZ_DATA_ERROR);
GET_UCHAR(BZ_X_BLKHDR_5, uc);
if (uc != 0x53) RETURN(BZ_DATA_ERROR);
GET_UCHAR(BZ_X_BLKHDR_6, uc);
if (uc != 0x59) RETURN(BZ_DATA_ERROR);
s->currBlockNo++;
if (s->verbosity >= 2)
VPrintf1 ( "\n [%d: huff+mtf ", s->currBlockNo );
s->storedBlockCRC = 0;
GET_UCHAR(BZ_X_BCRC_1, uc);
s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
GET_UCHAR(BZ_X_BCRC_2, uc);
s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
GET_UCHAR(BZ_X_BCRC_3, uc);
s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
GET_UCHAR(BZ_X_BCRC_4, uc);
s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
GET_BITS(BZ_X_RANDBIT, s->blockRandomised, 1);
s->origPtr = 0;
GET_UCHAR(BZ_X_ORIGPTR_1, uc);
s->origPtr = (s->origPtr << 8) | ((Int32)uc);
GET_UCHAR(BZ_X_ORIGPTR_2, uc);
s->origPtr = (s->origPtr << 8) | ((Int32)uc);
GET_UCHAR(BZ_X_ORIGPTR_3, uc);
s->origPtr = (s->origPtr << 8) | ((Int32)uc);
if (s->origPtr < 0)
RETURN(BZ_DATA_ERROR);
if (s->origPtr > 10 + 100000*s->blockSize100k)
RETURN(BZ_DATA_ERROR);
/*--- Receive the mapping table ---*/
for (i = 0; i < 16; i++) {
GET_BIT(BZ_X_MAPPING_1, uc);
if (uc == 1)
s->inUse16[i] = True; else
s->inUse16[i] = False;
}
for (i = 0; i < 256; i++) s->inUse[i] = False;
for (i = 0; i < 16; i++)
if (s->inUse16[i])
for (j = 0; j < 16; j++) {
GET_BIT(BZ_X_MAPPING_2, uc);
if (uc == 1) s->inUse[i * 16 + j] = True;
}
makeMaps_d ( s );
if (s->nInUse == 0) RETURN(BZ_DATA_ERROR);
alphaSize = s->nInUse+2;
/*--- Now the selectors ---*/
GET_BITS(BZ_X_SELECTOR_1, nGroups, 3);
if (nGroups < 2 || nGroups > BZ_N_GROUPS) RETURN(BZ_DATA_ERROR);
GET_BITS(BZ_X_SELECTOR_2, nSelectors, 15);
if (nSelectors < 1) RETURN(BZ_DATA_ERROR);
for (i = 0; i < nSelectors; i++) {
j = 0;
while (True) {
GET_BIT(BZ_X_SELECTOR_3, uc);
if (uc == 0) break;
j++;
if (j >= nGroups) RETURN(BZ_DATA_ERROR);
}
/* Having more than BZ_MAX_SELECTORS doesn't make much sense
since they will never be used, but some implementations might
"round up" the number of selectors, so just ignore those. */
if (i < BZ_MAX_SELECTORS)
s->selectorMtf[i] = j;
}
if (nSelectors > BZ_MAX_SELECTORS)
nSelectors = BZ_MAX_SELECTORS;
/*--- Undo the MTF values for the selectors. ---*/
{
UChar pos[BZ_N_GROUPS], tmp, v;
for (v = 0; v < nGroups; v++) pos[v] = v;
for (i = 0; i < nSelectors; i++) {
v = s->selectorMtf[i];
tmp = pos[v];
while (v > 0) { pos[v] = pos[v-1]; v--; }
pos[0] = tmp;
s->selector[i] = tmp;
}
}
/*--- Now the coding tables ---*/
for (t = 0; t < nGroups; t++) {
GET_BITS(BZ_X_CODING_1, curr, 5);
for (i = 0; i < alphaSize; i++) {
while (True) {
if (curr < 1 || curr > 20) RETURN(BZ_DATA_ERROR);
GET_BIT(BZ_X_CODING_2, uc);
if (uc == 0) break;
GET_BIT(BZ_X_CODING_3, uc);
if (uc == 0) curr++; else curr--;
}
s->len[t][i] = curr;
}
}
/*--- Create the Huffman decoding tables ---*/
for (t = 0; t < nGroups; t++) {
minLen = 32;
maxLen = 0;
for (i = 0; i < alphaSize; i++) {
if (s->len[t][i] > maxLen) maxLen = s->len[t][i];
if (s->len[t][i] < minLen) minLen = s->len[t][i];
}
BZ2_hbCreateDecodeTables (
&(s->limit[t][0]),
&(s->base[t][0]),
&(s->perm[t][0]),
&(s->len[t][0]),
minLen, maxLen, alphaSize
);
s->minLens[t] = minLen;
}
/*--- Now the MTF values ---*/
EOB = s->nInUse+1;
nblockMAX = 100000 * s->blockSize100k;
groupNo = -1;
groupPos = 0;
for (i = 0; i <= 255; i++) s->unzftab[i] = 0;
/*-- MTF init --*/
{
Int32 ii, jj, kk;
kk = MTFA_SIZE-1;
for (ii = 256 / MTFL_SIZE - 1; ii >= 0; ii--) {
for (jj = MTFL_SIZE-1; jj >= 0; jj--) {
s->mtfa[kk] = (UChar)(ii * MTFL_SIZE + jj);
kk--;
}
s->mtfbase[ii] = kk + 1;
}
}
/*-- end MTF init --*/
nblock = 0;
GET_MTF_VAL(BZ_X_MTF_1, BZ_X_MTF_2, nextSym);
while (True) {
if (nextSym == EOB) break;
if (nextSym == BZ_RUNA || nextSym == BZ_RUNB) {
es = -1;
N = 1;
do {
/* Check that N doesn't get too big, so that es doesn't
go negative. The maximum value that can be
RUNA/RUNB encoded is equal to the block size (post
the initial RLE), viz, 900k, so bounding N at 2
million should guard against overflow without
rejecting any legitimate inputs. */
if (N >= 2*1024*1024) RETURN(BZ_DATA_ERROR);
if (nextSym == BZ_RUNA) es = es + (0+1) * N; else
if (nextSym == BZ_RUNB) es = es + (1+1) * N;
N = N * 2;
GET_MTF_VAL(BZ_X_MTF_3, BZ_X_MTF_4, nextSym);
}
while (nextSym == BZ_RUNA || nextSym == BZ_RUNB);
es++;
uc = s->seqToUnseq[ s->mtfa[s->mtfbase[0]] ];
s->unzftab[uc] += es;
if (s->smallDecompress)
while (es > 0) {
if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
s->ll16[nblock] = (UInt16)uc;
nblock++;
es--;
}
else
while (es > 0) {
if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
s->tt[nblock] = (UInt32)uc;
nblock++;
es--;
};
continue;
} else {
if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
/*-- uc = MTF ( nextSym-1 ) --*/
{
Int32 ii, jj, kk, pp, lno, off;
UInt32 nn;
nn = (UInt32)(nextSym - 1);
if (nn < MTFL_SIZE) {
/* avoid general-case expense */
pp = s->mtfbase[0];
uc = s->mtfa[pp+nn];
while (nn > 3) {
Int32 z = pp+nn;
s->mtfa[(z) ] = s->mtfa[(z)-1];
s->mtfa[(z)-1] = s->mtfa[(z)-2];
s->mtfa[(z)-2] = s->mtfa[(z)-3];
s->mtfa[(z)-3] = s->mtfa[(z)-4];
nn -= 4;
}
while (nn > 0) {
s->mtfa[(pp+nn)] = s->mtfa[(pp+nn)-1]; nn--;
};
s->mtfa[pp] = uc;
} else {
/* general case */
lno = nn / MTFL_SIZE;
off = nn % MTFL_SIZE;
pp = s->mtfbase[lno] + off;
uc = s->mtfa[pp];
while (pp > s->mtfbase[lno]) {
s->mtfa[pp] = s->mtfa[pp-1]; pp--;
};
s->mtfbase[lno]++;
while (lno > 0) {
s->mtfbase[lno]--;
s->mtfa[s->mtfbase[lno]]
= s->mtfa[s->mtfbase[lno-1] + MTFL_SIZE - 1];
lno--;
}
s->mtfbase[0]--;
s->mtfa[s->mtfbase[0]] = uc;
if (s->mtfbase[0] == 0) {
kk = MTFA_SIZE-1;
for (ii = 256 / MTFL_SIZE-1; ii >= 0; ii--) {
for (jj = MTFL_SIZE-1; jj >= 0; jj--) {
s->mtfa[kk] = s->mtfa[s->mtfbase[ii] + jj];
kk--;
}
s->mtfbase[ii] = kk + 1;
}
}
}
}
/*-- end uc = MTF ( nextSym-1 ) --*/
s->unzftab[s->seqToUnseq[uc]]++;
if (s->smallDecompress)
s->ll16[nblock] = (UInt16)(s->seqToUnseq[uc]); else
s->tt[nblock] = (UInt32)(s->seqToUnseq[uc]);
nblock++;
GET_MTF_VAL(BZ_X_MTF_5, BZ_X_MTF_6, nextSym);
continue;
}
}
/* Now we know what nblock is, we can do a better sanity
check on s->origPtr.
*/
if (s->origPtr < 0 || s->origPtr >= nblock)
RETURN(BZ_DATA_ERROR);
/*-- Set up cftab to facilitate generation of T^(-1) --*/
/* Check: unzftab entries in range. */
for (i = 0; i <= 255; i++) {
if (s->unzftab[i] < 0 || s->unzftab[i] > nblock)
RETURN(BZ_DATA_ERROR);
}
/* Actually generate cftab. */
s->cftab[0] = 0;
for (i = 1; i <= 256; i++) s->cftab[i] = s->unzftab[i-1];
for (i = 1; i <= 256; i++) s->cftab[i] += s->cftab[i-1];
/* Check: cftab entries in range. */
for (i = 0; i <= 256; i++) {
if (s->cftab[i] < 0 || s->cftab[i] > nblock) {
/* s->cftab[i] can legitimately be == nblock */
RETURN(BZ_DATA_ERROR);
}
}
/* Check: cftab entries non-descending. */
for (i = 1; i <= 256; i++) {
if (s->cftab[i-1] > s->cftab[i]) {
RETURN(BZ_DATA_ERROR);
}
}
s->state_out_len = 0;
s->state_out_ch = 0;
BZ_INITIALISE_CRC ( s->calculatedBlockCRC );
s->state = BZ_X_OUTPUT;
if (s->verbosity >= 2) VPrintf0 ( "rt+rld" );
if (s->smallDecompress) {
/*-- Make a copy of cftab, used in generation of T --*/
for (i = 0; i <= 256; i++) s->cftabCopy[i] = s->cftab[i];
/*-- compute the T vector --*/
for (i = 0; i < nblock; i++) {
uc = (UChar)(s->ll16[i]);
SET_LL(i, s->cftabCopy[uc]);
s->cftabCopy[uc]++;
}
/*-- Compute T^(-1) by pointer reversal on T --*/
i = s->origPtr;
j = GET_LL(i);
do {
Int32 tmp = GET_LL(j);
SET_LL(j, i);
i = j;
j = tmp;
}
while (i != s->origPtr);
s->tPos = s->origPtr;
s->nblock_used = 0;
if (s->blockRandomised) {
BZ_RAND_INIT_MASK;
BZ_GET_SMALL(s->k0); s->nblock_used++;
BZ_RAND_UPD_MASK; s->k0 ^= BZ_RAND_MASK;
} else {
BZ_GET_SMALL(s->k0); s->nblock_used++;
}
} else {
/*-- compute the T^(-1) vector --*/
for (i = 0; i < nblock; i++) {
uc = (UChar)(s->tt[i] & 0xff);
s->tt[s->cftab[uc]] |= (i << 8);
s->cftab[uc]++;
}
s->tPos = s->tt[s->origPtr] >> 8;
s->nblock_used = 0;
if (s->blockRandomised) {
BZ_RAND_INIT_MASK;
BZ_GET_FAST(s->k0); s->nblock_used++;
BZ_RAND_UPD_MASK; s->k0 ^= BZ_RAND_MASK;
} else {
BZ_GET_FAST(s->k0); s->nblock_used++;
}
}
RETURN(BZ_OK);
endhdr_2:
GET_UCHAR(BZ_X_ENDHDR_2, uc);
if (uc != 0x72) RETURN(BZ_DATA_ERROR);
GET_UCHAR(BZ_X_ENDHDR_3, uc);
if (uc != 0x45) RETURN(BZ_DATA_ERROR);
GET_UCHAR(BZ_X_ENDHDR_4, uc);
if (uc != 0x38) RETURN(BZ_DATA_ERROR);
GET_UCHAR(BZ_X_ENDHDR_5, uc);
if (uc != 0x50) RETURN(BZ_DATA_ERROR);
GET_UCHAR(BZ_X_ENDHDR_6, uc);
if (uc != 0x90) RETURN(BZ_DATA_ERROR);
s->storedCombinedCRC = 0;
GET_UCHAR(BZ_X_CCRC_1, uc);
s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc);
GET_UCHAR(BZ_X_CCRC_2, uc);
s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc);
GET_UCHAR(BZ_X_CCRC_3, uc);
s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc);
GET_UCHAR(BZ_X_CCRC_4, uc);
s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc);
s->state = BZ_X_IDLE;
RETURN(BZ_STREAM_END);
default: AssertH ( False, 4001 );
}
AssertH ( False, 4002 );
save_state_and_return:
s->save_i = i;
s->save_j = j;
s->save_t = t;
s->save_alphaSize = alphaSize;
s->save_nGroups = nGroups;
s->save_nSelectors = nSelectors;
s->save_EOB = EOB;
s->save_groupNo = groupNo;
s->save_groupPos = groupPos;
s->save_nextSym = nextSym;
s->save_nblockMAX = nblockMAX;
s->save_nblock = nblock;
s->save_es = es;
s->save_N = N;
s->save_curr = curr;
s->save_zt = zt;
s->save_zn = zn;
s->save_zvec = zvec;
s->save_zj = zj;
s->save_gSel = gSel;
s->save_gMinlen = gMinlen;
s->save_gLimit = gLimit;
s->save_gBase = gBase;
s->save_gPerm = gPerm;
return retVal;
}
/*-------------------------------------------------------------*/
/*--- end decompress.c ---*/
/*-------------------------------------------------------------*/
| 21,301 | 654 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/format.pl | #!/usr/bin/perl -w
#
# ------------------------------------------------------------------
# This file is part of bzip2/libbzip2, a program and library for
# lossless, block-sorting data compression.
#
# bzip2/libbzip2 version 1.0.8 of 13 July 2019
# Copyright (C) 1996-2019 Julian Seward <[email protected]>
#
# Please read the WARNING, DISCLAIMER and PATENTS sections in the
# README file.
#
# This program is released under the terms of the license contained
# in the file LICENSE.
# ------------------------------------------------------------------
#
use strict;
# get command line values:
if ( $#ARGV !=1 ) {
die "Usage: $0 xml_infile xml_outfile\n";
}
my $infile = shift;
# check infile exists
die "Can't find file \"$infile\""
unless -f $infile;
# check we can read infile
if (! -r $infile) {
die "Can't read input $infile\n";
}
# check we can open infile
open( INFILE,"<$infile" ) or
die "Can't input $infile $!";
#my $outfile = 'fmt-manual.xml';
my $outfile = shift;
#print "Infile: $infile, Outfile: $outfile\n";
# check we can write to outfile
open( OUTFILE,">$outfile" ) or
die "Can't output $outfile $! for writing";
my ($prev, $curr, $str);
$prev = ''; $curr = '';
while ( <INFILE> ) {
print OUTFILE $prev;
$prev = $curr;
$curr = $_;
$str = '';
if ( $prev =~ /<programlisting>$|<screen>$/ ) {
chomp $prev;
$curr = join( '', $prev, "<![CDATA[", $curr );
$prev = '';
next;
}
elsif ( $curr =~ /<\/programlisting>|<\/screen>/ ) {
chomp $prev;
$curr = join( '', $prev, "]]>", $curr );
$prev = '';
next;
}
}
print OUTFILE $curr;
close INFILE;
close OUTFILE;
exit;
| 1,684 | 69 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzip2.1 | .PU
.TH bzip2 1
.SH NAME
bzip2, bunzip2 \- a block-sorting file compressor, v1.0.8
.br
bzcat \- decompresses files to stdout
.br
bzip2recover \- recovers data from damaged bzip2 files
.SH SYNOPSIS
.ll +8
.B bzip2
.RB [ " \-cdfkqstvzVL123456789 " ]
[
.I "filenames \&..."
]
.ll -8
.br
.B bunzip2
.RB [ " \-fkvsVL " ]
[
.I "filenames \&..."
]
.br
.B bzcat
.RB [ " \-s " ]
[
.I "filenames \&..."
]
.br
.B bzip2recover
.I "filename"
.SH DESCRIPTION
.I bzip2
compresses files using the Burrows-Wheeler block sorting
text compression algorithm, and Huffman coding. Compression is
generally considerably better than that achieved by more conventional
LZ77/LZ78-based compressors, and approaches the performance of the PPM
family of statistical compressors.
The command-line options are deliberately very similar to
those of
.I GNU gzip,
but they are not identical.
.I bzip2
expects a list of file names to accompany the
command-line flags. Each file is replaced by a compressed version of
itself, with the name "original_name.bz2".
Each compressed file
has the same modification date, permissions, and, when possible,
ownership as the corresponding original, so that these properties can
be correctly restored at decompression time. File name handling is
naive in the sense that there is no mechanism for preserving original
file names, permissions, ownerships or dates in filesystems which lack
these concepts, or have serious file name length restrictions, such as
MS-DOS.
.I bzip2
and
.I bunzip2
will by default not overwrite existing
files. If you want this to happen, specify the \-f flag.
If no file names are specified,
.I bzip2
compresses from standard
input to standard output. In this case,
.I bzip2
will decline to
write compressed output to a terminal, as this would be entirely
incomprehensible and therefore pointless.
.I bunzip2
(or
.I bzip2 \-d)
decompresses all
specified files. Files which were not created by
.I bzip2
will be detected and ignored, and a warning issued.
.I bzip2
attempts to guess the filename for the decompressed file
from that of the compressed file as follows:
filename.bz2 becomes filename
filename.bz becomes filename
filename.tbz2 becomes filename.tar
filename.tbz becomes filename.tar
anyothername becomes anyothername.out
If the file does not end in one of the recognised endings,
.I .bz2,
.I .bz,
.I .tbz2
or
.I .tbz,
.I bzip2
complains that it cannot
guess the name of the original file, and uses the original name
with
.I .out
appended.
As with compression, supplying no
filenames causes decompression from
standard input to standard output.
.I bunzip2
will correctly decompress a file which is the
concatenation of two or more compressed files. The result is the
concatenation of the corresponding uncompressed files. Integrity
testing (\-t)
of concatenated
compressed files is also supported.
You can also compress or decompress files to the standard output by
giving the \-c flag. Multiple files may be compressed and
decompressed like this. The resulting outputs are fed sequentially to
stdout. Compression of multiple files
in this manner generates a stream
containing multiple compressed file representations. Such a stream
can be decompressed correctly only by
.I bzip2
version 0.9.0 or
later. Earlier versions of
.I bzip2
will stop after decompressing
the first file in the stream.
.I bzcat
(or
.I bzip2 -dc)
decompresses all specified files to
the standard output.
.I bzip2
will read arguments from the environment variables
.I BZIP2
and
.I BZIP,
in that order, and will process them
before any arguments read from the command line. This gives a
convenient way to supply default arguments.
Compression is always performed, even if the compressed
file is slightly
larger than the original. Files of less than about one hundred bytes
tend to get larger, since the compression mechanism has a constant
overhead in the region of 50 bytes. Random data (including the output
of most file compressors) is coded at about 8.05 bits per byte, giving
an expansion of around 0.5%.
As a self-check for your protection,
.I
bzip2
uses 32-bit CRCs to
make sure that the decompressed version of a file is identical to the
original. This guards against corruption of the compressed data, and
against undetected bugs in
.I bzip2
(hopefully very unlikely). The
chances of data corruption going undetected is microscopic, about one
chance in four billion for each file processed. Be aware, though, that
the check occurs upon decompression, so it can only tell you that
something is wrong. It can't help you
recover the original uncompressed
data. You can use
.I bzip2recover
to try to recover data from
damaged files.
Return values: 0 for a normal exit, 1 for environmental problems (file
not found, invalid flags, I/O errors, &c), 2 to indicate a corrupt
compressed file, 3 for an internal consistency error (eg, bug) which
caused
.I bzip2
to panic.
.SH OPTIONS
.TP
.B \-c --stdout
Compress or decompress to standard output.
.TP
.B \-d --decompress
Force decompression.
.I bzip2,
.I bunzip2
and
.I bzcat
are
really the same program, and the decision about what actions to take is
done on the basis of which name is used. This flag overrides that
mechanism, and forces
.I bzip2
to decompress.
.TP
.B \-z --compress
The complement to \-d: forces compression, regardless of the
invocation name.
.TP
.B \-t --test
Check integrity of the specified file(s), but don't decompress them.
This really performs a trial decompression and throws away the result.
.TP
.B \-f --force
Force overwrite of output files. Normally,
.I bzip2
will not overwrite
existing output files. Also forces
.I bzip2
to break hard links
to files, which it otherwise wouldn't do.
bzip2 normally declines to decompress files which don't have the
correct magic header bytes. If forced (-f), however, it will pass
such files through unmodified. This is how GNU gzip behaves.
.TP
.B \-k --keep
Keep (don't delete) input files during compression
or decompression.
.TP
.B \-s --small
Reduce memory usage, for compression, decompression and testing. Files
are decompressed and tested using a modified algorithm which only
requires 2.5 bytes per block byte. This means any file can be
decompressed in 2300k of memory, albeit at about half the normal speed.
During compression, \-s selects a block size of 200k, which limits
memory use to around the same figure, at the expense of your compression
ratio. In short, if your machine is low on memory (8 megabytes or
less), use \-s for everything. See MEMORY MANAGEMENT below.
.TP
.B \-q --quiet
Suppress non-essential warning messages. Messages pertaining to
I/O errors and other critical events will not be suppressed.
.TP
.B \-v --verbose
Verbose mode -- show the compression ratio for each file processed.
Further \-v's increase the verbosity level, spewing out lots of
information which is primarily of interest for diagnostic purposes.
.TP
.B \-L --license -V --version
Display the software version, license terms and conditions.
.TP
.B \-1 (or \-\-fast) to \-9 (or \-\-best)
Set the block size to 100 k, 200 k .. 900 k when compressing. Has no
effect when decompressing. See MEMORY MANAGEMENT below.
The \-\-fast and \-\-best aliases are primarily for GNU gzip
compatibility. In particular, \-\-fast doesn't make things
significantly faster.
And \-\-best merely selects the default behaviour.
.TP
.B \--
Treats all subsequent arguments as file names, even if they start
with a dash. This is so you can handle files with names beginning
with a dash, for example: bzip2 \-- \-myfilename.
.TP
.B \--repetitive-fast --repetitive-best
These flags are redundant in versions 0.9.5 and above. They provided
some coarse control over the behaviour of the sorting algorithm in
earlier versions, which was sometimes useful. 0.9.5 and above have an
improved algorithm which renders these flags irrelevant.
.SH MEMORY MANAGEMENT
.I bzip2
compresses large files in blocks. The block size affects
both the compression ratio achieved, and the amount of memory needed for
compression and decompression. The flags \-1 through \-9
specify the block size to be 100,000 bytes through 900,000 bytes (the
default) respectively. At decompression time, the block size used for
compression is read from the header of the compressed file, and
.I bunzip2
then allocates itself just enough memory to decompress
the file. Since block sizes are stored in compressed files, it follows
that the flags \-1 to \-9 are irrelevant to and so ignored
during decompression.
Compression and decompression requirements,
in bytes, can be estimated as:
Compression: 400k + ( 8 x block size )
Decompression: 100k + ( 4 x block size ), or
100k + ( 2.5 x block size )
Larger block sizes give rapidly diminishing marginal returns. Most of
the compression comes from the first two or three hundred k of block
size, a fact worth bearing in mind when using
.I bzip2
on small machines.
It is also important to appreciate that the decompression memory
requirement is set at compression time by the choice of block size.
For files compressed with the default 900k block size,
.I bunzip2
will require about 3700 kbytes to decompress. To support decompression
of any file on a 4 megabyte machine,
.I bunzip2
has an option to
decompress using approximately half this amount of memory, about 2300
kbytes. Decompression speed is also halved, so you should use this
option only where necessary. The relevant flag is -s.
In general, try and use the largest block size memory constraints allow,
since that maximises the compression achieved. Compression and
decompression speed are virtually unaffected by block size.
Another significant point applies to files which fit in a single block
-- that means most files you'd encounter using a large block size. The
amount of real memory touched is proportional to the size of the file,
since the file is smaller than a block. For example, compressing a file
20,000 bytes long with the flag -9 will cause the compressor to
allocate around 7600k of memory, but only touch 400k + 20000 * 8 = 560
kbytes of it. Similarly, the decompressor will allocate 3700k but only
touch 100k + 20000 * 4 = 180 kbytes.
Here is a table which summarises the maximum memory usage for different
block sizes. Also recorded is the total compressed size for 14 files of
the Calgary Text Compression Corpus totalling 3,141,622 bytes. This
column gives some feel for how compression varies with block size.
These figures tend to understate the advantage of larger block sizes for
larger files, since the Corpus is dominated by smaller files.
Compress Decompress Decompress Corpus
Flag usage usage -s usage Size
-1 1200k 500k 350k 914704
-2 2000k 900k 600k 877703
-3 2800k 1300k 850k 860338
-4 3600k 1700k 1100k 846899
-5 4400k 2100k 1350k 845160
-6 5200k 2500k 1600k 838626
-7 6100k 2900k 1850k 834096
-8 6800k 3300k 2100k 828642
-9 7600k 3700k 2350k 828642
.SH RECOVERING DATA FROM DAMAGED FILES
.I bzip2
compresses files in blocks, usually 900kbytes long. Each
block is handled independently. If a media or transmission error causes
a multi-block .bz2
file to become damaged, it may be possible to
recover data from the undamaged blocks in the file.
The compressed representation of each block is delimited by a 48-bit
pattern, which makes it possible to find the block boundaries with
reasonable certainty. Each block also carries its own 32-bit CRC, so
damaged blocks can be distinguished from undamaged ones.
.I bzip2recover
is a simple program whose purpose is to search for
blocks in .bz2 files, and write each block out into its own .bz2
file. You can then use
.I bzip2
\-t
to test the
integrity of the resulting files, and decompress those which are
undamaged.
.I bzip2recover
takes a single argument, the name of the damaged file,
and writes a number of files "rec00001file.bz2",
"rec00002file.bz2", etc, containing the extracted blocks.
The output filenames are designed so that the use of
wildcards in subsequent processing -- for example,
"bzip2 -dc rec*file.bz2 > recovered_data" -- processes the files in
the correct order.
.I bzip2recover
should be of most use dealing with large .bz2
files, as these will contain many blocks. It is clearly
futile to use it on damaged single-block files, since a
damaged block cannot be recovered. If you wish to minimise
any potential data loss through media or transmission errors,
you might consider compressing with a smaller
block size.
.SH PERFORMANCE NOTES
The sorting phase of compression gathers together similar strings in the
file. Because of this, files containing very long runs of repeated
symbols, like "aabaabaabaab ..." (repeated several hundred times) may
compress more slowly than normal. Versions 0.9.5 and above fare much
better than previous versions in this respect. The ratio between
worst-case and average-case compression time is in the region of 10:1.
For previous versions, this figure was more like 100:1. You can use the
\-vvvv option to monitor progress in great detail, if you want.
Decompression speed is unaffected by these phenomena.
.I bzip2
usually allocates several megabytes of memory to operate
in, and then charges all over it in a fairly random fashion. This means
that performance, both for compressing and decompressing, is largely
determined by the speed at which your machine can service cache misses.
Because of this, small changes to the code to reduce the miss rate have
been observed to give disproportionately large performance improvements.
I imagine
.I bzip2
will perform best on machines with very large caches.
.SH CAVEATS
I/O error messages are not as helpful as they could be.
.I bzip2
tries hard to detect I/O errors and exit cleanly, but the details of
what the problem is sometimes seem rather misleading.
This manual page pertains to version 1.0.8 of
.I bzip2.
Compressed data created by this version is entirely forwards and
backwards compatible with the previous public releases, versions
0.1pl2, 0.9.0, 0.9.5, 1.0.0, 1.0.1, 1.0.2 and above, but with the following
exception: 0.9.0 and above can correctly decompress multiple
concatenated compressed files. 0.1pl2 cannot do this; it will stop
after decompressing just the first file in the stream.
.I bzip2recover
versions prior to 1.0.2 used 32-bit integers to represent
bit positions in compressed files, so they could not handle compressed
files more than 512 megabytes long. Versions 1.0.2 and above use
64-bit ints on some platforms which support them (GNU supported
targets, and Windows). To establish whether or not bzip2recover was
built with such a limitation, run it without arguments. In any event
you can build yourself an unlimited version if you can recompile it
with MaybeUInt64 set to be an unsigned 64-bit integer.
.SH AUTHOR
Julian Seward, [email protected].
https://sourceware.org/bzip2/
The ideas embodied in
.I bzip2
are due to (at least) the following
people: Michael Burrows and David Wheeler (for the block sorting
transformation), David Wheeler (again, for the Huffman coder), Peter
Fenwick (for the structured coding model in the original
.I bzip,
and many refinements), and Alistair Moffat, Radford Neal and Ian Witten
(for the arithmetic coder in the original
.I bzip).
I am much
indebted for their help, support and advice. See the manual in the
source distribution for pointers to sources of documentation. Christian
von Roques encouraged me to look for faster sorting algorithms, so as to
speed up compression. Bela Lubkin encouraged me to improve the
worst-case compression performance.
Donna Robinson XMLised the documentation.
The bz* scripts are derived from those of GNU gzip.
Many people sent patches, helped
with portability problems, lent machines, gave advice and were generally
helpful.
| 16,266 | 455 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/words0 |
If compilation produces errors, or a large number of warnings,
please read README.COMPILATION.PROBLEMS -- you might be able to
adjust the flags in this Makefile to improve matters.
Also in README.COMPILATION.PROBLEMS are some hints that may help
if your build produces an executable which is unable to correctly
handle so-called 'large files' -- files of size 2GB or more.
| 376 | 10 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzdiff.1 | \"Shamelessly copied from zmore.1 by Philippe Troin <[email protected]>
\"for Debian GNU/Linux
.TH BZDIFF 1
.SH NAME
bzcmp, bzdiff \- compare bzip2 compressed files
.SH SYNOPSIS
.B bzcmp
[ cmp_options ] file1
[ file2 ]
.br
.B bzdiff
[ diff_options ] file1
[ file2 ]
.SH DESCRIPTION
.I Bzcmp
and
.I bzdiff
are used to invoke the
.I cmp
or the
.I diff
program on bzip2 compressed files. All options specified are passed
directly to
.I cmp
or
.IR diff "."
If only 1 file is specified, then the files compared are
.I file1
and an uncompressed
.IR file1 ".bz2."
If two files are specified, then they are uncompressed if necessary and fed to
.I cmp
or
.IR diff "."
The exit status from
.I cmp
or
.I diff
is preserved.
.SH "SEE ALSO"
cmp(1), diff(1), bzmore(1), bzless(1), bzgrep(1), bzip2(1)
.SH BUGS
Messages from the
.I cmp
or
.I diff
programs refer to temporary filenames instead of those specified.
| 897 | 48 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/sample2.bz2 | BZh21AY&SY|1Éaýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿá=
ï}Îç` h Ð 6®¼J£ÛÜ°W@묻Õ(e NÆùÝè÷®9 h ' |sß îà
° ØP xÖ M®î»áz :<{¢·aîϯrÞ÷Üìߦ£³H·;ΩTóéÝöø>ûwzólöîØ8X¸µlõ=m&ÌR÷=7¾r¯²Úßsà>ï¼%]à g9¾Þ÷£`ÙUlØ É7¹Þûwv¾¼@ è` ;{{fAX:à]÷zö:jfõrí ]dk£Üd
½Ê Û| ì {}»0KíqîªoZð|´¤}¹'cå9åTï+ã(>ξöÛEsw5¯»A´Üwݽõ«ïvw´ Q ½÷·Å¾ï<õ½íÞÅ»tuêvÀûbMY6ûo|ïZuJ·®µö¶Þ}Õ麟««»0îÑÎàìïuñ¯+]ãÜctûÛ£ 7Ýë¶IT ÝÍÖݾ&ùêîwB¨4^óï£p=cu÷·»ë¶Õ®øLîzè=
ÕµïXhª}ï>½ÖGÒÐØ]: UõË9ï´ÀK_úQs¾Ñmßs½ofß+åwÛ $ ZtW|ÞçgÖò *vη½ÜÞëotë×vÁõÛíÝëÝVHh z*@t&À : t £@
,×@ ÷ß| õ÷tß#ëP i±áïl9àáò>ß Å@ )ê«%æà ÑA@ ° # }^rº B &`Ó L!&F4Èɦ4ÓMF )í Í
4 SÈ! 124Ñ=)àIêy Ñè3Iä(ôFF¦§¨hzÈ C& =F
hHÈ ¦U<ÚIíS#ODÓÒ&S'êCÊ~¤õ4zõOQåQ4i²6F5 Ð ¦Ô4ôiê ¡£'P õG©ê=FPbhÐÑ Õ)MDÒÒ¦Ò §ê§éOHõ ¦#Ô44M Iêd
ÔF $ ¦ÐÒfC@
42M
0jShM¦ª~M5Sð§
Oz'0§¦Ú4ÒÍSÚ?ÐJy¥?I¨$ÔH @&CM4ÓMLðiMäÂhÅ4õ=4&ÑM©ê©êfLÕ=0úi1©´ïTÔ~IèÄSØ#Ô5OÔôOD&*~=5?Ò§äÔÓLM0q D$Ê2léô(Ò§QSUWY[]QSUWY[]Y]Z ס|8pß0þ«6Íg äâHKô- z§ûS¹A(ªLãÔXûëc4I>åöþq[-/»v¾ëkwSb)À¢n©c:6 ¶8ÞvH`|ÿÕÒ'9í¼6ooòoæ·DQ+{ÏSêmÜCSßкÈ+Êò4«{Æû¯Áê2(ù³qdôÐ59®=ÐîÏ¡Ï<q(3ÝX¡óId÷R>4\nJÑV %ø@ÌüçeDVø(ªtV®Øâ¸I8xçOz?¶&t¸íá9Z
Nú DúØ<ñÀϵôüìóBR"¶)]WþÅèR!E¦Ù¶Ìh¿:ª"ÁaûÀû¬ DzW65¥ý¿X¸K^yÕ¼hª2¡b°\44 Ñ´É- ª)PP0þ*R
³ã6~s0±ÿ³»Wÿ'¢Dnü}¶ñÏRò3æ³ÿ6»Þ¶p6Ó']¬e oÊ Pu·N2: ïí Ç~«F¢ÒTdP)ê+n Và£ÐÙë©Ê§¹²
ó̱¹¬HÔr9lC{"`Ì·"ààÞBcAR}û ÚÆHå&äK§[Q+åÎ9uwuÝ» 2¹zó
wpLówMÝ»à¹yÚ.Fº> »Ë×;ø_å:¼éæLî¹HÝrÎq.í¹$Üîî¾+NsêþfÕ¯ðji½^ÞÆK»µÝvæíÝÒK»¢ÝÛ°cì1°)f\¸ÒÌܺÐÐck®ès$ѲQ®m®fìÕe£EFç`P¦4SlÛdØ¢t´Ù!.sºæ¹\¢åp¢M25÷eº^w 9rs¥s¹Ôèâñrº±Rºwoþ\Éw Ä¢]Û;»¸R ºéW:ÎèÌѲ\ªwFÄ»)¹Ãêµç~IxÞ 6ôº ä
F2)¦(£HPÿåÿN/ãoßs[ºèîº~>q;|ß/Wï¯kÀ wRoâ¿»ÿGÏ7¶å·. ·"s¬î#sA£èw[æxÄD2ÎèÇ.»ô:?×}×뾫Å3àá±·#£»ºìsºb§ãÕ*¡uP.Ë«¿GRÓkBöä£G.îܨ×wNësnfå¸îÖæéõ:ï;_j¼y×ÍåÔ<í\®WL4C°dÜèNídç<reâêfrä
wvR]Ü»¸I(Ç.Ì$DØ6H1ù
ùò¢ó»c#»]N\ݹ14XdLù»nÅO;¼îLõÜ&E!érFÎq!wtaQËûgQJ«ÅËwnÌ©wD´Ù¢\ÝàwwµÎä]Ý
ãyÇs¨¦3§vëºØm´åÂù»¨^9 ©¯¿îÇ¿Âó¶U, føö8hÞ»·}/ _Ƚ|Ýróß %«þ ÁûÿÀ¬Üq_»T#ùÍUHUvBN]Î ºóò¾z½Lî\ßYÛ×wÏÝO;Nâ'; 3DÎë%ó®g7áç} /Kñó¯DÑôw"ó®#»p4ÊîæÖ¢´k6mIbÅnk[&1D%3%H¶BçPÚt®JÅ)mHç+%&´iJs[µ2ÙË+6ÆÔ5IcTÓQ79òd¯p |à,½®îÞ¼Üó®`wuã+ææ>ÓMʾ²¹Þ¸¯3»§u%v ôþ'Ï=-ÓEÎZW±lDëëfz zð¦@ê`Üñ0
Ã?ëZL§ïÜß_×M¤¾
vnmÍ}^¸¢Áï¸ÁzEpØ·[ýåzF½5IM**öVÑAåX| ~¦x?°Ò)&~£ÿ3ù^Îz>èç)<¾9q#( p(#|(BAzé+:) ¢Ã'CÓ%åFih%H$>ÕGó®gÂjd¯
É|
sƸõ>s¿ü°ÎËÁrKKÈÆù²°¬<rbò}õÌ <Ûyé¢8CÌX,q$dªÿ"bs<2Ë>³îe|µDû,²ì¸èBßp5EûÿÙbqMp Úq~÷k.^Lð" RDtò}&ïû/ÄdÏr¾.Ê
òH[Õ¨)«G¬
2°AvØꪴëÌñy¿wº¶ÇÈoûMéÃ-·îtOXüÒhEC;æ-jVxÛî¼Rïáá3ïnDAçhÝ>_;ë¹>Ó"æ7 þ8!óQzgS+í ¤
÷ª¶³Cë[ DBqô-|Y'k¸ó?Ã0öÝ4)3 ±g¿z#Ï.êÕLþýhÊó±-/âä[ã44°$h hBu)Åêõ÷ã1P}¯CUõ}/pb±ÿ röÈAóÈ;|¶©£ÁVÕïÙ_ò¥ÝÕ{£üÉT)¤P¯T¸àø²÷/òÆQ¬Ìõk\Bðv öܹ¬:";äêl
ëÍÔö9dBJØ
ܽÙAo*Êgs¢QÙ¤I¤à3ê Z[íMUrøb?{¡Ãùr7Ýå»ÏίÑ
L¨A,TÌ3 µÞ¹oYIÅè½JdIÀÖ'7÷}мïÓÒáúÏx@"?.ØÄ[À6u6×ÙRïÿxû, [½ávu @j&®=µ4¾ÊŨ_8=
bçóîu¼(ÅÈôjùïñ¼¤:+¥Vf¥}ÃuÖ©Ëx'×d¾< í!zJÉÃä7ïÉÓ2¯ù§ p(A¬ðñ}EÝPí!¯2ÉlæÅ[Gý
dnǸlÙé,.7êÉó^@ÿ2£d¾æ
TGÕi×aÿNÌÀ׫3MjPi·o¾üþ>Ã=ûéúpDADi"¦#$²]þ穼ó^xÝ/á<ízÐhA4^ÿ?Ûâ6òc£®TîVNxUSM0S¾6¿ " x-,Ä~ò=¾©1GüÛ»s?ï
¤Çö
«/úFÛƶÿßû^a$M! h%ÜÿæzKVB`¡¾GN â´~ÎÆoü®ZÒ Û2Ìg³##4+ ä*Z°´PVµ<EDPÅË{Þ [óvû>ß{þäe¸où$ &`î\âr-Ôðæª4ÞUô °}<Ü
{ÄÚýUßÁ¿vYÈoþE®QûK%mòüÿ¶Ó9úy_V9Ié²ÆÚ0~þ½; ì×P°÷{ïý²þÇGDDa üÒ $4$PØS)¼Ñ¹è_£âié ûΫګí/°@ÎÏB£¼¬ F¶&®Íìº× !üM:VÛ¬ÙáD<>ÕöÜÑb h?T(ÖàQ 1à'±ñ/úeàá¡årÝ÷ããy=
ݺ^sôc±¢ ¶g3ùz Ae¢¹éÉ©õx¸6ß?mè¶w¿àüa¢R$õ û ÀN³ çö78!ÚõÇrÓWïòó`CáÅïyÀí%#0íîý¦æ´1ßû½Ùþ¸§ÇÔêù꾶à' ©ôv-¥³ÿ] wÿEÿ³^·#öê:]èË^î*' æpt·oµ®Røý)#É =o0ÞùϯH· æÑ"Aº^¾´xÅ Õ^G#
Bgyæ~ãvUrªÖRk&7F¹jùeÔ7@çãcÄg.fÅ>`U¨¡lE4nÄ
HÄP
®úüï;¶ûo¸^Cú/ Çk»f§ ×>¦M`
x'tÝÌ¿;Ä~-mWîòÛ®"ÿÎuNöRÿ´|¦Ü?¶05}ÎãSwoÅ»ÿ¹Hì.Ø$oû¨àï QÏȳ*ï&µ»UYÚõ95¯Iæ
Èl²{@nM
ßê°ëü8l+ç 纽öû§ $^¾xð ǻ»f°,vîÐÒX{w¶±í˱ÛåùS²³l¥á¨K´ZÕ¡ûOâþÈý§!},s¹^L&à ÑûÓ|¹Ï¨ §É
> º Ü¢$PCÒѵcø6\´Dj¶5 leÉRZIVÔ(ÿÆÏõ·ó8>n|*û¿»Þußzõh#çÐÿ±´LzÎζWoìVóÆ(ÁâhÄX»E6Yhº1 g¡S*еi+'·ÿf%ïü%üí|éyDا²J êxEÖû(LÒËcöó{¤ `XÕ'ê/«}L²Q})ìÃOMîJ¿fv·øótà0l¢)æµ±ñjFÖÕû'>Á³FDEPîÊkÌ=C
ê:HØ@! q)!Ò¹ ª³|¥WìÉO+¤Q8Þù$µF¼£±7ëµÝξfPßJ*³gxβ ûªöNËPaâ¤
"ñó
ɺúïäCÊÞPûùªÇëнÖhK+÷°ÿZ®é)%ðÒ µt-pW,mÞLn@|»ÜÔIÞïó5ÂÿmvP¢&&<³C mÔ
nCê7®íK:mFyê²mì:êÏV=Ë༧
bÊT F>W½é"æD^5[déë'³¥ÍU¾.óÔ5 +6> 02QäMy /¢æ`¸Y0µ.tiͺ=ù·j>¡@&ÐCz̵âRÿyÈC\× µ]sÈÆÖÆU¿
ëõü}ý§-W¥G1çEצ6]æFÂd*#6axq"e8Ò¼¤ b+¡¡õsôý; }×|¡k=«±5y$î°CT`ÃÊ/r%ÉÖN*_BÂ÷«ÔÂUå(É*ª´X mmAëPÔpéÕoUÈNÖ:ÉÒsØöÓñõÿqǹýøÅu÷~^å9ö-ùUâ ù;,@é°ÈqÄáTºüºåJR´èFg½B|·J1йÖÍ uÊ_é\÷,üÞÚd2s.²©WÑtÉr#,¢æ2$ª»÷k6kó@aÅiË~»¹Øó{×óøú~[»ò¶@PÅàb÷ (#²U%H.Ò¯IÇ㽩p.ÓÚÎõÚlºhü-ëÅ!@QÁSs¥8Ô¾û@!Èkw8E¾¿Ãûűgqå¹Ô%ÌÂB5
%=Æíìu|q ;¶³ÔÒ~ÿ1ÛòW¨oÉ?l£Ô×!×;P<Ù½·z1<§@Æ1º¶2 ÐßÕÂ$nÜçúÃRKrÇúWþÇR8×þ¨ÁjÀÛ÷lÜÄëÕùQ?j b_ß`öËp.ù·=ª\ÏK%43@D?Ð~öä;ùþ#wò³»øåÞj uQáÛ¿Pã=3K>ØÄýÞóéÓ´z+÷øUuÍø{ßÑo{K Îë½xfH1½mÖ:`çRBÕ#;5§ª_Ã0% ²ÝF ùDÔ»òñÏ'&DF 8DâpÁéòÀ->ª bLÒYMéUw/¯Óøi{)ðJYÍáÂe¨´EGPÁð¥éýNcü*hSÎñ¬^ñÅD¬ÞñÅê×~<êº1¬oÁ<k|q¯®>Gf³\aâ%̾OjtT@.Æe¤®X| ÝjàæX¥p¥kJ¯}ÞO½ê.5| ²F5wBª%2gwfbò/Úaüsã½z6_SCë=ïmâ§Î
$#Ï0ýÑÞ-ÁùïWéÒ¦õ©
í¦¡f¦~ ~öݼÜ~ØÅa3 ÙÔFÒºd u~çÍî øÕdM³¯hÊ;òû¡87×ãçÒ#R&>óÁÀª^ÐØÑ"T@`$¹ `eY[nJ@&(ϲ4ÐPy^{þðO#Îc 3êá4å\ì¯%â:¶÷×{¹1vìÙ¯
Y9I½VUÑ6 Ûý0æ vC"ÿqaÏϵãîü7Ïí¡§NÜÉÝß´#b~÷4¶¼/^@°û{û½Nmù¾ön¹N]Ãç$h¸õB¯{ÑpðÃÉ}Dz9ÅX¦¸Rµ SzáXÞ.ºMA}àªMÎ
4 ¦/Ééí}fñíîÆ#¦1ö$9³!Èr^rË}wÄøkå1-!c>û½j>§Ä+²9»] Ê|ºÜ³ÑjDµîÖq#÷ùßýÏó¿ÌÎ?·6Ü ' ª L×í NàäWÍ!¿î2«
{r>ÛÖÖ?É}+|(L0¥£TS%/-Ü¡ Ý80(Í8NI³[0,<ÍýßwøðÒÚ©ÂF.×t8¶ÿ6~ôâfþ íÙ'_mÇö¾û§´Ù ÇðÏq¥§sBj°å×mùS ´ÝååÁôYQ¼¯)ØÛ>×âÏoô_ð;â2¿óË°å %ûB×^/ñû |(ëó7}õþ?· S`¤;§´WAF1c /Y#ߧ]A
Õm~õ\¼[ÑR°çÃÙ& §¹Èóñ lÇ©sub#§h§³µ6t I!Ͷ.}·Ã9õíì1Ñm]ûСߵ= Ù7[¶6üú ï[ ÛpàøxÔ\O®ªØ ʶØÆ%ãµçº¦·râÈ BÍ<Ç^´ãÖÖÍR<w'5â-¿7ý?<SMíÚÞjìºèïéå`Lz
t(·±¬ü®É®²!ׯÓòVs
xêÀÃ(¢néoô®E$/wëµ/êç¹¼ñ7i¿ÕÅ2Þ52Mdj)×ËéøS78Ì]þ0mA±<aãOæ£qFA¾[ø8ÃÝ!Ð\LLaeÖ«
qPhA LPBóu fßÙÝ@°f±Z^ hSc1Aª ` U¢É@ s×1̪ìÓäö~ßyóês'¨Ýó4ñý¿ðèî£
SÖmî1ú/þº=NÍÝCðbñiH½£sKÄAuÞµoëqt»\]®
½ßÅï÷Îÿqà~ÿ_»oVWÊõ{Nb>UéwvôoßCÆcþ,×7nnóüLO^5Úùa7¼Y¹øYE@@È5¶D7lïvþ>µ6EÇ»¸Û^À çV⵫m
¼CIÍ;fù#¨¿±EÜ=GåWðq_ÄtäoÜÑÇ»µãÝ5ÊiìáüqÍ¡óâ±"!Þ~S°ù¾ë¸àóò _}³XÏìoîàxíÇËóïÇ£|cM×~)©æáTÌAÏú·Ì¯ðk#åKÓ Nìºmý/ÎÚ½¦ rÒm
®P_¸]ßÝ=xio]^·<O½¦Ö2õ¡Êû¯é7?,àãë m»:2Í9nu
~7èºléØcéh··6ÇH}æÑÅÖoOÆORñÕú]rðDâ´ÏÇ Þ±1(gëƶ˳âÍDq C+cæºÀо®Ógq `äSÔÎÍ-Ó_m¢z|û³O¿Qòw¡ -gj{ lvíÙå2µòvÜMGǹn!»öV+m£¬O{â·{/MEF¥ï-®æaªó«ânëÎðú¬²ï®
¼¾=p+~åXK8Ä4ôG\_~N³¦WÆ d|ùgé ³~oH#¿U ¹\öÿmKì£ÏK1篼²â |6ÚpÌó}OðewÞqÒù·òIC
åÒ^Tô×6VhÆ`©³ÇImKêQ DiL´v{âlì§Ï ø óMØ(O* Âxo;< ÒÝ]©¼üÐÍä5Üníñ^ìù<ËöòøÃâ8VÌ"ZÕc6è¹´ádsºb.¾!§O¥Ã.ק¶§@nÜ]¤"%Iù8F¥ëºþ i
m}ò]#>tô ½u¶^ª ñ-p2!t
yçÆö Ø¼Û FḠÆÎ,ß«Ý
Y}ó,ácu]=;aÕù¶à@²Æ@oâCÎʸ<75gSjx_ ÔU&ÍäjK¾@?ߦhi$7Éê^~qlVõjýCk9G
ÊR:²óðAºW÷CÔT ÇV)¹à[%¹£Brx_ Wklììr¼ïáXi±6öw¨@®Å(]R"D8 Áø~È5¢¿!*²¼\ 0C<fô³ä}ÂìS´Ø``Ú #ô!EéÔ¢¿jÃxEL"ä¦$?@TÔÕ Yp$¹!Ä6æí\ý gpÕð;#^çK kÓ\ó2<ë/o*÷ÎxîøgÔ6æÒL Ü©kÌ_H
$*qªÆ¥oøê5Ä ø÷¥Qn'>°×³D_z)è)SU
ß÷|'÷Æ O"ý^rj Q0~4ðÏâ1"aÀKEAX¡Fåuv¶¤²cnÒlȼâ¡"@$[Êf
'ÐJa%(/x`ÍìÆ hcÄOb·çÊzLÛ¸ A #¡%vøF¤¡[zdÓHe¬¹L6b&Hâ·éM¥ÔzPtkRþ;³vúäR·f)«UOc QêsjÒ 0²ï
ÅM¼ ýp7ßT×î~<@ íÞcÂPá¿÷óþ}Oó9øvx_KÌ
gÅÕ^¯8Jhr-AA[¨°n
àñ/ÂÁ¼ÜÝb KXÝAÝìÐó¸^ò{£DQD)aJ_ Çî)¶ ½ÁáéÒ"<kã~'ºá²(ýÚèô] ²AoQNRV2vêÐ÷ñ´6C/°b¯UÆKuºßyÉ[ ¿M»ËQPN½Xú¥
©¼9ÂÕ³}»¨º[AC]éu~eB~+¨«(\ç$À)ÉU/ÜÛß«!eª¡Ë/Gmô@ =ÞR¥
Dg¶xºNpyKêµMHYqM¶UU¨×usz+,3? !~ªK$M2kyd§ ÚZ00Iárøw'ªáÁ¸c2
¤úú3¹-jý³"èÞÙEâYÒý° E <FJ(nÌZ¯ýÃYÎÔÚ
Þ¹k¾6XÄ2×+ÈmGW>Þ Uñ ðp ò2»gcüÖü}Çyà;nO²ø$sW{Õ¹y3ð÷%ݱí $=ÛYÛ³ÿµù)¯õ6¼bx ÇÇ,Áô>\3°AoS"K\`_ é¯XzHâÆñó`jé×¢Yt/ïêE;¸¨ .(û¯B¨égÐ;î+ Ȫð(sP1DTG×jzÊ×îkJo¹[ĨÙÒj©â GÊ^ @IÏ\¨P!Nkë·_:'Íx?X»Ôr, Ç«ÑýÕHU @¨· Ü«¹vï&×áº
à¯É> 2
Æà?ã_¬¦x9éT
8I¹ å÷S$Ö®¹~ÓGQmqÙÞµûT/ aíÈÊ|(#þVïÐ|îóõ &èγ wd»àÿ= áFý¬=AX åë ¤áâþ÷=Ä@;xÈUA²LÁ,fE,4R4a !! ñúVݼüîíÒÎÄÝvÛÅ·ñÃ}*Øq½£]£ÄZÓ\8´·½¤í)Éã \¼}Yw îX0hX>Óâî(z·¡È<#ÈH 2HR|o±-üúcåìÿ'¡â·ÄãÛÖC´
Qà p°¦48E$Q,>áªÉ4OÝkAû}òª:ÓϹ,m¿ 7óëX×ʺ÷Xã-
½^ ªXÙ·è}øbµñD4ÎÀ×Çac.ª=Û:º{³Íûo+ðþ_ÀÐù÷)Ã#×X´egëtÆtÿÇöáæ~Rþ_(ÏZ]EÔaBD:,«æËÍ¢Õ¹:ÿźûêý¿¨êü7´Ê÷0ø]Ôoú,
8A»^çhÈxÑ ÷ï£u Øàröc±ÓÃNYè£c÷¼¬3üùûCýtÛ lÁ,Kï=Oö®¦ùø4C¤DÞ/ãxQU
U!©ä àå,¹cWy¿ î ¯UÝ@dàðjDd><>~å
U-"âj|ë.à Ï{¥Ïn Y«¡F¨+RúßÑ¿Þäg ¡A ¹Ä
Ïüt- 0¢5_bÖ<HÂT87|ùX¿a
ì¬&'«Âç+=EãÅSàZEç$l3°Ây z(¿ë.VdÒ&Ì`¬Êßÿ·¤©{^A(ê-{Ù dä®ßO£þ*"6ª# RDÌo½P¤(( % Wquõ7s[(@N¦U;þ|Z^ ]ûXVw1ÕýO}åþÈÝÙø8')«æo¿Í[ßn xÌüNîÞü³«[Õx~0ZÒPÚi[±¼¸ à ®Öq¯ûü'äüñ÷ßþ*f¿i·4F¢
¹n¹Îír4Í5Í&AW5ʹªéE£Ewu±ÙÁ1nîÖ4Rj"¤Åb±6¹Ê+FÙÝÈ4@ 1¹Ò.[\ÚKLØ´`Åch5 £X£j-£E.lÌÆÜ\ Ö6L¨ÔÊ5±D6RÆ*I1#s*4uiwnðüÌ¥miÆ Eî÷ ¡¹ÿ7§ó©ÔAûüˤߪ
<¸3³ y´uJp¯a¡AB®¿bWhmõ4³þ_
ÍÕöÏN N{Îúð6þt ? ñ @ÁXÞÚ/7°Õ8®SAúéÂ2+"nY°È¼ðýp.` x% !QÀ8«P0êU±¨ÿ àb¹ ò þooðî6141
¥
$Å(
,E'¼ÏT?ø¿ó±ôìdÈóYDF;¨¯ïÆ~}A-$Uw örüù¡åâ{»¯àòJòÖ§hTÑm@Z ¥£($JW*
½ä
n^Ì7s5·¥
!5`óÜ °âeT[*
*¤ù9{>çè]>Qôþ= §ÏJE kÓ¤XhzlMbñçÞ
æþ$û½Îñé×£Yùý¡³±8F(1PD@Dõ9ì 8ûPx
,nÃkclûùU\Wv kJ( í¶AÛüNϱ<â*-ÀË~[ÀI`AAìiA³z¢bÙrÿë<¹ü©be;¨ê÷û1yv¢ùyÄApÖn
Fq|¶÷^®¥ Ùýû*}E?ØýÙ|Ó÷ìªø< ÿ2ïûQVÖÖGÍMâx¨?uFi¡~»(@½×_¥kãµ-ع+(*I
òÔÓ7ñÿ¾ q^@H¨ªé¸
aÛ ÛÙj3üâW«okÈw .['À|1B<·záYK& FP E
Û%Wè}nô×¬× ´½Çê\=&kYc»ñ/ü¾&z2`Ü-º(²ÇÑ¡B@Ð!e.ù
ús\ÞÊã« »ÈÃôcÛóÛòÍà»|ÿ[µÞ6:ßÜhî©ö~|¶ËÀïx¾¥#=]gòóÐX½Ëv !·ÿÀjÃW½ÝÞî5
+õ \`ßdftÊ£<CIÖò?Hxuó eèVíþ
ñØVãÇþ~{µÜöRCMHOW©¤ynY\±»0ªÃðÞ$÷^by¿
ç¯ÐUX¢(".¹á>cýF¶;¥¡iâÐB,} `IÀA+Ý=jÞ¥Tõµ,(V0^ #ðPPý®£º³zìuúʨ4: 5OU²¯øø(8¯ec«ÐÀÉíú5
Ý5ó®Ì^©
êr=ïKµæúÐ;?õú÷ -éç}ÊþÕ@ ¹T¨7ÝRïð=Äï|¶ôþ_¥ûu@ÔB A%0R{y
>6ÿä=_/«;zãòÑPH RòD¡ZPI&~ØWÙåo÷CmûèwoÙØ`:Ëݶî=ËNþèÎçÐé66O³
ìòüÎmï»®ã5vÐ÷^ǹ£÷ü5·ù0óx*üÜÍöº»#ïõ¶CHsÞEýÎ3ëùÿZÉãþ¯ (OÛìa E²Ô5 UúÊ'Ë2[:- [Åro¾åUÀép»®Bå"Ç¿ãn3þWÃ/GÅLÜ'ÛÞó¦"« à+þ´ Tuº $ îZÔhú~-õÀ ¤¸+;kËs%Î "( QQ oX·à î6Wãqq7ì3¿
;Ê[¾ ¯ÑDwHò
á[Èë^úÊÿ ×߯±ºrt ¬Qø »
@õÑAERC f ¹OÀõ8ï0Ǫåó__³5Õ&¬²/?çëñåø¹£ëúNS~5@ó°ô±~ôPQwâ@xªÂ×KeLÏx»'¯$¼<Ãåq²£kã£
вHECH< ÉwÔaÑ? Dø'àü®·i¶ê<v)ïϾKá% B°6çèàÀId! D ¥~ûöý ñ¼0s<ï¹ÿ:¬ BêDê=íA7Ò Àð§}[z½ã( ¼Åßs@={¡¡½ñûtûquèݱßìqßÊØSE×ó©Ê{îàaA:þ¨?«Þ§ §æ#±rJ¡vÔ @ë!¸Ä~)K³Õjh åÐe9^1@ÆðW-çÈkeK #~æîwµ§×_øÇ¿ù8>+{Jð`¢éßGã´jy*ôFb<¿ FÞ3`8 ´Ì¿ûvÎ#²õ¸66¦½ IýÞ*Ùáña nÂî}
ÁG¢!6 *© ( BPABte% ÁÒ^'IâãÛlé'ó¨ËLþl,/dé»Êõk/\áóxnsÓ~ <D:û!ÿ{[¯xú~l´gý·E"H0¹¨gáªT°(äJ*È( ˳޸eóMÁñ Fêô(uZ'À=GÌÔ u\¿£2ëÈ¿üÜh443 ?i×ð<Æ޳ߺÍÓ÷b¬¤pÓ(ÛvHf vä{ûÿîå[ø¥¾||QTB#àÞaÿk(31
üâñXå¡Ä²è;}K÷Bq ÛºSªµB'ÄNÎêUÃ1Å%ûݾîUí@aâ°ñÝ|ÀRÆ," äJ ¯éw+¶=¾Aýõöç};ر¼é´¶»ßé²ØS®×à|¹mO¯$we2]~+¶°è=>û ×Oþs?ËÔ1äzÛßßÔEÜñ[Þg¢ÓõÝ ¡zý4¹]gñÏæ%|W{[cõï0Ý×?´ÃðµØÎõ>¿Gû1TÉ$äN ®3QÙ´(" ÈP2£,M=rkäWu*J^Gk9u(ÂPó>=³59,£íØ_/7ð{øÿzð»ïÜíÿÓöà|L/'âÒÙë3¿§ÓÂáºs¤ð0 NKmñî-@û=¢wpRȸ+Ö'ÛõUëÍ~ôn¿¤ýÑ|4 e =¯¡qw#§°ÜóJ"B@@ÒJMºt Ø ±H²ÓnÞD/säo?ÅÓ^ûnÎ×fnð÷ó¶É÷»P×Ý*ïUIe;èùí¥)¸ë1ð&¿gô8|5!ó öíÕCçþU övP°²®í± "F¥m¬ÿ³öß±öøs¿
²ÌÃùà/ÁÑõMüCZ^y((RS8µ2üW?r÷ù GÏ»tÔÀÄÊF¾¨Ô£×æ´Û[ØCbôV`CR1½¾ÐªóË Q;°}òîµ¹%¢+x·-Ð(RÆ2P] D 9ó¶Ï§Ó^m"¶PM 4ð6r_¬ó+ó?">{î6üÆÞAynÓFÛ:åmí)$µÁ.,¶,Z4s ·Ôò^§°\¢Æó{öFæ1VûvtB§Ãq±HÎKÅÀ>{hº.8WQ QuÑ#¿`¼þOóÙVï»zºÞÑV©G]ûêU Þ+sSÐo¼\:ÝOð,ÒûÛ GYr×b Ìñ½×Qð|ûÖ {Ê|¿úÏç|«J&Ø~º,nöÞCó=λõü²gð¼Î_@ <ðÙfªbìX èÎûçÐÆÖ /ïz
ò¥àæVÙàÅËÓf¸l» §Ocì÷F¿Ü¹u¾W.g¢îe´ÖßWçsI½µ¿¡ã6g!ÖÛÀ2Û SåuÔü»Ï§¤7ò+üùݺΨýR'=¨é5ðcc¼ø@BHÊMðêS{ÝJ°$èÂ2éÏ8Å~Þ¨2læBí6zOg:¥úÓû §f°ã&O´Jy<âTGáÑ!Os+ÛÅi©Ðh»<sùXÌ2 Z*rckÎ(ª~7Ä«vÑØ a©ÛN ¾³$À9ÏCÓØUA¡«©yXlµÍDOãÔTAlpôÃù®ü×Ø箿ì\Å^Û×ÏrÓAç»ÛÌ»õØÉkoGcÚæ2 ãµ
PØ)÷Ä
c$1 [ìyïsLûÝ«Ò}FïýßEvêãzi
¦Þ»¾-
fT0îCáKlÛ×
öÚÓì >¼ró¶oÖ C «ßx¿ Î7 ÄnùsRèl|fkàRf÷ÅÖ{r.tÎÐx -ëxqAðDÏ}²°öR?ÆÐÅüª*
&&¶± $Û-ejÕí¦Í¹ëóÖ@}ö|Þ©ã ݧßRB.È¿ x¶` 5 ¯¾É»üyDj!AxÀië)Áp=ª+á*c19æùF,>óùÓA`ýTäKl.3,ys÷ Q¢|d'#8küÓ{¬¼ÊJ"aGÜëÙÀÝëäa¬~1V*C(ýõm$ÎQÕTÅR}Q[ 5@*N¸Ó_Y0âBËtNaÐqÛ,hϵeà±³ø*æ÷ȼÉr^¿!¬Y¦já¼9hh[yo|»Ýîx;ÊplloêYÝÈ»«å~§?¿Ý5½>5 Ý|ª#×>vªã<×`kWÓ#I¯jWÜ&Á¶NQÒ¨] #9Ê×ó( ß;¹t<éCÂî ÁÌ Õ,,P
üîìR !TV«C®9|ª]Ê
¬Õ=³X®äïUïO½Í¶g¯³ñríÿ ÉÞtJÄ ¬0Û?2`ú£â.F¹Ë,»ÃYú6Áö/ݽßìû¯$Òk8\[4
X»ÚpõÀí<´Ï;ÛÏÖo ÜNºêÞpoN#XÑ3¿qu©þ@óé/þä'¤ñâìâ¾ú Ôý°7B ÉEË'ÅqÐtC϶ON!ÊuðÀ¾¢Éö?Ã{9Ïô7±,CJê¿
ô è°Ùð¶ IA¹e
®Âª"5óW\ܾ¸ûÞMÚÄágûU áYV2Z0)|P3lR©h© \ÞÍðϯc
D¤ãVÆÃ$Æ6Ï 2æAþ%tÓ kF¦ÂìÕÐ{¤w¹¶ m±&²a»^.Òò]xw9Q§`mò\Hth--VF¾/²J'DVCCê$ûN£OØûºúÎ?
óÙ's÷77öè§c>ñüñâ3@|êÇIXQºyÜÊ÷³ÐmªË£Êë?çõZëi O9p±!©Ïýê7ÀãIB «Fh¸@´åªë^û«×v
Iç^Úç7_{U±¢$pp`f¦
,bÄÂØÄ?ÈÊTè=K7G!
E=¨Ýº XÝPµUz«Æ!H*í.î¡D#WÃB"¯ø(w
?k ?oÎûÏ:µ¹åÏ°`6>ß½é6Ià$õ[äáÑw2vÖÜ"q ©! û`¦)bG×ÛL6×? ÓËÓwi;íM×Þeu²', º¤¸a2¢9LteO±Ù¬íÈôxº¡ÅÁæJ°ÊJ#¿!\ \×Û §ð}8ÖÞX¢IRäÕ5bMþ¨³Øô-Ýe-
NèzO¸ê&µàwk}í_wß[ºç
ßns_¥5ÎMá
@RJAâm6}±^ íg©íPÜ3Úgà¥ò2ÐÑ? úúôÙù!Ø@_{\.BoÛÍ7n±sé[W*5¯%o%®UéW*º0®Gýìë$ñ¼eÜëßr2GJóHw¸äb×8ÊÇä±F¢m¨,¡/3vkbA`{S¨Ûz¯è>ôl*Ä«[½¶ÇN1k{ôºÙàõ¬ÃjfLÕvwd¸Ýt\Û4Íri *s1K³ÞÐb¡¥wü âø ²BÄC[϶D ³áÅE¨ÜD- ô``sgÖñ»ÞâÒ¢Á`tëZz,çÿÂÙ»(SLðÚÑ5ó×bä÷~ _[[T¶~þodÆÙømüúúÅíüGôÙüQ0æ±ùn å*=´OuÁã³õ§_8HòSñGú å¾
Cg7æÀ¤v1¨·ÍÕ%%",H°¼eçWSdséµÄE ë
Adå$±ÅYºLO7B¹ß{4×°c$öì¨yl_`a¡¢Å~ Éyúõ¬( د&ȯç^ÇQ»° ô!Qý )ý^¸WÞ£6ðιèw¶æ÷Ø+JTà ÷ÿ[f¦NC}¢Ê¦ìÞd=?úÁÌcÙ¢ëjYãî3ݾGú )Îÿå¢Ôõ=NyÞµÉGÞSUý=ÿÝùL!ä÷}ÿ¼wS® ë»eguüÕé-W~òà¾ÇZÆóp)Ö|,»5¿CTéFA$$:L)^jFeUq5áWÕ5Cßf`ßM®Ó«æy7Bb<^ÍiÙÊ@Ý´ö8ÄS½y2Ъ3~ÑpIÑ1¦9g|tΪ }âc RZÃç2® çßW ý?MÿW]è° a`5gC,Òl¥ t3GágY'¿ªUÆ3åÔ¥`¯IÛåTbøå9ÔÕj:ê¨c²«ÎÑé`Ùú¶¼÷ê]Á«PëìÂÜhcM@§¼
Å£¯×Ï3¥4Kkõ=¿4ö 7»»b{¦ç$3.¼ Æ;YuiÚàfÕrÎRp(íñ7f§«+Fl>ÇdÓý¶û´ßÓ~4ù9ÄyØÿíÅ×Pà©øÐÌäçgŽº´óÌõi«®ö¡=
aÃ\ìnð*²ì GíÛþùË×L¯Fª >ÅûWCÐÿÇw+=³Ùk¸*XéV
"jQÙZ$
E PwÜäñLà¦Ðú|ýö~kÙ ¥å´<aRíòÏ?ìëYèæ,±àóp&·:BûÈËJÁj_!ò¼\ó(Þy ¤ø,;IÏ'² *ÒBå?44òn| wäP<ÄSÅc¯¯¾Rs°
¬X?·ÕrǹT~uÿèS õiO6'ߦö g{ÑiMíßÀ³¬]w)
¤"{4ÌØCµv5¡È"fP8pº¾éêt7Xÿ8°É eýT:;{£ßQMtAî<¥qóGY =íQ|Kmø¤j
Õð8]o´¶Gy1Åf?YAgrU õÝ÷ê
¢SSê>RÎÓ jß6
jø¹?BcÍe 1"E=R§bMÊ`TQØèG¶d®Æ;Ze¦ÿSÍÜ"$ϹË! h ¹(b
ª WSZßdom°xgÏRyGå\ÞÌ'çz©x3Â
Uue
x*¬¥³P5R'$-ÛCoƽA&Æ
¤7i°ª jÃ×ÅÊ6e'óÃwXýÒRmö¸x| 7$^²kårägYÕu
lKIOì¨kþ¤<¿XúÝ{{éF¬6eõá-ðÉÿî¨pþ6£Æ+?ø椴¿vQ*O¹!÷úffU`PÆ>;}Í\ Gñ×^e<â@ÜÈ5 HÆ*¨(ùLîåL0Xíj¬*rû{FåsW>GåÒqYY{±vê ¦çÔ {øé_¯Ù¿æ&§y ¦ Jv-/·äi´¸3ÔJyLV,A|¶î ÄK-r2\¬¡HÇ:ÄÙá',Úà±7" #tµªg6s.D²½äá¹K!mÑTþÈØÄà¾aÍ·ÍuóÑÀ6a'h¬{bNÛ©fQu& ³$íL!ÙÂ" tD¦ÀNf`6f@£òf<Ñ8·34´B;nÙ¼y!"x8=Ã0ei{@P 2C2În`¼C$ºá´5§¶£§-ãËfjÔëÚªë%lÓÓÄ ÝT 6ÌKÍj"ø©WOTª\¬°ÄÖ °¥¬9ÄVNIÉýÄ2AIø}?*×cg4\²Æ&ý?egL
L1JesÐWRP³Þ¤ðRÂaHêÓús×v¢ùþ]¼Q]Ûµ;¹¢-·Û«$²Âna
P:ì>"`(/ecï7`ó=¾²éPÃÿ´
óÖ^u}uÃîÙù¿ôqÍ Ù6º¬5ÔÉÚà&q½0E+|ÿþ (×í×GÖ'_H{ûÛµ°EqÆð£;ôäRÞu²È§¬^j¬
yû$¼âO®XA#ûZ(ýó-£¤ñ¿÷«Áãàb7IøúªS(;(çDxHöæ¤ C÷k
*>Æd ¿ñ÷ v?Ü@Ý"¿³z ÷ð~|wS>{¾Aõþo=çg}5pÇÝÓÖÝIïª3~ù0ÖtpN&<&Jª&Â~èKÀ² Qá & >åØÎJàöð<Ó#
ÀäN~µ6àbí×WË𣮠įPcÉÈ`RC Ñð*§ÌîxkÉ©«Öª¶8hÄå;©¡!~îèu¥£ÔëÓ6!æ¥BE2¼ <Þ`¶âëÀú7
:×Ƴ ELÈZê¸De;8w &¤_ß"*°Æ&¿w'À þ$D¬ÛÒ ÅìGÚýÂ;®> ¹ÐeS#"ìPkx Ï¢p¾üÐÀ¥)^ë¿ïÏÞ×>ýÚ¥{c#4RB "úGÒG
@ÂStý %*@'oªü^9
T}5ÔQ´Ó»O °½J
®b çnó»<k±vkF Jü1÷É=4îcÊ8¬³Í_H¡ 3E#$%&qu"R¥0Yd N¦ÅFÀCHê¢eZ½ Xëìë¶Þ?¿ÓzÎ
ÿ?ÿeñFGûðõx.·Åælñ<÷Ýôý]¯[3²Ö/ã°éuiïæ34@*ï@]Èó¦ÊíÈkÚÑÿßþCFû|ócU&Þ?¡AóÐg}7 þ¶ÚþözÝ"ìàPø¦åÐc .<uP8x ¯[>¼G*'Þ¯Õ£KÚR8g GÅ ·¼ø^SO÷ãÈO/py¶öfïðó^; KMÖ YIÈGB ó<2¹ ÈYwLê¢e§ÞKÊ 5¡ ÿz6| }KeÜIQ4eI2gºrüg9éÇAúÔÜ'Âs w Ã$4%,%ä£ÞRyÎZ2c¥<ßÒ¯=®(Æçè\}鱧.DlH× *9·À¡¢ {m$Ñå?qJú
1äI?ÇØ¿iú*Õ$6^Émlo?
ü<5å Yáy^#ª¼Àª½³,LÃtáÿ`º_m#¹1¯©lÓf_^.ºýNk@."ÔÞ3ÛåÝ |è:Í] ^íôIùïØ¥éSsÓëÍ ô²ÙóIC ú9 ÷î^¹¨¤S¬bÜ| =Üç.ûTï¾ï`?N'qAù#âbd¤2}zNÊ=DÈëMV´-q´ªÙºïê·Ëukó_î~{~°ÁVâ/ôFN7÷²wàj&|'(*BÀXbE@^ûB £Êx5þjü¶båøÑ"Cha®þm¾
ª±MæÝ1±} 3
põmÔ´1_ÃhÃþø´ÏÕ{èùjæ@]½AâÌ9Ö¥f¶Æø4vØÓi£ `ã9UäDlcÀ¢@·1,U¦Û°b®´®EnR0Æ-#y3ãElZ²(ÀíA¿ \\Û¨$69$£GìN uØqàÉ6rí
p¡s7ûtC_ìrZÏgw 6Ñu¼]_$Å %CäÃðµ/éBrSÚö£veéQsbij¡íàa4%ÆqBzpG* ÊftÝxñµþ°5"^È}òÎ ¢¬Ì§«@ÈCñ¿w ÏÕ³ÄzØÉ÷ĨA7·ä4öÔJ©®exX°,èB úY ðTcÊ~Còe¤Ú´)Ôvk(
XQ-êÑPbJBs
=rùêÇ)Ą x*.¾y©9ýøm¨ûnݤ¶¡BOÿ Ðaô©ÿjxnÒNTu<å>×¹ñv<Ëî(Ý33¨£{ìBÐ$ïç¾<'VÊ9î»WÇ»3CõÓô_- üÍÖa19)ÃÕ2p4BÜ)v>«F\_j£þñê»*<F=©¨áTTìH®Ð ·£¤PUWz|(/(ûå « óóÀÍ÷uVBÒ4¤?µì(0ªºR)Z I!nk^'v¯JæÄz[ÒÝ+ÝEߣ !E°B&L
ÄÉæVó¦ç$´w««ó¸§««¸[¿¾¾Óá¶ö±ìbå·MÈÛJFÉ"{Cfboõú$Y Û_å-y_
Ef/y;_·+^EËÇYJ ) ²5E +è /ºù£¹¹o>û¤&´´"¬B»Akñ<¦¯òö^Ì_¾x=¾( ÔyyO«ÄÝ5âñý2M
ïUVÝM7ä( ÒE`ÕÊnÁ¹
¶FÍ(saYäÈÏ,')pI'Q¾È53õÖ¼ÔXyó?òù.ð4lÓ{YZsw9÷Õç×},¼2×é¯Æ÷3¦ª2,¯âhvzyøn©³
Ú"¼*
íNT3<â:ÓçzøÁ#A ÌÚÛw`áâ<x÷a»WA±³Û}¡»Vr&Û+V¨Ù#
/kj6
Ç2R{ÀÛîíä·'W ·6ÞÕ*EE;ª6b]UËO°÷ǧ¯«Éâ¶5¼þ£íf|Î ¹æ>ûÜì~Ým³h8E×h¶Ú{)"ö÷¤¡+ØML¤)A|BÃéÿÃôÛv@Å)( øóìn´ y"ÀÙF@øIµÌ¤!£q(O^+?H ÒÇO kåª É
Irñ
¹Ú^Ö4Vòf+ÔCBµÎc Ð0j&¨¤øTÓ©ª 6¥Ö= Lú×ÚËð qkº÷ëYíkmh¹KH PÊ }Ù ¦¦·¯r8îlP4dlKåÞCèõ ²±@¨OáBaáد¢
LZ5xµÐ0Õ#ómÓ½SyPÞBÖú%tÊ(ÂïTþJ?>'%©c¾â ²xYEiòS¿7$¢¥y|Ò!:¦»öCÌ8bÅõ×@¢½là vjê㹶YE&³ßåü
º -_µbèìØCl0¤ØqgG ÃAEBk ©?óEä1H$w
²¥ØZ¢Ä³K ÑØv?"¡ø¬8Odfå3ñûjÕa'
c¹ .; g;4 ¹åéͬ=`·øìöò>ÇJöíýæâòNº[iñÓö~f§¾Mé?]'Éóle6»«JÖ
Ñ»Ly's~X|LW>^òAÊãj±ÑwµobÂÞQñàõWo:ÈByxùh@ØÌóñrË g38LªÎìL´+miûüùxðU²lI³}Ý'3 8[Z¤cËwQÀ8bòDQëì4ÁB~ErC«mP#÷ßL«L«oìnº T
UDDb ´Ò«)wÉrз´åA^ÁÃkõÆÑíÙÕTÕÕ+Ù¼#leuÖ0hcÚA²lGF¢d&ùh ±
@
¥tUG4¤LÎà¬0°çÞZ*B6ÓìÔU:åe®áe Ô) ó»Ei§ÍçF¨Õ¹\¢"kó¸i¦]æ³M7YU´Û0QðÚcmyM¡¸ÈM©©¦ÇgFO]z¼º÷½^xôpDD=úòñë×zkÒ0BP÷ÕÉ(´%FÜË'5sxø6ÝæìQ¯}É-uÜw^ï{¼cǺ î³ÈF QEUwï4Ãá×w$¡Èo&Ì#"\A§»ÇÕ£k¥kØ*¥0ÏèP Avgf1¬Ñ7ª h(Ù7³¨µï®k÷6õïÕx»¡ãw,M" |F^Àç¸
V@àØ©?á g,´¥4¢·VA.ø̧ ¨'\Þök; ßêìÃ0þ~â®*î5Hz2zÁ3køµ¥ðïs8ôúÎ2.eöÔL¿Å%>(^zwÌïûnü_".(Êa
\»ÄèK R/þv2@ä7+MÈħ2 µðíßJôw۾˴j¨Û¯).£læ SwN*Q «XIæ(ëZ¥qtH¹
4Äfì%Gb WYÔV[¶b jk
SãAq.gÌåßiôæÙlÓ˶7 zÓj<ÛÙ?ØOÁ =l+û+9¶¤ùãì§ÝèË°¾ü*b¶dÃÖÙ =ÝÅËÒ.Ë÷rY⡶»
7@ÓAZÚ¢,¨ ܽ7ÿQ>s B åR]Ú¦Üýå>3P]|éb±X£?òbÌ$ü°=oÛ2xç¸ÙHLX°>¼¬è&ÜoØH#æÚÞaç|eëÅåÆ4ñêÙð9mGq°
Ô"áÁI0¡£ o¶ÖívUJ£ÍbãË9<_¶ÿ=0Ó07ós@F/"TwBqÉ>¯hU#h9 ®
Qd»$`>GPÒ\þ¾mípÁ±³¶ àƬ.eXX¸j"Smfkk.ù¶ÈØp f÷_³¹çhÒß*Ýñ3eNÜÂI8Ê
'X6±À
$Y½Ö¥ `$`·`·àZ/_°Á¿¯¹4?¯ùx«Ë ª~¸{©üLýã ?Cß"5'´p«±ÆÈÖ/ ØÝóg0:îïÐìØÎç°Æ@È°ï7ö\è`t úH ¬
èVë=7f·= xñËXf|L©Ìö«´¡ï|söv|ÊÙ¥¬,YÔ ´I ùnß]J!²¨sÒ´Ä3tá!&ä.ãoív æ Dn`1êÉë-ÚÔ2ï×H÷dàØÖ3&sdB·pôè»VHäÈ~?YC® ¦Ä;EÃ?8ý6xîxÓ.)Ü+\ï;ã¢MÚx¾* ÚæâÙ±
{HM"Ú"¼¥"`Çe[`[fɺ,ñæYùìÁ¤Ûnb i4òC:Twx)büEn2+!è¾/¾ ¡W fitw
U }x^²EûÀÃ.ÊìôpÜÎ
[WÚ6 Ár¦Cc°ÐçÊ
íg:¶ÏµlS#¶+Îhew¯zH 'D;3j#r(£pCy`
øÃÎ3ÔÄ%ù dLìì±È6NðþsÉÏM on~@&ÄÜ¥7R2!ÂþJëCëkQ:kðåõ(xjÞòrÎwãÝM
c²/vÎÍ3˶ ·k¼'-r¢WæÐÿïYz&Óªðá!C¤x §IЫÊÒVuXëÙçuØ_K»30òovçÅä_à{Ê$LKÐôrkö?dËÕæáªLôÞ±Rb. È~aðeÔBZâ z½YT;D1ÅÑl¿¶¯¡G'¯£ÇGªÑ»'P°¿hL`.·"`23¶wvrv´&N:jpcQL9F=,êÀÜîÁ.ßOÉùPè?×=^=N6tRR7I YÌý]ÌZ:jàÞI»nµ Yu£ªqßÌÃu±ßÚèÍ´à¤ù>Òà_·r ÿ¦ø-~ ä ]++ ÓX*Î=bx¦¬ßãåà§èòY ¨×Üô-cBÔâuc·|?HHC£Lٰϼ ¯ÌH?òüjø ÉèøuF(Ä%ª®fWg3ðêfx'[Ù]%ôæ¡áx}¬îÞ xÜøRÁU¬kÂ?'tîò÷õq£"ÀN:g|ûjnn¼ G®Ô»â³¹áq8d.9r« å(°&ÐÍ" ,ãU°y¶U 6*Ü]5oæÎÿŵ×L× 8÷ðûhG[·PÈGÔjE$ÌxãÑÁñb#wÈS¼x¸ ÄóHäH YТM57§²%¦òf.BÁiZäÂñoXX¡3$Q²(mDÁV:*Öõ5ÇE}¿Î×þ ÛÂÓ磢÷ÜÆúgØv´)jÕ
vQÊâèz_ª ÆùªÐA'ð3ã6uô7ÆËìKÈOí
&¥NØ{¥åðÒ N
±:,m8`ÛVPþ;ÿáÐ$h)6W/\öy¬^9® âý~½N
*ìÊT»Ø»Nh`E,u¨hC
U²pPó&ueúÍÐñé8r'»NpQb°À² ¤å5aHÕT(Ò¡h(8LÐ}NvZ#ÝZ=þ8öÉ¿Ói.tçs2¶íâáÄê ¦ÓB6els í¡ ¥B:ÊÝÅÛ²17Ðv êîcÛâzj J®M !í¶z!a]ÖÅ¿S
3iÙÌ®b¼_!ú&¸÷ Ù»`FÈÙ¶ðlÜàôÌ6\Æ! I¸ê6#,lñÚ½6ÄCi«/, 'hç1v, :R Äh¯ æ nX8bïØ¿ÐzG£ sbE6ÈᬠC³²!·ÃC«@äÅo#éågmm
Q´²éJµ¬s7y)Ý65Y§ìÞÍæÚDño!ÎX]k1·¥&uÞOÕ©-LE# Üd¸ò/I$¢ü4 D¥(S3ÕÄÎC
W,ï$CÅÞI{'±`Ð]<+ëGÀÀCv®ûàÌ!O UI°Þ^!ð÷{µÝK¶¥ÜvZ£Ò_ àù¥n×w s.Ðø÷¬qÕtË7¬í«ð˨ÃÕÕÈn¸×#m>O¸¡É7HÂà5¬>©ñ'`§G)*&ç ¡Dä¹ * Z0U,Qh]%¥h ú§XÒ gM%§Ú·}+>=½kCgG NW
¤ñ¹v¢ìâI~g:syÞÏ7?2Ôã?×£g¶q"÷EýeÓ»èsfÔnm2ly ÝÐvË¥¼VxbA¹ÃÖYh¨MÊÎ 8¨c¼Ô@tÑAã
·½M-áëPwZÎ1qrÔaÕÐËGS ÍËË=>o¹p ÜËöÄJ"R uÔ¼î35«àã+;å 무Þ/«Í0-q D
à^)Î`§Xã1¤Á&òÜDõ \ã
¨êKêì ão!{ñq;¹x\QkìÑÎ EÞ ±f µ¦g]«:íyÐË61!M±óª¡«qf£Rѧ ¦7^lÜsa
:fß,F"¡F¶ÛÉôûdLÊ÷·Í¾«1³ö !ivCdÍ6º¤}3Go¡¶ÍvdÐ÷õ°µÚyrã 'M|¾^,^MK 6=«ËJUûóÉéDóTnö{H ¦\hvçöÃÛÛâÔÐ0° l¼ «+"jçá
Oè)ÂêC¡>åi B1¸2øé ':(Dïíl¨A lb$mÅ|¿ #¶r¾6F¨E¾BâúP-õøàzÿ}y¤ë°Ù]Ϊ¤êµ¤}v«\us1|®mú²à~õ¼üÌ|t> ûðæYÈTäê ßþ;»Ú"!¡3þÍçA .*¥ðL1ÉÝ"XÏ®¯"×½5æZ>ÊG³Q§t
ñiÊ fäÈ;e)|Õ¯)ØÀD±(n @SKñÔòx¨ÉÐ jR@À;PÙ ÆßQËËí1Eçà b¾Õy}Í-Þ, zVBíØîBúðvR
ÑOÈ`î?}ÖÚÈ÷÷àþñMÑ~͵<ñ~ûýötq#Y/´a]ÕºÓÃÛÆsßç#»ÐëwóÔÀ5¸ï¥n ¹§ guöÈÒ% V¿4lÄ×lTE¨÷»ñO´ë£kkG:Bo£qqÃ3Þ¹¡ÉÁè!ä]17Ýj³Ê|è%µÚùÎ 7.Q]Áqlà5ØÅÕÄç+iwhFëù³Ã]ýGĽTµ¿§ÇÝ®ÜÝW)xÄvmg&F´º¦Àg*÷sÛùöp×QßÚòmµa& |:¥Ç4ÞF°O¹·3 »ösWHZ$ 3'aïP:¤.¹aå¶ÚèØI¹´0²2m3v«´CñèÝvòG¨íW~;1¼*%©q
«XÇ&Ñ ³Ãb»?w6ñ§á *Y" 7,
5/&·© 'H8ÞÅÞ "I3r÷Ô \á8 ¢":!q@sk[dYÈ Tm¬³¾AvMk1üÉ`Ä:Û<¡'ZÂ]z3lu×[3r Ú#Q ì|Q³lÐÌsqA«Ë!¡#L°ÕõbB^=|5siwMnæÃbE¹ákNí¶Þ÷BLù³¦áº@dA³ZÕm5æÖ6«ÂÒU9¡kI6aÒÍT»+íGv=H6 í G~¡ÈhÀçêãdV 0¤°vÈ !Yv¢Fî_ws#|ãguK¶ùÌ^EëÒ
ä s¦Þ£M Û7Ò´Á"eÃ4»ñÍî0s][ÇL¢c7bCXpA0âé ÞíV²®Öòf¯Ùø¸wÊÁ¶Á f
d¥ò éYJ!FKTmâMª}ïléSd×e 6¼xÉ[ µ<qxÏ
3]T<¸ îÜ4 ÓÚ °jÆÜ À¢ïF
ÆlÓÔG¬±{Å3íc-` rÈóÂUÙY>/ß\Ñ6¦V¶mèØ3 8x`+G¾ g3k &ÌY-k ¹°rÀMÅ0¸j«£Ð IÔ¸ÑÀíU,HD6Q\m1ÈHq6z R5-*äâæHng¨ë9É÷W¿vVëw®Ç~4åâÌï£] L'¼¨ÅÝ©Ó¡o£ÆÖð#+7¼õa 0¶o¸ÌµÃCÞ !ò×dlDLn 6ÚaZÂA] ʳ¡g2È .@Ä.¯[ÝU¸ã8Î xdåaq¨YN ¦ÑG)<RiPÀ{¡6SÅä4`³¸$nZ²¤ÝI¢®¯f(Å7¡)}HRLEÊÀÚè°#{Ñlû NH´.[N
d ÖÕz:ÐÇÁ¤ó¦gÁpÍa,=õÁÅUa¹%ìäJ´ÊÜ" í3Ø HÅû>UÍaiw)»
ð¦¸Txz[ÚÚ
mZ´8cl<[Æ^ÃÓ¤çæÀÚ<mv.îÃ¥ºjad#IñNÄä3q-AN¤=9va¦ ; m¥Ö63"9xqÛ[ÖQ84!ʦ³çÛËPØw6c)kAb0G}e² ÜjQÐ4vGfæ3W¦¦ámè0£»éöÔ ÀMh"äâ²6£3wzòL²ÈãÆX Á_Ð!&ÇX|¥§7
F[ÁÁÄ"S§& ¡!\ÑÄ33+ÁÌÆ Ã+àµ)i!ÕÅßÔë "Zü°S«ôläkk!S¹¹9vj4h()
îa
æ`ÜfMékm8%©k®ZMcí Öóeç h] ì .Fôô{综EÓ [ί±X%´
´*r X;ÓqPøkq!¬Äl{åÔ»D5`îv+ïN$q+ÄC:ïîÝ92h7tk¦æ#6Õ3!sÒÀæÉ«k ërÕÏÜõ5wFQ&§
³8Aîãd8Y§·$e&±VýÝ\û [Ãn élØ«þ¯ZÐ_[ßgét£NÙ ãËQVÙôúnH@JÀ©OPMä oö³¦°äw± nD!£]ò,¬¶m~k-FVÏf 6¬o ý#~5g
Þ*cÜ£{/ªÉäÛå¢X ¢*,ÁMÅðz4µ%$¢¨1a8õÆ~I÷À3½l7$e¤¢ælróuôw]g{«øçÉl¥Sj2W[¼CyD(©}PQõj§Õl¨=säõcä {f¡ÒeäHJD[<ýE ¥DDJ sï%Ó¨Q¹
ÖÃê+L¬QXhõ(f$ÝTfÏwTn©j¿Öú
PqÎXf F
`
6 È íyÍú|Gäª ñÈ{#<ùÓ°(ü"A fûF@ÔßÕëEÐÏçîØ BqsÜZ©îIû¿Æ§)P$$kJçJ] d :â º·ÐTN襲|åÃ]ß^ oG}¸À°±G`q&§jÄíþ%Q7(ç-Ô|§Ô>@$HÑaûýÒ¿o³~¢ýòµ>ñ}Ð@R%¥!Q ÂðÝ8hø+¦e V¥GÐík:² -!uxÕóó È¥Ý¢Ú â-£qê }^±Ä1¸;8TåaRiW·)d ÙüÊ< Ú¿ë97lÂã>mû(òñNú: Pãe s í W}Hûè&}iAÕôcxØ_Úõûà»Üd8 C£ÝßG Gd8 ½ÌP ¢Õh7j¨Ãv§ÒGÊ-l¨ jàÌYÃç FÔ7±Ò A¤·Èa.
]A"RÅlFèC%ä¥/!)ºËìE3²¹ H¤¡!4d5I)!0êE"7ïa3 °EcE·rAj0¥jªêY·kÿ¸( ó¥2 ʲÝ~`þ§ûÞ±s¬'©4Þ¨IðÀ½-|Uèï¬d5ì4taºlZF!¨°gæ³]åìxWí dÌ9 "6Þáx¶Îë¢jĦ~Tf¡öüôulùk8
0´±fÀØ rç )$ /fòB` ½³
(ï azÆÎ)3¡CRË)J5ó2kW8+>5ÊcÏNµdÐÛ %<~D6VF|ê $AÍb³KMF¦}=éòóÆÒI(X,¨@ùGþ[äÞ9¹Ójt Ü}WJçá)ú£~Ê~maÊeȽ&N76餩_QBë.Å
ÊÔ §ð©v 8ö5°É4% {~Ø(² áÊ(× §ò7É DHÄ©3=ÀÄÔA} hÂ4+ÄÙ?\¼-± ÿk@ñ>¡÷{ó7g$S(4{[ê %Û®¦+Ä0¬#¦xÂ[xyneÂk'ÑsL> v³"û©+kê¶,m¯/;Uoµ%ÄU³t§âª¢+°¡É´Ðw±ü tùCà0÷Æ\hN"øU9"U½ÑmÓÞ{ïÆé8z}x8Äwc:KèÞ>SovØcÓëñ;ÔÜCoÄÆFCv×*oÌËÔøg×%ñrd²Â`ô{)Q~÷Â[ÿ ú7øùØÔ¡aý5# dRU¶$¤ÒçV ;εÈÔÆƼë¶Å[ÎíkU Y´j´I-½¦û ¦*ó_C°¹º^g>Ø*2ëíÿ©ø´â#c #ÄÃû ©}Ø«\ }Txùcrp7V3WÀf\Àp'£ÛëZÙ(-W#Ù°oêôbAØÆp«>ÛL ÔÉHRRÅ)¦ZΤ9¤"°¯CGmªh!ÊvfP¥A0UáJªÃoKPÄ~,R© Í®Ökb±Ôê÷K
\çææ°50禪ÀR "Å£lZ4[TZ¨¶¨ÚØÔ[E¬j#j6µlb¶I±¤ÕA¨ Ö(Õ%¨E¢ÑÑZÅE²mEZ°lZ(Õ¨ÑiF h(£FHI ÌBbH"K(AB {îùÌ $ÈE 33)^¦9S8¼¯±uiXa\^Z6ËdÐb1
^6ØR%M*
q ÑFÌßð¹«ïVÝ"4%E"b,X¤ÒE`"¡dEEAÙû cnê&ðÏQSÓ ~@±Y âL!C$D
d 3ÔÈþ#©ù®êXS/î;àdßFê°bB°í,?cX·{ò>Wã³ÒÀ¡j»¦ã_ ù +ä f;²"ÎÐ öФè©G
+Êi¹2¶ÌPª²F1ÂG£#
åvÈÜÊÓµ H6@cCC²Tcnìe2IÖLÌÌuÖ\r)6ì#XJîL $d2:ÔiIL
Å
U¸æå¹eé||Ô»®½."%c²ÖZK#vÊÜÖ°nJÈ6ÚrI#Hõ D2y4i¡±³ë4ý?^NðÃë_Ú$vþ{Ý\Áã#ÆíÈZ
CtåKP(PiPb;¶²èU" 4¶JU{S'ò±Ýé=׬72@PX}uM8ºdÙJ (@DJ#L|Ûõ3Ñ£5R:J®c± .@ãËÀ¾ÎÓU<V
ãm¥Èج*¤÷K å¥P6hvT#i$k"E?I½9kE¾ZQ$
mÖvb 6zu .ãâã9ù§ÃÿéÐ;(¡ñ]7IÁ¯¶Ä!Æ"r¹ò uîN>ùÈÝø:H»ç`'«gdâ0/RSæYI ¿f |Í!à#Oïõs ªE±G»S¢Å
ä²¹ª»®Ï]è=2
°×/ 5üà ÂyÖ¥V]sÂ?µaRW¥¿´ï12P½>ÖÌ^EF @Zëcø#°ùð3Úºhæ~qÐZAñ|þtË ·ÌEÌrã|) Ýäß(£jËädK@ËÚ ÀÝá¤99ü¢J¤¹ð^±@X°UÁÄC$±ãuÁå+¡áÓ²âÄé¬ã@Æb(ÖÂÔáÇY;bjÜ0 ÄÝ/MIq㯯îsú,ûÂÒ·êß®r¡?ÑÏAcÎ߶c:IÖÊð}ÎP=:yA^8\Éßhýw^OG$CÁKJ´o[úÔR"±AehDHuûØÔK´k7 DRè0DÐð@ @âbõä<á²ßbO./4Qdc òß»îóS±GUª£ÈÎ3#³.½C(<û ÿj KצøD8àNPo\MôÙ,ì|ØK̵¡ªÃA~ì%°·(^ ü® òÃD M¹°µîW¹IÙÑ°Y5ÞËWeñ<V[3RòÁYÏ Ì×sp¤s<@îl7b³ÛªÒÇR(óX¸k`7< "¹²éGä¨ ¥¸Ú¡¾ým<:Ë
îÀI³7? ªÌ0ýw2ù¥ÃÞñq];é,W!ÆÈíÔÏü!Ð;6©á®gÖbÔfÍE ºâyüU¹Ürê¸_fÖÉeeCöÖ`Ú³|W$æq-qGo§»Lã¡ÆdoììF)H9ÃãXuÐwüÙȳ?#NCÃ9B[Ý3ÉQÚøu¯
úѽÅÙRëF!pc¨kÝï7ÄÐrÛú;Å"ØQ#cGOVÄêôzê û ÍrêõN$ø5¸L%®áǶÍÆëçs\sÿNy0|no^Ú|d~aè> }hW
dèÇ6pùéë3ð?{Ôhnʸa1¡:Óñëñ »Å CÙ½gçÒäÑòRhàq3Å`vPýj9óö[ëJ®åw*àQpa¯é´LH´
îcÈ!²ëÑüë«'e§þ5þþµ4¢£ð #õÐÿOµI£6u'í&BIZz:°È* ö¾í,©'â² ÒN.±Öû àÕö/ ©Þ^¯Ï8ú1köÈ`Z6ÂU/ß ¢{ÉßÀÿi¥?ê oá¼ÅÈj/¬ø üìÉÏõÛÕ êyô. úÿ©°Àf1JçlßU÷ÕIé§ÊN/¥Ê÷ÞÓh÷JÐO;tÃR§ÏuªE ¡P×CóËavð£1Lõ̦)pÌ»PKýþ¦ Aî½Å¡ã&V~iÆÑ2¿
Â_óý÷~{fAª#± h±jÄl"ű´kbÅ$ÃTm&6Z6´Em¦l%Th°j4Y5Z+_©·$7йcQ©-TüÇW#bF¢±b©RZJ_Rûíbîä¾ùqÎÑõÇð&JaÔ£ØöìgËú»Ðåà:2öJA"añ²Éâ åî¿y!á4NÐ*
r
ü%bä]0H ÖokFþìCïÙ«ÁÅ°²Q&tÑ~p<£ýKEÄßOCUAb·ÒHfÃè >fèÄX; DAWùËnðQvÞÚCT³FÖ.Þõ'Þh6ç½¢<³áfMÚGÏø¼úmörQä¡ Ø8Æor2¬.åM [ üN¾F¢ö¨®Ä\Qh¨¡$hgdáá¬Í«É=y>öVÿ§øçº,îSî ÇótBýÍH~RZèý^ßpÑÝ]ñ-Wÿç5ó\MÔ{+[~i«#Lúv Ôð9´ ÷lÑ|. ô=æM\äàÄ$`Å41T;h)ÿãWq·UÖÓ_§ÇoÐÑf.¨ÜühLز ߧº>#È'øS½
Q©Â,«h¯î¢ÿ¾ÁêFiMT~ÿðö=ï¬Ñà Ãä´Dwã\Ã_h»'åÎ(üZ¿È³ÞþCéÂhHBO¨Öeøúº& cd i76IN@ vϼõQ°Ñ¡0¢úvôÈÿݬ´Ö¯/]=kÂôªk'¯ YÏë°
rHcÛ757vóë±0bßÐC¼"v2²î7õZ´KI"5Q|Юº*È 9ùB]'/<]x¢àÜêÓ3¤¸
´ÐÙ_^õè;CÒD$.hGòËaÌÛ`eèä(4EÅDPÏt kqõñ5*¢±îè¤ÂKÛª_اaÈïL Ù§ì1æW·Çð okL7¦±·` mÁ÷lÖÿ¯Yɬy0[Ú§,C EÔ%e¨¶¾2ìd¶ÿw~§a¿jX.õsH¼Gc 3aV¾~ñw^eÿV~>¦À©FCÒBm0¸ÉüqUÚÄÀdÈ#lÑ<I2ÈËF±èFöê3Æ7²j:¨ÕµF¬%i¦44ÜØàRÁ´iÖЩámMÐ./uð0 æþÇåécänÁr 1 #r*{.I ¥îÔË9:Ìó÷ç ö_çý¥
ÄI
¹}CL¹0nÊ;ÏAÚfïÖrRcwê [óX/Já>©Wf é¹ÞéKà¨Qm
'ÛÚÌõ ¯áLÎïÜvþÇâÏâO'¨ñ,H //Þ%CºÑm^º>µ,³µiA£@`»(N£ù
RiµÓÀa ͱª{Yâ1çÚ RHdð½ÆÆB«½ í6å(BDÊäQ3· HÒNg°¿<ê/gÆÅ Ë`¹Ú÷jL¡©pþÌGÖ@/rYKÎn0g0ÇxÑUínÜ5¥Ã÷`ÛCSf÷P~PÒ¿¼ËXVÒïæ1íKÅ $uf"ÃS4
bm¡ö6@Æ*ØcÓ®êcaV(ÉR±MQTÉEQB &¢eÝÐÊ{8Cï¦xlÇÝgC纽 ¾17Iü<õ^%|wù(qé¯D^% ¢1yªjIi8+F}47_3JÝix%fhë:õ©ì}ý×j¶î¶,VH c`¶Æè hiÆò^;kÆ¿ùÒa⽯71âæÅ.¾7à]z½¹W9ÝÎáÙvg7öcÄoV Lèý( ݳéêù9"-°c#ìëÃúÀ %¹Ô´wÅ6
ã²êå¹$ã
©b3 J6ÑÓo>tNt,Éf§b ¢¢Ü!³ðu³Ö½ü~KÍHêVê ºÐ²0Rª¢¾»Ûklòp3 ¯Ñg0]$ä
Ü·´ªà'7ãÕX=îr nDﾶ/¿21
´$¦ÐÄGÆbÒ¯3ÊVbzz
pÜ~l¸oq[²ì[Xc&HíeªÆX|åTYkx
öÈi t°ãCB»à¨Ø eÌx'¥*§j~¿õ»ø Øwoz
ñkS?ßC³Ó¥ÎBÚ²±t±d60$J^n]
H9]½'öDèà9Æg®ã®/¸©ó¿á÷ynÖjì!º"R Á$lc=5ÉUÿg¹L $K^M;sPF
©k¬7¾ØÚƱ¶£ Ë»óÝâåסdFP9XQlFIØ"`ݱ(ÒQÁå¶DF£PxÛ¬¹1ÖA
"þû:ýÚ°ðÃwÛ; Ù+Xø´Sç÷3?²Ì°Nìü]½^ü÷Ãöp c'ñ>ó3ÄKç$môáBضzåCáÜàñ#r¯Çxa¦ä
ï$ÁHÒ~xH/8&YQ\MI y!<¯OÉ©0Ç( ¤4L ¥ ñ*ÑP }þî¸),㯳Îã8Ø(r±L!Pnxûì5ÖÃ|ºá]mÊi Kã}Ãvp·Ç ÛrÂgÐÒlÏ(÷ÞáFMü 8kM½µ.µc1ûøeÆMPùO9=îÅõ]a¬ryÄz4d1ä¯{:ND»äe´ôpíAêËD êáè¾³3âè9»
/ó21¡-ögd²õLfæÇ ÷ ͱêBo2¹¥«
2¸Àh¯ èÖ0
Mpi* á+Ô'öÕB/B EC)³Ý3T¦fç Î ' Í(PVê*Õ@¤n³kËë]sz3C .ÅA³nÕÚ7gn»|¼ç-\¦#!^Sxñ)qðíç5é^/UæâîZÂà "£F*1w${ó^uצóÛn1À¡SWZ7HfÈâ¦D!{îeéyç ¡<îÀÞã
Q{-%(Th
*"gëz×
ßeÜö9éêçíI!Ö8ÙÜS{Û¶RkrÍ ìÚFV±æ=·y°¨c²¢êbYaɸóÿÒ÷a¥$f\v~Æm4=§DO QÊH !RG»%ÆÂkÒ`UTx
"iÃ-Ômÿ?âO{xï;µ
¤vAº7( <m §T÷øÙé¬*l.²QNÌLuAvPÐÕ
á0j¦|²ª¡°Þô,ÄÌ
Ò¦P% Ëég~º4Üæ H'zN=£Ü; öÝ^8¦«Õ $QEª1&« È^Ýi@AX" °S!ªÑNÛû7[§Ã¬»t¦\m ËÓY&j¿}ý+ÎËØ þÿ¢Àk¢Ê¨ÑVjCr:üÿ.0ò¡CƬøìñ~'äîáÙ;ÅTÎFcÖÐû¬¼Vú''6[Rqg ÄÿDC×ÐFÓMcD2罯Ðí
ºM¡& O
¨þÒAä¡×¹Y^¤Û(ÈÄ^XQïffÊ?v¸³:7f·ÊTkËÎb-?Dsq WÜøo Á
!ã0ÉXA$ ¾ÿc|0Ò[·¹$ MÐjÆ qXK vÇMË*`FG_ FèÓ :¤V¡±ZÛ|§#sÅæå¿&á»Ú(áVÉiát@aÄËVS'þ]Åþ ãn<p kBþ_ÆÂ{ u¹+d4 ]÷n` 3åuÚÉúÌüþ¡9õnCºÀï³ü ëþECÞ?»¬n7),¢J:ÞjAÖ/àêæê#ïÕa#løÔi3.ÏÛ@¶9å¢% #b"PÓS)ßr¸
ñV{|QHï$«Ê§#$Ê$Ekª-H 44bU*bÒ+rÓÂ&Ù£¥RÊXiX&þñ¤·ÜûÛÏ ÇvënÝB&HãËçó>oIJî÷9òí}\Ë
ÈçIXÿ8äf³¿GÇêëN<ÑChU§²«2+ER²Îbm;ÛÛ¶ÃÃN<,,
#lx83%â5YÖ2á»ß#ÔîoÙ3"Æz?ØeÔ6àé´|v |Ó9& i=_?ëÙ[uÐúÞ¹°qÝV)²(¬%ÖÃmÝ QëVìjÏ DµWÄ¢ bS(ÌH@ª¿ÉÅJ $ú$H NBP®®2ŪLcàíÑ7 'ón?A)4ÂHZh_©ô
·ØRàM'¯5:Â?84 ³Eª»u8íë¹wÒo}zÌò5Ìskâe¨$M!n1c&ÊÃZÔS.S%`HáZ7§$¸ã'ÅÂÙ
(Z©ÒÉRI:|÷ÈÛðX;öö]ßaOã Bæl6(÷ûo ÌÄB0³së\Ú«
ÕêQ¡¥mÛ$# 4´Î qÌ*ó°ù_Çá×Õ8ëÎjÐ lf¤qYéý^ e'(R©¢Õ¶©@p1@P«coàÊf¡×4Ú+%@
h1B¼eo ² A¢¯Öµ ° J-cM¤¥Ñtêj
ºÖ²,M¨!¸Lk.1«õEd4ÅGI4T7Z1§"(Ù3F²²Cm4´d¨Ûc"ÓËa©i7Ye ¢Ì©
päÂÕ¦¡d
Ös@ÍÉ$P ai3Å@6 `+¬1f3) khmªÙ³ lÇ6Z ¬AZb4Ö4«1M£2,Éiæ Fa6£lµXÆky¤ÓÙÉ °Ñv{KW{YüI¾úgj@ÁÖA¾9à\Ý ©yv ¸ ì¾å ßè©?<'¯C«3ýwÍÊC>jéì¯Pd@ÈfSFÔùظéÄðÅUÕg5(»cù|æ,Èë¶Y\÷ÛI/-AJ] Å ã뫤Äôõ«4tSU*o6«A6òIXÔ´(Üa~6´a}»½\ZÞõ¶æëü5ÓÉ2Ü¥Qn·k6ܶE·«µQµcmQ¶£¦Û\^Ö-& }ÍngFzËáÒí?· ¦}ϨvÙ8Ñ8ná ÃhO<#4ÃѸyµ:h÷48¥ôFàCfÍhÏØx Màµ*Tâ+¡¡dBaá ¶ ä~ Õ AHKQÈ%µdLï¿ÞQ¡9+ë͸qEw¬z¢=l¢-:§Ða$ð{ºår ³¢X
s>:ÇÎõøµ9 õâa(` ÚNª%Äß´C¯³¾TÚéì>OWfd/Í!S>íÝQ)P>wèjzoÙÎÿqøOÑîµ+N³4Õ Â6ê
eBZ$bU7
Ø~Jü .>aæÍ^¾ ò
^uܯãy
1«¹ÊõzÑÀ`/®Ì0L_§p HHPJ¨¼ì
Xx¸×on×#FöÛr½<[{½÷·µsÍÏô½$ÞÛx£kãPE/«ÖHfÀÌd80H à Óûå»
íb ýl >gC°.¾¢
6¦=³ ª¼q¦ßdùnèºË]vÉÕG{!§§LÑ ¬ ³åÝa u²F3Y zû.¾£?QHÁ×PZ6ÐÐ PäF
£m$c5á´Y6C»Ï;»¹æòºxS!hÈÚpd#"òþZÄØ] ùÒ½ÃdÉ`ãK¿>å§-Û&ÓþiÈY±5`94ÃõÐ#èÎv.®=æ.H(..U9Üxvj*ìRÍÉ9BÓ$" &ü2\«m¦1PP-qUJ
,´)S÷|x¶Ð²X_+L}8OT{é§6¼êÊ5m¬1ÖC yedjBÈ66ÜèÙUêÎ<
76¬Þ,zÖ\+ TÚÆØÞdlM"0 Áã ºxÌy±æ`¹SÈX
,häÛ´Á
èFµ¥^©íÍF +7Å h²å
X86³"Ï!¬¨ K¬\j·lV0ÿ3 '%
cI6Ô+³Ï't·]Ò%Ï û[¦Þsu>nâ¤Fy×\;j°³1UÒäÍÊ,ÛU64«Âß(WôˤîáÛÉuöÚY3!Æѱ²VA1²iÖ¥FÝ[÷I¶¶àöaFA¸Ñ¼*ÆÉ<,+# Èt©¦¼ÐÀXHaA±]¡ôùÃ9ÁѦÂ̵ ~fh¦ÌÍN×v$i6
?3Ë1kº0².¢æ°¬ì´Ã,¯Si Õµ<ÊXûõLÓc ã7³Z,mµêj #6u#jK)\"Û Ek#V2*öefBHci
q¥Ø@mU7BêÕ+l|d{àÆÃ&æÆ°i@1àÚeIØFÛF¤ÐÛN@¦2-¤4ZI"
ëa) ÑXlm6HQpº
ÐÆOA1cORx&ı$¯=DõërEx¢í²õÖä,W©"Á:Â4ë
gÍ´ ßÝ0ªl%QâL·ÕW> ¬ËÉ9*aíL9nõeÆ÷v ÿ«Z>é?Aðm0Ä4üÄÝ˼qÃÜzîãØ8ãÛ.Á (øhÜ¢PB%OÅ«å캯Ún F®scX¡8²èOAQdÉ A<®óG^j#h¯ÕðÀôPóø¿
¿ûÇÅ ïàìàq
(ð3ÄN~<Ŭê Üã¾E'kç!ù?
?ª''àRv;jFHýÅ<BJ|£ln[¬bx¤ªjO#"Gá¨LñJê¥CèOá '¬OoJ}Í=G÷ÄøpC|íé;h×ÿ¨Ïk8x Î=/ä-óæOG@ù¸þ(~èæyI³¼LA3²©¨)xuKßç9×È/80ªsÔ sÅØòá
SÎe sg*¬dêöÆ
hÄ@ßõo6òWÉäÖ
ȺÑtÍ6Í¥i°"ad*©ÃA @!.
ÍLÜKC!°"!9éYÙ²o`ýÀE!¦þßa¾.# /¤:Ì$(Ún2ø, Ú@P)%"< Ó_9q$L÷
(Ú)"1$c"ÙQJm0ÚtÙ¥(Z¾Jôªå¾Z¯ÛÔkw]¥cƵ$¹qaC tÑ1jRdUu¸ÓÖñTØÃôþë.Q*tŸ}"[èd5®æÿk:|'@ôqJxÓÕKb{
#îõ7j¨¨Âs*À¨H^¡g{¥§E; ÁEðõ¼
çú6 Õ?]òÙçþþfþ^P×: ï*z{¸ê]s®*!X«`ÛeÚ¾º¢ÕYX\)¥ÈfLÞE&ʤQ3A@!
¨ ÄÞÃëØ@Èÿ˱{Ã
Ï0©0q¥úÒí¨¶ü[kÚ¼SãÛUÊv¶´(y(9¶]üi8Ø$º 7|WGKÌÏS
ÚqZ<?)vû?$L×ãçèsÈ
ðÙU8I
¨Í.ÉuúµgùYñd
ï²(°R
E==XvÐÕ!Ãêe2,hNDKÁe¿RLÒ Ævÿ¢S9LÁrÌFçMùp ¾$éC²!9è`ì!DH£ %.dÂÈgúL¹Qà Ë[¸ÚCéLhúö~ñ{R¶:AeóëS^ªÿ
ô«ë»>Pû÷2$(êÒ|¹y{á\ÕÅÖkµ2äÕ¤LîR7%B#TP"Á¥¥¡4®<mÿj|³?7ø¸>°ÌðÐçÑ !5e¢±ìX7æ[Ð.I$`HëuÈù¨¯(Iá¦ÍC1,;Å°à:Ù«dÂåéá¿åëÅ>w G
ì9Ó6Æ÷Ìý1£ Au¶ Byö)3Be¶îYä`³ ÜÓ½þLÓÏ#)Oæp'¡f²)+|i@1OQÄÆèC°¬ r XÔÞVI8ÏW0¤-ÕÛif[KØy?
nG¿ö0õ] h 0N {K!**L\È{0÷Ä¿Õs¬ÕZtÛ,;iFDW!ëU{ñ¿j¿ÔäÏYAGùRÅÝj Ýb¬.]T
þå Mè9²dFHP4âä%)6µ réòÕÔÈ J¤e"Ô£ }¯¾uÝt¾èîw3wyä<j§Zeb½ªÍz" õmqE¸Ybwy«#0¡ ¿£FÉûäSøm ³ámÕ2kVî »îcÅTäÃÍ2S1ºdñ9«6ÿ~Sàg])È©äºA¡¤ÅÙTTõÉ-ÍJË¡-Ç`/Yêdz«9°¶êNÃÝ+]»¶¤6õû2ÄjMD졺ß7ÉM¸h p0.Öº a9ª³üí 4[L4Ïì©ÜIòáQx¥ÖszPOú9³J +:®ö»°
!NuCÓÏeÕM
j( Z[$YÆÐìaL@º3°á^1æ¦ÓØ:o*PRFIECD
ª
PØ
±dÂi¥ÔÅÉ+4Ãfd*Fë²àlH$Æ£jÃ<Ï}»7[UÂuo
,û>N±rØMç CFNR)«!§
AB¤Ë1.öÑR(S
xÿ=ÈLjûbD[½$ã@³@Áx"ü `Õ¬3 ,&î\tî* ýÍûìEÅ<ÍÍÂRl{Èì¹°ø!y {
ÆÞ sk<F®|½U¯ sÕf=0ÆiFi fì[µ KÜp$3Áø ¬FØ»öb¡wfexÀ·ö5Å0µgÙ2-À6h.}\ÁrÑå'pí,ܸ>!U;?&·RÄ¡SoA²jk¨}ÿÌæ8ÎK·òݾlôþPõø©áßËÎB$ß&GÎõØMpõ Å
¤á÷ÏÉ5 Pÿâ¿xÓSâ7¦(±u÷õ?¿!×8 ^&² ÑäÝSÌ¡·Ü^©@â`Z¿Æ hpë:ç°WuÚé\oÃß?Í«ÞC¼®$1ªÀ/BÅew | ërþÖØ×|ÅÙ=Ç×èxK¤\èpдW8DýÏáW{áT r²- _ä¿\ì§îx¶vÆÈ Eq F([n£¹°óÕðú ÇÆó¼fÁÏøWÝ):²£ýÎjÏ0úl ëû¾³Ï`ºóM ¦oÂë÷63³_5Ù7gAêÂs2Dfóq8N³fl"1/´ìø0´¤2ºç'$õjè^å(¬dBñF¯ÔV¹ã®_B¼nW,ba""ÂÖ¸B Àà2e·1ãr£ÈwÌíFÚ2 o
É(,$ÂRí¢X0Õ k6O Ò
9Ba!?$YÁ¶vÙ«Mªl]ß9ö鿬Pu?!_ý Ìåÿ5ÁÛJ®®IjÅ:!
É;ÛÈ%
£SVµ\¿¢ìOÓ¿û8ü½Åê·uÅ0:?ÝGºC4ÿ
§Àú$âC±DÌ8¨y?ON~\àqÎÿ{b ì ÔÙÿÍ vî³Æeÿ\Ë!m,¦9¡UAHÊ"rqËüߦ¦=îÊÄ×ÆÄgä#8xúâsýalF,Cα|FFÆyðnOÞ{x¦Ì$J(*2CÞ:§"MìúA×-@õ 2ý@Ò
}L7ît^9G[ãñ hDâÍApÐStĸn¿*Õ£Eú¸JÐäýÎÏ@þºeãµÙ;(hñpë·+(ácegb«I.Û×ð'µz¨5¬Ãí´ma_è»_"¬þzÿéæ¡·µ¥
³±ÎL "jɤÛ}èOöçÉ@¿ªýû·°´Fv5[ ºèkb)jãhk}MöþIÇ®O©5óµ°#l°*ülM8ûjýÿz¼ÊàÉ$pEÎKiE
DÛóÜ|F+ûO½á]Ôr;ê&RÉDYÏn+Äg1ÄïªB9¸òÒZ=i Éþ[VÞ(m¿<ÛaÊâÜóaÀJeÝïP¹ÃbÄ
±Ê½o\Á=±£%> .s'TaC%öLo~®+ĤÞCE =_½ûsï§jã4
áëÅÌy´LíWÝ«;*õ×ô_gÜ6-ùw¯=Ð=ÿë5êúôGãô_F¦ Ô/pöq)Ôµt7¦KèëÉ^(åã<~_·ejWá"=pª@ÁÔWéGZE¶È*Êe¥ ²UT|8Y0)X ή¾íîò +Æby\¨úIp7 Qh*Sç\(¼Kb[@H´'
¹BHòU4\YC¤ÜIû0áyÃLËÎÛ+3X£ 4r-ùM$&bñøqÁ$;W%>(7Cl¤keX6Qi3
ø?wù_Ûv6l6°7½
¹$¾ÌÌë£\ý:ÀÑêW£©71D V(r yb&Òm¨ÔnDÇÖ·G
©lTmTÁlâÁ¯Tq_Ô¸G]»-¢¤ô|¯ûÏV|taÙãÅÿE0:Ø~É«ó?x~ õïb4IRú3>Öú°Ø{ÍÉUJ,õÃér»ª?ø8±gÙ&\³Ø¢¨1A_Ã`FH$m`N×%ÀÎáTJó$ÂPAgF&2;6pèǤƵÏgå¡áR5e©ª¶KA«y/e¯éu³~ã·1V_¶Î±e&2¢ØñPx§ÝbÔ &iþÎïô]k:Ýc~3¿uu2øúÆÂcfI¢AM¯-»8X¢%öÍ5Aö;+K'SCäg´&°c
P
EE59ÓY2x~3qÑÁGZECAKÇ+¯è³ ±s|Áª2Qöù ©xÑÿ-ý3q¿Ã~6iØ]bWLÙÑ d@à/nàn)M2üPwÞ73t=Ä[88Þ¦MÜÞp¿{²}zL»5\µ"¬:\·àÞÔ>õíùtlj/ò|<ïÙdR B©¸yn7-t h©0ÆF³Ñ ?N¨V69"i¡ìå ÈȶV
Ô+ ¹+U£N
c2ÄþL²¦qâa&5 U)] iªÂÌ$*m¸t®M;ÅÓ/
Ýç^¯#©»¡YlD$zp²¸F8âB$1Á·µÍ»m½µq|¶¾¼úÁ×÷
wç¥5°/Xô´ab&VÂ"9p©ÉÑ$02/z'9¹µ6seþf]ÔýSA¿s8H f5ÕzhWªkCdãªÝ®çÄ8|´Øø&V]|,Y_I-*r ye$ö ¾4)WféqPc
L3µMãP,"(±ÁÙü, Hë>K³ÁrÛ*¯¨ÛEmu
©¶o[r
14i4XåtÊJfPÆÙ~aºF½¶èo ÃÙÐTÔÈ-BED©ær©oj:¨ h0Ý°G4Æm5$PMAz×!2ö÷³è` Þ^ì®S¼9·õrÊüßjÃMG&.ó` tõ~ 7(21Uc²L®\Ü30ÂXÉ ØÐOÌüܶblsN
ÂhÞ}ÕqÙ !TQæ0©F³é)m
cÀÖ
ÓË®^´^:ë»jVÕÕÛïþÅ\(b
I²âÒÙDjµéÇ|{§r!nn1zíÆõ*5v¤)Ú¼ÕżÖÞjë£rwI¢Tîíw7Z¡Ò) [Ü
MWoTeÕ%¶ô=lÑÍûGB}ä¿e»3&nqA\&ïÊktöðÎÍJb/_xøú66f*ÈÔÊêÕ°cn[ű0
$ùsè¨2òj1(1ïTZbÃ:)ëó
¶¦ýÕ=FZøÑ£cÑ°´RÙFH5
<f 1p« ¦ ÜÔÅ _2ÔQb"¶nK3ÇÐiºY5K2JFZS9×u§r|{¯m·-#={òãÔ16'ÕÈQÁ¶ôËAäÆ
¦ÆòBBÇ[°·V¬]QFï;jå©>²ã{kß^ûפæì^OKÊÎØ+mÝns\ås]+·nñçéÀ¡tS-&êÓ³6Û¼k+ÓwbÂ,P1Ãv9Ó2
µUVª¨Â&&îºï´ëðÎõ§
×wHRÅ0¤nvÝ©D×oJ5Ì6Õ²±«õG¾ûì~ÛËÏI w d@4²¢e)'& µåÜ:ëa % Dæb
!ýE
¤UÈ#·bìÂ'äª4UI Gп tÓ7WW0âøû1-v@cN¡ÐI¤0â Iu--)4÷Û
Ûâí\˶þEØ9Q¬F&ì溩 {âD³.A Ϊ ]óL^÷$¾°Õ1jàg ù´³¦?/pó¾%Ä
¶]Ø%EÚKAD<«74éUÝ^gQåÁF¢É´ðɼCh½HÉà¨Ä]íÐo Ö'R¤ UÒj6Ï
#xmVnn·wã-Êë©sqá að
Ýmwì¡GE´tZ
¢HØÕÈï×õÙ£ ¼°ýgô 7è÷ÿ§{½Þ
ãÀÌÌu~L8Xpÿ§4cÖʯÌeÇúåû8a½7¤Z2yÂäEØKqx¶óA_r:X.´[_J,3¿åh 7zà&ãkTºzáØÌ£&¹è)ó¿KÈq}£à\GÉðû; î[RÖ60=T_£Æ>¯¶î2@4¼èlô¿8ÇçY[8²¦åó°X#+¨W%±õìßð¾>ýü³³¯ëèFd^<í[1wvôÞ!&÷xÜ15ÙX¬;ÜCzä¨jw4¹ÑgÐ#
0ä×,6ígå³¹ûó¶qNwzïÐüýæÈnÛ½PÍtS6nI¹!ÄÃÒVrcõº¦±(´r\ßY6ª=0{\qéÝÌ»¾ ×ÿônÜ×4 ±$ØD[õ?)¹¸¿%2·ÖeC®N×¥
bl+öÅs÷a7s íía»¨¬ºë C=ÓÔ#5- t 4<6±O[B»[f
¼ººM´º±R j͸\ÓÕÒë!c8ßðFØ®k¿ÅÉ\gMöç¢áîSÞxe;Ïv²,ë§"ò0´³N'Â3Ákªº#yfÕ·lÀù)_Z2uò 6§¥Cã¡Ñeûö©ìwG:£AÓ ~0 ¬=7ér cmíÁñøÿÎîÙ¥¼BV/$¼Ä*Å/ßfö
æD÷cj´èÔcKf¶q¤F
!z¬mëÒ
gZ&Ø$> {óG4:ZBIlôïô-·9¹ *mKJH(REÄL4©"ƨÈÿ7íÕüþG ´ôÅ=ÝÑ$ÜM5ÂxÎþc¬ÇÅ~ÍÈ xÎ1 ;r÷_ú,¤(>m÷j
¹öõ zr yËNzÓÆPîf;QÁ*:>ªgi»Y´in
¡46¬kÎqh?1æ]"RF æ].þF2D kþX ª©'LÀ ô
º9C &¥_ÑþGAzy9=Óúí¯|ê>[z
ÅûæV>R ôW°' bÛ<-ĵ;¾ L»©0í¡¹ã¯½wûíeÏ74Z®Ë'ÔªÈôæÏUÙmÎ?úY¿R,8üÅYq*ªDj¤C®4r0ÃÂÝ
À,P¡ Çëû²Ê'æ3Éñ뤥`®W+¥ÐùËxPiücÜÆnÆ3
"iLQÖ+ åØhaw!C"Äó\5é*ÏlÏ)Õ
HwPÁ °sy
.æÒeßu×·94¹åe`»rÆÂɶ³ÎQÅ h 3H±TRk#²Ú·00ÏCã÷r'RwYö½Ì¬údÛÛ~1FøÆZ 2P_Ôû-?Æ`lw çTñGË7ZËlÐë1Ím²3K-xõchÖ¬ÊL ÃZ&³1Äè`fÄj8bÁæiÒi¤"ÍdC(83©y/;ØÔUª)ìiA©Ë]Õ5eâ
= L¾@4ç®szf{
²/
T}«)ñÓ}ø×:4hâõµw4JÂCñ°mX£Ãö.èNû_8$ª 1È-ÝâM¤6 íÉâû×$ཽ/ÒéêkRC°¯Ý:vIw±iS\b}>Óó~s5`ú9
ðe(ü½r31èæíIþò ¿NfOã?g£véLâî¤ :Î%Cñej©CÒ6áþ
³ ýL8IH¶pÕ« ûSàí,ôg©Ï, ÝÂ2ºä~·8´Dke¿];uÉGi²ÉèmC;íM%ð ³
8Ô´Âc«ñß=¦ÆÂòKoúÜÿç
î66ÇBé&Ã1Ó[5eb¯i4qûnbsôZÖj7qìXúÑßÞÏÀRôJßÅM8qc(ÓÙosZµÃxá© µúÕYÈ ¬VÃaéÃÈZuæ$Ë.lÆøê±^Ð6Åû#ÔdËU¨3¤ pÍ7µ È+;Ó»ï¤;Ƭ¬±wÚZ/·¦òR;ÕÑ2º2ÁRPuô¬ÐÍ »0f8I:5 Z|l9¸=DØä6Ìu®øå˶mhâmnoÉ«¢@á· qCB\¾g)DÔô׸2@WZÛòmÄĹdÄo
Æ7Å GÇZ%¬|¬ñp·R=JÒÆlõ2£ÁîÖdÓGdêt+9d7qÂà°A
cl<]M1på ¥X`4,ÈcAÉnm ¢;p¢¨é¯µ
».Ѿ9N³nE&ö&p1½Cª´u`äzKµ÷-¸IìuÃ| ®34BB-©+6i¾V6gl
1}¸ÔL"¢+Íç´ÕK«K¡SBîÁZæÝi=3IÏ uÓ ÁEîX|,]Õþ÷â{ d_]ðd.~üÒÁîi6N`&eÎ^ôÁÁU0y)0FX;ÒX/s,.<eÄéNKèp¡ào :½¯â¯Ê³ðË&rÛHf¸979Â&M°5
P¬%D9±@#K2³qc¶vµaÅ:vB äá):8湩>n£Á²M ìÀ=\ r¥9°h ñPùLÎ0=vÂrbQJ"^ðìÂ
fS
Ð]¦$C° 9zym;Ie êáÆM=p¡éÞã 2Î, 6Sâ Æ
>jBhZ,(»C Z È!°¦U°á4?@?%
ó3m$àÍó±¸7SgA)Â7Á
j
g4θ{Õ][oZw÷Wª¯vKøH{Eðt®
`hb¤uRHèJ/wO#Ò(¿=Ý´fîNZ eÛf è, 2XöQ.^ÐÄ`HNHh'Ê®#×L p¸ÜDãHpë¶îCÞè_÷ÒÙ_ ðïáx¿ /ÆñÌMÕo¶~8eÅ·D¥çUÜ )¯¯ Pó{ó¤Ò b ç§ÎNO:Ʀ
ÀÞ&ü_¯oP½³ÎU[MÒ Ûéj<pǺÎR W®DÜÓy¤h»Y²Í`ÄAôó-¡ÞFøÚiÙFǬ}ÎÐsÖÙÌ7$òg ÙpoÄ=yi$nTEÜVæ¯HÞD5þÀsÕtãyÈlÇ)Æ_>\ÄJ²ÍÈàÓ`¶lñ¸ë ^uLòá¸ó àz,\èîìÛÆ$½X¡AÈ;ë³Z °wáèµúM/ÍÎÌßÁ7u,`9},/EÑL´½IÁÑ`ãÁ
ÄÁ1ÆmaV/ ¦òÂ
bZlàGÝ\b.nṈ̃pä\T&c£¬^ÄÕõ!7d¢±?®¿á NÜ -aêà+ »czö×ùí;=¦ 9 vëòEXhÈÀÖGe£g äpÒ÷q7I¸nÂ3£/
:Îïc\"àp¡§æM°2Ã2dÔ kGÐ ?&ý
]8·ãp:ñ6*ú¿´÷Øs hn`¡ãÚÿàÑøúóN03±_ëjºX¢Û°å¶k×öÂ~Ö¦ã\
ç ôzÞ` _¦ - b4¤i¡µÆ)±Ýç¨;qßÞµ8½=/µXO
£v\ðÉ]X + åÁiÐb¥ hãâ4d²R\äÚ
£)¥}¦$kÓ l¹+eËïgµ á°íÉú ¤~iÕroåÚ¡,ºà ÛÉSmV
N±»ííW]°ÑÔ8íë¨pAÅ«1Ù
úý£¥¶fÜIÊE»l2ÅÕÃH\¸
µQmmÓ¢UlØ}ß=)1E(*ì5}g¥±^¤ ¿cF¡ *ð(5MÙ\þ ÎñË T¤§®«ãÛ[cL_¶¢ã¿qu½û¼õ¶NôÝ=¶»gvRCvÈ,¢¢£<æ§;S¿ß Ѿ+
lÅx Í÷ÊP¸ÈÒa|Â-H@ì F¶¨ÛPhì¼;u£ßP¹¶OÐ*»õÿaÎ;Yá2ï[#¤Qwtì8HÆÆ£DV
´>ØÚÊÖòå wõק*è0 DLh¤ÄÍ.»zóÊõëÄSß ²Pz½ÕÁÞß ñ}#·aW83ÇiZmº,|É0pÓ¬6Úk 4êlÄ8ÈÐÁ©:Ç"ípuëQÁ "·urPˬlà Ûáÿw@ë§_ò*sx(ù8}hîñÒsg)nzênö¢@à ¶ûtüxü<öuàH|È;xº¨'MÙw¿wì_Öÿ¥¬õ=oìò>¯ÔÄèr²UF|ð0* ѨÈ/ZE©³¼× B̼Qî'ü¹?ªLNú½ºÐa ã¿´ÛYâ}fûé
«¢0Ææ?|¼6b±y¥DøüUìþ
Ï2Cãù#êõ¦ aÜ6ÊÎïªV±ÙÓª<PµJl°k µÊÉ ¶ÀúÄþfzgÃgWó½
ÿÁ>õ<[[ÝõUô©Ñ¾bP¬çÈgÎ+|ÿX $ð°å²¾
äb÷88¨5pþ12D0÷Ät~ (¤ö]"þ*ÿDS(80Ò¿V¹¾Þ'îþê_1¢û(s]u}?ºaúáÔ}Mãø]×ÃÀúµîg3¹é-þp>º ~YÁÇ9"ãÏã¢ùÿ¨ÿÉt.½µ=»P~þûÊyH<ÔO)2EùPNÓ½×üÛZ/#ÚuTüCÒyÚ¾'§}Ooò¬»OãI uõBZ xò¿j M Lq {WÓèi³ñç¼ÔhA}ïF×çòw'y)éçÜz(¾ 6ð d褨§³Íê> ê£Qdhª(9¿ASz#!1§¢~w°OIÉÐl¢ÜcÅPyh
Üí ÂiBGRÉÄñóºÂÚÄ=,~d| Þ ÑßYG/ÿBñáÍCÀ9ùüItñ±êáµí&õ½z«>ÔñYr¥ ôÎÖ{w1=_Áø´ ¼ |!è'¨ßócú7úþzú|\U;¨tñ6HnóìÀG»¿î)ë5#ïûmá0ÿ5pÛVUÓ$2AÛAõ,)>
ºiÿ; Tèáú`ü|Ú:)£ßPì!ü z¸ôû-Òp~ægê©ÍÑ÷ãÁCúÔôófôó ñ]ðû]+%Òótq½-&Ö.d_S8*i¡8ý Uø© ¢WÌÔ
5ÕX,©nV
ä\í¯<ãznQ£ÞCq½§öè^ _H7QÁÎ7¼5§Iû¦l°qâëqþÔfÍò¹Þfôè¾cÖ Qͤ·ßE4'NãV¸#Ù$
²Ê³Ô`@øÏÎ,Uî ¥QHº3>2.d{ä 5ômñÉ¢ ØoOíÅLTMÃ85ý´#xO^+eí|lï*):ÒÀ3K{ÓËX^11É0xv9w2XªÂ=¢
×QÏ8Öë ¹]´ÌøÈ/
V¢l"A}R6µ'6-fsÑê¹ñ¸Â9NÛsUyOÆø^ýAH^ß.ãuéu'w $¤i2CJY£[Óç^ü» ó¼ß®xº`Ôo]!°õÞ¼eÓj|;Né1\ÝéÛ$GÇ·Q04¬aUPx% S(©£»¸ÙzYÛ»ºWp»¼y¨!la"QðÈK3Y²7 ¬`Ù
¤R27 :7HieDfÙVórì×QÎg0, ´÷¹¥\Q±¶`1¦£¾`ØkAayåÃ!HBDM¥ AìcLkÃÉi=y¾áü=¶n1к³VAÎ8]9\eüP¡NeÅ9ööíb>?7àÚñQø)¹ GÅÙI Æ,APr¤<Æ^íWUÔ´ q³Ê÷aþý×úGÉôÖr$ü¦Ú!þ
É>óo
ø¢Ôsâyûé´øJ{ÆÄvQG.Gü" úõDd¼ »â¢`Û«ÄgHñYíoÝÌ SS>äeäCv$9xyè'á/çÑ¡uT &êð>kÐûÏÍÄ!ø,Õ'öX" ãÁZ%Äÿl%'æ´ íöß[ dF£¾3¨]_"/zX¾pPq¾?
ÁI mÇÞ±Q/£ªÊgóæ Ê¡½)-)M'¬ØaH !²¶ÐÀÔðèd½ä}ÂW2 (Em`|¶u&ú¸j¾ Ãjèó|×
ÊDq¼êØ£!4$vçØ9@åUåÖiL¶eB0ç]{; ¸Vu7[¦·ve°MÝV`MÝÅî¬Ý /Ñw Û×íÕM öMkºðvÿÑsàµl°b0ÁçîBÿÐXy<I¾¬±íÍ4Ðf645Ä7þj°O2 QEºuY
&eÅΤÄ`M^É \K!L±» ¦Q!í0E<²§Ã8IºÈërY ðÖÙëVÀÛhQN
0b7SÆú0ÅsvmÌw¦¶¼ºF¹W8s« ¼Üce2
ì*¢)NàÉTCØ0*.ÌeOÛýÂw`N
ô@¡dWÞÏ )<£©Ù|X*B}](&°Òjµr#Ã8X
Ä+Ý.;=|¾zyÙ£L©Ó ýeÝØDº
xm9j»©È .Áö¢ÖÏÙÌ- S¥~ÅXðÇ
³ú¸H»h½<Ch~/?a?Lï/Ú°_gÜv @ïÓû
þ8 ÿÁk³ÏÞÜ×Ç7»pÞ¦â f ó²DL·åV0d<¡$3aÇödrü<8TôZ/@âö»lB!á=å¯K(ò4ñÏXo* çÄÀ³§!Ô»+²zÓ¸ÊO* SÙX2 ,/&ñ@Ò¸3ufR(_-' í¬Øk!Å ÖÞËR8VËèÓIW6Z¸KìFØø"´ôã:´9¶ÈàÄ`ÅÀ½0léÆßqf
LáZñYÛ
mxw!ô¬ 4ùb d×W¾@@yRi¸b38ܳÿl£"-ÁÃfAç¦pû7»,S
[»äNö8Ùæ÷æðëOaCN93\¿-§W®3dæR²Üi¨ Áfq ·¦*$ÊôãZl½ñv5õD+Û±<·["ðŸÓ=Ȳ㷠À¤u úÁTá
:°¸ÝáÁ MÓEÊfDÒbH¾rÆÁÎXâÁäÍ0 rO-pô*øk5 °Y#5Þo ÞF
ÈÅÐU
T͵¤QµÈ°l A ÙɳtN7"OÍF,ÛÏcË9¡ yÄ kù×+a
ɤ¤R2}4hÖZº.hOy`ã^ Þá2±wE`l\jª%\¤ ³ìÿ{^¥lQ R¥²^yë
¶< µ´þNsyÃ8\½à2ïû|=ýoªãUVÜ·¾´¨ä:a}½gxõ*þ×Þ³·qwNiôAÚ´ìÿ¨øgkÑÊÇÜ;ß«¨ß¨~fD8ÝÉæb¤M².Ø-s$X@Xµ4 [¬3³^6ÏÄ}lÎ
âãxFmÍæNógzÜ¢G'®¶®l kÚ8(1µN#EøÞ ÌÖT$2a,¨t°ØǦíÏóB
x Ájâ ,Q
ÓY[A%T¢Æ=CäÁø Ä®ö·]è%éSøïÂóÏàùYú à³È|Ï?= ÏUí>góìS[WwBÿ¢OÆ¡bKPÕSE¤Ú¥°p1£B`$$Û2Aͼ¾3èg¥ ;ÐÅË*XHÁ{¶'A SªçJ±UJËa²;ßuôw ÈêÈ(î5&¤æJ%°¤/;$ÆwaHÒÃ&LUH )Q ²"fy= CÛLÐ/øM ¼`©µ0g&qÇâ J͹G3.ã,n$_m
$µÄnl®æ¬(Ë% ;â
MJ"ªÏÀÛ¡û5ιn7ôÔA×( â$ ¢ªÐÖn¢ 0S=+);îÓµEô1¥©c1ëP£, ÇUBÖ+ØD@Âå" Q¤åUºµªö2ëGRÎÖÕ=ìؽIGÏñÇ;³¶³yØÇs`Ïþ~*ϨõÙr¹ê¼FK¦Ï
B|«:Z ahBÓ¹þt½9?äê5;æé
¬8b}n
¢Í¤3HR^§áÙKækåô¦^³ÏùÛói^ÏÐç8ÂDd&
©bÑSlSfVC##|¶Ö£=Ïspm ÚA¤hæ HȵÀñüí,¼3A)>mç äO+[¤èdýdÓÑÔòÚPÙuj
Í*1"À=³¬ÌÓ)ïöüÍß÷³ÁÑ gDz<Ý~$#³øa¹±Ã¾O{D Fq²GP]©Lª8þËay)Ïô´òàÓ¬1©Úâ5=Uéβ7hס"ì1@Ì-+1`øõ¢¨+ÍFQgúÿvòmÜi4ãj¥´tR,Áeª[9ri¸JSήUÝÛCÇ!IE-
PÝÓÈ$eí²¢ý"ûyô|m}³&¦[o«Bk§
}«hwþ«ûú57Õù.Á
"^K ÇÐixðf±ló8ùøYL§[³öóiË¡¤~2 @²`Y]bÅÓ¹£AâQc*Uq`¤³i09 ÆÂp>@ì}}ú7^/nySyCÇ9ÙÐsB)1\uëå(Qò!$öíǯ±{¨IÄÄ¢@G=R28
Içòu*hQOßVÞJÊ¥0ö~ëíïëÓ è§jx1éý
kÂdgJOÑÍØ=~:X¡&QÄëÃwD/f@´¨ýØòÿ¦ ÍÖèÕx¿ªag ~gêpfz¡ Èj´nË+ ´ñpZÄX(³½Ïñ¿+ Xç[/T¶²m³¹-®¡iisda§P{Íëûwa:ßQ Ʋ/Õ¯÷+]ïÎWߥq5TÕÕÁNÚXLÏNåY|Í &Fs8BSF5ñe¨"3Mc¶6óVHìm¦¤É k%ÀÙô·6¶Ì0Cc ̺
`°UzÜý è}Íâgüm/ÙõßÄç+¨bzcÜ? cNú%|ÐNßÖ°iBÅV ,8Ì^b×þÃû2fô âäÐöüMoöé|Lk
¡²1<Cób¯ìfõ¬j2'X\{dOXÀ~ÿ¤Äxw&Àêd =âÿª£Êª Ì* :¶0B ¯¢õÙ´á±=ص#a o%<RC,§RúG>S¾ g Y æä¥3ÄÙw_
ÕÝ©ý¬Ôz§vüKg°qÏÇJÊïsÅ|1«" è(ÓÕ<©ûTõü,Çúé4ºåS*1Ad¡ù¢ûT»IOuÖ
Áb7ôKÛ;xÌÃíÝÓ[ãÚ <*ìÁÀ8LúÊß]IÈNzöÆØxÕÂÄñÿo5pn×¥úV»èe÷ñ¬ð ß!kË2BekÎõ9¯z\-ÜUÐHo?5PÀhù}Ïý¹Ìñ
ÇìÛv¨¨Á³õ¶ùã"6É£NcÆ)ð»Z6]»æDtú>ÅË?Çöµæ{Ô ÌM'ýÎ SÒhr_ô®Ä6W*uÌÁ[,¡þ¯`úÈfR+ ,ö¹ì.Ä-R5 s GÐåÂIó.}Ë@Ͼ?ÿ=ø·>Åd¤*UT)YËر `ºj»ÿvýùOI«DÖ9Ú"ÅU =F;ZwÌû_óÙçqຬ±¸îÊbÿ.þ³/WaÇ9DÚP¦ ñÎPD®$-â¬HïÕ¦ y*nÆ >Y!þÓã¾{7ÐX;z ï¡; OeA èÂAÕÅ°%B¦ûROFÔê±uã³-×Ö®ÖÏø`ç=Üë(ãøJ,çÈôºæÇ,ð§Kð.#²à1]/×ë´ýë%[«[?fÄ î;`åº^{[¿Sq"þʹuzM¹± 5& ® ò#L&*T #p·^±Ah9+Fü:9«ï¢8ÎHß.&aJf©ñY Xïþ,æ"ÞïÏ/;ÏÉ}vdzæb Ø1,E qBФ$Bê~VGrP ¤U{úAh8âeE9ï³Ah E:¹ó|?ÊÏ ÒÇYYªÈ[åõ;$³ì¬Oî'jÞ-xò©¾*Q ê ´¢jX£lK¸Ê±eß;³8{?ùT×\^A`]û^åëÃ}æ"ß'MJ\ÜøPW6ÊBØ``jBÃ(D7p¨Äêm£ M z¹&Ϩâ{®äözF·ÌMfµ³ìZ¡Q9ëãË^¦¢ 'GªÃIæéø5Ý×]É»·'nÇ)£ D0e®¿¯ ]þmôì.*±}xg{öÀÌ!Á¤Ã)!§6Ý
Ï
yo£Æöïg [º|©½ÛÑå¦íi¯3[ä1Y ÕSª¥½¼¨¿RÙI¹pÒ¸wD èL"Å5mIL4fHdái eÊ
gøÏKyr±.jo
vI`Ù?.?Gð :ôóxoø>&ÄÐCªeøUB<ñÅâðÚÙöm7 AÂÅHàò*Þçâê`ݱ´7
9cm[é¸:g F!+áad}¬Ó¯\ëËY$ÚZ9 5MÞ6ñãíK#ÈÊãÝÖfnͤge¬{3[e²wêÆÌb+ ÈÑ#qsv7»yÔU«99Õ+Úk q²<QF0ve½²h(±LQD¥ñÔ AȺB¥0C{?ë<0@ÛÞdØ5!¾ÂÀyES¥ý£ÜÚü,o{*ÛƬ
ÓÓ.m#¼,·!¢Ò«²Ôwcfd©è ·µÌñpÊoÈ6Ú|ÙºøQ>sTá>æ0mT$v8Äò«Ï0-ïÞÐ 7þí»Úã9ÀÖýðvúGÎ&rEx³PÂXÐXjú« }2^÷ w«®.L!C+g;hmlª¶p¡æ Ö4ÿú @
(/¤È½ q£a ²'¯h&ÆýÌÃô(õyüGç>Çàú½Kí ÄÄnN°iiËÏé/9 gaÜy<t¿"oæ ¶S¾{ ÝB¼A-YÆûM;á¬Ô·ëþúz°»}<añS§² ) )ÄÈeÖqü>cYäð÷h¹sUÒøÇÓA@òXÙýooÑUH«%TkÁæò'LÏ/í+ay $HkÕ¦ö«ËÓÜ+CTz´ñ¥ÃèoÛ¥Ò¶3Æm?Yþk·É\ç<*iò© è¦g«w òj\öçéÛoó¾ìäë3}¨ý¸QïÌ÷Hz-µ£t4Osö¯ðYÓôD jÜ(æ·!ß¼\ϵrû&LO}@¬ÚýY;èÁÈv;-²µÌ§ÕÔ±.trkø~äS~YCÓó>-U ÉLùð÷8[
ñ·~3û´~qì|SM
§HÊuoÊ=~® gF$f AÄ´I¿w£È½0ÒFáYD (D ['Ì1'$dA]µ§+~úý¯Òõp9Îo²ó/ð^%* ð WKÐVgz¸UàÙ±íôJ ºÑú׫ /?¨weÞwst;Wùþyï¼&Ñsb_K'7À¢(yÙâYò¥ÌTÁsÎ<5_ÞÍìn·£åC£ á;Ä
ABPZðA] HÅ¡lÇkñºØ·¾ýSÂÕ`ÐMY&ÿ>wá ÒÛ8fs"1ï#HO8u¯Ý¦I¹*î2}ûq×Jë£âI¶ wÏ×vlî§Ea¢ÿl(ÿ£w`|â° "o ëd Ü{¸~ÚÓeÃiÂdXéGGj¡ò÷Ze?Ûöú'\Åíý/ºÌ?:ê² NrIöÑ*Üz×zmÝ4 få¿z0@ÙÜzïWÍ£àÄ=<=lC¥óÞϪ6Æô]5úZ /µÊBPbãËr:¹ÊfC¨°1T@&8ìó¿Q| ü4{¼²ïÊÂS¨9Þý2%%Ö¹lûõ<Èöè:?)±ñ ͳþü Ï}ò^ Q ü*?.Ex®(ÂåP)ðU.ã'Ò.Æ 4L¨H£ºG>f@§öUÆ Ú ÒQ|Bü¼cHÉHJ#MD¶u2
¨ÀÃÏ] ûTrj Í
J@Ì0~öþB<ãwd¹6é&îóÏÑ}]è 8(I@ ³HMM Øض4jÆÚzã·-b×4[\ÚÜÚæµZåk\©*ÑmµEÝÖÆÑ«*ý {^Ï7XÏô§PÿÀ¼säjgþFä øð´lR¼Ãm»*Áªb¦²ó¹¹8X¨ú;¯Äÿ«½;VçÕkÅM@´.TfXn,Ú"ïÓ¶ü ùq]1OKf׿bÁ¿ä¡£D¸ SWTo*Ì@þI ÷CRväéΪ¤Zm(0²ñÓ2÷82mq
u²ÂÚ§;¨·i¨ø×Ù<ì¾=j¼U½-Í[¦5Q®mr«ì¹µñ±mrѬUÌlZ\å¹Í\ÑwvÕwv·KmÍÑkÜ«ÛtÚæÕËb«k2RdX)H,ïÈl;LÊêÂÎyοzkÓäÞ'í~WËzIèq×ËEg½Â*Â242C=.5^7Õ§ÚæÞÚ Ä»(bÈUGÐe?ßmX³Ì«J úeº©ª¯%àÙ±÷%öë÷5t=<UÊkŨ*ܵÙsm|óû½&jòÓ^1¯¯×.fÞ7F"ÁN`dQÙ.xÐ1¸éï{ÃûyÓ, äúþ_óÛÝùÿÛØ ÅûnηÓwÜÏu¢ ¼ùû×%ív;ïÚà 0à 0à 0à 0Ã@ÓåűL·¬óG϶Ü{ ¯{óÎ m ¯{ò@ôUC壳àá«Ý|÷´Ïr¼ vû¦÷°G y/ÏnAñÜjw7·ìzøáÈjÖÚÚæÙjÕasUÚ øèªë¢ÂDl¶ÉUW@.§ñ®×³mËLÏä*Ä(ÅÈd¨6lÂLÓô;s^¾l¦CHY½~E&.?j? ùqâ R.³ÌmȳzÎƹ¤´úÝÙÀ¹Å¼òûÄ/ÌQùéïúõvþ³º À þ43G;(Ê
kQ
& {fì¼öÜÊßÒgü¸ÆZx¼õ«¡üh}£+^£ë±®¬»Vúøt#:NVCñþ³:ü=ÃwþAÜà ÕÞ÷ÿö_ À+bß4
©áH§QF`#
Ä`¾² Jªhä(T2{âµåjÖh¹µ¯ªT
=D¿f:Pýo«ÉxU±ønQj
M
o¼jÅ$KR´ílÚHH$¤v²käÔÂò¼âÆ8z(+IJ Xövæ>é±t§"ß! ñ LòÇ+¥Ç©®Ë
] Ï 71yA²Á«ÈP>¢ ´ºÖ÷qÛ®/È Æ13ƦÖÀ§
-v /¥&/ϧ1 2V%ú@^7ýug¿n°ÝÍ&îÊnaÆe§C=Sf0T3Ó.¤&·Á«ôÜY°ìÇ¿Ä +yº
MmÞ]ÔW_ÆíåüîäÙMþ¸Î® X´óÄßÑI Ònøz
_X\DZÜìÛVÕø©Úîù, ìSeвd)3]¸a`êpÑèfÙ¾]r ÁèsCM<Êhß²Ò%·{ÀÓ°35>8í?k8NWck+:É£5¨ï èñì²`Æaèí±:½Õ©òß¾P¸ù7Rp¾S»÷1oÀßÿéøß ï ··Á¸fiú KÆñí^ïIlç¹/I
éJ#!Åæ%$£®&ͤM:x `ÑT÷o2CóÔf*RY:U±6ÔÉ@Ó¤È*~; î¼M!õyf°îºû
Ç' ý/¬Ï¤wÇ&Aú Y âu×ÇØ ñá¬Ø_f»JN¹Ñêê·Æ°vð
køjÓ×7ÚfÛ æÙÍ.ô»ÎöÊePLí÷÷¼DV>IJÂØæ Aìpö|&ûÃ$à¦eîNý«éÜØ ë¥|§+*½A¼®[ ài]ì <°í¸`Z4ÎÁÙÀ¸Î'¡v¤YøåSç7åÜ ÄX1paÞ5ÝÃIk
dçD?ìG i¯,Ã. ×å§Uek9 ÝúãÌêúÜ9¶ÍÁ b£´húTwÏ|öN#o®ß鱩n#ÉñsÉ©wµx*ÎÕ[qñåÈec]±]7&¡OMwÇU½T¢ÍïöõúÿG?ÇÒvöú<ϳîá
Ò>ã}ùö~(¯ì÷Oº ß óÙ@Öê&qù½Çéóñð-qïorC͵¾
wöùxXÍPèÓÝ!{D=Lèa9ú_l>YÍö#C·<»[áRÐ[\ÿ+-Ãhã2î3¹ñY?{÷-Ó {/Ñ Î-cÊ ò
chpãÕíÔGÕºcÊá(¯± âb#h"X]:±ê¡P%Ûä SËûí æ=Ô î
w_AÏØþ¯ê~»ß.ÝìÎ}3ɶz_ £0^Ä6äqr'O;8ÎÖö¯\£D'ð~WØû'gûÓ¨Þ¥ ¢ÖÝcß×0;Ýã]ýtß{#åö«\ÛÖêäß×Uï¶v\
îq\7e̤¹$Ó¹ËZ='k;ç6uúz¯k¿Ùâú_ ß =Xü¹g/7lu{Äüë`MÖ\Åàð~fÈç-,» G¬_ ~Oï"ª 5àU|~üqïª?ð»a ~Ýå@c 8Oç¬QÍ)´
ÝÑ4f k iÏV¸àv¶uôûv¡{ 6 ²è¢úXüÊrà£k|KÍXîl·CúIÿê3\lªÜD=ôÕÁI¼Å=öïTé!îû¾ßÓZü.¦¶ÞrÅ!Sm-fH ÛE¶mµj"Á©HQMwWUÚDÍÖÃ,fE*ØZi²¤F;v®v®éÛi·+]!@HHÔ¨(VʲY
?aû `õºtóâö5õÂ÷x 8áïsÎð<P )
zSz@ì¤HöþÈ ô"$6Û¤
Ê'Ý5x~²ñçt®»»JeÊéÝ%Ñw~¥m[ζõóÛñÛQæÚVEE&ƨ(HÑ\' 8JÉ i¡):Ä¿HÐÛkºÅk197
ÂÑݲÕQ×vÏáû~§¾ß4b9¢r ¯«dwÇ«tÒÔJv1ÚD¦ð=¦ q}@qa,@¼+MRE&i)ðZI=OÊQ HûÑÒM #
Ý7:×£3î6Åç¼P¡ufUUK}*Ù;,èCL-ÎNcní2"JdÖÛ: (Qsf@!t ;]ã×õ;××æÝßzwï
¤î0?íïT g¢ÊÉ|6{Zr<ïi ò¨³.3oSN= Ñ
«hÀðÓÛgæ8{çg
¤» ðÙ67ÉPÕ4/e¬ó,
Ðò7ᵦE&ßʨ ÐßS_?t=»ç]CöË¿cêèQ|ºáîB ú ßsï^xò9اâ]xºYþÍÒü/vDØîUdÒ%T)YÃeÓLßU2B@Þ.F3ÇXnG(
¦DH(²a K-Õ°F<ðÌ UU
'X>jE ZâÃÏys\ÕÖàN¨iÖ7äZ£dDzd:;&ñºFcÈß? ý îòíælµWmU§^éDâiuRAWJ©5Xáͼô\Aûîæü{®ð"¾UE
ÐqzW,2n¨A0Ë!Ò¾ÉÁÔ±7AdNG¨dÙvkÑ>ÌvôϼÄUc;"¼¨P÷«
®Û¦]ÕÒ# qv¹^®·¹Ú¦ËyMê$"p[..àÓ i ^´
¶»;e o0{üvXÚm%â®åÓÈ «1à(¸g^¨¶,UÂIl#TIw!N¼mëÎ^h
*æ¾Õ÷
½5=ööÛÛÒåú½*ôÆ´[cYØCÅÜóëØö}®Ì_+àyJSâ8?Í{íîfª-5G6xÎÚ;ìB°¢êûw2¥Z6PèÓêjÎí"dA'£Äv:Náz \\<ç)Óè¯"Ø kÀÒlz$Õ ª £b-oä9HTSyZÙ¤v²A.·íAA4mîùÏFºû{¾LéäôwtµIÛªQÑAÑÖæ=ÚC®Î¶Îtâëü÷âxt4 vM}Ú«ÄØc
üý #/<ZÚ×kzlÙÝÕ ¸»^!aZø aËwùϹì
Tx;ÿr§0ç"P|H ÎéBq}ïIg6úÖx»uþÈøX*(;±úÒ`ÃÄuÞ3yâË@O!J|¿TµXc1¢Ræ ÄD ØDMÑñÛ"*ËAè`#ÍA T¢«e²ÊJÓjÒ¥T ¡»y±Ü]á/?=¤1l©OE¯ ûP2s@ì9^RFX\-ñPÐhsRýK /7|@@ ØDÆ 7©Ð~ï.
é>§]¼ubËÉòà;¦ñ×Õ ë¦[]qu~c,qñ%q1|CÉñ££8ËæÑy^S&K¢PpÊÍÀVeÜba:q²@»éB
*D+òIù(¡hÔ3Ó0 ¿±ó vyµ©ªk+)@,ZÀb¦ÙÔg¶ÔDùâÆ S! ²µ²´l»IN
Y;!F8Ô=°æ»¤UTÉ×éH§2!w±E¯XLi¡UEóÓ¼@L(É£xÞp
2,é°×ÀD/ E D¿ÂÄ@4-Á7!¾àé©ë¤êoPÎYY#±5d>
×ÙåæH°MH¸a"G +èÏ)Èåx- z ü=&Á¶Ç©Ëß.ή2ïy÷zà|²Á·ù`? vl8 KËÞÐ)¦Öß( ønðó9u¢ lìíêóÀq ¥ ÂÊ@³¼É§V3îø\}O_Ño.·uÏCÁ÷èàoæ ?BH*RÊuAáó<¡|,!sféhÉqÎTÞD ªb6úàжN·ç·/ù; #ÐúøF3ÓÅ¡ãÇ y¶G§Z»²^!¸kó7£Â Pg¸±út
ÁÃÊÑЫ|o
= úiëeæÒsãà$LÁ)S{Ñ÷ ¦BÔØ10r1g,¤× G-píêÌù+É*lÙ³%½2¹jó ÷Q_
ŧC1 ³%±á*i4¾ `xÉÉnçNÕ³±´Ù 4Û¶C^ÈR:si±ÒÝ=êò
¶e%8ÝDWª£ªà
A\ÐB)Úá¢v%íÔÙ6[ 8Ó=Ç«»fPÑNÌå}e¯Fd½ù
ß½Y!¿Eg)a{|~qÕÇÇÖ×ËÞ¼Ç '»Âú<M9UmkÏ<ÙBÜÊTW·ÚëwN>nCËc}·V ö|/5æß¿È÷=Ízº{]~çF£¯UkÖå»L²¬Lè°M$¨¯³-Dbïx¼üé±ôB6 nÊÜGÙZ¾¨'#é¤Ïîáµ6øý¯§b±Lµ,Æ =¬®>X«¿Ô%ù }ùçàÇèxÐnü8Â
È1ÝY Ý'¢`s¹Ãá¾d|¾D-@5Sª¡Ë"Eq`MíLqµ¥ùq¢hQhÚ6Q?:·¤Ôa¦íñùS ´Cü¾Ð¾VÍÓB*é:\örâèIäL'.cÉ@hû!(EÕ ¥Ú=R'ï,#} :}ÿdLõÇY±'=8Ü;&oWÎ*ºßàÅdcøí{dØd1dpÝ°=Üz¿Ü5%¯vÀÏ媷9÷v²JépÉJpÒ¥[
quBcoQÈöDª866éåõ0+ì90!$ÌÃ&¾òhuÅe§'°Ä¶Üc8#C±z(ê]£²½Óh*~=aù÷°ÀbHü UÍô gdH1·ðÈ[îóÍDß ÈfÍ8 6,-$4 ?»ôª}2Mñ#k@Ý<>#àc ¼ÅD·¡¾EZ3]dq¶ØÀÑ}h.ׯ5ºõ¼nc9aH º5*îæ^Ù=àÞe7õ£ù±¾
_qf kó£Ñ`uÇm¹±³6f÷üÌÒBå¾ 8-ò ¥uúñô}uÛ
Þ =?ÕË=_í³ï^'i{Ýüý»ènÐqó wÐ-<à`vïÆþµ;Iâ[ìl`Tºh \Á-efmá|ò±. ɾKë\c[§Ûºw;ÓwµÍ¶R{Z2²F-
JÄ<I·¡ò
Ó°Ëk{PÌÌTöáµy¸UUf±L ²ËeG%Û-d pÌÉ:¶% è{Ç6³p92N =ßGOã±"¸øûX[ämaX|0sܹäZaöz]½|Ë e¾ü÷yô'ä;µ¾Ç|FFÅ>Êévz° ÓèØßã¼èÛÜ} Dzf6'i;Ól·YÍàkÆ|õ U
ÝXßUvtºöOy
*ÉÒ4]1NìŨ»D8g´]»à¢Ê l¹a nqãXÜßidájÝÆö#Gtg£é#æEµ > Z:b¤± CÀ<úL÷ïì¢ELÎbö» Iø!Þé@ñô+ sîȯ¶ ß±<EÜâg1þ"À£~|çOn3¡³«Le"
ÀÍ@ïc±{ . lè$ë=ÂsåÂ${»!È 8êºPnv{ÈFÙâµÝxµ0Ó:r;#Ûçø]kj kd2b¿¤9ã-:WóC¶ö1¬NñN]¢ÛTn¿Ô1
ã ô5Ë ßÉÄ
|òµ9¹ ? µ.~7e´+ôn× b.öâ!å¸
,e¶/UÄs·Û:¾7rg*nå¦w¯±^:òÂinÏ oÍg
ëNèlA/û9ÔyÝó|ñ! fPDVMÆß:¾µ³ ªFþíj01Âg;=ÈØ(ÙÓ CÛ¶áP6Èf.æáq<åæÓî÷ÚµFÙêo`ÆëMÀ§ü¦G_wÒWxÔÕû{9°5n÷#9äöÝä_×"{ÂazD-.½¤)þQG^8íòÒnÍkgñãpH ^Û·T'Ö/}í^(t[ë¹h(bUn³ý+§ 7Pb!ÉE®q7ÈFÁ©N9Êa²Q}µÁÅZæí§_Õ]¦¸^n?¿Ìe^áÆXöÓ]Lí£ÛüÖö½í¸M ¿ú>̾nâç âÏvkC« 9Ý 3ÃlbÃämaVcÕåþ?Ä þ0[»ý@Ù¾ïrJîÃÕÛðOcØ}=¼.£CÁüúAff¥&Ûû>i2~
K16¾Öu«#cÑt9½
h ØÛ ×BýÇ;nÇC¯
°äö7"Ûgqòç¾y¥ôãYÈ > N5o$cRNÝß³c<ãÓU:¶>GÐE ®)},;%X7Ш±
4$i«M3ó`&ß]:Öûâ£z.
3ÀÝÏIÁä¡Ø̪õY¶ôBô×½ë÷]B)eg: }r~R¸\¯\"Öô\Æ{AîÙf%Ñ· ¤ÞX\µ Õ?jFÙÃTÔ
Þ|±ñkSµ¯Ï;¦É×x-u½äÑt&í)"+3JÔ¨ Ãj þ7jO#ß<.¿7
Û©Òu²¼ó|õÓiéàzcÍì>(Æ3\>°èys)а"8ü+sW ¦. ÙGÔ
½*°÷
aÏ
m×»´·ÚõðR$ÄxH=ðѹ¸UqûEÅ ãÙÑ'EáÂD0:,SfdÖÃ1- å!ÂÛ[w²Ïn»aFL(G ÿÆg%øV`NÇýDñ;j$¹kÄ me¿¯ßùDþÆGÜõÝé/*÷B^È »6 øÊdÞ/
¦ÛAÁ± .ø
ÙáÝtצ aòòXO \Ál;56lf_fËivcø3Ï ëëýÎ7cííÏÎÝ8ÝérF$ 0ê)¯ Y1L£J w)Â Ï§Õ V£ò>´¹Õ¥Ã_Rü+ÀÏr¾k3·W44T¹Ò
D°ÅÀ(Å0·Õ
í°DIPÜîְôíO@ÌF&*±z?LN¹Ö®î̤yû{üµoNÉØ.½ avï+
L+´áS³ ð7;
ñ3ïC%3{ÛX8\3J¸~nÞûuíêöón.áÏ/L)ºÍź۾ ½[AGìFV°$ßÒ. SL@ wçSkßÄ GPËÌtË]ßµ\õ{.!ªV.÷Cë2Ga
7¦@¼ë«¼
=IxHùJÐ
ý_¸©ùa@õe¦r
zh·D}Wµ~ÌNËô²
üµÅ/ñ×R
®³öPËü+M §uh&UâyoS83ãÈ{¯UÃ<2L° ´VC Á;»×ßá=!"1RyUm J×¹I¶UÈÁ¬ªÅðå`´XÀPþ³IerÂjìö8JÃb¼¡ Hf <UëÞ©ÀDJø6Êñ«ÞÔ6IeÇ ¯ËëªùµØ¤KJYMØø4a1 FAi)Ï| õç¼ ¥eKÄ? °Ã1`ų MLÙf{÷,I7]Lߢ*¯H.Ù¢®T ÞvÇc¾Õ_#lxÆö(KÃXª».bü\`¦ ID]2Á¡ÚѪpg«íäNÓa(À8HRÖã¾5ººã9ýªã6¹ßצ
n¾Õaò泬u48¬×ÆÿH(t7A-¬
§
¸ÛÇÕ¨Åå¥8kU¬
îl ](6ô$®P¾Ë¡+º´\Cp¬lA4mswú5äK3îÍ¿*½¶p~¼ÿ!8 ÆßÝûéõoEÝ"v% 9·o`®oѬ$>Ç-¬%£©Ý3/_Õæ1Çæ¤{8[!ìÜ à0Hbö¦]ñ-z*mòcù^l`26? KÅ°öl{ës\54Îip$vZDs}v´Èîêq# ûSàMö段ã Qäý}|ãȬ¬´°Bü(kÃ?iv¼,a¥â1USl 7vÊ58_¢úÖÛ{è1ÊcÙ³îR W 7¢ÆÜèU¾A ÇÊÃ&å<qeOÈI ¦Ì.B¹r ÜØ;ü̳ÏzèÉÁÌ^ã³];È dSͶÈq~oPðDÙ ÄþlKè>a½5Ò³kTù~aE¯±4äÈm~81õ{©¯à·°Ä@$ußGªBH®}G¨ÜËË`lo ͽ3~ÞXÖõâSàÐXLñ
ür»A{Â_iaråòsýEÆ)Ä·É7 5lá8vs¶ez
É e¶Ã3ÃF3Q¯Bü!
UÚ Ïe·´u.# Ä5ï)FÃ-©!öÖ4\'I"2AÙ©ÕJFtIÊaD÷!èæ !è³%£e¹¶TÓttb׸¦ZÊЬТów·® )plôd°;§83+¶ÊRH8ë*qµññÃǬ>8øYFbNxÞ^÷9.áÉñ>ü8'+-Õ÷ìPuvm$ô^u2Ê-,¸.{20¨ÓäÔýµ/0;Re
Új ^!¸f$NHfÕ9e6LkÉÉX£Ç¶sÅßålx¾¦ãýº½þÿ;.ÎYú·ëíÞMÆUëÓÈloÏxöÄÊ×q ¦ \dzPêl"$Û¿Ï'|ñX°÷[ì º~cÏ6°'>{¹DÚÍ×éX/èx!;¿4À ¬@Ùɳ=Y ô¼ÊÁ« Z
Æð¶ÊvÆd2Ê Õ&Ë5I",Í1½_ÒÞK[
`Þò5 |]ùew £p:÷©
jcË[mvѲ/Á¦ ÒíZ¥ÂÚwYö¬ìªäeèC«ñ¸§DP¥l3Å+ÌÝÝ4µ÷öØé?K8»Èo(zº¡LfÁeå¦,óJ . uàvñ Ô 0»8sÁBRëºõy¯HôÒ"ö¬²·Uú"ÞŤOKÍã`èg¬ô>V¦<¤Ak0nÚZó ݪ[à]²æ§¼ÅéÊEXUñ2 Ú§ Ø ¤Î»sU1¨Ó¨HÈj± +b=êx¦ryÂÌKæâåTEìø2èsÔ9¼p²>³Eö÷düd0ÉÓ¡h#béÌ'eHÄÀE`Aá¾ÿ hÇym¹ éÃ6Ö1ëòÏÛî]2GÅ 8÷6ý ÏE Ë·?ì£üGº¥É°&}ñ¹èÚÀdØez ÞÚªVíó·â:n%X@°í=Å(k5ÓÉ Ë;Îzvn]ÃüÎô óö&6·1
N,|®MNÙqL Û©Ô")¬3kpqÌ_|«½f!8Ì̾HÕò!½ÓD7¡>ÖB Ó4ëî¤N»,ñ-Ûª®oôrù¶zª,Ô Ìu %¤µ5s"Cü{|iãðuk0!Lݵön}*zx èß²(!º¿I,~Õ+-ë\hääke\Á°Eíå¿üo¯5Û+mtçÝ®zò²¬.@îG]Ð%+ë5;õf¼wvdî¬ÍÑ`²_½Á hAr©Ê¸5á\éñYâqÏR å¼þ¾nLlNR³2Á)à <¸¾p Ç Ýí¤©<
cúlÝǽ¿(VÍ>uyw äQ½Ú6×6{^§F;Ïн_V©ÅЪÊVï`¶örLÐüëW~õQ»¸OÁ+uR wA«áÒãyÄ ,úg7V"êcÙ Yù,õºáÕ¼ :^»QX×ìÉå¸^¿VçÔDÚª ç¦
<F*wc§W=ýL5Ê{»0ÕñCR
óNìBÖк̢nÝ0®.Mb]c!£=q6×WÞì¢ëPHîí3t:ràÒ»kl ÌuV§$°Ô,p5Î4]_¹X Eú~ÙÄk;<bÄïLÙC|K>îm|nae5ÚoõcOB.39ayy7¼4^MÄ0*¥.+MWC¥ßÂäÏ 0pÙsL
&y}UÎÌ.ÁÛ½ÏM;} ² nl
Ihlª¸Þ1.¾Æn¨`Tée'áÄÃ?ÑÂæu<RóQ8ÆÁöøÝLjûZÓæ¯Mw©£{´¹ÕFà äIºmi1zcHEÿù¸ç½Xjã,^*]5Ä$yLÄɹ¥@¶<ÓØÝJS ×X0ײgç#ùM{vÍÛ.Ï b"¦Ö(%
Ù¯$<>EÀw·"r#n|U_'Nf]Yt¬×¢Ì3~
ÁX©uW»
K@vÍê \,ÒL×1kZÔ_½õæÊí~²á,[DKà&fwno.aaÛÀz}hb\ÕëÏd è63t!»îZñféÆ{uºµÆ1,áù1^Ë«/Ív6©Ñ W ÌY¢Ï(m*èã&Í
ÐVn5|óu
ÌQ¬ªv$qã5Ã*Î"A (I,n²
º!ÄHv[ ¹V4T
|^4Àåúj
Ä0>±,>×ÚW·49r [³K`©=Ø`ÂKJϱ@G¦iã5ýå[,ä,§>ÞéÊÓhRúI>N¥9!îìâïc ØÿïlöRÙl½lEÁÅ
÷4á@å0pÌEµÔfiI w-zì³¼=µ ¦á¸AsMRuU]ìAûëyDųb×dN"J77 Ål°kÊ8V¢ñÊ5ÜJÆp-(Q¼0À FwÒÈ7!i}ÇgÞ4TÅá¯;6lõfÂ¥eZH1Bß®v·³ÜmUÒ*!ï<4]Ùù¦ HÅ8&÷F¶'8°¶A°¶Ol]òÌÐÉ¢d<æb}h®û¨¹mD5ûS!ÈÙÍ× t ¬0ÏH $¯'ô7#¬6JrǺæîÙcÙ¸ÈH#å-ïÙâ 7«ÚèB$¸I ?ÄøW@×BæçÚå<äØÛaâÓgÐ9ÂpD@A³ÞÝÿ=áuò;Úê7°åt©9±µ
ÞñAèÑaY 9Àï½ ',²P&/g|!«HÙ÷Qz{h(¸± b¶è\dÀSÉd}0¬·-~oOIA`cì "
>âÑÞo"tÝè1³nåÎM¬\¶ \m³=ØA<Gí÷Ä=8L ¤ZB Gî0%±ºÊD æ#7yìâx¾aØ Ûþ¥^(³(§v_
d[D+Q±g#x2#¼\ì:Á¬oÃÈÉÛ?cÿ=O*j¯ãÛ·;ÍÉÃ#
uë|álù¢þ Ä+4 ^ïBÜÄÕÂT|7q{^ìÏ!¶ìý±ÅÈ ü³t>V·Èz'æÿOü.mïXù¼ÿbÍuyx¢® 8Sð¸k}IùfÛîÊ '`ó@NìÙá ³|ùé%<{39½hÇQ:»}É·qºzó£,Mæ4)L ;èÙs®^Ú*Nɦ©§æv`ÍÙ ëÒ\Å g¼Ï?X[°mö(ãù
QDQ_ÌMÇ ^»·ç;¾ÉqäÕwÄ Dè¦fÀ®VÛ ³£s®>¦+;*·ÂÜ+.±%²Ødãd²b@Øe\Åh¶Ì¹ãá¾Û êè0ÚÐpÚ»Ýml»zs\%¦ Ì¢E*% ¥ª {¯¸¬èã0èý'àý £wÛ²øþlOÈõúÐþ|¨ø ·2ÙFASP_~x)6
Uõzo"5´æˤ*Þhr¨0M¢`~Å)°Sz0ÇEk¦)Lê,Ø«ëë^£JÆùúø¯}W ÷ùqõrú)ðß:ó=¢«ßV=óð#¼{ï¾ÙÒíáÁ×#èëBË zö¯Q½ò½Rn#]Çô¯ô¿?ù-ì~+Û¾{%$Ê?G£øãÚ²|S´ÍVQF!É0²Ñ¹vIIgä¿ßL5Íï43è°AR',ÂêÙm°fËzÎß{»ÃTÿ¦±F·Ó§~yÓJ7¥VÈë"Åæ"í ¿×çW®î;ø×}ĺmóÏPæCÇsw³c\¾Á¸uÌ Jí¹©°ïU©p.T5à ôã«Þ`^ĸÜo0I¬] #ËDAñuË"9ºq|<[ 3\ 3ÀpFXÞ¯J3!ÚÉ®I ª0â¿ ï/CB±ÍdÐhà5Fõ©¶Fæ¸K¶ZîpËï-ÕèùÇÌ]Y¡Qpdz¤óÁ*¥Õ·qwE§°éhEw±1> dbë¸acH¦ ²¦73@ ¬;N ÝÓW9é~ s~ ÷«wÉdªlêq â_¿Ô
L)T
P©
(°ê·×SªÐI
ý/Ý<ü µ*pâ=]xÔ ´Ê$à° õ×ÓÇðÑ n8£ ½nX ÃCIl«wøP5v»®éØ2hݹ·S~CPyG'ÅùÎ=v¾W`ôßgy[iXòïQúbônß«yÌÁ×ë¾à}"^aîÜ~¤»T¿ªapÊsU§
ÙT/xýÄ¿f jn§²Ê6;]|x¹ùfä;ÁáÓf#ðoz4IXý§¨TaGÎ~Ó¶ ,w\ÙÎb\'ß´¨8)nB jk/ÔÙͤ9dK]Ñ{/Ôf)¨¦LZìïé/éÞ§7ª~RÇÎ{\FòEðôí7
©Ö 1Iô T[0êò
ÜCðÆÓ óA;ù÷ÎÎøÅW/û¿Kñ ú]û¸t8kóÅWíÔ$:âÚ±¢2YeÖ®×9Çsmë¯Tñ·©É2´Ø·Ä¬ª3Íùgóס¥á¡´OhÞ%¬ýò±[ëΰ\ÑnVâ,×»ëÑÅÒÖ^Yùà_gå»,màU<qp éêñ!Víy¿
Q§Ää´BÈlÝ$_ÇY!²µZ. 9ñ¶1|áCI[M 3.µªµÈ¼:É` "ͼ!ÆÄp÷äNêù¿M<UÕñæöW.W.Lcgìp4 ~ãâUÿsïôÜxä.îuÛ´Söïï ã úE]¢/-xÛ°[ǽòȸÑW÷6ï¢Ì8¦cÜßSO9ëq®_2ﻡ#à{Ï#ºwïÓÃÅÚî®'³Î ;Ý}=Wç8áÒé£Gâ7å°ô¢ü)#è=$¯K÷î¸*×PÀ)Ì\<[æà¿Ð$L8¤ þ«»s(1ßL(üißÜvËY>Yqä5ÝRZÞZ>~Þ{öï½g'E!¯fhÞïXªñÄê÷î wtÇúç0Aq ¥õjóqÔv¡ói|aôεËÀûcpü:3{¶´îü6N¯¾ñÞ!=××ÄìsW ^s)®x®½ÔüzcÆ\ÈÇÒúêW.i?W^[·Q ¦S×
ãƤ «àÚçÎ/p\ÈíÖüsqÑqÍß%í¥SÓεÚ)mÆ4s«ËçxõÇ9ÏgƳԱ;nÉÝiÝø¼i=°ÑÄ^¥¥ÝgM~gÜ×m±á?)1¬Ï
»Ë"wVääweÞOÝóBc3Áxé³`Qcké:M{ÇèlÊd«d@áðqxªO}ã3¬¬TÍÞ66ê½² (#{F%®Q9îì:êXm³¼>ÏWlä×êMïßæ®ñOXÝw¿yx\
»t¾MÂÅä2uÛ³a"fí¹C gÓ=Åe<÷Î'1m_¾Æóç;ðÜeÇwÕeFÄ&õËë2û QõÔN§¼ÀÜ+ÓÅï^ »,å«w5ÅÈNøaÛwRço&ϼ¬ø¿2%vÚ¦÷s8¢§ÓIý{g_OytrEð÷Ëæüñx~ÄB»ë·ÆïÕ,®çD8YÑ¡ãæj£>sWói± }¾ññúZ-òq¶í.A??îÁ1&¯~Þ÷Ô4DFí²·úf!ÎxPÄ;¹drYëv¦XÄsêS:ö²v¼îÚy]f¶È Ó±¯¿¾vÝ Ý©²GÀkù|ý DVGÞ½½zXîûæ[ø |ߪ¨]üÝo0¸,g»rÌsèÐ<Kðkh
Ô2Ô¥NÄÔºaâ3k»
¸í ÝQZ³VÙqldöïþa ú Zóù¸æ½n6Ú2îaÄe¾Þc±}ýhï§7
Ô9¥Îf
H=ib² Szz É(
°²ÚÐL¤
P:nÙì|Ò7<ëÔ{Æ[Ô.åý}½GÒàOÿÌ`Å ~Úð¼¶<¿# ì7[áípêííÛ)zä|¹göký¢*~k©» M6½ q°5H2»?âôhÎþùñ|Íú³|þSÛoÎö
Ö£ú?(D/IR¶s gE&8¨À¶ÖâTûx¥AA MY.^°i@òDW±&¤AÚ@æb GëÎ88¢ å½
*'ý´ÑðDG8½<rÐf&¹ ÁÈüíÙTà{»ïbæ4J¯DÈÒ¾ ·"n÷T»c
Åâä¹R/Õ·ØÁxÜ_fL/OºtBö߱म-
õ=ëUh0âzRÀáÀ(0oªT.í±êf0uáÜÛÖ-k/à; Ü?Ý3^Ö7õ³üpkx8eû 8v 1´pÇöÜë@8ÜZÃç9¬å2¹á®Ñwý¿£°y| ÝsöNh8° [p9¦¿Ý1v°pÞ:W fÑ\ o!¤ÛMç¨þ,\qu
i#» é9_XþÓ·Ò1|ëNâ_ÿ@ÿ½ÛXAöñï>'GaCvçVNL^ïQê Ãîa<'°àúm
¼û«H"lùÈm¦e¯4LzÓZ¤mhnSØÁAÓǵÆ6-Ñ lV(ÚQll}"LÒ¬¡×g;{øóçÞþ¾þ^ãÎ>ѳ·O¬¥»ìpvXÛBîܹ¢X¼î¼ä¿ó×nz®#uY $j4`ÆÐÆ ÂÉ&Öaqjì¾ÈùòcÇi{û]üuÂøÊÂú`kéxøÄ qê~3ü¶HRmD¶í:1 ]Ù½gÓ_«gaÚkE óMK%éØS°"dZdäËöv!˶Â?ÆìÎã4ÕÞÌÁX[ú@~HÎúqüë·5N¿ÎqÌÄìöð"7¨µÞÞ;òÂvæð´ÄÁê¿é,¶ó,n§j|n¾"Ü À·È³ é¬$g{ Çbô0Vî³k=¯Ð@
À· åp,?:qj6±"þÔ³öw¿µo{G³Úw=îf<ôVæ(ÃÜ<IOV̬ <såe¾þ±{×^ëâ!±+Ë.gVl?Wo
×\ñÿ7û\°9ìéò<¯±$u°E-íòçP°NþãË_>8â ïëÄ6RúÃ%tóqÕ"ÐÕÒ S±uÂLjѼî»F!ußu
¾µÏ& øÛ_6 qµ¬ä<ÑɵŨ£íz]M¼6c-zÚmÆý;YçÆJE ¢Á`¬ÐF£B¼²ðç׬]à1cK¦¶#ʹ>vä4ÐØiu·2u¶bõäëW òsÕ¤`²) %5æç½»6é±ÛúIV±½ 2>Muáaɵ hÕ0
,±ÎȺßNíT§6áÈ0Ó@sáû¶<tI(=þ£°#NbÝL²:ÈÂVÜËmÝRj²YÓÜÌB¬,R¡al[
DBý¡¾ºÞÖ³-¼fä`üZöDÈ& Á|6Àg ÖÄQ«»+IòÅ£l¤(ª-$¿d¯ È,
s/+
¯1êác«L§If(iï¸ý^Rnµ ÿ3>NþÉö|£îøÔ Jª ;ZS¾IË$5# ªò×<i©8Q&ÒØÉ\Lu$U*¤di ( Ù±ú=Í=[×sþÎðôâ æÛÎ_.
iÀ)Sz¹ L©D C@N¿[ÜÛ¬vV¸ë®^pÇ:lc·wn]\ÚíÍÅ;¹ws!÷~Ú¤úvßxÖÛmbÌM±¯ÆÊùH×Ó¯Åäû9hMæÊÁb(RÚTXÛÛK-cddÚ
ȮϪËè¼]:rãÇÀüûÃðØ´/ç üö¢÷ þ¥Ç긻ÉÒO¯ÖÚG³&í<úðZTÁ86Nݦɨ8ýãc
ñvdfÌd¶5SV¦÷aÛá à>)Ô;:ì?xúñvè3s}4è¦HtmûR$1·/Ô»KãlöÍÅþ7ýÜ
9ÖrÍKs5Á²®Ä®è*¦6Zbi¡5ë×õ4dîc~XñâumÊÇ´gÁì¯ßuÐÇ*#ç4;ÐÊî÷ ôHýÉÿ×E©¬Êj,{¿#"ð[ü²_ÚP£Li
dOc+Q ¯£ä?ªòµ^櫯8¿wÌØH¢DëBüà |«T8§hÛá _Öô<
Åy]^í#Ú¿ ³<ïÅÉJEä ù?СåÉÌ<á `ó}YO¼Ó<UþÙæ'Y4i{Ôß«ÿUÚábÛóÊ]!@
Af Q[ÜâxÃ×Ã_3þçÊö³Íò.øÿé°á8¢©ëlªUVÁçÏcXê®{Ë@S¨;ª êåJVPh¯ÁÞ~&÷cÙz×zçyü/Ýï}²ýñ{7)Âm*®y@|¬ÃýÛaþí7;ì·¶Ù½°ÃJÆ'-ND5j/H$èUE<·è½Îé¾zl¾ A÷ëÞþi×t¾»û<§Êò<ß QÇ< ò0$n+$R«)kX1d¤Ó6ü ÒÖÛhL lbiV¨µdÖ¢·
¨P>úM®»oGò³KËéõVRq )ñï=ÔÒÀu?ÞoøòeKÀ[2üÛõÕB"_\º%ªÓæ!oU ڧħ¯#9Üòé¦
5QñshïE] æãîf¶°mÃÌ!!#£ìe ýb¶áEøPùeûl+±
à(!Â"ȪÝb7_ßõ·]øfkz í3{=ß=¹Lc
`f½¡.æãSä&ócå¿ã^ÏFî/ýþ¹>?Uþo·l(HH9?i4×6¶³íyNwßÈçúo£Eøýùþ g[{Íßüª¯¿¹ÑÑÕÝMBx.ú1ï'ú~<ÜoÝåkèKrm&·û¼@Ë ÇkãËå9!ùVÒ9¯·}¼BÑ-÷½m&ç¢ø?<Gw¿ì_>qèu^úÃÜ £E"
ß±Q^Õ: 7æµDAñÞǹb ¸ü³M¶ø±ñ
là¾o][ù^}Ö°^G[5+Ý
03;«ÏvÔx_ÎÛÊÏx]xÿ§>ÿí*< »ß¬¿ª+ýéµ ïæ¹/Oä² ¿®ý®3MÒë1ì¡1fïJ¨NÊJø
ÿ·ÓÖ3¨íp ¯Å±±Ñû íu4p NwS{Ùt,µä=9ïÛãÃEîp« ÉxÃyÝnξÙÜ
õþþoØë}Ïۨз«ÜCXµ¾4ilÙéV@vØÍJÃÎë&6f³íüpì@Éþ¯¥fÑûsrefUö oÔ9&jqÛ¹íþÚí#ÔÛó~9ñäÅ×4çªÚÃcé¼aÑ!ÃõÕ§¨A$HÇnÞ2óÇÁbo¯$\á :#V«kön®=ûX<ÝgùÕAçjóÒý®{göEò:Þnnr)çÞó}©Üxc^õãüÍËßw¸Â[õTë6½àü| Te(Cç0+|%E>F%¾1;0e(þOðc=ÏÕ©â ¼ê§
#¢èìóY qoÍ(("²úÜáÜøgu~´í:ioÐ}¬Sú}¬`©Í/
Nh Òª^!ì*£Îÿ;÷íóì»scä[àe¼½z @Ìä%%BT¦óÉå`÷áþv/gèÿâxÛ»{) )ÃVw /À~Æ|UÂ2>§oyªîWzNÚ\QÀ
Ê É>'9#ccY&TƼzn!D0 Ud£ZU* "L©ÐزIþ¬K ½÷ÛøÿÂðÜ|n!¼ò£]¿}ôwÓJõõfùçw÷Ç×K ÞÕ͵~Æ(j&|%Qt¨ ¤Úæº#\ôd :ÂTPMk#¬²¡&¿ìø¶¯ç·ÖzíýÑ×Á[£<Ï»ÝCðzÕ» ÌoÎôå^I«Í4±;F²NLòà §U´fº:»I5n óë÷¬M§ù¾/=Kvõ^s
ø=øô
G7ü)æ¶næo>ÞÙöþB¾Mì»gK ¨RûÛ¨3,&Ê>BÐ ÷Þ¡¶62 Ç
~¨)õ¢~éÀìâýªa "õ±´ £j=TPÔö ã´+í½m¹
Os}Cü³ÿúÏS×>ßÌ°
û¼Á³Îev9b-q×æà׸y*¸ üP}Øm«+SJPW¢p ë8
Z¨¨< ôé6
)0:zj¥ókÏm] m [ìêØåÜø6yØ]$^ ©ø>
ÎвØSñýiþL|Ýè?ñ÷{+¦~s>2}
©õ¬ø© tuZ~»íοÿ½aýç ûãק§¸føGÙ¶P y¢ w4AhßÈæZÃýÕT"ÈÔxëÒ6g½Q׸#µ°0Å¢¿¦cu¯°dKOWU.*{ê,,k2 b.!Ä]xýM[sß|p õï^aG îu_ý ÈÝ7.m©Î@@ÐÚ#á?5GÚJ*ÿn§þ õIþùÄðXì
¸~ /É©á«é6¿¯sl×Î(PI@M±O !+Ã@@#ÔTÎÍÿ*ý0%II¡ fRA3 FE!IM)a¢0ÚR0FPL$¨b) 1©&ËÁ$%IM! @D`(¤Â0ĦHÍ£4¤ ±AY @ È
0Æ)IÂÈ
)&2IMÑ% )Ê"ÂI#)@B1$!¨#¡¡JY a¡¥)±LÄ!²c`Æ4HÄlHE1#% Rl2bRi¡ÂÐÓi2Ld
((èJ1¥,!ÂII4Í0fÏé5·sdÌÆAA
a
$bÂ)ÂÁ¢b0ÑeY$ Xi $Y¡ÆL&2f(P¢ DÄ8?«=-[íåI«³ñ+G`,ZÁ´ÉD_ÆiG7_øã³Çðô[Cëâ{ÙÝï
°ªÙÕ«Ä+Nå]rw ÁÞµÝû=àç&g± Çr½þ>-GHt ì |í×
uBA
A*J£Víq9¹ ¥ÆîáÛ·;i ÛæäLº\Ò;®Ê溩rçH®sÑs,¦w;nÀvv[
!¦ÆH)a
(LÌdJe£bÄ
.ÛuÜ»·UÄn¹Ívêî.â¹Üê"L(H¨£$ 7dÑ)fm.»uØD]»G7Nrç ¤¤ »pÄݸ»]n¦GdN®¢Â¦Âwr#éÄ&ÊHh )0ÐÄË.®í]ÜE;»0JG]NåuÉ+¦äPÉ6;·dqÛ¬pìØHn®Û a-
2R#ªæ¥ÄAÎí]Ã! î¸î» ¦Lº»¶ÖK:tstL.¤nìiMÕwiÛh»¡vî»UÚêKvÎ ×bruÌÉQcáb®#2]Ý2J3 RDÂ) U;àÑ £?çãÌö]ÖàûzßØÝvåä,àÁééyÞÙf?ø ¾Ï¦^òdPF
DIEEi±áÀT9N¯oÌâ·7¹-7OÿË×} óÞåiËÊj§xiBQªÕtø
ÿ®àü«µ¦xDZÝ%DÙÚµÁ&Ô
}måÝD÷°-âèMÆJ!¬Ê*ÚîÃÿ'ð¯½ø¥É{zqI! s\]ãÎôDÁû °ÙË8Ýú¯nÚÔê eËúF6T¯ëÑÓ0Z»Í¨³ ãAøê]ãTEU¿²Poòw¦üߧQá¸ïKØj>ù-2º~ãFÙvá~Æ8ù7߬;ùéÀÏ¥¢þ^kÓ àí"*u÷³ËòX7kGúè.ÝEò µÙ7:±ÉÖXKæÛ¼dIÄUB0*,=]së¯ýëÚîÛ ËÝ{ªÔ\ûÚ¿¾X¿Ms6Ò«*9£íà ÛoßO×µøp;õv±äiå,£QVÖvÐb.Ù!ÒøY?¯?î&¾'CúPì ÓÛ3/׿[áäà9cª~9y¢ñ
ì rÍùGZ00¾.äUþöéWÚÍû:þ¹|NZçÛíÛ4LÀTP®ö£ÂÌǤNIvóËÅaÆ^¹ï ê9Ê<,OÑCiByØcn{ØRÝEYÜ+õ\°÷O§Áy^O ³-ä ÀcÕ ü mbË+ðBA(HA°´ ¿+¼uµ×åÁ!^sÉí<_)Qê6AüEÍY2@gÂÎûÖ½£þyãÙcmî& ¤Ö AUTÐ/ªOãî=î^±lÈ/% Ú#öòê]ÓWªß{ïsÃ~YµR.é¬ß{TqÖËï¨Òë{#¶î²_f£ êOû¹)ô§ w(½húwÔà ïý{Fazû|¿V¾.E ì5U¡µý9TñÞ¿çþ¤E¼Om·ð¤úg£üMÀG(!uÃXF±½³öóvÞ÷¹õ<ܾ:>áöw=ðE3õ@"PÞIV¬Õ+q\÷é¾+þq|]ön¿
ÒwøNOgòQ¡Ø»EèUtÜWK±î¿.¾×Ù>ªGmÓiÙ>Êmö ÇYâ¯ü0ñu#õg·[Ë¿AÔtz¬ÔéscÕëêDöá°ÚûCF?À½y÷0X'¡µúYÿÃܺftS5A* ïü¾àÔÜxº·h
×{Ý©ßx=ÛXÞ
ÑOßMÊÃ% nÄiiõ}·kùÝp<̨ÄÙvd÷r¸zty tÍ~xÈd!BN/ĺn7}ßoh|ËÿY4=Kÿ3èܼ#êYùôÃ!ÍÁÌZ{=¯èöVy© dRM÷ 1¬Ïù»s9Þâìü/£s¿þ¹x¯«;uÏÙáAß{Ád=þ*RÑ>dV y
¦A@$¤¨4hØ6+à·4m´[ø¶åª6oÈ9²Q÷}ÆÑFÉIª-÷«mËdÚ4äVå¢ÑcQ¶Æ-ǹ }ÂÚåûNíAXÕî]±¡5£_³*åQQZ4Z5ZHÚÆ(±¶ÆÔm¢ ¶5X
F6°h´¬EE¢#IE¨ÅDTE©6ÁE¤Ñb&PF´j1«ûíhƨ«&Å¢Ö,ck_Ϲ±¨µÑdcBdصï»QXÔZ1Ôo²¹¢¢ÁµFÑ¿îmø¯å{j¾·Óíµ¾
±dªLllTmhÕ+c[llmQ»Îµ¼X¶%[}³]±ÿäiEæ¾ ×©Û¦Àdá?ì
j±ßçVøîï â9 4ïÀ&ÑÌGQݻ޼ÆVàù^F[JÚ2¨"í
D¦w3ex]×äÞ8nVåòç´á¨lè.MÓ÷më ñ¶ ?Ú¬Næ3±Æb; Æ Gtm[Ïïùø¿ÛÛ í·ËgÛ-P#SdY¥%Êb@$QM2D R¡)4`´2@BRb4Õ YµçzßWd %ú¯èçã [Ft, ¦ë¼3UkÔÿæý¿gÎh¾¤J%ÃA)y>^y¶¯oñtY_J87NGx_©dÏôTV,±®R-8NäØÍEùCÄ2ëÎlìvzÇÿÍàÙEGýÍ©H°þò~¾¸±b*Wô* BÃha ¡ÏôªÉ*ß ÒÒ Ë#Û?pvÈÂÜnEQã ë Þ-/wÝÚÓÔrJ YS¾"#,©JÒ½
Èö88{+Ð FÞØF¤û*¹míåâÿ%¤!áwç#zQ§}lHíX8 @q îùÞ8îEB»fá%ÆÉ ÿмñýªÉ:âSÚô.}Ê8=úí¹aKÿÜ©(ñ FRR¨è×ȶÌû¯°µý[\vÈÚrcÆf+òpsf±üôMg}²í2
$0©Aê*¼xæ/Ô~×Pm×(ì¯ôýÏâÍ𷻣
ø3 °Çdÿ>¯ ?KÚ£æóù»ÌEQõÕI'3¤êû;gm2.2âG¥
Owq\4(#tæ±Ýc¸ÜRiïç£ç3Ccè*<¦ 1¤VüL|~þº~
?aÕÿÂaV àWêÞ~ë&Ý@ã×û `§ÄJ'Ó£:úCÌô´|iy+*,ª¬ " ¸ÏsCäé) ÙÅ|T?Æäÿ&H?Iú[
Û ©KÑø_¯tî µôo:ZÉÞy¶4±¨ñÞ
D
RU@ùnÔþrdÃ&Bæ>¾øÚõO\òyO+ª`ßòLd|¥Ôän|[âÜ{ |¸äê³¾G¼àdD|7* CNJä·éÁ·¥ ƪ(±!âYÊ©RcÇÝþVußô 0~Ýï9µ¤ö¿1½¿K¤·»_¨ðù>ëãö_ .1RëkG´·r¿'ÂòݳßúÊonûVÕxMÎñøó(l°Ë$í\ozAû^y}veózãñ¢þ'üÜLS@-vé@ N¿
öáwÂ)ºÄè }£ s8¼§yù8[¿oØk5[mÓwXgÍ/lY. ¸+ØòöÞ? ÄÏÚn÷¨×È»|¦@&}bÏãx¾/sÃj¼}·ïÉoXîW ôâÃ0d6Ïúð¥½ÑÛ¯ûÛ{?³Ú»ª4Û/]OÖÎ_ òý&]¹N{D$õ¶õÊ ½¢ê½àQÁ<98Q ̺e,÷_Ãöl^¶¢ÿþ°U9]©sS é$rUn »-_a÷¬¿îWiÔhüHý¿n³9 ;É㢨´Ý¸e¡Â¬5PnC³Óí¤Vÿ É@`´C:¸ù)1Î &è¼Þÿ¦}¾ÞU©Ål?L½ÛåDØ{Ì©³¢Ûb/{ßçÀwYÖ³à×U|S¢K §Nä¨R0¡ºvÌnl¨{C÷r[Lãõvm|¹¬ |Þr À;3ñá¼ 0r2
±mNn³úé¢Y˹,¨Ùè4Bo¹çßÏxúµä_óñÁ[Þ_æ5ÔC¹ÏR4ÈËðÀÐ9£Ú`Á$I-Ãn =_A¼Iæý_WÐû>¬p¤¼¸ÿz社.Ü}SDð *Çjß· ¹ ûÇT¡N»þ~Gpø8E2ÍA¦öÉ{ðZòM#/]¤½Ê@@éÄ+SÙCLH2á/+Òñæ\ï¿«õÙ= àÒTL`l¨Ï h<ÔhNÁ(éØ`'¥I$# ×EQD[àz GÀÝqþú~ðèóرQvw1Ú~0 ȪBÉRWVÔ[`¶*A 2bÕÃG ÛßõnäÓL=¼ê¿ÿ1AY&SYMñ& ÝÿÿÿÿïÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿþwþßßÿÿÞÿÿà¿^öcÀ\ÍA§ 5 Ó¹IÛztOÀë4{µïu½åìñÚîè A
BhbF@44SO)èÑOȧ©µ<SÐ4I4ôyO$ÓôOTѵ==M§¨ò=Qå©äØ©§e2zÔÇCÚò2iGê!§©úSÔò(~©ú Ð@ ¦§DÑäêiByf§¦¦IåmF@h Ó&F!
Ð h4
O@¨Ä&©Ú¦ò
mOPÐh4=G© dÔ ¦M 4 4 õ Ðd
%=)HSÔÓ& C@õ õ
4 A¡ê
@h Ð
@ Ð @ $H #Ê#Ôf¤Úe
=F ÓCG¤Ó@a ¦¡£@ 4Ð ryÅÅ·_cRVJeboÊB\6/VxÕCû î÷¨Ù ¿04¦Eή¤ý¸+²¬Aç¡èlÄ{ßìÈ¢1¿ ÈWJd0Xö>¯tÓ#KXC«* ϳ
Zå¸HÒ¨Ò#*F#ÚÅEFù-%
4Y Yi°HÒª¢å²ÌDWøH¶IDc(ÓóJ¶>\TZRÒ¤îBÌU&"ÖrR(ÕÐ_ËÓN(£y")
×akV.À1n9;³)¸1Ó^-r¥Õ®ì\-?/ìGTÀª5á²! ´N²oT îv W 4-Þêÿ³9~ª£#Jþ°LZÀÛW Â-d·Ô÷ðH $ÊJ( Ò-#B*´Ð"´
¢Ò Ð"*ª(ffFa@¿8²1RÉC¿ïîl¡ à&ñ>âX
¨ä}eðÿ¹G.P@fåì·Êlri¬1ïëTþøiÛ^mÇF~n×ý ´ã¥ªÜ'ñëÞ$|< ¬× 7q4'ÄDZõd¬e:v zÃS8xÅa7ø¥£®|ª§»º9ãCÖ=[áóçê:zS¦&d´u·%]i£ fXËLßÕоº2qË¢NC¥Ö«F Ùí¹ûË7êQT4j¶hÅ b]@èë×ÊnëÞØ»á
)½Òk^Ò¦CÜ·§'S¤äî:[#Líòmæz
fßlrëí ÅÚÔÕi4>·©¡¹æ"*õTòVÛUíUcgw£Z·OìMcÝ6ÍEFõëÍPýKD6*xh©5¶4Æ'âgêu «gL{}Ñ÷WdÜÔÊZá:ØÖ\>Û×U~ôÍ%
óPËä)d;G,u¢@®ÙK_ctë·ìr¬ê?ìå) »ÎÛËѬÇtã(K
Þ`°vBèIBq-Få ÕŦãnW$)§Pt^FAÒ$ØûG i²Ýº LlÈa£§*Mç¿ bX&#nàt<^ ï*ÒýéÑ03(Äj 3ìv '
ªGlÁ:¤¤ZgLKÏûÔÖ`0=oîűjReCCÊá6/k:Å~r5["K"çÌD«Èv5YÐs:n"NêÞ÷w¹î @?©~9oåÏÑ Æ¶ v"A &è§9» I£û2õ"3Z1'HAÚ"
`xVI0c;Ü[ܸÚq¤
áüW£êj·»oEc|Â¥ºÒ 1'zCåè2Q¨'vzÓ}úüîðlÇLÁï%Zâ}Y .í¿áÆK, eAªcà(ÿ¤ zÖ½õe㨠?0½ú7
¹ËW;d:1÷73î}Ý{_ùh(Póuæá´ñÁógçÓwOÄþs|ß=Q=YÕJ¡Ëü¦ØfO Á¥ô¢M5)«ëÙ
Èn|xhF7Æ`õ²è dÎ)ý×6bãÓ§É7«õñ:õe?åd$áÛ]op¿ßõ»¥ãy oá=Mtwç1L6òÐé $Pdötu!KHý-¹ZJUÖâú F¿.g»ÜÜr÷fégÄ»¡Óɳ¹4pCÝÖ|±ìýþ¥ºBÀKÅÖÎ<6 ÞræDaG/ÖÖ{«Rõð÷ ]< vA¤4g>ÚR]þu»Äp×ô1Âl§ÍÐ3ôÅ1<mZÇÁ%Ð÷ uYŹ0wëpßÐã( ±¥½Á9µã¦^Û¼²#R^¤d â|Ma5Ô 3NÁ4'AZ°£C2ÿµI Nþ´|8¼æÞ×ÙÉ
qð¬ÛT9z(FÍ
6ÖßË ø-8+äªáör ?¶³òÚ3WÞEDëI.ÿh¨Õ¥D]&véµî³<FºFWfáG°ý ÙB~k´¼yÄMÍìVÛä°Õï=îJC"@&|ÞFëÏ]g*vt¾ñ0¼gESª"¨Ö9ÍR2óbâ¦P+y0ÄAûÐêwã7ì¬3~ÍÉÝ¢ï¡ôÆ1¢ðåK~L§Å÷¶Ç=hyº?`AD¯meo$K"p°¥öë¹6Ü<IB/õðº~Ïx8)»¿p®)óØào;4FEÀ>³å ·ÓB¼ÑT
p
ÅÓ"÷FBN n44kÔ8â¼âPOÇ0Í+¤ØZ¨ ½õ
¼ zD «Ã
¬ 9ÌM!`FÐá·ÐÁ{oN''
44q6ÞÖ¹Bi¡Í
ʸºFlêâ9Ú,²¡Ñ°z½§/ÏC}¨1äæB®$ÐÀ>@4oòü#2Uºq#ªkÙ¥/oO1xæ²ÐO;P÷nÏh(]Js}3{ÇKYÆÐk#2×Ì!U¯`°?÷úXH@½P
Y(ÒW ¥(ér(¼þøq±KÛÆÓ \1KjÀË@¦µð-¦ÝÄnW1&Áo¿%Á³Ü! !ãCSÓZüè1Ñ¡ÏRæᶠFynYZÚ¾öGÔWî*iL $ÝÖî 'Bóã0zÂÌæyEHCÃ0s¿Då* ªÍ°g-¨²ÛT? &&E¦e 4ÄH±Â(¢y£RyÒ¡²UÏéoª ¶Ës6Mß8M#.:¤Øó[¦kVn!A''³æú5ݸ46 Z`DÀ±Ã@3"ª JTÁg7]¥#¶Ëù_
ø Ú{ú¬¶qè1("Y|knWÎÁnäÑ» Y],+d§sÎE%w[1[þ(ø^0à±$`AùHAÍ4¦
©YÓê>n*(eøäÑêÐØ·ÌlQZ2IX!°Zk7¾ÙªI H*©O jÔm´0³4_*$$ó«¡ l½] ` H´óý¤âO¾0 3#¶écÞi@[®ÉVh(6
·Í«Ýݳ)[² ¼x_f6g¯!¤AÆff dr(CËòb
Ãx0BëÌf'ì%N·õÁn,Rqy²F& ÕfîÞ¯q ¤tC Ùe\ ÏeØ{F¡#§@Á`·1JôJ Ê`±9F54Úh3UÅD½âÿ££¸)cHµC+I&Á
ï
Îz¼Ñº®ÃJ´c
2Å÷H(ÓÃmÍðs)¼Zã`ÄÝ-J hé+ΪðquÉÇÑP Èj{\l%Ü ì$KL¬oÆ2
8ìs/ öÃzAË« ëbJàrSØ+ø³3iæ¤æÛ-ÆÀb^gLD;é"þbjðbWYY+B5BØB"Ù"%¡ª7£W]íÝq4/¹³p÷ô¥¹7$XÐÙ-mIda±)ÚÄR}¼/ybc4TVT#vÖiÑìKH3 GI¸ÆÕbz¬B Íg¥'rUP)%QÃñ²VIXÒMk×mfQ_TZÒ¡4¤1ÀÈV76¥$.1 &iwÝPzU¯#mLÛóXH1¼$ÃÆ
I_¾YÑIÙÐC° 38Eü½d¹d¢ªx
I«Éåg üe,¡¡&ÝmDD¤ÂÆÄæ9±¦ØÑa ä"'BeQJDì"S±XÓp30å5C`Úd×q¹}>¨³L$yõÙÏ®)|8
sY #ßwCÒµçëÇ- tIliñ± }lÐÓ`âÍîï¾¢Ô69Ó$]¿V
¤4¯ÀÄèÜ÷¯
Y.¨C
xBÏÅQìTCÎFrã2àMÙprÐ(( RÚä)'tïYtKÀí" a· ܯµ½ @¥µ!2 #X³§¦Ù ÏÁxw\¯iÍô^¢Ê¿®D §A_X+(ÆB@Ð ó
ÈÕ¸Eduñ¢Ö
ºl<* ·+-T¾/]ô;,8n Àæ1[½KµèyºÕ«FiØ
£eJ%Ît ç+È÷ÎpRmT£pNòqD±.ón Þò¢Ð9æQTa^UTÔÉ ªN¡©ÀÚ-ZùËBÔ`³gu %V D,¤à!G'³3
mù(16!é½}ùS%" "¥w»':´ßjW
"ÈñfÃ"÷E¦²íFö÷Ç2ÆEÔ ¨T,PI]AcpßÕ7qLSlÍJÄD
@}U_ªÐmêB3ÈË,¦K9ëöÒÐíy%4%bP:!<÷
`öV1ÕÚ¡¥
ò'Ùæ_])©¨ºojßB ÓtUð'år6é¼#Ôè1:ËÕYQl Bv
å p#sHÞS#´© ¾4:ø=¡Z
Z®j󽫱 §®Ad¤$s`±4ÚVHDÁ¡S4æd`*#ëof_Rà4µÄ[ÒùÛØæÓ¨¹ÃHY
Âç {¨b8i)@^¡lÃ`À°¹Qt
b0Èl@1àÖ页=c9v´±vo°É<קs¸Uäí ¢2¯E¦â;È3ò¨w:ñ¾ÎáfÃH߬õá¬ú äØÐmÙϯÐâKµx¡±¡Ú -Æ'p£¦¶¡¸Ë;M6&
±RÅWÓÖ ÀIiet Ù0óµ»üuX_ÂLò'¾¥SC~"1_,fg¬Í[¨Û¡Àú.l7±Ó
": c¨lS[ÚÏ%b ÔQ,'W¤M°|\¶Í+7Áî4[ï®ùªqGRy$ íÎD JùÖ1; {}
'!ÑsL²
ÔQH#*{ãa1»/ûÅi{ǵùdÌw{}Xc¨ÿ+`8!!µ
) > ´PHFåJM{Bs±zô{0]WÉH<°ý
PLN*-iëI#5ýý¸ÝêûíUóq1 òj¹Y*]Q¶¥¢EÍÃ7:ÌBÃ.sS zü*æCÌÆ =yéµ FÆÓ.Oq»Xq£°ð&@#ºn̲ÓN³c5kÙ 3P¥wvd¤! â¹åÆî«`à#,ÍPU$ÂÚ{NêîÎøò «(A$Òº«xâwò$6/h³lÒ+ªNCAzÌ®P F#4S¢R("PÝWÕU·1·Üúð`÷a-âs$DÈ Øõ QZª+Ó0Æ B̲»Ó"ë& θAZ[M|º£hsALõjm!ò5*íPW0&T¬(f 0Í(`ÁåFKAq(L3 0[)TàC©Nj*d& jP Þ*"k+Æ°ärp{æ¸]ÂøÕgÆQSLRe¬*ÜÖ"ª#È+n"¢ Ëð éh±ð
ô.H´ÐT}*ëÉD. ¸YFòÂ(Ø´
¦ÑJ(3}-ªbºx
>0'<p-èÚB¹£E.åJö¾P Á d@S©Dýä£ 2fcw¾ÙÒ|vÜV2îBÁìéÓI
ÂÙADf6j´UÕkÓTYZtñº9÷ÌÍVÍQÇ\÷0(ó Ñ©\[[fç³j^ó1¬4¥ÌkzT¥ni0Rõ¤Ñ(G± ®fJ#6ÁcEÊ{vpjmX+¥aÃfëé6ûSàæ
1
i²Ø LµdE£ nl¯£G%Èæ- c [äÐI¥æò3°Ô κÑ4ÁW06«Ye<ô?¶§KjY³ YBe ccTdLçSPÖ ,$D¦fF<|yøÓ&s ÿ ®Ï*ùo5«-µÌÕ»ÛµEX?RÑ ÞײmL62B@ jX=ï³jc.ЮM3;añ $[# `sq^㯣ä²5Ë>eâ"B¶KûåjU&ÁýRXæU~Pn¯Ã<Õm¡é(5¤Ð,´èLçù#/Û¬È" kT0M;qØ°Y¥c*ò¸èR¢J ! ÉD¥1¥"F+àÍ®ä½-¶EÅ» ®{2æqH>2 ® ª
¡ 2"þS¬w&n¬ù0¬÷ Ã/пe#F ®IÙ´4ý;¬+«ìyØã>¡ã©}}²Q´RAÈiuõÿp B×L¸Öæõ¬vɲ É®äíW¤
6z*KO;ËHÜK·ÜtWI»ü:äiW+ç§}éïj Q¹¦Á ±ðdym÷ÄD<X¿
³ «¬EÒk½DianM{Ém³ó|?g®<(#È·î¢Wæ
" I)E*®4a?ñw$S
æ>@ | 73,732 | 572 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzip2.mk | #-*-mode:makefile-gmake;indent-tabs-mode:t;tab-width:8;coding:utf-8-*-â
#âââvi: set et ft=make ts=8 tw=8 fenc=utf-8 :viââââââââââââââââââââââââ
PKGS += THIRD_PARTY_BZIP2
THIRD_PARTY_BZIP2_ARTIFACTS += THIRD_PARTY_BZIP2_A
THIRD_PARTY_BZIP2 = $(THIRD_PARTY_BZIP2_A_DEPS) $(THIRD_PARTY_BZIP2_A)
THIRD_PARTY_BZIP2_A = o/$(MODE)/third_party/bzip2/bzip2.a
THIRD_PARTY_BZIP2_A_FILES := $(wildcard third_party/bzip2/*)
THIRD_PARTY_BZIP2_A_HDRS = $(filter %.h,$(THIRD_PARTY_BZIP2_A_FILES))
THIRD_PARTY_BZIP2_A_INCS = $(filter %.inc,$(THIRD_PARTY_BZIP2_A_FILES))
THIRD_PARTY_BZIP2_A_SRCS = $(filter %.c,$(THIRD_PARTY_BZIP2_A_FILES))
THIRD_PARTY_BZIP2_A_OBJS = $(THIRD_PARTY_BZIP2_A_SRCS:%.c=o/$(MODE)/%.o)
THIRD_PARTY_BZIP2_BINS = $(THIRD_PARTY_BZIP2_COMS) $(THIRD_PARTY_BZIP2_COMS:%=%.dbg)
THIRD_PARTY_BZIP2_COMS = \
o/$(MODE)/third_party/bzip2/bzip2.com \
o/$(MODE)/third_party/bzip2/bzip2recover.com
THIRD_PARTY_BZIP2_A_CHECKS = \
$(THIRD_PARTY_BZIP2_A).pkg \
$(THIRD_PARTY_BZIP2_A_HDRS:%=o/$(MODE)/%.ok)
THIRD_PARTY_BZIP2_A_DIRECTDEPS = \
LIBC_CALLS \
LIBC_FMT \
LIBC_INTRIN \
LIBC_LOG \
LIBC_MEM \
LIBC_NEXGEN32E \
LIBC_RUNTIME \
LIBC_STDIO \
LIBC_STR \
LIBC_STUBS \
LIBC_SYSV
THIRD_PARTY_BZIP2_A_DEPS := \
$(call uniq,$(foreach x,$(THIRD_PARTY_BZIP2_A_DIRECTDEPS),$($(x))))
$(THIRD_PARTY_BZIP2_A): \
third_party/bzip2/ \
$(THIRD_PARTY_BZIP2_A).pkg \
$(THIRD_PARTY_BZIP2_A_OBJS)
$(THIRD_PARTY_BZIP2_A).pkg: \
$(THIRD_PARTY_BZIP2_A_OBJS) \
$(foreach x,$(THIRD_PARTY_BZIP2_A_DIRECTDEPS),$($(x)_A).pkg)
o/$(MODE)/third_party/bzip2/bzip2.com.dbg: \
$(THIRD_PARTY_BZIP2) \
o/$(MODE)/third_party/bzip2/bzip2.o \
o/$(MODE)/third_party/bzip2/bzip2.a.pkg \
$(CRT) \
$(APE_NO_MODIFY_SELF)
@$(APELINK)
o/$(MODE)/third_party/bzip2/bzip2recover.com.dbg: \
$(THIRD_PARTY_BZIP2) \
o/$(MODE)/third_party/bzip2/bzip2recover.o \
o/$(MODE)/third_party/bzip2/bzip2.a.pkg \
$(CRT) \
$(APE_NO_MODIFY_SELF)
@$(APELINK)
$(THIRD_PARTY_BZIP2_A_OBJS): private \
OVERRIDE_CFLAGS += \
-ffunction-sections \
-fdata-sections
THIRD_PARTY_BZIP2_LIBS = $(foreach x,$(THIRD_PARTY_BZIP2_ARTIFACTS),$($(x)))
THIRD_PARTY_BZIP2_SRCS = $(foreach x,$(THIRD_PARTY_BZIP2_ARTIFACTS),$($(x)_SRCS))
THIRD_PARTY_BZIP2_HDRS = $(foreach x,$(THIRD_PARTY_BZIP2_ARTIFACTS),$($(x)_HDRS))
THIRD_PARTY_BZIP2_INCS = $(foreach x,$(THIRD_PARTY_BZIP2_ARTIFACTS),$($(x)_INCS))
THIRD_PARTY_BZIP2_BINS = $(foreach x,$(THIRD_PARTY_BZIP2_ARTIFACTS),$($(x)_BINS))
THIRD_PARTY_BZIP2_CHECKS = $(foreach x,$(THIRD_PARTY_BZIP2_ARTIFACTS),$($(x)_CHECKS))
THIRD_PARTY_BZIP2_OBJS = $(foreach x,$(THIRD_PARTY_BZIP2_ARTIFACTS),$($(x)_OBJS))
$(THIRD_PARTY_BZIP2_OBJS): $(BUILD_FILES) third_party/bzip2/bzip2.mk
.PHONY: o/$(MODE)/third_party/bzip2
o/$(MODE)/third_party/bzip2: \
$(THIRD_PARTY_BZIP2_COMS) \
$(THIRD_PARTY_BZIP2_CHECKS)
# TODO(jart): write regression test
# master jart@nightmare:~/cosmo$ o//third_party/bzip2/bzip2.com -1 <third_party/bzip2/sample1.ref >a
# master jart@nightmare:~/cosmo$ cmp -s third_party/bzip2/sample1.bz2 a
| 3,215 | 87 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzmore.1 | .\"Shamelessly copied from zmore.1 by Philippe Troin <[email protected]>
.\"for Debian GNU/Linux
.TH BZMORE 1
.SH NAME
bzmore, bzless \- file perusal filter for crt viewing of bzip2 compressed text
.SH SYNOPSIS
.B bzmore
[ name ... ]
.br
.B bzless
[ name ... ]
.SH NOTE
In the following description,
.I bzless
and
.I less
can be used interchangeably with
.I bzmore
and
.I more.
.SH DESCRIPTION
.I Bzmore
is a filter which allows examination of compressed or plain text files
one screenful at a time on a soft-copy terminal.
.I bzmore
works on files compressed with
.I bzip2
and also on uncompressed files.
If a file does not exist,
.I bzmore
looks for a file of the same name with the addition of a .bz2 suffix.
.PP
.I Bzmore
normally pauses after each screenful, printing --More--
at the bottom of the screen.
If the user then types a carriage return, one more line is displayed.
If the user hits a space,
another screenful is displayed. Other possibilities are enumerated later.
.PP
.I Bzmore
looks in the file
.I /etc/termcap
to determine terminal characteristics,
and to determine the default window size.
On a terminal capable of displaying 24 lines,
the default window size is 22 lines.
Other sequences which may be typed when
.I bzmore
pauses, and their effects, are as follows (\fIi\fP is an optional integer
argument, defaulting to 1) :
.PP
.IP \fIi\|\fP<space>
display
.I i
more lines, (or another screenful if no argument is given)
.PP
.IP ^D
display 11 more lines (a ``scroll'').
If
.I i
is given, then the scroll size is set to \fIi\|\fP.
.PP
.IP d
same as ^D (control-D)
.PP
.IP \fIi\|\fPz
same as typing a space except that \fIi\|\fP, if present, becomes the new
window size. Note that the window size reverts back to the default at the
end of the current file.
.PP
.IP \fIi\|\fPs
skip \fIi\|\fP lines and print a screenful of lines
.PP
.IP \fIi\|\fPf
skip \fIi\fP screenfuls and print a screenful of lines
.PP
.IP "q or Q"
quit reading the current file; go on to the next (if any)
.PP
.IP "e or q"
When the prompt --More--(Next file:
.IR file )
is printed, this command causes bzmore to exit.
.PP
.IP s
When the prompt --More--(Next file:
.IR file )
is printed, this command causes bzmore to skip the next file and continue.
.PP
.IP =
Display the current line number.
.PP
.IP \fIi\|\fP/expr
search for the \fIi\|\fP-th occurrence of the regular expression \fIexpr.\fP
If the pattern is not found,
.I bzmore
goes on to the next file (if any).
Otherwise, a screenful is displayed, starting two lines before the place
where the expression was found.
The user's erase and kill characters may be used to edit the regular
expression.
Erasing back past the first column cancels the search command.
.PP
.IP \fIi\|\fPn
search for the \fIi\|\fP-th occurrence of the last regular expression entered.
.PP
.IP !command
invoke a shell with \fIcommand\|\fP.
The character `!' in "command" are replaced with the
previous shell command. The sequence "\\!" is replaced by "!".
.PP
.IP ":q or :Q"
quit reading the current file; go on to the next (if any)
(same as q or Q).
.PP
.IP .
(dot) repeat the previous command.
.PP
The commands take effect immediately, i.e., it is not necessary to
type a carriage return.
Up to the time when the command character itself is given,
the user may hit the line kill character to cancel the numerical
argument being formed.
In addition, the user may hit the erase character to redisplay the
--More-- message.
.PP
At any time when output is being sent to the terminal, the user can
hit the quit key (normally control\-\\).
.I Bzmore
will stop sending output, and will display the usual --More--
prompt.
The user may then enter one of the above commands in the normal manner.
Unfortunately, some output is lost when this is done, due to the
fact that any characters waiting in the terminal's output queue
are flushed when the quit signal occurs.
.PP
The terminal is set to
.I noecho
mode by this program so that the output can be continuous.
What you type will thus not show on your terminal, except for the / and !
commands.
.PP
If the standard output is not a teletype, then
.I bzmore
acts just like
.I bzcat,
except that a header is printed before each file.
.SH FILES
.DT
/etc/termcap Terminal data base
.SH "SEE ALSO"
more(1), less(1), bzip2(1), bzdiff(1), bzgrep(1)
| 4,310 | 153 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/sample3.bz2 | BZh31AY&SYºÍ3É :¶ß @e0 ?ïÞà0 ÚÛCS'ꦣOHmMMC £@"Qé4Ñ hÓJoÞÑTAeS<í|îÛé8ß'Cβµ÷O¸=Áx¯µa{»â^ý2åºn°VêB·ïuU©´`Û2 ªÉçI%@¯ @ ±
¾àý
£^1 ˯ðú£¦Çº)ëô·alèDh3H¯Ú\mIL´hiiÈB°Ró XVî_ÅÜN$.³Lò@ | 235 | 3 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/bzip2.1.txt | bzip2(1) bzip2(1)
ðððð
bzip2, bunzip2 â a block-sorting file compressor, v1.0.8
bzcat â decompresses files to stdout
bzip2recover â recovers data from damaged bzip2 files
ðððððððð
ð¯ðð¶ð½ð® [ âð°ð±ð³ð¸ð¾ðððððððð®ð¯ð°ð±ð²ð³ð´ðµ ] [ f̲i̲l̲e̲n̲a̲m̲e̲s̲ .̲.̲.̲ ]
ð¯ðð»ðð¶ð½ð® [ âð³ð¸ðððð ] [ f̲i̲l̲e̲n̲a̲m̲e̲s̲ .̲.̲.̲ ]
ð¯ðð°ð®ð [ âð ] [ f̲i̲l̲e̲n̲a̲m̲e̲s̲ .̲.̲.̲ ]
ð¯ðð¶ð½ð®ð¿ð²ð°ð¼ðð²ð¿ f̲i̲l̲e̲n̲a̲m̲e̲
ððððððððððð
b̲z̲i̲p̲2̲ compresses files using the Burrows-Wheeler block
sorting text compression algorithm, and Huffman coding.
Compression is generally considerably better than that
achieved by more conventional LZ77/LZ78-based compressors,
and approaches the performance of the PPM family of sta-
tistical compressors.
The command-line options are deliberately very similar to
those of G̲N̲U̲ g̲z̲i̲p̲,̲ but they are not identical.
b̲z̲i̲p̲2̲ expects a list of file names to accompany the com-
mand-line flags. Each file is replaced by a compressed
version of itself, with the name "original_name.bz2".
Each compressed file has the same modification date, per-
missions, and, when possible, ownership as the correspond-
ing original, so that these properties can be correctly
restored at decompression time. File name handling is
naive in the sense that there is no mechanism for preserv-
ing original file names, permissions, ownerships or dates
in filesystems which lack these concepts, or have serious
file name length restrictions, such as MS-DOS.
b̲z̲i̲p̲2̲ and b̲u̲n̲z̲i̲p̲2̲ will by default not overwrite existing
files. If you want this to happen, specify the âf flag.
If no file names are specified, b̲z̲i̲p̲2̲ compresses from
standard input to standard output. In this case, b̲z̲i̲p̲2̲
will decline to write compressed output to a terminal, as
this would be entirely incomprehensible and therefore
pointless.
b̲u̲n̲z̲i̲p̲2̲ (or b̲z̲i̲p̲2̲ â̲d̲)̲ decompresses all specified files.
Files which were not created by b̲z̲i̲p̲2̲ will be detected and
ignored, and a warning issued. b̲z̲i̲p̲2̲ attempts to guess
the filename for the decompressed file from that of the
compressed file as follows:
filename.bz2 becomes filename
filename.bz becomes filename
filename.tbz2 becomes filename.tar
filename.tbz becomes filename.tar
anyothername becomes anyothername.out
If the file does not end in one of the recognised endings,
.̲b̲z̲2̲,̲ .̲b̲z̲,̲ .̲t̲b̲z̲2̲ or .̲t̲b̲z̲,̲ b̲z̲i̲p̲2̲ complains that it cannot
guess the name of the original file, and uses the original
name with .̲o̲u̲t̲ appended.
As with compression, supplying no filenames causes decom-
pression from standard input to standard output.
b̲u̲n̲z̲i̲p̲2̲ will correctly decompress a file which is the con-
catenation of two or more compressed files. The result is
the concatenation of the corresponding uncompressed files.
Integrity testing (ât) of concatenated compressed files is
also supported.
You can also compress or decompress files to the standard
output by giving the âc flag. Multiple files may be com-
pressed and decompressed like this. The resulting outputs
are fed sequentially to stdout. Compression of multiple
files in this manner generates a stream containing multi-
ple compressed file representations. Such a stream can be
decompressed correctly only by b̲z̲i̲p̲2̲ version 0.9.0 or
later. Earlier versions of b̲z̲i̲p̲2̲ will stop after decom-
pressing the first file in the stream.
b̲z̲c̲a̲t̲ (or b̲z̲i̲p̲2̲ -̲d̲c̲)̲ decompresses all specified files to
the standard output.
b̲z̲i̲p̲2̲ will read arguments from the environment variables
B̲Z̲I̲P̲2̲ and B̲Z̲I̲P̲,̲ in that order, and will process them
before any arguments read from the command line. This
gives a convenient way to supply default arguments.
Compression is always performed, even if the compressed
file is slightly larger than the original. Files of less
than about one hundred bytes tend to get larger, since the
compression mechanism has a constant overhead in the
region of 50 bytes. Random data (including the output of
most file compressors) is coded at about 8.05 bits per
byte, giving an expansion of around 0.5%.
As a self-check for your protection, b̲z̲i̲p̲2̲ uses 32-bit
CRCs to make sure that the decompressed version of a file
is identical to the original. This guards against corrup-
tion of the compressed data, and against undetected bugs
in b̲z̲i̲p̲2̲ (hopefully very unlikely). The chances of data
corruption going undetected is microscopic, about one
chance in four billion for each file processed. Be aware,
though, that the check occurs upon decompression, so it
can only tell you that something is wrong. It canât help
you recover the original uncompressed data. You can use
b̲z̲i̲p̲2̲r̲e̲c̲o̲v̲e̲r̲ to try to recover data from damaged files.
Return values: 0 for a normal exit, 1 for environmental
problems (file not found, invalid flags, I/O errors, &c),
2 to indicate a corrupt compressed file, 3 for an internal
consistency error (eg, bug) which caused b̲z̲i̲p̲2̲ to panic.
ððððððð
âð° --ððð±ð¼ðð
Compress or decompress to standard output.
âð± --ð±ð²ð°ð¼ðºð½ð¿ð²ðð
Force decompression. b̲z̲i̲p̲2̲,̲ b̲u̲n̲z̲i̲p̲2̲ and b̲z̲c̲a̲t̲ are
really the same program, and the decision about
what actions to take is done on the basis of which
name is used. This flag overrides that mechanism,
and forces b̲z̲i̲p̲2̲ to decompress.
âð --ð°ð¼ðºð½ð¿ð²ðð
The complement to âd: forces compression,
regardless of the invocation name.
âð --ðð²ðð
Check integrity of the specified file(s), but donât
decompress them. This really performs a trial
decompression and throws away the result.
âð³ --ð³ð¼ð¿ð°ð²
Force overwrite of output files. Normally, b̲z̲i̲p̲2̲
will not overwrite existing output files. Also
forces b̲z̲i̲p̲2̲ to break hard links to files, which it
otherwise wouldnât do.
bzip2 normally declines to decompress files which
donât have the correct magic header bytes. If
forced (-f), however, it will pass such files
through unmodified. This is how GNU gzip behaves.
âð¸ --ð¸ð²ð²ð½
Keep (donât delete) input files during compression
or decompression.
âð --ððºð®ð¹ð¹
Reduce memory usage, for compression, decompression
and testing. Files are decompressed and tested
using a modified algorithm which only requires 2.5
bytes per block byte. This means any file can be
decompressed in 2300k of memory, albeit at about
half the normal speed.
During compression, âs selects a block size of
200k, which limits memory use to around the same
figure, at the expense of your compression ratio.
In short, if your machine is low on memory (8
megabytes or less), use âs for everything. See
MEMORY MANAGEMENT below.
âð¾ --ð¾ðð¶ð²ð
Suppress non-essential warning messages. Messages
pertaining to I/O errors and other critical events
will not be suppressed.
âð --ðð²ð¿ð¯ð¼ðð²
Verbose mode -- show the compression ratio for each
file processed. Further âvâs increase the ver-
bosity level, spewing out lots of information which
is primarily of interest for diagnostic purposes.
âð --ð¹ð¶ð°ð²ð»ðð² -ð --ðð²ð¿ðð¶ð¼ð»
Display the software version, license terms and
conditions.
âð (ð¼ð¿ ââð³ð®ðð) ðð¼ âðµ (ð¼ð¿ ââð¯ð²ðð)
Set the block size to 100 k, 200 k .. 900 k when
compressing. Has no effect when decompressing.
See MEMORY MANAGEMENT below. The ââfast and ââbest
aliases are primarily for GNU gzip compatibility.
In particular, ââfast doesnât make things signifi-
cantly faster. And ââbest merely selects the
default behaviour.
â- Treats all subsequent arguments as file names, even
if they start with a dash. This is so you can han-
dle files with names beginning with a dash, for
example: bzip2 â- âmyfilename.
â-ð¿ð²ð½ð²ðð¶ðð¶ðð²-ð³ð®ðð --ð¿ð²ð½ð²ðð¶ðð¶ðð²-ð¯ð²ðð
These flags are redundant in versions 0.9.5 and
above. They provided some coarse control over the
behaviour of the sorting algorithm in earlier ver-
sions, which was sometimes useful. 0.9.5 and above
have an improved algorithm which renders these
flags irrelevant.
ðððððð ðððððððððð
b̲z̲i̲p̲2̲ compresses large files in blocks. The block size
affects both the compression ratio achieved, and the
amount of memory needed for compression and decompression.
The flags â1 through â9 specify the block size to be
100,000 bytes through 900,000 bytes (the default) respec-
tively. At decompression time, the block size used for
compression is read from the header of the compressed
file, and b̲u̲n̲z̲i̲p̲2̲ then allocates itself just enough memory
to decompress the file. Since block sizes are stored in
compressed files, it follows that the flags â1 to â9 are
irrelevant to and so ignored during decompression.
Compression and decompression requirements, in bytes, can
be estimated as:
Compression: 400k + ( 8 x block size )
Decompression: 100k + ( 4 x block size ), or
100k + ( 2.5 x block size )
Larger block sizes give rapidly diminishing marginal
returns. Most of the compression comes from the first two
or three hundred k of block size, a fact worth bearing in
mind when using b̲z̲i̲p̲2̲ on small machines. It is also
important to appreciate that the decompression memory
requirement is set at compression time by the choice of
block size.
For files compressed with the default 900k block size,
b̲u̲n̲z̲i̲p̲2̲ will require about 3700 kbytes to decompress. To
support decompression of any file on a 4 megabyte machine,
b̲u̲n̲z̲i̲p̲2̲ has an option to decompress using approximately
half this amount of memory, about 2300 kbytes. Decompres-
sion speed is also halved, so you should use this option
only where necessary. The relevant flag is -s.
In general, try and use the largest block size memory con-
straints allow, since that maximises the compression
achieved. Compression and decompression speed are virtu-
ally unaffected by block size.
Another significant point applies to files which fit in a
single block -- that means most files youâd encounter
using a large block size. The amount of real memory
touched is proportional to the size of the file, since the
file is smaller than a block. For example, compressing a
file 20,000 bytes long with the flag -9 will cause the
compressor to allocate around 7600k of memory, but only
touch 400k + 20000 * 8 = 560 kbytes of it. Similarly, the
decompressor will allocate 3700k but only touch 100k +
20000 * 4 = 180 kbytes.
Here is a table which summarises the maximum memory usage
for different block sizes. Also recorded is the total
compressed size for 14 files of the Calgary Text Compres-
sion Corpus totalling 3,141,622 bytes. This column gives
some feel for how compression varies with block size.
These figures tend to understate the advantage of larger
block sizes for larger files, since the Corpus is domi-
nated by smaller files.
Compress Decompress Decompress Corpus
Flag usage usage -s usage Size
-1 1200k 500k 350k 914704
-2 2000k 900k 600k 877703
-3 2800k 1300k 850k 860338
-4 3600k 1700k 1100k 846899
-5 4400k 2100k 1350k 845160
-6 5200k 2500k 1600k 838626
-7 6100k 2900k 1850k 834096
-8 6800k 3300k 2100k 828642
-9 7600k 3700k 2350k 828642
ðððððððððð ðððð ð
ððð ððððððð ð
ðððð
b̲z̲i̲p̲2̲ compresses files in blocks, usually 900kbytes long.
Each block is handled independently. If a media or trans-
mission error causes a multi-block .bz2 file to become
damaged, it may be possible to recover data from the
undamaged blocks in the file.
The compressed representation of each block is delimited
by a 48-bit pattern, which makes it possible to find the
block boundaries with reasonable certainty. Each block
also carries its own 32-bit CRC, so damaged blocks can be
distinguished from undamaged ones.
b̲z̲i̲p̲2̲r̲e̲c̲o̲v̲e̲r̲ is a simple program whose purpose is to
search for blocks in .bz2 files, and write each block out
into its own .bz2 file. You can then use b̲z̲i̲p̲2̲ ât to test
the integrity of the resulting files, and decompress those
which are undamaged.
b̲z̲i̲p̲2̲r̲e̲c̲o̲v̲e̲r̲ takes a single argument, the name of the dam-
aged file, and writes a number of files
"rec00001file.bz2", "rec00002file.bz2", etc, containing
the extracted blocks. The output filenames are
designed so that the use of wildcards in subsequent pro-
cessing -- for example, "bzip2 -dc rec*file.bz2 > recov-
ered_data" -- processes the files in the correct order.
b̲z̲i̲p̲2̲r̲e̲c̲o̲v̲e̲r̲ should be of most use dealing with large .bz2
files, as these will contain many blocks. It is clearly
futile to use it on damaged single-block files, since a
damaged block cannot be recovered. If you wish to min-
imise any potential data loss through media or transmis-
sion errors, you might consider compressing with a smaller
block size.
ðððð
ððððððð ððððð
The sorting phase of compression gathers together similar
strings in the file. Because of this, files containing
very long runs of repeated symbols, like "aabaabaabaab
..." (repeated several hundred times) may compress more
slowly than normal. Versions 0.9.5 and above fare much
better than previous versions in this respect. The ratio
between worst-case and average-case compression time is in
the region of 10:1. For previous versions, this figure
was more like 100:1. You can use the âvvvv option to mon-
itor progress in great detail, if you want.
Decompression speed is unaffected by these phenomena.
b̲z̲i̲p̲2̲ usually allocates several megabytes of memory to
operate in, and then charges all over it in a fairly ran-
dom fashion. This means that performance, both for com-
pressing and decompressing, is largely determined by the
speed at which your machine can service cache misses.
Because of this, small changes to the code to reduce the
miss rate have been observed to give disproportionately
large performance improvements. I imagine b̲z̲i̲p̲2̲ will per-
form best on machines with very large caches.
ððððððð
I/O error messages are not as helpful as they could be.
b̲z̲i̲p̲2̲ tries hard to detect I/O errors and exit cleanly,
but the details of what the problem is sometimes seem
rather misleading.
This manual page pertains to version 1.0.8 of b̲z̲i̲p̲2̲.̲ Com-
pressed data created by this version is entirely forwards
and backwards compatible with the previous public
releases, versions 0.1pl2, 0.9.0, 0.9.5, 1.0.0, 1.0.1,
1.0.2 and above, but with the following exception: 0.9.0
and above can correctly decompress multiple concatenated
compressed files. 0.1pl2 cannot do this; it will stop
after decompressing just the first file in the stream.
b̲z̲i̲p̲2̲r̲e̲c̲o̲v̲e̲r̲ versions prior to 1.0.2 used 32-bit integers
to represent bit positions in compressed files, so they
could not handle compressed files more than 512 megabytes
long. Versions 1.0.2 and above use 64-bit ints on some
platforms which support them (GNU supported targets, and
Windows). To establish whether or not bzip2recover was
built with such a limitation, run it without arguments.
In any event you can build yourself an unlimited version
if you can recompile it with MaybeUInt64 set to be an
unsigned 64-bit integer.
ðððððð
Julian Seward, [email protected].
https://sourceware.org/bzip2/
The ideas embodied in b̲z̲i̲p̲2̲ are due to (at least) the fol-
lowing people: Michael Burrows and David Wheeler (for the
block sorting transformation), David Wheeler (again, for
the Huffman coder), Peter Fenwick (for the structured cod-
ing model in the original b̲z̲i̲p̲,̲ and many refinements), and
Alistair Moffat, Radford Neal and Ian Witten (for the
arithmetic coder in the original b̲z̲i̲p̲)̲.̲ I am much
indebted for their help, support and advice. See the man-
ual in the source distribution for pointers to sources of
documentation. Christian von Roques encouraged me to look
for faster sorting algorithms, so as to speed up compres-
sion. Bela Lubkin encouraged me to improve the worst-case
compression performance. Donna Robinson XMLised the docu-
mentation. The bz* scripts are derived from those of GNU
gzip. Many people sent patches, helped with portability
problems, lent machines, gave advice and were generally
helpful.
bzip2(1)
| 20,840 | 400 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/libbz2.dsp | # Microsoft Developer Studio Project File - Name="libbz2" - Package Owner=<4>
# Microsoft Developer Studio Generated Build File, Format Version 5.00
# ** ÒWµÈ¢Å¾³¢ **
# TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102
CFG=libbz2 - Win32 Debug
!MESSAGE ±êÍLøÈÒ²¸Ì§²ÙÅÍ èܹñB ±ÌÌßÛ¼Þª¸ÄðËÞÙÄÞ·é½ßÉÍ NMAKE ðgpµÄ¾³¢B
!MESSAGE [Ò²¸Ì§²ÙÌ´¸½Îß°Ä] ºÏÝÄÞðgpµÄÀsµÄ¾³¢
!MESSAGE
!MESSAGE NMAKE /f "libbz2.mak".
!MESSAGE
!MESSAGE NMAKE ÌÀsÉ\¬ðwèÅ«Ü·
!MESSAGE ºÏÝÄÞ ×²ÝãÅϸÛÌÝèðè`µÜ·Bá:
!MESSAGE
!MESSAGE NMAKE /f "libbz2.mak" CFG="libbz2 - Win32 Debug"
!MESSAGE
!MESSAGE IðÂ\ÈËÞÙÄÞ Ó°ÄÞ:
!MESSAGE
!MESSAGE "libbz2 - Win32 Release" ("Win32 (x86) Dynamic-Link Library" p)
!MESSAGE "libbz2 - Win32 Debug" ("Win32 (x86) Dynamic-Link Library" p)
!MESSAGE
# Begin Project
# PROP Scc_ProjName ""
# PROP Scc_LocalPath ""
CPP=cl.exe
MTL=midl.exe
RSC=rc.exe
!IF "$(CFG)" == "libbz2 - Win32 Release"
# PROP BASE Use_MFC 0
# PROP BASE Use_Debug_Libraries 0
# PROP BASE Output_Dir "Release"
# PROP BASE Intermediate_Dir "Release"
# PROP BASE Target_Dir ""
# PROP Use_MFC 0
# PROP Use_Debug_Libraries 0
# PROP Output_Dir "Release"
# PROP Intermediate_Dir "Release"
# PROP Ignore_Export_Lib 0
# PROP Target_Dir ""
# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /YX /FD /c
# ADD CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /YX /FD /c
# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /o NUL /win32
# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /o NUL /win32
# ADD BASE RSC /l 0x411 /d "NDEBUG"
# ADD RSC /l 0x411 /d "NDEBUG"
BSC32=bscmake.exe
# ADD BASE BSC32 /nologo
# ADD BSC32 /nologo
LINK32=link.exe
# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /machine:I386
# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /machine:I386 /out:"libbz2.dll"
!ELSEIF "$(CFG)" == "libbz2 - Win32 Debug"
# PROP BASE Use_MFC 0
# PROP BASE Use_Debug_Libraries 1
# PROP BASE Output_Dir "Debug"
# PROP BASE Intermediate_Dir "Debug"
# PROP BASE Target_Dir ""
# PROP Use_MFC 0
# PROP Use_Debug_Libraries 1
# PROP Output_Dir "Debug"
# PROP Intermediate_Dir "Debug"
# PROP Ignore_Export_Lib 0
# PROP Target_Dir ""
# ADD BASE CPP /nologo /MTd /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /YX /FD /c
# ADD CPP /nologo /MTd /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /YX /FD /c
# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /o NUL /win32
# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /o NUL /win32
# ADD BASE RSC /l 0x411 /d "_DEBUG"
# ADD RSC /l 0x411 /d "_DEBUG"
BSC32=bscmake.exe
# ADD BASE BSC32 /nologo
# ADD BSC32 /nologo
LINK32=link.exe
# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /debug /machine:I386 /pdbtype:sept
# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /debug /machine:I386 /out:"libbz2.dll" /pdbtype:sept
!ENDIF
# Begin Target
# Name "libbz2 - Win32 Release"
# Name "libbz2 - Win32 Debug"
# Begin Source File
SOURCE=.\blocksort.c
# End Source File
# Begin Source File
SOURCE=.\bzlib.c
# End Source File
# Begin Source File
SOURCE=.\bzlib.h
# End Source File
# Begin Source File
SOURCE=.\bzlib_private.h
# End Source File
# Begin Source File
SOURCE=.\compress.c
# End Source File
# Begin Source File
SOURCE=.\crctable.c
# End Source File
# Begin Source File
SOURCE=.\decompress.c
# End Source File
# Begin Source File
SOURCE=.\huffman.c
# End Source File
# Begin Source File
SOURCE=.\libbz2.def
# End Source File
# Begin Source File
SOURCE=.\randtable.c
# End Source File
# End Target
# End Project
| 4,124 | 131 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/sample3.ref | This file is exceedingly boring. If you find yourself
reading it, please (1) take it from me that you can safely
guess what the rest of the file says, and (2) seek professional
help.
ps. there are no further sarcastic remarks in this file.
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
ugh
| 120,244 | 30,008 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/entities.xml | <!-- misc. strings -->
<!ENTITY bz-url "https://sourceware.org/bzip2/">
<!ENTITY bz-author "[email protected]">
<!ENTITY bz-email "[email protected]">
<!ENTITY bz-lifespan "1996-2019">
<!ENTITY bz-version "1.0.8">
<!ENTITY bz-date "13 July 2019">
<!ENTITY manual-title "bzip2 Manual">
| 294 | 11 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/randtable.c | /* clang-format off */
/*-------------------------------------------------------------*/
/*--- Table for randomising repetitive blocks ---*/
/*--- randtable.c ---*/
/*-------------------------------------------------------------*/
/* ------------------------------------------------------------------
This file is part of bzip2/libbzip2, a program and library for
lossless, block-sorting data compression.
bzip2/libbzip2 version 1.0.8 of 13 July 2019
Copyright (C) 1996-2019 Julian Seward <[email protected]>
Please read the WARNING, DISCLAIMER and PATENTS sections in the
README file.
This program is released under the terms of the license contained
in the file LICENSE.
------------------------------------------------------------------ */
#include "third_party/bzip2/bzlib_private.inc"
/*---------------------------------------------*/
Int32 BZ2_rNums[512] = {
619, 720, 127, 481, 931, 816, 813, 233, 566, 247,
985, 724, 205, 454, 863, 491, 741, 242, 949, 214,
733, 859, 335, 708, 621, 574, 73, 654, 730, 472,
419, 436, 278, 496, 867, 210, 399, 680, 480, 51,
878, 465, 811, 169, 869, 675, 611, 697, 867, 561,
862, 687, 507, 283, 482, 129, 807, 591, 733, 623,
150, 238, 59, 379, 684, 877, 625, 169, 643, 105,
170, 607, 520, 932, 727, 476, 693, 425, 174, 647,
73, 122, 335, 530, 442, 853, 695, 249, 445, 515,
909, 545, 703, 919, 874, 474, 882, 500, 594, 612,
641, 801, 220, 162, 819, 984, 589, 513, 495, 799,
161, 604, 958, 533, 221, 400, 386, 867, 600, 782,
382, 596, 414, 171, 516, 375, 682, 485, 911, 276,
98, 553, 163, 354, 666, 933, 424, 341, 533, 870,
227, 730, 475, 186, 263, 647, 537, 686, 600, 224,
469, 68, 770, 919, 190, 373, 294, 822, 808, 206,
184, 943, 795, 384, 383, 461, 404, 758, 839, 887,
715, 67, 618, 276, 204, 918, 873, 777, 604, 560,
951, 160, 578, 722, 79, 804, 96, 409, 713, 940,
652, 934, 970, 447, 318, 353, 859, 672, 112, 785,
645, 863, 803, 350, 139, 93, 354, 99, 820, 908,
609, 772, 154, 274, 580, 184, 79, 626, 630, 742,
653, 282, 762, 623, 680, 81, 927, 626, 789, 125,
411, 521, 938, 300, 821, 78, 343, 175, 128, 250,
170, 774, 972, 275, 999, 639, 495, 78, 352, 126,
857, 956, 358, 619, 580, 124, 737, 594, 701, 612,
669, 112, 134, 694, 363, 992, 809, 743, 168, 974,
944, 375, 748, 52, 600, 747, 642, 182, 862, 81,
344, 805, 988, 739, 511, 655, 814, 334, 249, 515,
897, 955, 664, 981, 649, 113, 974, 459, 893, 228,
433, 837, 553, 268, 926, 240, 102, 654, 459, 51,
686, 754, 806, 760, 493, 403, 415, 394, 687, 700,
946, 670, 656, 610, 738, 392, 760, 799, 887, 653,
978, 321, 576, 617, 626, 502, 894, 679, 243, 440,
680, 879, 194, 572, 640, 724, 926, 56, 204, 700,
707, 151, 457, 449, 797, 195, 791, 558, 945, 679,
297, 59, 87, 824, 713, 663, 412, 693, 342, 606,
134, 108, 571, 364, 631, 212, 174, 643, 304, 329,
343, 97, 430, 751, 497, 314, 983, 374, 822, 928,
140, 206, 73, 263, 980, 736, 876, 478, 430, 305,
170, 514, 364, 692, 829, 82, 855, 953, 676, 246,
369, 970, 294, 750, 807, 827, 150, 790, 288, 923,
804, 378, 215, 828, 592, 281, 565, 555, 710, 82,
896, 831, 547, 261, 524, 462, 293, 465, 502, 56,
661, 821, 976, 991, 658, 869, 905, 758, 745, 193,
768, 550, 608, 933, 378, 286, 215, 979, 792, 961,
61, 688, 793, 644, 986, 403, 106, 366, 905, 644,
372, 567, 466, 434, 645, 210, 389, 550, 919, 135,
780, 773, 635, 389, 707, 100, 626, 958, 165, 504,
920, 176, 193, 713, 857, 265, 203, 50, 668, 108,
645, 990, 626, 197, 510, 357, 358, 850, 858, 364,
936, 638
};
/*-------------------------------------------------------------*/
/*--- end randtable.c ---*/
/*-------------------------------------------------------------*/
| 3,898 | 86 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/huffman.c | /* clang-format off */
/*-------------------------------------------------------------*/
/*--- Huffman coding low-level stuff ---*/
/*--- huffman.c ---*/
/*-------------------------------------------------------------*/
/* ------------------------------------------------------------------
This file is part of bzip2/libbzip2, a program and library for
lossless, block-sorting data compression.
bzip2/libbzip2 version 1.0.8 of 13 July 2019
Copyright (C) 1996-2019 Julian Seward <[email protected]>
Please read the WARNING, DISCLAIMER and PATENTS sections in the
README file.
This program is released under the terms of the license contained
in the file LICENSE.
------------------------------------------------------------------ */
#include "libc/mem/gc.internal.h"
#include "libc/mem/mem.h"
#include "third_party/bzip2/bzlib_private.inc"
/*---------------------------------------------------*/
#define WEIGHTOF(zz0) ((zz0) & 0xffffff00)
#define DEPTHOF(zz1) ((zz1) & 0x000000ff)
#define MYMAX(zz2,zz3) ((zz2) > (zz3) ? (zz2) : (zz3))
#define ADDWEIGHTS(zw1,zw2) \
(WEIGHTOF(zw1)+WEIGHTOF(zw2)) | \
(1 + MYMAX(DEPTHOF(zw1),DEPTHOF(zw2)))
#define UPHEAP(z) \
{ \
Int32 zz, tmp; \
zz = z; tmp = heap[zz]; \
while (weight[tmp] < weight[heap[zz >> 1]]) { \
heap[zz] = heap[zz >> 1]; \
zz >>= 1; \
} \
heap[zz] = tmp; \
}
#define DOWNHEAP(z) \
{ \
Int32 zz, yy, tmp; \
zz = z; tmp = heap[zz]; \
while (True) { \
yy = zz << 1; \
if (yy > nHeap) break; \
if (yy < nHeap && \
weight[heap[yy+1]] < weight[heap[yy]]) \
yy++; \
if (weight[tmp] < weight[heap[yy]]) break; \
heap[zz] = heap[yy]; \
zz = yy; \
} \
heap[zz] = tmp; \
}
/*---------------------------------------------------*/
void BZ2_hbMakeCodeLengths ( UChar *len,
Int32 *freq,
Int32 alphaSize,
Int32 maxLen )
{
/*--
Nodes and heap entries run from 1. Entry 0
for both the heap and nodes is a sentinel.
--*/
Int32 nNodes, nHeap, n1, n2, i, j, k;
Bool tooLong;
Int32 *heap = gc(calloc(BZ_MAX_ALPHA_SIZE + 2, 4));
Int32 *weight = gc(calloc(BZ_MAX_ALPHA_SIZE * 2, 4));
Int32 *parent = gc(calloc(BZ_MAX_ALPHA_SIZE * 2, 4));
for (i = 0; i < alphaSize; i++)
weight[i+1] = (freq[i] == 0 ? 1 : freq[i]) << 8;
while (True) {
nNodes = alphaSize;
nHeap = 0;
heap[0] = 0;
weight[0] = 0;
parent[0] = -2;
for (i = 1; i <= alphaSize; i++) {
parent[i] = -1;
nHeap++;
heap[nHeap] = i;
UPHEAP(nHeap);
}
AssertH( nHeap < (BZ_MAX_ALPHA_SIZE+2), 2001 );
while (nHeap > 1) {
n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
nNodes++;
parent[n1] = parent[n2] = nNodes;
weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
parent[nNodes] = -1;
nHeap++;
heap[nHeap] = nNodes;
UPHEAP(nHeap);
}
AssertH( nNodes < (BZ_MAX_ALPHA_SIZE * 2), 2002 );
tooLong = False;
for (i = 1; i <= alphaSize; i++) {
j = 0;
k = i;
while (parent[k] >= 0) { k = parent[k]; j++; }
len[i-1] = j;
if (j > maxLen) tooLong = True;
}
if (! tooLong) break;
/* 17 Oct 04: keep-going condition for the following loop used
to be 'i < alphaSize', which missed the last element,
theoretically leading to the possibility of the compressor
looping. However, this count-scaling step is only needed if
one of the generated Huffman code words is longer than
maxLen, which up to and including version 1.0.2 was 20 bits,
which is extremely unlikely. In version 1.0.3 maxLen was
changed to 17 bits, which has minimal effect on compression
ratio, but does mean this scaling step is used from time to
time, enough to verify that it works.
This means that bzip2-1.0.3 and later will only produce
Huffman codes with a maximum length of 17 bits. However, in
order to preserve backwards compatibility with bitstreams
produced by versions pre-1.0.3, the decompressor must still
handle lengths of up to 20. */
for (i = 1; i <= alphaSize; i++) {
j = weight[i] >> 8;
j = 1 + (j / 2);
weight[i] = j << 8;
}
}
}
/*---------------------------------------------------*/
void BZ2_hbAssignCodes ( Int32 *code,
UChar *length,
Int32 minLen,
Int32 maxLen,
Int32 alphaSize )
{
Int32 n, vec, i;
vec = 0;
for (n = minLen; n <= maxLen; n++) {
for (i = 0; i < alphaSize; i++)
if (length[i] == n) { code[i] = vec; vec++; };
vec <<= 1;
}
}
/*---------------------------------------------------*/
void BZ2_hbCreateDecodeTables ( Int32 *limit,
Int32 *base,
Int32 *perm,
UChar *length,
Int32 minLen,
Int32 maxLen,
Int32 alphaSize )
{
Int32 pp, i, j, vec;
pp = 0;
for (i = minLen; i <= maxLen; i++)
for (j = 0; j < alphaSize; j++)
if (length[j] == i) { perm[pp] = j; pp++; };
for (i = 0; i < BZ_MAX_CODE_LEN; i++) base[i] = 0;
for (i = 0; i < alphaSize; i++) base[length[i]+1]++;
for (i = 1; i < BZ_MAX_CODE_LEN; i++) base[i] += base[i-1];
for (i = 0; i < BZ_MAX_CODE_LEN; i++) limit[i] = 0;
vec = 0;
for (i = minLen; i <= maxLen; i++) {
vec += (base[i+1] - base[i]);
limit[i] = vec-1;
vec <<= 1;
}
for (i = minLen + 1; i <= maxLen; i++)
base[i] = ((limit[i-1] + 1) << 1) - base[i];
}
/*-------------------------------------------------------------*/
/*--- end huffman.c ---*/
/*-------------------------------------------------------------*/
| 7,130 | 209 | jart/cosmopolitan | false |
cosmopolitan/third_party/bzip2/prepare-release.sh | #!/bin/bash
# Script to run to prepare a new release.
# It will update the release number and tell you to update the
# CHANGES file and to double check everything looks before doing
# the release commit and tagging.
# Afterwards you probably want to run release-update.sh to upload
# the release and update the website at https://sourceware.org/bzip2/
# Any error is fatal
set -e
# We take one argument, the version (e.g. 1.0.7)
if [ $# -ne 1 ]; then
echo "$0 <version> (e.g. 1.0.7)"
exit 1
fi
LANG=C
VERSION="$1"
DATE=$(date +"%d %B %Y")
DAY=$(date +"%d")
MONTH=$(date +"%B")
SHORTMONTH=$(date +"%b")
YEAR=$(date +"%Y")
# Replace the version strings and date ranges in the comments
VER_PREFIX="bzip2/libbzip2 version "
sed -i -e "s@${VER_PREFIX}[0-9].*@${VER_PREFIX}${VERSION} of ${DATE}@" \
-e "s@ (C) \([0-9]\+\)-[0-9]\+ @ (C) \1-$YEAR @" \
CHANGES LICENSE Makefile* README* *.c *.h *.pl *.sh
# Add an entry to the README
printf "%2s %8s %s\n" "$DAY" "$MONTH" "$YEAR (bzip2, version $VERSION)" \
>> README
# Update manual
sed -i -e "s@ENTITY bz-version \".*\"@ENTITY bz-version \"$VERSION\"@" \
-e "s@ENTITY bz-date \".*\"@ENTITY bz-date \"$DAY $MONTH $YEAR\"@" \
-e "s@ENTITY bz-lifespan \"\([0-9]\+\)-[0-9]\+\"@ENTITY bz-lifespan \"\1-$YEAR\"@"\
entities.xml
# bzip2.1 should really be generated from the manual.xml, but currently
# isn't, so explicitly change it here too.
sed -i -e "s@This manual page pertains to version .* of@This manual page pertains to version $VERSION of@" \
-e "s@sorting file compressor, v.*@sorting file compressor, v$VERSION@" \
bzip2.1* bzip2.txt
# Update sources. All sources, use bzlib_private.
# Except bzip2recover, which embeds a version string...
sed -i -e "s@^#define BZ_VERSION \".*\"@#define BZ_VERSION \"${VERSION}, ${DAY}-${SHORTMONTH}-${YEAR}\"@" \
bzlib_private.h
sed -i -e "s@\"bzip2recover .*: extracts blocks from damaged@\"bzip2recover ${VERSION}: extracts blocks from damaged@" \
bzip2recover.c
# And finally update the version/dist/so_name in the Makefiles.
sed -i -e "s@^DISTNAME=bzip2-.*@DISTNAME=bzip2-${VERSION}@" \
Makefile
sed -i -e "s@libbz2\.so\.[0-9]\.[0-9]\.[0-9]*@libbz2\.so\.${VERSION}@" \
Makefile-libbz2_so
echo "Now make sure the diff looks correct:"
echo " git diff"
echo
echo "And make sure there is a $VERSION section in the CHANGES file."
echo
echo "Double check:"
echo " make clean && make dist && make clean && make -f Makefile-libbz2_so"
echo
echo "Does everything look fine?"
echo
echo "git commit -a -m \"Prepare for $VERSION release.\""
echo "git push"
echo
echo "Wait for the buildbot to give the all green!"
echo "Then..."
echo
echo "git tag -s -m \"bzip2 $VERSION release\" bzip2-$VERSION"
echo "git push --tags"
echo
echo "./release-update.sh"
| 2,790 | 83 | jart/cosmopolitan | false |
cosmopolitan/third_party/musl/crypt.h | #ifndef COSMOPOLITAN_THIRD_PARTY_MUSL_CRYPT_H_
#define COSMOPOLITAN_THIRD_PARTY_MUSL_CRYPT_H_
#if !(__ASSEMBLER__ + __LINKER__ + 0)
COSMOPOLITAN_C_START_
struct crypt_data {
int initialized;
char __buf[256];
};
void encrypt(char *, int);
void setkey(const char *);
char *crypt(const char *, const char *);
char *crypt_r(const char *, const char *, struct crypt_data *);
COSMOPOLITAN_C_END_
#endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */
#endif /* COSMOPOLITAN_THIRD_PARTY_MUSL_CRYPT_H_ */
| 496 | 19 | jart/cosmopolitan | false |
cosmopolitan/third_party/musl/strfmon.c | /*-*- mode:c;indent-tabs-mode:t;c-basic-offset:8;tab-width:8;coding:utf-8 -*-â
âvi: set et ft=c ts=8 tw=8 fenc=utf-8 :viâ
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ
â â
â Musl Libc â
â Copyright © 2005-2014 Rich Felker, et al. â
â â
â Permission is hereby granted, free of charge, to any person obtaining â
â a copy of this software and associated documentation files (the â
â "Software"), to deal in the Software without restriction, including â
â without limitation the rights to use, copy, modify, merge, publish, â
â distribute, sublicense, and/or sell copies of the Software, and to â
â permit persons to whom the Software is furnished to do so, subject to â
â the following conditions: â
â â
â The above copyright notice and this permission notice shall be â
â included in all copies or substantial portions of the Software. â
â â
â THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, â
â EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF â
â MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. â
â IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY â
â CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, â
â TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE â
â SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. â
â â
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ*/
#include "libc/errno.h"
#include "libc/fmt/fmt.h"
#include "libc/str/locale.h"
#include "libc/str/str.h"
#include "libc/thread/tls.h"
asm(".ident\t\"\\n\\n\
Musl libc (MIT License)\\n\
Copyright 2005-2014 Rich Felker, et. al.\"");
asm(".include \"libc/disclaimer.inc\"");
// clang-format off
static ssize_t vstrfmon_l(char *s, size_t n, locale_t loc, const char *fmt, va_list ap)
{
size_t l;
double x;
int fill, nogrp, negpar, nosym, left, intl;
int lp, rp, w, fw;
char *s0=s;
for (; n && *fmt; ) {
if (*fmt != '%') {
literal:
*s++ = *fmt++;
n--;
continue;
}
fmt++;
if (*fmt == '%') goto literal;
fill = ' ';
nogrp = 0;
negpar = 0;
nosym = 0;
left = 0;
for (; ; fmt++) {
switch (*fmt) {
case '=':
fill = *++fmt;
continue;
case '^':
nogrp = 1;
continue;
case '(':
negpar = 1;
case '+':
continue;
case '!':
nosym = 1;
continue;
case '-':
left = 1;
continue;
}
break;
}
for (fw=0; isdigit(*fmt); fmt++)
fw = 10*fw + (*fmt-'0');
lp = 0;
rp = 2;
if (*fmt=='#') for (lp=0, fmt++; isdigit(*fmt); fmt++)
lp = 10*lp + (*fmt-'0');
if (*fmt=='.') for (rp=0, fmt++; isdigit(*fmt); fmt++)
rp = 10*rp + (*fmt-'0');
intl = *fmt++ == 'i';
w = lp + 1 + rp;
if (!left && fw>w) w = fw;
x = va_arg(ap, double);
l = snprintf(s, n, "%*.*f", w, rp, x);
if (l >= n) {
errno = E2BIG;
return -1;
}
s += l;
n -= l;
}
return s-s0;
}
ssize_t strfmon_l(char *restrict s, size_t n, locale_t loc, const char *restrict fmt, ...)
{
va_list ap;
ssize_t ret;
va_start(ap, fmt);
ret = vstrfmon_l(s, n, loc, fmt, ap);
va_end(ap);
return ret;
}
ssize_t strfmon(char *restrict s, size_t n, const char *restrict fmt, ...)
{
va_list ap;
ssize_t ret;
va_start(ap, fmt);
ret = vstrfmon_l(s, n, (locale_t)__get_tls()->tib_locale, fmt, ap);
va_end(ap);
return ret;
}
| 4,500 | 134 | jart/cosmopolitan | false |
cosmopolitan/third_party/musl/ftw.h | #ifndef COSMOPOLITAN_THIRD_PARTY_MUSL_FTW_H_
#define COSMOPOLITAN_THIRD_PARTY_MUSL_FTW_H_
#include "libc/calls/struct/stat.h"
#if !(__ASSEMBLER__ + __LINKER__ + 0)
COSMOPOLITAN_C_START_
#define FTW_F 1 /* file */
#define FTW_D 2 /* directory */
#define FTW_DNR 3 /* directory that cannot be read */
#define FTW_NS 4 /* not a symbolic link and stat failed */
#define FTW_SL 5 /* symbolic link */
#define FTW_DP 6 /* directory and FTW_DEPTH was specified */
#define FTW_SLN 7 /* symbolic link pointing to nonexistent file */
#define FTW_PHYS 1
#define FTW_MOUNT 2
#define FTW_CHDIR 4
#define FTW_DEPTH 8
struct FTW {
int base;
int level;
};
int ftw(const char *, int (*)(const char *, const struct stat *, int), int);
int nftw(const char *,
int (*)(const char *, const struct stat *, int, struct FTW *), int,
int);
COSMOPOLITAN_C_END_
#endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */
#endif /* COSMOPOLITAN_THIRD_PARTY_MUSL_FTW_H_ */
| 965 | 33 | jart/cosmopolitan | false |
cosmopolitan/third_party/musl/rand48.c | /*-*- mode:c;indent-tabs-mode:t;c-basic-offset:8;tab-width:8;coding:utf-8 -*-â
âvi: set et ft=c ts=8 tw=8 fenc=utf-8 :viâ
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ
â â
â Musl Libc â
â Copyright © 2005-2014 Rich Felker, et al. â
â â
â Permission is hereby granted, free of charge, to any person obtaining â
â a copy of this software and associated documentation files (the â
â "Software"), to deal in the Software without restriction, including â
â without limitation the rights to use, copy, modify, merge, publish, â
â distribute, sublicense, and/or sell copies of the Software, and to â
â permit persons to whom the Software is furnished to do so, subject to â
â the following conditions: â
â â
â The above copyright notice and this permission notice shall be â
â included in all copies or substantial portions of the Software. â
â â
â THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, â
â EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF â
â MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. â
â IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY â
â CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, â
â TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE â
â SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. â
â â
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ*/
#include "libc/str/str.h"
#include "third_party/musl/rand48.h"
asm(".ident\t\"\\n\\n\
Musl libc (MIT License)\\n\
Copyright 2005-2014 Rich Felker, et. al.\"");
asm(".include \"libc/disclaimer.inc\"");
// clang-format off
static unsigned short __seed48[7] = { 0, 0, 0, 0xe66d, 0xdeec, 0x5, 0xb };
static uint64_t __rand48_step(unsigned short *xi, unsigned short *lc)
{
uint64_t a, x;
x = xi[0] | xi[1]+0U<<16 | xi[2]+0ULL<<32;
a = lc[0] | lc[1]+0U<<16 | lc[2]+0ULL<<32;
x = a*x + lc[3];
xi[0] = x;
xi[1] = x>>16;
xi[2] = x>>32;
return x & 0xffffffffffffull;
}
double erand48(unsigned short s[3])
{
union {
uint64_t u;
double f;
} x = { 0x3ff0000000000000ULL | __rand48_step(s, __seed48+3)<<4 };
return x.f - 1.0;
}
double drand48(void)
{
return erand48(__seed48);
}
void lcong48(unsigned short p[7])
{
memcpy(__seed48, p, sizeof __seed48);
}
long nrand48(unsigned short s[3])
{
return __rand48_step(s, __seed48+3) >> 17;
}
long lrand48(void)
{
return nrand48(__seed48);
}
long jrand48(unsigned short s[3])
{
return (int32_t)(__rand48_step(s, __seed48+3) >> 16);
}
long mrand48(void)
{
return jrand48(__seed48);
}
unsigned short *seed48(unsigned short *s)
{
static unsigned short p[3];
memcpy(p, __seed48, sizeof p);
memcpy(__seed48, s, sizeof p);
return p;
}
void srand48(long seed)
{
seed48((unsigned short [3]){ 0x330e, seed, seed>>16 });
}
| 3,982 | 102 | jart/cosmopolitan | false |
cosmopolitan/third_party/musl/crypt_des.internal.h | // clang-format off
#ifndef CRYPT_DES_H
#define CRYPT_DES_H
#include "libc/limits.h"
#include "libc/literal.h"
struct expanded_key {
uint32_t l[16], r[16];
};
_Hide void __des_setkey(const unsigned char *, struct expanded_key *);
_Hide void __do_des(uint32_t, uint32_t, uint32_t *, uint32_t *,
uint32_t, uint32_t, const struct expanded_key *);
#endif
| 377 | 17 | jart/cosmopolitan | false |
cosmopolitan/third_party/musl/crypt_md5.c | /*-*- mode:c;indent-tabs-mode:t;c-basic-offset:8;tab-width:8;coding:utf-8 -*-â
âvi: set et ft=c ts=8 tw=8 fenc=utf-8 :viâ
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ
â â
â Musl Libc â
â Copyright © 2005-2014 Rich Felker, et al. â
â â
â Permission is hereby granted, free of charge, to any person obtaining â
â a copy of this software and associated documentation files (the â
â "Software"), to deal in the Software without restriction, including â
â without limitation the rights to use, copy, modify, merge, publish, â
â distribute, sublicense, and/or sell copies of the Software, and to â
â permit persons to whom the Software is furnished to do so, subject to â
â the following conditions: â
â â
â The above copyright notice and this permission notice shall be â
â included in all copies or substantial portions of the Software. â
â â
â THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, â
â EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF â
â MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. â
â IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY â
â CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, â
â TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE â
â SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. â
â â
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ*/
#include "libc/mem/alg.h"
#include "libc/limits.h"
#include "libc/literal.h"
#include "libc/str/str.h"
#include "third_party/musl/crypt.internal.h"
#pragma GCC diagnostic ignored "-Wmissing-braces"
asm(".ident\t\"\\n\\n\
Musl libc (MIT License)\\n\
Copyright 2005-2014 Rich Felker, et. al.\"");
asm(".include \"libc/disclaimer.inc\"");
// clang-format off
/*
* md5 crypt implementation
*
* original md5 crypt design is from Poul-Henning Kamp
* this implementation was created based on the code in freebsd
* at least 32bit int is assumed, key is limited and $1$ prefix is mandatory,
* on error "*" is returned
*/
/* public domain md5 implementation based on rfc1321 and libtomcrypt */
struct md5 {
uint64_t len; /* processed message length */
uint32_t h[4]; /* hash state */
uint8_t buf[64]; /* message block buffer */
};
static uint32_t rol(uint32_t n, int k) { return (n << k) | (n >> (32-k)); }
#define F(x,y,z) (z ^ (x & (y ^ z)))
#define G(x,y,z) (y ^ (z & (y ^ x)))
#define H(x,y,z) (x ^ y ^ z)
#define I(x,y,z) (y ^ (x | ~z))
#define FF(a,b,c,d,w,s,t) a += F(b,c,d) + w + t; a = rol(a,s) + b
#define GG(a,b,c,d,w,s,t) a += G(b,c,d) + w + t; a = rol(a,s) + b
#define HH(a,b,c,d,w,s,t) a += H(b,c,d) + w + t; a = rol(a,s) + b
#define II(a,b,c,d,w,s,t) a += I(b,c,d) + w + t; a = rol(a,s) + b
static const uint32_t tab[64] = {
0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be, 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed, 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05, 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1, 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391
};
static void processblock(struct md5 *s, const uint8_t *buf)
{
uint32_t i, W[16], a, b, c, d;
for (i = 0; i < 16; i++) {
W[i] = buf[4*i];
W[i] |= (uint32_t)buf[4*i+1]<<8;
W[i] |= (uint32_t)buf[4*i+2]<<16;
W[i] |= (uint32_t)buf[4*i+3]<<24;
}
a = s->h[0];
b = s->h[1];
c = s->h[2];
d = s->h[3];
i = 0;
while (i < 16) {
FF(a,b,c,d, W[i], 7, tab[i]); i++;
FF(d,a,b,c, W[i], 12, tab[i]); i++;
FF(c,d,a,b, W[i], 17, tab[i]); i++;
FF(b,c,d,a, W[i], 22, tab[i]); i++;
}
while (i < 32) {
GG(a,b,c,d, W[(5*i+1)%16], 5, tab[i]); i++;
GG(d,a,b,c, W[(5*i+1)%16], 9, tab[i]); i++;
GG(c,d,a,b, W[(5*i+1)%16], 14, tab[i]); i++;
GG(b,c,d,a, W[(5*i+1)%16], 20, tab[i]); i++;
}
while (i < 48) {
HH(a,b,c,d, W[(3*i+5)%16], 4, tab[i]); i++;
HH(d,a,b,c, W[(3*i+5)%16], 11, tab[i]); i++;
HH(c,d,a,b, W[(3*i+5)%16], 16, tab[i]); i++;
HH(b,c,d,a, W[(3*i+5)%16], 23, tab[i]); i++;
}
while (i < 64) {
II(a,b,c,d, W[7*i%16], 6, tab[i]); i++;
II(d,a,b,c, W[7*i%16], 10, tab[i]); i++;
II(c,d,a,b, W[7*i%16], 15, tab[i]); i++;
II(b,c,d,a, W[7*i%16], 21, tab[i]); i++;
}
s->h[0] += a;
s->h[1] += b;
s->h[2] += c;
s->h[3] += d;
}
static void pad(struct md5 *s)
{
unsigned r = s->len % 64;
s->buf[r++] = 0x80;
if (r > 56) {
memset(s->buf + r, 0, 64 - r);
r = 0;
processblock(s, s->buf);
}
memset(s->buf + r, 0, 56 - r);
s->len *= 8;
s->buf[56] = s->len;
s->buf[57] = s->len >> 8;
s->buf[58] = s->len >> 16;
s->buf[59] = s->len >> 24;
s->buf[60] = s->len >> 32;
s->buf[61] = s->len >> 40;
s->buf[62] = s->len >> 48;
s->buf[63] = s->len >> 56;
processblock(s, s->buf);
}
static void md5_init(struct md5 *s)
{
s->len = 0;
s->h[0] = 0x67452301;
s->h[1] = 0xefcdab89;
s->h[2] = 0x98badcfe;
s->h[3] = 0x10325476;
}
static void md5_sum(struct md5 *s, uint8_t *md)
{
int i;
pad(s);
for (i = 0; i < 4; i++) {
md[4*i] = s->h[i];
md[4*i+1] = s->h[i] >> 8;
md[4*i+2] = s->h[i] >> 16;
md[4*i+3] = s->h[i] >> 24;
}
}
static void md5_update(struct md5 *s, const void *m, unsigned long len)
{
const uint8_t *p = m;
unsigned r = s->len % 64;
s->len += len;
if (r) {
if (len < 64 - r) {
memcpy(s->buf + r, p, len);
return;
}
memcpy(s->buf + r, p, 64 - r);
len -= 64 - r;
p += 64 - r;
processblock(s, s->buf);
}
for (; len >= 64; len -= 64, p += 64)
processblock(s, p);
memcpy(s->buf, p, len);
}
/*-
* Copyright (c) 2003 Poul-Henning Kamp
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/* key limit is not part of the original design, added for DoS protection */
#define KEY_MAX 30000
#define SALT_MAX 8
static const unsigned char b64[] =
"./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
static char *to64(char *s, unsigned int u, int n)
{
while (--n >= 0) {
*s++ = b64[u % 64];
u /= 64;
}
return s;
}
static char *md5crypt(const char *key, const char *setting, char *output)
{
struct md5 ctx;
unsigned char md[16];
unsigned int i, klen, slen;
const char *salt;
char *p;
/* reject large keys */
klen = strnlen(key, KEY_MAX+1);
if (klen > KEY_MAX)
return 0;
/* setting: $1$salt$ (closing $ is optional) */
if (strncmp(setting, "$1$", 3) != 0)
return 0;
salt = setting + 3;
for (i = 0; i < SALT_MAX && salt[i] && salt[i] != '$'; i++);
slen = i;
/* md5(key salt key) */
md5_init(&ctx);
md5_update(&ctx, key, klen);
md5_update(&ctx, salt, slen);
md5_update(&ctx, key, klen);
md5_sum(&ctx, md);
/* md5(key $1$ salt repeated-md weird-key[0]-0) */
md5_init(&ctx);
md5_update(&ctx, key, klen);
md5_update(&ctx, setting, 3 + slen);
for (i = klen; i > sizeof md; i -= sizeof md)
md5_update(&ctx, md, sizeof md);
md5_update(&ctx, md, i);
md[0] = 0;
for (i = klen; i; i >>= 1)
if (i & 1)
md5_update(&ctx, md, 1);
else
md5_update(&ctx, key, 1);
md5_sum(&ctx, md);
/* md = f(md, key, salt) iteration */
for (i = 0; i < 1000; i++) {
md5_init(&ctx);
if (i % 2)
md5_update(&ctx, key, klen);
else
md5_update(&ctx, md, sizeof md);
if (i % 3)
md5_update(&ctx, salt, slen);
if (i % 7)
md5_update(&ctx, key, klen);
if (i % 2)
md5_update(&ctx, md, sizeof md);
else
md5_update(&ctx, key, klen);
md5_sum(&ctx, md);
}
/* output is $1$salt$hash */
memcpy(output, setting, 3 + slen);
p = output + 3 + slen;
*p++ = '$';
static const unsigned char perm[][3] = {
0,6,12,1,7,13,2,8,14,3,9,15,4,10,5 };
for (i=0; i<5; i++) p = to64(p,
(md[perm[i][0]]<<16)|(md[perm[i][1]]<<8)|md[perm[i][2]], 4);
p = to64(p, md[11], 2);
*p = 0;
return output;
}
char *__crypt_md5(const char *key, const char *setting, char *output)
{
static const char testkey[] = "Xy01@#\x01\x02\x80\x7f\xff\r\n\x81\t !";
static const char testsetting[] = "$1$abcd0123$";
static const char testhash[] = "$1$abcd0123$9Qcg8DyviekV3tDGMZynJ1";
char testbuf[64];
char *p, *q;
p = md5crypt(key, setting, output);
/* self test and stack cleanup */
q = md5crypt(testkey, testsetting, testbuf);
if (!p || q != testbuf || memcmp(testbuf, testhash, sizeof testhash))
return "*";
return p;
}
| 11,042 | 325 | jart/cosmopolitan | false |
cosmopolitan/third_party/musl/ftw.c | /*-*- mode:c;indent-tabs-mode:t;c-basic-offset:8;tab-width:8;coding:utf-8 -*-â
âvi: set et ft=c ts=8 tw=8 fenc=utf-8 :viâ
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ
â â
â Musl Libc â
â Copyright © 2005-2014 Rich Felker, et al. â
â â
â Permission is hereby granted, free of charge, to any person obtaining â
â a copy of this software and associated documentation files (the â
â "Software"), to deal in the Software without restriction, including â
â without limitation the rights to use, copy, modify, merge, publish, â
â distribute, sublicense, and/or sell copies of the Software, and to â
â permit persons to whom the Software is furnished to do so, subject to â
â the following conditions: â
â â
â The above copyright notice and this permission notice shall be â
â included in all copies or substantial portions of the Software. â
â â
â THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, â
â EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF â
â MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. â
â IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY â
â CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, â
â TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE â
â SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. â
â â
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ*/
#include "third_party/musl/ftw.h"
asm(".ident\t\"\\n\\n\
Musl libc (MIT License)\\n\
Copyright 2005-2014 Rich Felker, et. al.\"");
asm(".include \"libc/disclaimer.inc\"");
/* clang-format off */
/**
* Walks file tree.
*
* @see examples/walk.c for example
* @see nftw()
*/
int ftw(const char *path, int (*fn)(const char *, const struct stat *, int), int fd_limit)
{
/* The following cast assumes that calling a function with one
* argument more than it needs behaves as expected. This is
* actually undefined, but works on all real-world machines. */
return nftw(path, (int (*)())fn, fd_limit, FTW_PHYS);
}
| 3,222 | 50 | jart/cosmopolitan | false |
cosmopolitan/third_party/musl/glob.c | /*-*- mode:c;indent-tabs-mode:t;c-basic-offset:8;tab-width:8;coding:utf-8 -*-â
âvi: set et ft=c ts=8 tw=8 fenc=utf-8 :viâ
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ
â â
â Musl Libc â
â Copyright © 2005-2014 Rich Felker, et al. â
â â
â Permission is hereby granted, free of charge, to any person obtaining â
â a copy of this software and associated documentation files (the â
â "Software"), to deal in the Software without restriction, including â
â without limitation the rights to use, copy, modify, merge, publish, â
â distribute, sublicense, and/or sell copies of the Software, and to â
â permit persons to whom the Software is furnished to do so, subject to â
â the following conditions: â
â â
â The above copyright notice and this permission notice shall be â
â included in all copies or substantial portions of the Software. â
â â
â THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, â
â EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF â
â MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. â
â IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY â
â CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, â
â TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE â
â SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. â
â â
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ*/
#include "libc/mem/alg.h"
#include "libc/calls/calls.h"
#include "libc/calls/struct/dirent.h"
#include "libc/calls/struct/stat.h"
#include "libc/errno.h"
#include "libc/mem/mem.h"
#include "libc/str/str.h"
#include "libc/sysv/consts/dt.h"
#include "libc/sysv/consts/s.h"
#include "third_party/musl/fnmatch.h"
#include "third_party/musl/glob.h"
#define MAXPATH 1024
asm(".ident\t\"\\n\\n\
Musl libc (MIT License)\\n\
Copyright 2005-2014 Rich Felker, et. al.\"");
asm(".include \"libc/disclaimer.inc\"");
struct GlobList {
struct GlobList *next;
char name[];
};
static int AppendGlob(struct GlobList **tail, const char *name, size_t len,
int mark) {
struct GlobList *new;
if ((new = malloc(sizeof(struct GlobList) + len + 2))) {
(*tail)->next = new;
new->next = NULL;
memcpy(new->name, name, len + 1);
if (mark && len && name[len - 1] != '/') {
new->name[len] = '/';
new->name[len + 1] = 0;
}
*tail = new;
return 0;
} else {
return -1;
}
}
static int PerformGlob(char *buf, size_t pos, int type, char *pat, int flags,
int (*errfunc)(const char *path, int err),
struct GlobList **tail) {
DIR *dir;
size_t l;
char *p, *p2;
char saved_sep;
ptrdiff_t i, j;
struct stat st;
struct dirent *de;
int r, readerr, in_bracket, overflow, old_errno, fnm_flags;
/* If GLOB_MARK is unused, we don't care about type. */
if (!type && !(flags & GLOB_MARK)) type = DT_REG;
/* Special-case the remaining pattern being all slashes, in
* which case we can use caller-passed type if it's a dir. */
if (*pat && type != DT_DIR) type = 0;
while (pos + 1 < MAXPATH && *pat == '/') {
buf[pos++] = *pat++;
}
/* Consume maximal [escaped-]literal prefix of pattern, copying
* and un-escaping it to the running buffer as we go. */
i = 0;
j = 0;
overflow = 0;
in_bracket = 0;
for (; pat[i] != '*' && pat[i] != '?' && (!in_bracket || pat[i] != ']');
i++) {
if (!pat[i]) {
if (overflow) return 0;
pat += i;
pos += j;
i = j = 0;
break;
} else if (pat[i] == '[') {
in_bracket = 1;
} else if (pat[i] == '\\' && !(flags & GLOB_NOESCAPE)) {
/* Backslashes inside a bracket are (at least by
* our interpretation) non-special, so if next
* char is ']' we have a complete expression. */
if (in_bracket && pat[i + 1] == ']') break;
/* Unpaired final backslash never matches. */
if (!pat[i + 1]) return 0;
i++;
}
if (pat[i] == '/') {
if (overflow) return 0;
in_bracket = 0;
pat += i + 1;
i = -1;
pos += j + 1;
j = -1;
}
/* Only store a character if it fits in the buffer, but if
* a potential bracket expression is open, the overflow
* must be remembered and handled later only if the bracket
* is unterminated (and thereby a literal), so as not to
* disallow long bracket expressions with short matches. */
if (pos + (j + 1) < MAXPATH) {
buf[pos + j++] = pat[i];
} else if (in_bracket) {
overflow = 1;
} else {
return 0;
}
/* If we consume any new components, the caller-passed type
* or dummy type from above is no longer valid. */
type = 0;
}
buf[pos] = 0;
if (!*pat) {
/* If we consumed any components above, or if GLOB_MARK is
* requested and we don't yet know if the match is a dir,
* we must call stat to confirm the file exists and/or
* determine its type. */
if ((flags & GLOB_MARK) && type == DT_LNK) type = 0;
if (!type && stat(buf, &st)) {
if (errno != ENOENT && (errfunc(buf, errno) || (flags & GLOB_ERR))) {
return GLOB_ABORTED;
}
return 0;
}
if (!type && S_ISDIR(st.st_mode)) type = DT_DIR;
if (AppendGlob(tail, buf, pos, (flags & GLOB_MARK) && type == DT_DIR)) {
return GLOB_NOSPACE;
}
return 0;
}
p2 = strchr(pat, '/');
saved_sep = '/';
/* Check if the '/' was escaped and, if so, remove the escape char
* so that it will not be unpaired when passed to fnmatch. */
if (p2 && !(flags & GLOB_NOESCAPE)) {
for (p = p2; p > pat && p[-1] == '\\'; p--)
;
if ((p2 - p) % 2) {
p2--;
saved_sep = '\\';
}
}
dir = opendir(pos ? buf : ".");
if (!dir) {
if (errfunc(buf, errno) || (flags & GLOB_ERR)) return GLOB_ABORTED;
return 0;
}
old_errno = errno;
while (errno = 0, de = readdir(dir)) {
/* Quickly skip non-directories when there's pattern left. */
if (p2 && de->d_type && de->d_type != DT_DIR && de->d_type != DT_LNK) {
continue;
}
l = strlen(de->d_name);
if (l >= MAXPATH - pos) continue;
if (p2) *p2 = 0;
fnm_flags = ((flags & GLOB_NOESCAPE) ? FNM_NOESCAPE : 0) |
((!(flags & GLOB_PERIOD)) ? FNM_PERIOD : 0);
if (fnmatch(pat, de->d_name, fnm_flags)) continue;
/* With GLOB_PERIOD don't allow matching . or .. unless fnmatch()
* would match them with FNM_PERIOD rules in effect. */
if (p2 && (flags & GLOB_PERIOD) && de->d_name[0] == '.' &&
(!de->d_name[1] || de->d_name[1] == '.' && !de->d_name[2]) &&
fnmatch(pat, de->d_name, fnm_flags | FNM_PERIOD)) {
continue;
}
memcpy(buf + pos, de->d_name, l + 1);
if (p2) *p2 = saved_sep;
r = PerformGlob(buf, pos + l, de->d_type, p2 ? p2 : "", flags, errfunc,
tail);
if (r) {
closedir(dir);
return r;
}
}
readerr = errno;
if (p2) *p2 = saved_sep;
closedir(dir);
if (readerr && (errfunc(buf, errno) || (flags & GLOB_ERR))) {
return GLOB_ABORTED;
}
errno = old_errno;
return 0;
}
static int IgnoreGlobError(const char *path, int err) {
return 0;
}
static void FreeGlobList(struct GlobList *head) {
struct GlobList *match, *next;
for (match = head->next; match; match = next) {
next = match->next;
free(match);
}
}
static int GlobPredicate(const void *a, const void *b) {
return strcmp(*(const char **)a, *(const char **)b);
}
/**
* Finds pathnames matching pattern.
*
* For example:
*
* glob_t g = {.gl_offs = 2};
* glob("*.*", GLOB_DOOFFS, NULL, &g);
* glob("../.*", GLOB_DOOFFS | GLOB_APPEND, NULL, &g);
* g.gl_pathv[0] = "ls";
* g.gl_pathv[1] = "-l";
* execvp("ls", &g.gl_pathv[0]);
* globfree(g);
*
* @param pat can have star wildcard see fnmatch()
* @param g will receive matching entries and needs globfree()
* @return 0 on success or GLOB_NOMATCH, GLOB_NOSPACE on OOM, or
* GLOB_ABORTED on read error
*/
int glob(const char *pat, int flags, int errfunc(const char *path, int err),
glob_t *g) {
int error = 0;
size_t cnt, i;
char *p, **pathv, buf[MAXPATH];
struct GlobList head = {.next = NULL}, *tail = &head;
size_t offs = (flags & GLOB_DOOFFS) ? g->gl_offs : 0;
if (!errfunc) errfunc = IgnoreGlobError;
if (!(flags & GLOB_APPEND)) {
g->gl_offs = offs;
g->gl_pathc = 0;
g->gl_pathv = NULL;
}
if (*pat) {
char *p = strdup(pat);
if (!p) return GLOB_NOSPACE;
buf[0] = 0;
error = PerformGlob(buf, 0, 0, p, flags, errfunc, &tail);
free(p);
}
if (error == GLOB_NOSPACE) {
FreeGlobList(&head);
return error;
}
for (cnt = 0, tail = head.next; tail; tail = tail->next, cnt++)
;
if (!cnt) {
if (flags & GLOB_NOCHECK) {
tail = &head;
if (AppendGlob(&tail, pat, strlen(pat), 0)) {
return GLOB_NOSPACE;
}
cnt++;
} else
return GLOB_NOMATCH;
}
if (flags & GLOB_APPEND) {
pathv =
realloc(g->gl_pathv, (offs + g->gl_pathc + cnt + 1) * sizeof(char *));
if (!pathv) {
FreeGlobList(&head);
return GLOB_NOSPACE;
}
g->gl_pathv = pathv;
offs += g->gl_pathc;
} else {
g->gl_pathv = malloc((offs + cnt + 1) * sizeof(char *));
if (!g->gl_pathv) {
FreeGlobList(&head);
return GLOB_NOSPACE;
}
for (i = 0; i < offs; i++) {
g->gl_pathv[i] = NULL;
}
}
for (i = 0, tail = head.next; i < cnt; tail = tail->next, i++) {
g->gl_pathv[offs + i] = tail->name;
}
g->gl_pathv[offs + i] = NULL;
g->gl_pathc += cnt;
if (!(flags & GLOB_NOSORT)) {
qsort(g->gl_pathv + offs, cnt, sizeof(char *), GlobPredicate);
}
return error;
}
/**
* Frees entries allocated by glob().
*/
void globfree(glob_t *g) {
size_t i;
for (i = 0; i < g->gl_pathc; i++) {
free(g->gl_pathv[g->gl_offs + i] - offsetof(struct GlobList, name));
}
free(g->gl_pathv);
g->gl_pathc = 0;
g->gl_pathv = NULL;
}
| 11,180 | 324 | jart/cosmopolitan | false |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.