mm/slab.c



1da177e4c3f4


183ff22bb6bd
1da177e4c3f4


a737b3e2fcf9
1da177e4c3f4


343e0d7a9395
1da177e4c3f4


18004c5d4084
1da177e4c3f4


e498be7dafd7


1da177e4c3f4

1da177e4c3f4

c9cf55285e87
1da177e4c3f4


101a50019ae5
a0ec95a8e697
1da177e4c3f4


543537bd9226
138ae6631a3d
e498be7dafd7
d5cff635290a
dc85da15d42b
fc0abb1451c6
8a8b6502fb66
e7eebaf6a81b
6a2d7a955d8d
3ac7fe5a4aab
c175eea466e7
8f9f8d9e8080
268bb0ce3e87
1da177e4c3f4
381760eadc39

1da177e4c3f4


4dee6b64ee7c

072bb0aa5e06

b9ce5ef49f00

1da177e4c3f4
50953fe9e00e
1da177e4c3f4


1da177e4c3f4

87a927c71578
1da177e4c3f4
1da177e4c3f4


072bb0aa5e06


1da177e4c3f4


fa5b08d5f818
1da177e4c3f4

871751e25d95

1da177e4c3f4
1da177e4c3f4
1da177e4c3f4


1da177e4c3f4

b28a02de8c70
343e0d7a9395
b28a02de8c70
1da177e4c3f4


5bfe53a77e8a


1da177e4c3f4

1da177e4c3f4


e498be7dafd7
bda5b655fe66
a737b3e2fcf9


072bb0aa5e06


a737b3e2fcf9
1da177e4c3f4

072bb0aa5e06


a737b3e2fcf9


1da177e4c3f4


b28a02de8c70
1da177e4c3f4


e498be7dafd7
1da177e4c3f4

b28a02de8c70


b28a02de8c70
2e1217cf96b5
b28a02de8c70


35386e3b0f87

1da177e4c3f4

e498be7dafd7


556a169dab38
68a1b1955957
e498be7dafd7
556a169dab38

e498be7dafd7
ed11d9eb2228


83b519e8b957
65f27f38446e
ed11d9eb2228
e498be7dafd7
a737b3e2fcf9

e498be7dafd7
7243cc05bafd
e498be7dafd7
5ec8a847bb8a

e498be7dafd7


1c61fc40fc26
e498be7dafd7
5ec8a847bb8a
7243cc05bafd
5ec8a847bb8a
e498be7dafd7


e0a42726794f

e498be7dafd7

1da177e4c3f4
5295a74cc0bc
e498be7dafd7


2e1217cf96b5
e498be7dafd7


a737b3e2fcf9


e498be7dafd7

a737b3e2fcf9

e498be7dafd7


1da177e4c3f4
1da177e4c3f4


a737b3e2fcf9


1da177e4c3f4
dc6f3f276e2b
1da177e4c3f4


ed11d9eb2228
a737b3e2fcf9


1da177e4c3f4

e498be7dafd7
fb7faf3313d5
a737b3e2fcf9


1da177e4c3f4


4e60c86bd9e5
1da177e4c3f4


e498be7dafd7
fb7faf3313d5
a737b3e2fcf9
1da177e4c3f4


1da177e4c3f4
a737b3e2fcf9

1da177e4c3f4
3dafccf22751
1da177e4c3f4

3dafccf22751
1da177e4c3f4
3dafccf22751
3b0efdfa1e71

a737b3e2fcf9
1da177e4c3f4
343e0d7a9395
1da177e4c3f4
3dafccf22751
1da177e4c3f4

b46b8f19c9cd
1da177e4c3f4

b46b8f19c9cd

1da177e4c3f4

b46b8f19c9cd
1da177e4c3f4


3b0efdfa1e71
b46b8f19c9cd
87a927c71578
3b0efdfa1e71
b46b8f19c9cd
1da177e4c3f4

343e0d7a9395
1da177e4c3f4

3b0efdfa1e71
1da177e4c3f4


3dafccf22751
b46b8f19c9cd

1da177e4c3f4


3df1cccdfb3f

1da177e4c3f4
543585cc5b07


3df1cccdfb3f
1da177e4c3f4
6ed5eb221120

b49af68ff9fc
350260889b25
6ed5eb221120


b49af68ff9fc
350260889b25


6ed5eb221120

8fea4e96a8f2


3b0efdfa1e71
8fea4e96a8f2

6a2d7a955d8d
3b0efdfa1e71


6a2d7a955d8d


8fea4e96a8f2
6a2d7a955d8d

8fea4e96a8f2

a737b3e2fcf9


1da177e4c3f4


b28a02de8c70
1da177e4c3f4


1da177e4c3f4
b28a02de8c70
1da177e4c3f4

9b030cb865f1
b28a02de8c70


3b0efdfa1e71
b28a02de8c70
1da177e4c3f4

056c62418cc6

f1aaee53f287


056c62418cc6


f1aaee53f287
056c62418cc6


83835b3d9aec


ce79ddc8e237
f1aaee53f287
056c62418cc6

97d06609158e
ce79ddc8e237


ce79ddc8e237
ce79ddc8e237


00afa758067a
83835b3d9aec


f1aaee53f287

ce79ddc8e237
6ccfb5bcf52b


ce79ddc8e237


f1aaee53f287
ce79ddc8e237


056c62418cc6
f1aaee53f287

83835b3d9aec
6ccfb5bcf52b


83835b3d9aec


f1aaee53f287

1871e52c76dd
1da177e4c3f4
343e0d7a9395
1da177e4c3f4


a737b3e2fcf9

1da177e4c3f4


b28a02de8c70


c7e43c78ae4d
1da177e4c3f4
6cb8f91320d3


1da177e4c3f4


0abf40c1ac3f
1da177e4c3f4


4b51d6698921
1da177e4c3f4

4b51d6698921
1da177e4c3f4


b221385bc41d
97e2bde47f88


97e2bde47f88
fbaccacff1f1
1da177e4c3f4
fbaccacff1f1

1da177e4c3f4
a737b3e2fcf9


fbaccacff1f1


1da177e4c3f4
fbaccacff1f1


1da177e4c3f4

f28510d30c7f
d40cee245ff6
1da177e4c3f4
a737b3e2fcf9

1da177e4c3f4

b28a02de8c70
1da177e4c3f4
645df230cacc
1da177e4c3f4
f28510d30c7f
1da177e4c3f4
3395ee058879


3df1cccdfb3f


8fce4d8e3b9e


1871e52c76dd
8fce4d8e3b9e


7d6e6d09de82
8fce4d8e3b9e
442295c94bf6
8fce4d8e3b9e
1871e52c76dd
8fce4d8e3b9e


909ea9646809
8fce4d8e3b9e
8fce4d8e3b9e


909ea9646809
8fce4d8e3b9e


1da177e4c3f4


897e679b1746
1da177e4c3f4
1871e52c76dd
1da177e4c3f4


52bad64d95bd
8fce4d8e3b9e
203b42f73174
2b2842146cb4

1da177e4c3f4


e498be7dafd7
83b519e8b957
1da177e4c3f4
b28a02de8c70
1da177e4c3f4

83b519e8b957
d5cff635290a

25985edcedea
d5cff635290a


1da177e4c3f4


e498be7dafd7
1da177e4c3f4


072bb0aa5e06


381760eadc39
072bb0aa5e06


d014dc2ed4fa
072bb0aa5e06


30c29bea6af2
072bb0aa5e06


381760eadc39


072bb0aa5e06


30c29bea6af2
072bb0aa5e06


381760eadc39


072bb0aa5e06


3ded175a4b7a


732eacc0542d
3ded175a4b7a


3ded175a4b7a


765c4507af71


83b519e8b957
765c4507af71


8b98c1699eba
765c4507af71


8b98c1699eba
c61afb181c64
dc85da15d42b
83b519e8b957
e498be7dafd7

8ef8286689c6
e498be7dafd7


f3186a9c51ea
e498be7dafd7

f3186a9c51ea
e498be7dafd7
83b519e8b957
e498be7dafd7
cc550defe979
e498be7dafd7


5295a74cc0bc
e498be7dafd7


e498be7dafd7
b28a02de8c70
e498be7dafd7


343e0d7a9395
5295a74cc0bc
e498be7dafd7


e00946fe2351


693f7d362055

e00946fe2351
ff69416e6323
e498be7dafd7


8fce4d8e3b9e


909ea9646809
8fce4d8e3b9e


e00946fe2351

8fce4d8e3b9e


a737b3e2fcf9

e498be7dafd7
b28a02de8c70
e498be7dafd7


4484ebf12bdb
e498be7dafd7


729bd0b74ce9
873623dfabaa
729bd0b74ce9


1ca4cb2418c0

7d6e6d09de82
729bd0b74ce9


62918a036148
729bd0b74ce9

1ca4cb2418c0
729bd0b74ce9


873623dfabaa
729bd0b74ce9


072bb0aa5e06
729bd0b74ce9


e498be7dafd7

8f9f8d9e8080


18004c5d4084
8f9f8d9e8080


18004c5d4084
8f9f8d9e8080


18004c5d4084
8f9f8d9e8080


fbf1e473bd0e


7d6e6d09de82
a70f73028201
fbf1e473bd0e
18004c5d4084
fbf1e473bd0e


fbf1e473bd0e
fbf1e473bd0e


58463c1fe25f
fbf1e473bd0e


18004c5d4084
fbf1e473bd0e


1da177e4c3f4
343e0d7a9395
e498be7dafd7
7d6e6d09de82
8f9f8d9e8080
1da177e4c3f4
fbf1e473bd0e


8f9f8d9e8080


fbf1e473bd0e


18004c5d4084
fbf1e473bd0e


83b519e8b957
fbf1e473bd0e


83b519e8b957
12d00f6a1218

1da177e4c3f4
12d00f6a1218
fbf1e473bd0e

83b519e8b957
12d00f6a1218


fbf1e473bd0e
12d00f6a1218
fbf1e473bd0e


4484ebf12bdb
fbf1e473bd0e


1da177e4c3f4
fbf1e473bd0e


83835b3d9aec

6ccfb5bcf52b


fbf1e473bd0e
ce79ddc8e237

fbf1e473bd0e

12d00f6a1218
fbf1e473bd0e


fbf1e473bd0e

18004c5d4084
fbf1e473bd0e
18004c5d4084
1da177e4c3f4

8bb7844286fb
1da177e4c3f4


5830c5902138
8bb7844286fb
5830c5902138
18004c5d4084
5830c5902138


afe2c511fb2d
5830c5902138
1871e52c76dd
5830c5902138

8bb7844286fb
5830c5902138

1da177e4c3f4
8bb7844286fb
4484ebf12bdb


183ff22bb6bd
8f5be20bf87d
1da177e4c3f4
8bb7844286fb
18004c5d4084
fbf1e473bd0e
18004c5d4084
1da177e4c3f4
1da177e4c3f4
eac4068013a0
1da177e4c3f4

74b85f3790aa


1da177e4c3f4
8f9f8d9e8080


18004c5d4084
8f9f8d9e8080


18004c5d4084
8f9f8d9e8080


18004c5d4084
8f9f8d9e8080
18004c5d4084
8f9f8d9e8080

18004c5d4084
8f9f8d9e8080
18004c5d4084
8f9f8d9e8080


5fda1bd5b886
8f9f8d9e8080


e498be7dafd7


8f9f8d9e8080

e498be7dafd7


83b519e8b957
e498be7dafd7

e498be7dafd7
2b2d5493e100


e498be7dafd7

e498be7dafd7

a737b3e2fcf9
556a169dab38


3c58346525d8


a737b3e2fcf9

1da177e4c3f4


1da177e4c3f4

e498be7dafd7

9b030cb865f1
3c58346525d8
9b030cb865f1
b6e68bc1baed
62918a036148

3c58346525d8
e498be7dafd7
3c58346525d8
9b030cb865f1
1da177e4c3f4


3df1cccdfb3f

1da177e4c3f4
3df1cccdfb3f
543585cc5b07
1da177e4c3f4
1da177e4c3f4

9b030cb865f1


e498be7dafd7


1da177e4c3f4
343e0d7a9395
e498be7dafd7


9b030cb865f1
1da177e4c3f4
9b030cb865f1
e498be7dafd7

1da177e4c3f4

9b030cb865f1
1da177e4c3f4
8da3430d8a7f
b56efcf0a45a
8da3430d8a7f
2f9baa9fcf8d


1da177e4c3f4


a737b3e2fcf9


e498be7dafd7

45530c4474d2


e498be7dafd7
e0a42726794f

1da177e4c3f4
e498be7dafd7

1da177e4c3f4


e498be7dafd7

45530c4474d2


4b51d6698921
45530c4474d2


4b51d6698921
1da177e4c3f4


2b2d5493e100
e498be7dafd7
83b519e8b957
e498be7dafd7
9b030cb865f1
b28a02de8c70
2b2d5493e100


9b030cb865f1
e498be7dafd7
83b519e8b957
e498be7dafd7
9a2dba4b4912
b28a02de8c70
9a2dba4b4912
b28a02de8c70
2b2d5493e100


e498be7dafd7
b28a02de8c70
1da177e4c3f4
e498be7dafd7

1ca4cb2418c0

9c09a95cf431
9b030cb865f1
556a169dab38
e498be7dafd7
1ca4cb2418c0
e498be7dafd7


1ca4cb2418c0
e498be7dafd7


1da177e4c3f4
97d06609158e
8429db5c6336


97d06609158e
52cef189165d
8429db5c6336
18004c5d4084

8429db5c6336

18004c5d4084
056c62418cc6
947ca1856a7e


97d06609158e


a737b3e2fcf9


1da177e4c3f4

1da177e4c3f4
8f9f8d9e8080


a737b3e2fcf9


1da177e4c3f4


a737b3e2fcf9

1da177e4c3f4
e498be7dafd7
a737b3e2fcf9
a164f89628fa

97d06609158e
1da177e4c3f4

1da177e4c3f4

