mirror of
https://github.com/python/cpython.git
synced 2025-07-25 20:24:11 +00:00

which unfortunately means the errors from the bytes type change somewhat: bytes([300]) still raises a ValueError, but bytes([10**100]) now raises a TypeError (either that, or bytes(1.0) also raises a ValueError -- PyNumber_AsSsize_t() can only raise one type of exception.) Merged revisions 51188-51433 via svnmerge from svn+ssh://pythondev@svn.python.org/python/trunk ........ r51189 | kurt.kaiser | 2006-08-10 19:11:09 +0200 (Thu, 10 Aug 2006) | 4 lines Retrieval of previous shell command was not always preserving indentation since 1.2a1) Patch 1528468 Tal Einat. ........ r51190 | guido.van.rossum | 2006-08-10 19:41:07 +0200 (Thu, 10 Aug 2006) | 3 lines Chris McDonough's patch to defend against certain DoS attacks on FieldStorage. SF bug #1112549. ........ r51191 | guido.van.rossum | 2006-08-10 19:42:50 +0200 (Thu, 10 Aug 2006) | 2 lines News item for SF bug 1112549. ........ r51192 | guido.van.rossum | 2006-08-10 20:09:25 +0200 (Thu, 10 Aug 2006) | 2 lines Fix title -- it's rc1, not beta3. ........ r51194 | martin.v.loewis | 2006-08-10 21:04:00 +0200 (Thu, 10 Aug 2006) | 3 lines Update dangling references to the 3.2 database to mention that this is UCD 4.1 now. ........ r51195 | tim.peters | 2006-08-11 00:45:34 +0200 (Fri, 11 Aug 2006) | 6 lines Followup to bug #1069160. PyThreadState_SetAsyncExc(): internal correctness changes wrt refcount safety and deadlock avoidance. Also added a basic test case (relying on ctypes) and repaired the docs. ........ r51196 | tim.peters | 2006-08-11 00:48:45 +0200 (Fri, 11 Aug 2006) | 2 lines Whitespace normalization. ........ r51197 | tim.peters | 2006-08-11 01:22:13 +0200 (Fri, 11 Aug 2006) | 5 lines Whitespace normalization broke test_cgi, because a line of quoted test data relied on preserving a single trailing blank. Changed the string from raw to regular, and forced in the trailing blank via an explicit \x20 escape. ........ r51198 | tim.peters | 2006-08-11 02:49:01 +0200 (Fri, 11 Aug 2006) | 10 lines test_PyThreadState_SetAsyncExc(): This is failing on some 64-bit boxes. I have no idea what the ctypes docs mean by "integers", and blind-guessing here that it intended to mean the signed C "int" type, in which case perhaps I can repair this by feeding the thread id argument to type ctypes.c_long(). Also made the worker thread daemonic, so it doesn't hang Python shutdown if the test continues to fail. ........ r51199 | tim.peters | 2006-08-11 05:49:10 +0200 (Fri, 11 Aug 2006) | 6 lines force_test_exit(): This has been completely ineffective at stopping test_signal from hanging forever on the Tru64 buildbot. That could be because there's no such thing as signal.SIGALARM. Changed to the idiotic (but standard) signal.SIGALRM instead, and added some more debug output. ........ r51202 | neal.norwitz | 2006-08-11 08:09:41 +0200 (Fri, 11 Aug 2006) | 6 lines Fix the failures on cygwin (2006-08-10 fixed the actual locking issue). The first hunk changes the colon to an ! like other Windows variants. We need to always wait on the child so the lock gets released and no other tests fail. This is the try/finally in the second hunk. ........ r51205 | georg.brandl | 2006-08-11 09:15:38 +0200 (Fri, 11 Aug 2006) | 3 lines Add Chris McDonough (latest cgi.py patch) ........ r51206 | georg.brandl | 2006-08-11 09:26:10 +0200 (Fri, 11 Aug 2006) | 3 lines logging's atexit hook now runs even if the rest of the module has already been cleaned up. ........ r51212 | thomas.wouters | 2006-08-11 17:02:39 +0200 (Fri, 11 Aug 2006) | 4 lines Add ignore of *.pyc and *.pyo to Lib/xml/etree/. ........ r51215 | thomas.heller | 2006-08-11 21:55:35 +0200 (Fri, 11 Aug 2006) | 7 lines When a ctypes C callback function is called, zero out the result storage before converting the result to C data. See the comment in the code for details. Provide a better context for errors when the conversion of a callback function's result cannot be converted. ........ r51218 | neal.norwitz | 2006-08-12 03:43:40 +0200 (Sat, 12 Aug 2006) | 6 lines Klocwork made another run and found a bunch more problems. This is the first batch of fixes that should be easy to verify based on context. This fixes problem numbers: 220 (ast), 323-324 (symtable), 321-322 (structseq), 215 (array), 210 (hotshot), 182 (codecs), 209 (etree). ........ r51219 | neal.norwitz | 2006-08-12 03:45:47 +0200 (Sat, 12 Aug 2006) | 9 lines Even though _Py_Mangle() isn't truly public anyone can call it and there was no verification that privateobj was a PyString. If it wasn't a string, this could have allowed a NULL pointer to creep in below and crash. I wonder if this should be PyString_CheckExact? Must identifiers be strings or can they be subclasses? Klocwork #275 ........ r51220 | neal.norwitz | 2006-08-12 03:46:42 +0200 (Sat, 12 Aug 2006) | 5 lines It's highly unlikely, though possible for PyEval_Get*() to return NULLs. So be safe and do an XINCREF. Klocwork # 221-222. ........ r51221 | neal.norwitz | 2006-08-12 03:47:59 +0200 (Sat, 12 Aug 2006) | 7 lines This code is actually not used unless WITHOUT_COMPLEX is defined. However, there was no error checking that PyFloat_FromDouble returned a valid pointer. I believe this change is correct as it seemed to follow other code in the area. Klocwork # 292. ........ r51222 | neal.norwitz | 2006-08-12 03:49:12 +0200 (Sat, 12 Aug 2006) | 5 lines Handle NULL nodes while parsing. I'm not entirely sure this is correct. There might be something else that needs to be done to setup the error. Klocwork #295. ........ r51223 | neal.norwitz | 2006-08-12 03:50:38 +0200 (Sat, 12 Aug 2006) | 6 lines If _stat_float_times is false, we will try to INCREF ival which could be NULL. Return early in that case. The caller checks for PyErr_Occurred so this should be ok. Klocwork #297 ........ r51224 | neal.norwitz | 2006-08-12 03:51:12 +0200 (Sat, 12 Aug 2006) | 3 lines Move the assert which checks for a NULL pointer first. Klocwork #274. ........ r51225 | neal.norwitz | 2006-08-12 03:53:28 +0200 (Sat, 12 Aug 2006) | 5 lines Try to handle a malloc failure. I'm not entirely sure this is correct. There might be something else we need to do to handle the exception. Klocwork # 212-213 ........ r51226 | neal.norwitz | 2006-08-12 03:57:47 +0200 (Sat, 12 Aug 2006) | 6 lines I'm not sure why this code allocates this string for the error message. I think it would be better to always use snprintf and have the format limit the size of the name appropriately (like %.200s). Klocwork #340 ........ r51227 | neal.norwitz | 2006-08-12 04:06:34 +0200 (Sat, 12 Aug 2006) | 3 lines Check returned pointer is valid. Klocwork #233 ........ r51228 | neal.norwitz | 2006-08-12 04:12:30 +0200 (Sat, 12 Aug 2006) | 1 line Whoops, how did that get in there. :-) Revert all the parts of 51227 that were not supposed to go it. Only Modules/_ctypes/cfields.c was supposed to be changed ........ r51229 | neal.norwitz | 2006-08-12 04:33:36 +0200 (Sat, 12 Aug 2006) | 4 lines Don't deref v if it's NULL. Klocwork #214 ........ r51230 | neal.norwitz | 2006-08-12 05:16:54 +0200 (Sat, 12 Aug 2006) | 5 lines Check return of PyMem_MALLOC (garbage) is non-NULL. Check seq in both portions of if/else. Klocwork #289-290. ........ r51231 | neal.norwitz | 2006-08-12 05:17:41 +0200 (Sat, 12 Aug 2006) | 4 lines PyModule_GetDict() can fail, produce fatal errors if this happens on startup. Klocwork #298-299. ........ r51232 | neal.norwitz | 2006-08-12 05:18:50 +0200 (Sat, 12 Aug 2006) | 5 lines Verify verdat which is returned from malloc is not NULL. Ensure we don't pass NULL to free. Klocwork #306 (at least the first part, checking malloc) ........ r51233 | tim.peters | 2006-08-12 06:42:47 +0200 (Sat, 12 Aug 2006) | 35 lines test_signal: Signal handling on the Tru64 buildbot appears to be utterly insane. Plug some theoretical insecurities in the test script: - Verify that the SIGALRM handler was actually installed. - Don't call alarm() before the handler is installed. - Move everything that can fail inside the try/finally, so the test cleans up after itself more often. - Try sending all the expected signals in force_test_exit(), not just SIGALRM. Since that was fixed to actually send SIGALRM (instead of invisibly dying with an AttributeError), we've seen that sending SIGALRM alone does not stop this from hanging. - Move the "kill the child" business into the finally clause, so the child doesn't survive test failure to send SIGALRM to other tests later (there are also baffling SIGALRM-related failures in test_socket). - Cancel the alarm in the finally clause -- if the test dies early, we again don't want SIGALRM showing up to confuse a later test. Alas, this still relies on timing luck wrt the spawned script that sends the test signals, but it's hard to see how waiting for seconds can so often be so unlucky. test_threadedsignals: curiously, this test never fails on Tru64, but doesn't normally signal SIGALRM. Anyway, fixed an obvious (but probably inconsequential) logic error. ........ r51234 | tim.peters | 2006-08-12 07:17:41 +0200 (Sat, 12 Aug 2006) | 8 lines Ah, fudge. One of the prints here actually "shouldn't be" protected by "if verbose:", which caused the test to fail on all non-Windows boxes. Note that I deliberately didn't convert this to unittest yet, because I expect it would be even harder to debug this on Tru64 after conversion. ........ r51235 | georg.brandl | 2006-08-12 10:32:02 +0200 (Sat, 12 Aug 2006) | 3 lines Repair logging test spew caused by rev. 51206. ........ r51236 | neal.norwitz | 2006-08-12 19:03:09 +0200 (Sat, 12 Aug 2006) | 8 lines Patch #1538606, Patch to fix __index__() clipping. I modified this patch some by fixing style, some error checking, and adding XXX comments. This patch requires review and some changes are to be expected. I'm checking in now to get the greatest possible review and establish a baseline for moving forward. I don't want this to hold up release if possible. ........ r51238 | neal.norwitz | 2006-08-12 20:44:06 +0200 (Sat, 12 Aug 2006) | 10 lines Fix a couple of bugs exposed by the new __index__ code. The 64-bit buildbots were failing due to inappropriate clipping of numbers larger than 2**31 with new-style classes. (typeobject.c) In reviewing the code for classic classes, there were 2 problems. Any negative value return could be returned. Always return -1 if there was an error. Also make the checks similar with the new-style classes. I believe this is correct for 32 and 64 bit boxes, including Windows64. Add a test of classic classes too. ........ r51240 | neal.norwitz | 2006-08-13 02:20:49 +0200 (Sun, 13 Aug 2006) | 1 line SF bug #1539336, distutils example code missing ........ r51245 | neal.norwitz | 2006-08-13 20:10:10 +0200 (Sun, 13 Aug 2006) | 6 lines Move/copy assert for tstate != NULL before first use. Verify that PyEval_Get{Globals,Locals} returned valid pointers. Klocwork 231-232 ........ r51246 | neal.norwitz | 2006-08-13 20:10:28 +0200 (Sun, 13 Aug 2006) | 5 lines Handle a whole lot of failures from PyString_FromInternedString(). Should fix most of Klocwork 234-272. ........ r51247 | neal.norwitz | 2006-08-13 20:10:47 +0200 (Sun, 13 Aug 2006) | 8 lines cpathname could be NULL if it was longer than MAXPATHLEN. Don't try to write the .pyc to NULL. Check results of PyList_GetItem() and PyModule_GetDict() are not NULL. Klocwork 282, 283, 285 ........ r51248 | neal.norwitz | 2006-08-13 20:11:08 +0200 (Sun, 13 Aug 2006) | 6 lines Fix segfault when doing string formatting on subclasses of long if __oct__, __hex__ don't return a string. Klocwork 308 ........ r51250 | neal.norwitz | 2006-08-13 20:11:27 +0200 (Sun, 13 Aug 2006) | 5 lines Check return result of PyModule_GetDict(). Fix a bunch of refleaks in the init of the module. This would only be found when running python -v. ........ r51251 | neal.norwitz | 2006-08-13 20:11:43 +0200 (Sun, 13 Aug 2006) | 5 lines Handle malloc and fopen failures more gracefully. Klocwork 180-181 ........ r51252 | neal.norwitz | 2006-08-13 20:12:03 +0200 (Sun, 13 Aug 2006) | 7 lines It's very unlikely, though possible that source is not a string. Verify that PyString_AsString() returns a valid pointer. (The problem can arise when zlib.decompress doesn't return a string.) Klocwork 346 ........ r51253 | neal.norwitz | 2006-08-13 20:12:26 +0200 (Sun, 13 Aug 2006) | 5 lines Handle failures from lookup. Klocwork 341-342 ........ r51254 | neal.norwitz | 2006-08-13 20:12:45 +0200 (Sun, 13 Aug 2006) | 6 lines Handle failure from PyModule_GetDict() (Klocwork 208). Fix a bunch of refleaks in the init of the module. This would only be found when running python -v. ........ r51255 | neal.norwitz | 2006-08-13 20:13:02 +0200 (Sun, 13 Aug 2006) | 4 lines Really address the issue of where to place the assert for leftblock. (Followup of Klocwork 274) ........ r51256 | neal.norwitz | 2006-08-13 20:13:36 +0200 (Sun, 13 Aug 2006) | 4 lines Handle malloc failure. Klocwork 281 ........ r51258 | neal.norwitz | 2006-08-13 20:40:39 +0200 (Sun, 13 Aug 2006) | 4 lines Handle alloca failures. Klocwork 225-228 ........ r51259 | neal.norwitz | 2006-08-13 20:41:15 +0200 (Sun, 13 Aug 2006) | 1 line Get rid of compiler warning ........ r51261 | neal.norwitz | 2006-08-14 02:51:15 +0200 (Mon, 14 Aug 2006) | 1 line Ignore pgen.exe and kill_python.exe for cygwin ........ r51262 | neal.norwitz | 2006-08-14 02:59:03 +0200 (Mon, 14 Aug 2006) | 4 lines Can't return NULL from a void function. If there is a memory error, about the best we can do is call PyErr_WriteUnraisable and go on. We won't be able to do the call below either, so verify delstr is valid. ........ r51263 | neal.norwitz | 2006-08-14 03:49:54 +0200 (Mon, 14 Aug 2006) | 1 line Update purify doc some. ........ r51264 | thomas.heller | 2006-08-14 09:13:05 +0200 (Mon, 14 Aug 2006) | 2 lines Remove unused, buggy test function. Fixes klockwork issue #207. ........ r51265 | thomas.heller | 2006-08-14 09:14:09 +0200 (Mon, 14 Aug 2006) | 2 lines Check for NULL return value from new_CArgObject(). Fixes klockwork issues #183, #184, #185. ........ r51266 | thomas.heller | 2006-08-14 09:50:14 +0200 (Mon, 14 Aug 2006) | 2 lines Check for NULL return value of GenericCData_new(). Fixes klockwork issues #188, #189. ........ r51274 | thomas.heller | 2006-08-14 12:02:24 +0200 (Mon, 14 Aug 2006) | 2 lines Revert the change that tries to zero out a closure's result storage area because the size if unknown in source/callproc.c. ........ r51276 | marc-andre.lemburg | 2006-08-14 12:55:19 +0200 (Mon, 14 Aug 2006) | 11 lines Slightly revised version of patch #1538956: Replace UnicodeDecodeErrors raised during == and != compares of Unicode and other objects with a new UnicodeWarning. All other comparisons continue to raise exceptions. Exceptions other than UnicodeDecodeErrors are also left untouched. ........ r51277 | thomas.heller | 2006-08-14 13:17:48 +0200 (Mon, 14 Aug 2006) | 13 lines Apply the patch #1532975 plus ideas from the patch #1533481. ctypes instances no longer have the internal and undocumented '_as_parameter_' attribute which was used to adapt them to foreign function calls; this mechanism is replaced by a function pointer in the type's stgdict. In the 'from_param' class methods, try the _as_parameter_ attribute if other conversions are not possible. This makes the documented _as_parameter_ mechanism work as intended. Change the ctypes version number to 1.0.1. ........ r51278 | marc-andre.lemburg | 2006-08-14 13:44:34 +0200 (Mon, 14 Aug 2006) | 3 lines Readd NEWS items that were accidentally removed by r51276. ........ r51279 | georg.brandl | 2006-08-14 14:36:06 +0200 (Mon, 14 Aug 2006) | 3 lines Improve markup in PyUnicode_RichCompare. ........ r51280 | marc-andre.lemburg | 2006-08-14 14:57:27 +0200 (Mon, 14 Aug 2006) | 3 lines Correct an accidentally removed previous patch. ........ r51281 | thomas.heller | 2006-08-14 18:17:41 +0200 (Mon, 14 Aug 2006) | 3 lines Patch #1536908: Add support for AMD64 / OpenBSD. Remove the -no-stack-protector compiler flag for OpenBSD as it has been reported to be unneeded. ........ r51282 | thomas.heller | 2006-08-14 18:20:04 +0200 (Mon, 14 Aug 2006) | 1 line News item for rev 51281. ........ r51283 | georg.brandl | 2006-08-14 22:25:39 +0200 (Mon, 14 Aug 2006) | 3 lines Fix refleak introduced in rev. 51248. ........ r51284 | georg.brandl | 2006-08-14 23:34:08 +0200 (Mon, 14 Aug 2006) | 5 lines Make tabnanny recognize IndentationErrors raised by tokenize. Add a test to test_inspect to make sure indented source is recognized correctly. (fixes #1224621) ........ r51285 | georg.brandl | 2006-08-14 23:42:55 +0200 (Mon, 14 Aug 2006) | 3 lines Patch #1535500: fix segfault in BZ2File.writelines and make sure it raises the correct exceptions. ........ r51287 | georg.brandl | 2006-08-14 23:45:32 +0200 (Mon, 14 Aug 2006) | 3 lines Add an additional test: BZ2File write methods should raise IOError when file is read-only. ........ r51289 | georg.brandl | 2006-08-14 23:55:28 +0200 (Mon, 14 Aug 2006) | 3 lines Patch #1536071: trace.py should now find the full module name of a file correctly even on Windows. ........ r51290 | georg.brandl | 2006-08-15 00:01:24 +0200 (Tue, 15 Aug 2006) | 3 lines Cookie.py shouldn't "bogusly" use string._idmap. ........ r51291 | georg.brandl | 2006-08-15 00:10:24 +0200 (Tue, 15 Aug 2006) | 3 lines Patch #1511317: don't crash on invalid hostname info ........ r51292 | tim.peters | 2006-08-15 02:25:04 +0200 (Tue, 15 Aug 2006) | 2 lines Whitespace normalization. ........ r51293 | neal.norwitz | 2006-08-15 06:14:57 +0200 (Tue, 15 Aug 2006) | 3 lines Georg fixed one of my bugs, so I'll repay him with 2 NEWS entries. Now we're even. :-) ........ r51295 | neal.norwitz | 2006-08-15 06:58:28 +0200 (Tue, 15 Aug 2006) | 8 lines Fix the test for SocketServer so it should pass on cygwin and not fail sporadically on other platforms. This is really a band-aid that doesn't fix the underlying issue in SocketServer. It's not clear if it's worth it to fix SocketServer, however, I opened a bug to track it: http://python.org/sf/1540386 ........ r51296 | neal.norwitz | 2006-08-15 06:59:30 +0200 (Tue, 15 Aug 2006) | 3 lines Update the docstring to use a version a little newer than 1999. This was taken from a Debian patch. Should we update the version for each release? ........ r51298 | neal.norwitz | 2006-08-15 08:29:03 +0200 (Tue, 15 Aug 2006) | 2 lines Subclasses of int/long are allowed to define an __index__. ........ r51300 | thomas.heller | 2006-08-15 15:07:21 +0200 (Tue, 15 Aug 2006) | 1 line Check for NULL return value from new_CArgObject calls. ........ r51303 | kurt.kaiser | 2006-08-16 05:15:26 +0200 (Wed, 16 Aug 2006) | 2 lines The 'with' statement is now a Code Context block opener ........ r51304 | anthony.baxter | 2006-08-16 05:42:26 +0200 (Wed, 16 Aug 2006) | 1 line preparing for 2.5c1 ........ r51305 | anthony.baxter | 2006-08-16 05:58:37 +0200 (Wed, 16 Aug 2006) | 1 line preparing for 2.5c1 - no, really this time ........ r51306 | kurt.kaiser | 2006-08-16 07:01:42 +0200 (Wed, 16 Aug 2006) | 9 lines Patch #1540892: site.py Quitter() class attempts to close sys.stdin before raising SystemExit, allowing IDLE to honor quit() and exit(). M Lib/site.py M Lib/idlelib/PyShell.py M Lib/idlelib/CREDITS.txt M Lib/idlelib/NEWS.txt M Misc/NEWS ........ r51307 | ka-ping.yee | 2006-08-16 09:02:50 +0200 (Wed, 16 Aug 2006) | 6 lines Update code and tests to support the 'bytes_le' attribute (for little-endian byte order on Windows), and to work around clocks with low resolution yielding duplicate UUIDs. Anthony Baxter has approved this change. ........ r51308 | kurt.kaiser | 2006-08-16 09:04:17 +0200 (Wed, 16 Aug 2006) | 2 lines Get quit() and exit() to work cleanly when not using subprocess. ........ r51309 | marc-andre.lemburg | 2006-08-16 10:13:26 +0200 (Wed, 16 Aug 2006) | 2 lines Revert to having static version numbers again. ........ r51310 | martin.v.loewis | 2006-08-16 14:55:10 +0200 (Wed, 16 Aug 2006) | 2 lines Build _hashlib on Windows. Build OpenSSL with masm assembler code. Fixes #1535502. ........ r51311 | thomas.heller | 2006-08-16 15:03:11 +0200 (Wed, 16 Aug 2006) | 6 lines Add commented assert statements to check that the result of PyObject_stgdict() and PyType_stgdict() calls are non-NULL before dereferencing the result. Hopefully this fixes what klocwork is complaining about. Fix a few other nits as well. ........ r51312 | anthony.baxter | 2006-08-16 15:08:25 +0200 (Wed, 16 Aug 2006) | 1 line news entry for 51307 ........ r51313 | andrew.kuchling | 2006-08-16 15:22:20 +0200 (Wed, 16 Aug 2006) | 1 line Add UnicodeWarning ........ r51314 | andrew.kuchling | 2006-08-16 15:41:52 +0200 (Wed, 16 Aug 2006) | 1 line Bump document version to 1.0; remove pystone paragraph ........ r51315 | andrew.kuchling | 2006-08-16 15:51:32 +0200 (Wed, 16 Aug 2006) | 1 line Link to docs; remove an XXX comment ........ r51316 | martin.v.loewis | 2006-08-16 15:58:51 +0200 (Wed, 16 Aug 2006) | 1 line Make cl build step compile-only (/c). Remove libs from source list. ........ r51317 | thomas.heller | 2006-08-16 16:07:44 +0200 (Wed, 16 Aug 2006) | 5 lines The __repr__ method of a NULL py_object does no longer raise an exception. Remove a stray '?' character from the exception text when the value is retrieved of such an object. Includes tests. ........ r51318 | andrew.kuchling | 2006-08-16 16:18:23 +0200 (Wed, 16 Aug 2006) | 1 line Update bug/patch counts ........ r51319 | andrew.kuchling | 2006-08-16 16:21:14 +0200 (Wed, 16 Aug 2006) | 1 line Wording/typo fixes ........ r51320 | thomas.heller | 2006-08-16 17:10:12 +0200 (Wed, 16 Aug 2006) | 9 lines Remove the special casing of Py_None when converting the return value of the Python part of a callback function to C. If it cannot be converted, call PyErr_WriteUnraisable with the exception we got. Before, arbitrary data has been passed to the calling C code in this case. (I'm not really sure the NEWS entry is understandable, but I cannot find better words) ........ r51321 | marc-andre.lemburg | 2006-08-16 18:11:01 +0200 (Wed, 16 Aug 2006) | 2 lines Add NEWS item mentioning the reverted distutils version number patch. ........ r51322 | fredrik.lundh | 2006-08-16 18:47:07 +0200 (Wed, 16 Aug 2006) | 5 lines SF#1534630 ignore data that arrives before the opening start tag ........ r51324 | andrew.kuchling | 2006-08-16 19:11:18 +0200 (Wed, 16 Aug 2006) | 1 line Grammar fix ........ r51328 | thomas.heller | 2006-08-16 20:02:11 +0200 (Wed, 16 Aug 2006) | 12 lines Tutorial: Clarify somewhat how parameters are passed to functions (especially explain what integer means). Correct the table - Python integers and longs can both be used. Further clarification to the table comparing ctypes types, Python types, and C types. Reference: Replace integer by C ``int`` where it makes sense. ........ r51329 | kurt.kaiser | 2006-08-16 23:45:59 +0200 (Wed, 16 Aug 2006) | 8 lines File menu hotkeys: there were three 'p' assignments. Reassign the 'Save Copy As' and 'Print' hotkeys to 'y' and 't'. Change the Shell menu hotkey from 's' to 'l'. M Bindings.py M PyShell.py M NEWS.txt ........ r51330 | neil.schemenauer | 2006-08-17 01:38:05 +0200 (Thu, 17 Aug 2006) | 3 lines Fix a bug in the ``compiler`` package that caused invalid code to be generated for generator expressions. ........ r51342 | martin.v.loewis | 2006-08-17 21:19:32 +0200 (Thu, 17 Aug 2006) | 3 lines Merge 51340 and 51341 from 2.5 branch: Leave tk build directory to restore original path. Invoke debug mk1mf.pl after running Configure. ........ r51354 | martin.v.loewis | 2006-08-18 05:47:18 +0200 (Fri, 18 Aug 2006) | 3 lines Bug #1541863: uuid.uuid1 failed to generate unique identifiers on systems with low clock resolution. ........ r51355 | neal.norwitz | 2006-08-18 05:57:54 +0200 (Fri, 18 Aug 2006) | 1 line Add template for 2.6 on HEAD ........ r51356 | neal.norwitz | 2006-08-18 06:01:38 +0200 (Fri, 18 Aug 2006) | 1 line More post-release wibble ........ r51357 | neal.norwitz | 2006-08-18 06:58:33 +0200 (Fri, 18 Aug 2006) | 1 line Try to get Windows bots working again ........ r51358 | neal.norwitz | 2006-08-18 07:10:00 +0200 (Fri, 18 Aug 2006) | 1 line Try to get Windows bots working again. Take 2 ........ r51359 | neal.norwitz | 2006-08-18 07:39:20 +0200 (Fri, 18 Aug 2006) | 1 line Try to get Unix bots install working again. ........ r51360 | neal.norwitz | 2006-08-18 07:41:46 +0200 (Fri, 18 Aug 2006) | 1 line Set version to 2.6a0, seems more consistent. ........ r51362 | neal.norwitz | 2006-08-18 08:14:52 +0200 (Fri, 18 Aug 2006) | 1 line More version wibble ........ r51364 | georg.brandl | 2006-08-18 09:27:59 +0200 (Fri, 18 Aug 2006) | 4 lines Bug #1541682: Fix example in the "Refcount details" API docs. Additionally, remove a faulty example showing PySequence_SetItem applied to a newly created list object and add notes that this isn't a good idea. ........ r51366 | anthony.baxter | 2006-08-18 09:29:02 +0200 (Fri, 18 Aug 2006) | 3 lines Updating IDLE's version number to match Python's (as per python-dev discussion). ........ r51367 | anthony.baxter | 2006-08-18 09:30:07 +0200 (Fri, 18 Aug 2006) | 1 line RPM specfile updates ........ r51368 | georg.brandl | 2006-08-18 09:35:47 +0200 (Fri, 18 Aug 2006) | 2 lines Typo in tp_clear docs. ........ r51378 | andrew.kuchling | 2006-08-18 15:57:13 +0200 (Fri, 18 Aug 2006) | 1 line Minor edits ........ r51379 | thomas.heller | 2006-08-18 16:38:46 +0200 (Fri, 18 Aug 2006) | 6 lines Add asserts to check for 'impossible' NULL values, with comments. In one place where I'n not 1000% sure about the non-NULL, raise a RuntimeError for safety. This should fix the klocwork issues that Neal sent me. If so, it should be applied to the release25-maint branch also. ........ r51400 | neal.norwitz | 2006-08-19 06:22:33 +0200 (Sat, 19 Aug 2006) | 5 lines Move initialization of interned strings to before allocating the object so we don't leak op. (Fixes an earlier patch to this code) Klockwork #350 ........ r51401 | neal.norwitz | 2006-08-19 06:23:04 +0200 (Sat, 19 Aug 2006) | 4 lines Move assert to after NULL check, otherwise we deref NULL in the assert. Klocwork #307 ........ r51402 | neal.norwitz | 2006-08-19 06:25:29 +0200 (Sat, 19 Aug 2006) | 2 lines SF #1542693: Remove semi-colon at end of PyImport_ImportModuleEx macro ........ r51403 | neal.norwitz | 2006-08-19 06:28:55 +0200 (Sat, 19 Aug 2006) | 6 lines Move initialization to after the asserts for non-NULL values. Klocwork 286-287. (I'm not backporting this, but if someone wants to, feel free.) ........ r51404 | neal.norwitz | 2006-08-19 06:52:03 +0200 (Sat, 19 Aug 2006) | 6 lines Handle PyString_FromInternedString() failing (unlikely, but possible). Klocwork #325 (I'm not backporting this, but if someone wants to, feel free.) ........ r51416 | georg.brandl | 2006-08-20 15:15:39 +0200 (Sun, 20 Aug 2006) | 2 lines Patch #1542948: fix urllib2 header casing issue. With new test. ........ r51428 | jeremy.hylton | 2006-08-21 18:19:37 +0200 (Mon, 21 Aug 2006) | 3 lines Move peephole optimizer to separate file. ........ r51429 | jeremy.hylton | 2006-08-21 18:20:29 +0200 (Mon, 21 Aug 2006) | 2 lines Move peephole optimizer to separate file. (Forgot .h in previous checkin.) ........ r51432 | neal.norwitz | 2006-08-21 19:59:46 +0200 (Mon, 21 Aug 2006) | 5 lines Fix bug #1543303, tarfile adds padding that breaks gunzip. Patch # 1543897. Will backport to 2.5 ........ r51433 | neal.norwitz | 2006-08-21 20:01:30 +0200 (Mon, 21 Aug 2006) | 2 lines Add assert to make Klocwork happy (#276) ........
2428 lines
57 KiB
C
2428 lines
57 KiB
C
/* Built-in functions */
|
|
|
|
#include "Python.h"
|
|
|
|
#include "node.h"
|
|
#include "code.h"
|
|
#include "eval.h"
|
|
|
|
#include <ctype.h>
|
|
|
|
#ifdef RISCOS
|
|
#include "unixstuff.h"
|
|
#endif
|
|
|
|
/* The default encoding used by the platform file system APIs
|
|
Can remain NULL for all platforms that don't have such a concept
|
|
*/
|
|
#if defined(MS_WINDOWS) && defined(HAVE_USABLE_WCHAR_T)
|
|
const char *Py_FileSystemDefaultEncoding = "mbcs";
|
|
#elif defined(__APPLE__)
|
|
const char *Py_FileSystemDefaultEncoding = "utf-8";
|
|
#else
|
|
const char *Py_FileSystemDefaultEncoding = NULL; /* use default */
|
|
#endif
|
|
|
|
/* Forward */
|
|
static PyObject *filterstring(PyObject *, PyObject *);
|
|
#ifdef Py_USING_UNICODE
|
|
static PyObject *filterunicode(PyObject *, PyObject *);
|
|
#endif
|
|
static PyObject *filtertuple (PyObject *, PyObject *);
|
|
|
|
static PyObject *
|
|
builtin___import__(PyObject *self, PyObject *args, PyObject *kwds)
|
|
{
|
|
static char *kwlist[] = {"name", "globals", "locals", "fromlist",
|
|
"level", 0};
|
|
char *name;
|
|
PyObject *globals = NULL;
|
|
PyObject *locals = NULL;
|
|
PyObject *fromlist = NULL;
|
|
int level = -1;
|
|
|
|
if (!PyArg_ParseTupleAndKeywords(args, kwds, "s|OOOi:__import__",
|
|
kwlist, &name, &globals, &locals, &fromlist, &level))
|
|
return NULL;
|
|
return PyImport_ImportModuleLevel(name, globals, locals,
|
|
fromlist, level);
|
|
}
|
|
|
|
PyDoc_STRVAR(import_doc,
|
|
"__import__(name, globals={}, locals={}, fromlist=[], level=-1) -> module\n\
|
|
\n\
|
|
Import a module. The globals are only used to determine the context;\n\
|
|
they are not modified. The locals are currently unused. The fromlist\n\
|
|
should be a list of names to emulate ``from name import ...'', or an\n\
|
|
empty list to emulate ``import name''.\n\
|
|
When importing a module from a package, note that __import__('A.B', ...)\n\
|
|
returns package A when fromlist is empty, but its submodule B when\n\
|
|
fromlist is not empty. Level is used to determine whether to perform \n\
|
|
absolute or relative imports. -1 is the original strategy of attempting\n\
|
|
both absolute and relative imports, 0 is absolute, a positive number\n\
|
|
is the number of parent directories to search relative to the current module.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_abs(PyObject *self, PyObject *v)
|
|
{
|
|
return PyNumber_Absolute(v);
|
|
}
|
|
|
|
PyDoc_STRVAR(abs_doc,
|
|
"abs(number) -> number\n\
|
|
\n\
|
|
Return the absolute value of the argument.");
|
|
|
|
static PyObject *
|
|
builtin_all(PyObject *self, PyObject *v)
|
|
{
|
|
PyObject *it, *item;
|
|
|
|
it = PyObject_GetIter(v);
|
|
if (it == NULL)
|
|
return NULL;
|
|
|
|
while ((item = PyIter_Next(it)) != NULL) {
|
|
int cmp = PyObject_IsTrue(item);
|
|
Py_DECREF(item);
|
|
if (cmp < 0) {
|
|
Py_DECREF(it);
|
|
return NULL;
|
|
}
|
|
if (cmp == 0) {
|
|
Py_DECREF(it);
|
|
Py_RETURN_FALSE;
|
|
}
|
|
}
|
|
Py_DECREF(it);
|
|
if (PyErr_Occurred())
|
|
return NULL;
|
|
Py_RETURN_TRUE;
|
|
}
|
|
|
|
PyDoc_STRVAR(all_doc,
|
|
"all(iterable) -> bool\n\
|
|
\n\
|
|
Return True if bool(x) is True for all values x in the iterable.");
|
|
|
|
static PyObject *
|
|
builtin_any(PyObject *self, PyObject *v)
|
|
{
|
|
PyObject *it, *item;
|
|
|
|
it = PyObject_GetIter(v);
|
|
if (it == NULL)
|
|
return NULL;
|
|
|
|
while ((item = PyIter_Next(it)) != NULL) {
|
|
int cmp = PyObject_IsTrue(item);
|
|
Py_DECREF(item);
|
|
if (cmp < 0) {
|
|
Py_DECREF(it);
|
|
return NULL;
|
|
}
|
|
if (cmp == 1) {
|
|
Py_DECREF(it);
|
|
Py_RETURN_TRUE;
|
|
}
|
|
}
|
|
Py_DECREF(it);
|
|
if (PyErr_Occurred())
|
|
return NULL;
|
|
Py_RETURN_FALSE;
|
|
}
|
|
|
|
PyDoc_STRVAR(any_doc,
|
|
"any(iterable) -> bool\n\
|
|
\n\
|
|
Return True if bool(x) is True for any x in the iterable.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_callable(PyObject *self, PyObject *v)
|
|
{
|
|
return PyBool_FromLong((long)PyCallable_Check(v));
|
|
}
|
|
|
|
PyDoc_STRVAR(callable_doc,
|
|
"callable(object) -> bool\n\
|
|
\n\
|
|
Return whether the object is callable (i.e., some kind of function).\n\
|
|
Note that classes are callable, as are instances with a __call__() method.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_filter(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *func, *seq, *result, *it, *arg;
|
|
Py_ssize_t len; /* guess for result list size */
|
|
register Py_ssize_t j;
|
|
|
|
if (!PyArg_UnpackTuple(args, "filter", 2, 2, &func, &seq))
|
|
return NULL;
|
|
|
|
/* Strings and tuples return a result of the same type. */
|
|
if (PyString_Check(seq))
|
|
return filterstring(func, seq);
|
|
#ifdef Py_USING_UNICODE
|
|
if (PyUnicode_Check(seq))
|
|
return filterunicode(func, seq);
|
|
#endif
|
|
if (PyTuple_Check(seq))
|
|
return filtertuple(func, seq);
|
|
|
|
/* Pre-allocate argument list tuple. */
|
|
arg = PyTuple_New(1);
|
|
if (arg == NULL)
|
|
return NULL;
|
|
|
|
/* Get iterator. */
|
|
it = PyObject_GetIter(seq);
|
|
if (it == NULL)
|
|
goto Fail_arg;
|
|
|
|
/* Guess a result list size. */
|
|
len = _PyObject_LengthHint(seq);
|
|
if (len < 0) {
|
|
if (!PyErr_ExceptionMatches(PyExc_TypeError) &&
|
|
!PyErr_ExceptionMatches(PyExc_AttributeError)) {
|
|
goto Fail_it;
|
|
}
|
|
PyErr_Clear();
|
|
len = 8; /* arbitrary */
|
|
}
|
|
|
|
/* Get a result list. */
|
|
if (PyList_Check(seq) && seq->ob_refcnt == 1) {
|
|
/* Eww - can modify the list in-place. */
|
|
Py_INCREF(seq);
|
|
result = seq;
|
|
}
|
|
else {
|
|
result = PyList_New(len);
|
|
if (result == NULL)
|
|
goto Fail_it;
|
|
}
|
|
|
|
/* Build the result list. */
|
|
j = 0;
|
|
for (;;) {
|
|
PyObject *item;
|
|
int ok;
|
|
|
|
item = PyIter_Next(it);
|
|
if (item == NULL) {
|
|
if (PyErr_Occurred())
|
|
goto Fail_result_it;
|
|
break;
|
|
}
|
|
|
|
if (func == (PyObject *)&PyBool_Type || func == Py_None) {
|
|
ok = PyObject_IsTrue(item);
|
|
}
|
|
else {
|
|
PyObject *good;
|
|
PyTuple_SET_ITEM(arg, 0, item);
|
|
good = PyObject_Call(func, arg, NULL);
|
|
PyTuple_SET_ITEM(arg, 0, NULL);
|
|
if (good == NULL) {
|
|
Py_DECREF(item);
|
|
goto Fail_result_it;
|
|
}
|
|
ok = PyObject_IsTrue(good);
|
|
Py_DECREF(good);
|
|
}
|
|
if (ok) {
|
|
if (j < len)
|
|
PyList_SET_ITEM(result, j, item);
|
|
else {
|
|
int status = PyList_Append(result, item);
|
|
Py_DECREF(item);
|
|
if (status < 0)
|
|
goto Fail_result_it;
|
|
}
|
|
++j;
|
|
}
|
|
else
|
|
Py_DECREF(item);
|
|
}
|
|
|
|
|
|
/* Cut back result list if len is too big. */
|
|
if (j < len && PyList_SetSlice(result, j, len, NULL) < 0)
|
|
goto Fail_result_it;
|
|
|
|
Py_DECREF(it);
|
|
Py_DECREF(arg);
|
|
return result;
|
|
|
|
Fail_result_it:
|
|
Py_DECREF(result);
|
|
Fail_it:
|
|
Py_DECREF(it);
|
|
Fail_arg:
|
|
Py_DECREF(arg);
|
|
return NULL;
|
|
}
|
|
|
|
PyDoc_STRVAR(filter_doc,
|
|
"filter(function or None, sequence) -> list, tuple, or string\n"
|
|
"\n"
|
|
"Return those items of sequence for which function(item) is true. If\n"
|
|
"function is None, return the items that are true. If sequence is a tuple\n"
|
|
"or string, return the same type, else return a list.");
|
|
|
|
static PyObject *
|
|
builtin_chr(PyObject *self, PyObject *args)
|
|
{
|
|
long x;
|
|
char s[1];
|
|
|
|
if (!PyArg_ParseTuple(args, "l:chr", &x))
|
|
return NULL;
|
|
if (x < 0 || x >= 256) {
|
|
PyErr_SetString(PyExc_ValueError,
|
|
"chr() arg not in range(256)");
|
|
return NULL;
|
|
}
|
|
s[0] = (char)x;
|
|
return PyString_FromStringAndSize(s, 1);
|
|
}
|
|
|
|
PyDoc_STRVAR(chr_doc,
|
|
"chr(i) -> character\n\
|
|
\n\
|
|
Return a string of one character with ordinal i; 0 <= i < 256.");
|
|
|
|
|
|
#ifdef Py_USING_UNICODE
|
|
static PyObject *
|
|
builtin_unichr(PyObject *self, PyObject *args)
|
|
{
|
|
long x;
|
|
|
|
if (!PyArg_ParseTuple(args, "l:unichr", &x))
|
|
return NULL;
|
|
|
|
return PyUnicode_FromOrdinal(x);
|
|
}
|
|
|
|
PyDoc_STRVAR(unichr_doc,
|
|
"unichr(i) -> Unicode character\n\
|
|
\n\
|
|
Return a Unicode string of one character with ordinal i; 0 <= i <= 0x10ffff.");
|
|
#endif
|
|
|
|
|
|
static PyObject *
|
|
builtin_cmp(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *a, *b;
|
|
int c;
|
|
|
|
if (!PyArg_UnpackTuple(args, "cmp", 2, 2, &a, &b))
|
|
return NULL;
|
|
if (PyObject_Cmp(a, b, &c) < 0)
|
|
return NULL;
|
|
return PyInt_FromLong((long)c);
|
|
}
|
|
|
|
PyDoc_STRVAR(cmp_doc,
|
|
"cmp(x, y) -> integer\n\
|
|
\n\
|
|
Return negative if x<y, zero if x==y, positive if x>y.");
|
|
|
|
static PyObject *
|
|
builtin_compile(PyObject *self, PyObject *args)
|
|
{
|
|
char *str;
|
|
char *filename;
|
|
char *startstr;
|
|
int start;
|
|
int dont_inherit = 0;
|
|
int supplied_flags = 0;
|
|
PyCompilerFlags cf;
|
|
PyObject *result = NULL, *cmd, *tmp = NULL;
|
|
Py_ssize_t length;
|
|
|
|
if (!PyArg_ParseTuple(args, "Oss|ii:compile", &cmd, &filename,
|
|
&startstr, &supplied_flags, &dont_inherit))
|
|
return NULL;
|
|
|
|
cf.cf_flags = supplied_flags;
|
|
|
|
#ifdef Py_USING_UNICODE
|
|
if (PyUnicode_Check(cmd)) {
|
|
tmp = PyUnicode_AsUTF8String(cmd);
|
|
if (tmp == NULL)
|
|
return NULL;
|
|
cmd = tmp;
|
|
cf.cf_flags |= PyCF_SOURCE_IS_UTF8;
|
|
}
|
|
#endif
|
|
if (PyObject_AsReadBuffer(cmd, (const void **)&str, &length))
|
|
return NULL;
|
|
if ((size_t)length != strlen(str)) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"compile() expected string without null bytes");
|
|
goto cleanup;
|
|
}
|
|
|
|
if (strcmp(startstr, "exec") == 0)
|
|
start = Py_file_input;
|
|
else if (strcmp(startstr, "eval") == 0)
|
|
start = Py_eval_input;
|
|
else if (strcmp(startstr, "single") == 0)
|
|
start = Py_single_input;
|
|
else {
|
|
PyErr_SetString(PyExc_ValueError,
|
|
"compile() arg 3 must be 'exec' or 'eval' or 'single'");
|
|
goto cleanup;
|
|
}
|
|
|
|
if (supplied_flags &
|
|
~(PyCF_MASK | PyCF_MASK_OBSOLETE | PyCF_DONT_IMPLY_DEDENT | PyCF_ONLY_AST))
|
|
{
|
|
PyErr_SetString(PyExc_ValueError,
|
|
"compile(): unrecognised flags");
|
|
goto cleanup;
|
|
}
|
|
/* XXX Warn if (supplied_flags & PyCF_MASK_OBSOLETE) != 0? */
|
|
|
|
if (!dont_inherit) {
|
|
PyEval_MergeCompilerFlags(&cf);
|
|
}
|
|
result = Py_CompileStringFlags(str, filename, start, &cf);
|
|
cleanup:
|
|
Py_XDECREF(tmp);
|
|
return result;
|
|
}
|
|
|
|
PyDoc_STRVAR(compile_doc,
|
|
"compile(source, filename, mode[, flags[, dont_inherit]]) -> code object\n\
|
|
\n\
|
|
Compile the source string (a Python module, statement or expression)\n\
|
|
into a code object that can be executed by the exec statement or eval().\n\
|
|
The filename will be used for run-time error messages.\n\
|
|
The mode must be 'exec' to compile a module, 'single' to compile a\n\
|
|
single (interactive) statement, or 'eval' to compile an expression.\n\
|
|
The flags argument, if present, controls which future statements influence\n\
|
|
the compilation of the code.\n\
|
|
The dont_inherit argument, if non-zero, stops the compilation inheriting\n\
|
|
the effects of any future statements in effect in the code calling\n\
|
|
compile; if absent or zero these statements do influence the compilation,\n\
|
|
in addition to any features explicitly specified.");
|
|
|
|
static PyObject *
|
|
builtin_dir(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *arg = NULL;
|
|
|
|
if (!PyArg_UnpackTuple(args, "dir", 0, 1, &arg))
|
|
return NULL;
|
|
return PyObject_Dir(arg);
|
|
}
|
|
|
|
PyDoc_STRVAR(dir_doc,
|
|
"dir([object]) -> list of strings\n"
|
|
"\n"
|
|
"Return an alphabetized list of names comprising (some of) the attributes\n"
|
|
"of the given object, and of attributes reachable from it:\n"
|
|
"\n"
|
|
"No argument: the names in the current scope.\n"
|
|
"Module object: the module attributes.\n"
|
|
"Type or class object: its attributes, and recursively the attributes of\n"
|
|
" its bases.\n"
|
|
"Otherwise: its attributes, its class's attributes, and recursively the\n"
|
|
" attributes of its class's base classes.");
|
|
|
|
static PyObject *
|
|
builtin_divmod(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *v, *w;
|
|
|
|
if (!PyArg_UnpackTuple(args, "divmod", 2, 2, &v, &w))
|
|
return NULL;
|
|
return PyNumber_Divmod(v, w);
|
|
}
|
|
|
|
PyDoc_STRVAR(divmod_doc,
|
|
"divmod(x, y) -> (div, mod)\n\
|
|
\n\
|
|
Return the tuple ((x-x%y)/y, x%y). Invariant: div*y + mod == x.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_eval(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *cmd, *result, *tmp = NULL;
|
|
PyObject *globals = Py_None, *locals = Py_None;
|
|
char *str;
|
|
PyCompilerFlags cf;
|
|
|
|
if (!PyArg_UnpackTuple(args, "eval", 1, 3, &cmd, &globals, &locals))
|
|
return NULL;
|
|
if (locals != Py_None && !PyMapping_Check(locals)) {
|
|
PyErr_SetString(PyExc_TypeError, "locals must be a mapping");
|
|
return NULL;
|
|
}
|
|
if (globals != Py_None && !PyDict_Check(globals)) {
|
|
PyErr_SetString(PyExc_TypeError, PyMapping_Check(globals) ?
|
|
"globals must be a real dict; try eval(expr, {}, mapping)"
|
|
: "globals must be a dict");
|
|
return NULL;
|
|
}
|
|
if (globals == Py_None) {
|
|
globals = PyEval_GetGlobals();
|
|
if (locals == Py_None)
|
|
locals = PyEval_GetLocals();
|
|
}
|
|
else if (locals == Py_None)
|
|
locals = globals;
|
|
|
|
if (globals == NULL || locals == NULL) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"eval must be given globals and locals "
|
|
"when called without a frame");
|
|
return NULL;
|
|
}
|
|
|
|
if (PyDict_GetItemString(globals, "__builtins__") == NULL) {
|
|
if (PyDict_SetItemString(globals, "__builtins__",
|
|
PyEval_GetBuiltins()) != 0)
|
|
return NULL;
|
|
}
|
|
|
|
if (PyCode_Check(cmd)) {
|
|
if (PyCode_GetNumFree((PyCodeObject *)cmd) > 0) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"code object passed to eval() may not contain free variables");
|
|
return NULL;
|
|
}
|
|
return PyEval_EvalCode((PyCodeObject *) cmd, globals, locals);
|
|
}
|
|
|
|
if (!PyString_Check(cmd) &&
|
|
!PyUnicode_Check(cmd)) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"eval() arg 1 must be a string or code object");
|
|
return NULL;
|
|
}
|
|
cf.cf_flags = 0;
|
|
|
|
#ifdef Py_USING_UNICODE
|
|
if (PyUnicode_Check(cmd)) {
|
|
tmp = PyUnicode_AsUTF8String(cmd);
|
|
if (tmp == NULL)
|
|
return NULL;
|
|
cmd = tmp;
|
|
cf.cf_flags |= PyCF_SOURCE_IS_UTF8;
|
|
}
|
|
#endif
|
|
if (PyString_AsStringAndSize(cmd, &str, NULL)) {
|
|
Py_XDECREF(tmp);
|
|
return NULL;
|
|
}
|
|
while (*str == ' ' || *str == '\t')
|
|
str++;
|
|
|
|
(void)PyEval_MergeCompilerFlags(&cf);
|
|
result = PyRun_StringFlags(str, Py_eval_input, globals, locals, &cf);
|
|
Py_XDECREF(tmp);
|
|
return result;
|
|
}
|
|
|
|
PyDoc_STRVAR(eval_doc,
|
|
"eval(source[, globals[, locals]]) -> value\n\
|
|
\n\
|
|
Evaluate the source in the context of globals and locals.\n\
|
|
The source may be a string representing a Python expression\n\
|
|
or a code object as returned by compile().\n\
|
|
The globals must be a dictionary and locals can be any mappping,\n\
|
|
defaulting to the current globals and locals.\n\
|
|
If only globals is given, locals defaults to it.\n");
|
|
|
|
|
|
static PyObject *
|
|
builtin_execfile(PyObject *self, PyObject *args)
|
|
{
|
|
char *filename;
|
|
PyObject *globals = Py_None, *locals = Py_None;
|
|
PyObject *res;
|
|
FILE* fp = NULL;
|
|
PyCompilerFlags cf;
|
|
int exists;
|
|
|
|
if (!PyArg_ParseTuple(args, "s|O!O:execfile",
|
|
&filename,
|
|
&PyDict_Type, &globals,
|
|
&locals))
|
|
return NULL;
|
|
if (locals != Py_None && !PyMapping_Check(locals)) {
|
|
PyErr_SetString(PyExc_TypeError, "locals must be a mapping");
|
|
return NULL;
|
|
}
|
|
if (globals == Py_None) {
|
|
globals = PyEval_GetGlobals();
|
|
if (locals == Py_None)
|
|
locals = PyEval_GetLocals();
|
|
}
|
|
else if (locals == Py_None)
|
|
locals = globals;
|
|
if (PyDict_GetItemString(globals, "__builtins__") == NULL) {
|
|
if (PyDict_SetItemString(globals, "__builtins__",
|
|
PyEval_GetBuiltins()) != 0)
|
|
return NULL;
|
|
}
|
|
|
|
exists = 0;
|
|
/* Test for existence or directory. */
|
|
#if defined(PLAN9)
|
|
{
|
|
Dir *d;
|
|
|
|
if ((d = dirstat(filename))!=nil) {
|
|
if(d->mode & DMDIR)
|
|
werrstr("is a directory");
|
|
else
|
|
exists = 1;
|
|
free(d);
|
|
}
|
|
}
|
|
#elif defined(RISCOS)
|
|
if (object_exists(filename)) {
|
|
if (isdir(filename))
|
|
errno = EISDIR;
|
|
else
|
|
exists = 1;
|
|
}
|
|
#else /* standard Posix */
|
|
{
|
|
struct stat s;
|
|
if (stat(filename, &s) == 0) {
|
|
if (S_ISDIR(s.st_mode))
|
|
# if defined(PYOS_OS2) && defined(PYCC_VACPP)
|
|
errno = EOS2ERR;
|
|
# else
|
|
errno = EISDIR;
|
|
# endif
|
|
else
|
|
exists = 1;
|
|
}
|
|
}
|
|
#endif
|
|
|
|
if (exists) {
|
|
Py_BEGIN_ALLOW_THREADS
|
|
fp = fopen(filename, "r" PY_STDIOTEXTMODE);
|
|
Py_END_ALLOW_THREADS
|
|
|
|
if (fp == NULL) {
|
|
exists = 0;
|
|
}
|
|
}
|
|
|
|
if (!exists) {
|
|
PyErr_SetFromErrnoWithFilename(PyExc_IOError, filename);
|
|
return NULL;
|
|
}
|
|
cf.cf_flags = 0;
|
|
if (PyEval_MergeCompilerFlags(&cf))
|
|
res = PyRun_FileExFlags(fp, filename, Py_file_input, globals,
|
|
locals, 1, &cf);
|
|
else
|
|
res = PyRun_FileEx(fp, filename, Py_file_input, globals,
|
|
locals, 1);
|
|
return res;
|
|
}
|
|
|
|
PyDoc_STRVAR(execfile_doc,
|
|
"execfile(filename[, globals[, locals]])\n\
|
|
\n\
|
|
Read and execute a Python script from a file.\n\
|
|
The globals and locals are dictionaries, defaulting to the current\n\
|
|
globals and locals. If only globals is given, locals defaults to it.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_getattr(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *v, *result, *dflt = NULL;
|
|
PyObject *name;
|
|
|
|
if (!PyArg_UnpackTuple(args, "getattr", 2, 3, &v, &name, &dflt))
|
|
return NULL;
|
|
#ifdef Py_USING_UNICODE
|
|
if (PyUnicode_Check(name)) {
|
|
name = _PyUnicode_AsDefaultEncodedString(name, NULL);
|
|
if (name == NULL)
|
|
return NULL;
|
|
}
|
|
#endif
|
|
|
|
if (!PyString_Check(name)) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"getattr(): attribute name must be string");
|
|
return NULL;
|
|
}
|
|
result = PyObject_GetAttr(v, name);
|
|
if (result == NULL && dflt != NULL &&
|
|
PyErr_ExceptionMatches(PyExc_AttributeError))
|
|
{
|
|
PyErr_Clear();
|
|
Py_INCREF(dflt);
|
|
result = dflt;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
PyDoc_STRVAR(getattr_doc,
|
|
"getattr(object, name[, default]) -> value\n\
|
|
\n\
|
|
Get a named attribute from an object; getattr(x, 'y') is equivalent to x.y.\n\
|
|
When a default argument is given, it is returned when the attribute doesn't\n\
|
|
exist; without it, an exception is raised in that case.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_globals(PyObject *self)
|
|
{
|
|
PyObject *d;
|
|
|
|
d = PyEval_GetGlobals();
|
|
Py_XINCREF(d);
|
|
return d;
|
|
}
|
|
|
|
PyDoc_STRVAR(globals_doc,
|
|
"globals() -> dictionary\n\
|
|
\n\
|
|
Return the dictionary containing the current scope's global variables.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_hasattr(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *v;
|
|
PyObject *name;
|
|
|
|
if (!PyArg_UnpackTuple(args, "hasattr", 2, 2, &v, &name))
|
|
return NULL;
|
|
#ifdef Py_USING_UNICODE
|
|
if (PyUnicode_Check(name)) {
|
|
name = _PyUnicode_AsDefaultEncodedString(name, NULL);
|
|
if (name == NULL)
|
|
return NULL;
|
|
}
|
|
#endif
|
|
|
|
if (!PyString_Check(name)) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"hasattr(): attribute name must be string");
|
|
return NULL;
|
|
}
|
|
v = PyObject_GetAttr(v, name);
|
|
if (v == NULL) {
|
|
PyErr_Clear();
|
|
Py_INCREF(Py_False);
|
|
return Py_False;
|
|
}
|
|
Py_DECREF(v);
|
|
Py_INCREF(Py_True);
|
|
return Py_True;
|
|
}
|
|
|
|
PyDoc_STRVAR(hasattr_doc,
|
|
"hasattr(object, name) -> bool\n\
|
|
\n\
|
|
Return whether the object has an attribute with the given name.\n\
|
|
(This is done by calling getattr(object, name) and catching exceptions.)");
|
|
|
|
|
|
static PyObject *
|
|
builtin_id(PyObject *self, PyObject *v)
|
|
{
|
|
return PyLong_FromVoidPtr(v);
|
|
}
|
|
|
|
PyDoc_STRVAR(id_doc,
|
|
"id(object) -> integer\n\
|
|
\n\
|
|
Return the identity of an object. This is guaranteed to be unique among\n\
|
|
simultaneously existing objects. (Hint: it's the object's memory address.)");
|
|
|
|
|
|
static PyObject *
|
|
builtin_map(PyObject *self, PyObject *args)
|
|
{
|
|
typedef struct {
|
|
PyObject *it; /* the iterator object */
|
|
int saw_StopIteration; /* bool: did the iterator end? */
|
|
} sequence;
|
|
|
|
PyObject *func, *result;
|
|
sequence *seqs = NULL, *sqp;
|
|
Py_ssize_t n, len;
|
|
register int i, j;
|
|
|
|
n = PyTuple_Size(args);
|
|
if (n < 2) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"map() requires at least two args");
|
|
return NULL;
|
|
}
|
|
|
|
func = PyTuple_GetItem(args, 0);
|
|
n--;
|
|
|
|
if (func == Py_None && n == 1) {
|
|
/* map(None, S) is the same as list(S). */
|
|
return PySequence_List(PyTuple_GetItem(args, 1));
|
|
}
|
|
|
|
/* Get space for sequence descriptors. Must NULL out the iterator
|
|
* pointers so that jumping to Fail_2 later doesn't see trash.
|
|
*/
|
|
if ((seqs = PyMem_NEW(sequence, n)) == NULL) {
|
|
PyErr_NoMemory();
|
|
return NULL;
|
|
}
|
|
for (i = 0; i < n; ++i) {
|
|
seqs[i].it = (PyObject*)NULL;
|
|
seqs[i].saw_StopIteration = 0;
|
|
}
|
|
|
|
/* Do a first pass to obtain iterators for the arguments, and set len
|
|
* to the largest of their lengths.
|
|
*/
|
|
len = 0;
|
|
for (i = 0, sqp = seqs; i < n; ++i, ++sqp) {
|
|
PyObject *curseq;
|
|
Py_ssize_t curlen;
|
|
|
|
/* Get iterator. */
|
|
curseq = PyTuple_GetItem(args, i+1);
|
|
sqp->it = PyObject_GetIter(curseq);
|
|
if (sqp->it == NULL) {
|
|
static char errmsg[] =
|
|
"argument %d to map() must support iteration";
|
|
char errbuf[sizeof(errmsg) + 25];
|
|
PyOS_snprintf(errbuf, sizeof(errbuf), errmsg, i+2);
|
|
PyErr_SetString(PyExc_TypeError, errbuf);
|
|
goto Fail_2;
|
|
}
|
|
|
|
/* Update len. */
|
|
curlen = _PyObject_LengthHint(curseq);
|
|
if (curlen < 0) {
|
|
if (!PyErr_ExceptionMatches(PyExc_TypeError) &&
|
|
!PyErr_ExceptionMatches(PyExc_AttributeError)) {
|
|
goto Fail_2;
|
|
}
|
|
PyErr_Clear();
|
|
curlen = 8; /* arbitrary */
|
|
}
|
|
if (curlen > len)
|
|
len = curlen;
|
|
}
|
|
|
|
/* Get space for the result list. */
|
|
if ((result = (PyObject *) PyList_New(len)) == NULL)
|
|
goto Fail_2;
|
|
|
|
/* Iterate over the sequences until all have stopped. */
|
|
for (i = 0; ; ++i) {
|
|
PyObject *alist, *item=NULL, *value;
|
|
int numactive = 0;
|
|
|
|
if (func == Py_None && n == 1)
|
|
alist = NULL;
|
|
else if ((alist = PyTuple_New(n)) == NULL)
|
|
goto Fail_1;
|
|
|
|
for (j = 0, sqp = seqs; j < n; ++j, ++sqp) {
|
|
if (sqp->saw_StopIteration) {
|
|
Py_INCREF(Py_None);
|
|
item = Py_None;
|
|
}
|
|
else {
|
|
item = PyIter_Next(sqp->it);
|
|
if (item)
|
|
++numactive;
|
|
else {
|
|
if (PyErr_Occurred()) {
|
|
Py_XDECREF(alist);
|
|
goto Fail_1;
|
|
}
|
|
Py_INCREF(Py_None);
|
|
item = Py_None;
|
|
sqp->saw_StopIteration = 1;
|
|
}
|
|
}
|
|
if (alist)
|
|
PyTuple_SET_ITEM(alist, j, item);
|
|
else
|
|
break;
|
|
}
|
|
|
|
if (!alist)
|
|
alist = item;
|
|
|
|
if (numactive == 0) {
|
|
Py_DECREF(alist);
|
|
break;
|
|
}
|
|
|
|
if (func == Py_None)
|
|
value = alist;
|
|
else {
|
|
value = PyEval_CallObject(func, alist);
|
|
Py_DECREF(alist);
|
|
if (value == NULL)
|
|
goto Fail_1;
|
|
}
|
|
if (i >= len) {
|
|
int status = PyList_Append(result, value);
|
|
Py_DECREF(value);
|
|
if (status < 0)
|
|
goto Fail_1;
|
|
}
|
|
else if (PyList_SetItem(result, i, value) < 0)
|
|
goto Fail_1;
|
|
}
|
|
|
|
if (i < len && PyList_SetSlice(result, i, len, NULL) < 0)
|
|
goto Fail_1;
|
|
|
|
goto Succeed;
|
|
|
|
Fail_1:
|
|
Py_DECREF(result);
|
|
Fail_2:
|
|
result = NULL;
|
|
Succeed:
|
|
assert(seqs);
|
|
for (i = 0; i < n; ++i)
|
|
Py_XDECREF(seqs[i].it);
|
|
PyMem_DEL(seqs);
|
|
return result;
|
|
}
|
|
|
|
PyDoc_STRVAR(map_doc,
|
|
"map(function, sequence[, sequence, ...]) -> list\n\
|
|
\n\
|
|
Return a list of the results of applying the function to the items of\n\
|
|
the argument sequence(s). If more than one sequence is given, the\n\
|
|
function is called with an argument list consisting of the corresponding\n\
|
|
item of each sequence, substituting None for missing values when not all\n\
|
|
sequences have the same length. If the function is None, return a list of\n\
|
|
the items of the sequence (or a list of tuples if more than one sequence).");
|
|
|
|
|
|
static PyObject *
|
|
builtin_setattr(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *v;
|
|
PyObject *name;
|
|
PyObject *value;
|
|
|
|
if (!PyArg_UnpackTuple(args, "setattr", 3, 3, &v, &name, &value))
|
|
return NULL;
|
|
if (PyObject_SetAttr(v, name, value) != 0)
|
|
return NULL;
|
|
Py_INCREF(Py_None);
|
|
return Py_None;
|
|
}
|
|
|
|
PyDoc_STRVAR(setattr_doc,
|
|
"setattr(object, name, value)\n\
|
|
\n\
|
|
Set a named attribute on an object; setattr(x, 'y', v) is equivalent to\n\
|
|
``x.y = v''.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_delattr(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *v;
|
|
PyObject *name;
|
|
|
|
if (!PyArg_UnpackTuple(args, "delattr", 2, 2, &v, &name))
|
|
return NULL;
|
|
if (PyObject_SetAttr(v, name, (PyObject *)NULL) != 0)
|
|
return NULL;
|
|
Py_INCREF(Py_None);
|
|
return Py_None;
|
|
}
|
|
|
|
PyDoc_STRVAR(delattr_doc,
|
|
"delattr(object, name)\n\
|
|
\n\
|
|
Delete a named attribute on an object; delattr(x, 'y') is equivalent to\n\
|
|
``del x.y''.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_hash(PyObject *self, PyObject *v)
|
|
{
|
|
long x;
|
|
|
|
x = PyObject_Hash(v);
|
|
if (x == -1)
|
|
return NULL;
|
|
return PyInt_FromLong(x);
|
|
}
|
|
|
|
PyDoc_STRVAR(hash_doc,
|
|
"hash(object) -> integer\n\
|
|
\n\
|
|
Return a hash value for the object. Two objects with the same value have\n\
|
|
the same hash value. The reverse is not necessarily true, but likely.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_hex(PyObject *self, PyObject *v)
|
|
{
|
|
PyNumberMethods *nb;
|
|
PyObject *res;
|
|
|
|
if ((nb = v->ob_type->tp_as_number) == NULL ||
|
|
nb->nb_hex == NULL) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"hex() argument can't be converted to hex");
|
|
return NULL;
|
|
}
|
|
res = (*nb->nb_hex)(v);
|
|
if (res && !PyString_Check(res)) {
|
|
PyErr_Format(PyExc_TypeError,
|
|
"__hex__ returned non-string (type %.200s)",
|
|
res->ob_type->tp_name);
|
|
Py_DECREF(res);
|
|
return NULL;
|
|
}
|
|
return res;
|
|
}
|
|
|
|
PyDoc_STRVAR(hex_doc,
|
|
"hex(number) -> string\n\
|
|
\n\
|
|
Return the hexadecimal representation of an integer or long integer.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_intern(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *s;
|
|
if (!PyArg_ParseTuple(args, "S:intern", &s))
|
|
return NULL;
|
|
if (!PyString_CheckExact(s)) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"can't intern subclass of string");
|
|
return NULL;
|
|
}
|
|
Py_INCREF(s);
|
|
PyString_InternInPlace(&s);
|
|
return s;
|
|
}
|
|
|
|
PyDoc_STRVAR(intern_doc,
|
|
"intern(string) -> string\n\
|
|
\n\
|
|
``Intern'' the given string. This enters the string in the (global)\n\
|
|
table of interned strings whose purpose is to speed up dictionary lookups.\n\
|
|
Return the string itself or the previously interned string object with the\n\
|
|
same value.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_iter(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *v, *w = NULL;
|
|
|
|
if (!PyArg_UnpackTuple(args, "iter", 1, 2, &v, &w))
|
|
return NULL;
|
|
if (w == NULL)
|
|
return PyObject_GetIter(v);
|
|
if (!PyCallable_Check(v)) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"iter(v, w): v must be callable");
|
|
return NULL;
|
|
}
|
|
return PyCallIter_New(v, w);
|
|
}
|
|
|
|
PyDoc_STRVAR(iter_doc,
|
|
"iter(collection) -> iterator\n\
|
|
iter(callable, sentinel) -> iterator\n\
|
|
\n\
|
|
Get an iterator from an object. In the first form, the argument must\n\
|
|
supply its own iterator, or be a sequence.\n\
|
|
In the second form, the callable is called until it returns the sentinel.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_len(PyObject *self, PyObject *v)
|
|
{
|
|
Py_ssize_t res;
|
|
|
|
res = PyObject_Size(v);
|
|
if (res < 0 && PyErr_Occurred())
|
|
return NULL;
|
|
return PyInt_FromSsize_t(res);
|
|
}
|
|
|
|
PyDoc_STRVAR(len_doc,
|
|
"len(object) -> integer\n\
|
|
\n\
|
|
Return the number of items of a sequence or mapping.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_locals(PyObject *self)
|
|
{
|
|
PyObject *d;
|
|
|
|
d = PyEval_GetLocals();
|
|
Py_XINCREF(d);
|
|
return d;
|
|
}
|
|
|
|
PyDoc_STRVAR(locals_doc,
|
|
"locals() -> dictionary\n\
|
|
\n\
|
|
Update and return a dictionary containing the current scope's local variables.");
|
|
|
|
|
|
static PyObject *
|
|
min_max(PyObject *args, PyObject *kwds, int op)
|
|
{
|
|
PyObject *v, *it, *item, *val, *maxitem, *maxval, *keyfunc=NULL;
|
|
const char *name = op == Py_LT ? "min" : "max";
|
|
|
|
if (PyTuple_Size(args) > 1)
|
|
v = args;
|
|
else if (!PyArg_UnpackTuple(args, (char *)name, 1, 1, &v))
|
|
return NULL;
|
|
|
|
if (kwds != NULL && PyDict_Check(kwds) && PyDict_Size(kwds)) {
|
|
keyfunc = PyDict_GetItemString(kwds, "key");
|
|
if (PyDict_Size(kwds)!=1 || keyfunc == NULL) {
|
|
PyErr_Format(PyExc_TypeError,
|
|
"%s() got an unexpected keyword argument", name);
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
it = PyObject_GetIter(v);
|
|
if (it == NULL)
|
|
return NULL;
|
|
|
|
maxitem = NULL; /* the result */
|
|
maxval = NULL; /* the value associated with the result */
|
|
while (( item = PyIter_Next(it) )) {
|
|
/* get the value from the key function */
|
|
if (keyfunc != NULL) {
|
|
val = PyObject_CallFunctionObjArgs(keyfunc, item, NULL);
|
|
if (val == NULL)
|
|
goto Fail_it_item;
|
|
}
|
|
/* no key function; the value is the item */
|
|
else {
|
|
val = item;
|
|
Py_INCREF(val);
|
|
}
|
|
|
|
/* maximum value and item are unset; set them */
|
|
if (maxval == NULL) {
|
|
maxitem = item;
|
|
maxval = val;
|
|
}
|
|
/* maximum value and item are set; update them as necessary */
|
|
else {
|
|
int cmp = PyObject_RichCompareBool(val, maxval, op);
|
|
if (cmp < 0)
|
|
goto Fail_it_item_and_val;
|
|
else if (cmp > 0) {
|
|
Py_DECREF(maxval);
|
|
Py_DECREF(maxitem);
|
|
maxval = val;
|
|
maxitem = item;
|
|
}
|
|
else {
|
|
Py_DECREF(item);
|
|
Py_DECREF(val);
|
|
}
|
|
}
|
|
}
|
|
if (PyErr_Occurred())
|
|
goto Fail_it;
|
|
if (maxval == NULL) {
|
|
PyErr_Format(PyExc_ValueError,
|
|
"%s() arg is an empty sequence", name);
|
|
assert(maxitem == NULL);
|
|
}
|
|
else
|
|
Py_DECREF(maxval);
|
|
Py_DECREF(it);
|
|
return maxitem;
|
|
|
|
Fail_it_item_and_val:
|
|
Py_DECREF(val);
|
|
Fail_it_item:
|
|
Py_DECREF(item);
|
|
Fail_it:
|
|
Py_XDECREF(maxval);
|
|
Py_XDECREF(maxitem);
|
|
Py_DECREF(it);
|
|
return NULL;
|
|
}
|
|
|
|
static PyObject *
|
|
builtin_min(PyObject *self, PyObject *args, PyObject *kwds)
|
|
{
|
|
return min_max(args, kwds, Py_LT);
|
|
}
|
|
|
|
PyDoc_STRVAR(min_doc,
|
|
"min(iterable[, key=func]) -> value\n\
|
|
min(a, b, c, ...[, key=func]) -> value\n\
|
|
\n\
|
|
With a single iterable argument, return its smallest item.\n\
|
|
With two or more arguments, return the smallest argument.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_max(PyObject *self, PyObject *args, PyObject *kwds)
|
|
{
|
|
return min_max(args, kwds, Py_GT);
|
|
}
|
|
|
|
PyDoc_STRVAR(max_doc,
|
|
"max(iterable[, key=func]) -> value\n\
|
|
max(a, b, c, ...[, key=func]) -> value\n\
|
|
\n\
|
|
With a single iterable argument, return its largest item.\n\
|
|
With two or more arguments, return the largest argument.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_oct(PyObject *self, PyObject *v)
|
|
{
|
|
PyNumberMethods *nb;
|
|
PyObject *res;
|
|
|
|
if (v == NULL || (nb = v->ob_type->tp_as_number) == NULL ||
|
|
nb->nb_oct == NULL) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"oct() argument can't be converted to oct");
|
|
return NULL;
|
|
}
|
|
res = (*nb->nb_oct)(v);
|
|
if (res && !PyString_Check(res)) {
|
|
PyErr_Format(PyExc_TypeError,
|
|
"__oct__ returned non-string (type %.200s)",
|
|
res->ob_type->tp_name);
|
|
Py_DECREF(res);
|
|
return NULL;
|
|
}
|
|
return res;
|
|
}
|
|
|
|
PyDoc_STRVAR(oct_doc,
|
|
"oct(number) -> string\n\
|
|
\n\
|
|
Return the octal representation of an integer or long integer.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_open(PyObject *self, PyObject *args, PyObject *kwds)
|
|
{
|
|
return PyObject_Call((PyObject*)&PyFile_Type, args, kwds);
|
|
}
|
|
|
|
PyDoc_STRVAR(open_doc,
|
|
"open(name[, mode[, buffering]]) -> file object\n\
|
|
\n\
|
|
Open a file using the file() type, returns a file object.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_ord(PyObject *self, PyObject* obj)
|
|
{
|
|
long ord;
|
|
Py_ssize_t size;
|
|
|
|
if (PyString_Check(obj)) {
|
|
size = PyString_GET_SIZE(obj);
|
|
if (size == 1) {
|
|
ord = (long)((unsigned char)*PyString_AS_STRING(obj));
|
|
return PyInt_FromLong(ord);
|
|
}
|
|
#ifdef Py_USING_UNICODE
|
|
} else if (PyUnicode_Check(obj)) {
|
|
size = PyUnicode_GET_SIZE(obj);
|
|
if (size == 1) {
|
|
ord = (long)*PyUnicode_AS_UNICODE(obj);
|
|
return PyInt_FromLong(ord);
|
|
}
|
|
#endif
|
|
} else {
|
|
PyErr_Format(PyExc_TypeError,
|
|
"ord() expected string of length 1, but " \
|
|
"%.200s found", obj->ob_type->tp_name);
|
|
return NULL;
|
|
}
|
|
|
|
PyErr_Format(PyExc_TypeError,
|
|
"ord() expected a character, "
|
|
"but string of length %zd found",
|
|
size);
|
|
return NULL;
|
|
}
|
|
|
|
PyDoc_STRVAR(ord_doc,
|
|
"ord(c) -> integer\n\
|
|
\n\
|
|
Return the integer ordinal of a one-character string.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_pow(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *v, *w, *z = Py_None;
|
|
|
|
if (!PyArg_UnpackTuple(args, "pow", 2, 3, &v, &w, &z))
|
|
return NULL;
|
|
return PyNumber_Power(v, w, z);
|
|
}
|
|
|
|
PyDoc_STRVAR(pow_doc,
|
|
"pow(x, y[, z]) -> number\n\
|
|
\n\
|
|
With two arguments, equivalent to x**y. With three arguments,\n\
|
|
equivalent to (x**y) % z, but may be more efficient (e.g. for longs).");
|
|
|
|
|
|
|
|
/* Return number of items in range (lo, hi, step), when arguments are
|
|
* PyInt or PyLong objects. step > 0 required. Return a value < 0 if
|
|
* & only if the true value is too large to fit in a signed long.
|
|
* Arguments MUST return 1 with either PyInt_Check() or
|
|
* PyLong_Check(). Return -1 when there is an error.
|
|
*/
|
|
static long
|
|
get_len_of_range_longs(PyObject *lo, PyObject *hi, PyObject *step)
|
|
{
|
|
/* -------------------------------------------------------------
|
|
Algorithm is equal to that of get_len_of_range(), but it operates
|
|
on PyObjects (which are assumed to be PyLong or PyInt objects).
|
|
---------------------------------------------------------------*/
|
|
long n;
|
|
PyObject *diff = NULL;
|
|
PyObject *one = NULL;
|
|
PyObject *tmp1 = NULL, *tmp2 = NULL, *tmp3 = NULL;
|
|
/* holds sub-expression evaluations */
|
|
|
|
/* if (lo >= hi), return length of 0. */
|
|
if (PyObject_Compare(lo, hi) >= 0)
|
|
return 0;
|
|
|
|
if ((one = PyLong_FromLong(1L)) == NULL)
|
|
goto Fail;
|
|
|
|
if ((tmp1 = PyNumber_Subtract(hi, lo)) == NULL)
|
|
goto Fail;
|
|
|
|
if ((diff = PyNumber_Subtract(tmp1, one)) == NULL)
|
|
goto Fail;
|
|
|
|
if ((tmp2 = PyNumber_FloorDivide(diff, step)) == NULL)
|
|
goto Fail;
|
|
|
|
if ((tmp3 = PyNumber_Add(tmp2, one)) == NULL)
|
|
goto Fail;
|
|
|
|
n = PyLong_AsLong(tmp3);
|
|
if (PyErr_Occurred()) { /* Check for Overflow */
|
|
PyErr_Clear();
|
|
goto Fail;
|
|
}
|
|
|
|
Py_DECREF(tmp3);
|
|
Py_DECREF(tmp2);
|
|
Py_DECREF(diff);
|
|
Py_DECREF(tmp1);
|
|
Py_DECREF(one);
|
|
return n;
|
|
|
|
Fail:
|
|
Py_XDECREF(tmp3);
|
|
Py_XDECREF(tmp2);
|
|
Py_XDECREF(diff);
|
|
Py_XDECREF(tmp1);
|
|
Py_XDECREF(one);
|
|
return -1;
|
|
}
|
|
|
|
/* An extension of builtin_range() that handles the case when PyLong
|
|
* arguments are given. */
|
|
static PyObject *
|
|
handle_range_longs(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *ilow;
|
|
PyObject *ihigh = NULL;
|
|
PyObject *istep = NULL;
|
|
|
|
PyObject *curnum = NULL;
|
|
PyObject *v = NULL;
|
|
long bign;
|
|
int i, n;
|
|
int cmp_result;
|
|
|
|
PyObject *zero = PyLong_FromLong(0);
|
|
|
|
if (zero == NULL)
|
|
return NULL;
|
|
|
|
if (!PyArg_UnpackTuple(args, "range", 1, 3, &ilow, &ihigh, &istep)) {
|
|
Py_DECREF(zero);
|
|
return NULL;
|
|
}
|
|
|
|
/* Figure out which way we were called, supply defaults, and be
|
|
* sure to incref everything so that the decrefs at the end
|
|
* are correct.
|
|
*/
|
|
assert(ilow != NULL);
|
|
if (ihigh == NULL) {
|
|
/* only 1 arg -- it's the upper limit */
|
|
ihigh = ilow;
|
|
ilow = NULL;
|
|
}
|
|
assert(ihigh != NULL);
|
|
Py_INCREF(ihigh);
|
|
|
|
/* ihigh correct now; do ilow */
|
|
if (ilow == NULL)
|
|
ilow = zero;
|
|
Py_INCREF(ilow);
|
|
|
|
/* ilow and ihigh correct now; do istep */
|
|
if (istep == NULL) {
|
|
istep = PyLong_FromLong(1L);
|
|
if (istep == NULL)
|
|
goto Fail;
|
|
}
|
|
else {
|
|
Py_INCREF(istep);
|
|
}
|
|
|
|
if (!PyInt_Check(ilow) && !PyLong_Check(ilow)) {
|
|
PyErr_Format(PyExc_TypeError,
|
|
"range() integer start argument expected, got %s.",
|
|
ilow->ob_type->tp_name);
|
|
goto Fail;
|
|
}
|
|
|
|
if (!PyInt_Check(ihigh) && !PyLong_Check(ihigh)) {
|
|
PyErr_Format(PyExc_TypeError,
|
|
"range() integer end argument expected, got %s.",
|
|
ihigh->ob_type->tp_name);
|
|
goto Fail;
|
|
}
|
|
|
|
if (!PyInt_Check(istep) && !PyLong_Check(istep)) {
|
|
PyErr_Format(PyExc_TypeError,
|
|
"range() integer step argument expected, got %s.",
|
|
istep->ob_type->tp_name);
|
|
goto Fail;
|
|
}
|
|
|
|
if (PyObject_Cmp(istep, zero, &cmp_result) == -1)
|
|
goto Fail;
|
|
if (cmp_result == 0) {
|
|
PyErr_SetString(PyExc_ValueError,
|
|
"range() step argument must not be zero");
|
|
goto Fail;
|
|
}
|
|
|
|
if (cmp_result > 0)
|
|
bign = get_len_of_range_longs(ilow, ihigh, istep);
|
|
else {
|
|
PyObject *neg_istep = PyNumber_Negative(istep);
|
|
if (neg_istep == NULL)
|
|
goto Fail;
|
|
bign = get_len_of_range_longs(ihigh, ilow, neg_istep);
|
|
Py_DECREF(neg_istep);
|
|
}
|
|
|
|
n = (int)bign;
|
|
if (bign < 0 || (long)n != bign) {
|
|
PyErr_SetString(PyExc_OverflowError,
|
|
"range() result has too many items");
|
|
goto Fail;
|
|
}
|
|
|
|
v = PyList_New(n);
|
|
if (v == NULL)
|
|
goto Fail;
|
|
|
|
curnum = ilow;
|
|
Py_INCREF(curnum);
|
|
|
|
for (i = 0; i < n; i++) {
|
|
PyObject *w = PyNumber_Long(curnum);
|
|
PyObject *tmp_num;
|
|
if (w == NULL)
|
|
goto Fail;
|
|
|
|
PyList_SET_ITEM(v, i, w);
|
|
|
|
tmp_num = PyNumber_Add(curnum, istep);
|
|
if (tmp_num == NULL)
|
|
goto Fail;
|
|
|
|
Py_DECREF(curnum);
|
|
curnum = tmp_num;
|
|
}
|
|
Py_DECREF(ilow);
|
|
Py_DECREF(ihigh);
|
|
Py_DECREF(istep);
|
|
Py_DECREF(zero);
|
|
Py_DECREF(curnum);
|
|
return v;
|
|
|
|
Fail:
|
|
Py_DECREF(ilow);
|
|
Py_DECREF(ihigh);
|
|
Py_XDECREF(istep);
|
|
Py_DECREF(zero);
|
|
Py_XDECREF(curnum);
|
|
Py_XDECREF(v);
|
|
return NULL;
|
|
}
|
|
|
|
/* Return number of items in range/xrange (lo, hi, step). step > 0
|
|
* required. Return a value < 0 if & only if the true value is too
|
|
* large to fit in a signed long.
|
|
*/
|
|
static long
|
|
get_len_of_range(long lo, long hi, long step)
|
|
{
|
|
/* -------------------------------------------------------------
|
|
If lo >= hi, the range is empty.
|
|
Else if n values are in the range, the last one is
|
|
lo + (n-1)*step, which must be <= hi-1. Rearranging,
|
|
n <= (hi - lo - 1)/step + 1, so taking the floor of the RHS gives
|
|
the proper value. Since lo < hi in this case, hi-lo-1 >= 0, so
|
|
the RHS is non-negative and so truncation is the same as the
|
|
floor. Letting M be the largest positive long, the worst case
|
|
for the RHS numerator is hi=M, lo=-M-1, and then
|
|
hi-lo-1 = M-(-M-1)-1 = 2*M. Therefore unsigned long has enough
|
|
precision to compute the RHS exactly.
|
|
---------------------------------------------------------------*/
|
|
long n = 0;
|
|
if (lo < hi) {
|
|
unsigned long uhi = (unsigned long)hi;
|
|
unsigned long ulo = (unsigned long)lo;
|
|
unsigned long diff = uhi - ulo - 1;
|
|
n = (long)(diff / (unsigned long)step + 1);
|
|
}
|
|
return n;
|
|
}
|
|
|
|
static PyObject *
|
|
builtin_range(PyObject *self, PyObject *args)
|
|
{
|
|
long ilow = 0, ihigh = 0, istep = 1;
|
|
long bign;
|
|
int i, n;
|
|
|
|
PyObject *v;
|
|
|
|
if (PyTuple_Size(args) <= 1) {
|
|
if (!PyArg_ParseTuple(args,
|
|
"l;range() requires 1-3 int arguments",
|
|
&ihigh)) {
|
|
PyErr_Clear();
|
|
return handle_range_longs(self, args);
|
|
}
|
|
}
|
|
else {
|
|
if (!PyArg_ParseTuple(args,
|
|
"ll|l;range() requires 1-3 int arguments",
|
|
&ilow, &ihigh, &istep)) {
|
|
PyErr_Clear();
|
|
return handle_range_longs(self, args);
|
|
}
|
|
}
|
|
if (istep == 0) {
|
|
PyErr_SetString(PyExc_ValueError,
|
|
"range() step argument must not be zero");
|
|
return NULL;
|
|
}
|
|
if (istep > 0)
|
|
bign = get_len_of_range(ilow, ihigh, istep);
|
|
else
|
|
bign = get_len_of_range(ihigh, ilow, -istep);
|
|
n = (int)bign;
|
|
if (bign < 0 || (long)n != bign) {
|
|
PyErr_SetString(PyExc_OverflowError,
|
|
"range() result has too many items");
|
|
return NULL;
|
|
}
|
|
v = PyList_New(n);
|
|
if (v == NULL)
|
|
return NULL;
|
|
for (i = 0; i < n; i++) {
|
|
PyObject *w = PyInt_FromLong(ilow);
|
|
if (w == NULL) {
|
|
Py_DECREF(v);
|
|
return NULL;
|
|
}
|
|
PyList_SET_ITEM(v, i, w);
|
|
ilow += istep;
|
|
}
|
|
return v;
|
|
}
|
|
|
|
PyDoc_STRVAR(range_doc,
|
|
"range([start,] stop[, step]) -> list of integers\n\
|
|
\n\
|
|
Return a list containing an arithmetic progression of integers.\n\
|
|
range(i, j) returns [i, i+1, i+2, ..., j-1]; start (!) defaults to 0.\n\
|
|
When step is given, it specifies the increment (or decrement).\n\
|
|
For example, range(4) returns [0, 1, 2, 3]. The end point is omitted!\n\
|
|
These are exactly the valid indices for a list of 4 elements.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_reduce(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *seq, *func, *result = NULL, *it;
|
|
|
|
if (!PyArg_UnpackTuple(args, "reduce", 2, 3, &func, &seq, &result))
|
|
return NULL;
|
|
if (result != NULL)
|
|
Py_INCREF(result);
|
|
|
|
it = PyObject_GetIter(seq);
|
|
if (it == NULL) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"reduce() arg 2 must support iteration");
|
|
Py_XDECREF(result);
|
|
return NULL;
|
|
}
|
|
|
|
if ((args = PyTuple_New(2)) == NULL)
|
|
goto Fail;
|
|
|
|
for (;;) {
|
|
PyObject *op2;
|
|
|
|
if (args->ob_refcnt > 1) {
|
|
Py_DECREF(args);
|
|
if ((args = PyTuple_New(2)) == NULL)
|
|
goto Fail;
|
|
}
|
|
|
|
op2 = PyIter_Next(it);
|
|
if (op2 == NULL) {
|
|
if (PyErr_Occurred())
|
|
goto Fail;
|
|
break;
|
|
}
|
|
|
|
if (result == NULL)
|
|
result = op2;
|
|
else {
|
|
PyTuple_SetItem(args, 0, result);
|
|
PyTuple_SetItem(args, 1, op2);
|
|
if ((result = PyEval_CallObject(func, args)) == NULL)
|
|
goto Fail;
|
|
}
|
|
}
|
|
|
|
Py_DECREF(args);
|
|
|
|
if (result == NULL)
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"reduce() of empty sequence with no initial value");
|
|
|
|
Py_DECREF(it);
|
|
return result;
|
|
|
|
Fail:
|
|
Py_XDECREF(args);
|
|
Py_XDECREF(result);
|
|
Py_DECREF(it);
|
|
return NULL;
|
|
}
|
|
|
|
PyDoc_STRVAR(reduce_doc,
|
|
"reduce(function, sequence[, initial]) -> value\n\
|
|
\n\
|
|
Apply a function of two arguments cumulatively to the items of a sequence,\n\
|
|
from left to right, so as to reduce the sequence to a single value.\n\
|
|
For example, reduce(lambda x, y: x+y, [1, 2, 3, 4, 5]) calculates\n\
|
|
((((1+2)+3)+4)+5). If initial is present, it is placed before the items\n\
|
|
of the sequence in the calculation, and serves as a default when the\n\
|
|
sequence is empty.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_reload(PyObject *self, PyObject *v)
|
|
{
|
|
return PyImport_ReloadModule(v);
|
|
}
|
|
|
|
PyDoc_STRVAR(reload_doc,
|
|
"reload(module) -> module\n\
|
|
\n\
|
|
Reload the module. The module must have been successfully imported before.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_repr(PyObject *self, PyObject *v)
|
|
{
|
|
return PyObject_Repr(v);
|
|
}
|
|
|
|
PyDoc_STRVAR(repr_doc,
|
|
"repr(object) -> string\n\
|
|
\n\
|
|
Return the canonical string representation of the object.\n\
|
|
For most object types, eval(repr(object)) == object.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_round(PyObject *self, PyObject *args, PyObject *kwds)
|
|
{
|
|
double number;
|
|
double f;
|
|
int ndigits = 0;
|
|
int i;
|
|
static char *kwlist[] = {"number", "ndigits", 0};
|
|
|
|
if (!PyArg_ParseTupleAndKeywords(args, kwds, "d|i:round",
|
|
kwlist, &number, &ndigits))
|
|
return NULL;
|
|
f = 1.0;
|
|
i = abs(ndigits);
|
|
while (--i >= 0)
|
|
f = f*10.0;
|
|
if (ndigits < 0)
|
|
number /= f;
|
|
else
|
|
number *= f;
|
|
if (number >= 0.0)
|
|
number = floor(number + 0.5);
|
|
else
|
|
number = ceil(number - 0.5);
|
|
if (ndigits < 0)
|
|
number *= f;
|
|
else
|
|
number /= f;
|
|
return PyFloat_FromDouble(number);
|
|
}
|
|
|
|
PyDoc_STRVAR(round_doc,
|
|
"round(number[, ndigits]) -> floating point number\n\
|
|
\n\
|
|
Round a number to a given precision in decimal digits (default 0 digits).\n\
|
|
This always returns a floating point number. Precision may be negative.");
|
|
|
|
static PyObject *
|
|
builtin_sorted(PyObject *self, PyObject *args, PyObject *kwds)
|
|
{
|
|
PyObject *newlist, *v, *seq, *compare=NULL, *keyfunc=NULL, *newargs;
|
|
PyObject *callable;
|
|
static char *kwlist[] = {"iterable", "cmp", "key", "reverse", 0};
|
|
int reverse;
|
|
|
|
/* args 1-4 should match listsort in Objects/listobject.c */
|
|
if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|OOi:sorted",
|
|
kwlist, &seq, &compare, &keyfunc, &reverse))
|
|
return NULL;
|
|
|
|
newlist = PySequence_List(seq);
|
|
if (newlist == NULL)
|
|
return NULL;
|
|
|
|
callable = PyObject_GetAttrString(newlist, "sort");
|
|
if (callable == NULL) {
|
|
Py_DECREF(newlist);
|
|
return NULL;
|
|
}
|
|
|
|
newargs = PyTuple_GetSlice(args, 1, 4);
|
|
if (newargs == NULL) {
|
|
Py_DECREF(newlist);
|
|
Py_DECREF(callable);
|
|
return NULL;
|
|
}
|
|
|
|
v = PyObject_Call(callable, newargs, kwds);
|
|
Py_DECREF(newargs);
|
|
Py_DECREF(callable);
|
|
if (v == NULL) {
|
|
Py_DECREF(newlist);
|
|
return NULL;
|
|
}
|
|
Py_DECREF(v);
|
|
return newlist;
|
|
}
|
|
|
|
PyDoc_STRVAR(sorted_doc,
|
|
"sorted(iterable, cmp=None, key=None, reverse=False) --> new sorted list");
|
|
|
|
static PyObject *
|
|
builtin_vars(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *v = NULL;
|
|
PyObject *d;
|
|
|
|
if (!PyArg_UnpackTuple(args, "vars", 0, 1, &v))
|
|
return NULL;
|
|
if (v == NULL) {
|
|
d = PyEval_GetLocals();
|
|
if (d == NULL) {
|
|
if (!PyErr_Occurred())
|
|
PyErr_SetString(PyExc_SystemError,
|
|
"vars(): no locals!?");
|
|
}
|
|
else
|
|
Py_INCREF(d);
|
|
}
|
|
else {
|
|
d = PyObject_GetAttrString(v, "__dict__");
|
|
if (d == NULL) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"vars() argument must have __dict__ attribute");
|
|
return NULL;
|
|
}
|
|
}
|
|
return d;
|
|
}
|
|
|
|
PyDoc_STRVAR(vars_doc,
|
|
"vars([object]) -> dictionary\n\
|
|
\n\
|
|
Without arguments, equivalent to locals().\n\
|
|
With an argument, equivalent to object.__dict__.");
|
|
|
|
|
|
static PyObject*
|
|
builtin_sum(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *seq;
|
|
PyObject *result = NULL;
|
|
PyObject *temp, *item, *iter;
|
|
|
|
if (!PyArg_UnpackTuple(args, "sum", 1, 2, &seq, &result))
|
|
return NULL;
|
|
|
|
iter = PyObject_GetIter(seq);
|
|
if (iter == NULL)
|
|
return NULL;
|
|
|
|
if (result == NULL) {
|
|
result = PyInt_FromLong(0);
|
|
if (result == NULL) {
|
|
Py_DECREF(iter);
|
|
return NULL;
|
|
}
|
|
} else {
|
|
/* reject string values for 'start' parameter */
|
|
if (PyObject_TypeCheck(result, &PyBaseString_Type)) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"sum() can't sum strings [use ''.join(seq) instead]");
|
|
Py_DECREF(iter);
|
|
return NULL;
|
|
}
|
|
Py_INCREF(result);
|
|
}
|
|
|
|
for(;;) {
|
|
item = PyIter_Next(iter);
|
|
if (item == NULL) {
|
|
/* error, or end-of-sequence */
|
|
if (PyErr_Occurred()) {
|
|
Py_DECREF(result);
|
|
result = NULL;
|
|
}
|
|
break;
|
|
}
|
|
temp = PyNumber_Add(result, item);
|
|
Py_DECREF(result);
|
|
Py_DECREF(item);
|
|
result = temp;
|
|
if (result == NULL)
|
|
break;
|
|
}
|
|
Py_DECREF(iter);
|
|
return result;
|
|
}
|
|
|
|
PyDoc_STRVAR(sum_doc,
|
|
"sum(sequence, start=0) -> value\n\
|
|
\n\
|
|
Returns the sum of a sequence of numbers (NOT strings) plus the value\n\
|
|
of parameter 'start'. When the sequence is empty, returns start.");
|
|
|
|
|
|
static PyObject *
|
|
builtin_isinstance(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *inst;
|
|
PyObject *cls;
|
|
int retval;
|
|
|
|
if (!PyArg_UnpackTuple(args, "isinstance", 2, 2, &inst, &cls))
|
|
return NULL;
|
|
|
|
retval = PyObject_IsInstance(inst, cls);
|
|
if (retval < 0)
|
|
return NULL;
|
|
return PyBool_FromLong(retval);
|
|
}
|
|
|
|
PyDoc_STRVAR(isinstance_doc,
|
|
"isinstance(object, class-or-type-or-tuple) -> bool\n\
|
|
\n\
|
|
Return whether an object is an instance of a class or of a subclass thereof.\n\
|
|
With a type as second argument, return whether that is the object's type.\n\
|
|
The form using a tuple, isinstance(x, (A, B, ...)), is a shortcut for\n\
|
|
isinstance(x, A) or isinstance(x, B) or ... (etc.).");
|
|
|
|
|
|
static PyObject *
|
|
builtin_issubclass(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *derived;
|
|
PyObject *cls;
|
|
int retval;
|
|
|
|
if (!PyArg_UnpackTuple(args, "issubclass", 2, 2, &derived, &cls))
|
|
return NULL;
|
|
|
|
retval = PyObject_IsSubclass(derived, cls);
|
|
if (retval < 0)
|
|
return NULL;
|
|
return PyBool_FromLong(retval);
|
|
}
|
|
|
|
PyDoc_STRVAR(issubclass_doc,
|
|
"issubclass(C, B) -> bool\n\
|
|
\n\
|
|
Return whether class C is a subclass (i.e., a derived class) of class B.\n\
|
|
When using a tuple as the second argument issubclass(X, (A, B, ...)),\n\
|
|
is a shortcut for issubclass(X, A) or issubclass(X, B) or ... (etc.).");
|
|
|
|
|
|
static PyObject*
|
|
builtin_zip(PyObject *self, PyObject *args)
|
|
{
|
|
PyObject *ret;
|
|
const Py_ssize_t itemsize = PySequence_Length(args);
|
|
Py_ssize_t i;
|
|
PyObject *itlist; /* tuple of iterators */
|
|
Py_ssize_t len; /* guess at result length */
|
|
|
|
if (itemsize == 0)
|
|
return PyList_New(0);
|
|
|
|
/* args must be a tuple */
|
|
assert(PyTuple_Check(args));
|
|
|
|
/* Guess at result length: the shortest of the input lengths.
|
|
If some argument refuses to say, we refuse to guess too, lest
|
|
an argument like xrange(sys.maxint) lead us astray.*/
|
|
len = -1; /* unknown */
|
|
for (i = 0; i < itemsize; ++i) {
|
|
PyObject *item = PyTuple_GET_ITEM(args, i);
|
|
Py_ssize_t thislen = _PyObject_LengthHint(item);
|
|
if (thislen < 0) {
|
|
if (!PyErr_ExceptionMatches(PyExc_TypeError) &&
|
|
!PyErr_ExceptionMatches(PyExc_AttributeError)) {
|
|
return NULL;
|
|
}
|
|
PyErr_Clear();
|
|
len = -1;
|
|
break;
|
|
}
|
|
else if (len < 0 || thislen < len)
|
|
len = thislen;
|
|
}
|
|
|
|
/* allocate result list */
|
|
if (len < 0)
|
|
len = 10; /* arbitrary */
|
|
if ((ret = PyList_New(len)) == NULL)
|
|
return NULL;
|
|
|
|
/* obtain iterators */
|
|
itlist = PyTuple_New(itemsize);
|
|
if (itlist == NULL)
|
|
goto Fail_ret;
|
|
for (i = 0; i < itemsize; ++i) {
|
|
PyObject *item = PyTuple_GET_ITEM(args, i);
|
|
PyObject *it = PyObject_GetIter(item);
|
|
if (it == NULL) {
|
|
if (PyErr_ExceptionMatches(PyExc_TypeError))
|
|
PyErr_Format(PyExc_TypeError,
|
|
"zip argument #%zd must support iteration",
|
|
i+1);
|
|
goto Fail_ret_itlist;
|
|
}
|
|
PyTuple_SET_ITEM(itlist, i, it);
|
|
}
|
|
|
|
/* build result into ret list */
|
|
for (i = 0; ; ++i) {
|
|
int j;
|
|
PyObject *next = PyTuple_New(itemsize);
|
|
if (!next)
|
|
goto Fail_ret_itlist;
|
|
|
|
for (j = 0; j < itemsize; j++) {
|
|
PyObject *it = PyTuple_GET_ITEM(itlist, j);
|
|
PyObject *item = PyIter_Next(it);
|
|
if (!item) {
|
|
if (PyErr_Occurred()) {
|
|
Py_DECREF(ret);
|
|
ret = NULL;
|
|
}
|
|
Py_DECREF(next);
|
|
Py_DECREF(itlist);
|
|
goto Done;
|
|
}
|
|
PyTuple_SET_ITEM(next, j, item);
|
|
}
|
|
|
|
if (i < len)
|
|
PyList_SET_ITEM(ret, i, next);
|
|
else {
|
|
int status = PyList_Append(ret, next);
|
|
Py_DECREF(next);
|
|
++len;
|
|
if (status < 0)
|
|
goto Fail_ret_itlist;
|
|
}
|
|
}
|
|
|
|
Done:
|
|
if (ret != NULL && i < len) {
|
|
/* The list is too big. */
|
|
if (PyList_SetSlice(ret, i, len, NULL) < 0)
|
|
return NULL;
|
|
}
|
|
return ret;
|
|
|
|
Fail_ret_itlist:
|
|
Py_DECREF(itlist);
|
|
Fail_ret:
|
|
Py_DECREF(ret);
|
|
return NULL;
|
|
}
|
|
|
|
|
|
PyDoc_STRVAR(zip_doc,
|
|
"zip(seq1 [, seq2 [...]]) -> [(seq1[0], seq2[0] ...), (...)]\n\
|
|
\n\
|
|
Return a list of tuples, where each tuple contains the i-th element\n\
|
|
from each of the argument sequences. The returned list is truncated\n\
|
|
in length to the length of the shortest argument sequence.");
|
|
|
|
|
|
static PyMethodDef builtin_methods[] = {
|
|
{"__import__", (PyCFunction)builtin___import__, METH_VARARGS | METH_KEYWORDS, import_doc},
|
|
{"abs", builtin_abs, METH_O, abs_doc},
|
|
{"all", builtin_all, METH_O, all_doc},
|
|
{"any", builtin_any, METH_O, any_doc},
|
|
{"callable", builtin_callable, METH_O, callable_doc},
|
|
{"chr", builtin_chr, METH_VARARGS, chr_doc},
|
|
{"cmp", builtin_cmp, METH_VARARGS, cmp_doc},
|
|
{"compile", builtin_compile, METH_VARARGS, compile_doc},
|
|
{"delattr", builtin_delattr, METH_VARARGS, delattr_doc},
|
|
{"dir", builtin_dir, METH_VARARGS, dir_doc},
|
|
{"divmod", builtin_divmod, METH_VARARGS, divmod_doc},
|
|
{"eval", builtin_eval, METH_VARARGS, eval_doc},
|
|
{"execfile", builtin_execfile, METH_VARARGS, execfile_doc},
|
|
{"filter", builtin_filter, METH_VARARGS, filter_doc},
|
|
{"getattr", builtin_getattr, METH_VARARGS, getattr_doc},
|
|
{"globals", (PyCFunction)builtin_globals, METH_NOARGS, globals_doc},
|
|
{"hasattr", builtin_hasattr, METH_VARARGS, hasattr_doc},
|
|
{"hash", builtin_hash, METH_O, hash_doc},
|
|
{"hex", builtin_hex, METH_O, hex_doc},
|
|
{"id", builtin_id, METH_O, id_doc},
|
|
{"intern", builtin_intern, METH_VARARGS, intern_doc},
|
|
{"isinstance", builtin_isinstance, METH_VARARGS, isinstance_doc},
|
|
{"issubclass", builtin_issubclass, METH_VARARGS, issubclass_doc},
|
|
{"iter", builtin_iter, METH_VARARGS, iter_doc},
|
|
{"len", builtin_len, METH_O, len_doc},
|
|
{"locals", (PyCFunction)builtin_locals, METH_NOARGS, locals_doc},
|
|
{"map", builtin_map, METH_VARARGS, map_doc},
|
|
{"max", (PyCFunction)builtin_max, METH_VARARGS | METH_KEYWORDS, max_doc},
|
|
{"min", (PyCFunction)builtin_min, METH_VARARGS | METH_KEYWORDS, min_doc},
|
|
{"oct", builtin_oct, METH_O, oct_doc},
|
|
{"open", (PyCFunction)builtin_open, METH_VARARGS | METH_KEYWORDS, open_doc},
|
|
{"ord", builtin_ord, METH_O, ord_doc},
|
|
{"pow", builtin_pow, METH_VARARGS, pow_doc},
|
|
{"range", builtin_range, METH_VARARGS, range_doc},
|
|
{"reduce", builtin_reduce, METH_VARARGS, reduce_doc},
|
|
{"reload", builtin_reload, METH_O, reload_doc},
|
|
{"repr", builtin_repr, METH_O, repr_doc},
|
|
{"round", (PyCFunction)builtin_round, METH_VARARGS | METH_KEYWORDS, round_doc},
|
|
{"setattr", builtin_setattr, METH_VARARGS, setattr_doc},
|
|
{"sorted", (PyCFunction)builtin_sorted, METH_VARARGS | METH_KEYWORDS, sorted_doc},
|
|
{"sum", builtin_sum, METH_VARARGS, sum_doc},
|
|
#ifdef Py_USING_UNICODE
|
|
{"unichr", builtin_unichr, METH_VARARGS, unichr_doc},
|
|
#endif
|
|
{"vars", builtin_vars, METH_VARARGS, vars_doc},
|
|
{"zip", builtin_zip, METH_VARARGS, zip_doc},
|
|
{NULL, NULL},
|
|
};
|
|
|
|
PyDoc_STRVAR(builtin_doc,
|
|
"Built-in functions, exceptions, and other objects.\n\
|
|
\n\
|
|
Noteworthy: None is the `nil' object; Ellipsis represents `...' in slices.");
|
|
|
|
PyObject *
|
|
_PyBuiltin_Init(void)
|
|
{
|
|
PyObject *mod, *dict, *debug;
|
|
mod = Py_InitModule4("__builtin__", builtin_methods,
|
|
builtin_doc, (PyObject *)NULL,
|
|
PYTHON_API_VERSION);
|
|
if (mod == NULL)
|
|
return NULL;
|
|
dict = PyModule_GetDict(mod);
|
|
|
|
#ifdef Py_TRACE_REFS
|
|
/* __builtin__ exposes a number of statically allocated objects
|
|
* that, before this code was added in 2.3, never showed up in
|
|
* the list of "all objects" maintained by Py_TRACE_REFS. As a
|
|
* result, programs leaking references to None and False (etc)
|
|
* couldn't be diagnosed by examining sys.getobjects(0).
|
|
*/
|
|
#define ADD_TO_ALL(OBJECT) _Py_AddToAllObjects((PyObject *)(OBJECT), 0)
|
|
#else
|
|
#define ADD_TO_ALL(OBJECT) (void)0
|
|
#endif
|
|
|
|
#define SETBUILTIN(NAME, OBJECT) \
|
|
if (PyDict_SetItemString(dict, NAME, (PyObject *)OBJECT) < 0) \
|
|
return NULL; \
|
|
ADD_TO_ALL(OBJECT)
|
|
|
|
SETBUILTIN("None", Py_None);
|
|
SETBUILTIN("Ellipsis", Py_Ellipsis);
|
|
SETBUILTIN("NotImplemented", Py_NotImplemented);
|
|
SETBUILTIN("False", Py_False);
|
|
SETBUILTIN("True", Py_True);
|
|
SETBUILTIN("basestring", &PyBaseString_Type);
|
|
SETBUILTIN("bool", &PyBool_Type);
|
|
SETBUILTIN("buffer", &PyBuffer_Type);
|
|
SETBUILTIN("bytes", &PyBytes_Type);
|
|
SETBUILTIN("classmethod", &PyClassMethod_Type);
|
|
#ifndef WITHOUT_COMPLEX
|
|
SETBUILTIN("complex", &PyComplex_Type);
|
|
#endif
|
|
SETBUILTIN("dict", &PyDict_Type);
|
|
SETBUILTIN("enumerate", &PyEnum_Type);
|
|
SETBUILTIN("file", &PyFile_Type);
|
|
SETBUILTIN("float", &PyFloat_Type);
|
|
SETBUILTIN("frozenset", &PyFrozenSet_Type);
|
|
SETBUILTIN("property", &PyProperty_Type);
|
|
SETBUILTIN("int", &PyInt_Type);
|
|
SETBUILTIN("list", &PyList_Type);
|
|
SETBUILTIN("long", &PyLong_Type);
|
|
SETBUILTIN("object", &PyBaseObject_Type);
|
|
SETBUILTIN("reversed", &PyReversed_Type);
|
|
SETBUILTIN("set", &PySet_Type);
|
|
SETBUILTIN("slice", &PySlice_Type);
|
|
SETBUILTIN("staticmethod", &PyStaticMethod_Type);
|
|
SETBUILTIN("str", &PyString_Type);
|
|
SETBUILTIN("super", &PySuper_Type);
|
|
SETBUILTIN("tuple", &PyTuple_Type);
|
|
SETBUILTIN("type", &PyType_Type);
|
|
SETBUILTIN("xrange", &PyRange_Type);
|
|
#ifdef Py_USING_UNICODE
|
|
SETBUILTIN("unicode", &PyUnicode_Type);
|
|
#endif
|
|
debug = PyBool_FromLong(Py_OptimizeFlag == 0);
|
|
if (PyDict_SetItemString(dict, "__debug__", debug) < 0) {
|
|
Py_XDECREF(debug);
|
|
return NULL;
|
|
}
|
|
Py_XDECREF(debug);
|
|
|
|
return mod;
|
|
#undef ADD_TO_ALL
|
|
#undef SETBUILTIN
|
|
}
|
|
|
|
/* Helper for filter(): filter a tuple through a function */
|
|
|
|
static PyObject *
|
|
filtertuple(PyObject *func, PyObject *tuple)
|
|
{
|
|
PyObject *result;
|
|
Py_ssize_t i, j;
|
|
Py_ssize_t len = PyTuple_Size(tuple);
|
|
|
|
if (len == 0) {
|
|
if (PyTuple_CheckExact(tuple))
|
|
Py_INCREF(tuple);
|
|
else
|
|
tuple = PyTuple_New(0);
|
|
return tuple;
|
|
}
|
|
|
|
if ((result = PyTuple_New(len)) == NULL)
|
|
return NULL;
|
|
|
|
for (i = j = 0; i < len; ++i) {
|
|
PyObject *item, *good;
|
|
int ok;
|
|
|
|
if (tuple->ob_type->tp_as_sequence &&
|
|
tuple->ob_type->tp_as_sequence->sq_item) {
|
|
item = tuple->ob_type->tp_as_sequence->sq_item(tuple, i);
|
|
if (item == NULL)
|
|
goto Fail_1;
|
|
} else {
|
|
PyErr_SetString(PyExc_TypeError, "filter(): unsubscriptable tuple");
|
|
goto Fail_1;
|
|
}
|
|
if (func == Py_None) {
|
|
Py_INCREF(item);
|
|
good = item;
|
|
}
|
|
else {
|
|
PyObject *arg = PyTuple_Pack(1, item);
|
|
if (arg == NULL) {
|
|
Py_DECREF(item);
|
|
goto Fail_1;
|
|
}
|
|
good = PyEval_CallObject(func, arg);
|
|
Py_DECREF(arg);
|
|
if (good == NULL) {
|
|
Py_DECREF(item);
|
|
goto Fail_1;
|
|
}
|
|
}
|
|
ok = PyObject_IsTrue(good);
|
|
Py_DECREF(good);
|
|
if (ok) {
|
|
if (PyTuple_SetItem(result, j++, item) < 0)
|
|
goto Fail_1;
|
|
}
|
|
else
|
|
Py_DECREF(item);
|
|
}
|
|
|
|
if (_PyTuple_Resize(&result, j) < 0)
|
|
return NULL;
|
|
|
|
return result;
|
|
|
|
Fail_1:
|
|
Py_DECREF(result);
|
|
return NULL;
|
|
}
|
|
|
|
|
|
/* Helper for filter(): filter a string through a function */
|
|
|
|
static PyObject *
|
|
filterstring(PyObject *func, PyObject *strobj)
|
|
{
|
|
PyObject *result;
|
|
Py_ssize_t i, j;
|
|
Py_ssize_t len = PyString_Size(strobj);
|
|
Py_ssize_t outlen = len;
|
|
|
|
if (func == Py_None) {
|
|
/* If it's a real string we can return the original,
|
|
* as no character is ever false and __getitem__
|
|
* does return this character. If it's a subclass
|
|
* we must go through the __getitem__ loop */
|
|
if (PyString_CheckExact(strobj)) {
|
|
Py_INCREF(strobj);
|
|
return strobj;
|
|
}
|
|
}
|
|
if ((result = PyString_FromStringAndSize(NULL, len)) == NULL)
|
|
return NULL;
|
|
|
|
for (i = j = 0; i < len; ++i) {
|
|
PyObject *item;
|
|
int ok;
|
|
|
|
item = (*strobj->ob_type->tp_as_sequence->sq_item)(strobj, i);
|
|
if (item == NULL)
|
|
goto Fail_1;
|
|
if (func==Py_None) {
|
|
ok = 1;
|
|
} else {
|
|
PyObject *arg, *good;
|
|
arg = PyTuple_Pack(1, item);
|
|
if (arg == NULL) {
|
|
Py_DECREF(item);
|
|
goto Fail_1;
|
|
}
|
|
good = PyEval_CallObject(func, arg);
|
|
Py_DECREF(arg);
|
|
if (good == NULL) {
|
|
Py_DECREF(item);
|
|
goto Fail_1;
|
|
}
|
|
ok = PyObject_IsTrue(good);
|
|
Py_DECREF(good);
|
|
}
|
|
if (ok) {
|
|
Py_ssize_t reslen;
|
|
if (!PyString_Check(item)) {
|
|
PyErr_SetString(PyExc_TypeError, "can't filter str to str:"
|
|
" __getitem__ returned different type");
|
|
Py_DECREF(item);
|
|
goto Fail_1;
|
|
}
|
|
reslen = PyString_GET_SIZE(item);
|
|
if (reslen == 1) {
|
|
PyString_AS_STRING(result)[j++] =
|
|
PyString_AS_STRING(item)[0];
|
|
} else {
|
|
/* do we need more space? */
|
|
Py_ssize_t need = j + reslen + len-i-1;
|
|
if (need > outlen) {
|
|
/* overallocate, to avoid reallocations */
|
|
if (need<2*outlen)
|
|
need = 2*outlen;
|
|
if (_PyString_Resize(&result, need)) {
|
|
Py_DECREF(item);
|
|
return NULL;
|
|
}
|
|
outlen = need;
|
|
}
|
|
memcpy(
|
|
PyString_AS_STRING(result) + j,
|
|
PyString_AS_STRING(item),
|
|
reslen
|
|
);
|
|
j += reslen;
|
|
}
|
|
}
|
|
Py_DECREF(item);
|
|
}
|
|
|
|
if (j < outlen)
|
|
_PyString_Resize(&result, j);
|
|
|
|
return result;
|
|
|
|
Fail_1:
|
|
Py_DECREF(result);
|
|
return NULL;
|
|
}
|
|
|
|
#ifdef Py_USING_UNICODE
|
|
/* Helper for filter(): filter a Unicode object through a function */
|
|
|
|
static PyObject *
|
|
filterunicode(PyObject *func, PyObject *strobj)
|
|
{
|
|
PyObject *result;
|
|
register Py_ssize_t i, j;
|
|
Py_ssize_t len = PyUnicode_GetSize(strobj);
|
|
Py_ssize_t outlen = len;
|
|
|
|
if (func == Py_None) {
|
|
/* If it's a real string we can return the original,
|
|
* as no character is ever false and __getitem__
|
|
* does return this character. If it's a subclass
|
|
* we must go through the __getitem__ loop */
|
|
if (PyUnicode_CheckExact(strobj)) {
|
|
Py_INCREF(strobj);
|
|
return strobj;
|
|
}
|
|
}
|
|
if ((result = PyUnicode_FromUnicode(NULL, len)) == NULL)
|
|
return NULL;
|
|
|
|
for (i = j = 0; i < len; ++i) {
|
|
PyObject *item, *arg, *good;
|
|
int ok;
|
|
|
|
item = (*strobj->ob_type->tp_as_sequence->sq_item)(strobj, i);
|
|
if (item == NULL)
|
|
goto Fail_1;
|
|
if (func == Py_None) {
|
|
ok = 1;
|
|
} else {
|
|
arg = PyTuple_Pack(1, item);
|
|
if (arg == NULL) {
|
|
Py_DECREF(item);
|
|
goto Fail_1;
|
|
}
|
|
good = PyEval_CallObject(func, arg);
|
|
Py_DECREF(arg);
|
|
if (good == NULL) {
|
|
Py_DECREF(item);
|
|
goto Fail_1;
|
|
}
|
|
ok = PyObject_IsTrue(good);
|
|
Py_DECREF(good);
|
|
}
|
|
if (ok) {
|
|
Py_ssize_t reslen;
|
|
if (!PyUnicode_Check(item)) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"can't filter unicode to unicode:"
|
|
" __getitem__ returned different type");
|
|
Py_DECREF(item);
|
|
goto Fail_1;
|
|
}
|
|
reslen = PyUnicode_GET_SIZE(item);
|
|
if (reslen == 1)
|
|
PyUnicode_AS_UNICODE(result)[j++] =
|
|
PyUnicode_AS_UNICODE(item)[0];
|
|
else {
|
|
/* do we need more space? */
|
|
Py_ssize_t need = j + reslen + len - i - 1;
|
|
if (need > outlen) {
|
|
/* overallocate,
|
|
to avoid reallocations */
|
|
if (need < 2 * outlen)
|
|
need = 2 * outlen;
|
|
if (PyUnicode_Resize(
|
|
&result, need) < 0) {
|
|
Py_DECREF(item);
|
|
goto Fail_1;
|
|
}
|
|
outlen = need;
|
|
}
|
|
memcpy(PyUnicode_AS_UNICODE(result) + j,
|
|
PyUnicode_AS_UNICODE(item),
|
|
reslen*sizeof(Py_UNICODE));
|
|
j += reslen;
|
|
}
|
|
}
|
|
Py_DECREF(item);
|
|
}
|
|
|
|
if (j < outlen)
|
|
PyUnicode_Resize(&result, j);
|
|
|
|
return result;
|
|
|
|
Fail_1:
|
|
Py_DECREF(result);
|
|
return NULL;
|
|
}
|
|
#endif
|