Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 1 | import unittest |
Tim Peters | 4190fb8 | 2003-02-02 16:09:05 +0000 | [diff] [blame] | 2 | import pickle |
Tim Peters | 8587b3c | 2003-02-13 15:44:41 +0000 | [diff] [blame] | 3 | import cPickle |
Amaury Forgeot d'Arc | 74b3016 | 2009-07-23 19:26:02 +0000 | [diff] [blame] | 4 | import StringIO |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 5 | import cStringIO |
Tim Peters | 31f119e | 2003-02-03 16:20:13 +0000 | [diff] [blame] | 6 | import pickletools |
Georg Brandl | dffbf5f | 2008-05-20 07:49:57 +0000 | [diff] [blame] | 7 | import copy_reg |
Tim Peters | 4190fb8 | 2003-02-02 16:09:05 +0000 | [diff] [blame] | 8 | |
Benjamin Peterson | d627e12 | 2013-03-30 10:36:31 -0400 | [diff] [blame^] | 9 | from test.test_support import TestFailed, verbose, have_unicode, TESTFN |
| 10 | try: |
| 11 | from test.test_support import _2G, _1M, precisionbigmemtest |
| 12 | except ImportError: |
| 13 | # this import might fail when run on older Python versions by test_xpickle |
| 14 | _2G = _1G = 0 |
| 15 | def precisionbigmemtest(*args, **kwargs): |
| 16 | return lambda self: None |
Tim Peters | e089c68 | 2001-04-10 03:41:41 +0000 | [diff] [blame] | 17 | |
Tim Peters | ee1a53c | 2003-02-02 02:57:53 +0000 | [diff] [blame] | 18 | # Tests that try a number of pickle protocols should have a |
| 19 | # for proto in protocols: |
Tim Peters | 8587b3c | 2003-02-13 15:44:41 +0000 | [diff] [blame] | 20 | # kind of outer loop. |
| 21 | assert pickle.HIGHEST_PROTOCOL == cPickle.HIGHEST_PROTOCOL == 2 |
| 22 | protocols = range(pickle.HIGHEST_PROTOCOL + 1) |
Tim Peters | ee1a53c | 2003-02-02 02:57:53 +0000 | [diff] [blame] | 23 | |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 24 | # Copy of test.test_support.run_with_locale. This is needed to support Python |
| 25 | # 2.4, which didn't include it. This is all to support test_xpickle, which |
| 26 | # bounces pickled objects through older Python versions to test backwards |
| 27 | # compatibility. |
| 28 | def run_with_locale(catstr, *locales): |
| 29 | def decorator(func): |
| 30 | def inner(*args, **kwds): |
| 31 | try: |
| 32 | import locale |
| 33 | category = getattr(locale, catstr) |
| 34 | orig_locale = locale.setlocale(category) |
| 35 | except AttributeError: |
| 36 | # if the test author gives us an invalid category string |
| 37 | raise |
| 38 | except: |
| 39 | # cannot retrieve original locale, so do nothing |
| 40 | locale = orig_locale = None |
| 41 | else: |
| 42 | for loc in locales: |
| 43 | try: |
| 44 | locale.setlocale(category, loc) |
| 45 | break |
| 46 | except: |
| 47 | pass |
| 48 | |
| 49 | # now run the function, resetting the locale on exceptions |
| 50 | try: |
| 51 | return func(*args, **kwds) |
| 52 | finally: |
| 53 | if locale and orig_locale: |
| 54 | locale.setlocale(category, orig_locale) |
| 55 | inner.func_name = func.func_name |
| 56 | inner.__doc__ = func.__doc__ |
| 57 | return inner |
| 58 | return decorator |
| 59 | |
Tim Peters | 22e7171 | 2003-02-03 22:27:38 +0000 | [diff] [blame] | 60 | |
| 61 | # Return True if opcode code appears in the pickle, else False. |
| 62 | def opcode_in_pickle(code, pickle): |
| 63 | for op, dummy, dummy in pickletools.genops(pickle): |
| 64 | if op.code == code: |
| 65 | return True |
| 66 | return False |
| 67 | |
Tim Peters | 8d2613a | 2003-02-11 16:40:16 +0000 | [diff] [blame] | 68 | # Return the number of times opcode code appears in pickle. |
| 69 | def count_opcode(code, pickle): |
| 70 | n = 0 |
| 71 | for op, dummy, dummy in pickletools.genops(pickle): |
| 72 | if op.code == code: |
| 73 | n += 1 |
| 74 | return n |
| 75 | |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 76 | # We can't very well test the extension registry without putting known stuff |
| 77 | # in it, but we have to be careful to restore its original state. Code |
| 78 | # should do this: |
| 79 | # |
| 80 | # e = ExtensionSaver(extension_code) |
| 81 | # try: |
| 82 | # fiddle w/ the extension registry's stuff for extension_code |
| 83 | # finally: |
| 84 | # e.restore() |
| 85 | |
| 86 | class ExtensionSaver: |
| 87 | # Remember current registration for code (if any), and remove it (if |
| 88 | # there is one). |
| 89 | def __init__(self, code): |
| 90 | self.code = code |
Georg Brandl | dffbf5f | 2008-05-20 07:49:57 +0000 | [diff] [blame] | 91 | if code in copy_reg._inverted_registry: |
| 92 | self.pair = copy_reg._inverted_registry[code] |
| 93 | copy_reg.remove_extension(self.pair[0], self.pair[1], code) |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 94 | else: |
| 95 | self.pair = None |
| 96 | |
| 97 | # Restore previous registration for code. |
| 98 | def restore(self): |
| 99 | code = self.code |
Georg Brandl | dffbf5f | 2008-05-20 07:49:57 +0000 | [diff] [blame] | 100 | curpair = copy_reg._inverted_registry.get(code) |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 101 | if curpair is not None: |
Georg Brandl | dffbf5f | 2008-05-20 07:49:57 +0000 | [diff] [blame] | 102 | copy_reg.remove_extension(curpair[0], curpair[1], code) |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 103 | pair = self.pair |
| 104 | if pair is not None: |
Georg Brandl | dffbf5f | 2008-05-20 07:49:57 +0000 | [diff] [blame] | 105 | copy_reg.add_extension(pair[0], pair[1], code) |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 106 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 107 | class C: |
| 108 | def __cmp__(self, other): |
| 109 | return cmp(self.__dict__, other.__dict__) |
| 110 | |
| 111 | import __main__ |
| 112 | __main__.C = C |
| 113 | C.__module__ = "__main__" |
| 114 | |
| 115 | class myint(int): |
| 116 | def __init__(self, x): |
| 117 | self.str = str(x) |
| 118 | |
| 119 | class initarg(C): |
Guido van Rossum | 1444f67 | 2001-12-19 16:38:29 +0000 | [diff] [blame] | 120 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 121 | def __init__(self, a, b): |
| 122 | self.a = a |
| 123 | self.b = b |
| 124 | |
| 125 | def __getinitargs__(self): |
| 126 | return self.a, self.b |
| 127 | |
Guido van Rossum | 04a8661 | 2001-12-19 16:58:54 +0000 | [diff] [blame] | 128 | class metaclass(type): |
| 129 | pass |
| 130 | |
| 131 | class use_metaclass(object): |
| 132 | __metaclass__ = metaclass |
| 133 | |
Antoine Pitrou | 561a821 | 2011-10-04 09:34:48 +0200 | [diff] [blame] | 134 | class pickling_metaclass(type): |
| 135 | def __eq__(self, other): |
| 136 | return (type(self) == type(other) and |
| 137 | self.reduce_args == other.reduce_args) |
| 138 | |
| 139 | def __reduce__(self): |
| 140 | return (create_dynamic_class, self.reduce_args) |
| 141 | |
Ezio Melotti | 030aa35 | 2011-11-06 18:50:32 +0200 | [diff] [blame] | 142 | __hash__ = None |
| 143 | |
Antoine Pitrou | 561a821 | 2011-10-04 09:34:48 +0200 | [diff] [blame] | 144 | def create_dynamic_class(name, bases): |
| 145 | result = pickling_metaclass(name, bases, dict()) |
| 146 | result.reduce_args = (name, bases) |
| 147 | return result |
| 148 | |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 149 | # DATA0 .. DATA2 are the pickles we expect under the various protocols, for |
| 150 | # the object returned by create_data(). |
Tim Peters | ee1a53c | 2003-02-02 02:57:53 +0000 | [diff] [blame] | 151 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 152 | # break into multiple strings to avoid confusing font-lock-mode |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 153 | DATA0 = """(lp1 |
Tim Peters | e935816 | 2001-01-22 22:05:20 +0000 | [diff] [blame] | 154 | I0 |
| 155 | aL1L |
Tim Peters | 461922a | 2001-04-09 20:07:05 +0000 | [diff] [blame] | 156 | aF2 |
Tim Peters | e935816 | 2001-01-22 22:05:20 +0000 | [diff] [blame] | 157 | ac__builtin__ |
| 158 | complex |
Tim Peters | 461922a | 2001-04-09 20:07:05 +0000 | [diff] [blame] | 159 | p2 |
| 160 | """ + \ |
| 161 | """(F3 |
| 162 | F0 |
| 163 | tRp3 |
| 164 | aI1 |
| 165 | aI-1 |
| 166 | aI255 |
| 167 | aI-255 |
| 168 | aI-256 |
| 169 | aI65535 |
| 170 | aI-65535 |
| 171 | aI-65536 |
| 172 | aI2147483647 |
| 173 | aI-2147483647 |
| 174 | aI-2147483648 |
| 175 | a""" + \ |
| 176 | """(S'abc' |
Tim Peters | e935816 | 2001-01-22 22:05:20 +0000 | [diff] [blame] | 177 | p4 |
| 178 | g4 |
Tim Peters | 461922a | 2001-04-09 20:07:05 +0000 | [diff] [blame] | 179 | """ + \ |
Guido van Rossum | 42f92da | 2001-04-16 00:28:21 +0000 | [diff] [blame] | 180 | """(i__main__ |
Tim Peters | e935816 | 2001-01-22 22:05:20 +0000 | [diff] [blame] | 181 | C |
| 182 | p5 |
Tim Peters | 461922a | 2001-04-09 20:07:05 +0000 | [diff] [blame] | 183 | """ + \ |
Tim Peters | e935816 | 2001-01-22 22:05:20 +0000 | [diff] [blame] | 184 | """(dp6 |
| 185 | S'foo' |
| 186 | p7 |
| 187 | I1 |
| 188 | sS'bar' |
| 189 | p8 |
| 190 | I2 |
| 191 | sbg5 |
| 192 | tp9 |
| 193 | ag9 |
| 194 | aI5 |
| 195 | a. |
| 196 | """ |
| 197 | |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 198 | # Disassembly of DATA0. |
| 199 | DATA0_DIS = """\ |
| 200 | 0: ( MARK |
| 201 | 1: l LIST (MARK at 0) |
| 202 | 2: p PUT 1 |
| 203 | 5: I INT 0 |
| 204 | 8: a APPEND |
| 205 | 9: L LONG 1L |
| 206 | 13: a APPEND |
| 207 | 14: F FLOAT 2.0 |
| 208 | 17: a APPEND |
| 209 | 18: c GLOBAL '__builtin__ complex' |
| 210 | 39: p PUT 2 |
| 211 | 42: ( MARK |
| 212 | 43: F FLOAT 3.0 |
| 213 | 46: F FLOAT 0.0 |
| 214 | 49: t TUPLE (MARK at 42) |
| 215 | 50: R REDUCE |
| 216 | 51: p PUT 3 |
| 217 | 54: a APPEND |
| 218 | 55: I INT 1 |
| 219 | 58: a APPEND |
| 220 | 59: I INT -1 |
| 221 | 63: a APPEND |
| 222 | 64: I INT 255 |
| 223 | 69: a APPEND |
| 224 | 70: I INT -255 |
| 225 | 76: a APPEND |
| 226 | 77: I INT -256 |
| 227 | 83: a APPEND |
| 228 | 84: I INT 65535 |
| 229 | 91: a APPEND |
| 230 | 92: I INT -65535 |
| 231 | 100: a APPEND |
| 232 | 101: I INT -65536 |
| 233 | 109: a APPEND |
| 234 | 110: I INT 2147483647 |
| 235 | 122: a APPEND |
| 236 | 123: I INT -2147483647 |
| 237 | 136: a APPEND |
| 238 | 137: I INT -2147483648 |
| 239 | 150: a APPEND |
| 240 | 151: ( MARK |
| 241 | 152: S STRING 'abc' |
| 242 | 159: p PUT 4 |
| 243 | 162: g GET 4 |
| 244 | 165: ( MARK |
| 245 | 166: i INST '__main__ C' (MARK at 165) |
| 246 | 178: p PUT 5 |
| 247 | 181: ( MARK |
| 248 | 182: d DICT (MARK at 181) |
| 249 | 183: p PUT 6 |
| 250 | 186: S STRING 'foo' |
| 251 | 193: p PUT 7 |
| 252 | 196: I INT 1 |
| 253 | 199: s SETITEM |
| 254 | 200: S STRING 'bar' |
| 255 | 207: p PUT 8 |
| 256 | 210: I INT 2 |
| 257 | 213: s SETITEM |
| 258 | 214: b BUILD |
| 259 | 215: g GET 5 |
| 260 | 218: t TUPLE (MARK at 151) |
| 261 | 219: p PUT 9 |
| 262 | 222: a APPEND |
| 263 | 223: g GET 9 |
| 264 | 226: a APPEND |
| 265 | 227: I INT 5 |
| 266 | 230: a APPEND |
| 267 | 231: . STOP |
| 268 | highest protocol among opcodes = 0 |
| 269 | """ |
| 270 | |
| 271 | DATA1 = (']q\x01(K\x00L1L\nG@\x00\x00\x00\x00\x00\x00\x00' |
| 272 | 'c__builtin__\ncomplex\nq\x02(G@\x08\x00\x00\x00\x00\x00' |
| 273 | '\x00G\x00\x00\x00\x00\x00\x00\x00\x00tRq\x03K\x01J\xff\xff' |
| 274 | '\xff\xffK\xffJ\x01\xff\xff\xffJ\x00\xff\xff\xffM\xff\xff' |
| 275 | 'J\x01\x00\xff\xffJ\x00\x00\xff\xffJ\xff\xff\xff\x7fJ\x01\x00' |
| 276 | '\x00\x80J\x00\x00\x00\x80(U\x03abcq\x04h\x04(c__main__\n' |
| 277 | 'C\nq\x05oq\x06}q\x07(U\x03fooq\x08K\x01U\x03barq\tK\x02ubh' |
| 278 | '\x06tq\nh\nK\x05e.' |
| 279 | ) |
| 280 | |
| 281 | # Disassembly of DATA1. |
| 282 | DATA1_DIS = """\ |
| 283 | 0: ] EMPTY_LIST |
| 284 | 1: q BINPUT 1 |
| 285 | 3: ( MARK |
| 286 | 4: K BININT1 0 |
| 287 | 6: L LONG 1L |
| 288 | 10: G BINFLOAT 2.0 |
| 289 | 19: c GLOBAL '__builtin__ complex' |
| 290 | 40: q BINPUT 2 |
| 291 | 42: ( MARK |
| 292 | 43: G BINFLOAT 3.0 |
| 293 | 52: G BINFLOAT 0.0 |
| 294 | 61: t TUPLE (MARK at 42) |
| 295 | 62: R REDUCE |
| 296 | 63: q BINPUT 3 |
| 297 | 65: K BININT1 1 |
| 298 | 67: J BININT -1 |
| 299 | 72: K BININT1 255 |
| 300 | 74: J BININT -255 |
| 301 | 79: J BININT -256 |
| 302 | 84: M BININT2 65535 |
| 303 | 87: J BININT -65535 |
| 304 | 92: J BININT -65536 |
| 305 | 97: J BININT 2147483647 |
| 306 | 102: J BININT -2147483647 |
| 307 | 107: J BININT -2147483648 |
| 308 | 112: ( MARK |
| 309 | 113: U SHORT_BINSTRING 'abc' |
| 310 | 118: q BINPUT 4 |
| 311 | 120: h BINGET 4 |
| 312 | 122: ( MARK |
| 313 | 123: c GLOBAL '__main__ C' |
| 314 | 135: q BINPUT 5 |
| 315 | 137: o OBJ (MARK at 122) |
| 316 | 138: q BINPUT 6 |
| 317 | 140: } EMPTY_DICT |
| 318 | 141: q BINPUT 7 |
| 319 | 143: ( MARK |
| 320 | 144: U SHORT_BINSTRING 'foo' |
| 321 | 149: q BINPUT 8 |
| 322 | 151: K BININT1 1 |
| 323 | 153: U SHORT_BINSTRING 'bar' |
| 324 | 158: q BINPUT 9 |
| 325 | 160: K BININT1 2 |
| 326 | 162: u SETITEMS (MARK at 143) |
| 327 | 163: b BUILD |
| 328 | 164: h BINGET 6 |
| 329 | 166: t TUPLE (MARK at 112) |
| 330 | 167: q BINPUT 10 |
| 331 | 169: h BINGET 10 |
| 332 | 171: K BININT1 5 |
| 333 | 173: e APPENDS (MARK at 3) |
| 334 | 174: . STOP |
| 335 | highest protocol among opcodes = 1 |
| 336 | """ |
Tim Peters | e0c446b | 2001-10-18 21:57:37 +0000 | [diff] [blame] | 337 | |
Tim Peters | fc27375 | 2003-03-02 04:54:24 +0000 | [diff] [blame] | 338 | DATA2 = ('\x80\x02]q\x01(K\x00\x8a\x01\x01G@\x00\x00\x00\x00\x00\x00\x00' |
| 339 | 'c__builtin__\ncomplex\nq\x02G@\x08\x00\x00\x00\x00\x00\x00G\x00' |
| 340 | '\x00\x00\x00\x00\x00\x00\x00\x86Rq\x03K\x01J\xff\xff\xff\xffK' |
| 341 | '\xffJ\x01\xff\xff\xffJ\x00\xff\xff\xffM\xff\xffJ\x01\x00\xff\xff' |
| 342 | 'J\x00\x00\xff\xffJ\xff\xff\xff\x7fJ\x01\x00\x00\x80J\x00\x00\x00' |
| 343 | '\x80(U\x03abcq\x04h\x04(c__main__\nC\nq\x05oq\x06}q\x07(U\x03foo' |
| 344 | 'q\x08K\x01U\x03barq\tK\x02ubh\x06tq\nh\nK\x05e.') |
| 345 | |
| 346 | # Disassembly of DATA2. |
| 347 | DATA2_DIS = """\ |
| 348 | 0: \x80 PROTO 2 |
| 349 | 2: ] EMPTY_LIST |
| 350 | 3: q BINPUT 1 |
| 351 | 5: ( MARK |
| 352 | 6: K BININT1 0 |
| 353 | 8: \x8a LONG1 1L |
| 354 | 11: G BINFLOAT 2.0 |
| 355 | 20: c GLOBAL '__builtin__ complex' |
| 356 | 41: q BINPUT 2 |
| 357 | 43: G BINFLOAT 3.0 |
| 358 | 52: G BINFLOAT 0.0 |
| 359 | 61: \x86 TUPLE2 |
| 360 | 62: R REDUCE |
| 361 | 63: q BINPUT 3 |
| 362 | 65: K BININT1 1 |
| 363 | 67: J BININT -1 |
| 364 | 72: K BININT1 255 |
| 365 | 74: J BININT -255 |
| 366 | 79: J BININT -256 |
| 367 | 84: M BININT2 65535 |
| 368 | 87: J BININT -65535 |
| 369 | 92: J BININT -65536 |
| 370 | 97: J BININT 2147483647 |
| 371 | 102: J BININT -2147483647 |
| 372 | 107: J BININT -2147483648 |
| 373 | 112: ( MARK |
| 374 | 113: U SHORT_BINSTRING 'abc' |
| 375 | 118: q BINPUT 4 |
| 376 | 120: h BINGET 4 |
| 377 | 122: ( MARK |
| 378 | 123: c GLOBAL '__main__ C' |
| 379 | 135: q BINPUT 5 |
| 380 | 137: o OBJ (MARK at 122) |
| 381 | 138: q BINPUT 6 |
| 382 | 140: } EMPTY_DICT |
| 383 | 141: q BINPUT 7 |
| 384 | 143: ( MARK |
| 385 | 144: U SHORT_BINSTRING 'foo' |
| 386 | 149: q BINPUT 8 |
| 387 | 151: K BININT1 1 |
| 388 | 153: U SHORT_BINSTRING 'bar' |
| 389 | 158: q BINPUT 9 |
| 390 | 160: K BININT1 2 |
| 391 | 162: u SETITEMS (MARK at 143) |
| 392 | 163: b BUILD |
| 393 | 164: h BINGET 6 |
| 394 | 166: t TUPLE (MARK at 112) |
| 395 | 167: q BINPUT 10 |
| 396 | 169: h BINGET 10 |
| 397 | 171: K BININT1 5 |
| 398 | 173: e APPENDS (MARK at 5) |
| 399 | 174: . STOP |
| 400 | highest protocol among opcodes = 2 |
| 401 | """ |
| 402 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 403 | def create_data(): |
Tim Peters | e935816 | 2001-01-22 22:05:20 +0000 | [diff] [blame] | 404 | c = C() |
| 405 | c.foo = 1 |
| 406 | c.bar = 2 |
| 407 | x = [0, 1L, 2.0, 3.0+0j] |
Tim Peters | 461922a | 2001-04-09 20:07:05 +0000 | [diff] [blame] | 408 | # Append some integer test cases at cPickle.c's internal size |
| 409 | # cutoffs. |
| 410 | uint1max = 0xff |
| 411 | uint2max = 0xffff |
| 412 | int4max = 0x7fffffff |
| 413 | x.extend([1, -1, |
| 414 | uint1max, -uint1max, -uint1max-1, |
| 415 | uint2max, -uint2max, -uint2max-1, |
| 416 | int4max, -int4max, -int4max-1]) |
Tim Peters | e935816 | 2001-01-22 22:05:20 +0000 | [diff] [blame] | 417 | y = ('abc', 'abc', c, c) |
| 418 | x.append(y) |
| 419 | x.append(y) |
| 420 | x.append(5) |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 421 | return x |
Tim Peters | c58440f | 2001-04-09 17:16:31 +0000 | [diff] [blame] | 422 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 423 | class AbstractPickleTests(unittest.TestCase): |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 424 | # Subclass must define self.dumps, self.loads, self.error. |
Tim Peters | c58440f | 2001-04-09 17:16:31 +0000 | [diff] [blame] | 425 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 426 | _testdata = create_data() |
Tim Peters | c58440f | 2001-04-09 17:16:31 +0000 | [diff] [blame] | 427 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 428 | def setUp(self): |
Tim Peters | e935816 | 2001-01-22 22:05:20 +0000 | [diff] [blame] | 429 | pass |
Tim Peters | c58440f | 2001-04-09 17:16:31 +0000 | [diff] [blame] | 430 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 431 | def test_misc(self): |
| 432 | # test various datatypes not tested by testdata |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 433 | for proto in protocols: |
| 434 | x = myint(4) |
| 435 | s = self.dumps(x, proto) |
| 436 | y = self.loads(s) |
| 437 | self.assertEqual(x, y) |
Tim Peters | e935816 | 2001-01-22 22:05:20 +0000 | [diff] [blame] | 438 | |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 439 | x = (1, ()) |
| 440 | s = self.dumps(x, proto) |
| 441 | y = self.loads(s) |
| 442 | self.assertEqual(x, y) |
Tim Peters | e935816 | 2001-01-22 22:05:20 +0000 | [diff] [blame] | 443 | |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 444 | x = initarg(1, x) |
| 445 | s = self.dumps(x, proto) |
| 446 | y = self.loads(s) |
| 447 | self.assertEqual(x, y) |
Tim Peters | e935816 | 2001-01-22 22:05:20 +0000 | [diff] [blame] | 448 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 449 | # XXX test __reduce__ protocol? |
| 450 | |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 451 | def test_roundtrip_equality(self): |
| 452 | expected = self._testdata |
| 453 | for proto in protocols: |
| 454 | s = self.dumps(expected, proto) |
| 455 | got = self.loads(s) |
| 456 | self.assertEqual(expected, got) |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 457 | |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 458 | def test_load_from_canned_string(self): |
| 459 | expected = self._testdata |
Tim Peters | fc27375 | 2003-03-02 04:54:24 +0000 | [diff] [blame] | 460 | for canned in DATA0, DATA1, DATA2: |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 461 | got = self.loads(canned) |
| 462 | self.assertEqual(expected, got) |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 463 | |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 464 | # There are gratuitous differences between pickles produced by |
| 465 | # pickle and cPickle, largely because cPickle starts PUT indices at |
| 466 | # 1 and pickle starts them at 0. See XXX comment in cPickle's put2() -- |
| 467 | # there's a comment with an exclamation point there whose meaning |
| 468 | # is a mystery. cPickle also suppresses PUT for objects with a refcount |
| 469 | # of 1. |
| 470 | def dont_test_disassembly(self): |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 471 | from pickletools import dis |
| 472 | |
| 473 | for proto, expected in (0, DATA0_DIS), (1, DATA1_DIS): |
| 474 | s = self.dumps(self._testdata, proto) |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 475 | filelike = cStringIO.StringIO() |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 476 | dis(s, out=filelike) |
| 477 | got = filelike.getvalue() |
| 478 | self.assertEqual(expected, got) |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 479 | |
| 480 | def test_recursive_list(self): |
| 481 | l = [] |
| 482 | l.append(l) |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 483 | for proto in protocols: |
| 484 | s = self.dumps(l, proto) |
| 485 | x = self.loads(s) |
Armin Rigo | 2b3eb40 | 2003-10-28 12:05:48 +0000 | [diff] [blame] | 486 | self.assertEqual(len(x), 1) |
Benjamin Peterson | 5c8da86 | 2009-06-30 22:57:08 +0000 | [diff] [blame] | 487 | self.assertTrue(x is x[0]) |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 488 | |
Collin Winter | 57bef68 | 2009-05-26 04:12:39 +0000 | [diff] [blame] | 489 | def test_recursive_tuple(self): |
| 490 | t = ([],) |
| 491 | t[0].append(t) |
| 492 | for proto in protocols: |
| 493 | s = self.dumps(t, proto) |
| 494 | x = self.loads(s) |
| 495 | self.assertEqual(len(x), 1) |
| 496 | self.assertEqual(len(x[0]), 1) |
Benjamin Peterson | 5c8da86 | 2009-06-30 22:57:08 +0000 | [diff] [blame] | 497 | self.assertTrue(x is x[0][0]) |
Collin Winter | 57bef68 | 2009-05-26 04:12:39 +0000 | [diff] [blame] | 498 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 499 | def test_recursive_dict(self): |
| 500 | d = {} |
| 501 | d[1] = d |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 502 | for proto in protocols: |
| 503 | s = self.dumps(d, proto) |
| 504 | x = self.loads(s) |
Armin Rigo | 2b3eb40 | 2003-10-28 12:05:48 +0000 | [diff] [blame] | 505 | self.assertEqual(x.keys(), [1]) |
Benjamin Peterson | 5c8da86 | 2009-06-30 22:57:08 +0000 | [diff] [blame] | 506 | self.assertTrue(x[1] is x) |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 507 | |
| 508 | def test_recursive_inst(self): |
| 509 | i = C() |
| 510 | i.attr = i |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 511 | for proto in protocols: |
Ezio Melotti | a84ecc6 | 2013-03-04 15:23:12 +0200 | [diff] [blame] | 512 | s = self.dumps(i, proto) |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 513 | x = self.loads(s) |
Armin Rigo | 2b3eb40 | 2003-10-28 12:05:48 +0000 | [diff] [blame] | 514 | self.assertEqual(dir(x), dir(i)) |
Ezio Melotti | a84ecc6 | 2013-03-04 15:23:12 +0200 | [diff] [blame] | 515 | self.assertIs(x.attr, x) |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 516 | |
| 517 | def test_recursive_multi(self): |
| 518 | l = [] |
| 519 | d = {1:l} |
| 520 | i = C() |
| 521 | i.attr = d |
| 522 | l.append(i) |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 523 | for proto in protocols: |
| 524 | s = self.dumps(l, proto) |
| 525 | x = self.loads(s) |
Armin Rigo | 2b3eb40 | 2003-10-28 12:05:48 +0000 | [diff] [blame] | 526 | self.assertEqual(len(x), 1) |
| 527 | self.assertEqual(dir(x[0]), dir(i)) |
| 528 | self.assertEqual(x[0].attr.keys(), [1]) |
Benjamin Peterson | 5c8da86 | 2009-06-30 22:57:08 +0000 | [diff] [blame] | 529 | self.assertTrue(x[0].attr[1] is x) |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 530 | |
| 531 | def test_garyp(self): |
| 532 | self.assertRaises(self.error, self.loads, 'garyp') |
| 533 | |
| 534 | def test_insecure_strings(self): |
| 535 | insecure = ["abc", "2 + 2", # not quoted |
Martin v. Löwis | 8a8da79 | 2002-08-14 07:46:28 +0000 | [diff] [blame] | 536 | #"'abc' + 'def'", # not a single quoted string |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 537 | "'abc", # quote is not closed |
| 538 | "'abc\"", # open quote and close quote don't match |
| 539 | "'abc' ?", # junk after close quote |
Martin v. Löwis | eb3f00a | 2002-08-14 08:22:50 +0000 | [diff] [blame] | 540 | "'\\'", # trailing backslash |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 541 | # some tests of the quoting rules |
Martin v. Löwis | 8a8da79 | 2002-08-14 07:46:28 +0000 | [diff] [blame] | 542 | #"'abc\"\''", |
| 543 | #"'\\\\a\'\'\'\\\'\\\\\''", |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 544 | ] |
| 545 | for s in insecure: |
| 546 | buf = "S" + s + "\012p0\012." |
| 547 | self.assertRaises(ValueError, self.loads, buf) |
| 548 | |
Martin v. Löwis | 339d0f7 | 2001-08-17 18:39:25 +0000 | [diff] [blame] | 549 | if have_unicode: |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 550 | def test_unicode(self): |
Alexandre Vassalotti | e57e999 | 2008-12-27 10:02:59 +0000 | [diff] [blame] | 551 | endcases = [u'', u'<\\u>', u'<\\\u1234>', u'<\n>', |
| 552 | u'<\\>', u'<\\\U00012345>'] |
Tim Peters | ee1a53c | 2003-02-02 02:57:53 +0000 | [diff] [blame] | 553 | for proto in protocols: |
| 554 | for u in endcases: |
| 555 | p = self.dumps(u, proto) |
| 556 | u2 = self.loads(p) |
| 557 | self.assertEqual(u2, u) |
Tim Peters | e089c68 | 2001-04-10 03:41:41 +0000 | [diff] [blame] | 558 | |
Alexandre Vassalotti | f852bf9 | 2008-12-27 07:08:47 +0000 | [diff] [blame] | 559 | def test_unicode_high_plane(self): |
| 560 | t = u'\U00012345' |
| 561 | for proto in protocols: |
| 562 | p = self.dumps(t, proto) |
| 563 | t2 = self.loads(p) |
| 564 | self.assertEqual(t2, t) |
| 565 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 566 | def test_ints(self): |
| 567 | import sys |
Tim Peters | ee1a53c | 2003-02-02 02:57:53 +0000 | [diff] [blame] | 568 | for proto in protocols: |
| 569 | n = sys.maxint |
| 570 | while n: |
| 571 | for expected in (-n, n): |
| 572 | s = self.dumps(expected, proto) |
| 573 | n2 = self.loads(s) |
| 574 | self.assertEqual(expected, n2) |
| 575 | n = n >> 1 |
Tim Peters | 19ef62d | 2001-08-28 22:21:18 +0000 | [diff] [blame] | 576 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 577 | def test_maxint64(self): |
| 578 | maxint64 = (1L << 63) - 1 |
| 579 | data = 'I' + str(maxint64) + '\n.' |
| 580 | got = self.loads(data) |
| 581 | self.assertEqual(got, maxint64) |
| 582 | |
| 583 | # Try too with a bogus literal. |
| 584 | data = 'I' + str(maxint64) + 'JUNK\n.' |
| 585 | self.assertRaises(ValueError, self.loads, data) |
| 586 | |
Tim Peters | ee1a53c | 2003-02-02 02:57:53 +0000 | [diff] [blame] | 587 | def test_long(self): |
| 588 | for proto in protocols: |
Tim Peters | bf2674b | 2003-02-02 07:51:32 +0000 | [diff] [blame] | 589 | # 256 bytes is where LONG4 begins. |
Tim Peters | ee1a53c | 2003-02-02 02:57:53 +0000 | [diff] [blame] | 590 | for nbits in 1, 8, 8*254, 8*255, 8*256, 8*257: |
| 591 | nbase = 1L << nbits |
| 592 | for npos in nbase-1, nbase, nbase+1: |
| 593 | for n in npos, -npos: |
| 594 | pickle = self.dumps(n, proto) |
| 595 | got = self.loads(pickle) |
| 596 | self.assertEqual(n, got) |
| 597 | # Try a monster. This is quadratic-time in protos 0 & 1, so don't |
| 598 | # bother with those. |
Tim Peters | ee1a53c | 2003-02-02 02:57:53 +0000 | [diff] [blame] | 599 | nbase = long("deadbeeffeedface", 16) |
| 600 | nbase += nbase << 1000000 |
| 601 | for n in nbase, -nbase: |
Tim Peters | ee1a53c | 2003-02-02 02:57:53 +0000 | [diff] [blame] | 602 | p = self.dumps(n, 2) |
Tim Peters | ee1a53c | 2003-02-02 02:57:53 +0000 | [diff] [blame] | 603 | got = self.loads(p) |
Tim Peters | ee1a53c | 2003-02-02 02:57:53 +0000 | [diff] [blame] | 604 | self.assertEqual(n, got) |
| 605 | |
Mark Dickinson | a3ecd2c | 2009-01-24 16:40:29 +0000 | [diff] [blame] | 606 | def test_float(self): |
| 607 | test_values = [0.0, 4.94e-324, 1e-310, 7e-308, 6.626e-34, 0.1, 0.5, |
| 608 | 3.14, 263.44582062374053, 6.022e23, 1e30] |
| 609 | test_values = test_values + [-x for x in test_values] |
| 610 | for proto in protocols: |
| 611 | for value in test_values: |
| 612 | pickle = self.dumps(value, proto) |
| 613 | got = self.loads(pickle) |
| 614 | self.assertEqual(value, got) |
| 615 | |
Georg Brandl | de9b624 | 2006-04-30 11:13:56 +0000 | [diff] [blame] | 616 | @run_with_locale('LC_ALL', 'de_DE', 'fr_FR') |
| 617 | def test_float_format(self): |
| 618 | # make sure that floats are formatted locale independent |
| 619 | self.assertEqual(self.dumps(1.2)[0:3], 'F1.') |
| 620 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 621 | def test_reduce(self): |
Tim Peters | 19ef62d | 2001-08-28 22:21:18 +0000 | [diff] [blame] | 622 | pass |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 623 | |
| 624 | def test_getinitargs(self): |
| 625 | pass |
| 626 | |
Guido van Rossum | 04a8661 | 2001-12-19 16:58:54 +0000 | [diff] [blame] | 627 | def test_metaclass(self): |
| 628 | a = use_metaclass() |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 629 | for proto in protocols: |
| 630 | s = self.dumps(a, proto) |
| 631 | b = self.loads(s) |
| 632 | self.assertEqual(a.__class__, b.__class__) |
Guido van Rossum | 04a8661 | 2001-12-19 16:58:54 +0000 | [diff] [blame] | 633 | |
Antoine Pitrou | 561a821 | 2011-10-04 09:34:48 +0200 | [diff] [blame] | 634 | def test_dynamic_class(self): |
| 635 | a = create_dynamic_class("my_dynamic_class", (object,)) |
| 636 | copy_reg.pickle(pickling_metaclass, pickling_metaclass.__reduce__) |
| 637 | for proto in protocols: |
| 638 | s = self.dumps(a, proto) |
| 639 | b = self.loads(s) |
| 640 | self.assertEqual(a, b) |
| 641 | |
Michael W. Hudson | 7bb466a | 2002-03-05 13:27:58 +0000 | [diff] [blame] | 642 | def test_structseq(self): |
| 643 | import time |
Michael W. Hudson | 0e02530 | 2002-03-06 17:11:18 +0000 | [diff] [blame] | 644 | import os |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 645 | |
| 646 | t = time.localtime() |
| 647 | for proto in protocols: |
| 648 | s = self.dumps(t, proto) |
Michael W. Hudson | 0e02530 | 2002-03-06 17:11:18 +0000 | [diff] [blame] | 649 | u = self.loads(s) |
| 650 | self.assertEqual(t, u) |
Tim Peters | 70b02d7 | 2003-02-02 17:26:40 +0000 | [diff] [blame] | 651 | if hasattr(os, "stat"): |
| 652 | t = os.stat(os.curdir) |
| 653 | s = self.dumps(t, proto) |
| 654 | u = self.loads(s) |
| 655 | self.assertEqual(t, u) |
| 656 | if hasattr(os, "statvfs"): |
| 657 | t = os.statvfs(os.curdir) |
| 658 | s = self.dumps(t, proto) |
| 659 | u = self.loads(s) |
| 660 | self.assertEqual(t, u) |
Michael W. Hudson | 7bb466a | 2002-03-05 13:27:58 +0000 | [diff] [blame] | 661 | |
Guido van Rossum | d6c9e63 | 2003-01-28 03:49:52 +0000 | [diff] [blame] | 662 | # Tests for protocol 2 |
| 663 | |
Tim Peters | 4190fb8 | 2003-02-02 16:09:05 +0000 | [diff] [blame] | 664 | def test_proto(self): |
| 665 | build_none = pickle.NONE + pickle.STOP |
| 666 | for proto in protocols: |
| 667 | expected = build_none |
| 668 | if proto >= 2: |
| 669 | expected = pickle.PROTO + chr(proto) + expected |
| 670 | p = self.dumps(None, proto) |
| 671 | self.assertEqual(p, expected) |
| 672 | |
| 673 | oob = protocols[-1] + 1 # a future protocol |
| 674 | badpickle = pickle.PROTO + chr(oob) + build_none |
| 675 | try: |
| 676 | self.loads(badpickle) |
| 677 | except ValueError, detail: |
Benjamin Peterson | 5c8da86 | 2009-06-30 22:57:08 +0000 | [diff] [blame] | 678 | self.assertTrue(str(detail).startswith( |
Tim Peters | 4190fb8 | 2003-02-02 16:09:05 +0000 | [diff] [blame] | 679 | "unsupported pickle protocol")) |
| 680 | else: |
| 681 | self.fail("expected bad protocol number to raise ValueError") |
| 682 | |
Guido van Rossum | d6c9e63 | 2003-01-28 03:49:52 +0000 | [diff] [blame] | 683 | def test_long1(self): |
| 684 | x = 12345678910111213141516178920L |
Tim Peters | 61bf257 | 2003-02-03 21:31:22 +0000 | [diff] [blame] | 685 | for proto in protocols: |
| 686 | s = self.dumps(x, proto) |
| 687 | y = self.loads(s) |
| 688 | self.assertEqual(x, y) |
Tim Peters | 22e7171 | 2003-02-03 22:27:38 +0000 | [diff] [blame] | 689 | self.assertEqual(opcode_in_pickle(pickle.LONG1, s), proto >= 2) |
Guido van Rossum | d6c9e63 | 2003-01-28 03:49:52 +0000 | [diff] [blame] | 690 | |
| 691 | def test_long4(self): |
| 692 | x = 12345678910111213141516178920L << (256*8) |
Tim Peters | 61bf257 | 2003-02-03 21:31:22 +0000 | [diff] [blame] | 693 | for proto in protocols: |
| 694 | s = self.dumps(x, proto) |
| 695 | y = self.loads(s) |
| 696 | self.assertEqual(x, y) |
Tim Peters | 22e7171 | 2003-02-03 22:27:38 +0000 | [diff] [blame] | 697 | self.assertEqual(opcode_in_pickle(pickle.LONG4, s), proto >= 2) |
Guido van Rossum | d6c9e63 | 2003-01-28 03:49:52 +0000 | [diff] [blame] | 698 | |
Guido van Rossum | 44f0ea5 | 2003-01-28 04:14:51 +0000 | [diff] [blame] | 699 | def test_short_tuples(self): |
Tim Peters | 1d63c9f | 2003-02-02 20:29:39 +0000 | [diff] [blame] | 700 | # Map (proto, len(tuple)) to expected opcode. |
| 701 | expected_opcode = {(0, 0): pickle.TUPLE, |
| 702 | (0, 1): pickle.TUPLE, |
| 703 | (0, 2): pickle.TUPLE, |
| 704 | (0, 3): pickle.TUPLE, |
| 705 | (0, 4): pickle.TUPLE, |
| 706 | |
| 707 | (1, 0): pickle.EMPTY_TUPLE, |
| 708 | (1, 1): pickle.TUPLE, |
| 709 | (1, 2): pickle.TUPLE, |
| 710 | (1, 3): pickle.TUPLE, |
| 711 | (1, 4): pickle.TUPLE, |
| 712 | |
| 713 | (2, 0): pickle.EMPTY_TUPLE, |
| 714 | (2, 1): pickle.TUPLE1, |
| 715 | (2, 2): pickle.TUPLE2, |
| 716 | (2, 3): pickle.TUPLE3, |
| 717 | (2, 4): pickle.TUPLE, |
| 718 | } |
Guido van Rossum | 44f0ea5 | 2003-01-28 04:14:51 +0000 | [diff] [blame] | 719 | a = () |
Guido van Rossum | 025bc2f | 2003-01-28 04:20:02 +0000 | [diff] [blame] | 720 | b = (1,) |
| 721 | c = (1, 2) |
| 722 | d = (1, 2, 3) |
| 723 | e = (1, 2, 3, 4) |
Tim Peters | 4190fb8 | 2003-02-02 16:09:05 +0000 | [diff] [blame] | 724 | for proto in protocols: |
Guido van Rossum | 44f0ea5 | 2003-01-28 04:14:51 +0000 | [diff] [blame] | 725 | for x in a, b, c, d, e: |
| 726 | s = self.dumps(x, proto) |
| 727 | y = self.loads(s) |
| 728 | self.assertEqual(x, y, (proto, x, s, y)) |
Tim Peters | 1d63c9f | 2003-02-02 20:29:39 +0000 | [diff] [blame] | 729 | expected = expected_opcode[proto, len(x)] |
Tim Peters | 22e7171 | 2003-02-03 22:27:38 +0000 | [diff] [blame] | 730 | self.assertEqual(opcode_in_pickle(expected, s), True) |
Tim Peters | 1d63c9f | 2003-02-02 20:29:39 +0000 | [diff] [blame] | 731 | |
Guido van Rossum | 7d97d31 | 2003-01-28 04:25:27 +0000 | [diff] [blame] | 732 | def test_singletons(self): |
Tim Peters | 61bf257 | 2003-02-03 21:31:22 +0000 | [diff] [blame] | 733 | # Map (proto, singleton) to expected opcode. |
| 734 | expected_opcode = {(0, None): pickle.NONE, |
| 735 | (1, None): pickle.NONE, |
| 736 | (2, None): pickle.NONE, |
| 737 | |
| 738 | (0, True): pickle.INT, |
| 739 | (1, True): pickle.INT, |
| 740 | (2, True): pickle.NEWTRUE, |
| 741 | |
| 742 | (0, False): pickle.INT, |
| 743 | (1, False): pickle.INT, |
| 744 | (2, False): pickle.NEWFALSE, |
| 745 | } |
Tim Peters | 4190fb8 | 2003-02-02 16:09:05 +0000 | [diff] [blame] | 746 | for proto in protocols: |
Guido van Rossum | 7d97d31 | 2003-01-28 04:25:27 +0000 | [diff] [blame] | 747 | for x in None, False, True: |
| 748 | s = self.dumps(x, proto) |
| 749 | y = self.loads(s) |
Benjamin Peterson | 5c8da86 | 2009-06-30 22:57:08 +0000 | [diff] [blame] | 750 | self.assertTrue(x is y, (proto, x, s, y)) |
Tim Peters | 61bf257 | 2003-02-03 21:31:22 +0000 | [diff] [blame] | 751 | expected = expected_opcode[proto, x] |
Tim Peters | 22e7171 | 2003-02-03 22:27:38 +0000 | [diff] [blame] | 752 | self.assertEqual(opcode_in_pickle(expected, s), True) |
Tim Peters | 3c67d79 | 2003-02-02 17:59:11 +0000 | [diff] [blame] | 753 | |
Guido van Rossum | 533dbcf | 2003-01-28 17:55:05 +0000 | [diff] [blame] | 754 | def test_newobj_tuple(self): |
Guido van Rossum | 3d8c01b | 2003-01-28 19:48:18 +0000 | [diff] [blame] | 755 | x = MyTuple([1, 2, 3]) |
| 756 | x.foo = 42 |
| 757 | x.bar = "hello" |
Tim Peters | 894453a | 2003-02-03 22:32:18 +0000 | [diff] [blame] | 758 | for proto in protocols: |
| 759 | s = self.dumps(x, proto) |
| 760 | y = self.loads(s) |
| 761 | self.assertEqual(tuple(x), tuple(y)) |
| 762 | self.assertEqual(x.__dict__, y.__dict__) |
Guido van Rossum | 533dbcf | 2003-01-28 17:55:05 +0000 | [diff] [blame] | 763 | |
| 764 | def test_newobj_list(self): |
Guido van Rossum | 3d8c01b | 2003-01-28 19:48:18 +0000 | [diff] [blame] | 765 | x = MyList([1, 2, 3]) |
| 766 | x.foo = 42 |
| 767 | x.bar = "hello" |
Tim Peters | 894453a | 2003-02-03 22:32:18 +0000 | [diff] [blame] | 768 | for proto in protocols: |
| 769 | s = self.dumps(x, proto) |
| 770 | y = self.loads(s) |
| 771 | self.assertEqual(list(x), list(y)) |
| 772 | self.assertEqual(x.__dict__, y.__dict__) |
Guido van Rossum | 533dbcf | 2003-01-28 17:55:05 +0000 | [diff] [blame] | 773 | |
Guido van Rossum | 5d9113d | 2003-01-29 17:58:45 +0000 | [diff] [blame] | 774 | def test_newobj_generic(self): |
Tim Peters | 5013bd9 | 2003-02-03 22:28:41 +0000 | [diff] [blame] | 775 | for proto in protocols: |
Guido van Rossum | 5d9113d | 2003-01-29 17:58:45 +0000 | [diff] [blame] | 776 | for C in myclasses: |
| 777 | B = C.__base__ |
| 778 | x = C(C.sample) |
| 779 | x.foo = 42 |
| 780 | s = self.dumps(x, proto) |
Guido van Rossum | 5d9113d | 2003-01-29 17:58:45 +0000 | [diff] [blame] | 781 | y = self.loads(s) |
| 782 | detail = (proto, C, B, x, y, type(y)) |
| 783 | self.assertEqual(B(x), B(y), detail) |
| 784 | self.assertEqual(x.__dict__, y.__dict__, detail) |
| 785 | |
Georg Brandl | dffbf5f | 2008-05-20 07:49:57 +0000 | [diff] [blame] | 786 | # Register a type with copy_reg, with extension code extcode. Pickle |
Tim Peters | 22e7171 | 2003-02-03 22:27:38 +0000 | [diff] [blame] | 787 | # an object of that type. Check that the resulting pickle uses opcode |
| 788 | # (EXT[124]) under proto 2, and not in proto 1. |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 789 | |
Tim Peters | 22e7171 | 2003-02-03 22:27:38 +0000 | [diff] [blame] | 790 | def produce_global_ext(self, extcode, opcode): |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 791 | e = ExtensionSaver(extcode) |
Guido van Rossum | 0322d0f | 2003-01-29 06:12:46 +0000 | [diff] [blame] | 792 | try: |
Georg Brandl | dffbf5f | 2008-05-20 07:49:57 +0000 | [diff] [blame] | 793 | copy_reg.add_extension(__name__, "MyList", extcode) |
Guido van Rossum | 0322d0f | 2003-01-29 06:12:46 +0000 | [diff] [blame] | 794 | x = MyList([1, 2, 3]) |
| 795 | x.foo = 42 |
| 796 | x.bar = "hello" |
| 797 | |
Tim Peters | 22e7171 | 2003-02-03 22:27:38 +0000 | [diff] [blame] | 798 | # Dump using protocol 1 for comparison. |
Guido van Rossum | 0322d0f | 2003-01-29 06:12:46 +0000 | [diff] [blame] | 799 | s1 = self.dumps(x, 1) |
Ezio Melotti | aa98058 | 2010-01-23 23:04:36 +0000 | [diff] [blame] | 800 | self.assertIn(__name__, s1) |
| 801 | self.assertIn("MyList", s1) |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 802 | self.assertEqual(opcode_in_pickle(opcode, s1), False) |
| 803 | |
Guido van Rossum | 0322d0f | 2003-01-29 06:12:46 +0000 | [diff] [blame] | 804 | y = self.loads(s1) |
| 805 | self.assertEqual(list(x), list(y)) |
| 806 | self.assertEqual(x.__dict__, y.__dict__) |
Guido van Rossum | 0322d0f | 2003-01-29 06:12:46 +0000 | [diff] [blame] | 807 | |
Tim Peters | 22e7171 | 2003-02-03 22:27:38 +0000 | [diff] [blame] | 808 | # Dump using protocol 2 for test. |
Guido van Rossum | 0322d0f | 2003-01-29 06:12:46 +0000 | [diff] [blame] | 809 | s2 = self.dumps(x, 2) |
Ezio Melotti | aa98058 | 2010-01-23 23:04:36 +0000 | [diff] [blame] | 810 | self.assertNotIn(__name__, s2) |
| 811 | self.assertNotIn("MyList", s2) |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 812 | self.assertEqual(opcode_in_pickle(opcode, s2), True) |
| 813 | |
Guido van Rossum | 0322d0f | 2003-01-29 06:12:46 +0000 | [diff] [blame] | 814 | y = self.loads(s2) |
| 815 | self.assertEqual(list(x), list(y)) |
| 816 | self.assertEqual(x.__dict__, y.__dict__) |
Guido van Rossum | 0322d0f | 2003-01-29 06:12:46 +0000 | [diff] [blame] | 817 | |
| 818 | finally: |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 819 | e.restore() |
Tim Peters | 22e7171 | 2003-02-03 22:27:38 +0000 | [diff] [blame] | 820 | |
| 821 | def test_global_ext1(self): |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 822 | self.produce_global_ext(0x00000001, pickle.EXT1) # smallest EXT1 code |
| 823 | self.produce_global_ext(0x000000ff, pickle.EXT1) # largest EXT1 code |
Guido van Rossum | 0322d0f | 2003-01-29 06:12:46 +0000 | [diff] [blame] | 824 | |
| 825 | def test_global_ext2(self): |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 826 | self.produce_global_ext(0x00000100, pickle.EXT2) # smallest EXT2 code |
| 827 | self.produce_global_ext(0x0000ffff, pickle.EXT2) # largest EXT2 code |
| 828 | self.produce_global_ext(0x0000abcd, pickle.EXT2) # check endianness |
Guido van Rossum | 0322d0f | 2003-01-29 06:12:46 +0000 | [diff] [blame] | 829 | |
| 830 | def test_global_ext4(self): |
Tim Peters | 3e667d5 | 2003-02-04 21:47:44 +0000 | [diff] [blame] | 831 | self.produce_global_ext(0x00010000, pickle.EXT4) # smallest EXT4 code |
| 832 | self.produce_global_ext(0x7fffffff, pickle.EXT4) # largest EXT4 code |
| 833 | self.produce_global_ext(0x12abcdef, pickle.EXT4) # check endianness |
| 834 | |
Tim Peters | 8d2613a | 2003-02-11 16:40:16 +0000 | [diff] [blame] | 835 | def test_list_chunking(self): |
| 836 | n = 10 # too small to chunk |
| 837 | x = range(n) |
| 838 | for proto in protocols: |
| 839 | s = self.dumps(x, proto) |
| 840 | y = self.loads(s) |
| 841 | self.assertEqual(x, y) |
| 842 | num_appends = count_opcode(pickle.APPENDS, s) |
| 843 | self.assertEqual(num_appends, proto > 0) |
| 844 | |
| 845 | n = 2500 # expect at least two chunks when proto > 0 |
| 846 | x = range(n) |
| 847 | for proto in protocols: |
| 848 | s = self.dumps(x, proto) |
| 849 | y = self.loads(s) |
| 850 | self.assertEqual(x, y) |
| 851 | num_appends = count_opcode(pickle.APPENDS, s) |
| 852 | if proto == 0: |
| 853 | self.assertEqual(num_appends, 0) |
| 854 | else: |
Benjamin Peterson | 5c8da86 | 2009-06-30 22:57:08 +0000 | [diff] [blame] | 855 | self.assertTrue(num_appends >= 2) |
Tim Peters | 8d2613a | 2003-02-11 16:40:16 +0000 | [diff] [blame] | 856 | |
| 857 | def test_dict_chunking(self): |
| 858 | n = 10 # too small to chunk |
| 859 | x = dict.fromkeys(range(n)) |
| 860 | for proto in protocols: |
| 861 | s = self.dumps(x, proto) |
| 862 | y = self.loads(s) |
| 863 | self.assertEqual(x, y) |
| 864 | num_setitems = count_opcode(pickle.SETITEMS, s) |
| 865 | self.assertEqual(num_setitems, proto > 0) |
| 866 | |
| 867 | n = 2500 # expect at least two chunks when proto > 0 |
| 868 | x = dict.fromkeys(range(n)) |
| 869 | for proto in protocols: |
| 870 | s = self.dumps(x, proto) |
| 871 | y = self.loads(s) |
| 872 | self.assertEqual(x, y) |
| 873 | num_setitems = count_opcode(pickle.SETITEMS, s) |
| 874 | if proto == 0: |
| 875 | self.assertEqual(num_setitems, 0) |
| 876 | else: |
Benjamin Peterson | 5c8da86 | 2009-06-30 22:57:08 +0000 | [diff] [blame] | 877 | self.assertTrue(num_setitems >= 2) |
Guido van Rossum | 0322d0f | 2003-01-29 06:12:46 +0000 | [diff] [blame] | 878 | |
Tim Peters | e9ef203 | 2003-02-13 18:42:00 +0000 | [diff] [blame] | 879 | def test_simple_newobj(self): |
| 880 | x = object.__new__(SimpleNewObj) # avoid __init__ |
| 881 | x.abc = 666 |
| 882 | for proto in protocols: |
| 883 | s = self.dumps(x, proto) |
| 884 | self.assertEqual(opcode_in_pickle(pickle.NEWOBJ, s), proto >= 2) |
| 885 | y = self.loads(s) # will raise TypeError if __init__ called |
| 886 | self.assertEqual(y.abc, 666) |
| 887 | self.assertEqual(x.__dict__, y.__dict__) |
| 888 | |
Tim Peters | 42f08ac | 2003-02-11 22:43:24 +0000 | [diff] [blame] | 889 | def test_newobj_list_slots(self): |
| 890 | x = SlotList([1, 2, 3]) |
| 891 | x.foo = 42 |
| 892 | x.bar = "hello" |
| 893 | s = self.dumps(x, 2) |
| 894 | y = self.loads(s) |
| 895 | self.assertEqual(list(x), list(y)) |
| 896 | self.assertEqual(x.__dict__, y.__dict__) |
| 897 | self.assertEqual(x.foo, y.foo) |
| 898 | self.assertEqual(x.bar, y.bar) |
| 899 | |
Guido van Rossum | 2a30b21 | 2003-02-18 22:41:24 +0000 | [diff] [blame] | 900 | def test_reduce_overrides_default_reduce_ex(self): |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 901 | for proto in protocols: |
Guido van Rossum | 2a30b21 | 2003-02-18 22:41:24 +0000 | [diff] [blame] | 902 | x = REX_one() |
| 903 | self.assertEqual(x._reduce_called, 0) |
| 904 | s = self.dumps(x, proto) |
| 905 | self.assertEqual(x._reduce_called, 1) |
| 906 | y = self.loads(s) |
| 907 | self.assertEqual(y._reduce_called, 0) |
| 908 | |
| 909 | def test_reduce_ex_called(self): |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 910 | for proto in protocols: |
Guido van Rossum | 2a30b21 | 2003-02-18 22:41:24 +0000 | [diff] [blame] | 911 | x = REX_two() |
| 912 | self.assertEqual(x._proto, None) |
| 913 | s = self.dumps(x, proto) |
| 914 | self.assertEqual(x._proto, proto) |
| 915 | y = self.loads(s) |
| 916 | self.assertEqual(y._proto, None) |
| 917 | |
| 918 | def test_reduce_ex_overrides_reduce(self): |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 919 | for proto in protocols: |
Guido van Rossum | 2a30b21 | 2003-02-18 22:41:24 +0000 | [diff] [blame] | 920 | x = REX_three() |
| 921 | self.assertEqual(x._proto, None) |
| 922 | s = self.dumps(x, proto) |
| 923 | self.assertEqual(x._proto, proto) |
| 924 | y = self.loads(s) |
| 925 | self.assertEqual(y._proto, None) |
| 926 | |
Žiga Seilnacht | 20f43d3 | 2007-03-15 11:44:55 +0000 | [diff] [blame] | 927 | def test_reduce_ex_calls_base(self): |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 928 | for proto in protocols: |
Žiga Seilnacht | 20f43d3 | 2007-03-15 11:44:55 +0000 | [diff] [blame] | 929 | x = REX_four() |
| 930 | self.assertEqual(x._proto, None) |
| 931 | s = self.dumps(x, proto) |
| 932 | self.assertEqual(x._proto, proto) |
| 933 | y = self.loads(s) |
| 934 | self.assertEqual(y._proto, proto) |
| 935 | |
| 936 | def test_reduce_calls_base(self): |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 937 | for proto in protocols: |
Žiga Seilnacht | 20f43d3 | 2007-03-15 11:44:55 +0000 | [diff] [blame] | 938 | x = REX_five() |
| 939 | self.assertEqual(x._reduce_called, 0) |
| 940 | s = self.dumps(x, proto) |
| 941 | self.assertEqual(x._reduce_called, 1) |
| 942 | y = self.loads(s) |
| 943 | self.assertEqual(y._reduce_called, 1) |
| 944 | |
Amaury Forgeot d'Arc | 69a9c5b | 2008-10-30 21:18:34 +0000 | [diff] [blame] | 945 | def test_reduce_bad_iterator(self): |
| 946 | # Issue4176: crash when 4th and 5th items of __reduce__() |
| 947 | # are not iterators |
| 948 | class C(object): |
| 949 | def __reduce__(self): |
| 950 | # 4th item is not an iterator |
| 951 | return list, (), None, [], None |
| 952 | class D(object): |
| 953 | def __reduce__(self): |
| 954 | # 5th item is not an iterator |
| 955 | return dict, (), None, None, [] |
| 956 | |
| 957 | # Protocol 0 is less strict and also accept iterables. |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 958 | for proto in protocols: |
Amaury Forgeot d'Arc | 69a9c5b | 2008-10-30 21:18:34 +0000 | [diff] [blame] | 959 | try: |
| 960 | self.dumps(C(), proto) |
| 961 | except (AttributeError, pickle.PickleError, cPickle.PickleError): |
| 962 | pass |
| 963 | try: |
| 964 | self.dumps(D(), proto) |
| 965 | except (AttributeError, pickle.PickleError, cPickle.PickleError): |
| 966 | pass |
| 967 | |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 968 | def test_many_puts_and_gets(self): |
| 969 | # Test that internal data structures correctly deal with lots of |
| 970 | # puts/gets. |
| 971 | keys = ("aaa" + str(i) for i in xrange(100)) |
| 972 | large_dict = dict((k, [4, 5, 6]) for k in keys) |
| 973 | obj = [dict(large_dict), dict(large_dict), dict(large_dict)] |
| 974 | |
| 975 | for proto in protocols: |
| 976 | dumped = self.dumps(obj, proto) |
| 977 | loaded = self.loads(dumped) |
| 978 | self.assertEqual(loaded, obj, |
| 979 | "Failed protocol %d: %r != %r" |
| 980 | % (proto, obj, loaded)) |
| 981 | |
Antoine Pitrou | 7430989 | 2009-05-02 21:13:23 +0000 | [diff] [blame] | 982 | def test_attribute_name_interning(self): |
| 983 | # Test that attribute names of pickled objects are interned when |
| 984 | # unpickling. |
| 985 | for proto in protocols: |
| 986 | x = C() |
| 987 | x.foo = 42 |
| 988 | x.bar = "hello" |
| 989 | s = self.dumps(x, proto) |
| 990 | y = self.loads(s) |
| 991 | x_keys = sorted(x.__dict__) |
| 992 | y_keys = sorted(y.__dict__) |
| 993 | for x_key, y_key in zip(x_keys, y_keys): |
| 994 | self.assertIs(x_key, y_key) |
| 995 | |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 996 | |
Guido van Rossum | 2a30b21 | 2003-02-18 22:41:24 +0000 | [diff] [blame] | 997 | # Test classes for reduce_ex |
| 998 | |
| 999 | class REX_one(object): |
| 1000 | _reduce_called = 0 |
| 1001 | def __reduce__(self): |
| 1002 | self._reduce_called = 1 |
| 1003 | return REX_one, () |
| 1004 | # No __reduce_ex__ here, but inheriting it from object |
| 1005 | |
| 1006 | class REX_two(object): |
| 1007 | _proto = None |
| 1008 | def __reduce_ex__(self, proto): |
| 1009 | self._proto = proto |
| 1010 | return REX_two, () |
| 1011 | # No __reduce__ here, but inheriting it from object |
| 1012 | |
| 1013 | class REX_three(object): |
| 1014 | _proto = None |
| 1015 | def __reduce_ex__(self, proto): |
| 1016 | self._proto = proto |
| 1017 | return REX_two, () |
| 1018 | def __reduce__(self): |
| 1019 | raise TestFailed, "This __reduce__ shouldn't be called" |
| 1020 | |
Žiga Seilnacht | 20f43d3 | 2007-03-15 11:44:55 +0000 | [diff] [blame] | 1021 | class REX_four(object): |
| 1022 | _proto = None |
| 1023 | def __reduce_ex__(self, proto): |
| 1024 | self._proto = proto |
| 1025 | return object.__reduce_ex__(self, proto) |
| 1026 | # Calling base class method should succeed |
| 1027 | |
| 1028 | class REX_five(object): |
| 1029 | _reduce_called = 0 |
| 1030 | def __reduce__(self): |
| 1031 | self._reduce_called = 1 |
| 1032 | return object.__reduce__(self) |
| 1033 | # This one used to fail with infinite recursion |
| 1034 | |
Guido van Rossum | 2a30b21 | 2003-02-18 22:41:24 +0000 | [diff] [blame] | 1035 | # Test classes for newobj |
Tim Peters | 080c88b | 2003-02-15 03:01:11 +0000 | [diff] [blame] | 1036 | |
Guido van Rossum | 5d9113d | 2003-01-29 17:58:45 +0000 | [diff] [blame] | 1037 | class MyInt(int): |
| 1038 | sample = 1 |
| 1039 | |
| 1040 | class MyLong(long): |
| 1041 | sample = 1L |
| 1042 | |
| 1043 | class MyFloat(float): |
| 1044 | sample = 1.0 |
| 1045 | |
| 1046 | class MyComplex(complex): |
| 1047 | sample = 1.0 + 0.0j |
| 1048 | |
| 1049 | class MyStr(str): |
| 1050 | sample = "hello" |
| 1051 | |
| 1052 | class MyUnicode(unicode): |
| 1053 | sample = u"hello \u1234" |
| 1054 | |
Guido van Rossum | 533dbcf | 2003-01-28 17:55:05 +0000 | [diff] [blame] | 1055 | class MyTuple(tuple): |
Guido van Rossum | 5d9113d | 2003-01-29 17:58:45 +0000 | [diff] [blame] | 1056 | sample = (1, 2, 3) |
Guido van Rossum | 533dbcf | 2003-01-28 17:55:05 +0000 | [diff] [blame] | 1057 | |
| 1058 | class MyList(list): |
Guido van Rossum | 5d9113d | 2003-01-29 17:58:45 +0000 | [diff] [blame] | 1059 | sample = [1, 2, 3] |
| 1060 | |
| 1061 | class MyDict(dict): |
| 1062 | sample = {"a": 1, "b": 2} |
| 1063 | |
| 1064 | myclasses = [MyInt, MyLong, MyFloat, |
Guido van Rossum | 206b9a7 | 2003-03-02 13:53:18 +0000 | [diff] [blame] | 1065 | MyComplex, |
Guido van Rossum | 5d9113d | 2003-01-29 17:58:45 +0000 | [diff] [blame] | 1066 | MyStr, MyUnicode, |
| 1067 | MyTuple, MyList, MyDict] |
| 1068 | |
Guido van Rossum | 533dbcf | 2003-01-28 17:55:05 +0000 | [diff] [blame] | 1069 | |
Guido van Rossum | c8d6ef5 | 2003-01-28 22:02:31 +0000 | [diff] [blame] | 1070 | class SlotList(MyList): |
| 1071 | __slots__ = ["foo"] |
| 1072 | |
Tim Peters | e9ef203 | 2003-02-13 18:42:00 +0000 | [diff] [blame] | 1073 | class SimpleNewObj(object): |
| 1074 | def __init__(self, a, b, c): |
| 1075 | # raise an error, to make sure this isn't called |
| 1076 | raise TypeError("SimpleNewObj.__init__() didn't expect to get called") |
| 1077 | |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 1078 | class AbstractPickleModuleTests(unittest.TestCase): |
| 1079 | |
| 1080 | def test_dump_closed_file(self): |
Guido van Rossum | 3b0a329 | 2002-08-09 16:38:32 +0000 | [diff] [blame] | 1081 | import os |
| 1082 | f = open(TESTFN, "w") |
| 1083 | try: |
| 1084 | f.close() |
| 1085 | self.assertRaises(ValueError, self.module.dump, 123, f) |
| 1086 | finally: |
| 1087 | os.remove(TESTFN) |
Jeremy Hylton | 6642653 | 2001-10-15 21:38:56 +0000 | [diff] [blame] | 1088 | |
| 1089 | def test_load_closed_file(self): |
Guido van Rossum | 3b0a329 | 2002-08-09 16:38:32 +0000 | [diff] [blame] | 1090 | import os |
| 1091 | f = open(TESTFN, "w") |
| 1092 | try: |
| 1093 | f.close() |
| 1094 | self.assertRaises(ValueError, self.module.dump, 123, f) |
| 1095 | finally: |
| 1096 | os.remove(TESTFN) |
Jeremy Hylton | 4c8be85 | 2002-11-13 22:10:47 +0000 | [diff] [blame] | 1097 | |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 1098 | def test_load_from_and_dump_to_file(self): |
| 1099 | stream = cStringIO.StringIO() |
| 1100 | data = [123, {}, 124] |
| 1101 | self.module.dump(data, stream) |
| 1102 | stream.seek(0) |
| 1103 | unpickled = self.module.load(stream) |
| 1104 | self.assertEqual(unpickled, data) |
| 1105 | |
Tim Peters | c0c9370 | 2003-02-13 19:30:57 +0000 | [diff] [blame] | 1106 | def test_highest_protocol(self): |
| 1107 | # Of course this needs to be changed when HIGHEST_PROTOCOL changes. |
| 1108 | self.assertEqual(self.module.HIGHEST_PROTOCOL, 2) |
| 1109 | |
Martin v. Löwis | 544f119 | 2004-07-27 05:22:33 +0000 | [diff] [blame] | 1110 | def test_callapi(self): |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 1111 | f = cStringIO.StringIO() |
Martin v. Löwis | 544f119 | 2004-07-27 05:22:33 +0000 | [diff] [blame] | 1112 | # With and without keyword arguments |
| 1113 | self.module.dump(123, f, -1) |
| 1114 | self.module.dump(123, file=f, protocol=-1) |
| 1115 | self.module.dumps(123, -1) |
| 1116 | self.module.dumps(123, protocol=-1) |
| 1117 | self.module.Pickler(f, -1) |
| 1118 | self.module.Pickler(f, protocol=-1) |
Tim Peters | c0c9370 | 2003-02-13 19:30:57 +0000 | [diff] [blame] | 1119 | |
Amaury Forgeot d'Arc | 74b3016 | 2009-07-23 19:26:02 +0000 | [diff] [blame] | 1120 | def test_incomplete_input(self): |
| 1121 | s = StringIO.StringIO("X''.") |
| 1122 | self.assertRaises(EOFError, self.module.load, s) |
| 1123 | |
Alexandre Vassalotti | 8b2d713 | 2009-11-24 17:53:23 +0000 | [diff] [blame] | 1124 | def test_restricted(self): |
| 1125 | # issue7128: cPickle failed in restricted mode |
| 1126 | builtins = {self.module.__name__: self.module, |
| 1127 | '__import__': __import__} |
| 1128 | d = {} |
| 1129 | teststr = "def f(): {0}.dumps(0)".format(self.module.__name__) |
| 1130 | exec teststr in {'__builtins__': builtins}, d |
| 1131 | d['f']() |
| 1132 | |
Antoine Pitrou | 0d423b8 | 2010-01-07 17:46:49 +0000 | [diff] [blame] | 1133 | def test_bad_input(self): |
| 1134 | # Test issue4298 |
| 1135 | s = '\x58\0\0\0\x54' |
| 1136 | self.assertRaises(EOFError, self.module.loads, s) |
| 1137 | # Test issue7455 |
| 1138 | s = '0' |
| 1139 | # XXX Why doesn't pickle raise UnpicklingError? |
| 1140 | self.assertRaises((IndexError, cPickle.UnpicklingError), |
| 1141 | self.module.loads, s) |
Alexandre Vassalotti | 8b2d713 | 2009-11-24 17:53:23 +0000 | [diff] [blame] | 1142 | |
Jeremy Hylton | 4c8be85 | 2002-11-13 22:10:47 +0000 | [diff] [blame] | 1143 | class AbstractPersistentPicklerTests(unittest.TestCase): |
| 1144 | |
| 1145 | # This class defines persistent_id() and persistent_load() |
| 1146 | # functions that should be used by the pickler. All even integers |
| 1147 | # are pickled using persistent ids. |
| 1148 | |
| 1149 | def persistent_id(self, object): |
| 1150 | if isinstance(object, int) and object % 2 == 0: |
| 1151 | self.id_count += 1 |
| 1152 | return str(object) |
| 1153 | else: |
| 1154 | return None |
| 1155 | |
| 1156 | def persistent_load(self, oid): |
| 1157 | self.load_count += 1 |
| 1158 | object = int(oid) |
| 1159 | assert object % 2 == 0 |
| 1160 | return object |
| 1161 | |
| 1162 | def test_persistence(self): |
| 1163 | self.id_count = 0 |
| 1164 | self.load_count = 0 |
| 1165 | L = range(10) |
| 1166 | self.assertEqual(self.loads(self.dumps(L)), L) |
| 1167 | self.assertEqual(self.id_count, 5) |
| 1168 | self.assertEqual(self.load_count, 5) |
| 1169 | |
| 1170 | def test_bin_persistence(self): |
| 1171 | self.id_count = 0 |
| 1172 | self.load_count = 0 |
| 1173 | L = range(10) |
| 1174 | self.assertEqual(self.loads(self.dumps(L, 1)), L) |
| 1175 | self.assertEqual(self.id_count, 5) |
| 1176 | self.assertEqual(self.load_count, 5) |
Collin Winter | f8089c7 | 2009-04-09 16:46:46 +0000 | [diff] [blame] | 1177 | |
| 1178 | class AbstractPicklerUnpicklerObjectTests(unittest.TestCase): |
| 1179 | |
| 1180 | pickler_class = None |
| 1181 | unpickler_class = None |
| 1182 | |
| 1183 | def setUp(self): |
| 1184 | assert self.pickler_class |
| 1185 | assert self.unpickler_class |
| 1186 | |
| 1187 | def test_clear_pickler_memo(self): |
| 1188 | # To test whether clear_memo() has any effect, we pickle an object, |
| 1189 | # then pickle it again without clearing the memo; the two serialized |
| 1190 | # forms should be different. If we clear_memo() and then pickle the |
| 1191 | # object again, the third serialized form should be identical to the |
| 1192 | # first one we obtained. |
| 1193 | data = ["abcdefg", "abcdefg", 44] |
| 1194 | f = cStringIO.StringIO() |
| 1195 | pickler = self.pickler_class(f) |
| 1196 | |
| 1197 | pickler.dump(data) |
| 1198 | first_pickled = f.getvalue() |
| 1199 | |
| 1200 | # Reset StringIO object. |
| 1201 | f.seek(0) |
| 1202 | f.truncate() |
| 1203 | |
| 1204 | pickler.dump(data) |
| 1205 | second_pickled = f.getvalue() |
| 1206 | |
| 1207 | # Reset the Pickler and StringIO objects. |
| 1208 | pickler.clear_memo() |
| 1209 | f.seek(0) |
| 1210 | f.truncate() |
| 1211 | |
| 1212 | pickler.dump(data) |
| 1213 | third_pickled = f.getvalue() |
| 1214 | |
| 1215 | self.assertNotEqual(first_pickled, second_pickled) |
| 1216 | self.assertEqual(first_pickled, third_pickled) |
| 1217 | |
| 1218 | def test_priming_pickler_memo(self): |
| 1219 | # Verify that we can set the Pickler's memo attribute. |
| 1220 | data = ["abcdefg", "abcdefg", 44] |
| 1221 | f = cStringIO.StringIO() |
| 1222 | pickler = self.pickler_class(f) |
| 1223 | |
| 1224 | pickler.dump(data) |
| 1225 | first_pickled = f.getvalue() |
| 1226 | |
| 1227 | f = cStringIO.StringIO() |
| 1228 | primed = self.pickler_class(f) |
| 1229 | primed.memo = pickler.memo |
| 1230 | |
| 1231 | primed.dump(data) |
| 1232 | primed_pickled = f.getvalue() |
| 1233 | |
| 1234 | self.assertNotEqual(first_pickled, primed_pickled) |
| 1235 | |
| 1236 | def test_priming_unpickler_memo(self): |
| 1237 | # Verify that we can set the Unpickler's memo attribute. |
| 1238 | data = ["abcdefg", "abcdefg", 44] |
| 1239 | f = cStringIO.StringIO() |
| 1240 | pickler = self.pickler_class(f) |
| 1241 | |
| 1242 | pickler.dump(data) |
| 1243 | first_pickled = f.getvalue() |
| 1244 | |
| 1245 | f = cStringIO.StringIO() |
| 1246 | primed = self.pickler_class(f) |
| 1247 | primed.memo = pickler.memo |
| 1248 | |
| 1249 | primed.dump(data) |
| 1250 | primed_pickled = f.getvalue() |
| 1251 | |
| 1252 | unpickler = self.unpickler_class(cStringIO.StringIO(first_pickled)) |
| 1253 | unpickled_data1 = unpickler.load() |
| 1254 | |
| 1255 | self.assertEqual(unpickled_data1, data) |
| 1256 | |
| 1257 | primed = self.unpickler_class(cStringIO.StringIO(primed_pickled)) |
| 1258 | primed.memo = unpickler.memo |
| 1259 | unpickled_data2 = primed.load() |
| 1260 | |
| 1261 | primed.memo.clear() |
| 1262 | |
| 1263 | self.assertEqual(unpickled_data2, data) |
| 1264 | self.assertTrue(unpickled_data2 is unpickled_data1) |
| 1265 | |
| 1266 | def test_reusing_unpickler_objects(self): |
| 1267 | data1 = ["abcdefg", "abcdefg", 44] |
| 1268 | f = cStringIO.StringIO() |
| 1269 | pickler = self.pickler_class(f) |
| 1270 | pickler.dump(data1) |
| 1271 | pickled1 = f.getvalue() |
| 1272 | |
| 1273 | data2 = ["abcdefg", 44, 44] |
| 1274 | f = cStringIO.StringIO() |
| 1275 | pickler = self.pickler_class(f) |
| 1276 | pickler.dump(data2) |
| 1277 | pickled2 = f.getvalue() |
| 1278 | |
| 1279 | f = cStringIO.StringIO() |
| 1280 | f.write(pickled1) |
| 1281 | f.seek(0) |
| 1282 | unpickler = self.unpickler_class(f) |
| 1283 | self.assertEqual(unpickler.load(), data1) |
| 1284 | |
| 1285 | f.seek(0) |
| 1286 | f.truncate() |
| 1287 | f.write(pickled2) |
| 1288 | f.seek(0) |
| 1289 | self.assertEqual(unpickler.load(), data2) |
Serhiy Storchaka | cdc7a91 | 2013-02-12 21:36:47 +0200 | [diff] [blame] | 1290 | |
| 1291 | class BigmemPickleTests(unittest.TestCase): |
| 1292 | |
| 1293 | # Memory requirements: 1 byte per character for input strings, 1 byte |
| 1294 | # for pickled data, 1 byte for unpickled strings, 1 byte for internal |
| 1295 | # buffer and 1 byte of free space for resizing of internal buffer. |
| 1296 | |
| 1297 | @precisionbigmemtest(size=_2G + 100*_1M, memuse=5) |
| 1298 | def test_huge_strlist(self, size): |
| 1299 | chunksize = 2**20 |
| 1300 | data = [] |
| 1301 | while size > chunksize: |
| 1302 | data.append('x' * chunksize) |
| 1303 | size -= chunksize |
| 1304 | chunksize += 1 |
| 1305 | data.append('y' * size) |
| 1306 | |
| 1307 | try: |
| 1308 | for proto in protocols: |
| 1309 | try: |
| 1310 | pickled = self.dumps(data, proto) |
| 1311 | res = self.loads(pickled) |
| 1312 | self.assertEqual(res, data) |
| 1313 | finally: |
| 1314 | res = None |
| 1315 | pickled = None |
| 1316 | finally: |
| 1317 | data = None |