8bdec192b40c


3b0efdfa1e71
8bdec192b40c


1da177e4c3f4


343e0d7a9395
1da177e4c3f4

e1b6aa6f1404
1da177e4c3f4

d6fef9da19b7
e1b6aa6f1404


d6fef9da19b7
e1b6aa6f1404
d6fef9da19b7
765c4507af71
a618e89f1e6f
e12ba74d8ff3

e1b6aa6f1404
517d08699b25
8bdec192b40c


1da177e4c3f4
8bdec192b40c
1da177e4c3f4
b37f1dd0f543
072bb0aa5e06


e1b6aa6f1404
1da177e4c3f4
972d1a7b1405


072bb0aa5e06
e1b6aa6f1404
c175eea466e7
072bb0aa5e06


1f458cbf1222
072bb0aa5e06
b1eeab67682a


c175eea466e7
e1b6aa6f1404
1da177e4c3f4


343e0d7a9395
1da177e4c3f4
b28a02de8c70
1da177e4c3f4


b1eeab67682a
c175eea466e7
972d1a7b1405


1da177e4c3f4
f205b2fe62d3
072bb0aa5e06
f205b2fe62d3
1da177e4c3f4

1f458cbf1222

1da177e4c3f4

d79923fad95b
1da177e4c3f4


b28a02de8c70
343e0d7a9395
1da177e4c3f4


343e0d7a9395
b28a02de8c70
1da177e4c3f4
8c138bc00925
1da177e4c3f4
3dafccf22751
1da177e4c3f4
b28a02de8c70
1da177e4c3f4

b28a02de8c70


1da177e4c3f4


b28a02de8c70
1da177e4c3f4


b28a02de8c70
1da177e4c3f4


343e0d7a9395
1da177e4c3f4
8c138bc00925
3dafccf22751
1da177e4c3f4

b28a02de8c70
1da177e4c3f4


aa83aa40ed2a


fdde6abb3e8d
aa83aa40ed2a


aa83aa40ed2a
fdde6abb3e8d

aa83aa40ed2a


1da177e4c3f4


343e0d7a9395
1da177e4c3f4


b46b8f19c9cd
a737b3e2fcf9

1da177e4c3f4


a737b3e2fcf9
1da177e4c3f4
a737b3e2fcf9
1da177e4c3f4

3dafccf22751
8c138bc00925
b28a02de8c70
1da177e4c3f4

b28a02de8c70

1da177e4c3f4


343e0d7a9395
1da177e4c3f4


3dafccf22751
8c138bc00925
1da177e4c3f4
b28a02de8c70
1da177e4c3f4
b28a02de8c70
1da177e4c3f4


b28a02de8c70
face37f5e615

1da177e4c3f4


b28a02de8c70
1da177e4c3f4
b28a02de8c70

1da177e4c3f4


6ed5eb221120
8fea4e96a8f2
1da177e4c3f4
8fea4e96a8f2
1da177e4c3f4
8fea4e96a8f2
3dafccf22751
1da177e4c3f4
b28a02de8c70
1da177e4c3f4

b28a02de8c70
8fea4e96a8f2
3dafccf22751
1da177e4c3f4
b28a02de8c70
1da177e4c3f4


12dd36faec5d
e79aec291da5
1da177e4c3f4
1da177e4c3f4

8fea4e96a8f2
1da177e4c3f4


3b0efdfa1e71
a737b3e2fcf9
b28a02de8c70
3b0efdfa1e71
1da177e4c3f4


b28a02de8c70
1da177e4c3f4

b28a02de8c70
1da177e4c3f4
1da177e4c3f4
12dd36faec5d
1da177e4c3f4
e79aec291da5
12dd36faec5d
12dd36faec5d
1da177e4c3f4

911851e6ee6a


12dd36faec5d
a737b3e2fcf9

12dd36faec5d
343e0d7a9395
12dd36faec5d


e79aec291da5
1da177e4c3f4


b28a02de8c70
1da177e4c3f4


873623dfabaa

1da177e4c3f4


a70773ddb96b


4d268eba1187


a737b3e2fcf9
ee13d785eac1
4d268eba1187
b1ab41c49430
4d268eba1187
9888e6fa7b68
4d268eba1187
0aa817f078b6
4d268eba1187


9888e6fa7b68
4d268eba1187

9888e6fa7b68
b1ab41c49430


4d268eba1187
9888e6fa7b68
4d268eba1187
9888e6fa7b68
4d268eba1187


f78bb8ad4822


4d268eba1187


543585cc5b07
4d268eba1187

9888e6fa7b68


a737b3e2fcf9
4d268eba1187


83b519e8b957
f30cf7d13eee
97d06609158e
83b519e8b957
2ed3a4ef95ef
97d06609158e
f30cf7d13eee
2f9baa9fcf8d


f30cf7d13eee


2f9baa9fcf8d
f30cf7d13eee


97d06609158e
f30cf7d13eee
97d06609158e
f30cf7d13eee
2f9baa9fcf8d
f30cf7d13eee
83b519e8b957
f30cf7d13eee
97d06609158e
f30cf7d13eee
97d06609158e
f30cf7d13eee

556a169dab38
f30cf7d13eee

eb91f1d0a531
f30cf7d13eee


7d6e6d09de82
f30cf7d13eee


2ed3a4ef95ef
f30cf7d13eee

4d268eba1187
039363f38bfe
a755b76ab4ce
1da177e4c3f4
1da177e4c3f4


20c2df83d25c
1da177e4c3f4
1da177e4c3f4


1da177e4c3f4


278b1bb13136
8a13a4cc80bb
1da177e4c3f4

83b519e8b957
278b1bb13136
8a13a4cc80bb
1da177e4c3f4
1da177e4c3f4
1da177e4c3f4


87a927c71578

b28a02de8c70
1da177e4c3f4


1da177e4c3f4
a737b3e2fcf9

1da177e4c3f4


b28a02de8c70


1da177e4c3f4

ca5f9703dffa
87a927c71578


ca5f9703dffa
87a927c71578


ca5f9703dffa
a44b56d354b4
8a13a4cc80bb

1da177e4c3f4
3ff84a7f3655

a44b56d354b4
a737b3e2fcf9
ca5f9703dffa
1da177e4c3f4
8a13a4cc80bb
1da177e4c3f4
83b519e8b957


3c58346525d8
1da177e4c3f4
1da177e4c3f4
ca5f9703dffa


1da177e4c3f4
1da177e4c3f4
3ff84a7f3655

1da177e4c3f4

ca5f9703dffa
87a927c71578

1da177e4c3f4
87a927c71578


1da177e4c3f4

b28a02de8c70
608da7e3fc72


1da177e4c3f4


e0a42726794f


e7cb55b946a2

e0a42726794f
e7cb55b946a2

1da177e4c3f4


8a13a4cc80bb
1da177e4c3f4
8a13a4cc80bb
1da177e4c3f4
8a13a4cc80bb
278b1bb13136
1da177e4c3f4
b28a02de8c70
8a13a4cc80bb
1da177e4c3f4


b28a02de8c70

6746136520cd


1da177e4c3f4


8a13a4cc80bb

b28a02de8c70
1da177e4c3f4

a618e89f1e6f
4b51d6698921
a618e89f1e6f
3b0efdfa1e71
6a2d7a955d8d
1da177e4c3f4
e5ac9c5aec7c
b2d550736f8b
e5ac9c5aec7c


6cb8f91320d3
e5ac9c5aec7c
1da177e4c3f4
278b1bb13136

12c3667fb780
278b1bb13136
2ed3a4ef95ef
1da177e4c3f4
83835b3d9aec


6ccfb5bcf52b

83835b3d9aec
278b1bb13136
1da177e4c3f4
1da177e4c3f4


343e0d7a9395
1da177e4c3f4


7d6e6d09de82
1da177e4c3f4

e498be7dafd7
343e0d7a9395
e498be7dafd7


1da177e4c3f4


e498be7dafd7
1da177e4c3f4

aab2207cf8d9


1da177e4c3f4

a737b3e2fcf9
1da177e4c3f4
7d6e6d09de82
1da177e4c3f4

9a2dba4b4912
ff69416e6323


1da177e4c3f4


343e0d7a9395
1da177e4c3f4
e498be7dafd7


15c8b6c1aaaf
1da177e4c3f4
b28a02de8c70
e498be7dafd7
a4523a8b3808


aab2207cf8d9
e498be7dafd7
1da177e4c3f4

ed11d9eb2228


1da177e4c3f4
ed11d9eb2228

1da177e4c3f4
1da177e4c3f4
ed11d9eb2228

1da177e4c3f4
ed11d9eb2228
e498be7dafd7
ed11d9eb2228


1da177e4c3f4
ed11d9eb2228
1da177e4c3f4
40094fa65238
1da177e4c3f4

ed11d9eb2228


e498be7dafd7
ed11d9eb2228

1da177e4c3f4
ed11d9eb2228

1da177e4c3f4

18004c5d4084
343e0d7a9395
e498be7dafd7


ed11d9eb2228


e498be7dafd7


1da177e4c3f4


343e0d7a9395
1da177e4c3f4
8f5be20bf87d
40094fa65238
1da177e4c3f4
95402b382901
18004c5d4084
8f5be20bf87d
18004c5d4084
95402b382901
8f5be20bf87d
1da177e4c3f4


945cf2b6199b
1da177e4c3f4
12c3667fb780


1da177e4c3f4
12c3667fb780

1da177e4c3f4
12c3667fb780

1da177e4c3f4
12c3667fb780


1da177e4c3f4
1da177e4c3f4
e5ac9c5aec7c


343e0d7a9395
5b74ada7eea1

1da177e4c3f4

b28a02de8c70
1da177e4c3f4

5b74ada7eea1
8759ec50a6ca
d5cff635290a


c017b4be3e84

1da177e4c3f4


b28a02de8c70
1da177e4c3f4


b28a02de8c70
5b74ada7eea1
e51bfd0ad106
1da177e4c3f4


b28a02de8c70
1da177e4c3f4

343e0d7a9395
a35afb830f8d
1da177e4c3f4


8fea4e96a8f2
1da177e4c3f4


a737b3e2fcf9


1da177e4c3f4

51cc50685a42
1da177e4c3f4


b28a02de8c70
1da177e4c3f4

b28a02de8c70
1da177e4c3f4
3b0efdfa1e71
a737b3e2fcf9
b28a02de8c70
3b0efdfa1e71
1da177e4c3f4

51cc50685a42
1da177e4c3f4
b28a02de8c70
1da177e4c3f4
b28a02de8c70
1da177e4c3f4

343e0d7a9395
1da177e4c3f4
4b51d6698921

a618e89f1e6f
4b51d6698921
a618e89f1e6f
4b51d6698921
1da177e4c3f4

a737b3e2fcf9

78d382d77c84
8fea4e96a8f2
78d382d77c84


a737b3e2fcf9

78d382d77c84
8fea4e96a8f2
78d382d77c84


871751e25d95
78d382d77c84
a737b3e2fcf9
78d382d77c84


4776874ff096


ccd35fb9f4da
4776874ff096


1da177e4c3f4
4776874ff096
1da177e4c3f4

4776874ff096
84097518d1ec
4776874ff096
84097518d1ec
4776874ff096

1da177e4c3f4
350260889b25

1da177e4c3f4
4776874ff096
1da177e4c3f4


3c517a613209

1da177e4c3f4
b28a02de8c70
b28a02de8c70

e498be7dafd7
1da177e4c3f4
a737b3e2fcf9


1da177e4c3f4
6cb062296f73

1da177e4c3f4
2e1217cf96b5
1da177e4c3f4
2e1217cf96b5

1da177e4c3f4

2e1217cf96b5


1da177e4c3f4
2e1217cf96b5
1da177e4c3f4


a737b3e2fcf9


e498be7dafd7
3c517a613209
b8c1c5da1520
a737b3e2fcf9
1da177e4c3f4


3c517a613209
6cb062296f73
a737b3e2fcf9
1da177e4c3f4

4776874ff096
1da177e4c3f4
a35afb830f8d
1da177e4c3f4


e498be7dafd7
1da177e4c3f4

e498be7dafd7
1da177e4c3f4
e498be7dafd7

1da177e4c3f4
a737b3e2fcf9
1da177e4c3f4
a737b3e2fcf9
1da177e4c3f4


1da177e4c3f4


1da177e4c3f4

b28a02de8c70

1da177e4c3f4
1da177e4c3f4

58ce1fd58056

b46b8f19c9cd
58ce1fd58056


b46b8f19c9cd
58ce1fd58056


343e0d7a9395
7c0cb9c64f83
1da177e4c3f4


80cbd911ca25

3dafccf22751
1da177e4c3f4
b49af68ff9fc
1da177e4c3f4
350260889b25
1da177e4c3f4

58ce1fd58056
1da177e4c3f4


7c0cb9c64f83
1da177e4c3f4
8fea4e96a8f2
1da177e4c3f4

8fea4e96a8f2
1da177e4c3f4
871751e25d95


1da177e4c3f4

3b0efdfa1e71
7c0cb9c64f83
b28a02de8c70
3b0efdfa1e71
1da177e4c3f4


343e0d7a9395
1da177e4c3f4


b28a02de8c70
1da177e4c3f4


a737b3e2fcf9

face37f5e615


fdde6abb3e8d


1da177e4c3f4


072bb0aa5e06

1da177e4c3f4


1ca4cb2418c0

1da177e4c3f4
7d6e6d09de82
072bb0aa5e06


9a2dba4b4912
1da177e4c3f4

a737b3e2fcf9


1da177e4c3f4


1ca4cb2418c0
e498be7dafd7


1da177e4c3f4
3ded175a4b7a
44b57f1cc72a

3ded175a4b7a
44b57f1cc72a
3ded175a4b7a
1da177e4c3f4


714b8171af9c


249b9f331ec1
714b8171af9c
1da177e4c3f4
1da177e4c3f4


072bb0aa5e06

1da177e4c3f4


