Gregory P. Smith | 49fa4a9 | 2018-11-08 17:55:07 -0800 | [diff] [blame] | 1 | import dis |
Antoine Pitrou | 9961405 | 2014-05-23 11:46:03 +0200 | [diff] [blame] | 2 | import math |
Benjamin Peterson | d73aca7 | 2015-04-21 12:05:19 -0400 | [diff] [blame] | 3 | import os |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 4 | import unittest |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 5 | import sys |
Martin v. Löwis | 618dc5e | 2008-03-30 20:03:44 +0000 | [diff] [blame] | 6 | import _ast |
Benjamin Peterson | d73aca7 | 2015-04-21 12:05:19 -0400 | [diff] [blame] | 7 | import tempfile |
Benjamin Peterson | 43b0686 | 2011-05-27 09:08:01 -0500 | [diff] [blame] | 8 | import types |
Berker Peksag | 076dbd0 | 2015-05-06 07:01:52 +0300 | [diff] [blame] | 9 | from test import support |
Hai Shi | 847f94f | 2020-06-26 01:17:57 +0800 | [diff] [blame] | 10 | from test.support import script_helper |
| 11 | from test.support.os_helper import FakePath |
| 12 | |
Peter Schneider-Kamp | fdee0f0 | 2000-07-25 22:15:45 +0000 | [diff] [blame] | 13 | |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 14 | class TestSpecifics(unittest.TestCase): |
Jeremy Hylton | 778e265 | 2001-11-09 19:50:08 +0000 | [diff] [blame] | 15 | |
Meador Inge | fa21bf0 | 2012-01-19 01:08:41 -0600 | [diff] [blame] | 16 | def compile_single(self, source): |
| 17 | compile(source, "<single>", "single") |
| 18 | |
| 19 | def assertInvalidSingle(self, source): |
| 20 | self.assertRaises(SyntaxError, self.compile_single, source) |
| 21 | |
Benjamin Peterson | aeaa592 | 2009-11-13 00:17:59 +0000 | [diff] [blame] | 22 | def test_no_ending_newline(self): |
| 23 | compile("hi", "<test>", "exec") |
| 24 | compile("hi\r", "<test>", "exec") |
| 25 | |
| 26 | def test_empty(self): |
| 27 | compile("", "<test>", "exec") |
| 28 | |
| 29 | def test_other_newlines(self): |
| 30 | compile("\r\n", "<test>", "exec") |
| 31 | compile("\r", "<test>", "exec") |
| 32 | compile("hi\r\nstuff\r\ndef f():\n pass\r", "<test>", "exec") |
| 33 | compile("this_is\rreally_old_mac\rdef f():\n pass", "<test>", "exec") |
| 34 | |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 35 | def test_debug_assignment(self): |
| 36 | # catch assignments to __debug__ |
| 37 | self.assertRaises(SyntaxError, compile, '__debug__ = 1', '?', 'single') |
Georg Brandl | 1a3284e | 2007-12-02 09:40:06 +0000 | [diff] [blame] | 38 | import builtins |
| 39 | prev = builtins.__debug__ |
| 40 | setattr(builtins, '__debug__', 'sure') |
Serhiy Storchaka | 3325a67 | 2017-12-15 12:35:48 +0200 | [diff] [blame] | 41 | self.assertEqual(__debug__, prev) |
Georg Brandl | 1a3284e | 2007-12-02 09:40:06 +0000 | [diff] [blame] | 42 | setattr(builtins, '__debug__', prev) |
Jeremy Hylton | 778e265 | 2001-11-09 19:50:08 +0000 | [diff] [blame] | 43 | |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 44 | def test_argument_handling(self): |
| 45 | # detect duplicate positional and keyword arguments |
| 46 | self.assertRaises(SyntaxError, eval, 'lambda a,a:0') |
| 47 | self.assertRaises(SyntaxError, eval, 'lambda a,a=1:0') |
| 48 | self.assertRaises(SyntaxError, eval, 'lambda a=1,a=1:0') |
Benjamin Peterson | ec19d95 | 2008-06-30 15:01:21 +0000 | [diff] [blame] | 49 | self.assertRaises(SyntaxError, exec, 'def f(a, a): pass') |
| 50 | self.assertRaises(SyntaxError, exec, 'def f(a = 0, a = 1): pass') |
| 51 | self.assertRaises(SyntaxError, exec, 'def f(a): global a; a = 1') |
Jeremy Hylton | 778e265 | 2001-11-09 19:50:08 +0000 | [diff] [blame] | 52 | |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 53 | def test_syntax_error(self): |
| 54 | self.assertRaises(SyntaxError, compile, "1+*3", "filename", "exec") |
Peter Schneider-Kamp | fdee0f0 | 2000-07-25 22:15:45 +0000 | [diff] [blame] | 55 | |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 56 | def test_none_keyword_arg(self): |
| 57 | self.assertRaises(SyntaxError, compile, "f(None=1)", "<string>", "exec") |
| 58 | |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 59 | def test_duplicate_global_local(self): |
Benjamin Peterson | ec19d95 | 2008-06-30 15:01:21 +0000 | [diff] [blame] | 60 | self.assertRaises(SyntaxError, exec, 'def f(a): global a; a = 1') |
Peter Schneider-Kamp | fdee0f0 | 2000-07-25 22:15:45 +0000 | [diff] [blame] | 61 | |
Raymond Hettinger | 66bd233 | 2004-08-02 08:30:07 +0000 | [diff] [blame] | 62 | def test_exec_with_general_mapping_for_locals(self): |
| 63 | |
| 64 | class M: |
| 65 | "Test mapping interface versus possible calls from eval()." |
| 66 | def __getitem__(self, key): |
| 67 | if key == 'a': |
| 68 | return 12 |
| 69 | raise KeyError |
| 70 | def __setitem__(self, key, value): |
| 71 | self.results = (key, value) |
Guido van Rossum | 63eecc7 | 2007-02-22 23:55:25 +0000 | [diff] [blame] | 72 | def keys(self): |
| 73 | return list('xyz') |
Raymond Hettinger | 66bd233 | 2004-08-02 08:30:07 +0000 | [diff] [blame] | 74 | |
| 75 | m = M() |
| 76 | g = globals() |
Georg Brandl | 7cae87c | 2006-09-06 06:51:57 +0000 | [diff] [blame] | 77 | exec('z = a', g, m) |
Raymond Hettinger | 66bd233 | 2004-08-02 08:30:07 +0000 | [diff] [blame] | 78 | self.assertEqual(m.results, ('z', 12)) |
| 79 | try: |
Georg Brandl | 7cae87c | 2006-09-06 06:51:57 +0000 | [diff] [blame] | 80 | exec('z = b', g, m) |
Raymond Hettinger | 66bd233 | 2004-08-02 08:30:07 +0000 | [diff] [blame] | 81 | except NameError: |
| 82 | pass |
| 83 | else: |
| 84 | self.fail('Did not detect a KeyError') |
Georg Brandl | 7cae87c | 2006-09-06 06:51:57 +0000 | [diff] [blame] | 85 | exec('z = dir()', g, m) |
Raymond Hettinger | 66bd233 | 2004-08-02 08:30:07 +0000 | [diff] [blame] | 86 | self.assertEqual(m.results, ('z', list('xyz'))) |
Georg Brandl | 7cae87c | 2006-09-06 06:51:57 +0000 | [diff] [blame] | 87 | exec('z = globals()', g, m) |
Raymond Hettinger | 66bd233 | 2004-08-02 08:30:07 +0000 | [diff] [blame] | 88 | self.assertEqual(m.results, ('z', g)) |
Georg Brandl | 7cae87c | 2006-09-06 06:51:57 +0000 | [diff] [blame] | 89 | exec('z = locals()', g, m) |
Raymond Hettinger | 66bd233 | 2004-08-02 08:30:07 +0000 | [diff] [blame] | 90 | self.assertEqual(m.results, ('z', m)) |
Benjamin Peterson | ec19d95 | 2008-06-30 15:01:21 +0000 | [diff] [blame] | 91 | self.assertRaises(TypeError, exec, 'z = b', m) |
Raymond Hettinger | 66bd233 | 2004-08-02 08:30:07 +0000 | [diff] [blame] | 92 | |
| 93 | class A: |
| 94 | "Non-mapping" |
| 95 | pass |
| 96 | m = A() |
Benjamin Peterson | ec19d95 | 2008-06-30 15:01:21 +0000 | [diff] [blame] | 97 | self.assertRaises(TypeError, exec, 'z = a', g, m) |
Raymond Hettinger | 66bd233 | 2004-08-02 08:30:07 +0000 | [diff] [blame] | 98 | |
| 99 | # Verify that dict subclasses work as well |
| 100 | class D(dict): |
| 101 | def __getitem__(self, key): |
| 102 | if key == 'a': |
| 103 | return 12 |
| 104 | return dict.__getitem__(self, key) |
| 105 | d = D() |
Georg Brandl | 7cae87c | 2006-09-06 06:51:57 +0000 | [diff] [blame] | 106 | exec('z = a', g, d) |
Raymond Hettinger | 66bd233 | 2004-08-02 08:30:07 +0000 | [diff] [blame] | 107 | self.assertEqual(d['z'], 12) |
| 108 | |
Neal Norwitz | 6ab080c | 2005-10-24 00:08:10 +0000 | [diff] [blame] | 109 | def test_extended_arg(self): |
| 110 | longexpr = 'x = x or ' + '-x' * 2500 |
Georg Brandl | 7cae87c | 2006-09-06 06:51:57 +0000 | [diff] [blame] | 111 | g = {} |
Neal Norwitz | 6ab080c | 2005-10-24 00:08:10 +0000 | [diff] [blame] | 112 | code = ''' |
| 113 | def f(x): |
| 114 | %s |
| 115 | %s |
| 116 | %s |
| 117 | %s |
| 118 | %s |
| 119 | %s |
| 120 | %s |
| 121 | %s |
| 122 | %s |
| 123 | %s |
| 124 | # the expressions above have no effect, x == argument |
| 125 | while x: |
| 126 | x -= 1 |
| 127 | # EXTENDED_ARG/JUMP_ABSOLUTE here |
| 128 | return x |
| 129 | ''' % ((longexpr,)*10) |
Georg Brandl | 7cae87c | 2006-09-06 06:51:57 +0000 | [diff] [blame] | 130 | exec(code, g) |
| 131 | self.assertEqual(g['f'](5), 0) |
Neal Norwitz | 6ab080c | 2005-10-24 00:08:10 +0000 | [diff] [blame] | 132 | |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 133 | def test_argument_order(self): |
Benjamin Peterson | ec19d95 | 2008-06-30 15:01:21 +0000 | [diff] [blame] | 134 | self.assertRaises(SyntaxError, exec, 'def f(a=1, b): pass') |
Jeremy Hylton | 121b6eb | 2001-02-19 23:53:42 +0000 | [diff] [blame] | 135 | |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 136 | def test_float_literals(self): |
| 137 | # testing bad float literals |
| 138 | self.assertRaises(SyntaxError, eval, "2e") |
| 139 | self.assertRaises(SyntaxError, eval, "2.0e+") |
| 140 | self.assertRaises(SyntaxError, eval, "1e-") |
| 141 | self.assertRaises(SyntaxError, eval, "3-4e/21") |
Jeremy Hylton | 121b6eb | 2001-02-19 23:53:42 +0000 | [diff] [blame] | 142 | |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 143 | def test_indentation(self): |
| 144 | # testing compile() of indented block w/o trailing newline" |
| 145 | s = """ |
Guido van Rossum | 4b499dd3 | 2003-02-13 22:07:59 +0000 | [diff] [blame] | 146 | if 1: |
| 147 | if 2: |
| 148 | pass""" |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 149 | compile(s, "<string>", "exec") |
| 150 | |
Thomas Wouters | 0e3f591 | 2006-08-11 14:57:12 +0000 | [diff] [blame] | 151 | # This test is probably specific to CPython and may not generalize |
| 152 | # to other implementations. We are trying to ensure that when |
| 153 | # the first line of code starts after 256, correct line numbers |
| 154 | # in tracebacks are still produced. |
| 155 | def test_leading_newlines(self): |
| 156 | s256 = "".join(["\n"] * 256 + ["spam"]) |
| 157 | co = compile(s256, 'fn', 'exec') |
Mark Shannon | 877df85 | 2020-11-12 09:43:29 +0000 | [diff] [blame] | 158 | self.assertEqual(co.co_firstlineno, 1) |
Mark Shannon | 5977a79 | 2020-12-02 13:31:40 +0000 | [diff] [blame] | 159 | self.assertEqual(list(co.co_lines()), [(0, 8, 257)]) |
Thomas Wouters | 0e3f591 | 2006-08-11 14:57:12 +0000 | [diff] [blame] | 160 | |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 161 | def test_literals_with_leading_zeroes(self): |
| 162 | for arg in ["077787", "0xj", "0x.", "0e", "090000000000000", |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 163 | "080000000000000", "000000000000009", "000000000000008", |
| 164 | "0b42", "0BADCAFE", "0o123456789", "0b1.1", "0o4.2", |
| 165 | "0b101j2", "0o153j2", "0b100e1", "0o777e1", "0777", |
| 166 | "000777", "000000000000007"]: |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 167 | self.assertRaises(SyntaxError, eval, arg) |
| 168 | |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 169 | self.assertEqual(eval("0xff"), 255) |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 170 | self.assertEqual(eval("0777."), 777) |
| 171 | self.assertEqual(eval("0777.0"), 777) |
| 172 | self.assertEqual(eval("000000000000000000000000000000000000000000000000000777e0"), 777) |
| 173 | self.assertEqual(eval("0777e1"), 7770) |
| 174 | self.assertEqual(eval("0e0"), 0) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 175 | self.assertEqual(eval("0000e-012"), 0) |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 176 | self.assertEqual(eval("09.5"), 9.5) |
| 177 | self.assertEqual(eval("0777j"), 777j) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 178 | self.assertEqual(eval("000"), 0) |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 179 | self.assertEqual(eval("00j"), 0j) |
| 180 | self.assertEqual(eval("00.0"), 0) |
| 181 | self.assertEqual(eval("0e3"), 0) |
| 182 | self.assertEqual(eval("090000000000000."), 90000000000000.) |
| 183 | self.assertEqual(eval("090000000000000.0000000000000000000000"), 90000000000000.) |
| 184 | self.assertEqual(eval("090000000000000e0"), 90000000000000.) |
| 185 | self.assertEqual(eval("090000000000000e-0"), 90000000000000.) |
| 186 | self.assertEqual(eval("090000000000000j"), 90000000000000j) |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 187 | self.assertEqual(eval("000000000000008."), 8.) |
| 188 | self.assertEqual(eval("000000000000009."), 9.) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 189 | self.assertEqual(eval("0b101010"), 42) |
| 190 | self.assertEqual(eval("-0b000000000010"), -2) |
| 191 | self.assertEqual(eval("0o777"), 511) |
| 192 | self.assertEqual(eval("-0o0000010"), -8) |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 193 | |
| 194 | def test_unary_minus(self): |
| 195 | # Verify treatment of unary minus on negative numbers SF bug #660455 |
Christian Heimes | a37d4c6 | 2007-12-04 23:02:19 +0000 | [diff] [blame] | 196 | if sys.maxsize == 2147483647: |
Guido van Rossum | 6c9e130 | 2003-11-29 23:52:13 +0000 | [diff] [blame] | 197 | # 32-bit machine |
| 198 | all_one_bits = '0xffffffff' |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 199 | self.assertEqual(eval(all_one_bits), 4294967295) |
| 200 | self.assertEqual(eval("-" + all_one_bits), -4294967295) |
Christian Heimes | a37d4c6 | 2007-12-04 23:02:19 +0000 | [diff] [blame] | 201 | elif sys.maxsize == 9223372036854775807: |
Guido van Rossum | 6c9e130 | 2003-11-29 23:52:13 +0000 | [diff] [blame] | 202 | # 64-bit machine |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 203 | all_one_bits = '0xffffffffffffffff' |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 204 | self.assertEqual(eval(all_one_bits), 18446744073709551615) |
| 205 | self.assertEqual(eval("-" + all_one_bits), -18446744073709551615) |
Guido van Rossum | 6c9e130 | 2003-11-29 23:52:13 +0000 | [diff] [blame] | 206 | else: |
| 207 | self.fail("How many bits *does* this machine have???") |
Ezio Melotti | 42da663 | 2011-03-15 05:18:48 +0200 | [diff] [blame] | 208 | # Verify treatment of constant folding on -(sys.maxsize+1) |
Serhiy Storchaka | 9594942 | 2013-08-27 19:40:23 +0300 | [diff] [blame] | 209 | # i.e. -2147483648 on 32 bit platforms. Should return int. |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 210 | self.assertIsInstance(eval("%s" % (-sys.maxsize - 1)), int) |
| 211 | self.assertIsInstance(eval("%s" % (-sys.maxsize - 2)), int) |
Thomas Wouters | 0e3f591 | 2006-08-11 14:57:12 +0000 | [diff] [blame] | 212 | |
Christian Heimes | a37d4c6 | 2007-12-04 23:02:19 +0000 | [diff] [blame] | 213 | if sys.maxsize == 9223372036854775807: |
Thomas Wouters | 0e3f591 | 2006-08-11 14:57:12 +0000 | [diff] [blame] | 214 | def test_32_63_bit_values(self): |
| 215 | a = +4294967296 # 1 << 32 |
| 216 | b = -4294967296 # 1 << 32 |
| 217 | c = +281474976710656 # 1 << 48 |
| 218 | d = -281474976710656 # 1 << 48 |
| 219 | e = +4611686018427387904 # 1 << 62 |
| 220 | f = -4611686018427387904 # 1 << 62 |
| 221 | g = +9223372036854775807 # 1 << 63 - 1 |
| 222 | h = -9223372036854775807 # 1 << 63 - 1 |
| 223 | |
Neal Norwitz | 221085d | 2007-02-25 20:55:47 +0000 | [diff] [blame] | 224 | for variable in self.test_32_63_bit_values.__code__.co_consts: |
Thomas Wouters | 0e3f591 | 2006-08-11 14:57:12 +0000 | [diff] [blame] | 225 | if variable is not None: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 226 | self.assertIsInstance(variable, int) |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 227 | |
| 228 | def test_sequence_unpacking_error(self): |
| 229 | # Verify sequence packing/unpacking with "or". SF bug #757818 |
| 230 | i,j = (1, -1) or (-1, 1) |
| 231 | self.assertEqual(i, 1) |
| 232 | self.assertEqual(j, -1) |
Guido van Rossum | 4b499dd3 | 2003-02-13 22:07:59 +0000 | [diff] [blame] | 233 | |
Raymond Hettinger | 11a70c7 | 2004-07-17 21:46:25 +0000 | [diff] [blame] | 234 | def test_none_assignment(self): |
| 235 | stmts = [ |
| 236 | 'None = 0', |
| 237 | 'None += 0', |
| 238 | '__builtins__.None = 0', |
| 239 | 'def None(): pass', |
| 240 | 'class None: pass', |
| 241 | '(a, None) = 0, 0', |
| 242 | 'for None in range(10): pass', |
| 243 | 'def f(None): pass', |
Benjamin Peterson | 78565b2 | 2009-06-28 19:19:51 +0000 | [diff] [blame] | 244 | 'import None', |
| 245 | 'import x as None', |
| 246 | 'from x import None', |
| 247 | 'from x import y as None' |
Raymond Hettinger | 11a70c7 | 2004-07-17 21:46:25 +0000 | [diff] [blame] | 248 | ] |
| 249 | for stmt in stmts: |
| 250 | stmt += "\n" |
| 251 | self.assertRaises(SyntaxError, compile, stmt, 'tmp', 'single') |
| 252 | self.assertRaises(SyntaxError, compile, stmt, 'tmp', 'exec') |
Tim Peters | d507dab | 2001-08-30 20:51:59 +0000 | [diff] [blame] | 253 | |
Anthony Baxter | 1a4ddae | 2004-08-31 10:07:13 +0000 | [diff] [blame] | 254 | def test_import(self): |
| 255 | succeed = [ |
| 256 | 'import sys', |
| 257 | 'import os, sys', |
Thomas Wouters | 0e3f591 | 2006-08-11 14:57:12 +0000 | [diff] [blame] | 258 | 'import os as bar', |
| 259 | 'import os.path as bar', |
Anthony Baxter | 1a4ddae | 2004-08-31 10:07:13 +0000 | [diff] [blame] | 260 | 'from __future__ import nested_scopes, generators', |
| 261 | 'from __future__ import (nested_scopes,\ngenerators)', |
| 262 | 'from __future__ import (nested_scopes,\ngenerators,)', |
| 263 | 'from sys import stdin, stderr, stdout', |
| 264 | 'from sys import (stdin, stderr,\nstdout)', |
| 265 | 'from sys import (stdin, stderr,\nstdout,)', |
| 266 | 'from sys import (stdin\n, stderr, stdout)', |
| 267 | 'from sys import (stdin\n, stderr, stdout,)', |
| 268 | 'from sys import stdin as si, stdout as so, stderr as se', |
| 269 | 'from sys import (stdin as si, stdout as so, stderr as se)', |
| 270 | 'from sys import (stdin as si, stdout as so, stderr as se,)', |
| 271 | ] |
| 272 | fail = [ |
| 273 | 'import (os, sys)', |
| 274 | 'import (os), (sys)', |
| 275 | 'import ((os), (sys))', |
| 276 | 'import (sys', |
| 277 | 'import sys)', |
| 278 | 'import (os,)', |
Thomas Wouters | 0e3f591 | 2006-08-11 14:57:12 +0000 | [diff] [blame] | 279 | 'import os As bar', |
| 280 | 'import os.path a bar', |
| 281 | 'from sys import stdin As stdout', |
| 282 | 'from sys import stdin a stdout', |
Anthony Baxter | 1a4ddae | 2004-08-31 10:07:13 +0000 | [diff] [blame] | 283 | 'from (sys) import stdin', |
| 284 | 'from __future__ import (nested_scopes', |
| 285 | 'from __future__ import nested_scopes)', |
| 286 | 'from __future__ import nested_scopes,\ngenerators', |
| 287 | 'from sys import (stdin', |
| 288 | 'from sys import stdin)', |
| 289 | 'from sys import stdin, stdout,\nstderr', |
| 290 | 'from sys import stdin si', |
Serhiy Storchaka | 34fd4c2 | 2018-11-05 16:20:25 +0200 | [diff] [blame] | 291 | 'from sys import stdin,', |
Anthony Baxter | 1a4ddae | 2004-08-31 10:07:13 +0000 | [diff] [blame] | 292 | 'from sys import (*)', |
| 293 | 'from sys import (stdin,, stdout, stderr)', |
| 294 | 'from sys import (stdin, stdout),', |
| 295 | ] |
| 296 | for stmt in succeed: |
| 297 | compile(stmt, 'tmp', 'exec') |
| 298 | for stmt in fail: |
| 299 | self.assertRaises(SyntaxError, compile, stmt, 'tmp', 'exec') |
| 300 | |
Raymond Hettinger | 9047c8f | 2004-10-24 00:10:06 +0000 | [diff] [blame] | 301 | def test_for_distinct_code_objects(self): |
| 302 | # SF bug 1048870 |
| 303 | def f(): |
| 304 | f1 = lambda x=1: x |
| 305 | f2 = lambda x=2: x |
| 306 | return f1, f2 |
| 307 | f1, f2 = f() |
Neal Norwitz | 221085d | 2007-02-25 20:55:47 +0000 | [diff] [blame] | 308 | self.assertNotEqual(id(f1.__code__), id(f2.__code__)) |
Raymond Hettinger | 9047c8f | 2004-10-24 00:10:06 +0000 | [diff] [blame] | 309 | |
Benjamin Peterson | e6dd2cb | 2010-03-17 20:56:58 +0000 | [diff] [blame] | 310 | def test_lambda_doc(self): |
| 311 | l = lambda: "foo" |
| 312 | self.assertIsNone(l.__doc__) |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 313 | |
Serhiy Storchaka | 607cb9c | 2014-09-05 11:00:56 +0300 | [diff] [blame] | 314 | def test_encoding(self): |
| 315 | code = b'# -*- coding: badencoding -*-\npass\n' |
| 316 | self.assertRaises(SyntaxError, compile, code, 'tmp', 'exec') |
| 317 | code = '# -*- coding: badencoding -*-\n"\xc2\xa4"\n' |
| 318 | compile(code, 'tmp', 'exec') |
| 319 | self.assertEqual(eval(code), '\xc2\xa4') |
| 320 | code = '"\xc2\xa4"\n' |
| 321 | self.assertEqual(eval(code), '\xc2\xa4') |
| 322 | code = b'"\xc2\xa4"\n' |
| 323 | self.assertEqual(eval(code), '\xa4') |
| 324 | code = b'# -*- coding: latin1 -*-\n"\xc2\xa4"\n' |
| 325 | self.assertEqual(eval(code), '\xc2\xa4') |
| 326 | code = b'# -*- coding: utf-8 -*-\n"\xc2\xa4"\n' |
| 327 | self.assertEqual(eval(code), '\xa4') |
| 328 | code = b'# -*- coding: iso8859-15 -*-\n"\xc2\xa4"\n' |
| 329 | self.assertEqual(eval(code), '\xc2\u20ac') |
| 330 | code = '"""\\\n# -*- coding: iso8859-15 -*-\n\xc2\xa4"""\n' |
| 331 | self.assertEqual(eval(code), '# -*- coding: iso8859-15 -*-\n\xc2\xa4') |
| 332 | code = b'"""\\\n# -*- coding: iso8859-15 -*-\n\xc2\xa4"""\n' |
| 333 | self.assertEqual(eval(code), '# -*- coding: iso8859-15 -*-\n\xa4') |
Benjamin Peterson | 5d2ad25 | 2010-03-17 20:57:32 +0000 | [diff] [blame] | 334 | |
Nick Coghlan | eadee9a | 2006-03-13 12:31:58 +0000 | [diff] [blame] | 335 | def test_subscripts(self): |
| 336 | # SF bug 1448804 |
| 337 | # Class to make testing subscript results easy |
| 338 | class str_map(object): |
| 339 | def __init__(self): |
| 340 | self.data = {} |
| 341 | def __getitem__(self, key): |
| 342 | return self.data[str(key)] |
| 343 | def __setitem__(self, key, value): |
| 344 | self.data[str(key)] = value |
| 345 | def __delitem__(self, key): |
| 346 | del self.data[str(key)] |
| 347 | def __contains__(self, key): |
| 348 | return str(key) in self.data |
| 349 | d = str_map() |
| 350 | # Index |
| 351 | d[1] = 1 |
| 352 | self.assertEqual(d[1], 1) |
| 353 | d[1] += 1 |
| 354 | self.assertEqual(d[1], 2) |
| 355 | del d[1] |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 356 | self.assertNotIn(1, d) |
Nick Coghlan | eadee9a | 2006-03-13 12:31:58 +0000 | [diff] [blame] | 357 | # Tuple of indices |
| 358 | d[1, 1] = 1 |
| 359 | self.assertEqual(d[1, 1], 1) |
| 360 | d[1, 1] += 1 |
| 361 | self.assertEqual(d[1, 1], 2) |
| 362 | del d[1, 1] |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 363 | self.assertNotIn((1, 1), d) |
Nick Coghlan | eadee9a | 2006-03-13 12:31:58 +0000 | [diff] [blame] | 364 | # Simple slice |
| 365 | d[1:2] = 1 |
| 366 | self.assertEqual(d[1:2], 1) |
| 367 | d[1:2] += 1 |
| 368 | self.assertEqual(d[1:2], 2) |
| 369 | del d[1:2] |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 370 | self.assertNotIn(slice(1, 2), d) |
Nick Coghlan | eadee9a | 2006-03-13 12:31:58 +0000 | [diff] [blame] | 371 | # Tuple of simple slices |
| 372 | d[1:2, 1:2] = 1 |
| 373 | self.assertEqual(d[1:2, 1:2], 1) |
| 374 | d[1:2, 1:2] += 1 |
| 375 | self.assertEqual(d[1:2, 1:2], 2) |
| 376 | del d[1:2, 1:2] |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 377 | self.assertNotIn((slice(1, 2), slice(1, 2)), d) |
Nick Coghlan | eadee9a | 2006-03-13 12:31:58 +0000 | [diff] [blame] | 378 | # Extended slice |
| 379 | d[1:2:3] = 1 |
| 380 | self.assertEqual(d[1:2:3], 1) |
| 381 | d[1:2:3] += 1 |
| 382 | self.assertEqual(d[1:2:3], 2) |
| 383 | del d[1:2:3] |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 384 | self.assertNotIn(slice(1, 2, 3), d) |
Nick Coghlan | eadee9a | 2006-03-13 12:31:58 +0000 | [diff] [blame] | 385 | # Tuple of extended slices |
| 386 | d[1:2:3, 1:2:3] = 1 |
| 387 | self.assertEqual(d[1:2:3, 1:2:3], 1) |
| 388 | d[1:2:3, 1:2:3] += 1 |
| 389 | self.assertEqual(d[1:2:3, 1:2:3], 2) |
| 390 | del d[1:2:3, 1:2:3] |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 391 | self.assertNotIn((slice(1, 2, 3), slice(1, 2, 3)), d) |
Nick Coghlan | eadee9a | 2006-03-13 12:31:58 +0000 | [diff] [blame] | 392 | # Ellipsis |
| 393 | d[...] = 1 |
| 394 | self.assertEqual(d[...], 1) |
| 395 | d[...] += 1 |
| 396 | self.assertEqual(d[...], 2) |
| 397 | del d[...] |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 398 | self.assertNotIn(Ellipsis, d) |
Nick Coghlan | eadee9a | 2006-03-13 12:31:58 +0000 | [diff] [blame] | 399 | # Tuple of Ellipses |
| 400 | d[..., ...] = 1 |
| 401 | self.assertEqual(d[..., ...], 1) |
| 402 | d[..., ...] += 1 |
| 403 | self.assertEqual(d[..., ...], 2) |
| 404 | del d[..., ...] |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 405 | self.assertNotIn((Ellipsis, Ellipsis), d) |
Nick Coghlan | eadee9a | 2006-03-13 12:31:58 +0000 | [diff] [blame] | 406 | |
Guido van Rossum | 0240b92 | 2007-02-26 21:23:50 +0000 | [diff] [blame] | 407 | def test_annotation_limit(self): |
Serhiy Storchaka | 5bb8b91 | 2016-12-16 19:19:02 +0200 | [diff] [blame] | 408 | # more than 255 annotations, should compile ok |
Guido van Rossum | 1bc535d | 2007-05-15 18:46:22 +0000 | [diff] [blame] | 409 | s = "def f(%s): pass" |
Serhiy Storchaka | 5bb8b91 | 2016-12-16 19:19:02 +0200 | [diff] [blame] | 410 | s %= ', '.join('a%d:%d' % (i,i) for i in range(300)) |
Guido van Rossum | 0240b92 | 2007-02-26 21:23:50 +0000 | [diff] [blame] | 411 | compile(s, '?', 'exec') |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 412 | |
| 413 | def test_mangling(self): |
| 414 | class A: |
| 415 | def f(): |
| 416 | __mangled = 1 |
| 417 | __not_mangled__ = 2 |
| 418 | import __mangled_mod |
| 419 | import __package__.module |
| 420 | |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 421 | self.assertIn("_A__mangled", A.f.__code__.co_varnames) |
| 422 | self.assertIn("__not_mangled__", A.f.__code__.co_varnames) |
| 423 | self.assertIn("_A__mangled_mod", A.f.__code__.co_varnames) |
| 424 | self.assertIn("__package__", A.f.__code__.co_varnames) |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 425 | |
Martin v. Löwis | 618dc5e | 2008-03-30 20:03:44 +0000 | [diff] [blame] | 426 | def test_compile_ast(self): |
| 427 | fname = __file__ |
Brett Cannon | f299abd | 2015-04-13 14:21:02 -0400 | [diff] [blame] | 428 | if fname.lower().endswith('pyc'): |
Martin v. Löwis | 618dc5e | 2008-03-30 20:03:44 +0000 | [diff] [blame] | 429 | fname = fname[:-1] |
Inada Naoki | 35715d1 | 2021-04-04 09:01:23 +0900 | [diff] [blame] | 430 | with open(fname, encoding='utf-8') as f: |
Martin v. Löwis | 618dc5e | 2008-03-30 20:03:44 +0000 | [diff] [blame] | 431 | fcontents = f.read() |
| 432 | sample_code = [ |
| 433 | ['<assign>', 'x = 5'], |
| 434 | ['<ifblock>', """if True:\n pass\n"""], |
| 435 | ['<forblock>', """for n in [1, 2, 3]:\n print(n)\n"""], |
| 436 | ['<deffunc>', """def foo():\n pass\nfoo()\n"""], |
| 437 | [fname, fcontents], |
| 438 | ] |
| 439 | |
| 440 | for fname, code in sample_code: |
| 441 | co1 = compile(code, '%s1' % fname, 'exec') |
| 442 | ast = compile(code, '%s2' % fname, 'exec', _ast.PyCF_ONLY_AST) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 443 | self.assertTrue(type(ast) == _ast.Module) |
Martin v. Löwis | 618dc5e | 2008-03-30 20:03:44 +0000 | [diff] [blame] | 444 | co2 = compile(ast, '%s3' % fname, 'exec') |
| 445 | self.assertEqual(co1, co2) |
Neal Norwitz | db4115f | 2008-03-31 04:20:05 +0000 | [diff] [blame] | 446 | # the code object's filename comes from the second compilation step |
| 447 | self.assertEqual(co2.co_filename, '%s3' % fname) |
| 448 | |
| 449 | # raise exception when node type doesn't match with compile mode |
| 450 | co1 = compile('print(1)', '<string>', 'exec', _ast.PyCF_ONLY_AST) |
| 451 | self.assertRaises(TypeError, compile, co1, '<ast>', 'eval') |
| 452 | |
| 453 | # raise exception when node type is no start node |
| 454 | self.assertRaises(TypeError, compile, _ast.If(), '<ast>', 'exec') |
| 455 | |
| 456 | # raise exception when node has invalid children |
| 457 | ast = _ast.Module() |
| 458 | ast.body = [_ast.BoolOp()] |
| 459 | self.assertRaises(TypeError, compile, ast, '<ast>', 'exec') |
Martin v. Löwis | 618dc5e | 2008-03-30 20:03:44 +0000 | [diff] [blame] | 460 | |
Benjamin Peterson | ee85339 | 2015-05-28 14:30:26 -0500 | [diff] [blame] | 461 | def test_dict_evaluation_order(self): |
| 462 | i = 0 |
| 463 | |
| 464 | def f(): |
| 465 | nonlocal i |
| 466 | i += 1 |
| 467 | return i |
| 468 | |
| 469 | d = {f(): f(), f(): f()} |
| 470 | self.assertEqual(d, {1: 2, 3: 4}) |
| 471 | |
Serhiy Storchaka | 9305d83 | 2016-06-18 13:53:36 +0300 | [diff] [blame] | 472 | def test_compile_filename(self): |
Serhiy Storchaka | febc332 | 2016-08-06 23:29:29 +0300 | [diff] [blame] | 473 | for filename in 'file.py', b'file.py': |
Serhiy Storchaka | 9305d83 | 2016-06-18 13:53:36 +0300 | [diff] [blame] | 474 | code = compile('pass', filename, 'exec') |
| 475 | self.assertEqual(code.co_filename, 'file.py') |
Serhiy Storchaka | febc332 | 2016-08-06 23:29:29 +0300 | [diff] [blame] | 476 | for filename in bytearray(b'file.py'), memoryview(b'file.py'): |
| 477 | with self.assertWarns(DeprecationWarning): |
| 478 | code = compile('pass', filename, 'exec') |
| 479 | self.assertEqual(code.co_filename, 'file.py') |
Serhiy Storchaka | 9305d83 | 2016-06-18 13:53:36 +0300 | [diff] [blame] | 480 | self.assertRaises(TypeError, compile, 'pass', list(b'file.py'), 'exec') |
| 481 | |
Benjamin Peterson | 43b0686 | 2011-05-27 09:08:01 -0500 | [diff] [blame] | 482 | @support.cpython_only |
| 483 | def test_same_filename_used(self): |
| 484 | s = """def f(): pass\ndef g(): pass""" |
| 485 | c = compile(s, "myfile", "exec") |
| 486 | for obj in c.co_consts: |
| 487 | if isinstance(obj, types.CodeType): |
| 488 | self.assertIs(obj.co_filename, c.co_filename) |
| 489 | |
Meador Inge | fa21bf0 | 2012-01-19 01:08:41 -0600 | [diff] [blame] | 490 | def test_single_statement(self): |
| 491 | self.compile_single("1 + 2") |
| 492 | self.compile_single("\n1 + 2") |
| 493 | self.compile_single("1 + 2\n") |
| 494 | self.compile_single("1 + 2\n\n") |
| 495 | self.compile_single("1 + 2\t\t\n") |
| 496 | self.compile_single("1 + 2\t\t\n ") |
| 497 | self.compile_single("1 + 2 # one plus two") |
| 498 | self.compile_single("1; 2") |
| 499 | self.compile_single("import sys; sys") |
| 500 | self.compile_single("def f():\n pass") |
| 501 | self.compile_single("while False:\n pass") |
| 502 | self.compile_single("if x:\n f(x)") |
| 503 | self.compile_single("if x:\n f(x)\nelse:\n g(x)") |
| 504 | self.compile_single("class T:\n pass") |
| 505 | |
| 506 | def test_bad_single_statement(self): |
| 507 | self.assertInvalidSingle('1\n2') |
| 508 | self.assertInvalidSingle('def f(): pass') |
| 509 | self.assertInvalidSingle('a = 13\nb = 187') |
| 510 | self.assertInvalidSingle('del x\ndel y') |
| 511 | self.assertInvalidSingle('f()\ng()') |
Benjamin Peterson | cff9237 | 2012-01-19 17:46:13 -0500 | [diff] [blame] | 512 | self.assertInvalidSingle('f()\n# blah\nblah()') |
| 513 | self.assertInvalidSingle('f()\nxy # blah\nblah()') |
Benjamin Peterson | 77fc1f3 | 2012-01-20 11:01:06 -0500 | [diff] [blame] | 514 | self.assertInvalidSingle('x = 5 # comment\nx = 6\n') |
Martin v. Löwis | 618dc5e | 2008-03-30 20:03:44 +0000 | [diff] [blame] | 515 | |
Benjamin Peterson | d73aca7 | 2015-04-21 12:05:19 -0400 | [diff] [blame] | 516 | def test_particularly_evil_undecodable(self): |
| 517 | # Issue 24022 |
| 518 | src = b'0000\x00\n00000000000\n\x00\n\x9e\n' |
| 519 | with tempfile.TemporaryDirectory() as tmpd: |
| 520 | fn = os.path.join(tmpd, "bad.py") |
| 521 | with open(fn, "wb") as fp: |
| 522 | fp.write(src) |
| 523 | res = script_helper.run_python_until_end(fn)[0] |
| 524 | self.assertIn(b"Non-UTF-8", res.err) |
| 525 | |
Serhiy Storchaka | 0d44111 | 2015-11-14 15:10:35 +0200 | [diff] [blame] | 526 | def test_yet_more_evil_still_undecodable(self): |
| 527 | # Issue #25388 |
| 528 | src = b"#\x00\n#\xfd\n" |
| 529 | with tempfile.TemporaryDirectory() as tmpd: |
| 530 | fn = os.path.join(tmpd, "bad.py") |
| 531 | with open(fn, "wb") as fp: |
| 532 | fp.write(src) |
| 533 | res = script_helper.run_python_until_end(fn)[0] |
| 534 | self.assertIn(b"Non-UTF-8", res.err) |
| 535 | |
Nick Coghlan | aab9c2b | 2012-11-04 23:14:34 +1000 | [diff] [blame] | 536 | @support.cpython_only |
| 537 | def test_compiler_recursion_limit(self): |
| 538 | # Expected limit is sys.getrecursionlimit() * the scaling factor |
| 539 | # in symtable.c (currently 3) |
| 540 | # We expect to fail *at* that limit, because we use up some of |
| 541 | # the stack depth limit in the test suite code |
| 542 | # So we check the expected limit and 75% of that |
| 543 | # XXX (ncoghlan): duplicating the scaling factor here is a little |
| 544 | # ugly. Perhaps it should be exposed somewhere... |
| 545 | fail_depth = sys.getrecursionlimit() * 3 |
Serhiy Storchaka | face87c | 2021-04-25 13:38:00 +0300 | [diff] [blame^] | 546 | crash_depth = sys.getrecursionlimit() * 300 |
Nick Coghlan | aab9c2b | 2012-11-04 23:14:34 +1000 | [diff] [blame] | 547 | success_depth = int(fail_depth * 0.75) |
| 548 | |
Serhiy Storchaka | face87c | 2021-04-25 13:38:00 +0300 | [diff] [blame^] | 549 | def check_limit(prefix, repeated, mode="single"): |
Nick Coghlan | aab9c2b | 2012-11-04 23:14:34 +1000 | [diff] [blame] | 550 | expect_ok = prefix + repeated * success_depth |
Serhiy Storchaka | face87c | 2021-04-25 13:38:00 +0300 | [diff] [blame^] | 551 | compile(expect_ok, '<test>', mode) |
| 552 | for depth in (fail_depth, crash_depth): |
| 553 | broken = prefix + repeated * depth |
| 554 | details = "Compiling ({!r} + {!r} * {})".format( |
| 555 | prefix, repeated, depth) |
| 556 | with self.assertRaises(RecursionError, msg=details): |
| 557 | compile(broken, '<test>', mode) |
Nick Coghlan | aab9c2b | 2012-11-04 23:14:34 +1000 | [diff] [blame] | 558 | |
| 559 | check_limit("a", "()") |
| 560 | check_limit("a", ".b") |
| 561 | check_limit("a", "[0]") |
| 562 | check_limit("a", "*a") |
Serhiy Storchaka | face87c | 2021-04-25 13:38:00 +0300 | [diff] [blame^] | 563 | # XXX Crashes in the parser. |
| 564 | # check_limit("a", " if a else a") |
| 565 | # check_limit("if a: pass", "\nelif a: pass", mode="exec") |
Nick Coghlan | aab9c2b | 2012-11-04 23:14:34 +1000 | [diff] [blame] | 566 | |
Martin Panter | eeb896c | 2015-11-07 02:32:21 +0000 | [diff] [blame] | 567 | def test_null_terminated(self): |
| 568 | # The source code is null-terminated internally, but bytes-like |
| 569 | # objects are accepted, which could be not terminated. |
Martin Panter | d61d860 | 2015-11-08 11:09:13 +0000 | [diff] [blame] | 570 | with self.assertRaisesRegex(ValueError, "cannot contain null"): |
Martin Panter | eeb896c | 2015-11-07 02:32:21 +0000 | [diff] [blame] | 571 | compile("123\x00", "<dummy>", "eval") |
Martin Panter | d61d860 | 2015-11-08 11:09:13 +0000 | [diff] [blame] | 572 | with self.assertRaisesRegex(ValueError, "cannot contain null"): |
Martin Panter | eeb896c | 2015-11-07 02:32:21 +0000 | [diff] [blame] | 573 | compile(memoryview(b"123\x00"), "<dummy>", "eval") |
| 574 | code = compile(memoryview(b"123\x00")[1:-1], "<dummy>", "eval") |
| 575 | self.assertEqual(eval(code), 23) |
| 576 | code = compile(memoryview(b"1234")[1:-1], "<dummy>", "eval") |
| 577 | self.assertEqual(eval(code), 23) |
| 578 | code = compile(memoryview(b"$23$")[1:-1], "<dummy>", "eval") |
| 579 | self.assertEqual(eval(code), 23) |
| 580 | |
| 581 | # Also test when eval() and exec() do the compilation step |
| 582 | self.assertEqual(eval(memoryview(b"1234")[1:-1]), 23) |
| 583 | namespace = dict() |
| 584 | exec(memoryview(b"ax = 123")[1:-1], namespace) |
| 585 | self.assertEqual(namespace['x'], 12) |
| 586 | |
Victor Stinner | 3cdd5fb | 2016-01-22 12:33:12 +0100 | [diff] [blame] | 587 | def check_constant(self, func, expected): |
| 588 | for const in func.__code__.co_consts: |
| 589 | if repr(const) == repr(expected): |
| 590 | break |
| 591 | else: |
| 592 | self.fail("unable to find constant %r in %r" |
| 593 | % (expected, func.__code__.co_consts)) |
| 594 | |
| 595 | # Merging equal constants is not a strict requirement for the Python |
| 596 | # semantics, it's a more an implementation detail. |
| 597 | @support.cpython_only |
| 598 | def test_merge_constants(self): |
| 599 | # Issue #25843: compile() must merge constants which are equal |
| 600 | # and have the same type. |
| 601 | |
| 602 | def check_same_constant(const): |
| 603 | ns = {} |
| 604 | code = "f1, f2 = lambda: %r, lambda: %r" % (const, const) |
| 605 | exec(code, ns) |
| 606 | f1 = ns['f1'] |
| 607 | f2 = ns['f2'] |
| 608 | self.assertIs(f1.__code__, f2.__code__) |
| 609 | self.check_constant(f1, const) |
| 610 | self.assertEqual(repr(f1()), repr(const)) |
| 611 | |
| 612 | check_same_constant(None) |
| 613 | check_same_constant(0) |
| 614 | check_same_constant(0.0) |
| 615 | check_same_constant(b'abc') |
| 616 | check_same_constant('abc') |
| 617 | |
| 618 | # Note: "lambda: ..." emits "LOAD_CONST Ellipsis", |
| 619 | # whereas "lambda: Ellipsis" emits "LOAD_GLOBAL Ellipsis" |
| 620 | f1, f2 = lambda: ..., lambda: ... |
| 621 | self.assertIs(f1.__code__, f2.__code__) |
| 622 | self.check_constant(f1, Ellipsis) |
| 623 | self.assertEqual(repr(f1()), repr(Ellipsis)) |
| 624 | |
INADA Naoki | f7e4d36 | 2018-11-29 00:58:46 +0900 | [diff] [blame] | 625 | # Merge constants in tuple or frozenset |
| 626 | f1, f2 = lambda: "not a name", lambda: ("not a name",) |
| 627 | f3 = lambda x: x in {("not a name",)} |
| 628 | self.assertIs(f1.__code__.co_consts[1], |
| 629 | f2.__code__.co_consts[1][0]) |
| 630 | self.assertIs(next(iter(f3.__code__.co_consts[1])), |
| 631 | f2.__code__.co_consts[1]) |
| 632 | |
Victor Stinner | 3cdd5fb | 2016-01-22 12:33:12 +0100 | [diff] [blame] | 633 | # {0} is converted to a constant frozenset({0}) by the peephole |
| 634 | # optimizer |
| 635 | f1, f2 = lambda x: x in {0}, lambda x: x in {0} |
| 636 | self.assertIs(f1.__code__, f2.__code__) |
| 637 | self.check_constant(f1, frozenset({0})) |
| 638 | self.assertTrue(f1(0)) |
| 639 | |
Inada Naoki | bdb941b | 2021-02-10 09:20:42 +0900 | [diff] [blame] | 640 | # Merging equal co_linetable and co_code is not a strict requirement |
| 641 | # for the Python semantics, it's a more an implementation detail. |
| 642 | @support.cpython_only |
| 643 | def test_merge_code_attrs(self): |
| 644 | # See https://bugs.python.org/issue42217 |
| 645 | f1 = lambda x: x.y.z |
| 646 | f2 = lambda a: a.b.c |
| 647 | |
| 648 | self.assertIs(f1.__code__.co_linetable, f2.__code__.co_linetable) |
| 649 | self.assertIs(f1.__code__.co_code, f2.__code__.co_code) |
| 650 | |
Gregory P. Smith | 49fa4a9 | 2018-11-08 17:55:07 -0800 | [diff] [blame] | 651 | # This is a regression test for a CPython specific peephole optimizer |
| 652 | # implementation bug present in a few releases. It's assertion verifies |
| 653 | # that peephole optimization was actually done though that isn't an |
| 654 | # indication of the bugs presence or not (crashing is). |
| 655 | @support.cpython_only |
| 656 | def test_peephole_opt_unreachable_code_array_access_in_bounds(self): |
| 657 | """Regression test for issue35193 when run under clang msan.""" |
| 658 | def unused_code_at_end(): |
| 659 | return 3 |
| 660 | raise RuntimeError("unreachable") |
| 661 | # The above function definition will trigger the out of bounds |
| 662 | # bug in the peephole optimizer as it scans opcodes past the |
| 663 | # RETURN_VALUE opcode. This does not always crash an interpreter. |
| 664 | # When you build with the clang memory sanitizer it reliably aborts. |
| 665 | self.assertEqual( |
| 666 | 'RETURN_VALUE', |
| 667 | list(dis.get_instructions(unused_code_at_end))[-1].opname) |
| 668 | |
Victor Stinner | 3cdd5fb | 2016-01-22 12:33:12 +0100 | [diff] [blame] | 669 | def test_dont_merge_constants(self): |
| 670 | # Issue #25843: compile() must not merge constants which are equal |
| 671 | # but have a different type. |
| 672 | |
| 673 | def check_different_constants(const1, const2): |
| 674 | ns = {} |
| 675 | exec("f1, f2 = lambda: %r, lambda: %r" % (const1, const2), ns) |
| 676 | f1 = ns['f1'] |
| 677 | f2 = ns['f2'] |
| 678 | self.assertIsNot(f1.__code__, f2.__code__) |
Serhiy Storchaka | 713640c | 2017-01-24 20:49:26 +0200 | [diff] [blame] | 679 | self.assertNotEqual(f1.__code__, f2.__code__) |
Victor Stinner | 3cdd5fb | 2016-01-22 12:33:12 +0100 | [diff] [blame] | 680 | self.check_constant(f1, const1) |
| 681 | self.check_constant(f2, const2) |
| 682 | self.assertEqual(repr(f1()), repr(const1)) |
| 683 | self.assertEqual(repr(f2()), repr(const2)) |
| 684 | |
| 685 | check_different_constants(0, 0.0) |
| 686 | check_different_constants(+0.0, -0.0) |
| 687 | check_different_constants((0,), (0.0,)) |
Serhiy Storchaka | 713640c | 2017-01-24 20:49:26 +0200 | [diff] [blame] | 688 | check_different_constants('a', b'a') |
| 689 | check_different_constants(('a',), (b'a',)) |
Victor Stinner | 3cdd5fb | 2016-01-22 12:33:12 +0100 | [diff] [blame] | 690 | |
| 691 | # check_different_constants() cannot be used because repr(-0j) is |
| 692 | # '(-0-0j)', but when '(-0-0j)' is evaluated to 0j: we loose the sign. |
| 693 | f1, f2 = lambda: +0.0j, lambda: -0.0j |
| 694 | self.assertIsNot(f1.__code__, f2.__code__) |
| 695 | self.check_constant(f1, +0.0j) |
| 696 | self.check_constant(f2, -0.0j) |
| 697 | self.assertEqual(repr(f1()), repr(+0.0j)) |
| 698 | self.assertEqual(repr(f2()), repr(-0.0j)) |
| 699 | |
| 700 | # {0} is converted to a constant frozenset({0}) by the peephole |
| 701 | # optimizer |
| 702 | f1, f2 = lambda x: x in {0}, lambda x: x in {0.0} |
| 703 | self.assertIsNot(f1.__code__, f2.__code__) |
| 704 | self.check_constant(f1, frozenset({0})) |
| 705 | self.check_constant(f2, frozenset({0.0})) |
| 706 | self.assertTrue(f1(0)) |
| 707 | self.assertTrue(f2(0.0)) |
| 708 | |
Brett Cannon | a571120 | 2016-09-06 19:36:01 -0700 | [diff] [blame] | 709 | def test_path_like_objects(self): |
| 710 | # An implicit test for PyUnicode_FSDecoder(). |
Serhiy Storchaka | b21d155 | 2018-03-02 11:53:51 +0200 | [diff] [blame] | 711 | compile("42", FakePath("test_compile_pathlike"), "single") |
Brett Cannon | a571120 | 2016-09-06 19:36:01 -0700 | [diff] [blame] | 712 | |
Serhiy Storchaka | 782d6fe | 2018-01-11 20:20:13 +0200 | [diff] [blame] | 713 | def test_stack_overflow(self): |
| 714 | # bpo-31113: Stack overflow when compile a long sequence of |
| 715 | # complex statements. |
| 716 | compile("if a: b\n" * 200000, "<dummy>", "exec") |
| 717 | |
Pablo Galindo | 18c5f9d | 2019-07-15 10:15:01 +0100 | [diff] [blame] | 718 | # Multiple users rely on the fact that CPython does not generate |
| 719 | # bytecode for dead code blocks. See bpo-37500 for more context. |
| 720 | @support.cpython_only |
| 721 | def test_dead_blocks_do_not_generate_bytecode(self): |
| 722 | def unused_block_if(): |
| 723 | if 0: |
| 724 | return 42 |
| 725 | |
| 726 | def unused_block_while(): |
| 727 | while 0: |
| 728 | return 42 |
| 729 | |
| 730 | def unused_block_if_else(): |
| 731 | if 1: |
| 732 | return None |
| 733 | else: |
| 734 | return 42 |
| 735 | |
| 736 | def unused_block_while_else(): |
| 737 | while 1: |
| 738 | return None |
| 739 | else: |
| 740 | return 42 |
| 741 | |
| 742 | funcs = [unused_block_if, unused_block_while, |
| 743 | unused_block_if_else, unused_block_while_else] |
| 744 | |
| 745 | for func in funcs: |
| 746 | opcodes = list(dis.get_instructions(func)) |
Mark Shannon | 8473cf8 | 2020-12-15 11:07:50 +0000 | [diff] [blame] | 747 | self.assertLessEqual(len(opcodes), 3) |
| 748 | self.assertEqual('LOAD_CONST', opcodes[-2].opname) |
| 749 | self.assertEqual(None, opcodes[-2].argval) |
| 750 | self.assertEqual('RETURN_VALUE', opcodes[-1].opname) |
Pablo Galindo | 18c5f9d | 2019-07-15 10:15:01 +0100 | [diff] [blame] | 751 | |
Pablo Galindo | 6c3e66a | 2019-10-30 11:53:26 +0000 | [diff] [blame] | 752 | def test_false_while_loop(self): |
| 753 | def break_in_while(): |
| 754 | while False: |
| 755 | break |
| 756 | |
| 757 | def continue_in_while(): |
| 758 | while False: |
| 759 | continue |
| 760 | |
| 761 | funcs = [break_in_while, continue_in_while] |
| 762 | |
| 763 | # Check that we did not raise but we also don't generate bytecode |
| 764 | for func in funcs: |
| 765 | opcodes = list(dis.get_instructions(func)) |
| 766 | self.assertEqual(2, len(opcodes)) |
| 767 | self.assertEqual('LOAD_CONST', opcodes[0].opname) |
| 768 | self.assertEqual(None, opcodes[0].argval) |
| 769 | self.assertEqual('RETURN_VALUE', opcodes[1].opname) |
Nick Coghlan | aab9c2b | 2012-11-04 23:14:34 +1000 | [diff] [blame] | 770 | |
Mark Shannon | 266b462 | 2020-11-17 19:30:14 +0000 | [diff] [blame] | 771 | def test_consts_in_conditionals(self): |
| 772 | def and_true(x): |
| 773 | return True and x |
| 774 | |
| 775 | def and_false(x): |
| 776 | return False and x |
| 777 | |
| 778 | def or_true(x): |
| 779 | return True or x |
| 780 | |
| 781 | def or_false(x): |
| 782 | return False or x |
| 783 | |
| 784 | funcs = [and_true, and_false, or_true, or_false] |
| 785 | |
| 786 | # Check that condition is removed. |
| 787 | for func in funcs: |
| 788 | with self.subTest(func=func): |
| 789 | opcodes = list(dis.get_instructions(func)) |
| 790 | self.assertEqual(2, len(opcodes)) |
| 791 | self.assertIn('LOAD_', opcodes[0].opname) |
| 792 | self.assertEqual('RETURN_VALUE', opcodes[1].opname) |
| 793 | |
Mark Shannon | c544093 | 2021-03-15 14:24:25 +0000 | [diff] [blame] | 794 | def test_lineno_procedure_call(self): |
| 795 | def call(): |
| 796 | ( |
| 797 | print() |
| 798 | ) |
| 799 | line1 = call.__code__.co_firstlineno + 1 |
| 800 | assert line1 not in [line for (_, _, line) in call.__code__.co_lines()] |
| 801 | |
Mark Shannon | 5977a79 | 2020-12-02 13:31:40 +0000 | [diff] [blame] | 802 | def test_lineno_after_implicit_return(self): |
| 803 | TRUE = True |
| 804 | # Don't use constant True or False, as compiler will remove test |
| 805 | def if1(x): |
| 806 | x() |
| 807 | if TRUE: |
| 808 | pass |
| 809 | def if2(x): |
| 810 | x() |
| 811 | if TRUE: |
| 812 | pass |
| 813 | else: |
| 814 | pass |
| 815 | def if3(x): |
| 816 | x() |
| 817 | if TRUE: |
| 818 | pass |
| 819 | else: |
| 820 | return None |
| 821 | def if4(x): |
| 822 | x() |
| 823 | if not TRUE: |
| 824 | pass |
| 825 | funcs = [ if1, if2, if3, if4] |
| 826 | lastlines = [ 3, 3, 3, 2] |
| 827 | frame = None |
| 828 | def save_caller_frame(): |
| 829 | nonlocal frame |
| 830 | frame = sys._getframe(1) |
| 831 | for func, lastline in zip(funcs, lastlines, strict=True): |
| 832 | with self.subTest(func=func): |
| 833 | func(save_caller_frame) |
| 834 | self.assertEqual(frame.f_lineno-frame.f_code.co_firstlineno, lastline) |
Mark Shannon | 266b462 | 2020-11-17 19:30:14 +0000 | [diff] [blame] | 835 | |
Mark Shannon | eaccc12 | 2020-12-04 15:22:12 +0000 | [diff] [blame] | 836 | def test_lineno_after_no_code(self): |
| 837 | def no_code1(): |
| 838 | "doc string" |
| 839 | |
| 840 | def no_code2(): |
| 841 | a: int |
| 842 | |
| 843 | for func in (no_code1, no_code2): |
| 844 | with self.subTest(func=func): |
| 845 | code = func.__code__ |
| 846 | lines = list(code.co_lines()) |
| 847 | self.assertEqual(len(lines), 1) |
| 848 | start, end, line = lines[0] |
| 849 | self.assertEqual(start, 0) |
| 850 | self.assertEqual(end, len(code.co_code)) |
| 851 | self.assertEqual(line, code.co_firstlineno) |
| 852 | |
Mark Shannon | d48848c | 2021-03-14 18:01:30 +0000 | [diff] [blame] | 853 | def test_lineno_attribute(self): |
| 854 | def load_attr(): |
| 855 | return ( |
| 856 | o. |
| 857 | a |
| 858 | ) |
| 859 | load_attr_lines = [ 2, 3, 1 ] |
| 860 | |
| 861 | def load_method(): |
| 862 | return ( |
| 863 | o. |
| 864 | m( |
| 865 | 0 |
| 866 | ) |
| 867 | ) |
| 868 | load_method_lines = [ 2, 3, 4, 3, 1 ] |
| 869 | |
| 870 | def store_attr(): |
| 871 | ( |
| 872 | o. |
| 873 | a |
| 874 | ) = ( |
| 875 | v |
| 876 | ) |
| 877 | store_attr_lines = [ 5, 2, 3 ] |
| 878 | |
| 879 | def aug_store_attr(): |
| 880 | ( |
| 881 | o. |
| 882 | a |
| 883 | ) += ( |
| 884 | v |
| 885 | ) |
| 886 | aug_store_attr_lines = [ 2, 3, 5, 1, 3 ] |
| 887 | |
| 888 | funcs = [ load_attr, load_method, store_attr, aug_store_attr] |
| 889 | func_lines = [ load_attr_lines, load_method_lines, |
| 890 | store_attr_lines, aug_store_attr_lines] |
| 891 | |
| 892 | for func, lines in zip(funcs, func_lines, strict=True): |
| 893 | with self.subTest(func=func): |
| 894 | code_lines = [ line-func.__code__.co_firstlineno |
| 895 | for (_, _, line) in func.__code__.co_lines() ] |
| 896 | self.assertEqual(lines, code_lines) |
| 897 | |
Mark Shannon | eaccc12 | 2020-12-04 15:22:12 +0000 | [diff] [blame] | 898 | |
Pablo Galindo | c51db0e | 2020-08-13 09:48:41 +0100 | [diff] [blame] | 899 | def test_big_dict_literal(self): |
| 900 | # The compiler has a flushing point in "compiler_dict" that calls compiles |
| 901 | # a portion of the dictionary literal when the loop that iterates over the items |
| 902 | # reaches 0xFFFF elements but the code was not including the boundary element, |
| 903 | # dropping the key at position 0xFFFF. See bpo-41531 for more information |
| 904 | |
| 905 | dict_size = 0xFFFF + 1 |
| 906 | the_dict = "{" + ",".join(f"{x}:{x}" for x in range(dict_size)) + "}" |
| 907 | self.assertEqual(len(eval(the_dict)), dict_size) |
| 908 | |
Om G | c71581c | 2020-12-16 17:48:05 +0530 | [diff] [blame] | 909 | def test_redundant_jump_in_if_else_break(self): |
| 910 | # Check if bytecode containing jumps that simply point to the next line |
| 911 | # is generated around if-else-break style structures. See bpo-42615. |
| 912 | |
| 913 | def if_else_break(): |
| 914 | val = 1 |
| 915 | while True: |
| 916 | if val > 0: |
| 917 | val -= 1 |
| 918 | else: |
| 919 | break |
| 920 | val = -1 |
| 921 | |
| 922 | INSTR_SIZE = 2 |
| 923 | HANDLED_JUMPS = ( |
| 924 | 'POP_JUMP_IF_FALSE', |
| 925 | 'POP_JUMP_IF_TRUE', |
| 926 | 'JUMP_ABSOLUTE', |
| 927 | 'JUMP_FORWARD', |
| 928 | ) |
| 929 | |
| 930 | for line, instr in enumerate(dis.Bytecode(if_else_break)): |
| 931 | if instr.opname == 'JUMP_FORWARD': |
| 932 | self.assertNotEqual(instr.arg, 0) |
| 933 | elif instr.opname in HANDLED_JUMPS: |
| 934 | self.assertNotEqual(instr.arg, (line + 1)*INSTR_SIZE) |
| 935 | |
| 936 | |
Serhiy Storchaka | d4864c6 | 2018-01-09 21:54:52 +0200 | [diff] [blame] | 937 | class TestExpressionStackSize(unittest.TestCase): |
Antoine Pitrou | 9961405 | 2014-05-23 11:46:03 +0200 | [diff] [blame] | 938 | # These tests check that the computed stack size for a code object |
| 939 | # stays within reasonable bounds (see issue #21523 for an example |
| 940 | # dysfunction). |
| 941 | N = 100 |
| 942 | |
| 943 | def check_stack_size(self, code): |
| 944 | # To assert that the alleged stack size is not O(N), we |
| 945 | # check that it is smaller than log(N). |
| 946 | if isinstance(code, str): |
| 947 | code = compile(code, "<foo>", "single") |
| 948 | max_size = math.ceil(math.log(len(code.co_code))) |
| 949 | self.assertLessEqual(code.co_stacksize, max_size) |
| 950 | |
| 951 | def test_and(self): |
| 952 | self.check_stack_size("x and " * self.N + "x") |
| 953 | |
| 954 | def test_or(self): |
| 955 | self.check_stack_size("x or " * self.N + "x") |
| 956 | |
| 957 | def test_and_or(self): |
| 958 | self.check_stack_size("x and x or " * self.N + "x") |
| 959 | |
| 960 | def test_chained_comparison(self): |
| 961 | self.check_stack_size("x < " * self.N + "x") |
| 962 | |
| 963 | def test_if_else(self): |
| 964 | self.check_stack_size("x if x else " * self.N + "x") |
| 965 | |
| 966 | def test_binop(self): |
| 967 | self.check_stack_size("x + " * self.N + "x") |
| 968 | |
Mark Shannon | 11e0b29 | 2021-04-15 14:28:56 +0100 | [diff] [blame] | 969 | def test_list(self): |
| 970 | self.check_stack_size("[" + "x, " * self.N + "x]") |
| 971 | |
| 972 | def test_tuple(self): |
| 973 | self.check_stack_size("(" + "x, " * self.N + "x)") |
| 974 | |
| 975 | def test_set(self): |
| 976 | self.check_stack_size("{" + "x, " * self.N + "x}") |
| 977 | |
| 978 | def test_dict(self): |
| 979 | self.check_stack_size("{" + "x:x, " * self.N + "x:x}") |
| 980 | |
| 981 | def test_func_args(self): |
| 982 | self.check_stack_size("f(" + "x, " * self.N + ")") |
| 983 | |
| 984 | def test_func_kwargs(self): |
| 985 | kwargs = (f'a{i}=x' for i in range(self.N)) |
| 986 | self.check_stack_size("f(" + ", ".join(kwargs) + ")") |
| 987 | |
| 988 | def test_func_args(self): |
| 989 | self.check_stack_size("o.m(" + "x, " * self.N + ")") |
| 990 | |
| 991 | def test_meth_kwargs(self): |
| 992 | kwargs = (f'a{i}=x' for i in range(self.N)) |
| 993 | self.check_stack_size("o.m(" + ", ".join(kwargs) + ")") |
| 994 | |
Antoine Pitrou | 9961405 | 2014-05-23 11:46:03 +0200 | [diff] [blame] | 995 | def test_func_and(self): |
| 996 | code = "def f(x):\n" |
| 997 | code += " x and x\n" * self.N |
| 998 | self.check_stack_size(code) |
| 999 | |
Tim Peters | d507dab | 2001-08-30 20:51:59 +0000 | [diff] [blame] | 1000 | |
Serhiy Storchaka | d4864c6 | 2018-01-09 21:54:52 +0200 | [diff] [blame] | 1001 | class TestStackSizeStability(unittest.TestCase): |
| 1002 | # Check that repeating certain snippets doesn't increase the stack size |
| 1003 | # beyond what a single snippet requires. |
| 1004 | |
| 1005 | def check_stack_size(self, snippet, async_=False): |
| 1006 | def compile_snippet(i): |
| 1007 | ns = {} |
| 1008 | script = """def func():\n""" + i * snippet |
| 1009 | if async_: |
| 1010 | script = "async " + script |
| 1011 | code = compile(script, "<script>", "exec") |
| 1012 | exec(code, ns, ns) |
| 1013 | return ns['func'].__code__ |
| 1014 | |
| 1015 | sizes = [compile_snippet(i).co_stacksize for i in range(2, 5)] |
| 1016 | if len(set(sizes)) != 1: |
| 1017 | import dis, io |
| 1018 | out = io.StringIO() |
| 1019 | dis.dis(compile_snippet(1), file=out) |
| 1020 | self.fail("stack sizes diverge with # of consecutive snippets: " |
| 1021 | "%s\n%s\n%s" % (sizes, snippet, out.getvalue())) |
| 1022 | |
| 1023 | def test_if(self): |
| 1024 | snippet = """ |
| 1025 | if x: |
| 1026 | a |
| 1027 | """ |
| 1028 | self.check_stack_size(snippet) |
| 1029 | |
| 1030 | def test_if_else(self): |
| 1031 | snippet = """ |
| 1032 | if x: |
| 1033 | a |
| 1034 | elif y: |
| 1035 | b |
| 1036 | else: |
| 1037 | c |
| 1038 | """ |
| 1039 | self.check_stack_size(snippet) |
| 1040 | |
| 1041 | def test_try_except_bare(self): |
| 1042 | snippet = """ |
| 1043 | try: |
| 1044 | a |
| 1045 | except: |
| 1046 | b |
| 1047 | """ |
| 1048 | self.check_stack_size(snippet) |
| 1049 | |
| 1050 | def test_try_except_qualified(self): |
| 1051 | snippet = """ |
| 1052 | try: |
| 1053 | a |
| 1054 | except ImportError: |
| 1055 | b |
| 1056 | except: |
| 1057 | c |
| 1058 | else: |
| 1059 | d |
| 1060 | """ |
| 1061 | self.check_stack_size(snippet) |
| 1062 | |
| 1063 | def test_try_except_as(self): |
| 1064 | snippet = """ |
| 1065 | try: |
| 1066 | a |
| 1067 | except ImportError as e: |
| 1068 | b |
| 1069 | except: |
| 1070 | c |
| 1071 | else: |
| 1072 | d |
| 1073 | """ |
| 1074 | self.check_stack_size(snippet) |
| 1075 | |
| 1076 | def test_try_finally(self): |
| 1077 | snippet = """ |
| 1078 | try: |
| 1079 | a |
| 1080 | finally: |
| 1081 | b |
| 1082 | """ |
| 1083 | self.check_stack_size(snippet) |
| 1084 | |
| 1085 | def test_with(self): |
| 1086 | snippet = """ |
| 1087 | with x as y: |
| 1088 | a |
| 1089 | """ |
| 1090 | self.check_stack_size(snippet) |
| 1091 | |
| 1092 | def test_while_else(self): |
| 1093 | snippet = """ |
| 1094 | while x: |
| 1095 | a |
| 1096 | else: |
| 1097 | b |
| 1098 | """ |
| 1099 | self.check_stack_size(snippet) |
| 1100 | |
| 1101 | def test_for(self): |
| 1102 | snippet = """ |
| 1103 | for x in y: |
| 1104 | a |
| 1105 | """ |
| 1106 | self.check_stack_size(snippet) |
| 1107 | |
| 1108 | def test_for_else(self): |
| 1109 | snippet = """ |
| 1110 | for x in y: |
| 1111 | a |
| 1112 | else: |
| 1113 | b |
| 1114 | """ |
| 1115 | self.check_stack_size(snippet) |
| 1116 | |
| 1117 | def test_for_break_continue(self): |
| 1118 | snippet = """ |
| 1119 | for x in y: |
| 1120 | if z: |
| 1121 | break |
| 1122 | elif u: |
| 1123 | continue |
| 1124 | else: |
| 1125 | a |
| 1126 | else: |
| 1127 | b |
| 1128 | """ |
| 1129 | self.check_stack_size(snippet) |
| 1130 | |
| 1131 | def test_for_break_continue_inside_try_finally_block(self): |
| 1132 | snippet = """ |
| 1133 | for x in y: |
| 1134 | try: |
| 1135 | if z: |
| 1136 | break |
| 1137 | elif u: |
| 1138 | continue |
| 1139 | else: |
| 1140 | a |
| 1141 | finally: |
| 1142 | f |
| 1143 | else: |
| 1144 | b |
| 1145 | """ |
| 1146 | self.check_stack_size(snippet) |
| 1147 | |
Serhiy Storchaka | fe2bbb1 | 2018-03-18 09:56:52 +0200 | [diff] [blame] | 1148 | def test_for_break_continue_inside_finally_block(self): |
Serhiy Storchaka | d4864c6 | 2018-01-09 21:54:52 +0200 | [diff] [blame] | 1149 | snippet = """ |
| 1150 | for x in y: |
| 1151 | try: |
| 1152 | t |
| 1153 | finally: |
| 1154 | if z: |
| 1155 | break |
Serhiy Storchaka | fe2bbb1 | 2018-03-18 09:56:52 +0200 | [diff] [blame] | 1156 | elif u: |
| 1157 | continue |
Serhiy Storchaka | d4864c6 | 2018-01-09 21:54:52 +0200 | [diff] [blame] | 1158 | else: |
| 1159 | a |
| 1160 | else: |
| 1161 | b |
| 1162 | """ |
| 1163 | self.check_stack_size(snippet) |
| 1164 | |
| 1165 | def test_for_break_continue_inside_except_block(self): |
| 1166 | snippet = """ |
| 1167 | for x in y: |
| 1168 | try: |
| 1169 | t |
| 1170 | except: |
| 1171 | if z: |
| 1172 | break |
| 1173 | elif u: |
| 1174 | continue |
| 1175 | else: |
| 1176 | a |
| 1177 | else: |
| 1178 | b |
| 1179 | """ |
| 1180 | self.check_stack_size(snippet) |
| 1181 | |
| 1182 | def test_for_break_continue_inside_with_block(self): |
| 1183 | snippet = """ |
| 1184 | for x in y: |
| 1185 | with c: |
| 1186 | if z: |
| 1187 | break |
| 1188 | elif u: |
| 1189 | continue |
| 1190 | else: |
| 1191 | a |
| 1192 | else: |
| 1193 | b |
| 1194 | """ |
| 1195 | self.check_stack_size(snippet) |
| 1196 | |
| 1197 | def test_return_inside_try_finally_block(self): |
| 1198 | snippet = """ |
| 1199 | try: |
| 1200 | if z: |
| 1201 | return |
| 1202 | else: |
| 1203 | a |
| 1204 | finally: |
| 1205 | f |
| 1206 | """ |
| 1207 | self.check_stack_size(snippet) |
| 1208 | |
| 1209 | def test_return_inside_finally_block(self): |
| 1210 | snippet = """ |
| 1211 | try: |
| 1212 | t |
| 1213 | finally: |
| 1214 | if z: |
| 1215 | return |
| 1216 | else: |
| 1217 | a |
| 1218 | """ |
| 1219 | self.check_stack_size(snippet) |
| 1220 | |
| 1221 | def test_return_inside_except_block(self): |
| 1222 | snippet = """ |
| 1223 | try: |
| 1224 | t |
| 1225 | except: |
| 1226 | if z: |
| 1227 | return |
| 1228 | else: |
| 1229 | a |
| 1230 | """ |
| 1231 | self.check_stack_size(snippet) |
| 1232 | |
| 1233 | def test_return_inside_with_block(self): |
| 1234 | snippet = """ |
| 1235 | with c: |
| 1236 | if z: |
| 1237 | return |
| 1238 | else: |
| 1239 | a |
| 1240 | """ |
| 1241 | self.check_stack_size(snippet) |
| 1242 | |
| 1243 | def test_async_with(self): |
| 1244 | snippet = """ |
| 1245 | async with x as y: |
| 1246 | a |
| 1247 | """ |
| 1248 | self.check_stack_size(snippet, async_=True) |
| 1249 | |
| 1250 | def test_async_for(self): |
| 1251 | snippet = """ |
| 1252 | async for x in y: |
| 1253 | a |
| 1254 | """ |
| 1255 | self.check_stack_size(snippet, async_=True) |
| 1256 | |
| 1257 | def test_async_for_else(self): |
| 1258 | snippet = """ |
| 1259 | async for x in y: |
| 1260 | a |
| 1261 | else: |
| 1262 | b |
| 1263 | """ |
| 1264 | self.check_stack_size(snippet, async_=True) |
| 1265 | |
| 1266 | def test_for_break_continue_inside_async_with_block(self): |
| 1267 | snippet = """ |
| 1268 | for x in y: |
| 1269 | async with c: |
| 1270 | if z: |
| 1271 | break |
| 1272 | elif u: |
| 1273 | continue |
| 1274 | else: |
| 1275 | a |
| 1276 | else: |
| 1277 | b |
| 1278 | """ |
| 1279 | self.check_stack_size(snippet, async_=True) |
| 1280 | |
| 1281 | def test_return_inside_async_with_block(self): |
| 1282 | snippet = """ |
| 1283 | async with c: |
| 1284 | if z: |
| 1285 | return |
| 1286 | else: |
| 1287 | a |
| 1288 | """ |
| 1289 | self.check_stack_size(snippet, async_=True) |
| 1290 | |
| 1291 | |
Raymond Hettinger | 8a99b50 | 2003-06-23 13:36:57 +0000 | [diff] [blame] | 1292 | if __name__ == "__main__": |
Antoine Pitrou | 9961405 | 2014-05-23 11:46:03 +0200 | [diff] [blame] | 1293 | unittest.main() |