summaryrefslogtreecommitdiffstats
Commit message (Collapse)AuthorAgeFilesLines
* Let --with-threads be an alias for --with-thread.Guido van Rossum1997-01-212-341/+589
|
* Kill all local variables on function return. This closes a giganticGuido van Rossum1997-01-211-0/+12
| | | | | leak of memory and file descriptors (thanks for Roj for reporting that!). Alas, the speed goes down by 5%. :-(
* Don't use static buffers internally for formatstring().Guido van Rossum1997-01-211-25/+26
|
* Only call sigcheck() at the ticker code if we don't have true signals.Guido van Rossum1997-01-211-2/+6
| | | | | | | This is safe now that both intrcheck() and signalmodule.c schedule a sigcheck() call via Py_AddPendingCall(). This gives another 7% speedup (never run such a test twice ;-).
* Arrange for PyErr_CheckSignals() to be called via Py_AddPendingCall().Guido van Rossum1997-01-211-1/+3
| | | | | This avoids having to call sigcheck() (the same routine by its old name :-) in the ticker code in ceval.c's main interpreter loop.
* In the Unix version, arrange for sigcheck() to be called viaGuido van Rossum1997-01-211-0/+3
| | | | | Py_AddPendingCall(). This avoids having to call sigcheck() in the ticker code in ceval.c's main interpreter loop.
* Cleanup:Guido van Rossum1997-01-211-222/+10
| | | | | | | | | | - fix bug in Py_MakePendingCalls() with threading - fix return type of do_raise - remove build_slice (same as PySlice_New) - remove code inside #if 0 - remove code inside #ifdef CHECK_STACK - remove code inside #ifdef SUPPORT_OBSOLETE_ACCESS - comment about newimp.py should refer to ni.py
* get build info from elsewhereGuido van Rossum1997-01-201-9/+2
|
* work build# into version stringGuido van Rossum1997-01-202-2/+39
|
* Bugfix: remove ref to fast before it's defined.Guido van Rossum1997-01-201-1/+1
|
* Changes for frame object speedup:Guido van Rossum1997-01-201-14/+2
| | | | | | - get fastlocals differently - call newframeobject() with fewer arguments - toss getowner(), which was unused anyway
* Changes that appear to give another 12% speedup.Guido van Rossum1997-01-201-87/+55
| | | | | | | | | | | | Rather than allocating a list object for the fast locals and another (extensible one) for the value stack and allocating the block stack dynamically, allocate the block stack with a fixed size (CO_MAXBLOCKS from compile.h), and stick the locals and value stack at the end of the object (this is now possible since the stack size is known beforehand). Get rid of the owner field and the nvalues argument -- it is available in the code object, like nlocals. This requires small changes in ceval.c only.
* New lay-out of frame object, for fewer mallocs.Guido van Rossum1997-01-201-9/+8
| | | | See frameobject.c checkin message.
* Remove unused variable.Guido van Rossum1997-01-181-1/+0
|
* Intern the string "__complex__".Guido van Rossum1997-01-181-1/+1
|
* Intern all names and varnames in newcodeobject(), plus those stringGuido van Rossum1997-01-181-7/+22
| | | | | literals that look like identifiers. Also intern all strings used as names during the compilation.
* Intern the various string objects created to speed up lookups.Guido van Rossum1997-01-181-25/+25
|
* Intern the strings "__builtins__".Guido van Rossum1997-01-181-1/+1
|
* Intern the strings created in getattr() and setattr().Guido van Rossum1997-01-181-2/+2
|
* String interning.Guido van Rossum1997-01-183-32/+285
|
* Bump API version due to the various speedup hacks.Guido van Rossum1997-01-181-2/+4
|
* Two speedup hacks. Caching the hash saves recalculation of a string'sGuido van Rossum1997-01-181-3/+23
| | | | | | | | | | hash value. Interning strings (which requires hash caching) tries to ensure that only one string object with a given value exists, so equality tests are one pointer comparison. Together, these can speed the interpreter up by as much as 20%. Each costs the size of a long or pointer per string object. In addition, interned strings live until the end of times. If you are concerned about memory footprint, simply comment the #define out here (and rebuild everything!).
* Add "if (x != NULL) continue;" (or similar for err==0) before theGuido van Rossum1997-01-181-18/+60
| | | | | break to most cases, as suggested by Tim Peters. This gives another 8-10% speedup.
* Version 1.1. Fix memory leak and expensive comparison with None.Guido van Rossum1997-01-182-6/+44
|
* Fix the _setmode() patch for MS_WINDOWS: include <fcntl.h> and useGuido van Rossum1997-01-171-2/+6
| | | | fileno(std*).
* Remove obsolete PyFrame_ExtendStack.Guido van Rossum1997-01-171-1/+0
|
* Removed accessobject.c from file list.Guido van Rossum1997-01-171-2109/+2076
|
* Add stacksize argument to new.code().Guido van Rossum1997-01-172-6/+7
|
* Comment out extend_stack() -- it is no longer needed.Guido van Rossum1997-01-171-0/+2
|
* Marshal the new stacksize item in code objects.Guido van Rossum1997-01-171-1/+3
|
* Working semaphore implementation by Sjoerd.Guido van Rossum1997-01-171-3/+64
|
* New MAGIC number (code objects have one more item when marshalled).Guido van Rossum1997-01-171-1/+2
|
* Use the stack size from the code object and the CO_MAXBLOCKS constantGuido van Rossum1997-01-171-2/+10
| | | | from compile.h. Remove all eval stack overflow checks.
* Add co_stacksize field to codeobject structure, and stacksize argumentGuido van Rossum1997-01-171-62/+253
| | | | | | | | | | | | to PyCode_New() argument list. Move MAXBLOCKS constant to conpile.h. Added accurate calculation of the actual stack size needed by the generated code. Also commented out all fprintf statements (except for a new one to diagnose stack underflow, and one in #ifdef'ed out code), and added some new TO DO suggestions (now that the stacksize is taken of the TO DO list).
* Add co_stacksize field to codeobject structure, and stacksize argumentGuido van Rossum1997-01-171-1/+3
| | | | | to PyCode_New() argument list. Also add CO_MAXBLOCKS constant indicating the maximum static nesting supported by the compiler.
* Of course, when the type of the argument to dis() is unsupported, itGuido van Rossum1997-01-171-1/+1
| | | | should raise TypeError, not ValueError...
* More user friedly interface:Guido van Rossum1997-01-171-10/+25
| | | | | | | | | | | dis() still disassembles the last frame of the lats stack trace. dis(x) disassembles x, which may be a code object, function, or method. disassemble(co, [lasti]) disassembles a code object; the lasti argument is now optional. disco(...) is an alias for disassemble(...), for backward compatibility.
* Added Sjoerd's submitted 'ratecv' method. Made corrections for new names.Roger E. Masse1997-01-171-25/+140
| | | | Reindented.
* Make as sure as we can that the forked child does not return andGuido van Rossum1997-01-171-12/+15
| | | | continue the tests.
* Renamed, but not tested. Guido will you try your test script on this?Roger E. Masse1997-01-171-95/+94
|
* Renamed.Roger E. Masse1997-01-171-530/+584
|
* Test output for the SGI cl C module test script.Roger E. Masse1997-01-171-0/+1
|
* Lame test script for the SGI cl C module.Roger E. Masse1997-01-171-0/+78
|
* (puremodule.c): New module which exports the Purify and Quantify C APIBarry Warsaw1997-01-173-4/+1169
| | | | | | | | | | | to Python. Minimal documentation is included in comments at the top of the file, and in the Misc/PURIFY.README file. Note that this module must be statically linked since Pure doesn't provide shared stubs libraries. (Setup.in): Added commented template for pure module (syslogmodule.c): ins() function wasn't declared static.
* README file for hints on Purify'ing or Quantify'ing the PythonBarry Warsaw1997-01-161-0/+72
| | | | interpreter. It also mentions the soon to be checked in pure module.
* Already renamed. Indented.Roger E. Masse1997-01-161-471/+513
|
* Output from test script for the bsddb C extension module.Roger E. Masse1997-01-161-0/+1
|
* Test script for the bsddb C extension module.Roger E. Masse1997-01-161-0/+69
|
* Rewrote lookmapping() according to suggestions by Jyrki Alakuijala.Guido van Rossum1997-01-162-42/+142
|
* Minor output message changeRoger E. Masse1997-01-162-2/+14
|
generated by cgit v0.12 at 2024-11-28 10:51:34 (GMT)