a737b3e2fcf9
1da177e4c3f4
a737b3e2fcf9
e498be7dafd7
1da177e4c3f4


072bb0aa5e06
3c517a613209
e498be7dafd7
a737b3e2fcf9
9a2dba4b4912
51cd8e6ff265
072bb0aa5e06


1da177e4c3f4

a737b3e2fcf9
1da177e4c3f4


072bb0aa5e06

1da177e4c3f4

a737b3e2fcf9

1da177e4c3f4


a737b3e2fcf9
7c0cb9c64f83
1da177e4c3f4
b28a02de8c70
1da177e4c3f4
b28a02de8c70
1da177e4c3f4
3b0efdfa1e71
b28a02de8c70
3b0efdfa1e71
1da177e4c3f4


7c0cb9c64f83
1da177e4c3f4

a737b3e2fcf9


b28a02de8c70
b46b8f19c9cd
a737b3e2fcf9

1da177e4c3f4


871751e25d95


350260889b25
3b0efdfa1e71
871751e25d95


3dafccf22751
4f104934591e
51cc50685a42
7ea466f2256b

a44b56d354b4
c225150b86fe
a44b56d354b4
1da177e4c3f4


773ff60e8414
8a8b6502fb66
9b030cb865f1
773ff60e8414
8a8b6502fb66
8c138bc00925
8a8b6502fb66

343e0d7a9395
1da177e4c3f4
b28a02de8c70
1da177e4c3f4
072bb0aa5e06
1da177e4c3f4
5c382300876f
8a8b6502fb66
9a2dba4b4912
1da177e4c3f4
1da177e4c3f4
072bb0aa5e06

ddbf2e8366f2
072bb0aa5e06

ddbf2e8366f2
072bb0aa5e06


1da177e4c3f4
072bb0aa5e06


d5cff635290a


f3d8b53a3abb

5c382300876f


e498be7dafd7

b2455396be35
c61afb181c64


765c4507af71
c61afb181c64
7d6e6d09de82
c61afb181c64
6adef3ebe570
c61afb181c64
e7b691b085fd
c61afb181c64
8b98c1699eba
c61afb181c64


765c4507af71
3c517a613209


765c4507af71
8c8cc2c10c21
765c4507af71
8c8cc2c10c21

dd1a239f6f2d
54a6eb5c4765

765c4507af71
3c517a613209
cc9a6c877661
8c8cc2c10c21


6cb062296f73
765c4507af71
cc9a6c877661

e7b691b085fd
cc9a6c877661
3c517a613209


54a6eb5c4765

aedb0eb10796
54a6eb5c4765
3c517a613209
481c5346d098
3c517a613209

481c5346d098


3c517a613209

cfce66047f18
3c517a613209


dd47ea755693


7d6e6d09de82
dd47ea755693

3c517a613209


b6a60451813b
3c517a613209


aedb0eb10796
cc9a6c877661


765c4507af71


e498be7dafd7
1da177e4c3f4
8b98c1699eba
a737b3e2fcf9
e498be7dafd7

b28a02de8c70


b28a02de8c70


a737b3e2fcf9
ca3b9b917353
b28a02de8c70


78d382d77c84
b28a02de8c70


a737b3e2fcf9
b28a02de8c70
a737b3e2fcf9
b28a02de8c70
e498be7dafd7
b28a02de8c70

e498be7dafd7
a737b3e2fcf9
b28a02de8c70
3c517a613209
765c4507af71

1da177e4c3f4
8c8cc2c10c21
e498be7dafd7
a737b3e2fcf9
b28a02de8c70
e498be7dafd7
8c8cc2c10c21


48356303ff8c
7c0cb9c64f83
8c8cc2c10c21


7d6e6d09de82
8c8cc2c10c21
dcce284a2593
7e85ee0c1d15
cf40bd16fdad

773ff60e8414
824ebef12215

d79923fad95b

8c8cc2c10c21


eacbbae385bf
7d6e6d09de82
8c8cc2c10c21


7d6e6d09de82
8c8cc2c10c21


8c138bc00925
d5cff635290a
8c8cc2c10c21
c175eea466e7
8c138bc00925
c175eea466e7
d07dbea46405
8c138bc00925
d07dbea46405
8c8cc2c10c21


7d6e6d09de82

8c8cc2c10c21


48356303ff8c
8c8cc2c10c21


dcce284a2593
7e85ee0c1d15
cf40bd16fdad

773ff60e8414
824ebef12215

d79923fad95b

8c8cc2c10c21


8c138bc00925
d5cff635290a
8c8cc2c10c21

c175eea466e7
8c138bc00925
c175eea466e7
d07dbea46405
8c138bc00925
d07dbea46405
8c8cc2c10c21

e498be7dafd7


343e0d7a9395
b28a02de8c70
1da177e4c3f4

e498be7dafd7
1da177e4c3f4

072bb0aa5e06
1da177e4c3f4
1da177e4c3f4
072bb0aa5e06


6ed5eb221120
ff69416e6323
1da177e4c3f4
ff69416e6323
1da177e4c3f4
78d382d77c84
1da177e4c3f4
e498be7dafd7
1da177e4c3f4


e498be7dafd7

e5ac9c5aec7c


1da177e4c3f4

e498be7dafd7
1da177e4c3f4


e498be7dafd7
1da177e4c3f4


343e0d7a9395
1da177e4c3f4

e498be7dafd7
7d6e6d09de82
1da177e4c3f4


ff69416e6323
873623dfabaa
e498be7dafd7

b28a02de8c70
1da177e4c3f4


e498be7dafd7
b28a02de8c70
1da177e4c3f4


ff69416e6323
a737b3e2fcf9
1da177e4c3f4


e498be7dafd7

1da177e4c3f4


e498be7dafd7
1da177e4c3f4
a737b3e2fcf9
1da177e4c3f4


a737b3e2fcf9

1da177e4c3f4
a947eb95ea03
7c0cb9c64f83
1da177e4c3f4
9a2dba4b4912
1da177e4c3f4

d5cff635290a
a947eb95ea03
1da177e4c3f4
8c138bc00925
c175eea466e7
1807a1aaf5f2


b6e68bc1baed
729bd0b74ce9

1da177e4c3f4

1da177e4c3f4


1da177e4c3f4
42c8c99cd891
072bb0aa5e06
1da177e4c3f4


343e0d7a9395
1da177e4c3f4
48356303ff8c
36555751c675
ca2b84cb3c4a
8c138bc00925
36555751c675

1da177e4c3f4


0f24f1287a86
85beb5869a4f
4052147c0afa
36555751c675
85beb5869a4f

48356303ff8c
85beb5869a4f

ff4fcd01ec86
85beb5869a4f
36555751c675
85beb5869a4f
36555751c675

1da177e4c3f4
8b98c1699eba

48356303ff8c
36555751c675
ca2b84cb3c4a
8c138bc00925
ca2b84cb3c4a
36555751c675

8b98c1699eba
1da177e4c3f4

0f24f1287a86
4052147c0afa
85beb5869a4f
4052147c0afa

36555751c675
85beb5869a4f

592f41450d03
7c0cb9c64f83
85beb5869a4f
ff4fcd01ec86
85beb5869a4f

36555751c675
85beb5869a4f
36555751c675

8b98c1699eba
7c0cb9c64f83
97e2bde47f88
343e0d7a9395
97e2bde47f88

6cb8f91320d3

4052147c0afa
97e2bde47f88
8b98c1699eba
0bb38a5cdeb3
8b98c1699eba

7c0cb9c64f83
8b98c1699eba
dbe5e69d2d6e
8b98c1699eba

ce71e27c6fdc
8b98c1699eba
7c0cb9c64f83
8b98c1699eba


7c0cb9c64f83
8b98c1699eba

0bb38a5cdeb3
8b98c1699eba
1da177e4c3f4

800590f523bf
1da177e4c3f4
800590f523bf
911851e6ee6a
1da177e4c3f4
7fd6b1413082
7c0cb9c64f83
1da177e4c3f4
343e0d7a9395
36555751c675
1da177e4c3f4
97e2bde47f88


a5c96d8a1c67

48356303ff8c
36555751c675
7c0cb9c64f83
3b0efdfa1e71
36555751c675

7fd6b1413082

7fd6b1413082
0bb38a5cdeb3
7fd6b1413082

7c0cb9c64f83
1da177e4c3f4


ce71e27c6fdc
7fd6b1413082
7c0cb9c64f83
7fd6b1413082

1d2c8eea6985


7c0cb9c64f83
1d2c8eea6985

7fd6b1413082

1da177e4c3f4


343e0d7a9395
1da177e4c3f4

b9ce5ef49f00


1da177e4c3f4

d97d476b1bb1
3ac7fe5a4aab
8c138bc00925
7c0cb9c64f83
1da177e4c3f4
36555751c675
ca2b84cb3c4a
1da177e4c3f4


1da177e4c3f4


80e93effce55

1da177e4c3f4


343e0d7a9395
1da177e4c3f4

2121db74ba0f

6cb8f91320d3
1da177e4c3f4


6ed5eb221120
8c138bc00925


7c0cb9c64f83
1da177e4c3f4


e498be7dafd7
183ff22bb6bd
e498be7dafd7
83b519e8b957
e498be7dafd7


cafeb02e098e
3395ee058879
e498be7dafd7
9c09a95cf431
cafeb02e098e
3395ee058879
83b519e8b957
3395ee058879


cafeb02e098e
6310984694c8


0718dc2a82c8
83b519e8b957
6310984694c8


0718dc2a82c8
cafeb02e098e
a737b3e2fcf9

cafeb02e098e

e498be7dafd7

cafeb02e098e
0718dc2a82c8

e498be7dafd7
cafeb02e098e

e498be7dafd7


b28a02de8c70
a737b3e2fcf9
e498be7dafd7
cafeb02e098e
e498be7dafd7


83b519e8b957
0718dc2a82c8


e498be7dafd7
0718dc2a82c8
e498be7dafd7


a737b3e2fcf9
cafeb02e098e
e498be7dafd7
b28a02de8c70
a737b3e2fcf9
e498be7dafd7

cafeb02e098e
0718dc2a82c8
a737b3e2fcf9
3b0efdfa1e71
0718dc2a82c8


cafeb02e098e
e498be7dafd7

1da177e4c3f4
343e0d7a9395
acfe7d74484d
1da177e4c3f4


a737b3e2fcf9
1da177e4c3f4


9a2dba4b4912
e498be7dafd7
1da177e4c3f4


18004c5d4084
943a451a87d2
83b519e8b957
1da177e4c3f4
d2e7b7d0aa02
2ed3a4ef95ef
1da177e4c3f4
acfe7d74484d

d2e7b7d0aa02


e498be7dafd7
7d6e6d09de82
83b519e8b957
d2e7b7d0aa02
b28a02de8c70
d2e7b7d0aa02

e498be7dafd7
1da177e4c3f4

d2e7b7d0aa02
1da177e4c3f4
15c8b6c1aaaf
e498be7dafd7
1da177e4c3f4
1da177e4c3f4

e498be7dafd7
1da177e4c3f4
e498be7dafd7
d2e7b7d0aa02
1da177e4c3f4

7d6e6d09de82


1da177e4c3f4

d2e7b7d0aa02
83b519e8b957
1da177e4c3f4

943a451a87d2


ebe945c27628
943a451a87d2


18004c5d4084
83b519e8b957
1da177e4c3f4

943a451a87d2


1da177e4c3f4
943a451a87d2

a737b3e2fcf9

1da177e4c3f4

a737b3e2fcf9
1da177e4c3f4


3b0efdfa1e71
1da177e4c3f4
3b0efdfa1e71
1da177e4c3f4
3b0efdfa1e71
1da177e4c3f4
3b0efdfa1e71
1da177e4c3f4


a737b3e2fcf9

1da177e4c3f4


3b0efdfa1e71
1da177e4c3f4
1da177e4c3f4

a737b3e2fcf9


1da177e4c3f4


943a451a87d2


1da177e4c3f4

b28a02de8c70
2ed3a4ef95ef
1da177e4c3f4

1b55253a7f95

b18e7e654d7a

1b55253a7f95
68a1b1955957
1b55253a7f95
1da177e4c3f4


1b55253a7f95

1da177e4c3f4

b18e7e654d7a
1b55253a7f95
b18e7e654d7a


1b55253a7f95
1da177e4c3f4


05fb6bf0b295
1da177e4c3f4


a737b3e2fcf9

1da177e4c3f4
7c5cae368a6c
1da177e4c3f4
7a7c381d2506
e498be7dafd7
7d6e6d09de82
bf6aede71233
1da177e4c3f4
18004c5d4084
1da177e4c3f4
7c5cae368a6c
1da177e4c3f4
18004c5d4084
1da177e4c3f4

35386e3b0f87


aab2207cf8d9
35386e3b0f87
8fce4d8e3b9e
1da177e4c3f4
aab2207cf8d9
1da177e4c3f4
35386e3b0f87


e498be7dafd7
35386e3b0f87
1da177e4c3f4
e498be7dafd7
1da177e4c3f4
aab2207cf8d9
1da177e4c3f4
ed11d9eb2228
e498be7dafd7
ed11d9eb2228

1da177e4c3f4
ed11d9eb2228


35386e3b0f87
1da177e4c3f4


18004c5d4084
8fce4d8e3b9e
7c5cae368a6c
a737b3e2fcf9
7c5cae368a6c
1da177e4c3f4

158a962422e4
0d7561c61d76
1da177e4c3f4
b28a02de8c70


e498be7dafd7
1da177e4c3f4
e498be7dafd7

1da177e4c3f4
1da177e4c3f4

e498be7dafd7


ca3b9b917353

e498be7dafd7
7a7c381d2506
e498be7dafd7


7a7c381d2506
e498be7dafd7


7a7c381d2506
e498be7dafd7


4484ebf12bdb

e498be7dafd7
ca3b9b917353
1da177e4c3f4
b28a02de8c70

e498be7dafd7
1da177e4c3f4

b28a02de8c70
1da177e4c3f4


