blob: f7099a1b3009ab3832043d489b913a7b719cbf1a [file] [log] [blame]
Jeremy Hylton66426532001-10-15 21:38:56 +00001import unittest
Tim Peters4190fb82003-02-02 16:09:05 +00002import pickle
Tim Peters8587b3c2003-02-13 15:44:41 +00003import cPickle
Tim Peters31f119e2003-02-03 16:20:13 +00004import pickletools
Georg Brandldffbf5f2008-05-20 07:49:57 +00005import copy_reg
Tim Peters4190fb82003-02-02 16:09:05 +00006
Georg Brandlde9b6242006-04-30 11:13:56 +00007from test.test_support import TestFailed, have_unicode, TESTFN, \
8 run_with_locale
Tim Peterse089c682001-04-10 03:41:41 +00009
Tim Petersee1a53c2003-02-02 02:57:53 +000010# Tests that try a number of pickle protocols should have a
11# for proto in protocols:
Tim Peters8587b3c2003-02-13 15:44:41 +000012# kind of outer loop.
13assert pickle.HIGHEST_PROTOCOL == cPickle.HIGHEST_PROTOCOL == 2
14protocols = range(pickle.HIGHEST_PROTOCOL + 1)
Tim Petersee1a53c2003-02-02 02:57:53 +000015
Tim Peters22e71712003-02-03 22:27:38 +000016
17# Return True if opcode code appears in the pickle, else False.
18def opcode_in_pickle(code, pickle):
19 for op, dummy, dummy in pickletools.genops(pickle):
20 if op.code == code:
21 return True
22 return False
23
Tim Peters8d2613a2003-02-11 16:40:16 +000024# Return the number of times opcode code appears in pickle.
25def count_opcode(code, pickle):
26 n = 0
27 for op, dummy, dummy in pickletools.genops(pickle):
28 if op.code == code:
29 n += 1
30 return n
31
Tim Peters3e667d52003-02-04 21:47:44 +000032# We can't very well test the extension registry without putting known stuff
33# in it, but we have to be careful to restore its original state. Code
34# should do this:
35#
36# e = ExtensionSaver(extension_code)
37# try:
38# fiddle w/ the extension registry's stuff for extension_code
39# finally:
40# e.restore()
41
42class ExtensionSaver:
43 # Remember current registration for code (if any), and remove it (if
44 # there is one).
45 def __init__(self, code):
46 self.code = code
Georg Brandldffbf5f2008-05-20 07:49:57 +000047 if code in copy_reg._inverted_registry:
48 self.pair = copy_reg._inverted_registry[code]
49 copy_reg.remove_extension(self.pair[0], self.pair[1], code)
Tim Peters3e667d52003-02-04 21:47:44 +000050 else:
51 self.pair = None
52
53 # Restore previous registration for code.
54 def restore(self):
55 code = self.code
Georg Brandldffbf5f2008-05-20 07:49:57 +000056 curpair = copy_reg._inverted_registry.get(code)
Tim Peters3e667d52003-02-04 21:47:44 +000057 if curpair is not None:
Georg Brandldffbf5f2008-05-20 07:49:57 +000058 copy_reg.remove_extension(curpair[0], curpair[1], code)
Tim Peters3e667d52003-02-04 21:47:44 +000059 pair = self.pair
60 if pair is not None:
Georg Brandldffbf5f2008-05-20 07:49:57 +000061 copy_reg.add_extension(pair[0], pair[1], code)
Tim Peters3e667d52003-02-04 21:47:44 +000062
Jeremy Hylton66426532001-10-15 21:38:56 +000063class C:
64 def __cmp__(self, other):
65 return cmp(self.__dict__, other.__dict__)
66
67import __main__
68__main__.C = C
69C.__module__ = "__main__"
70
71class myint(int):
72 def __init__(self, x):
73 self.str = str(x)
74
75class initarg(C):
Guido van Rossum1444f672001-12-19 16:38:29 +000076
Jeremy Hylton66426532001-10-15 21:38:56 +000077 def __init__(self, a, b):
78 self.a = a
79 self.b = b
80
81 def __getinitargs__(self):
82 return self.a, self.b
83
Guido van Rossum04a86612001-12-19 16:58:54 +000084class metaclass(type):
85 pass
86
87class use_metaclass(object):
88 __metaclass__ = metaclass
89
Tim Peters70b02d72003-02-02 17:26:40 +000090# DATA0 .. DATA2 are the pickles we expect under the various protocols, for
91# the object returned by create_data().
Tim Petersee1a53c2003-02-02 02:57:53 +000092
Jeremy Hylton66426532001-10-15 21:38:56 +000093# break into multiple strings to avoid confusing font-lock-mode
Tim Peters70b02d72003-02-02 17:26:40 +000094DATA0 = """(lp1
Tim Peterse9358162001-01-22 22:05:20 +000095I0
96aL1L
Tim Peters461922a2001-04-09 20:07:05 +000097aF2
Tim Peterse9358162001-01-22 22:05:20 +000098ac__builtin__
99complex
Tim Peters461922a2001-04-09 20:07:05 +0000100p2
101""" + \
102"""(F3
103F0
104tRp3
105aI1
106aI-1
107aI255
108aI-255
109aI-256
110aI65535
111aI-65535
112aI-65536
113aI2147483647
114aI-2147483647
115aI-2147483648
116a""" + \
117"""(S'abc'
Tim Peterse9358162001-01-22 22:05:20 +0000118p4
119g4
Tim Peters461922a2001-04-09 20:07:05 +0000120""" + \
Guido van Rossum42f92da2001-04-16 00:28:21 +0000121"""(i__main__
Tim Peterse9358162001-01-22 22:05:20 +0000122C
123p5
Tim Peters461922a2001-04-09 20:07:05 +0000124""" + \
Tim Peterse9358162001-01-22 22:05:20 +0000125"""(dp6
126S'foo'
127p7
128I1
129sS'bar'
130p8
131I2
132sbg5
133tp9
134ag9
135aI5
136a.
137"""
138
Tim Peters70b02d72003-02-02 17:26:40 +0000139# Disassembly of DATA0.
140DATA0_DIS = """\
141 0: ( MARK
142 1: l LIST (MARK at 0)
143 2: p PUT 1
144 5: I INT 0
145 8: a APPEND
146 9: L LONG 1L
147 13: a APPEND
148 14: F FLOAT 2.0
149 17: a APPEND
150 18: c GLOBAL '__builtin__ complex'
151 39: p PUT 2
152 42: ( MARK
153 43: F FLOAT 3.0
154 46: F FLOAT 0.0
155 49: t TUPLE (MARK at 42)
156 50: R REDUCE
157 51: p PUT 3
158 54: a APPEND
159 55: I INT 1
160 58: a APPEND
161 59: I INT -1
162 63: a APPEND
163 64: I INT 255
164 69: a APPEND
165 70: I INT -255
166 76: a APPEND
167 77: I INT -256
168 83: a APPEND
169 84: I INT 65535
170 91: a APPEND
171 92: I INT -65535
172 100: a APPEND
173 101: I INT -65536
174 109: a APPEND
175 110: I INT 2147483647
176 122: a APPEND
177 123: I INT -2147483647
178 136: a APPEND
179 137: I INT -2147483648
180 150: a APPEND
181 151: ( MARK
182 152: S STRING 'abc'
183 159: p PUT 4
184 162: g GET 4
185 165: ( MARK
186 166: i INST '__main__ C' (MARK at 165)
187 178: p PUT 5
188 181: ( MARK
189 182: d DICT (MARK at 181)
190 183: p PUT 6
191 186: S STRING 'foo'
192 193: p PUT 7
193 196: I INT 1
194 199: s SETITEM
195 200: S STRING 'bar'
196 207: p PUT 8
197 210: I INT 2
198 213: s SETITEM
199 214: b BUILD
200 215: g GET 5
201 218: t TUPLE (MARK at 151)
202 219: p PUT 9
203 222: a APPEND
204 223: g GET 9
205 226: a APPEND
206 227: I INT 5
207 230: a APPEND
208 231: . STOP
209highest protocol among opcodes = 0
210"""
211
212DATA1 = (']q\x01(K\x00L1L\nG@\x00\x00\x00\x00\x00\x00\x00'
213 'c__builtin__\ncomplex\nq\x02(G@\x08\x00\x00\x00\x00\x00'
214 '\x00G\x00\x00\x00\x00\x00\x00\x00\x00tRq\x03K\x01J\xff\xff'
215 '\xff\xffK\xffJ\x01\xff\xff\xffJ\x00\xff\xff\xffM\xff\xff'
216 'J\x01\x00\xff\xffJ\x00\x00\xff\xffJ\xff\xff\xff\x7fJ\x01\x00'
217 '\x00\x80J\x00\x00\x00\x80(U\x03abcq\x04h\x04(c__main__\n'
218 'C\nq\x05oq\x06}q\x07(U\x03fooq\x08K\x01U\x03barq\tK\x02ubh'
219 '\x06tq\nh\nK\x05e.'
220 )
221
222# Disassembly of DATA1.
223DATA1_DIS = """\
224 0: ] EMPTY_LIST
225 1: q BINPUT 1
226 3: ( MARK
227 4: K BININT1 0
228 6: L LONG 1L
229 10: G BINFLOAT 2.0
230 19: c GLOBAL '__builtin__ complex'
231 40: q BINPUT 2
232 42: ( MARK
233 43: G BINFLOAT 3.0
234 52: G BINFLOAT 0.0
235 61: t TUPLE (MARK at 42)
236 62: R REDUCE
237 63: q BINPUT 3
238 65: K BININT1 1
239 67: J BININT -1
240 72: K BININT1 255
241 74: J BININT -255
242 79: J BININT -256
243 84: M BININT2 65535
244 87: J BININT -65535
245 92: J BININT -65536
246 97: J BININT 2147483647
247 102: J BININT -2147483647
248 107: J BININT -2147483648
249 112: ( MARK
250 113: U SHORT_BINSTRING 'abc'
251 118: q BINPUT 4
252 120: h BINGET 4
253 122: ( MARK
254 123: c GLOBAL '__main__ C'
255 135: q BINPUT 5
256 137: o OBJ (MARK at 122)
257 138: q BINPUT 6
258 140: } EMPTY_DICT
259 141: q BINPUT 7
260 143: ( MARK
261 144: U SHORT_BINSTRING 'foo'
262 149: q BINPUT 8
263 151: K BININT1 1
264 153: U SHORT_BINSTRING 'bar'
265 158: q BINPUT 9
266 160: K BININT1 2
267 162: u SETITEMS (MARK at 143)
268 163: b BUILD
269 164: h BINGET 6
270 166: t TUPLE (MARK at 112)
271 167: q BINPUT 10
272 169: h BINGET 10
273 171: K BININT1 5
274 173: e APPENDS (MARK at 3)
275 174: . STOP
276highest protocol among opcodes = 1
277"""
Tim Peterse0c446b2001-10-18 21:57:37 +0000278
Tim Petersfc273752003-03-02 04:54:24 +0000279DATA2 = ('\x80\x02]q\x01(K\x00\x8a\x01\x01G@\x00\x00\x00\x00\x00\x00\x00'
280 'c__builtin__\ncomplex\nq\x02G@\x08\x00\x00\x00\x00\x00\x00G\x00'
281 '\x00\x00\x00\x00\x00\x00\x00\x86Rq\x03K\x01J\xff\xff\xff\xffK'
282 '\xffJ\x01\xff\xff\xffJ\x00\xff\xff\xffM\xff\xffJ\x01\x00\xff\xff'
283 'J\x00\x00\xff\xffJ\xff\xff\xff\x7fJ\x01\x00\x00\x80J\x00\x00\x00'
284 '\x80(U\x03abcq\x04h\x04(c__main__\nC\nq\x05oq\x06}q\x07(U\x03foo'
285 'q\x08K\x01U\x03barq\tK\x02ubh\x06tq\nh\nK\x05e.')
286
287# Disassembly of DATA2.
288DATA2_DIS = """\
289 0: \x80 PROTO 2
290 2: ] EMPTY_LIST
291 3: q BINPUT 1
292 5: ( MARK
293 6: K BININT1 0
294 8: \x8a LONG1 1L
295 11: G BINFLOAT 2.0
296 20: c GLOBAL '__builtin__ complex'
297 41: q BINPUT 2
298 43: G BINFLOAT 3.0
299 52: G BINFLOAT 0.0
300 61: \x86 TUPLE2
301 62: R REDUCE
302 63: q BINPUT 3
303 65: K BININT1 1
304 67: J BININT -1
305 72: K BININT1 255
306 74: J BININT -255
307 79: J BININT -256
308 84: M BININT2 65535
309 87: J BININT -65535
310 92: J BININT -65536
311 97: J BININT 2147483647
312 102: J BININT -2147483647
313 107: J BININT -2147483648
314 112: ( MARK
315 113: U SHORT_BINSTRING 'abc'
316 118: q BINPUT 4
317 120: h BINGET 4
318 122: ( MARK
319 123: c GLOBAL '__main__ C'
320 135: q BINPUT 5
321 137: o OBJ (MARK at 122)
322 138: q BINPUT 6
323 140: } EMPTY_DICT
324 141: q BINPUT 7
325 143: ( MARK
326 144: U SHORT_BINSTRING 'foo'
327 149: q BINPUT 8
328 151: K BININT1 1
329 153: U SHORT_BINSTRING 'bar'
330 158: q BINPUT 9
331 160: K BININT1 2
332 162: u SETITEMS (MARK at 143)
333 163: b BUILD
334 164: h BINGET 6
335 166: t TUPLE (MARK at 112)
336 167: q BINPUT 10
337 169: h BINGET 10
338 171: K BININT1 5
339 173: e APPENDS (MARK at 5)
340 174: . STOP
341highest protocol among opcodes = 2
342"""
343
Jeremy Hylton66426532001-10-15 21:38:56 +0000344def create_data():
Tim Peterse9358162001-01-22 22:05:20 +0000345 c = C()
346 c.foo = 1
347 c.bar = 2
348 x = [0, 1L, 2.0, 3.0+0j]
Tim Peters461922a2001-04-09 20:07:05 +0000349 # Append some integer test cases at cPickle.c's internal size
350 # cutoffs.
351 uint1max = 0xff
352 uint2max = 0xffff
353 int4max = 0x7fffffff
354 x.extend([1, -1,
355 uint1max, -uint1max, -uint1max-1,
356 uint2max, -uint2max, -uint2max-1,
357 int4max, -int4max, -int4max-1])
Tim Peterse9358162001-01-22 22:05:20 +0000358 y = ('abc', 'abc', c, c)
359 x.append(y)
360 x.append(y)
361 x.append(5)
Jeremy Hylton66426532001-10-15 21:38:56 +0000362 return x
Tim Petersc58440f2001-04-09 17:16:31 +0000363
Jeremy Hylton66426532001-10-15 21:38:56 +0000364class AbstractPickleTests(unittest.TestCase):
Tim Peters70b02d72003-02-02 17:26:40 +0000365 # Subclass must define self.dumps, self.loads, self.error.
Tim Petersc58440f2001-04-09 17:16:31 +0000366
Jeremy Hylton66426532001-10-15 21:38:56 +0000367 _testdata = create_data()
Tim Petersc58440f2001-04-09 17:16:31 +0000368
Jeremy Hylton66426532001-10-15 21:38:56 +0000369 def setUp(self):
Tim Peterse9358162001-01-22 22:05:20 +0000370 pass
Tim Petersc58440f2001-04-09 17:16:31 +0000371
Jeremy Hylton66426532001-10-15 21:38:56 +0000372 def test_misc(self):
373 # test various datatypes not tested by testdata
Tim Peters70b02d72003-02-02 17:26:40 +0000374 for proto in protocols:
375 x = myint(4)
376 s = self.dumps(x, proto)
377 y = self.loads(s)
378 self.assertEqual(x, y)
Tim Peterse9358162001-01-22 22:05:20 +0000379
Tim Peters70b02d72003-02-02 17:26:40 +0000380 x = (1, ())
381 s = self.dumps(x, proto)
382 y = self.loads(s)
383 self.assertEqual(x, y)
Tim Peterse9358162001-01-22 22:05:20 +0000384
Tim Peters70b02d72003-02-02 17:26:40 +0000385 x = initarg(1, x)
386 s = self.dumps(x, proto)
387 y = self.loads(s)
388 self.assertEqual(x, y)
Tim Peterse9358162001-01-22 22:05:20 +0000389
Jeremy Hylton66426532001-10-15 21:38:56 +0000390 # XXX test __reduce__ protocol?
391
Tim Peters70b02d72003-02-02 17:26:40 +0000392 def test_roundtrip_equality(self):
393 expected = self._testdata
394 for proto in protocols:
395 s = self.dumps(expected, proto)
396 got = self.loads(s)
397 self.assertEqual(expected, got)
Jeremy Hylton66426532001-10-15 21:38:56 +0000398
Tim Peters70b02d72003-02-02 17:26:40 +0000399 def test_load_from_canned_string(self):
400 expected = self._testdata
Tim Petersfc273752003-03-02 04:54:24 +0000401 for canned in DATA0, DATA1, DATA2:
Tim Peters70b02d72003-02-02 17:26:40 +0000402 got = self.loads(canned)
403 self.assertEqual(expected, got)
Jeremy Hylton66426532001-10-15 21:38:56 +0000404
Tim Peters70b02d72003-02-02 17:26:40 +0000405 # There are gratuitous differences between pickles produced by
406 # pickle and cPickle, largely because cPickle starts PUT indices at
407 # 1 and pickle starts them at 0. See XXX comment in cPickle's put2() --
408 # there's a comment with an exclamation point there whose meaning
409 # is a mystery. cPickle also suppresses PUT for objects with a refcount
410 # of 1.
411 def dont_test_disassembly(self):
412 from cStringIO import StringIO
413 from pickletools import dis
414
415 for proto, expected in (0, DATA0_DIS), (1, DATA1_DIS):
416 s = self.dumps(self._testdata, proto)
417 filelike = StringIO()
418 dis(s, out=filelike)
419 got = filelike.getvalue()
420 self.assertEqual(expected, got)
Jeremy Hylton66426532001-10-15 21:38:56 +0000421
422 def test_recursive_list(self):
423 l = []
424 l.append(l)
Tim Peters70b02d72003-02-02 17:26:40 +0000425 for proto in protocols:
426 s = self.dumps(l, proto)
427 x = self.loads(s)
Armin Rigo2b3eb402003-10-28 12:05:48 +0000428 self.assertEqual(len(x), 1)
429 self.assert_(x is x[0])
Jeremy Hylton66426532001-10-15 21:38:56 +0000430
Collin Wintere9a65142009-05-26 05:37:22 +0000431 def test_recursive_tuple(self):
432 t = ([],)
433 t[0].append(t)
434 for proto in protocols:
435 s = self.dumps(t, proto)
436 x = self.loads(s)
437 self.assertEqual(len(x), 1)
438 self.assertEqual(len(x[0]), 1)
439 self.assert_(x is x[0][0])
440
Jeremy Hylton66426532001-10-15 21:38:56 +0000441 def test_recursive_dict(self):
442 d = {}
443 d[1] = d
Tim Peters70b02d72003-02-02 17:26:40 +0000444 for proto in protocols:
445 s = self.dumps(d, proto)
446 x = self.loads(s)
Armin Rigo2b3eb402003-10-28 12:05:48 +0000447 self.assertEqual(x.keys(), [1])
448 self.assert_(x[1] is x)
Jeremy Hylton66426532001-10-15 21:38:56 +0000449
450 def test_recursive_inst(self):
451 i = C()
452 i.attr = i
Tim Peters70b02d72003-02-02 17:26:40 +0000453 for proto in protocols:
454 s = self.dumps(i, 2)
455 x = self.loads(s)
Armin Rigo2b3eb402003-10-28 12:05:48 +0000456 self.assertEqual(dir(x), dir(i))
457 self.assert_(x.attr is x)
Jeremy Hylton66426532001-10-15 21:38:56 +0000458
459 def test_recursive_multi(self):
460 l = []
461 d = {1:l}
462 i = C()
463 i.attr = d
464 l.append(i)
Tim Peters70b02d72003-02-02 17:26:40 +0000465 for proto in protocols:
466 s = self.dumps(l, proto)
467 x = self.loads(s)
Armin Rigo2b3eb402003-10-28 12:05:48 +0000468 self.assertEqual(len(x), 1)
469 self.assertEqual(dir(x[0]), dir(i))
470 self.assertEqual(x[0].attr.keys(), [1])
471 self.assert_(x[0].attr[1] is x)
Jeremy Hylton66426532001-10-15 21:38:56 +0000472
473 def test_garyp(self):
474 self.assertRaises(self.error, self.loads, 'garyp')
475
476 def test_insecure_strings(self):
477 insecure = ["abc", "2 + 2", # not quoted
Martin v. Löwis8a8da792002-08-14 07:46:28 +0000478 #"'abc' + 'def'", # not a single quoted string
Jeremy Hylton66426532001-10-15 21:38:56 +0000479 "'abc", # quote is not closed
480 "'abc\"", # open quote and close quote don't match
481 "'abc' ?", # junk after close quote
Martin v. Löwiseb3f00a2002-08-14 08:22:50 +0000482 "'\\'", # trailing backslash
Jeremy Hylton66426532001-10-15 21:38:56 +0000483 # some tests of the quoting rules
Martin v. Löwis8a8da792002-08-14 07:46:28 +0000484 #"'abc\"\''",
485 #"'\\\\a\'\'\'\\\'\\\\\''",
Jeremy Hylton66426532001-10-15 21:38:56 +0000486 ]
487 for s in insecure:
488 buf = "S" + s + "\012p0\012."
489 self.assertRaises(ValueError, self.loads, buf)
490
Martin v. Löwis339d0f72001-08-17 18:39:25 +0000491 if have_unicode:
Jeremy Hylton66426532001-10-15 21:38:56 +0000492 def test_unicode(self):
Benjamin Peterson828a7062008-12-27 17:05:29 +0000493 endcases = [u'', u'<\\u>', u'<\\\u1234>', u'<\n>',
494 u'<\\>', u'<\\\U00012345>']
Tim Petersee1a53c2003-02-02 02:57:53 +0000495 for proto in protocols:
496 for u in endcases:
497 p = self.dumps(u, proto)
498 u2 = self.loads(p)
499 self.assertEqual(u2, u)
Tim Peterse089c682001-04-10 03:41:41 +0000500
Alexandre Vassalotti966322f2008-12-27 07:16:40 +0000501 def test_unicode_high_plane(self):
502 t = u'\U00012345'
503 for proto in protocols:
504 p = self.dumps(t, proto)
505 t2 = self.loads(p)
506 self.assertEqual(t2, t)
507
Jeremy Hylton66426532001-10-15 21:38:56 +0000508 def test_ints(self):
509 import sys
Tim Petersee1a53c2003-02-02 02:57:53 +0000510 for proto in protocols:
511 n = sys.maxint
512 while n:
513 for expected in (-n, n):
514 s = self.dumps(expected, proto)
515 n2 = self.loads(s)
516 self.assertEqual(expected, n2)
517 n = n >> 1
Tim Peters19ef62d2001-08-28 22:21:18 +0000518
Jeremy Hylton66426532001-10-15 21:38:56 +0000519 def test_maxint64(self):
520 maxint64 = (1L << 63) - 1
521 data = 'I' + str(maxint64) + '\n.'
522 got = self.loads(data)
523 self.assertEqual(got, maxint64)
524
525 # Try too with a bogus literal.
526 data = 'I' + str(maxint64) + 'JUNK\n.'
527 self.assertRaises(ValueError, self.loads, data)
528
Tim Petersee1a53c2003-02-02 02:57:53 +0000529 def test_long(self):
530 for proto in protocols:
Tim Petersbf2674b2003-02-02 07:51:32 +0000531 # 256 bytes is where LONG4 begins.
Tim Petersee1a53c2003-02-02 02:57:53 +0000532 for nbits in 1, 8, 8*254, 8*255, 8*256, 8*257:
533 nbase = 1L << nbits
534 for npos in nbase-1, nbase, nbase+1:
535 for n in npos, -npos:
536 pickle = self.dumps(n, proto)
537 got = self.loads(pickle)
538 self.assertEqual(n, got)
539 # Try a monster. This is quadratic-time in protos 0 & 1, so don't
540 # bother with those.
Tim Petersee1a53c2003-02-02 02:57:53 +0000541 nbase = long("deadbeeffeedface", 16)
542 nbase += nbase << 1000000
543 for n in nbase, -nbase:
Tim Petersee1a53c2003-02-02 02:57:53 +0000544 p = self.dumps(n, 2)
Tim Petersee1a53c2003-02-02 02:57:53 +0000545 got = self.loads(p)
Tim Petersee1a53c2003-02-02 02:57:53 +0000546 self.assertEqual(n, got)
547
Mark Dickinson3df16922009-01-24 21:30:14 +0000548 def test_float(self):
549 test_values = [0.0, 4.94e-324, 1e-310, 7e-308, 6.626e-34, 0.1, 0.5,
550 3.14, 263.44582062374053, 6.022e23, 1e30]
551 test_values = test_values + [-x for x in test_values]
552 for proto in protocols:
553 for value in test_values:
554 pickle = self.dumps(value, proto)
555 got = self.loads(pickle)
556 self.assertEqual(value, got)
557
Georg Brandlde9b6242006-04-30 11:13:56 +0000558 @run_with_locale('LC_ALL', 'de_DE', 'fr_FR')
559 def test_float_format(self):
560 # make sure that floats are formatted locale independent
561 self.assertEqual(self.dumps(1.2)[0:3], 'F1.')
562
Jeremy Hylton66426532001-10-15 21:38:56 +0000563 def test_reduce(self):
Tim Peters19ef62d2001-08-28 22:21:18 +0000564 pass
Jeremy Hylton66426532001-10-15 21:38:56 +0000565
566 def test_getinitargs(self):
567 pass
568
Guido van Rossum04a86612001-12-19 16:58:54 +0000569 def test_metaclass(self):
570 a = use_metaclass()
Tim Peters70b02d72003-02-02 17:26:40 +0000571 for proto in protocols:
572 s = self.dumps(a, proto)
573 b = self.loads(s)
574 self.assertEqual(a.__class__, b.__class__)
Guido van Rossum04a86612001-12-19 16:58:54 +0000575
Michael W. Hudson7bb466a2002-03-05 13:27:58 +0000576 def test_structseq(self):
577 import time
Michael W. Hudson0e025302002-03-06 17:11:18 +0000578 import os
Tim Peters70b02d72003-02-02 17:26:40 +0000579
580 t = time.localtime()
581 for proto in protocols:
582 s = self.dumps(t, proto)
Michael W. Hudson0e025302002-03-06 17:11:18 +0000583 u = self.loads(s)
584 self.assertEqual(t, u)
Tim Peters70b02d72003-02-02 17:26:40 +0000585 if hasattr(os, "stat"):
586 t = os.stat(os.curdir)
587 s = self.dumps(t, proto)
588 u = self.loads(s)
589 self.assertEqual(t, u)
590 if hasattr(os, "statvfs"):
591 t = os.statvfs(os.curdir)
592 s = self.dumps(t, proto)
593 u = self.loads(s)
594 self.assertEqual(t, u)
Michael W. Hudson7bb466a2002-03-05 13:27:58 +0000595
Guido van Rossumd6c9e632003-01-28 03:49:52 +0000596 # Tests for protocol 2
597
Tim Peters4190fb82003-02-02 16:09:05 +0000598 def test_proto(self):
599 build_none = pickle.NONE + pickle.STOP
600 for proto in protocols:
601 expected = build_none
602 if proto >= 2:
603 expected = pickle.PROTO + chr(proto) + expected
604 p = self.dumps(None, proto)
605 self.assertEqual(p, expected)
606
607 oob = protocols[-1] + 1 # a future protocol
608 badpickle = pickle.PROTO + chr(oob) + build_none
609 try:
610 self.loads(badpickle)
611 except ValueError, detail:
612 self.failUnless(str(detail).startswith(
613 "unsupported pickle protocol"))
614 else:
615 self.fail("expected bad protocol number to raise ValueError")
616
Guido van Rossumd6c9e632003-01-28 03:49:52 +0000617 def test_long1(self):
618 x = 12345678910111213141516178920L
Tim Peters61bf2572003-02-03 21:31:22 +0000619 for proto in protocols:
620 s = self.dumps(x, proto)
621 y = self.loads(s)
622 self.assertEqual(x, y)
Tim Peters22e71712003-02-03 22:27:38 +0000623 self.assertEqual(opcode_in_pickle(pickle.LONG1, s), proto >= 2)
Guido van Rossumd6c9e632003-01-28 03:49:52 +0000624
625 def test_long4(self):
626 x = 12345678910111213141516178920L << (256*8)
Tim Peters61bf2572003-02-03 21:31:22 +0000627 for proto in protocols:
628 s = self.dumps(x, proto)
629 y = self.loads(s)
630 self.assertEqual(x, y)
Tim Peters22e71712003-02-03 22:27:38 +0000631 self.assertEqual(opcode_in_pickle(pickle.LONG4, s), proto >= 2)
Guido van Rossumd6c9e632003-01-28 03:49:52 +0000632
Guido van Rossum44f0ea52003-01-28 04:14:51 +0000633 def test_short_tuples(self):
Tim Peters1d63c9f2003-02-02 20:29:39 +0000634 # Map (proto, len(tuple)) to expected opcode.
635 expected_opcode = {(0, 0): pickle.TUPLE,
636 (0, 1): pickle.TUPLE,
637 (0, 2): pickle.TUPLE,
638 (0, 3): pickle.TUPLE,
639 (0, 4): pickle.TUPLE,
640
641 (1, 0): pickle.EMPTY_TUPLE,
642 (1, 1): pickle.TUPLE,
643 (1, 2): pickle.TUPLE,
644 (1, 3): pickle.TUPLE,
645 (1, 4): pickle.TUPLE,
646
647 (2, 0): pickle.EMPTY_TUPLE,
648 (2, 1): pickle.TUPLE1,
649 (2, 2): pickle.TUPLE2,
650 (2, 3): pickle.TUPLE3,
651 (2, 4): pickle.TUPLE,
652 }
Guido van Rossum44f0ea52003-01-28 04:14:51 +0000653 a = ()
Guido van Rossum025bc2f2003-01-28 04:20:02 +0000654 b = (1,)
655 c = (1, 2)
656 d = (1, 2, 3)
657 e = (1, 2, 3, 4)
Tim Peters4190fb82003-02-02 16:09:05 +0000658 for proto in protocols:
Guido van Rossum44f0ea52003-01-28 04:14:51 +0000659 for x in a, b, c, d, e:
660 s = self.dumps(x, proto)
661 y = self.loads(s)
662 self.assertEqual(x, y, (proto, x, s, y))
Tim Peters1d63c9f2003-02-02 20:29:39 +0000663 expected = expected_opcode[proto, len(x)]
Tim Peters22e71712003-02-03 22:27:38 +0000664 self.assertEqual(opcode_in_pickle(expected, s), True)
Tim Peters1d63c9f2003-02-02 20:29:39 +0000665
Guido van Rossum7d97d312003-01-28 04:25:27 +0000666 def test_singletons(self):
Tim Peters61bf2572003-02-03 21:31:22 +0000667 # Map (proto, singleton) to expected opcode.
668 expected_opcode = {(0, None): pickle.NONE,
669 (1, None): pickle.NONE,
670 (2, None): pickle.NONE,
671
672 (0, True): pickle.INT,
673 (1, True): pickle.INT,
674 (2, True): pickle.NEWTRUE,
675
676 (0, False): pickle.INT,
677 (1, False): pickle.INT,
678 (2, False): pickle.NEWFALSE,
679 }
Tim Peters4190fb82003-02-02 16:09:05 +0000680 for proto in protocols:
Guido van Rossum7d97d312003-01-28 04:25:27 +0000681 for x in None, False, True:
682 s = self.dumps(x, proto)
683 y = self.loads(s)
684 self.assert_(x is y, (proto, x, s, y))
Tim Peters61bf2572003-02-03 21:31:22 +0000685 expected = expected_opcode[proto, x]
Tim Peters22e71712003-02-03 22:27:38 +0000686 self.assertEqual(opcode_in_pickle(expected, s), True)
Tim Peters3c67d792003-02-02 17:59:11 +0000687
Guido van Rossum533dbcf2003-01-28 17:55:05 +0000688 def test_newobj_tuple(self):
Guido van Rossum3d8c01b2003-01-28 19:48:18 +0000689 x = MyTuple([1, 2, 3])
690 x.foo = 42
691 x.bar = "hello"
Tim Peters894453a2003-02-03 22:32:18 +0000692 for proto in protocols:
693 s = self.dumps(x, proto)
694 y = self.loads(s)
695 self.assertEqual(tuple(x), tuple(y))
696 self.assertEqual(x.__dict__, y.__dict__)
Guido van Rossum533dbcf2003-01-28 17:55:05 +0000697
698 def test_newobj_list(self):
Guido van Rossum3d8c01b2003-01-28 19:48:18 +0000699 x = MyList([1, 2, 3])
700 x.foo = 42
701 x.bar = "hello"
Tim Peters894453a2003-02-03 22:32:18 +0000702 for proto in protocols:
703 s = self.dumps(x, proto)
704 y = self.loads(s)
705 self.assertEqual(list(x), list(y))
706 self.assertEqual(x.__dict__, y.__dict__)
Guido van Rossum533dbcf2003-01-28 17:55:05 +0000707
Guido van Rossum5d9113d2003-01-29 17:58:45 +0000708 def test_newobj_generic(self):
Tim Peters5013bd92003-02-03 22:28:41 +0000709 for proto in protocols:
Guido van Rossum5d9113d2003-01-29 17:58:45 +0000710 for C in myclasses:
711 B = C.__base__
712 x = C(C.sample)
713 x.foo = 42
714 s = self.dumps(x, proto)
Guido van Rossum5d9113d2003-01-29 17:58:45 +0000715 y = self.loads(s)
716 detail = (proto, C, B, x, y, type(y))
717 self.assertEqual(B(x), B(y), detail)
718 self.assertEqual(x.__dict__, y.__dict__, detail)
719
Georg Brandldffbf5f2008-05-20 07:49:57 +0000720 # Register a type with copy_reg, with extension code extcode. Pickle
Tim Peters22e71712003-02-03 22:27:38 +0000721 # an object of that type. Check that the resulting pickle uses opcode
722 # (EXT[124]) under proto 2, and not in proto 1.
Tim Peters3e667d52003-02-04 21:47:44 +0000723
Tim Peters22e71712003-02-03 22:27:38 +0000724 def produce_global_ext(self, extcode, opcode):
Tim Peters3e667d52003-02-04 21:47:44 +0000725 e = ExtensionSaver(extcode)
Guido van Rossum0322d0f2003-01-29 06:12:46 +0000726 try:
Georg Brandldffbf5f2008-05-20 07:49:57 +0000727 copy_reg.add_extension(__name__, "MyList", extcode)
Guido van Rossum0322d0f2003-01-29 06:12:46 +0000728 x = MyList([1, 2, 3])
729 x.foo = 42
730 x.bar = "hello"
731
Tim Peters22e71712003-02-03 22:27:38 +0000732 # Dump using protocol 1 for comparison.
Guido van Rossum0322d0f2003-01-29 06:12:46 +0000733 s1 = self.dumps(x, 1)
Tim Peters3e667d52003-02-04 21:47:44 +0000734 self.assert_(__name__ in s1)
735 self.assert_("MyList" in s1)
736 self.assertEqual(opcode_in_pickle(opcode, s1), False)
737
Guido van Rossum0322d0f2003-01-29 06:12:46 +0000738 y = self.loads(s1)
739 self.assertEqual(list(x), list(y))
740 self.assertEqual(x.__dict__, y.__dict__)
Guido van Rossum0322d0f2003-01-29 06:12:46 +0000741
Tim Peters22e71712003-02-03 22:27:38 +0000742 # Dump using protocol 2 for test.
Guido van Rossum0322d0f2003-01-29 06:12:46 +0000743 s2 = self.dumps(x, 2)
Tim Peters3e667d52003-02-04 21:47:44 +0000744 self.assert_(__name__ not in s2)
745 self.assert_("MyList" not in s2)
746 self.assertEqual(opcode_in_pickle(opcode, s2), True)
747
Guido van Rossum0322d0f2003-01-29 06:12:46 +0000748 y = self.loads(s2)
749 self.assertEqual(list(x), list(y))
750 self.assertEqual(x.__dict__, y.__dict__)
Guido van Rossum0322d0f2003-01-29 06:12:46 +0000751
752 finally:
Tim Peters3e667d52003-02-04 21:47:44 +0000753 e.restore()
Tim Peters22e71712003-02-03 22:27:38 +0000754
755 def test_global_ext1(self):
Tim Peters3e667d52003-02-04 21:47:44 +0000756 self.produce_global_ext(0x00000001, pickle.EXT1) # smallest EXT1 code
757 self.produce_global_ext(0x000000ff, pickle.EXT1) # largest EXT1 code
Guido van Rossum0322d0f2003-01-29 06:12:46 +0000758
759 def test_global_ext2(self):
Tim Peters3e667d52003-02-04 21:47:44 +0000760 self.produce_global_ext(0x00000100, pickle.EXT2) # smallest EXT2 code
761 self.produce_global_ext(0x0000ffff, pickle.EXT2) # largest EXT2 code
762 self.produce_global_ext(0x0000abcd, pickle.EXT2) # check endianness
Guido van Rossum0322d0f2003-01-29 06:12:46 +0000763
764 def test_global_ext4(self):
Tim Peters3e667d52003-02-04 21:47:44 +0000765 self.produce_global_ext(0x00010000, pickle.EXT4) # smallest EXT4 code
766 self.produce_global_ext(0x7fffffff, pickle.EXT4) # largest EXT4 code
767 self.produce_global_ext(0x12abcdef, pickle.EXT4) # check endianness
768
Tim Peters8d2613a2003-02-11 16:40:16 +0000769 def test_list_chunking(self):
770 n = 10 # too small to chunk
771 x = range(n)
772 for proto in protocols:
773 s = self.dumps(x, proto)
774 y = self.loads(s)
775 self.assertEqual(x, y)
776 num_appends = count_opcode(pickle.APPENDS, s)
777 self.assertEqual(num_appends, proto > 0)
778
779 n = 2500 # expect at least two chunks when proto > 0
780 x = range(n)
781 for proto in protocols:
782 s = self.dumps(x, proto)
783 y = self.loads(s)
784 self.assertEqual(x, y)
785 num_appends = count_opcode(pickle.APPENDS, s)
786 if proto == 0:
787 self.assertEqual(num_appends, 0)
788 else:
789 self.failUnless(num_appends >= 2)
790
791 def test_dict_chunking(self):
792 n = 10 # too small to chunk
793 x = dict.fromkeys(range(n))
794 for proto in protocols:
795 s = self.dumps(x, proto)
796 y = self.loads(s)
797 self.assertEqual(x, y)
798 num_setitems = count_opcode(pickle.SETITEMS, s)
799 self.assertEqual(num_setitems, proto > 0)
800
801 n = 2500 # expect at least two chunks when proto > 0
802 x = dict.fromkeys(range(n))
803 for proto in protocols:
804 s = self.dumps(x, proto)
805 y = self.loads(s)
806 self.assertEqual(x, y)
807 num_setitems = count_opcode(pickle.SETITEMS, s)
808 if proto == 0:
809 self.assertEqual(num_setitems, 0)
810 else:
811 self.failUnless(num_setitems >= 2)
Guido van Rossum0322d0f2003-01-29 06:12:46 +0000812
Tim Peterse9ef2032003-02-13 18:42:00 +0000813 def test_simple_newobj(self):
814 x = object.__new__(SimpleNewObj) # avoid __init__
815 x.abc = 666
816 for proto in protocols:
817 s = self.dumps(x, proto)
818 self.assertEqual(opcode_in_pickle(pickle.NEWOBJ, s), proto >= 2)
819 y = self.loads(s) # will raise TypeError if __init__ called
820 self.assertEqual(y.abc, 666)
821 self.assertEqual(x.__dict__, y.__dict__)
822
Tim Peters42f08ac2003-02-11 22:43:24 +0000823 def test_newobj_list_slots(self):
824 x = SlotList([1, 2, 3])
825 x.foo = 42
826 x.bar = "hello"
827 s = self.dumps(x, 2)
828 y = self.loads(s)
829 self.assertEqual(list(x), list(y))
830 self.assertEqual(x.__dict__, y.__dict__)
831 self.assertEqual(x.foo, y.foo)
832 self.assertEqual(x.bar, y.bar)
833
Guido van Rossum2a30b212003-02-18 22:41:24 +0000834 def test_reduce_overrides_default_reduce_ex(self):
835 for proto in 0, 1, 2:
836 x = REX_one()
837 self.assertEqual(x._reduce_called, 0)
838 s = self.dumps(x, proto)
839 self.assertEqual(x._reduce_called, 1)
840 y = self.loads(s)
841 self.assertEqual(y._reduce_called, 0)
842
843 def test_reduce_ex_called(self):
844 for proto in 0, 1, 2:
845 x = REX_two()
846 self.assertEqual(x._proto, None)
847 s = self.dumps(x, proto)
848 self.assertEqual(x._proto, proto)
849 y = self.loads(s)
850 self.assertEqual(y._proto, None)
851
852 def test_reduce_ex_overrides_reduce(self):
853 for proto in 0, 1, 2:
854 x = REX_three()
855 self.assertEqual(x._proto, None)
856 s = self.dumps(x, proto)
857 self.assertEqual(x._proto, proto)
858 y = self.loads(s)
859 self.assertEqual(y._proto, None)
860
Žiga Seilnacht20f43d32007-03-15 11:44:55 +0000861 def test_reduce_ex_calls_base(self):
862 for proto in 0, 1, 2:
863 x = REX_four()
864 self.assertEqual(x._proto, None)
865 s = self.dumps(x, proto)
866 self.assertEqual(x._proto, proto)
867 y = self.loads(s)
868 self.assertEqual(y._proto, proto)
869
870 def test_reduce_calls_base(self):
871 for proto in 0, 1, 2:
872 x = REX_five()
873 self.assertEqual(x._reduce_called, 0)
874 s = self.dumps(x, proto)
875 self.assertEqual(x._reduce_called, 1)
876 y = self.loads(s)
877 self.assertEqual(y._reduce_called, 1)
878
Amaury Forgeot d'Arcc353ea72008-10-30 21:29:12 +0000879 def test_reduce_bad_iterator(self):
880 # Issue4176: crash when 4th and 5th items of __reduce__()
881 # are not iterators
882 class C(object):
883 def __reduce__(self):
884 # 4th item is not an iterator
885 return list, (), None, [], None
886 class D(object):
887 def __reduce__(self):
888 # 5th item is not an iterator
889 return dict, (), None, None, []
890
891 # Protocol 0 is less strict and also accept iterables.
892 for proto in 0, 1, 2:
893 try:
894 self.dumps(C(), proto)
895 except (AttributeError, pickle.PickleError, cPickle.PickleError):
896 pass
897 try:
898 self.dumps(D(), proto)
899 except (AttributeError, pickle.PickleError, cPickle.PickleError):
900 pass
901
Guido van Rossum2a30b212003-02-18 22:41:24 +0000902# Test classes for reduce_ex
903
904class REX_one(object):
905 _reduce_called = 0
906 def __reduce__(self):
907 self._reduce_called = 1
908 return REX_one, ()
909 # No __reduce_ex__ here, but inheriting it from object
910
911class REX_two(object):
912 _proto = None
913 def __reduce_ex__(self, proto):
914 self._proto = proto
915 return REX_two, ()
916 # No __reduce__ here, but inheriting it from object
917
918class REX_three(object):
919 _proto = None
920 def __reduce_ex__(self, proto):
921 self._proto = proto
922 return REX_two, ()
923 def __reduce__(self):
924 raise TestFailed, "This __reduce__ shouldn't be called"
925
Žiga Seilnacht20f43d32007-03-15 11:44:55 +0000926class REX_four(object):
927 _proto = None
928 def __reduce_ex__(self, proto):
929 self._proto = proto
930 return object.__reduce_ex__(self, proto)
931 # Calling base class method should succeed
932
933class REX_five(object):
934 _reduce_called = 0
935 def __reduce__(self):
936 self._reduce_called = 1
937 return object.__reduce__(self)
938 # This one used to fail with infinite recursion
939
Guido van Rossum2a30b212003-02-18 22:41:24 +0000940# Test classes for newobj
Tim Peters080c88b2003-02-15 03:01:11 +0000941
Guido van Rossum5d9113d2003-01-29 17:58:45 +0000942class MyInt(int):
943 sample = 1
944
945class MyLong(long):
946 sample = 1L
947
948class MyFloat(float):
949 sample = 1.0
950
951class MyComplex(complex):
952 sample = 1.0 + 0.0j
953
954class MyStr(str):
955 sample = "hello"
956
957class MyUnicode(unicode):
958 sample = u"hello \u1234"
959
Guido van Rossum533dbcf2003-01-28 17:55:05 +0000960class MyTuple(tuple):
Guido van Rossum5d9113d2003-01-29 17:58:45 +0000961 sample = (1, 2, 3)
Guido van Rossum533dbcf2003-01-28 17:55:05 +0000962
963class MyList(list):
Guido van Rossum5d9113d2003-01-29 17:58:45 +0000964 sample = [1, 2, 3]
965
966class MyDict(dict):
967 sample = {"a": 1, "b": 2}
968
969myclasses = [MyInt, MyLong, MyFloat,
Guido van Rossum206b9a72003-03-02 13:53:18 +0000970 MyComplex,
Guido van Rossum5d9113d2003-01-29 17:58:45 +0000971 MyStr, MyUnicode,
972 MyTuple, MyList, MyDict]
973
Guido van Rossum533dbcf2003-01-28 17:55:05 +0000974
Guido van Rossumc8d6ef52003-01-28 22:02:31 +0000975class SlotList(MyList):
976 __slots__ = ["foo"]
977
Tim Peterse9ef2032003-02-13 18:42:00 +0000978class SimpleNewObj(object):
979 def __init__(self, a, b, c):
980 # raise an error, to make sure this isn't called
981 raise TypeError("SimpleNewObj.__init__() didn't expect to get called")
982
Jeremy Hylton66426532001-10-15 21:38:56 +0000983class AbstractPickleModuleTests(unittest.TestCase):
984
985 def test_dump_closed_file(self):
Guido van Rossum3b0a3292002-08-09 16:38:32 +0000986 import os
987 f = open(TESTFN, "w")
988 try:
989 f.close()
990 self.assertRaises(ValueError, self.module.dump, 123, f)
991 finally:
992 os.remove(TESTFN)
Jeremy Hylton66426532001-10-15 21:38:56 +0000993
994 def test_load_closed_file(self):
Guido van Rossum3b0a3292002-08-09 16:38:32 +0000995 import os
996 f = open(TESTFN, "w")
997 try:
998 f.close()
999 self.assertRaises(ValueError, self.module.dump, 123, f)
1000 finally:
1001 os.remove(TESTFN)
Jeremy Hylton4c8be852002-11-13 22:10:47 +00001002
Tim Petersc0c93702003-02-13 19:30:57 +00001003 def test_highest_protocol(self):
1004 # Of course this needs to be changed when HIGHEST_PROTOCOL changes.
1005 self.assertEqual(self.module.HIGHEST_PROTOCOL, 2)
1006
Martin v. Löwis544f1192004-07-27 05:22:33 +00001007 def test_callapi(self):
1008 from cStringIO import StringIO
1009 f = StringIO()
1010 # With and without keyword arguments
1011 self.module.dump(123, f, -1)
1012 self.module.dump(123, file=f, protocol=-1)
1013 self.module.dumps(123, -1)
1014 self.module.dumps(123, protocol=-1)
1015 self.module.Pickler(f, -1)
1016 self.module.Pickler(f, protocol=-1)
Tim Petersc0c93702003-02-13 19:30:57 +00001017
Jeremy Hylton4c8be852002-11-13 22:10:47 +00001018class AbstractPersistentPicklerTests(unittest.TestCase):
1019
1020 # This class defines persistent_id() and persistent_load()
1021 # functions that should be used by the pickler. All even integers
1022 # are pickled using persistent ids.
1023
1024 def persistent_id(self, object):
1025 if isinstance(object, int) and object % 2 == 0:
1026 self.id_count += 1
1027 return str(object)
1028 else:
1029 return None
1030
1031 def persistent_load(self, oid):
1032 self.load_count += 1
1033 object = int(oid)
1034 assert object % 2 == 0
1035 return object
1036
1037 def test_persistence(self):
1038 self.id_count = 0
1039 self.load_count = 0
1040 L = range(10)
1041 self.assertEqual(self.loads(self.dumps(L)), L)
1042 self.assertEqual(self.id_count, 5)
1043 self.assertEqual(self.load_count, 5)
1044
1045 def test_bin_persistence(self):
1046 self.id_count = 0
1047 self.load_count = 0
1048 L = range(10)
1049 self.assertEqual(self.loads(self.dumps(L, 1)), L)
1050 self.assertEqual(self.id_count, 5)
1051 self.assertEqual(self.load_count, 5)