0d7561c61d76


1da177e4c3f4
b28a02de8c70
1da177e4c3f4


1da177e4c3f4
e498be7dafd7
fb7faf3313d5
1da177e4c3f4
e92dd4fd1aa1


1da177e4c3f4


b28a02de8c70
1da177e4c3f4

1da177e4c3f4

1da177e4c3f4


b7454ad3cfc3
b28a02de8c70
1da177e4c3f4
b28a02de8c70
1da177e4c3f4
7a7c381d2506
b28a02de8c70
1da177e4c3f4


b28a02de8c70
1da177e4c3f4


18004c5d4084
1da177e4c3f4
18004c5d4084
1da177e4c3f4
a737b3e2fcf9

e498be7dafd7
1da177e4c3f4
e498be7dafd7
83b519e8b957

1da177e4c3f4


18004c5d4084
1da177e4c3f4


871751e25d95


18004c5d4084

871751e25d95


3b0efdfa1e71
871751e25d95


871751e25d95
9281acea6a36
871751e25d95
a5c43dae7ae3
871751e25d95
a5c43dae7ae3
871751e25d95


0672aa7c236a
871751e25d95


7a7c381d2506
871751e25d95
7a7c381d2506
871751e25d95
871751e25d95


18004c5d4084
871751e25d95


18004c5d4084
871751e25d95


18004c5d4084
871751e25d95


d2e7b7d0aa02
871751e25d95


b7454ad3cfc3


a0ec95a8e697
871751e25d95


a0ec95a8e697


871751e25d95
a0ec95a8e697


1da177e4c3f4

00e145b6d59a


fd76bab2fa6d
1da177e4c3f4
ef8b4520bd9f

00e145b6d59a
1da177e4c3f4
8c138bc00925
1da177e4c3f4
b1aabecd5593

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630


/*
 * linux/mm/slab.c
 * Written by Mark Hemment, 1996/97.
 * (markhe@nextd.demon.co.uk)
 *
 * kmem_cache_destroy() + some cleanup - 1999 Andrea Arcangeli
 *
 * Major cleanup, different bufctl logic, per-cpu arrays
 *	(c) 2000 Manfred Spraul
 *
 * Cleanup, make the head arrays unconditional, preparation for NUMA
 * 	(c) 2002 Manfred Spraul
 *
 * An implementation of the Slab Allocator as described in outline in;
 *	UNIX Internals: The New Frontiers by Uresh Vahalia
 *	Pub: Prentice Hall	ISBN 0-13-101908-2
 * or with a little more detail in;
 *	The Slab Allocator: An Object-Caching Kernel Memory Allocator
 *	Jeff Bonwick (Sun Microsystems).
 *	Presented at: USENIX Summer 1994 Technical Conference
 *
 * The memory is organized in caches, one cache for each object type.
 * (e.g. inode_cache, dentry_cache, buffer_head, vm_area_struct)
 * Each cache consists out of many slabs (they are small (usually one
 * page long) and always contiguous), and each slab contains multiple
 * initialized objects.
 *
 * This means, that your constructor is used only for newly allocated
 * slabs and you must pass objects with the same initializations to
 * kmem_cache_free.
 *
 * Each cache can only support one memory type (GFP_DMA, GFP_HIGHMEM,
 * normal). If you need a special memory type, then must create a new
 * cache for that memory type.
 *
 * In order to reduce fragmentation, the slabs are sorted in 3 groups:
 *   full slabs with 0 free objects
 *   partial slabs
 *   empty slabs with no allocated objects
 *
 * If partial slabs exist, then new allocations come from these slabs,
 * otherwise from empty slabs or new slabs are allocated.
 *
 * kmem_cache_destroy() CAN CRASH if you try to allocate from the cache
 * during kmem_cache_destroy(). The caller must prevent concurrent allocs.
 *
 * Each cache has a short per-cpu head array, most allocs
 * and frees go into that array, and if that array overflows, then 1/2
 * of the entries in the array are given back into the global cache.
 * The head array is strictly LIFO and should improve the cache hit rates.
 * On SMP, it additionally reduces the spinlock operations.
 *
 * The c_cpuarray may not be read with enabled local interrupts -
 * it's changed with a smp_call_function().
 *
 * SMP synchronization:
 *  constructors and destructors are called without any locking.
 *  Several members in struct kmem_cache and struct slab never change, they
 *	are accessed without any locking.
 *  The per-cpu arrays are never accessed from the wrong cpu, no locking,
 *  	and local interrupts are disabled so slab code is preempt-safe.
 *  The non-constant members are protected with a per-cache irq spinlock.
 *
 * Many thanks to Mark Hemment, who wrote another per-cpu slab patch
 * in 2000 - many ideas in the current implementation are derived from
 * his patch.
 *
 * Further notes from the original documentation:
 *
 * 11 April '97.  Started multi-threading - markhe
 *	The global cache-chain is protected by the mutex 'slab_mutex'.
 *	The sem is only needed when accessing/extending the cache-chain, which
 *	can never happen inside an interrupt (kmem_cache_create(),
 *	kmem_cache_shrink() and kmem_cache_reap()).
 *
 *	At present, each engine can be growing a cache.  This should be blocked.
 *
 * 15 March 2005. NUMA slab allocator.
 *	Shai Fultheim <shai@scalex86.org>.
 *	Shobhit Dayal <shobhit@calsoftinc.com>
 *	Alok N Kataria <alokk@calsoftinc.com>
 *	Christoph Lameter <christoph@lameter.com>
 *
 *	Modified the slab allocator to be node aware on NUMA systems.
 *	Each node has its own list of partial, free and full slabs.
 *	All object allocations for a node occur from node specific slab lists.
 */

#include	<linux/slab.h>
#include	<linux/mm.h>
#include	<linux/poison.h>
#include	<linux/swap.h>
#include	<linux/cache.h>
#include	<linux/interrupt.h>
#include	<linux/init.h>
#include	<linux/compiler.h>
#include	<linux/cpuset.h>
#include	<linux/proc_fs.h>
#include	<linux/seq_file.h>
#include	<linux/notifier.h>
#include	<linux/kallsyms.h>
#include	<linux/cpu.h>
#include	<linux/sysctl.h>
#include	<linux/module.h>
#include	<linux/rcupdate.h>
#include	<linux/string.h>
#include	<linux/uaccess.h>
#include	<linux/nodemask.h>
#include	<linux/kmemleak.h>
#include	<linux/mempolicy.h>
#include	<linux/mutex.h>
#include	<linux/fault-inject.h>
#include	<linux/rtmutex.h>
#include	<linux/reciprocal_div.h>
#include	<linux/debugobjects.h>
#include	<linux/kmemcheck.h>
#include	<linux/memory.h>
#include	<linux/prefetch.h>

#include	<net/sock.h>

#include	<asm/cacheflush.h>
#include	<asm/tlbflush.h>
#include	<asm/page.h>

#include <trace/events/kmem.h>

#include	"internal.h"

#include	"slab.h"

/*
 * DEBUG	- 1 for kmem_cache_create() to honour; SLAB_RED_ZONE & SLAB_POISON.
 *		  0 for faster, smaller code (especially in the critical paths).
 *
 * STATS	- 1 to collect stats for /proc/slabinfo.
 *		  0 for faster, smaller code (especially in the critical paths).
 *
 * FORCED_DEBUG	- 1 enables SLAB_RED_ZONE and SLAB_POISON (if possible)
 */

#ifdef CONFIG_DEBUG_SLAB
#define	DEBUG		1
#define	STATS		1
#define	FORCED_DEBUG	1
#else
#define	DEBUG		0
#define	STATS		0
#define	FORCED_DEBUG	0
#endif

/* Shouldn't this be in a header file somewhere? */
#define	BYTES_PER_WORD		sizeof(void *)
#define	REDZONE_ALIGN		max(BYTES_PER_WORD, __alignof__(unsigned long long))

#ifndef ARCH_KMALLOC_FLAGS
#define ARCH_KMALLOC_FLAGS SLAB_HWCACHE_ALIGN
#endif

/*
 * true if a page was allocated from pfmemalloc reserves for network-based
 * swap
 */
static bool pfmemalloc_active __read_mostly;

/*
 * kmem_bufctl_t:
 *
 * Bufctl's are used for linking objs within a slab
 * linked offsets.
 *
 * This implementation relies on "struct page" for locating the cache &
 * slab an object belongs to.
 * This allows the bufctl structure to be small (one int), but limits
 * the number of objects a slab (not a cache) can contain when off-slab
 * bufctls are used. The limit is the size of the largest general cache
 * that does not use off-slab slabs.
 * For 32bit archs with 4 kB pages, is this 56.
 * This is not serious, as it is only for large objects, when it is unwise
 * to have too many per slab.
 * Note: This limit can be raised by introducing a general cache whose size
 * is less than 512 (PAGE_SIZE<<3), but greater than 256.
 */

typedef unsigned int kmem_bufctl_t;
#define BUFCTL_END	(((kmem_bufctl_t)(~0U))-0)
#define BUFCTL_FREE	(((kmem_bufctl_t)(~0U))-1)
#define	BUFCTL_ACTIVE	(((kmem_bufctl_t)(~0U))-2)
#define	SLAB_LIMIT	(((kmem_bufctl_t)(~0U))-3)

/*
 * struct slab_rcu
 *
 * slab_destroy on a SLAB_DESTROY_BY_RCU cache uses this structure to
 * arrange for kmem_freepages to be called via RCU.  This is useful if
 * we need to approach a kernel structure obliquely, from its address
 * obtained without the usual locking.  We can lock the structure to
 * stabilize it and check it's still at the given address, only if we
 * can be sure that the memory has not been meanwhile reused for some
 * other kind of object (which our subsystem's lock might corrupt).
 *
 * rcu_read_lock before reading the address, then rcu_read_unlock after
 * taking the spinlock within the structure expected at that address.
 */
struct slab_rcu {
	struct rcu_head head;
	struct kmem_cache *cachep;
	void *addr;
};

/*
 * struct slab
 *
 * Manages the objs in a slab. Placed either at the beginning of mem allocated
 * for a slab, or allocated from an general cache.
 * Slabs are chained into three list: fully used, partial, fully free slabs.
 */
struct slab {
	union {
		struct {
			struct list_head list;
			unsigned long colouroff;
			void *s_mem;		/* including colour offset */
			unsigned int inuse;	/* num of objs active in slab */
			kmem_bufctl_t free;
			unsigned short nodeid;
		};
		struct slab_rcu __slab_cover_slab_rcu;
	};
};

/*
 * struct array_cache
 *
 * Purpose:
 * - LIFO ordering, to hand out cache-warm objects from _alloc
 * - reduce the number of linked list operations
 * - reduce spinlock operations
 *
 * The limit is stored in the per-cpu structure to reduce the data cache
 * footprint.
 *
 */
struct array_cache {
	unsigned int avail;
	unsigned int limit;
	unsigned int batchcount;
	unsigned int touched;
	spinlock_t lock;
	void *entry[];	/*
			 * Must have this definition in here for the proper
			 * alignment of array_cache. Also simplifies accessing
			 * the entries.
			 *
			 * Entries should not be directly dereferenced as
			 * entries belonging to slabs marked pfmemalloc will
			 * have the lower bits set SLAB_OBJ_PFMEMALLOC
			 */
};

#define SLAB_OBJ_PFMEMALLOC	1
static inline bool is_obj_pfmemalloc(void *objp)
{
	return (unsigned long)objp & SLAB_OBJ_PFMEMALLOC;
}

static inline void set_obj_pfmemalloc(void **objp)
{
	*objp = (void *)((unsigned long)*objp | SLAB_OBJ_PFMEMALLOC);
	return;
}

static inline void clear_obj_pfmemalloc(void **objp)
{
	*objp = (void *)((unsigned long)*objp & ~SLAB_OBJ_PFMEMALLOC);
}

/*
 * bootstrap: The caches do not work without cpuarrays anymore, but the
 * cpuarrays are allocated from the generic caches...
 */
#define BOOT_CPUCACHE_ENTRIES	1
struct arraycache_init {
	struct array_cache cache;
	void *entries[BOOT_CPUCACHE_ENTRIES];
};

/*
 * The slab lists for all objects.
 */
struct kmem_list3 {
	struct list_head slabs_partial;	/* partial list first, better asm code */
	struct list_head slabs_full;
	struct list_head slabs_free;
	unsigned long free_objects;
	unsigned int free_limit;
	unsigned int colour_next;	/* Per-node cache coloring */
	spinlock_t list_lock;
	struct array_cache *shared;	/* shared per node */
	struct array_cache **alien;	/* on other nodes */
	unsigned long next_reap;	/* updated without locking */
	int free_touched;		/* updated without locking */
};

/*
 * Need this for bootstrapping a per node allocator.
 */
#define NUM_INIT_LISTS (3 * MAX_NUMNODES)
static struct kmem_list3 __initdata initkmem_list3[NUM_INIT_LISTS];
#define	CACHE_CACHE 0
#define	SIZE_AC MAX_NUMNODES
#define	SIZE_L3 (2 * MAX_NUMNODES)

static int drain_freelist(struct kmem_cache *cache,
			struct kmem_list3 *l3, int tofree);
static void free_block(struct kmem_cache *cachep, void **objpp, int len,
			int node);
static int enable_cpucache(struct kmem_cache *cachep, gfp_t gfp);
static void cache_reap(struct work_struct *unused);

/*
 * This function must be completely optimized away if a constant is passed to
 * it.  Mostly the same as what is in linux/slab.h except it returns an index.
 */
static __always_inline int index_of(const size_t size)
{
	extern void __bad_size(void);

	if (__builtin_constant_p(size)) {
		int i = 0;

#define CACHE(x) \
	if (size <=x) \
		return i; \
	else \
		i++;
#include <linux/kmalloc_sizes.h>
#undef CACHE
		__bad_size();
	} else
		__bad_size();
	return 0;
}

static int slab_early_init = 1;

#define INDEX_AC index_of(sizeof(struct arraycache_init))
#define INDEX_L3 index_of(sizeof(struct kmem_list3))

static void kmem_list3_init(struct kmem_list3 *parent)
{
	INIT_LIST_HEAD(&parent->slabs_full);
	INIT_LIST_HEAD(&parent->slabs_partial);
	INIT_LIST_HEAD(&parent->slabs_free);
	parent->shared = NULL;
	parent->alien = NULL;
	parent->colour_next = 0;
	spin_lock_init(&parent->list_lock);
	parent->free_objects = 0;
	parent->free_touched = 0;
}

#define MAKE_LIST(cachep, listp, slab, nodeid)				\
	do {								\
		INIT_LIST_HEAD(listp);					\
		list_splice(&(cachep->nodelists[nodeid]->slab), listp);	\
	} while (0)

#define	MAKE_ALL_LISTS(cachep, ptr, nodeid)				\
	do {								\
	MAKE_LIST((cachep), (&(ptr)->slabs_full), slabs_full, nodeid);	\
	MAKE_LIST((cachep), (&(ptr)->slabs_partial), slabs_partial, nodeid); \
	MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid);	\
	} while (0)

#define CFLGS_OFF_SLAB		(0x80000000UL)
#define	OFF_SLAB(x)	((x)->flags & CFLGS_OFF_SLAB)

#define BATCHREFILL_LIMIT	16
/*
 * Optimization question: fewer reaps means less probability for unnessary
 * cpucache drain/refill cycles.
 *
 * OTOH the cpuarrays can contain lots of objects,
 * which could lock up otherwise freeable slabs.
 */
#define REAPTIMEOUT_CPUC	(2*HZ)
#define REAPTIMEOUT_LIST3	(4*HZ)

#if STATS
#define	STATS_INC_ACTIVE(x)	((x)->num_active++)
#define	STATS_DEC_ACTIVE(x)	((x)->num_active--)
#define	STATS_INC_ALLOCED(x)	((x)->num_allocations++)
#define	STATS_INC_GROWN(x)	((x)->grown++)
#define	STATS_ADD_REAPED(x,y)	((x)->reaped += (y))
#define	STATS_SET_HIGH(x)						\
	do {								\
		if ((x)->num_active > (x)->high_mark)			\
			(x)->high_mark = (x)->num_active;		\
	} while (0)
#define	STATS_INC_ERR(x)	((x)->errors++)
#define	STATS_INC_NODEALLOCS(x)	((x)->node_allocs++)
#define	STATS_INC_NODEFREES(x)	((x)->node_frees++)
#define STATS_INC_ACOVERFLOW(x)   ((x)->node_overflow++)
#define	STATS_SET_FREEABLE(x, i)					\
	do {								\
		if ((x)->max_freeable < i)				\
			(x)->max_freeable = i;				\
	} while (0)
#define STATS_INC_ALLOCHIT(x)	atomic_inc(&(x)->allochit)
#define STATS_INC_ALLOCMISS(x)	atomic_inc(&(x)->allocmiss)
#define STATS_INC_FREEHIT(x)	atomic_inc(&(x)->freehit)
#define STATS_INC_FREEMISS(x)	atomic_inc(&(x)->freemiss)
#else
#define	STATS_INC_ACTIVE(x)	do { } while (0)
#define	STATS_DEC_ACTIVE(x)	do { } while (0)
#define	STATS_INC_ALLOCED(x)	do { } while (0)
#define	STATS_INC_GROWN(x)	do { } while (0)
#define	STATS_ADD_REAPED(x,y)	do { (void)(y); } while (0)
#define	STATS_SET_HIGH(x)	do { } while (0)
#define	STATS_INC_ERR(x)	do { } while (0)
#define	STATS_INC_NODEALLOCS(x)	do { } while (0)
#define	STATS_INC_NODEFREES(x)	do { } while (0)
#define STATS_INC_ACOVERFLOW(x)   do { } while (0)
#define	STATS_SET_FREEABLE(x, i) do { } while (0)
#define STATS_INC_ALLOCHIT(x)	do { } while (0)
#define STATS_INC_ALLOCMISS(x)	do { } while (0)
#define STATS_INC_FREEHIT(x)	do { } while (0)
#define STATS_INC_FREEMISS(x)	do { } while (0)
#endif

#if DEBUG

/*
 * memory layout of objects:
 * 0		: objp
 * 0 .. cachep->obj_offset - BYTES_PER_WORD - 1: padding. This ensures that
 * 		the end of an object is aligned with the end of the real
 * 		allocation. Catches writes behind the end of the allocation.
 * cachep->obj_offset - BYTES_PER_WORD .. cachep->obj_offset - 1:
 * 		redzone word.
 * cachep->obj_offset: The real object.
 * cachep->size - 2* BYTES_PER_WORD: redzone word [BYTES_PER_WORD long]
 * cachep->size - 1* BYTES_PER_WORD: last caller address
 *					[BYTES_PER_WORD long]
 */
static int obj_offset(struct kmem_cache *cachep)
{
	return cachep->obj_offset;
}

static unsigned long long *dbg_redzone1(struct kmem_cache *cachep, void *objp)
{
	BUG_ON(!(cachep->flags & SLAB_RED_ZONE));
	return (unsigned long long*) (objp + obj_offset(cachep) -
				      sizeof(unsigned long long));
}

static unsigned long long *dbg_redzone2(struct kmem_cache *cachep, void *objp)
{
	BUG_ON(!(cachep->flags & SLAB_RED_ZONE));
	if (cachep->flags & SLAB_STORE_USER)
		return (unsigned long long *)(objp + cachep->size -
					      sizeof(unsigned long long) -
					      REDZONE_ALIGN);
	return (unsigned long long *) (objp + cachep->size -
				       sizeof(unsigned long long));
}

static void **dbg_userword(struct kmem_cache *cachep, void *objp)
{
	BUG_ON(!(cachep->flags & SLAB_STORE_USER));
	return (void **)(objp + cachep->size - BYTES_PER_WORD);
}

#else

#define obj_offset(x)			0
#define dbg_redzone1(cachep, objp)	({BUG(); (unsigned long long *)NULL;})
#define dbg_redzone2(cachep, objp)	({BUG(); (unsigned long long *)NULL;})
#define dbg_userword(cachep, objp)	({BUG(); (void **)NULL;})

#endif

/*
 * Do not go above this order unless 0 objects fit into the slab or
 * overridden on the command line.
 */
#define	SLAB_MAX_ORDER_HI	1
#define	SLAB_MAX_ORDER_LO	0
static int slab_max_order = SLAB_MAX_ORDER_LO;
static bool slab_max_order_set __initdata;

static inline struct kmem_cache *virt_to_cache(const void *obj)
{
	struct page *page = virt_to_head_page(obj);
	return page->slab_cache;
}

static inline struct slab *virt_to_slab(const void *obj)
{
	struct page *page = virt_to_head_page(obj);

	VM_BUG_ON(!PageSlab(page));
	return page->slab_page;
}

static inline void *index_to_obj(struct kmem_cache *cache, struct slab *slab,
				 unsigned int idx)
{
	return slab->s_mem + cache->size * idx;
}

/*
 * We want to avoid an expensive divide : (offset / cache->size)
 *   Using the fact that size is a constant for a particular cache,
 *   we can replace (offset / cache->size) by
 *   reciprocal_divide(offset, cache->reciprocal_buffer_size)
 */
static inline unsigned int obj_to_index(const struct kmem_cache *cache,
					const struct slab *slab, void *obj)
{
	u32 offset = (obj - slab->s_mem);
	return reciprocal_divide(offset, cache->reciprocal_buffer_size);
}

/*
 * These are the default caches for kmalloc. Custom caches can have other sizes.
 */
struct cache_sizes malloc_sizes[] = {
#define CACHE(x) { .cs_size = (x) },
#include <linux/kmalloc_sizes.h>
	CACHE(ULONG_MAX)
#undef CACHE
};
EXPORT_SYMBOL(malloc_sizes);

/* Must match cache_sizes above. Out of line to keep cache footprint low. */
struct cache_names {
	char *name;
	char *name_dma;
};

static struct cache_names __initdata cache_names[] = {
#define CACHE(x) { .name = "size-" #x, .name_dma = "size-" #x "(DMA)" },
#include <linux/kmalloc_sizes.h>
	{NULL,}
#undef CACHE
};

static struct arraycache_init initarray_generic =
    { {0, BOOT_CPUCACHE_ENTRIES, 1, 0} };

/* internal cache of cache description objs */
static struct kmem_cache kmem_cache_boot = {
	.batchcount = 1,
	.limit = BOOT_CPUCACHE_ENTRIES,
	.shared = 1,
	.size = sizeof(struct kmem_cache),
	.name = "kmem_cache",
};

#define BAD_ALIEN_MAGIC 0x01020304ul

#ifdef CONFIG_LOCKDEP

/*
 * Slab sometimes uses the kmalloc slabs to store the slab headers
 * for other slabs "off slab".
 * The locking for this is tricky in that it nests within the locks
 * of all other slabs in a few places; to deal with this special
 * locking we put on-slab caches into a separate lock-class.
 *
 * We set lock class for alien array caches which are up during init.
 * The lock annotation will be lost if all cpus of a node goes down and
 * then comes back up during hotplug
 */
static struct lock_class_key on_slab_l3_key;
static struct lock_class_key on_slab_alc_key;

static struct lock_class_key debugobj_l3_key;
static struct lock_class_key debugobj_alc_key;

static void slab_set_lock_classes(struct kmem_cache *cachep,
		struct lock_class_key *l3_key, struct lock_class_key *alc_key,
		int q)
{
	struct array_cache **alc;
	struct kmem_list3 *l3;
	int r;

	l3 = cachep->nodelists[q];
	if (!l3)
		return;

	lockdep_set_class(&l3->list_lock, l3_key);
	alc = l3->alien;
	/*
	 * FIXME: This check for BAD_ALIEN_MAGIC
	 * should go away when common slab code is taught to
	 * work even without alien caches.
	 * Currently, non NUMA code returns BAD_ALIEN_MAGIC
	 * for alloc_alien_cache,
	 */
	if (!alc || (unsigned long)alc == BAD_ALIEN_MAGIC)
		return;
	for_each_node(r) {
		if (alc[r])
			lockdep_set_class(&alc[r]->lock, alc_key);
	}
}

static void slab_set_debugobj_lock_classes_node(struct kmem_cache *cachep, int node)
{
	slab_set_lock_classes(cachep, &debugobj_l3_key, &debugobj_alc_key, node);
}

static void slab_set_debugobj_lock_classes(struct kmem_cache *cachep)
{
	int node;

	for_each_online_node(node)
		slab_set_debugobj_lock_classes_node(cachep, node);
}

static void init_node_lock_keys(int q)
{
	struct cache_sizes *s = malloc_sizes;

	if (slab_state < UP)
		return;

	for (s = malloc_sizes; s->cs_size != ULONG_MAX; s++) {
		struct kmem_list3 *l3;

		l3 = s->cs_cachep->nodelists[q];
		if (!l3 || OFF_SLAB(s->cs_cachep))
			continue;

		slab_set_lock_classes(s->cs_cachep, &on_slab_l3_key,
				&on_slab_alc_key, q);
	}
}

static void on_slab_lock_classes_node(struct kmem_cache *cachep, int q)
{
	struct kmem_list3 *l3;
	l3 = cachep->nodelists[q];
	if (!l3)
		return;

	slab_set_lock_classes(cachep, &on_slab_l3_key,
			&on_slab_alc_key, q);
}

static inline void on_slab_lock_classes(struct kmem_cache *cachep)
{
	int node;

	VM_BUG_ON(OFF_SLAB(cachep));
	for_each_node(node)
		on_slab_lock_classes_node(cachep, node);
}

static inline void init_lock_keys(void)
{
	int node;

	for_each_node(node)
		init_node_lock_keys(node);
}
#else
static void init_node_lock_keys(int q)
{
}

static inline void init_lock_keys(void)
{
}

static inline void on_slab_lock_classes(struct kmem_cache *cachep)
{
}

static inline void on_slab_lock_classes_node(struct kmem_cache *cachep, int node)
{
}

static void slab_set_debugobj_lock_classes_node(struct kmem_cache *cachep, int node)
{
}

static void slab_set_debugobj_lock_classes(struct kmem_cache *cachep)
{
}
#endif

static DEFINE_PER_CPU(struct delayed_work, slab_reap_work);

static inline struct array_cache *cpu_cache_get(struct kmem_cache *cachep)
{
	return cachep->array[smp_processor_id()];
}

static inline struct kmem_cache *__find_general_cachep(size_t size,
							gfp_t gfpflags)
{
	struct cache_sizes *csizep = malloc_sizes;

#if DEBUG
	/* This happens if someone tries to call
	 * kmem_cache_create(), or __kmalloc(), before
	 * the generic caches are initialized.
	 */
	BUG_ON(malloc_sizes[INDEX_AC].cs_cachep == NULL);
#endif
	if (!size)
		return ZERO_SIZE_PTR;

	while (size > csizep->cs_size)
		csizep++;

	/*
	 * Really subtle: The last entry with cs->cs_size==ULONG_MAX
	 * has cs_{dma,}cachep==NULL. Thus no special case
	 * for large kmalloc calls required.
	 */
#ifdef CONFIG_ZONE_DMA
	if (unlikely(gfpflags & GFP_DMA))
		return csizep->cs_dmacachep;
#endif
	return csizep->cs_cachep;
}

static struct kmem_cache *kmem_find_general_cachep(size_t size, gfp_t gfpflags)
{
	return __find_general_cachep(size, gfpflags);
}

static size_t slab_mgmt_size(size_t nr_objs, size_t align)
{
	return ALIGN(sizeof(struct slab)+nr_objs*sizeof(kmem_bufctl_t), align);
}

/*
 * Calculate the number of objects and left-over bytes for a given buffer size.
 */
static void cache_estimate(unsigned long gfporder, size_t buffer_size,
			   size_t align, int flags, size_t *left_over,
			   unsigned int *num)
{
	int nr_objs;
	size_t mgmt_size;
	size_t slab_size = PAGE_SIZE << gfporder;

	/*
	 * The slab management structure can be either off the slab or
	 * on it. For the latter case, the memory allocated for a
	 * slab is used for:
	 *
	 * - The struct slab
	 * - One kmem_bufctl_t for each object
	 * - Padding to respect alignment of @align
	 * - @buffer_size bytes for each object
	 *
	 * If the slab management structure is off the slab, then the
	 * alignment will already be calculated into the size. Because
	 * the slabs are all pages aligned, the objects will be at the
	 * correct alignment when allocated.
	 */
	if (flags & CFLGS_OFF_SLAB) {
		mgmt_size = 0;
		nr_objs = slab_size / buffer_size;

		if (nr_objs > SLAB_LIMIT)
			nr_objs = SLAB_LIMIT;
	} else {
		/*
		 * Ignore padding for the initial guess. The padding
		 * is at most @align-1 bytes, and @buffer_size is at
		 * least @align. In the worst case, this result will
		 * be one greater than the number of objects that fit
		 * into the memory allocation when taking the padding
		 * into account.
		 */
		nr_objs = (slab_size - sizeof(struct slab)) /
			  (buffer_size + sizeof(kmem_bufctl_t));

		/*
		 * This calculated number will be either the right
		 * amount, or one greater than what we want.
		 */
		if (slab_mgmt_size(nr_objs, align) + nr_objs*buffer_size
		       > slab_size)
			nr_objs--;

		if (nr_objs > SLAB_LIMIT)
			nr_objs = SLAB_LIMIT;

		mgmt_size = slab_mgmt_size(nr_objs, align);
	}
	*num = nr_objs;
	*left_over = slab_size - nr_objs*buffer_size - mgmt_size;
}

#if DEBUG
#define slab_error(cachep, msg) __slab_error(__func__, cachep, msg)

static void __slab_error(const char *function, struct kmem_cache *cachep,
			char *msg)
{
	printk(KERN_ERR "slab error in %s(): cache `%s': %s\n",
	       function, cachep->name, msg);
	dump_stack();
	add_taint(TAINT_BAD_PAGE);
}
#endif

/*
 * By default on NUMA we use alien caches to stage the freeing of
 * objects allocated from other nodes. This causes massive memory
 * inefficiencies when using fake NUMA setup to split memory into a
 * large number of small nodes, so it can be disabled on the command
 * line
  */

static int use_alien_caches __read_mostly = 1;
static int __init noaliencache_setup(char *s)
{
	use_alien_caches = 0;
	return 1;
}
__setup("noaliencache", noaliencache_setup);

static int __init slab_max_order_setup(char *str)
{
	get_option(&str, &slab_max_order);
	slab_max_order = slab_max_order < 0 ? 0 :
				min(slab_max_order, MAX_ORDER - 1);
	slab_max_order_set = true;

	return 1;
}
__setup("slab_max_order=", slab_max_order_setup);

#ifdef CONFIG_NUMA
/*
 * Special reaping functions for NUMA systems called from cache_reap().
 * These take care of doing round robin flushing of alien caches (containing
 * objects freed on different nodes from which they were allocated) and the
 * flushing of remote pcps by calling drain_node_pages.
 */
static DEFINE_PER_CPU(unsigned long, slab_reap_node);

static void init_reap_node(int cpu)
{
	int node;

	node = next_node(cpu_to_mem(cpu), node_online_map);
	if (node == MAX_NUMNODES)
		node = first_node(node_online_map);

	per_cpu(slab_reap_node, cpu) = node;
}

static void next_reap_node(void)
{
	int node = __this_cpu_read(slab_reap_node);

	node = next_node(node, node_online_map);
	if (unlikely(node >= MAX_NUMNODES))
		node = first_node(node_online_map);
	__this_cpu_write(slab_reap_node, node);
}

#else
#define init_reap_node(cpu) do { } while (0)
#define next_reap_node(void) do { } while (0)
#endif

/*
 * Initiate the reap timer running on the target CPU.  We run at around 1 to 2Hz
 * via the workqueue/eventd.
 * Add the CPU number into the expiration time to minimize the possibility of
 * the CPUs getting into lockstep and contending for the global cache chain
 * lock.
 */
static void __cpuinit start_cpu_timer(int cpu)
{
	struct delayed_work *reap_work = &per_cpu(slab_reap_work, cpu);

	/*
	 * When this gets called from do_initcalls via cpucache_init(),
	 * init_workqueues() has already run, so keventd will be setup
	 * at that time.
	 */
	if (keventd_up() && reap_work->work.func == NULL) {
		init_reap_node(cpu);
		INIT_DEFERRABLE_WORK(reap_work, cache_reap);
		schedule_delayed_work_on(cpu, reap_work,
					__round_jiffies_relative(HZ, cpu));
	}
}

static struct array_cache *alloc_arraycache(int node, int entries,
					    int batchcount, gfp_t gfp)
{
	int memsize = sizeof(void *) * entries + sizeof(struct array_cache);
	struct array_cache *nc = NULL;

	nc = kmalloc_node(memsize, gfp, node);
	/*
	 * The array_cache structures contain pointers to free object.
	 * However, when such objects are allocated or transferred to another
	 * cache the pointers are not cleared and they could be counted as
	 * valid references during a kmemleak scan. Therefore, kmemleak must
	 * not scan such objects.
	 */
	kmemleak_no_scan(nc);
	if (nc) {
		nc->avail = 0;
		nc->limit = entries;
		nc->batchcount = batchcount;
		nc->touched = 0;
		spin_lock_init(&nc->lock);
	}
	return nc;
}

static inline bool is_slab_pfmemalloc(struct slab *slabp)
{
	struct page *page = virt_to_page(slabp->s_mem);

	return PageSlabPfmemalloc(page);
}

/* Clears pfmemalloc_active if no slabs have pfmalloc set */
static void recheck_pfmemalloc_active(struct kmem_cache *cachep,
						struct array_cache *ac)
{
	struct kmem_list3 *l3 = cachep->nodelists[numa_mem_id()];
	struct slab *slabp;
	unsigned long flags;

	if (!pfmemalloc_active)
		return;

	spin_lock_irqsave(&l3->list_lock, flags);
	list_for_each_entry(slabp, &l3->slabs_full, list)
		if (is_slab_pfmemalloc(slabp))
			goto out;

	list_for_each_entry(slabp, &l3->slabs_partial, list)
		if (is_slab_pfmemalloc(slabp))
			goto out;

	list_for_each_entry(slabp, &l3->slabs_free, list)
		if (is_slab_pfmemalloc(slabp))
			goto out;

	pfmemalloc_active = false;
out:
	spin_unlock_irqrestore(&l3->list_lock, flags);
}

static void *__ac_get_obj(struct kmem_cache *cachep, struct array_cache *ac,
						gfp_t flags, bool force_refill)
{
	int i;
	void *objp = ac->entry[--ac->avail];

	/* Ensure the caller is allowed to use objects from PFMEMALLOC slab */
	if (unlikely(is_obj_pfmemalloc(objp))) {
		struct kmem_list3 *l3;

		if (gfp_pfmemalloc_allowed(flags)) {
			clear_obj_pfmemalloc(&objp);
			return objp;
		}

		/* The caller cannot use PFMEMALLOC objects, find another one */
		for (i = 0; i < ac->avail; i++) {
			/* If a !PFMEMALLOC object is found, swap them */
			if (!is_obj_pfmemalloc(ac->entry[i])) {
				objp = ac->entry[i];
				ac->entry[i] = ac->entry[ac->avail];
				ac->entry[ac->avail] = objp;
				return objp;
			}
		}

		/*
		 * If there are empty slabs on the slabs_free list and we are
		 * being forced to refill the cache, mark this one !pfmemalloc.
		 */
		l3 = cachep->nodelists[numa_mem_id()];
		if (!list_empty(&l3->slabs_free) && force_refill) {
			struct slab *slabp = virt_to_slab(objp);
			ClearPageSlabPfmemalloc(virt_to_head_page(slabp->s_mem));
			clear_obj_pfmemalloc(&objp);
			recheck_pfmemalloc_active(cachep, ac);
			return objp;
		}

		/* No !PFMEMALLOC objects available */
		ac->avail++;
		objp = NULL;
	}

	return objp;
}

static inline void *ac_get_obj(struct kmem_cache *cachep,
			struct array_cache *ac, gfp_t flags, bool force_refill)
{
	void *objp;

	if (unlikely(sk_memalloc_socks()))
		objp = __ac_get_obj(cachep, ac, flags, force_refill);
	else
		objp = ac->entry[--ac->avail];

	return objp;
}

static void *__ac_put_obj(struct kmem_cache *cachep, struct array_cache *ac,
								void *objp)
{
	if (unlikely(pfmemalloc_active)) {
		/* Some pfmemalloc slabs exist, check if this is one */
		struct page *page = virt_to_head_page(objp);
		if (PageSlabPfmemalloc(page))
			set_obj_pfmemalloc(&objp);
	}

	return objp;
}

static inline void ac_put_obj(struct kmem_cache *cachep, struct array_cache *ac,
								void *objp)
{
	if (unlikely(sk_memalloc_socks()))
		objp = __ac_put_obj(cachep, ac, objp);

	ac->entry[ac->avail++] = objp;
}

/*
 * Transfer objects in one arraycache to another.
 * Locking must be handled by the caller.
 *
 * Return the number of entries transferred.
 */
static int transfer_objects(struct array_cache *to,
		struct array_cache *from, unsigned int max)
{
	/* Figure out how many entries to transfer */
	int nr = min3(from->avail, max, to->limit - to->avail);

	if (!nr)
		return 0;

	memcpy(to->entry + to->avail, from->entry + from->avail -nr,
			sizeof(void *) *nr);

	from->avail -= nr;
	to->avail += nr;
	return nr;
}

#ifndef CONFIG_NUMA

#define drain_alien_cache(cachep, alien) do { } while (0)
#define reap_alien(cachep, l3) do { } while (0)

static inline struct array_cache **alloc_alien_cache(int node, int limit, gfp_t gfp)
{
	return (struct array_cache **)BAD_ALIEN_MAGIC;
}

static inline void free_alien_cache(struct array_cache **ac_ptr)
{
}

static inline int cache_free_alien(struct kmem_cache *cachep, void *objp)
{
	return 0;
}

static inline void *alternate_node_alloc(struct kmem_cache *cachep,
		gfp_t flags)
{
	return NULL;
}

static inline void *____cache_alloc_node(struct kmem_cache *cachep,
		 gfp_t flags, int nodeid)
{
	return NULL;
}

#else	/* CONFIG_NUMA */

static void *____cache_alloc_node(struct kmem_cache *, gfp_t, int);
static void *alternate_node_alloc(struct kmem_cache *, gfp_t);

static struct array_cache **alloc_alien_cache(int node, int limit, gfp_t gfp)
{
	struct array_cache **ac_ptr;
	int memsize = sizeof(void *) * nr_node_ids;
	int i;

	if (limit > 1)
		limit = 12;
	ac_ptr = kzalloc_node(memsize, gfp, node);
	if (ac_ptr) {
		for_each_node(i) {
			if (i == node || !node_online(i))
				continue;
			ac_ptr[i] = alloc_arraycache(node, limit, 0xbaadf00d, gfp);
			if (!ac_ptr[i]) {
				for (i--; i >= 0; i--)
					kfree(ac_ptr[i]);
				kfree(ac_ptr);
				return NULL;
			}
		}
	}
	return ac_ptr;
}

static void free_alien_cache(struct array_cache **ac_ptr)
{
	int i;

	if (!ac_ptr)
		return;
	for_each_node(i)
	    kfree(ac_ptr[i]);
	kfree(ac_ptr);
}

static void __drain_alien_cache(struct kmem_cache *cachep,
				struct array_cache *ac, int node)
{
	struct kmem_list3 *rl3 = cachep->nodelists[node];

	if (ac->avail) {
		spin_lock(&rl3->list_lock);
		/*
		 * Stuff objects into the remote nodes shared array first.
		 * That way we could avoid the overhead of putting the objects
		 * into the free lists and getting them back later.
		 */
		if (rl3->shared)
			transfer_objects(rl3->shared, ac, ac->limit);

		free_block(cachep, ac->entry, ac->avail, node);
		ac->avail = 0;
		spin_unlock(&rl3->list_lock);
	}
}

/*
 * Called from cache_reap() to regularly drain alien caches round robin.
 */
static void reap_alien(struct kmem_cache *cachep, struct kmem_list3 *l3)
{
	int node = __this_cpu_read(slab_reap_node);

	if (l3->alien) {
		struct array_cache *ac = l3->alien[node];

		if (ac && ac->avail && spin_trylock_irq(&ac->lock)) {
			__drain_alien_cache(cachep, ac, node);
			spin_unlock_irq(&ac->lock);
		}
	}
}

static void drain_alien_cache(struct kmem_cache *cachep,
				struct array_cache **alien)
{
	int i = 0;
	struct array_cache *ac;
	unsigned long flags;

	for_each_online_node(i) {
		ac = alien[i];
		if (ac) {
			spin_lock_irqsave(&ac->lock, flags);
			__drain_alien_cache(cachep, ac, i);
			spin_unlock_irqrestore(&ac->lock, flags);
		}
	}
}

static inline int cache_free_alien(struct kmem_cache *cachep, void *objp)
{
	struct slab *slabp = virt_to_slab(objp);
	int nodeid = slabp->nodeid;
	struct kmem_list3 *l3;
	struct array_cache *alien = NULL;
	int node;

	node = numa_mem_id();

	/*
	 * Make sure we are not freeing a object from another node to the array
	 * cache on this cpu.
	 */
	if (likely(slabp->nodeid == node))
		return 0;

	l3 = cachep->nodelists[node];
	STATS_INC_NODEFREES(cachep);
	if (l3->alien && l3->alien[nodeid]) {
		alien = l3->alien[nodeid];
		spin_lock(&alien->lock);
		if (unlikely(alien->avail == alien->limit)) {
			STATS_INC_ACOVERFLOW(cachep);
			__drain_alien_cache(cachep, alien, nodeid);
		}
		ac_put_obj(cachep, alien, objp);
		spin_unlock(&alien->lock);
	} else {
		spin_lock(&(cachep->nodelists[nodeid])->list_lock);
		free_block(cachep, &objp, 1, nodeid);
		spin_unlock(&(cachep->nodelists[nodeid])->list_lock);
	}
	return 1;
}
#endif

/*
 * Allocates and initializes nodelists for a node on each slab cache, used for
 * either memory or cpu hotplug.  If memory is being hot-added, the kmem_list3
 * will be allocated off-node since memory is not yet online for the new node.
 * When hotplugging memory or a cpu, existing nodelists are not replaced if
 * already in use.
 *
 * Must hold slab_mutex.
 */
static int init_cache_nodelists_node(int node)
{
	struct kmem_cache *cachep;
	struct kmem_list3 *l3;
	const int memsize = sizeof(struct kmem_list3);

	list_for_each_entry(cachep, &slab_caches, list) {
		/*
		 * Set up the size64 kmemlist for cpu before we can
		 * begin anything. Make sure some other cpu on this
		 * node has not already allocated this
		 */
		if (!cachep->nodelists[node]) {
			l3 = kmalloc_node(memsize, GFP_KERNEL, node);
			if (!l3)
				return -ENOMEM;
			kmem_list3_init(l3);
			l3->next_reap = jiffies + REAPTIMEOUT_LIST3 +
			    ((unsigned long)cachep) % REAPTIMEOUT_LIST3;

			/*
			 * The l3s don't come and go as CPUs come and
			 * go.  slab_mutex is sufficient
			 * protection here.
			 */
			cachep->nodelists[node] = l3;
		}

		spin_lock_irq(&cachep->nodelists[node]->list_lock);
		cachep->nodelists[node]->free_limit =
			(1 + nr_cpus_node(node)) *
			cachep->batchcount + cachep->num;
		spin_unlock_irq(&cachep->nodelists[node]->list_lock);
	}
	return 0;
}

static void __cpuinit cpuup_canceled(long cpu)
{
	struct kmem_cache *cachep;
	struct kmem_list3 *l3 = NULL;
	int node = cpu_to_mem(cpu);
	const struct cpumask *mask = cpumask_of_node(node);

	list_for_each_entry(cachep, &slab_caches, list) {
		struct array_cache *nc;
		struct array_cache *shared;
		struct array_cache **alien;

		/* cpu is dead; no one can alloc from it. */
		nc = cachep->array[cpu];
		cachep->array[cpu] = NULL;
		l3 = cachep->nodelists[node];

		if (!l3)
			goto free_array_cache;

		spin_lock_irq(&l3->list_lock);

		/* Free limit for this kmem_list3 */
		l3->free_limit -= cachep->batchcount;
		if (nc)
			free_block(cachep, nc->entry, nc->avail, node);

		if (!cpumask_empty(mask)) {
			spin_unlock_irq(&l3->list_lock);
			goto free_array_cache;
		}

		shared = l3->shared;
		if (shared) {
			free_block(cachep, shared->entry,
				   shared->avail, node);
			l3->shared = NULL;
		}

		alien = l3->alien;
		l3->alien = NULL;

		spin_unlock_irq(&l3->list_lock);

		kfree(shared);
		if (alien) {
			drain_alien_cache(cachep, alien);
			free_alien_cache(alien);
		}
free_array_cache:
		kfree(nc);
	}
	/*
	 * In the previous loop, all the objects were freed to
	 * the respective cache's slabs,  now we can go ahead and
	 * shrink each nodelist to its limit.
	 */
	list_for_each_entry(cachep, &slab_caches, list) {
		l3 = cachep->nodelists[node];
		if (!l3)
			continue;
		drain_freelist(cachep, l3, l3->free_objects);
	}
}

static int __cpuinit cpuup_prepare(long cpu)
{
	struct kmem_cache *cachep;
	struct kmem_list3 *l3 = NULL;
	int node = cpu_to_mem(cpu);
	int err;

	/*
	 * We need to do this right in the beginning since
	 * alloc_arraycache's are going to use this list.
	 * kmalloc_node allows us to add the slab to the right
	 * kmem_list3 and not this cpu's kmem_list3
	 */
	err = init_cache_nodelists_node(node);
	if (err < 0)
		goto bad;

	/*
	 * Now we can go ahead with allocating the shared arrays and
	 * array caches
	 */
	list_for_each_entry(cachep, &slab_caches, list) {
		struct array_cache *nc;
		struct array_cache *shared = NULL;
		struct array_cache **alien = NULL;

		nc = alloc_arraycache(node, cachep->limit,
					cachep->batchcount, GFP_KERNEL);
		if (!nc)
			goto bad;
		if (cachep->shared) {
			shared = alloc_arraycache(node,
				cachep->shared * cachep->batchcount,
				0xbaadf00d, GFP_KERNEL);
			if (!shared) {
				kfree(nc);
				goto bad;
			}
		}
		if (use_alien_caches) {
			alien = alloc_alien_cache(node, cachep->limit, GFP_KERNEL);
			if (!alien) {
				kfree(shared);
				kfree(nc);
				goto bad;
			}
		}
		cachep->array[cpu] = nc;
		l3 = cachep->nodelists[node];
		BUG_ON(!l3);

		spin_lock_irq(&l3->list_lock);
		if (!l3->shared) {
			/*
			 * We are serialised from CPU_DEAD or
			 * CPU_UP_CANCELLED by the cpucontrol lock
			 */
			l3->shared = shared;
			shared = NULL;
		}
#ifdef CONFIG_NUMA
		if (!l3->alien) {
			l3->alien = alien;
			alien = NULL;
		}
#endif
		spin_unlock_irq(&l3->list_lock);
		kfree(shared);
		free_alien_cache(alien);
		if (cachep->flags & SLAB_DEBUG_OBJECTS)
			slab_set_debugobj_lock_classes_node(cachep, node);
		else if (!OFF_SLAB(cachep) &&
			 !(cachep->flags & SLAB_DESTROY_BY_RCU))
			on_slab_lock_classes_node(cachep, node);
	}
	init_node_lock_keys(node);

	return 0;
bad:
	cpuup_canceled(cpu);
	return -ENOMEM;
}

static int __cpuinit cpuup_callback(struct notifier_block *nfb,
				    unsigned long action, void *hcpu)
{
	long cpu = (long)hcpu;
	int err = 0;

	switch (action) {
	case CPU_UP_PREPARE:
	case CPU_UP_PREPARE_FROZEN:
		mutex_lock(&slab_mutex);
		err = cpuup_prepare(cpu);
		mutex_unlock(&slab_mutex);
		break;
	case CPU_ONLINE:
	case CPU_ONLINE_FROZEN:
		start_cpu_timer(cpu);
		break;
#ifdef CONFIG_HOTPLUG_CPU
  	case CPU_DOWN_PREPARE:
  	case CPU_DOWN_PREPARE_FROZEN:
		/*
		 * Shutdown cache reaper. Note that the slab_mutex is
		 * held so that if cache_reap() is invoked it cannot do
		 * anything expensive but will only modify reap_work
		 * and reschedule the timer.
		*/
		cancel_delayed_work_sync(&per_cpu(slab_reap_work, cpu));
		/* Now the cache_reaper is guaranteed to be not running. */
		per_cpu(slab_reap_work, cpu).work.func = NULL;
  		break;
  	case CPU_DOWN_FAILED:
  	case CPU_DOWN_FAILED_FROZEN:
		start_cpu_timer(cpu);
  		break;
	case CPU_DEAD:
	case CPU_DEAD_FROZEN:
		/*
		 * Even if all the cpus of a node are down, we don't free the
		 * kmem_list3 of any cache. This to avoid a race between
		 * cpu_down, and a kmalloc allocation from another cpu for
		 * memory from the node of the cpu going down.  The list3
		 * structure is usually allocated from kmem_cache_create() and
		 * gets destroyed at kmem_cache_destroy().
		 */
		/* fall through */
#endif
	case CPU_UP_CANCELED:
	case CPU_UP_CANCELED_FROZEN:
		mutex_lock(&slab_mutex);
		cpuup_canceled(cpu);
		mutex_unlock(&slab_mutex);
		break;
	}
	return notifier_from_errno(err);
}

static struct notifier_block __cpuinitdata cpucache_notifier = {
	&cpuup_callback, NULL, 0
};

#if defined(CONFIG_NUMA) && defined(CONFIG_MEMORY_HOTPLUG)
/*
 * Drains freelist for a node on each slab cache, used for memory hot-remove.
 * Returns -EBUSY if all objects cannot be drained so that the node is not
 * removed.
 *
 * Must hold slab_mutex.
 */
static int __meminit drain_cache_nodelists_node(int node)
{
	struct kmem_cache *cachep;
	int ret = 0;

	list_for_each_entry(cachep, &slab_caches, list) {
		struct kmem_list3 *l3;

		l3 = cachep->nodelists[node];
		if (!l3)
			continue;

		drain_freelist(cachep, l3, l3->free_objects);

		if (!list_empty(&l3->slabs_full) ||
		    !list_empty(&l3->slabs_partial)) {
			ret = -EBUSY;
			break;
		}
	}
	return ret;
}

static int __meminit slab_memory_callback(struct notifier_block *self,
					unsigned long action, void *arg)
{
	struct memory_notify *mnb = arg;
	int ret = 0;
	int nid;

	nid = mnb->status_change_nid;
	if (nid < 0)
		goto out;

	switch (action) {
	case MEM_GOING_ONLINE:
		mutex_lock(&slab_mutex);
		ret = init_cache_nodelists_node(nid);
		mutex_unlock(&slab_mutex);
		break;
	case MEM_GOING_OFFLINE:
		mutex_lock(&slab_mutex);
		ret = drain_cache_nodelists_node(nid);
		mutex_unlock(&slab_mutex);
		break;
	case MEM_ONLINE:
	case MEM_OFFLINE:
	case MEM_CANCEL_ONLINE:
	case MEM_CANCEL_OFFLINE:
		break;
	}
out:
	return notifier_from_errno(ret);
}
#endif /* CONFIG_NUMA && CONFIG_MEMORY_HOTPLUG */

/*
 * swap the static kmem_list3 with kmalloced memory
 */
static void __init init_list(struct kmem_cache *cachep, struct kmem_list3 *list,
				int nodeid)
{
	struct kmem_list3 *ptr;

	ptr = kmalloc_node(sizeof(struct kmem_list3), GFP_NOWAIT, nodeid);
	BUG_ON(!ptr);

	memcpy(ptr, list, sizeof(struct kmem_list3));
	/*
	 * Do not assume that spinlocks can be initialized via memcpy:
	 */
	spin_lock_init(&ptr->list_lock);

	MAKE_ALL_LISTS(cachep, ptr, nodeid);
	cachep->nodelists[nodeid] = ptr;
}

/*
 * For setting up all the kmem_list3s for cache whose buffer_size is same as
 * size of kmem_list3.
 */
static void __init set_up_list3s(struct kmem_cache *cachep, int index)
{
	int node;

	for_each_online_node(node) {
		cachep->nodelists[node] = &initkmem_list3[index + node];
		cachep->nodelists[node]->next_reap = jiffies +
		    REAPTIMEOUT_LIST3 +
		    ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
	}
}

/*
 * The memory after the last cpu cache pointer is used for the
 * the nodelists pointer.
 */
static void setup_nodelists_pointer(struct kmem_cache *cachep)
{
	cachep->nodelists = (struct kmem_list3 **)&cachep->array[nr_cpu_ids];
}

/*
 * Initialisation.  Called after the page allocator have been initialised and
 * before smp_init().
 */
void __init kmem_cache_init(void)
{
	struct cache_sizes *sizes;
	struct cache_names *names;
	int i;

	kmem_cache = &kmem_cache_boot;
	setup_nodelists_pointer(kmem_cache);

	if (num_possible_nodes() == 1)
		use_alien_caches = 0;

	for (i = 0; i < NUM_INIT_LISTS; i++)
		kmem_list3_init(&initkmem_list3[i]);

	set_up_list3s(kmem_cache, CACHE_CACHE);

	/*
	 * Fragmentation resistance on low memory - only use bigger
	 * page orders on machines with more than 32MB of memory if
	 * not overridden on the command line.
	 */
	if (!slab_max_order_set && totalram_pages > (32 << 20) >> PAGE_SHIFT)
		slab_max_order = SLAB_MAX_ORDER_HI;

	/* Bootstrap is tricky, because several objects are allocated
	 * from caches that do not exist yet:
	 * 1) initialize the kmem_cache cache: it contains the struct
	 *    kmem_cache structures of all caches, except kmem_cache itself:
	 *    kmem_cache is statically allocated.
	 *    Initially an __init data area is used for the head array and the
	 *    kmem_list3 structures, it's replaced with a kmalloc allocated
	 *    array at the end of the bootstrap.
	 * 2) Create the first kmalloc cache.
	 *    The struct kmem_cache for the new cache is allocated normally.
	 *    An __init data area is used for the head array.
	 * 3) Create the remaining kmalloc caches, with minimally sized
	 *    head arrays.
	 * 4) Replace the __init data head arrays for kmem_cache and the first
	 *    kmalloc cache with kmalloc allocated arrays.
	 * 5) Replace the __init data for kmem_list3 for kmem_cache and
	 *    the other cache's with kmalloc allocated memory.
	 * 6) Resize the head arrays of the kmalloc caches to their final sizes.
	 */

	/* 1) create the kmem_cache */

	/*
	 * struct kmem_cache size depends on nr_node_ids & nr_cpu_ids
	 */
	create_boot_cache(kmem_cache, "kmem_cache",
		offsetof(struct kmem_cache, array[nr_cpu_ids]) +
				  nr_node_ids * sizeof(struct kmem_list3 *),
				  SLAB_HWCACHE_ALIGN);
	list_add(&kmem_cache->list, &slab_caches);

	/* 2+3) create the kmalloc caches */
	sizes = malloc_sizes;
	names = cache_names;

	/*
	 * Initialize the caches that provide memory for the array cache and the
	 * kmem_list3 structures first.  Without this, further allocations will
	 * bug.
	 */

	sizes[INDEX_AC].cs_cachep = create_kmalloc_cache(names[INDEX_AC].name,
					sizes[INDEX_AC].cs_size, ARCH_KMALLOC_FLAGS);

	if (INDEX_AC != INDEX_L3)
		sizes[INDEX_L3].cs_cachep =
			create_kmalloc_cache(names[INDEX_L3].name,
				sizes[INDEX_L3].cs_size, ARCH_KMALLOC_FLAGS);

	slab_early_init = 0;

	while (sizes->cs_size != ULONG_MAX) {
		/*
		 * For performance, all the general caches are L1 aligned.
		 * This should be particularly beneficial on SMP boxes, as it
		 * eliminates "false sharing".
		 * Note for systems short on memory removing the alignment will
		 * allow tighter packing of the smaller caches.
		 */
		if (!sizes->cs_cachep)
			sizes->cs_cachep = create_kmalloc_cache(names->name,
					sizes->cs_size, ARCH_KMALLOC_FLAGS);

#ifdef CONFIG_ZONE_DMA
		sizes->cs_dmacachep = create_kmalloc_cache(
			names->name_dma, sizes->cs_size,
			SLAB_CACHE_DMA|ARCH_KMALLOC_FLAGS);
#endif
		sizes++;
		names++;
	}
	/* 4) Replace the bootstrap head arrays */
	{
		struct array_cache *ptr;

		ptr = kmalloc(sizeof(struct arraycache_init), GFP_NOWAIT);

		memcpy(ptr, cpu_cache_get(kmem_cache),
		       sizeof(struct arraycache_init));
		/*
		 * Do not assume that spinlocks can be initialized via memcpy:
		 */
		spin_lock_init(&ptr->lock);

		kmem_cache->array[smp_processor_id()] = ptr;

		ptr = kmalloc(sizeof(struct arraycache_init), GFP_NOWAIT);

		BUG_ON(cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep)
		       != &initarray_generic.cache);
		memcpy(ptr, cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep),
		       sizeof(struct arraycache_init));
		/*
		 * Do not assume that spinlocks can be initialized via memcpy:
		 */
		spin_lock_init(&ptr->lock);

		malloc_sizes[INDEX_AC].cs_cachep->array[smp_processor_id()] =
		    ptr;
	}
	/* 5) Replace the bootstrap kmem_list3's */
	{
		int nid;

		for_each_online_node(nid) {
			init_list(kmem_cache, &initkmem_list3[CACHE_CACHE + nid], nid);

			init_list(malloc_sizes[INDEX_AC].cs_cachep,
				  &initkmem_list3[SIZE_AC + nid], nid);

			if (INDEX_AC != INDEX_L3) {
				init_list(malloc_sizes[INDEX_L3].cs_cachep,
					  &initkmem_list3[SIZE_L3 + nid], nid);
			}
		}
	}

	slab_state = UP;
}

void __init kmem_cache_init_late(void)
{
	struct kmem_cache *cachep;

	slab_state = UP;

	/* 6) resize the head arrays to their final sizes */
	mutex_lock(&slab_mutex);
	list_for_each_entry(cachep, &slab_caches, list)
		if (enable_cpucache(cachep, GFP_NOWAIT))
			BUG();
	mutex_unlock(&slab_mutex);

	/* Annotate slab for lockdep -- annotate the malloc caches */
	init_lock_keys();

	/* Done! */
	slab_state = FULL;

	/*
	 * Register a cpu startup notifier callback that initializes
	 * cpu_cache_get for all new cpus
	 */
	register_cpu_notifier(&cpucache_notifier);

#ifdef CONFIG_NUMA
	/*
	 * Register a memory hotplug callback that initializes and frees
	 * nodelists.
	 */
	hotplug_memory_notifier(slab_memory_callback, SLAB_CALLBACK_PRI);
#endif

	/*
	 * The reap timers are started later, with a module init call: That part
	 * of the kernel is not yet operational.
	 */
}

static int __init cpucache_init(void)
{
	int cpu;

	/*
	 * Register the timers that return unneeded pages to the page allocator
	 */
	for_each_online_cpu(cpu)
		start_cpu_timer(cpu);

	/* Done! */
	slab_state = FULL;
	return 0;
}
__initcall(cpucache_init);

static noinline void
slab_out_of_memory(struct kmem_cache *cachep, gfp_t gfpflags, int nodeid)
{
	struct kmem_list3 *l3;
	struct slab *slabp;
	unsigned long flags;
	int node;

	printk(KERN_WARNING
		"SLAB: Unable to allocate memory on node %d (gfp=0x%x)\n",
		nodeid, gfpflags);
	printk(KERN_WARNING "  cache: %s, object size: %d, order: %d\n",
		cachep->name, cachep->size, cachep->gfporder);

	for_each_online_node(node) {
		unsigned long active_objs = 0, num_objs = 0, free_objects = 0;
		unsigned long active_slabs = 0, num_slabs = 0;

		l3 = cachep->nodelists[node];
		if (!l3)
			continue;

		spin_lock_irqsave(&l3->list_lock, flags);
		list_for_each_entry(slabp, &l3->slabs_full, list) {
			active_objs += cachep->num;
			active_slabs++;
		}
		list_for_each_entry(slabp, &l3->slabs_partial, list) {
			active_objs += slabp->inuse;
			active_slabs++;
		}
		list_for_each_entry(slabp, &l3->slabs_free, list)
			num_slabs++;

		free_objects += l3->free_objects;
		spin_unlock_irqrestore(&l3->list_lock, flags);

		num_slabs += active_slabs;
		num_objs = num_slabs * cachep->num;
		printk(KERN_WARNING
			"  node %d: slabs: %ld/%ld, objs: %ld/%ld, free: %ld\n",
			node, active_slabs, num_slabs, active_objs, num_objs,
			free_objects);
	}
}

/*
 * Interface to system's page allocator. No need to hold the cache-lock.
 *
 * If we requested dmaable memory, we will get it. Even if we
 * did not request dmaable memory, we might get it, but that
 * would be relatively rare and ignorable.
 */
static void *kmem_getpages(struct kmem_cache *cachep, gfp_t flags, int nodeid)
{
	struct page *page;
	int nr_pages;
	int i;

#ifndef CONFIG_MMU
	/*
	 * Nommu uses slab's for process anonymous memory allocations, and thus
	 * requires __GFP_COMP to properly refcount higher order allocations
	 */
	flags |= __GFP_COMP;
#endif

	flags |= cachep->allocflags;
	if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
		flags |= __GFP_RECLAIMABLE;

	page = alloc_pages_exact_node(nodeid, flags | __GFP_NOTRACK, cachep->gfporder);
	if (!page) {
		if (!(flags & __GFP_NOWARN) && printk_ratelimit())
			slab_out_of_memory(cachep, flags, nodeid);
		return NULL;
	}

	/* Record if ALLOC_NO_WATERMARKS was set when allocating the slab */
	if (unlikely(page->pfmemalloc))
		pfmemalloc_active = true;

	nr_pages = (1 << cachep->gfporder);
	if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
		add_zone_page_state(page_zone(page),
			NR_SLAB_RECLAIMABLE, nr_pages);
	else
		add_zone_page_state(page_zone(page),
			NR_SLAB_UNRECLAIMABLE, nr_pages);
	for (i = 0; i < nr_pages; i++) {
		__SetPageSlab(page + i);

		if (page->pfmemalloc)
			SetPageSlabPfmemalloc(page + i);
	}
	memcg_bind_pages(cachep, cachep->gfporder);

	if (kmemcheck_enabled && !(cachep->flags & SLAB_NOTRACK)) {
		kmemcheck_alloc_shadow(page, cachep->gfporder, flags, nodeid);

		if (cachep->ctor)
			kmemcheck_mark_uninitialized_pages(page, nr_pages);
		else
			kmemcheck_mark_unallocated_pages(page, nr_pages);
	}

	return page_address(page);
}

/*
 * Interface to system's page release.
 */
static void kmem_freepages(struct kmem_cache *cachep, void *addr)
{
	unsigned long i = (1 << cachep->gfporder);
	struct page *page = virt_to_page(addr);
	const unsigned long nr_freed = i;

	kmemcheck_free_shadow(page, cachep->gfporder);

	if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
		sub_zone_page_state(page_zone(page),
				NR_SLAB_RECLAIMABLE, nr_freed);
	else
		sub_zone_page_state(page_zone(page),
				NR_SLAB_UNRECLAIMABLE, nr_freed);
	while (i--) {
		BUG_ON(!PageSlab(page));
		__ClearPageSlabPfmemalloc(page);
		__ClearPageSlab(page);
		page++;
	}

	memcg_release_pages(cachep, cachep->gfporder);
	if (current->reclaim_state)
		current->reclaim_state->reclaimed_slab += nr_freed;
	free_memcg_kmem_pages((unsigned long)addr, cachep->gfporder);
}

static void kmem_rcu_free(struct rcu_head *head)
{
	struct slab_rcu *slab_rcu = (struct slab_rcu *)head;
	struct kmem_cache *cachep = slab_rcu->cachep;

	kmem_freepages(cachep, slab_rcu->addr);
	if (OFF_SLAB(cachep))
		kmem_cache_free(cachep->slabp_cache, slab_rcu);
}

#if DEBUG

#ifdef CONFIG_DEBUG_PAGEALLOC
static void store_stackinfo(struct kmem_cache *cachep, unsigned long *addr,
			    unsigned long caller)
{
	int size = cachep->object_size;

	addr = (unsigned long *)&((char *)addr)[obj_offset(cachep)];

	if (size < 5 * sizeof(unsigned long))
		return;

	*addr++ = 0x12345678;
	*addr++ = caller;
	*addr++ = smp_processor_id();
	size -= 3 * sizeof(unsigned long);
	{
		unsigned long *sptr = &caller;
		unsigned long svalue;

		while (!kstack_end(sptr)) {
			svalue = *sptr++;
			if (kernel_text_address(svalue)) {
				*addr++ = svalue;
				size -= sizeof(unsigned long);
				if (size <= sizeof(unsigned long))
					break;
			}
		}

	}
	*addr++ = 0x87654321;
}
#endif

static void poison_obj(struct kmem_cache *cachep, void *addr, unsigned char val)
{
	int size = cachep->object_size;
	addr = &((char *)addr)[obj_offset(cachep)];

	memset(addr, val, size);
	*(unsigned char *)(addr + size - 1) = POISON_END;
}

static void dump_line(char *data, int offset, int limit)
{
	int i;
	unsigned char error = 0;
	int bad_count = 0;

	printk(KERN_ERR "%03x: ", offset);
	for (i = 0; i < limit; i++) {
		if (data[offset + i] != POISON_FREE) {
			error = data[offset + i];
			bad_count++;
		}
	}
	print_hex_dump(KERN_CONT, "", 0, 16, 1,
			&data[offset], limit, 1);

	if (bad_count == 1) {
		error ^= POISON_FREE;
		if (!(error & (error - 1))) {
			printk(KERN_ERR "Single bit error detected. Probably "
					"bad RAM.\n");
#ifdef CONFIG_X86
			printk(KERN_ERR "Run memtest86+ or a similar memory "
					"test tool.\n");
#else
			printk(KERN_ERR "Run a memory test tool.\n");
#endif
		}
	}
}
#endif

#if DEBUG

static void print_objinfo(struct kmem_cache *cachep, void *objp, int lines)
{
	int i, size;
	char *realobj;

	if (cachep->flags & SLAB_RED_ZONE) {
		printk(KERN_ERR "Redzone: 0x%llx/0x%llx.\n",
			*dbg_redzone1(cachep, objp),
			*dbg_redzone2(cachep, objp));
	}

	if (cachep->flags & SLAB_STORE_USER) {
		printk(KERN_ERR "Last user: [<%p>]",
			*dbg_userword(cachep, objp));
		print_symbol("(%s)",
				(unsigned long)*dbg_userword(cachep, objp));
		printk("\n");
	}
	realobj = (char *)objp + obj_offset(cachep);
	size = cachep->object_size;
	for (i = 0; i < size && lines; i += 16, lines--) {
		int limit;
		limit = 16;
		if (i + limit > size)
			limit = size - i;
		dump_line(realobj, i, limit);
	}
}

static void check_poison_obj(struct kmem_cache *cachep, void *objp)
{
	char *realobj;
	int size, i;
	int lines = 0;

	realobj = (char *)objp + obj_offset(cachep);
	size = cachep->object_size;

	for (i = 0; i < size; i++) {
		char exp = POISON_FREE;
		if (i == size - 1)
			exp = POISON_END;
		if (realobj[i] != exp) {
			int limit;
			/* Mismatch ! */
			/* Print header */
			if (lines == 0) {
				printk(KERN_ERR
					"Slab corruption (%s): %s start=%p, len=%d\n",
					print_tainted(), cachep->name, realobj, size);
				print_objinfo(cachep, objp, 0);
			}
			/* Hexdump the affected line */
			i = (i / 16) * 16;
			limit = 16;
			if (i + limit > size)
				limit = size - i;
			dump_line(realobj, i, limit);
			i += 16;
			lines++;
			/* Limit to 5 lines */
			if (lines > 5)
				break;
		}
	}
	if (lines != 0) {
		/* Print some data about the neighboring objects, if they
		 * exist:
		 */
		struct slab *slabp = virt_to_slab(objp);
		unsigned int objnr;

		objnr = obj_to_index(cachep, slabp, objp);
		if (objnr) {
			objp = index_to_obj(cachep, slabp, objnr - 1);