mirror of
https://github.com/python/cpython
synced 2026-09-29 12:10:30 +03:00
Partially merge trunk into p3yk. The removal of Mac/Tools is confusing svn
merge in bad ways, so I'll have to merge that extra-carefully (probably manually.)
Merged revisions 46495-46605 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk
........
r46495 | tim.peters | 2006-05-28 03:52:38 +0200 (Sun, 28 May 2006) | 2 lines
Added missing svn:eol-style property to text files.
........
r46497 | tim.peters | 2006-05-28 12:41:29 +0200 (Sun, 28 May 2006) | 3 lines
PyErr_Display(), PyErr_WriteUnraisable(): Coverity found a cut-and-paste
bug in both: `className` was referenced before being checked for NULL.
........
r46499 | fredrik.lundh | 2006-05-28 14:06:46 +0200 (Sun, 28 May 2006) | 5 lines
needforspeed: added Py_MEMCPY macro (currently tuned for Visual C only),
and use it for string copy operations. this gives a 20% speedup on some
string benchmarks.
........
r46501 | michael.hudson | 2006-05-28 17:51:40 +0200 (Sun, 28 May 2006) | 26 lines
Quality control, meet exceptions.c.
Fix a number of problems with the need for speed code:
One is doing this sort of thing:
Py_DECREF(self->field);
self->field = newval;
Py_INCREF(self->field);
without being very sure that self->field doesn't start with a
value that has a __del__, because that almost certainly can lead
to segfaults.
As self->args is constrained to be an exact tuple we may as well
exploit this fact consistently. This leads to quite a lot of
simplification (and, hey, probably better performance).
Add some error checking in places lacking it.
Fix some rather strange indentation in the Unicode code.
Delete some trailing whitespace.
More to come, I haven't fixed all the reference leaks yet...
........
r46502 | george.yoshida | 2006-05-28 18:39:09 +0200 (Sun, 28 May 2006) | 3 lines
Patch #1080727: add "encoding" parameter to doctest.DocFileSuite
Contributed by Bjorn Tillenius.
........
r46503 | martin.v.loewis | 2006-05-28 18:57:38 +0200 (Sun, 28 May 2006) | 4 lines
Rest of patch #1490384: Commit icon source, remove
claim that Erik von Blokland is the author of the
installer picture.
........
r46504 | michael.hudson | 2006-05-28 19:40:29 +0200 (Sun, 28 May 2006) | 16 lines
Quality control, meet exceptions.c, round two.
Make some functions that should have been static static.
Fix a bunch of refleaks by fixing the definition of
MiddlingExtendsException.
Remove all the __new__ implementations apart from
BaseException_new. Rewrite most code that needs it to cope with
NULL fields (such code could get excercised anyway, the
__new__-removal just makes it more likely). This involved
editing the code for WindowsError, which I can't test.
This fixes all the refleaks in at least the start of a regrtest
-R :: run.
........
r46505 | marc-andre.lemburg | 2006-05-28 19:46:58 +0200 (Sun, 28 May 2006) | 10 lines
Initial version of systimes - a module to provide platform dependent
performance measurements.
The module is currently just a proof-of-concept implementation, but
will integrated into pybench once it is stable enough.
License: pybench license.
Author: Marc-Andre Lemburg.
........
r46507 | armin.rigo | 2006-05-28 21:13:17 +0200 (Sun, 28 May 2006) | 15 lines
("Forward-port" of r46506)
Remove various dependencies on dictionary order in the standard library
tests, and one (clearly an oversight, potentially critical) in the
standard library itself - base64.py.
Remaining open issues:
* test_extcall is an output test, messy to make robust
* tarfile.py has a potential bug here, but I'm not familiar
enough with this code. Filed in as SF bug #1496501.
* urllib2.HTTPPasswordMgr() returns a random result if there is more
than one matching root path. I'm asking python-dev for
clarification...
........
r46508 | georg.brandl | 2006-05-28 22:11:45 +0200 (Sun, 28 May 2006) | 4 lines
The empty string is a valid import path.
(fixes #1496539)
........
r46509 | georg.brandl | 2006-05-28 22:23:12 +0200 (Sun, 28 May 2006) | 3 lines
Patch #1496206: urllib2 PasswordMgr ./. default ports
........
r46510 | georg.brandl | 2006-05-28 22:57:09 +0200 (Sun, 28 May 2006) | 3 lines
Fix refleaks in UnicodeError get and set methods.
........
r46511 | michael.hudson | 2006-05-28 23:19:03 +0200 (Sun, 28 May 2006) | 3 lines
use the UnicodeError traversal and clearing functions in UnicodeError
subclasses.
........
r46512 | thomas.wouters | 2006-05-28 23:32:12 +0200 (Sun, 28 May 2006) | 4 lines
Make last patch valid C89 so Windows compilers can deal with it.
........
r46513 | georg.brandl | 2006-05-28 23:42:54 +0200 (Sun, 28 May 2006) | 3 lines
Fix ref-antileak in _struct.c which eventually lead to deallocating None.
........
r46514 | georg.brandl | 2006-05-28 23:57:35 +0200 (Sun, 28 May 2006) | 4 lines
Correct None refcount issue in Mac modules. (Are they
still used?)
........
r46515 | armin.rigo | 2006-05-29 00:07:08 +0200 (Mon, 29 May 2006) | 3 lines
A clearer error message when passing -R to regrtest.py with
release builds of Python.
........
r46516 | georg.brandl | 2006-05-29 00:14:04 +0200 (Mon, 29 May 2006) | 3 lines
Fix C function calling conventions in _sre module.
........
r46517 | georg.brandl | 2006-05-29 00:34:51 +0200 (Mon, 29 May 2006) | 3 lines
Convert audioop over to METH_VARARGS.
........
r46518 | georg.brandl | 2006-05-29 00:38:57 +0200 (Mon, 29 May 2006) | 3 lines
METH_NOARGS functions do get called with two args.
........
r46519 | georg.brandl | 2006-05-29 11:46:51 +0200 (Mon, 29 May 2006) | 4 lines
Fix refleak in socketmodule. Replace bogus Py_BuildValue calls.
Fix refleak in exceptions.
........
r46520 | nick.coghlan | 2006-05-29 14:43:05 +0200 (Mon, 29 May 2006) | 7 lines
Apply modified version of Collin Winter's patch #1478788
Renames functional extension module to _functools and adds a Python
functools module so that utility functions like update_wrapper can be
added easily.
........
r46522 | georg.brandl | 2006-05-29 15:53:16 +0200 (Mon, 29 May 2006) | 3 lines
Convert fmmodule to METH_VARARGS.
........
r46523 | georg.brandl | 2006-05-29 16:13:21 +0200 (Mon, 29 May 2006) | 3 lines
Fix #1494605.
........
r46524 | georg.brandl | 2006-05-29 16:28:05 +0200 (Mon, 29 May 2006) | 3 lines
Handle PyMem_Malloc failure in pystrtod.c. Closes #1494671.
........
r46525 | georg.brandl | 2006-05-29 16:33:55 +0200 (Mon, 29 May 2006) | 3 lines
Fix compiler warning.
........
r46526 | georg.brandl | 2006-05-29 16:39:00 +0200 (Mon, 29 May 2006) | 3 lines
Fix #1494787 (pyclbr counts whitespace as superclass name)
........
r46527 | bob.ippolito | 2006-05-29 17:47:29 +0200 (Mon, 29 May 2006) | 1 line
simplify the struct code a bit (no functional changes)
........
r46528 | armin.rigo | 2006-05-29 19:59:47 +0200 (Mon, 29 May 2006) | 2 lines
Silence a warning.
........
r46529 | georg.brandl | 2006-05-29 21:39:45 +0200 (Mon, 29 May 2006) | 3 lines
Correct some value converting strangenesses.
........
r46530 | nick.coghlan | 2006-05-29 22:27:44 +0200 (Mon, 29 May 2006) | 1 line
When adding a module like functools, it helps to let SVN know about the file.
........
r46531 | georg.brandl | 2006-05-29 22:52:54 +0200 (Mon, 29 May 2006) | 4 lines
Patches #1497027 and #972322: try HTTP digest auth first,
and watch out for handler name collisions.
........
r46532 | georg.brandl | 2006-05-29 22:57:01 +0200 (Mon, 29 May 2006) | 3 lines
Add News entry for last commit.
........
r46533 | georg.brandl | 2006-05-29 23:04:52 +0200 (Mon, 29 May 2006) | 4 lines
Make use of METH_O and METH_NOARGS where possible.
Use Py_UnpackTuple instead of PyArg_ParseTuple where possible.
........
r46534 | georg.brandl | 2006-05-29 23:58:42 +0200 (Mon, 29 May 2006) | 3 lines
Convert more modules to METH_VARARGS.
........
r46535 | georg.brandl | 2006-05-30 00:00:30 +0200 (Tue, 30 May 2006) | 3 lines
Whoops.
........
r46536 | fredrik.lundh | 2006-05-30 00:42:07 +0200 (Tue, 30 May 2006) | 4 lines
fixed "abc".count("", 100) == -96 error (hopefully, nobody's relying on
the current behaviour ;-)
........
r46537 | bob.ippolito | 2006-05-30 00:55:48 +0200 (Tue, 30 May 2006) | 1 line
struct: modulo math plus warning on all endian-explicit formats for compatibility with older struct usage (ugly)
........
r46539 | bob.ippolito | 2006-05-30 02:26:01 +0200 (Tue, 30 May 2006) | 1 line
Add a length check to aifc to ensure it doesn't write a bogus file
........
r46540 | tim.peters | 2006-05-30 04:25:25 +0200 (Tue, 30 May 2006) | 10 lines
deprecated_err(): Stop bizarre warning messages when the tests
are run in the order:
test_genexps (or any other doctest-based test)
test_struct
test_doctest
The `warnings` module needs an advertised way to save/restore
its internal filter list.
........
r46541 | tim.peters | 2006-05-30 04:26:46 +0200 (Tue, 30 May 2006) | 2 lines
Whitespace normalization.
........
r46542 | tim.peters | 2006-05-30 04:30:30 +0200 (Tue, 30 May 2006) | 2 lines
Set a binary svn:mime-type property on this UTF-8 encoded file.
........
r46543 | neal.norwitz | 2006-05-30 05:18:50 +0200 (Tue, 30 May 2006) | 1 line
Simplify further by using AddStringConstant
........
r46544 | tim.peters | 2006-05-30 06:16:25 +0200 (Tue, 30 May 2006) | 6 lines
Convert relevant dict internals to Py_ssize_t.
I don't have a box with nearly enough RAM, or an OS,
that could get close to tickling this, though (requires
a dict w/ at least 2**31 entries).
........
r46545 | neal.norwitz | 2006-05-30 06:19:21 +0200 (Tue, 30 May 2006) | 1 line
Remove stray | in comment
........
r46546 | neal.norwitz | 2006-05-30 06:25:05 +0200 (Tue, 30 May 2006) | 1 line
Use Py_SAFE_DOWNCAST for safety. Fix format strings. Remove 2 more stray | in comment
........
r46547 | neal.norwitz | 2006-05-30 06:43:23 +0200 (Tue, 30 May 2006) | 1 line
No DOWNCAST is required since sizeof(Py_ssize_t) >= sizeof(int) and Py_ReprEntr returns an int
........
r46548 | tim.peters | 2006-05-30 07:04:59 +0200 (Tue, 30 May 2006) | 3 lines
dict_print(): Explicitly narrow the return value
from a (possibly) wider variable.
........
r46549 | tim.peters | 2006-05-30 07:23:59 +0200 (Tue, 30 May 2006) | 5 lines
dict_print(): So that Neal & I don't spend the rest of
our lives taking turns rewriting code that works ;-),
get rid of casting illusions by declaring a new variable
with the obvious type.
........
r46550 | georg.brandl | 2006-05-30 09:04:55 +0200 (Tue, 30 May 2006) | 3 lines
Restore exception pickle support. #1497319.
........
r46551 | georg.brandl | 2006-05-30 09:13:29 +0200 (Tue, 30 May 2006) | 3 lines
Add a test case for exception pickling. args is never NULL.
........
r46552 | neal.norwitz | 2006-05-30 09:21:10 +0200 (Tue, 30 May 2006) | 1 line
Don't fail if the (sub)pkgname already exist.
........
r46553 | georg.brandl | 2006-05-30 09:34:45 +0200 (Tue, 30 May 2006) | 3 lines
Disallow keyword args for exceptions.
........
r46554 | neal.norwitz | 2006-05-30 09:36:54 +0200 (Tue, 30 May 2006) | 5 lines
I'm impatient. I think this will fix a few more problems with the buildbots.
I'm not sure this is the best approach, but I can't think of anything better.
If this creates problems, feel free to revert, but I think it's safe and
should make things a little better.
........
r46555 | georg.brandl | 2006-05-30 10:17:00 +0200 (Tue, 30 May 2006) | 4 lines
Do the check for no keyword arguments in __init__ so that
subclasses of Exception can be supplied keyword args
........
r46556 | georg.brandl | 2006-05-30 10:47:19 +0200 (Tue, 30 May 2006) | 3 lines
Convert test_exceptions to unittest.
........
r46557 | andrew.kuchling | 2006-05-30 14:52:01 +0200 (Tue, 30 May 2006) | 1 line
Add SoC name, and reorganize this section a bit
........
r46559 | tim.peters | 2006-05-30 17:53:34 +0200 (Tue, 30 May 2006) | 11 lines
PyLong_FromString(): Continued fraction analysis (explained in
a new comment) suggests there are almost certainly large input
integers in all non-binary input bases for which one Python digit
too few is initally allocated to hold the final result. Instead
of assert-failing when that happens, allocate more space. Alas,
I estimate it would take a few days to find a specific such case,
so this isn't backed up by a new test (not to mention that such
a case may take hours to run, since conversion time is quadratic
in the number of digits, and preliminary attempts suggested that
the smallest such inputs contain at least a million digits).
........
r46560 | fredrik.lundh | 2006-05-30 19:11:48 +0200 (Tue, 30 May 2006) | 3 lines
changed find/rfind to return -1 for matches outside the source string
........
r46561 | bob.ippolito | 2006-05-30 19:37:54 +0200 (Tue, 30 May 2006) | 1 line
Change wrapping terminology to overflow masking
........
r46562 | fredrik.lundh | 2006-05-30 19:39:58 +0200 (Tue, 30 May 2006) | 3 lines
changed count to return 0 for slices outside the source string
........
r46568 | tim.peters | 2006-05-31 01:28:02 +0200 (Wed, 31 May 2006) | 2 lines
Whitespace normalization.
........
r46569 | brett.cannon | 2006-05-31 04:19:54 +0200 (Wed, 31 May 2006) | 5 lines
Clarify wording on default values for strptime(); defaults are used when better
values cannot be inferred.
Closes bug #1496315.
........
r46572 | neal.norwitz | 2006-05-31 09:43:27 +0200 (Wed, 31 May 2006) | 1 line
Calculate smallest properly (it was off by one) and use proper ssize_t types for Win64
........
r46573 | neal.norwitz | 2006-05-31 10:01:08 +0200 (Wed, 31 May 2006) | 1 line
Revert last checkin, it is better to do make distclean
........
r46574 | neal.norwitz | 2006-05-31 11:02:44 +0200 (Wed, 31 May 2006) | 3 lines
On 64-bit platforms running test_struct after test_tarfile would fail
since the deprecation warning wouldn't be raised.
........
r46575 | thomas.heller | 2006-05-31 13:37:58 +0200 (Wed, 31 May 2006) | 3 lines
PyTuple_Pack is not available in Python 2.3, but ctypes must stay
compatible with that.
........
r46576 | andrew.kuchling | 2006-05-31 15:18:56 +0200 (Wed, 31 May 2006) | 1 line
'functional' module was renamed to 'functools'
........
r46577 | kristjan.jonsson | 2006-05-31 15:35:41 +0200 (Wed, 31 May 2006) | 1 line
Fixup the PCBuild8 project directory. exceptions.c have moved to Objects, and the functionalmodule.c has been replaced with _functoolsmodule.c. Other minor changes to .vcproj files and .sln to fix compilation
........
r46578 | andrew.kuchling | 2006-05-31 16:08:48 +0200 (Wed, 31 May 2006) | 15 lines
[Bug #1473048]
SimpleXMLRPCServer and DocXMLRPCServer don't look at
the path of the HTTP request at all; you can POST or
GET from / or /RPC2 or /blahblahblah with the same results.
Security scanners that look for /cgi-bin/phf will therefore report
lots of vulnerabilities.
Fix: add a .rpc_paths attribute to the SimpleXMLRPCServer class,
and report a 404 error if the path isn't on the allowed list.
Possibly-controversial aspect of this change: the default makes only
'/' and '/RPC2' legal. Maybe this will break people's applications
(though I doubt it). We could just set the default to an empty tuple,
which would exactly match the current behaviour.
........
r46579 | andrew.kuchling | 2006-05-31 16:12:47 +0200 (Wed, 31 May 2006) | 1 line
Mention SimpleXMLRPCServer change
........
r46580 | tim.peters | 2006-05-31 16:28:07 +0200 (Wed, 31 May 2006) | 2 lines
Trimmed trailing whitespace.
........
r46581 | tim.peters | 2006-05-31 17:33:22 +0200 (Wed, 31 May 2006) | 4 lines
_range_error(): Speed and simplify (there's no real need for
loops here). Assert that size_t is actually big enough, and
that f->size is at least one. Wrap a long line.
........
r46582 | tim.peters | 2006-05-31 17:34:37 +0200 (Wed, 31 May 2006) | 2 lines
Repaired error in new comment.
........
r46584 | neal.norwitz | 2006-06-01 07:32:49 +0200 (Thu, 01 Jun 2006) | 4 lines
Remove ; at end of macro. There was a compiler recently that warned
about extra semi-colons. It may have been the HP C compiler.
This file will trigger a bunch of those warnings now.
........
r46585 | georg.brandl | 2006-06-01 08:39:19 +0200 (Thu, 01 Jun 2006) | 3 lines
Correctly unpickle 2.4 exceptions via __setstate__ (patch #1498571)
........
r46586 | georg.brandl | 2006-06-01 10:27:32 +0200 (Thu, 01 Jun 2006) | 3 lines
Correctly allocate complex types with tp_alloc. (bug #1498638)
........
r46587 | georg.brandl | 2006-06-01 14:30:46 +0200 (Thu, 01 Jun 2006) | 2 lines
Correctly dispatch Faults in loads (patch #1498627)
........
r46588 | georg.brandl | 2006-06-01 15:00:49 +0200 (Thu, 01 Jun 2006) | 3 lines
Some code style tweaks, and remove apply.
........
r46589 | armin.rigo | 2006-06-01 15:19:12 +0200 (Thu, 01 Jun 2006) | 5 lines
[ 1497053 ] Let dicts propagate the exceptions in user __eq__().
[ 1456209 ] dictresize() vulnerability ( <- backport candidate ).
........
r46590 | tim.peters | 2006-06-01 15:41:46 +0200 (Thu, 01 Jun 2006) | 2 lines
Whitespace normalization.
........
r46591 | tim.peters | 2006-06-01 15:49:23 +0200 (Thu, 01 Jun 2006) | 2 lines
Record bugs 1275608 and 1456209 as being fixed.
........
r46592 | tim.peters | 2006-06-01 15:56:26 +0200 (Thu, 01 Jun 2006) | 5 lines
Re-enable a new empty-string test added during the NFS sprint,
but disabled then because str and unicode strings gave different
results. The implementations were repaired later during the
sprint, but the new test remained disabled.
........
r46594 | tim.peters | 2006-06-01 17:50:44 +0200 (Thu, 01 Jun 2006) | 7 lines
Armin committed his patch while I was reviewing it (I'm sure
he didn't know this), so merged in some changes I made during
review. Nothing material apart from changing a new `mask` local
from int to Py_ssize_t. Mostly this is repairing comments that
were made incorrect, and adding new comments. Also a few
minor code rewrites for clarity or helpful succinctness.
........
r46599 | neal.norwitz | 2006-06-02 06:45:53 +0200 (Fri, 02 Jun 2006) | 1 line
Convert docstrings to comments so regrtest -v prints method names
........
r46600 | neal.norwitz | 2006-06-02 06:50:49 +0200 (Fri, 02 Jun 2006) | 2 lines
Fix memory leak found by valgrind.
........
r46601 | neal.norwitz | 2006-06-02 06:54:52 +0200 (Fri, 02 Jun 2006) | 1 line
More memory leaks from valgrind
........
r46602 | neal.norwitz | 2006-06-02 08:23:00 +0200 (Fri, 02 Jun 2006) | 11 lines
Patch #1357836:
Prevent an invalid memory read from test_coding in case the done flag is set.
In that case, the loop isn't entered. I wonder if rather than setting
the done flag in the cases before the loop, if they should just exit early.
This code looks like it should be refactored.
Backport candidate (also the early break above if decoding_fgets fails)
........
r46603 | martin.blais | 2006-06-02 15:03:43 +0200 (Fri, 02 Jun 2006) | 1 line
Fixed struct test to not use unittest.
........
r46605 | tim.peters | 2006-06-03 01:22:51 +0200 (Sat, 03 Jun 2006) | 10 lines
pprint functions used to sort a dict (by key) if and only if
the output required more than one line. "Small" dicts got
displayed in seemingly random order (the hash-induced order
produced by dict.__repr__). None of this was documented.
Now pprint functions always sort dicts by key, and the docs
promise it.
This was proposed and agreed to during the PyCon 2006 core
sprint -- I just didn't have time for it before now.
........
This commit is contained in:
Thomas Wouters
parent
60254fe844
commit
4d70c3d9dd
139 changed files with 13142 additions and 12152 deletions
|
|
@ -1136,9 +1136,9 @@ instance_ass_item(PyInstanceObject *inst, Py_ssize_t i, PyObject *item)
|
|||
if (func == NULL)
|
||||
return -1;
|
||||
if (item == NULL)
|
||||
arg = Py_BuildValue("i", i);
|
||||
arg = PyInt_FromSsize_t(i);
|
||||
else
|
||||
arg = Py_BuildValue("(iO)", i, item);
|
||||
arg = Py_BuildValue("(nO)", i, item);
|
||||
if (arg == NULL) {
|
||||
Py_DECREF(func);
|
||||
return -1;
|
||||
|
|
|
|||
|
|
@ -188,7 +188,7 @@ complex_subtype_from_c_complex(PyTypeObject *type, Py_complex cval)
|
|||
{
|
||||
PyObject *op;
|
||||
|
||||
op = PyType_GenericAlloc(type, 0);
|
||||
op = type->tp_alloc(type, 0);
|
||||
if (op != NULL)
|
||||
((PyComplexObject *)op)->cval = cval;
|
||||
return op;
|
||||
|
|
@ -1000,7 +1000,7 @@ PyTypeObject PyComplex_Type = {
|
|||
0, /* tp_descr_set */
|
||||
0, /* tp_dictoffset */
|
||||
0, /* tp_init */
|
||||
0, /* tp_alloc */
|
||||
PyType_GenericAlloc, /* tp_alloc */
|
||||
complex_new, /* tp_new */
|
||||
PyObject_Del, /* tp_free */
|
||||
};
|
||||
|
|
|
|||
|
|
@ -110,6 +110,16 @@ above, and then shifting perturb can be done while the table index is being
|
|||
masked); and the dictobject struct required a member to hold the table's
|
||||
polynomial. In Tim's experiments the current scheme ran faster, produced
|
||||
equally good collision statistics, needed less code & used less memory.
|
||||
|
||||
Theoretical Python 2.5 headache: hash codes are only C "long", but
|
||||
sizeof(Py_ssize_t) > sizeof(long) may be possible. In that case, and if a
|
||||
dict is genuinely huge, then only the slots directly reachable via indexing
|
||||
by a C long can be the first slot in a probe sequence. The probe sequence
|
||||
will still eventually reach every slot in the table, but the collision rate
|
||||
on initial probes may be much higher than this scheme was designed for.
|
||||
Getting a hash code as fat as Py_ssize_t is the only real cure. But in
|
||||
practice, this probably won't make a lick of difference for many years (at
|
||||
which point everyone will have terabytes of RAM on 64-bit boxes).
|
||||
*/
|
||||
|
||||
/* Object used as dummy key to fill deleted entries */
|
||||
|
|
@ -217,49 +227,43 @@ All arithmetic on hash should ignore overflow.
|
|||
contributions by Reimer Behrends, Jyrki Alakuijala, Vladimir Marangozov and
|
||||
Christian Tismer).
|
||||
|
||||
This function must never return NULL; failures are indicated by returning
|
||||
a dictentry* for which the me_value field is NULL. Exceptions are never
|
||||
reported by this function, and outstanding exceptions are maintained.
|
||||
lookdict() is general-purpose, and may return NULL if (and only if) a
|
||||
comparison raises an exception (this was new in Python 2.5).
|
||||
lookdict_string() below is specialized to string keys, comparison of which can
|
||||
never raise an exception; that function can never return NULL. For both, when
|
||||
the key isn't found a dictentry* is returned for which the me_value field is
|
||||
NULL; this is the slot in the dict at which the key would have been found, and
|
||||
the caller can (if it wishes) add the <key, value> pair to the returned
|
||||
dictentry*.
|
||||
*/
|
||||
|
||||
static dictentry *
|
||||
lookdict(dictobject *mp, PyObject *key, register long hash)
|
||||
{
|
||||
register Py_ssize_t i;
|
||||
register size_t i;
|
||||
register size_t perturb;
|
||||
register dictentry *freeslot;
|
||||
register unsigned int mask = mp->ma_mask;
|
||||
register size_t mask = (size_t)mp->ma_mask;
|
||||
dictentry *ep0 = mp->ma_table;
|
||||
register dictentry *ep;
|
||||
register int restore_error;
|
||||
register int checked_error;
|
||||
register int cmp;
|
||||
PyObject *err_type, *err_value, *err_tb;
|
||||
PyObject *startkey;
|
||||
|
||||
i = hash & mask;
|
||||
i = (size_t)hash & mask;
|
||||
ep = &ep0[i];
|
||||
if (ep->me_key == NULL || ep->me_key == key)
|
||||
return ep;
|
||||
|
||||
restore_error = checked_error = 0;
|
||||
if (ep->me_key == dummy)
|
||||
freeslot = ep;
|
||||
else {
|
||||
if (ep->me_hash == hash) {
|
||||
/* error can't have been checked yet */
|
||||
checked_error = 1;
|
||||
if (PyErr_Occurred()) {
|
||||
restore_error = 1;
|
||||
PyErr_Fetch(&err_type, &err_value, &err_tb);
|
||||
}
|
||||
startkey = ep->me_key;
|
||||
cmp = PyObject_RichCompareBool(startkey, key, Py_EQ);
|
||||
if (cmp < 0)
|
||||
PyErr_Clear();
|
||||
return NULL;
|
||||
if (ep0 == mp->ma_table && ep->me_key == startkey) {
|
||||
if (cmp > 0)
|
||||
goto Done;
|
||||
return ep;
|
||||
}
|
||||
else {
|
||||
/* The compare did major nasty stuff to the
|
||||
|
|
@ -267,8 +271,7 @@ lookdict(dictobject *mp, PyObject *key, register long hash)
|
|||
* XXX A clever adversary could prevent this
|
||||
* XXX from terminating.
|
||||
*/
|
||||
ep = lookdict(mp, key, hash);
|
||||
goto Done;
|
||||
return lookdict(mp, key, hash);
|
||||
}
|
||||
}
|
||||
freeslot = NULL;
|
||||
|
|
@ -279,29 +282,18 @@ lookdict(dictobject *mp, PyObject *key, register long hash)
|
|||
for (perturb = hash; ; perturb >>= PERTURB_SHIFT) {
|
||||
i = (i << 2) + i + perturb + 1;
|
||||
ep = &ep0[i & mask];
|
||||
if (ep->me_key == NULL) {
|
||||
if (freeslot != NULL)
|
||||
ep = freeslot;
|
||||
break;
|
||||
}
|
||||
if (ep->me_key == NULL)
|
||||
return freeslot == NULL ? ep : freeslot;
|
||||
if (ep->me_key == key)
|
||||
break;
|
||||
return ep;
|
||||
if (ep->me_hash == hash && ep->me_key != dummy) {
|
||||
if (!checked_error) {
|
||||
checked_error = 1;
|
||||
if (PyErr_Occurred()) {
|
||||
restore_error = 1;
|
||||
PyErr_Fetch(&err_type, &err_value,
|
||||
&err_tb);
|
||||
}
|
||||
}
|
||||
startkey = ep->me_key;
|
||||
cmp = PyObject_RichCompareBool(startkey, key, Py_EQ);
|
||||
if (cmp < 0)
|
||||
PyErr_Clear();
|
||||
return NULL;
|
||||
if (ep0 == mp->ma_table && ep->me_key == startkey) {
|
||||
if (cmp > 0)
|
||||
break;
|
||||
return ep;
|
||||
}
|
||||
else {
|
||||
/* The compare did major nasty stuff to the
|
||||
|
|
@ -309,37 +301,30 @@ lookdict(dictobject *mp, PyObject *key, register long hash)
|
|||
* XXX A clever adversary could prevent this
|
||||
* XXX from terminating.
|
||||
*/
|
||||
ep = lookdict(mp, key, hash);
|
||||
break;
|
||||
return lookdict(mp, key, hash);
|
||||
}
|
||||
}
|
||||
else if (ep->me_key == dummy && freeslot == NULL)
|
||||
freeslot = ep;
|
||||
}
|
||||
|
||||
Done:
|
||||
if (restore_error)
|
||||
PyErr_Restore(err_type, err_value, err_tb);
|
||||
return ep;
|
||||
}
|
||||
|
||||
/*
|
||||
* Hacked up version of lookdict which can assume keys are always strings;
|
||||
* this assumption allows testing for errors during PyObject_Compare() to
|
||||
* be dropped; string-string comparisons never raise exceptions. This also
|
||||
* means we don't need to go through PyObject_Compare(); we can always use
|
||||
* _PyString_Eq directly.
|
||||
* this assumption allows testing for errors during PyObject_RichCompareBool()
|
||||
* to be dropped; string-string comparisons never raise exceptions. This also
|
||||
* means we don't need to go through PyObject_RichCompareBool(); we can always
|
||||
* use _PyString_Eq() directly.
|
||||
*
|
||||
* This is valuable because the general-case error handling in lookdict() is
|
||||
* expensive, and dicts with pure-string keys are very common.
|
||||
* This is valuable because dicts with only string keys are very common.
|
||||
*/
|
||||
static dictentry *
|
||||
lookdict_string(dictobject *mp, PyObject *key, register long hash)
|
||||
{
|
||||
register Py_ssize_t i;
|
||||
register size_t i;
|
||||
register size_t perturb;
|
||||
register dictentry *freeslot;
|
||||
register unsigned int mask = mp->ma_mask;
|
||||
register size_t mask = (size_t)mp->ma_mask;
|
||||
dictentry *ep0 = mp->ma_table;
|
||||
register dictentry *ep;
|
||||
|
||||
|
|
@ -361,10 +346,8 @@ lookdict_string(dictobject *mp, PyObject *key, register long hash)
|
|||
if (ep->me_key == dummy)
|
||||
freeslot = ep;
|
||||
else {
|
||||
if (ep->me_hash == hash
|
||||
&& _PyString_Eq(ep->me_key, key)) {
|
||||
if (ep->me_hash == hash && _PyString_Eq(ep->me_key, key))
|
||||
return ep;
|
||||
}
|
||||
freeslot = NULL;
|
||||
}
|
||||
|
||||
|
|
@ -389,8 +372,9 @@ lookdict_string(dictobject *mp, PyObject *key, register long hash)
|
|||
Internal routine to insert a new item into the table.
|
||||
Used both by the internal resize routine and by the public insert routine.
|
||||
Eats a reference to key and one to value.
|
||||
Returns -1 if an error occurred, or 0 on success.
|
||||
*/
|
||||
static void
|
||||
static int
|
||||
insertdict(register dictobject *mp, PyObject *key, long hash, PyObject *value)
|
||||
{
|
||||
PyObject *old_value;
|
||||
|
|
@ -399,6 +383,11 @@ insertdict(register dictobject *mp, PyObject *key, long hash, PyObject *value)
|
|||
|
||||
assert(mp->ma_lookup != NULL);
|
||||
ep = mp->ma_lookup(mp, key, hash);
|
||||
if (ep == NULL) {
|
||||
Py_DECREF(key);
|
||||
Py_DECREF(value);
|
||||
return -1;
|
||||
}
|
||||
if (ep->me_value != NULL) {
|
||||
old_value = ep->me_value;
|
||||
ep->me_value = value;
|
||||
|
|
@ -413,10 +402,43 @@ insertdict(register dictobject *mp, PyObject *key, long hash, PyObject *value)
|
|||
Py_DECREF(dummy);
|
||||
}
|
||||
ep->me_key = key;
|
||||
ep->me_hash = hash;
|
||||
ep->me_hash = (Py_ssize_t)hash;
|
||||
ep->me_value = value;
|
||||
mp->ma_used++;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
Internal routine used by dictresize() to insert an item which is
|
||||
known to be absent from the dict. This routine also assumes that
|
||||
the dict contains no deleted entries. Besides the performance benefit,
|
||||
using insertdict() in dictresize() is dangerous (SF bug #1456209).
|
||||
Note that no refcounts are changed by this routine; if needed, the caller
|
||||
is responsible for incref'ing `key` and `value`.
|
||||
*/
|
||||
static void
|
||||
insertdict_clean(register dictobject *mp, PyObject *key, long hash,
|
||||
PyObject *value)
|
||||
{
|
||||
register size_t i;
|
||||
register size_t perturb;
|
||||
register size_t mask = (size_t)mp->ma_mask;
|
||||
dictentry *ep0 = mp->ma_table;
|
||||
register dictentry *ep;
|
||||
|
||||
i = hash & mask;
|
||||
ep = &ep0[i];
|
||||
for (perturb = hash; ep->me_key != NULL; perturb >>= PERTURB_SHIFT) {
|
||||
i = (i << 2) + i + perturb + 1;
|
||||
ep = &ep0[i & mask];
|
||||
}
|
||||
assert(ep->me_value == NULL);
|
||||
mp->ma_fill++;
|
||||
ep->me_key = key;
|
||||
ep->me_hash = (Py_ssize_t)hash;
|
||||
ep->me_value = value;
|
||||
mp->ma_used++;
|
||||
}
|
||||
|
||||
/*
|
||||
|
|
@ -425,11 +447,11 @@ items again. When entries have been deleted, the new table may
|
|||
actually be smaller than the old one.
|
||||
*/
|
||||
static int
|
||||
dictresize(dictobject *mp, int minused)
|
||||
dictresize(dictobject *mp, Py_ssize_t minused)
|
||||
{
|
||||
int newsize;
|
||||
Py_ssize_t newsize;
|
||||
dictentry *oldtable, *newtable, *ep;
|
||||
int i;
|
||||
Py_ssize_t i;
|
||||
int is_oldtable_malloced;
|
||||
dictentry small_copy[PyDict_MINSIZE];
|
||||
|
||||
|
|
@ -491,7 +513,8 @@ dictresize(dictobject *mp, int minused)
|
|||
for (ep = oldtable; i > 0; ep++) {
|
||||
if (ep->me_value != NULL) { /* active entry */
|
||||
--i;
|
||||
insertdict(mp, ep->me_key, ep->me_hash, ep->me_value);
|
||||
insertdict_clean(mp, ep->me_key, (long)ep->me_hash,
|
||||
ep->me_value);
|
||||
}
|
||||
else if (ep->me_key != NULL) { /* dummy entry */
|
||||
--i;
|
||||
|
|
@ -506,14 +529,25 @@ dictresize(dictobject *mp, int minused)
|
|||
return 0;
|
||||
}
|
||||
|
||||
/* Note that, for historical reasons, PyDict_GetItem() suppresses all errors
|
||||
* that may occur (originally dicts supported only string keys, and exceptions
|
||||
* weren't possible). So, while the original intent was that a NULL return
|
||||
* meant the key wasn't present, it reality it can mean that, or that an error
|
||||
* (suppressed) occurred while computing the key's hash, or that some error
|
||||
* (suppressed) occurred when comparing keys in the dict's internal probe
|
||||
* sequence. A nasty example of the latter is when a Python-coded comparison
|
||||
* function hits a stack-depth error, which can cause this to return NULL
|
||||
* even if the key is present.
|
||||
*/
|
||||
PyObject *
|
||||
PyDict_GetItem(PyObject *op, PyObject *key)
|
||||
{
|
||||
long hash;
|
||||
dictobject *mp = (dictobject *)op;
|
||||
if (!PyDict_Check(op)) {
|
||||
dictentry *ep;
|
||||
PyThreadState *tstate;
|
||||
if (!PyDict_Check(op))
|
||||
return NULL;
|
||||
}
|
||||
if (!PyString_CheckExact(key) ||
|
||||
(hash = ((PyStringObject *) key)->ob_shash) == -1)
|
||||
{
|
||||
|
|
@ -523,7 +557,29 @@ PyDict_GetItem(PyObject *op, PyObject *key)
|
|||
return NULL;
|
||||
}
|
||||
}
|
||||
return (mp->ma_lookup)(mp, key, hash)->me_value;
|
||||
|
||||
/* We can arrive here with a NULL tstate during initialization:
|
||||
try running "python -Wi" for an example related to string
|
||||
interning. Let's just hope that no exception occurs then... */
|
||||
tstate = PyThreadState_GET();
|
||||
if (tstate != NULL && tstate->curexc_type != NULL) {
|
||||
/* preserve the existing exception */
|
||||
PyObject *err_type, *err_value, *err_tb;
|
||||
PyErr_Fetch(&err_type, &err_value, &err_tb);
|
||||
ep = (mp->ma_lookup)(mp, key, hash);
|
||||
/* ignore errors */
|
||||
PyErr_Restore(err_type, err_value, err_tb);
|
||||
if (ep == NULL)
|
||||
return NULL;
|
||||
}
|
||||
else {
|
||||
ep = (mp->ma_lookup)(mp, key, hash);
|
||||
if (ep == NULL) {
|
||||
PyErr_Clear();
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
return ep->me_value;
|
||||
}
|
||||
|
||||
/* CAUTION: PyDict_SetItem() must guarantee that it won't resize the
|
||||
|
|
@ -537,7 +593,7 @@ PyDict_SetItem(register PyObject *op, PyObject *key, PyObject *value)
|
|||
{
|
||||
register dictobject *mp;
|
||||
register long hash;
|
||||
register int n_used;
|
||||
register Py_ssize_t n_used;
|
||||
|
||||
if (!PyDict_Check(op)) {
|
||||
PyErr_BadInternalCall();
|
||||
|
|
@ -558,7 +614,8 @@ PyDict_SetItem(register PyObject *op, PyObject *key, PyObject *value)
|
|||
n_used = mp->ma_used;
|
||||
Py_INCREF(value);
|
||||
Py_INCREF(key);
|
||||
insertdict(mp, key, hash, value);
|
||||
if (insertdict(mp, key, hash, value) != 0)
|
||||
return -1;
|
||||
/* If we added a key, we can safely resize. Otherwise just return!
|
||||
* If fill >= 2/3 size, adjust size. Normally, this doubles or
|
||||
* quaduples the size, but it's also possible for the dict to shrink
|
||||
|
|
@ -575,7 +632,7 @@ PyDict_SetItem(register PyObject *op, PyObject *key, PyObject *value)
|
|||
*/
|
||||
if (!(mp->ma_used > n_used && mp->ma_fill*3 >= (mp->ma_mask+1)*2))
|
||||
return 0;
|
||||
return dictresize(mp, (mp->ma_used>50000 ? mp->ma_used*2 : mp->ma_used*4));
|
||||
return dictresize(mp, (mp->ma_used > 50000 ? 2 : 4) * mp->ma_used);
|
||||
}
|
||||
|
||||
int
|
||||
|
|
@ -598,6 +655,8 @@ PyDict_DelItem(PyObject *op, PyObject *key)
|
|||
}
|
||||
mp = (dictobject *)op;
|
||||
ep = (mp->ma_lookup)(mp, key, hash);
|
||||
if (ep == NULL)
|
||||
return -1;
|
||||
if (ep->me_value == NULL) {
|
||||
PyErr_SetObject(PyExc_KeyError, key);
|
||||
return -1;
|
||||
|
|
@ -619,10 +678,10 @@ PyDict_Clear(PyObject *op)
|
|||
dictobject *mp;
|
||||
dictentry *ep, *table;
|
||||
int table_is_malloced;
|
||||
int fill;
|
||||
Py_ssize_t fill;
|
||||
dictentry small_copy[PyDict_MINSIZE];
|
||||
#ifdef Py_DEBUG
|
||||
int i, n;
|
||||
Py_ssize_t i, n;
|
||||
#endif
|
||||
|
||||
if (!PyDict_Check(op))
|
||||
|
|
@ -685,7 +744,7 @@ PyDict_Clear(PyObject *op)
|
|||
/*
|
||||
* Iterate over a dict. Use like so:
|
||||
*
|
||||
* int i;
|
||||
* Py_ssize_t i;
|
||||
* PyObject *key, *value;
|
||||
* i = 0; # important! i should not otherwise be changed by you
|
||||
* while (PyDict_Next(yourdict, &i, &key, &value)) {
|
||||
|
|
@ -701,7 +760,7 @@ int
|
|||
PyDict_Next(PyObject *op, Py_ssize_t *ppos, PyObject **pkey, PyObject **pvalue)
|
||||
{
|
||||
register Py_ssize_t i;
|
||||
register int mask;
|
||||
register Py_ssize_t mask;
|
||||
register dictentry *ep;
|
||||
|
||||
if (!PyDict_Check(op))
|
||||
|
|
@ -729,7 +788,7 @@ static void
|
|||
dict_dealloc(register dictobject *mp)
|
||||
{
|
||||
register dictentry *ep;
|
||||
int fill = mp->ma_fill;
|
||||
Py_ssize_t fill = mp->ma_fill;
|
||||
PyObject_GC_UnTrack(mp);
|
||||
Py_TRASHCAN_SAFE_BEGIN(mp)
|
||||
for (ep = mp->ma_table; fill > 0; ep++) {
|
||||
|
|
@ -751,13 +810,14 @@ dict_dealloc(register dictobject *mp)
|
|||
static int
|
||||
dict_print(register dictobject *mp, register FILE *fp, register int flags)
|
||||
{
|
||||
register int i;
|
||||
register int any;
|
||||
register Py_ssize_t i;
|
||||
register Py_ssize_t any;
|
||||
int status;
|
||||
|
||||
i = Py_ReprEnter((PyObject*)mp);
|
||||
if (i != 0) {
|
||||
if (i < 0)
|
||||
return i;
|
||||
status = Py_ReprEnter((PyObject*)mp);
|
||||
if (status != 0) {
|
||||
if (status < 0)
|
||||
return status;
|
||||
fprintf(fp, "{...}");
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -882,6 +942,7 @@ dict_subscript(dictobject *mp, register PyObject *key)
|
|||
{
|
||||
PyObject *v;
|
||||
long hash;
|
||||
dictentry *ep;
|
||||
assert(mp->ma_table != NULL);
|
||||
if (!PyString_CheckExact(key) ||
|
||||
(hash = ((PyStringObject *) key)->ob_shash) == -1) {
|
||||
|
|
@ -889,14 +950,17 @@ dict_subscript(dictobject *mp, register PyObject *key)
|
|||
if (hash == -1)
|
||||
return NULL;
|
||||
}
|
||||
v = (mp->ma_lookup)(mp, key, hash) -> me_value;
|
||||
ep = (mp->ma_lookup)(mp, key, hash);
|
||||
if (ep == NULL)
|
||||
return NULL;
|
||||
v = ep->me_value;
|
||||
if (v == NULL) {
|
||||
if (!PyDict_CheckExact(mp)) {
|
||||
/* Look up __missing__ method if we're a subclass. */
|
||||
PyObject *missing;
|
||||
static PyObject *missing_str = NULL;
|
||||
if (missing_str == NULL)
|
||||
missing_str =
|
||||
missing_str =
|
||||
PyString_InternFromString("__missing__");
|
||||
missing = _PyType_Lookup(mp->ob_type, missing_str);
|
||||
if (missing != NULL)
|
||||
|
|
@ -930,9 +994,9 @@ static PyObject *
|
|||
dict_keys(register dictobject *mp)
|
||||
{
|
||||
register PyObject *v;
|
||||
register int i, j;
|
||||
register Py_ssize_t i, j;
|
||||
dictentry *ep;
|
||||
int mask, n;
|
||||
Py_ssize_t mask, n;
|
||||
|
||||
again:
|
||||
n = mp->ma_used;
|
||||
|
|
@ -964,9 +1028,9 @@ static PyObject *
|
|||
dict_values(register dictobject *mp)
|
||||
{
|
||||
register PyObject *v;
|
||||
register int i, j;
|
||||
register Py_ssize_t i, j;
|
||||
dictentry *ep;
|
||||
int mask, n;
|
||||
Py_ssize_t mask, n;
|
||||
|
||||
again:
|
||||
n = mp->ma_used;
|
||||
|
|
@ -998,8 +1062,8 @@ static PyObject *
|
|||
dict_items(register dictobject *mp)
|
||||
{
|
||||
register PyObject *v;
|
||||
register int i, j, n;
|
||||
int mask;
|
||||
register Py_ssize_t i, j, n;
|
||||
Py_ssize_t mask;
|
||||
PyObject *item, *key, *value;
|
||||
dictentry *ep;
|
||||
|
||||
|
|
@ -1132,7 +1196,7 @@ int
|
|||
PyDict_MergeFromSeq2(PyObject *d, PyObject *seq2, int override)
|
||||
{
|
||||
PyObject *it; /* iter(seq2) */
|
||||
int i; /* index into seq2 of current element */
|
||||
Py_ssize_t i; /* index into seq2 of current element */
|
||||
PyObject *item; /* seq2[i] */
|
||||
PyObject *fast; /* item as a 2-tuple or 2-list */
|
||||
|
||||
|
|
@ -1162,14 +1226,14 @@ PyDict_MergeFromSeq2(PyObject *d, PyObject *seq2, int override)
|
|||
if (PyErr_ExceptionMatches(PyExc_TypeError))
|
||||
PyErr_Format(PyExc_TypeError,
|
||||
"cannot convert dictionary update "
|
||||
"sequence element #%d to a sequence",
|
||||
"sequence element #%zd to a sequence",
|
||||
i);
|
||||
goto Fail;
|
||||
}
|
||||
n = PySequence_Fast_GET_SIZE(fast);
|
||||
if (n != 2) {
|
||||
PyErr_Format(PyExc_ValueError,
|
||||
"dictionary update sequence element #%d "
|
||||
"dictionary update sequence element #%zd "
|
||||
"has length %zd; 2 is required",
|
||||
i, n);
|
||||
goto Fail;
|
||||
|
|
@ -1195,7 +1259,7 @@ Fail:
|
|||
i = -1;
|
||||
Return:
|
||||
Py_DECREF(it);
|
||||
return i;
|
||||
return Py_SAFE_DOWNCAST(i, Py_ssize_t, int);
|
||||
}
|
||||
|
||||
int
|
||||
|
|
@ -1208,7 +1272,7 @@ int
|
|||
PyDict_Merge(PyObject *a, PyObject *b, int override)
|
||||
{
|
||||
register PyDictObject *mp, *other;
|
||||
register int i;
|
||||
register Py_ssize_t i;
|
||||
dictentry *entry;
|
||||
|
||||
/* We accept for the argument either a concrete dictionary object,
|
||||
|
|
@ -1247,8 +1311,10 @@ PyDict_Merge(PyObject *a, PyObject *b, int override)
|
|||
PyDict_GetItem(a, entry->me_key) == NULL)) {
|
||||
Py_INCREF(entry->me_key);
|
||||
Py_INCREF(entry->me_value);
|
||||
insertdict(mp, entry->me_key, entry->me_hash,
|
||||
entry->me_value);
|
||||
if (insertdict(mp, entry->me_key,
|
||||
(long)entry->me_hash,
|
||||
entry->me_value) != 0)
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -1376,7 +1442,8 @@ characterize(dictobject *a, dictobject *b, PyObject **pval)
|
|||
{
|
||||
PyObject *akey = NULL; /* smallest key in a s.t. a[akey] != b[akey] */
|
||||
PyObject *aval = NULL; /* a[akey] */
|
||||
int i, cmp;
|
||||
Py_ssize_t i;
|
||||
int cmp;
|
||||
|
||||
for (i = 0; i <= a->ma_mask; i++) {
|
||||
PyObject *thiskey, *thisaval, *thisbval;
|
||||
|
|
@ -1499,7 +1566,7 @@ Finished:
|
|||
static int
|
||||
dict_equal(dictobject *a, dictobject *b)
|
||||
{
|
||||
int i;
|
||||
Py_ssize_t i;
|
||||
|
||||
if (a->ma_used != b->ma_used)
|
||||
/* can't be equal if # of entries differ */
|
||||
|
|
@ -1554,15 +1621,18 @@ static PyObject *
|
|||
dict_has_key(register dictobject *mp, PyObject *key)
|
||||
{
|
||||
long hash;
|
||||
register long ok;
|
||||
dictentry *ep;
|
||||
|
||||
if (!PyString_CheckExact(key) ||
|
||||
(hash = ((PyStringObject *) key)->ob_shash) == -1) {
|
||||
hash = PyObject_Hash(key);
|
||||
if (hash == -1)
|
||||
return NULL;
|
||||
}
|
||||
ok = (mp->ma_lookup)(mp, key, hash)->me_value != NULL;
|
||||
return PyBool_FromLong(ok);
|
||||
ep = (mp->ma_lookup)(mp, key, hash);
|
||||
if (ep == NULL)
|
||||
return NULL;
|
||||
return PyBool_FromLong(ep->me_value != NULL);
|
||||
}
|
||||
|
||||
static PyObject *
|
||||
|
|
@ -1572,6 +1642,7 @@ dict_get(register dictobject *mp, PyObject *args)
|
|||
PyObject *failobj = Py_None;
|
||||
PyObject *val = NULL;
|
||||
long hash;
|
||||
dictentry *ep;
|
||||
|
||||
if (!PyArg_UnpackTuple(args, "get", 1, 2, &key, &failobj))
|
||||
return NULL;
|
||||
|
|
@ -1582,8 +1653,10 @@ dict_get(register dictobject *mp, PyObject *args)
|
|||
if (hash == -1)
|
||||
return NULL;
|
||||
}
|
||||
val = (mp->ma_lookup)(mp, key, hash)->me_value;
|
||||
|
||||
ep = (mp->ma_lookup)(mp, key, hash);
|
||||
if (ep == NULL)
|
||||
return NULL;
|
||||
val = ep->me_value;
|
||||
if (val == NULL)
|
||||
val = failobj;
|
||||
Py_INCREF(val);
|
||||
|
|
@ -1598,6 +1671,7 @@ dict_setdefault(register dictobject *mp, PyObject *args)
|
|||
PyObject *failobj = Py_None;
|
||||
PyObject *val = NULL;
|
||||
long hash;
|
||||
dictentry *ep;
|
||||
|
||||
if (!PyArg_UnpackTuple(args, "setdefault", 1, 2, &key, &failobj))
|
||||
return NULL;
|
||||
|
|
@ -1608,7 +1682,10 @@ dict_setdefault(register dictobject *mp, PyObject *args)
|
|||
if (hash == -1)
|
||||
return NULL;
|
||||
}
|
||||
val = (mp->ma_lookup)(mp, key, hash)->me_value;
|
||||
ep = (mp->ma_lookup)(mp, key, hash);
|
||||
if (ep == NULL)
|
||||
return NULL;
|
||||
val = ep->me_value;
|
||||
if (val == NULL) {
|
||||
val = failobj;
|
||||
if (PyDict_SetItem((PyObject*)mp, key, failobj))
|
||||
|
|
@ -1652,6 +1729,8 @@ dict_pop(dictobject *mp, PyObject *args)
|
|||
return NULL;
|
||||
}
|
||||
ep = (mp->ma_lookup)(mp, key, hash);
|
||||
if (ep == NULL)
|
||||
return NULL;
|
||||
if (ep->me_value == NULL) {
|
||||
if (deflt) {
|
||||
Py_INCREF(deflt);
|
||||
|
|
@ -1673,7 +1752,7 @@ dict_pop(dictobject *mp, PyObject *args)
|
|||
static PyObject *
|
||||
dict_popitem(dictobject *mp)
|
||||
{
|
||||
int i = 0;
|
||||
Py_ssize_t i = 0;
|
||||
dictentry *ep;
|
||||
PyObject *res;
|
||||
|
||||
|
|
@ -1683,7 +1762,7 @@ dict_popitem(dictobject *mp)
|
|||
* happened, the result would be an infinite loop (searching for an
|
||||
* entry that no longer exists). Note that the usual popitem()
|
||||
* idiom is "while d: k, v = d.popitem()". so needing to throw the
|
||||
* tuple away if the dict *is* empty isn't a significant
|
||||
* tuple away if the dict *is* empty isn't a significant
|
||||
* inefficiency -- possible, but unlikely in practice.
|
||||
*/
|
||||
res = PyTuple_New(2);
|
||||
|
|
@ -1703,7 +1782,7 @@ dict_popitem(dictobject *mp)
|
|||
*/
|
||||
ep = &mp->ma_table[0];
|
||||
if (ep->me_value == NULL) {
|
||||
i = (int)ep->me_hash;
|
||||
i = ep->me_hash;
|
||||
/* The hash field may be a real hash value, or it may be a
|
||||
* legit search finger, or it may be a once-legit search
|
||||
* finger that's out of bounds now because it wrapped around
|
||||
|
|
@ -1866,11 +1945,13 @@ static PyMethodDef mapp_methods[] = {
|
|||
{NULL, NULL} /* sentinel */
|
||||
};
|
||||
|
||||
/* Return 1 if `key` is in dict `op`, 0 if not, and -1 on error. */
|
||||
int
|
||||
PyDict_Contains(PyObject *op, PyObject *key)
|
||||
{
|
||||
long hash;
|
||||
dictobject *mp = (dictobject *)op;
|
||||
dictentry *ep;
|
||||
|
||||
if (!PyString_CheckExact(key) ||
|
||||
(hash = ((PyStringObject *) key)->ob_shash) == -1) {
|
||||
|
|
@ -1878,7 +1959,8 @@ PyDict_Contains(PyObject *op, PyObject *key)
|
|||
if (hash == -1)
|
||||
return -1;
|
||||
}
|
||||
return (mp->ma_lookup)(mp, key, hash)->me_value != NULL;
|
||||
ep = (mp->ma_lookup)(mp, key, hash);
|
||||
return ep == NULL ? -1 : (ep->me_value != NULL);
|
||||
}
|
||||
|
||||
/* Hack to implement "key in dict" */
|
||||
|
|
@ -2035,10 +2117,10 @@ PyDict_DelItemString(PyObject *v, const char *key)
|
|||
typedef struct {
|
||||
PyObject_HEAD
|
||||
dictobject *di_dict; /* Set to NULL when iterator is exhausted */
|
||||
int di_used;
|
||||
int di_pos;
|
||||
Py_ssize_t di_used;
|
||||
Py_ssize_t di_pos;
|
||||
PyObject* di_result; /* reusable result tuple for iteritems */
|
||||
long len;
|
||||
Py_ssize_t len;
|
||||
} dictiterobject;
|
||||
|
||||
static PyObject *
|
||||
|
|
@ -2076,10 +2158,10 @@ dictiter_dealloc(dictiterobject *di)
|
|||
static PyObject *
|
||||
dictiter_len(dictiterobject *di)
|
||||
{
|
||||
long len = 0;
|
||||
Py_ssize_t len = 0;
|
||||
if (di->di_dict != NULL && di->di_used == di->di_dict->ma_used)
|
||||
len = di->len;
|
||||
return PyInt_FromLong(len);
|
||||
return PyInt_FromSize_t(len);
|
||||
}
|
||||
|
||||
PyDoc_STRVAR(length_hint_doc, "Private method returning an estimate of len(list(it)).");
|
||||
|
|
@ -2092,7 +2174,7 @@ static PyMethodDef dictiter_methods[] = {
|
|||
static PyObject *dictiter_iternextkey(dictiterobject *di)
|
||||
{
|
||||
PyObject *key;
|
||||
register int i, mask;
|
||||
register Py_ssize_t i, mask;
|
||||
register dictentry *ep;
|
||||
dictobject *d = di->di_dict;
|
||||
|
||||
|
|
@ -2165,7 +2247,7 @@ PyTypeObject PyDictIterKey_Type = {
|
|||
static PyObject *dictiter_iternextvalue(dictiterobject *di)
|
||||
{
|
||||
PyObject *value;
|
||||
register int i, mask;
|
||||
register Py_ssize_t i, mask;
|
||||
register dictentry *ep;
|
||||
dictobject *d = di->di_dict;
|
||||
|
||||
|
|
@ -2238,7 +2320,7 @@ PyTypeObject PyDictIterValue_Type = {
|
|||
static PyObject *dictiter_iternextitem(dictiterobject *di)
|
||||
{
|
||||
PyObject *key, *value, *result = di->di_result;
|
||||
register int i, mask;
|
||||
register Py_ssize_t i, mask;
|
||||
register dictentry *ep;
|
||||
dictobject *d = di->di_dict;
|
||||
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load diff
|
|
@ -216,7 +216,7 @@ gen_throw(PyGenObject *gen, PyObject *args)
|
|||
PyObject *tb = NULL;
|
||||
PyObject *val = NULL;
|
||||
|
||||
if (!PyArg_ParseTuple(args, "O|OO:throw", &typ, &val, &tb))
|
||||
if (!PyArg_UnpackTuple(args, "throw", 1, 3, &typ, &val, &tb))
|
||||
return NULL;
|
||||
|
||||
/* First, check the traceback argument, replacing None with
|
||||
|
|
|
|||
|
|
@ -1509,6 +1509,57 @@ convmultmax_base[base], the result is "simply"
|
|||
(((c0*B + c1)*B + c2)*B + c3)*B + ... ))) + c_n-1
|
||||
|
||||
where B = convmultmax_base[base].
|
||||
|
||||
Error analysis: as above, the number of Python digits `n` needed is worst-
|
||||
case
|
||||
|
||||
n >= N * log(B)/log(BASE)
|
||||
|
||||
where `N` is the number of input digits in base `B`. This is computed via
|
||||
|
||||
size_z = (Py_ssize_t)((scan - str) * log_base_BASE[base]) + 1;
|
||||
|
||||
below. Two numeric concerns are how much space this can waste, and whether
|
||||
the computed result can be too small. To be concrete, assume BASE = 2**15,
|
||||
which is the default (and it's unlikely anyone changes that).
|
||||
|
||||
Waste isn't a problem: provided the first input digit isn't 0, the difference
|
||||
between the worst-case input with N digits and the smallest input with N
|
||||
digits is about a factor of B, but B is small compared to BASE so at most
|
||||
one allocated Python digit can remain unused on that count. If
|
||||
N*log(B)/log(BASE) is mathematically an exact integer, then truncating that
|
||||
and adding 1 returns a result 1 larger than necessary. However, that can't
|
||||
happen: whenever B is a power of 2, long_from_binary_base() is called
|
||||
instead, and it's impossible for B**i to be an integer power of 2**15 when
|
||||
B is not a power of 2 (i.e., it's impossible for N*log(B)/log(BASE) to be
|
||||
an exact integer when B is not a power of 2, since B**i has a prime factor
|
||||
other than 2 in that case, but (2**15)**j's only prime factor is 2).
|
||||
|
||||
The computed result can be too small if the true value of N*log(B)/log(BASE)
|
||||
is a little bit larger than an exact integer, but due to roundoff errors (in
|
||||
computing log(B), log(BASE), their quotient, and/or multiplying that by N)
|
||||
yields a numeric result a little less than that integer. Unfortunately, "how
|
||||
close can a transcendental function get to an integer over some range?"
|
||||
questions are generally theoretically intractable. Computer analysis via
|
||||
continued fractions is practical: expand log(B)/log(BASE) via continued
|
||||
fractions, giving a sequence i/j of "the best" rational approximations. Then
|
||||
j*log(B)/log(BASE) is approximately equal to (the integer) i. This shows that
|
||||
we can get very close to being in trouble, but very rarely. For example,
|
||||
76573 is a denominator in one of the continued-fraction approximations to
|
||||
log(10)/log(2**15), and indeed:
|
||||
|
||||
>>> log(10)/log(2**15)*76573
|
||||
16958.000000654003
|
||||
|
||||
is very close to an integer. If we were working with IEEE single-precision,
|
||||
rounding errors could kill us. Finding worst cases in IEEE double-precision
|
||||
requires better-than-double-precision log() functions, and Tim didn't bother.
|
||||
Instead the code checks to see whether the allocated space is enough as each
|
||||
new Python digit is added, and copies the whole thing to a larger long if not.
|
||||
This should happen extremely rarely, and in fact I don't have a test case
|
||||
that triggers it(!). Instead the code was tested by artificially allocating
|
||||
just 1 digit at the start, so that the copying code was exercised for every
|
||||
digit beyond the first.
|
||||
***/
|
||||
register twodigits c; /* current input character */
|
||||
Py_ssize_t size_z;
|
||||
|
|
@ -1551,6 +1602,8 @@ where B = convmultmax_base[base].
|
|||
* being stored into.
|
||||
*/
|
||||
size_z = (Py_ssize_t)((scan - str) * log_base_BASE[base]) + 1;
|
||||
/* Uncomment next line to test exceedingly rare copy code */
|
||||
/* size_z = 1; */
|
||||
assert(size_z > 0);
|
||||
z = _PyLong_New(size_z);
|
||||
if (z == NULL)
|
||||
|
|
@ -1594,9 +1647,27 @@ where B = convmultmax_base[base].
|
|||
/* carry off the current end? */
|
||||
if (c) {
|
||||
assert(c < BASE);
|
||||
assert(z->ob_size < size_z);
|
||||
*pz = (digit)c;
|
||||
++z->ob_size;
|
||||
if (z->ob_size < size_z) {
|
||||
*pz = (digit)c;
|
||||
++z->ob_size;
|
||||
}
|
||||
else {
|
||||
PyLongObject *tmp;
|
||||
/* Extremely rare. Get more space. */
|
||||
assert(z->ob_size == size_z);
|
||||
tmp = _PyLong_New(size_z + 1);
|
||||
if (tmp == NULL) {
|
||||
Py_DECREF(z);
|
||||
return NULL;
|
||||
}
|
||||
memcpy(tmp->ob_digit,
|
||||
z->ob_digit,
|
||||
sizeof(digit) * size_z);
|
||||
Py_DECREF(z);
|
||||
z = tmp;
|
||||
z->ob_digit[size_z] = (digit)c;
|
||||
++size_z;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
|
|||
|
|
@ -112,7 +112,7 @@ get_counts(void)
|
|||
if (result == NULL)
|
||||
return NULL;
|
||||
for (tp = type_list; tp; tp = tp->tp_next) {
|
||||
v = Py_BuildValue("(siii)", tp->tp_name, tp->tp_allocs,
|
||||
v = Py_BuildValue("(snnn)", tp->tp_name, tp->tp_allocs,
|
||||
tp->tp_frees, tp->tp_maxalloc);
|
||||
if (v == NULL) {
|
||||
Py_DECREF(result);
|
||||
|
|
|
|||
|
|
@ -13,8 +13,11 @@ stringlib_count(const STRINGLIB_CHAR* str, Py_ssize_t str_len,
|
|||
{
|
||||
Py_ssize_t count;
|
||||
|
||||
if (sub_len == 0)
|
||||
if (sub_len == 0) {
|
||||
if (str_len < 0)
|
||||
return 0; /* start > len(str) */
|
||||
return str_len + 1;
|
||||
}
|
||||
|
||||
count = fastsearch(str, str_len, sub, sub_len, FAST_COUNT);
|
||||
|
||||
|
|
|
|||
|
|
@ -14,8 +14,11 @@ stringlib_find(const STRINGLIB_CHAR* str, Py_ssize_t str_len,
|
|||
{
|
||||
Py_ssize_t pos;
|
||||
|
||||
if (sub_len == 0)
|
||||
if (sub_len == 0) {
|
||||
if (str_len < 0)
|
||||
return -1;
|
||||
return offset;
|
||||
}
|
||||
|
||||
pos = fastsearch(str, str_len, sub, sub_len, FAST_SEARCH);
|
||||
|
||||
|
|
@ -30,22 +33,20 @@ stringlib_rfind(const STRINGLIB_CHAR* str, Py_ssize_t str_len,
|
|||
const STRINGLIB_CHAR* sub, Py_ssize_t sub_len,
|
||||
Py_ssize_t offset)
|
||||
{
|
||||
Py_ssize_t pos;
|
||||
|
||||
/* XXX - create reversefastsearch helper! */
|
||||
if (sub_len == 0)
|
||||
pos = str_len + offset;
|
||||
else {
|
||||
Py_ssize_t j;
|
||||
pos = -1;
|
||||
if (sub_len == 0) {
|
||||
if (str_len < 0)
|
||||
return -1;
|
||||
return str_len + offset;
|
||||
} else {
|
||||
Py_ssize_t j, pos = -1;
|
||||
for (j = str_len - sub_len; j >= 0; --j)
|
||||
if (STRINGLIB_CMP(str+j, sub, sub_len) == 0) {
|
||||
pos = j + offset;
|
||||
break;
|
||||
}
|
||||
return pos;
|
||||
}
|
||||
|
||||
return pos;
|
||||
}
|
||||
|
||||
Py_LOCAL_INLINE(Py_ssize_t)
|
||||
|
|
|
|||
|
|
@ -23,7 +23,6 @@ static PyStringObject *nullstring;
|
|||
*/
|
||||
static PyObject *interned;
|
||||
|
||||
|
||||
/*
|
||||
For both PyString_FromString() and PyString_FromStringAndSize(), the
|
||||
parameter `size' denotes number of characters to allocate, not counting any
|
||||
|
|
@ -80,7 +79,7 @@ PyString_FromStringAndSize(const char *str, Py_ssize_t size)
|
|||
op->ob_shash = -1;
|
||||
op->ob_sstate = SSTATE_NOT_INTERNED;
|
||||
if (str != NULL)
|
||||
memcpy(op->ob_sval, str, size);
|
||||
Py_MEMCPY(op->ob_sval, str, size);
|
||||
op->ob_sval[size] = '\0';
|
||||
/* share short strings */
|
||||
if (size == 0) {
|
||||
|
|
@ -134,7 +133,7 @@ PyString_FromString(const char *str)
|
|||
PyObject_INIT_VAR(op, &PyString_Type, size);
|
||||
op->ob_shash = -1;
|
||||
op->ob_sstate = SSTATE_NOT_INTERNED;
|
||||
memcpy(op->ob_sval, str, size+1);
|
||||
Py_MEMCPY(op->ob_sval, str, size+1);
|
||||
/* share short strings */
|
||||
if (size == 0) {
|
||||
PyObject *t = (PyObject *)op;
|
||||
|
|
@ -162,7 +161,7 @@ PyString_FromFormatV(const char *format, va_list vargs)
|
|||
PyObject* string;
|
||||
|
||||
#ifdef VA_LIST_IS_ARRAY
|
||||
memcpy(count, vargs, sizeof(va_list));
|
||||
Py_MEMCPY(count, vargs, sizeof(va_list));
|
||||
#else
|
||||
#ifdef __va_copy
|
||||
__va_copy(count, vargs);
|
||||
|
|
@ -304,7 +303,7 @@ PyString_FromFormatV(const char *format, va_list vargs)
|
|||
i = strlen(p);
|
||||
if (n > 0 && i > n)
|
||||
i = n;
|
||||
memcpy(s, p, i);
|
||||
Py_MEMCPY(s, p, i);
|
||||
s += i;
|
||||
break;
|
||||
case 'p':
|
||||
|
|
@ -583,7 +582,7 @@ PyObject *PyString_DecodeEscape(const char *s,
|
|||
assert(PyString_Check(w));
|
||||
r = PyString_AS_STRING(w);
|
||||
rn = PyString_GET_SIZE(w);
|
||||
memcpy(p, r, rn);
|
||||
Py_MEMCPY(p, r, rn);
|
||||
p += rn;
|
||||
Py_DECREF(w);
|
||||
s = t;
|
||||
|
|
@ -967,8 +966,8 @@ string_concat(register PyStringObject *a, register PyObject *bb)
|
|||
PyObject_INIT_VAR(op, &PyString_Type, size);
|
||||
op->ob_shash = -1;
|
||||
op->ob_sstate = SSTATE_NOT_INTERNED;
|
||||
memcpy(op->ob_sval, a->ob_sval, a->ob_size);
|
||||
memcpy(op->ob_sval + a->ob_size, b->ob_sval, b->ob_size);
|
||||
Py_MEMCPY(op->ob_sval, a->ob_sval, a->ob_size);
|
||||
Py_MEMCPY(op->ob_sval + a->ob_size, b->ob_sval, b->ob_size);
|
||||
op->ob_sval[size] = '\0';
|
||||
return (PyObject *) op;
|
||||
#undef b
|
||||
|
|
@ -1017,12 +1016,12 @@ string_repeat(register PyStringObject *a, register Py_ssize_t n)
|
|||
}
|
||||
i = 0;
|
||||
if (i < size) {
|
||||
memcpy(op->ob_sval, a->ob_sval, a->ob_size);
|
||||
Py_MEMCPY(op->ob_sval, a->ob_sval, a->ob_size);
|
||||
i = a->ob_size;
|
||||
}
|
||||
while (i < size) {
|
||||
j = (i <= size-i) ? i : size-i;
|
||||
memcpy(op->ob_sval+i, op->ob_sval, j);
|
||||
Py_MEMCPY(op->ob_sval+i, op->ob_sval, j);
|
||||
i += j;
|
||||
}
|
||||
return (PyObject *) op;
|
||||
|
|
@ -1364,7 +1363,7 @@ static const char *stripformat[] = {"|O:lstrip", "|O:rstrip", "|O:strip"};
|
|||
count++; }
|
||||
|
||||
/* Always force the list to the expected size. */
|
||||
#define FIX_PREALLOC_SIZE(list) ((PyListObject *)list)->ob_size = count;
|
||||
#define FIX_PREALLOC_SIZE(list) ((PyListObject *)list)->ob_size = count
|
||||
|
||||
#define SKIP_SPACE(s, i, len) { while (i<len && isspace(Py_CHARMASK(s[i]))) i++; }
|
||||
#define SKIP_NONSPACE(s, i, len) { while (i<len && !isspace(Py_CHARMASK(s[i]))) i++; }
|
||||
|
|
@ -1808,10 +1807,10 @@ string_join(PyStringObject *self, PyObject *orig)
|
|||
size_t n;
|
||||
item = PySequence_Fast_GET_ITEM(seq, i);
|
||||
n = PyString_GET_SIZE(item);
|
||||
memcpy(p, PyString_AS_STRING(item), n);
|
||||
Py_MEMCPY(p, PyString_AS_STRING(item), n);
|
||||
p += n;
|
||||
if (i < seqlen - 1) {
|
||||
memcpy(p, sep, seplen);
|
||||
Py_MEMCPY(p, sep, seplen);
|
||||
p += seplen;
|
||||
}
|
||||
}
|
||||
|
|
@ -1851,7 +1850,6 @@ string_find_internal(PyStringObject *self, PyObject *args, int dir)
|
|||
Py_ssize_t sub_len;
|
||||
Py_ssize_t start=0, end=PY_SSIZE_T_MAX;
|
||||
|
||||
/* XXX ssize_t i */
|
||||
if (!PyArg_ParseTuple(args, "O|O&O&:find/rfind/index/rindex", &subobj,
|
||||
_PyEval_SliceIndex, &start, _PyEval_SliceIndex, &end))
|
||||
return -2;
|
||||
|
|
@ -1865,6 +1863,8 @@ string_find_internal(PyStringObject *self, PyObject *args, int dir)
|
|||
(PyObject *)self, subobj, start, end, dir);
|
||||
#endif
|
||||
else if (PyObject_AsCharBuffer(subobj, &sub, &sub_len))
|
||||
/* XXX - the "expected a character buffer object" is pretty
|
||||
confusing for a non-expert. remap to something else ? */
|
||||
return -2;
|
||||
|
||||
if (dir > 0)
|
||||
|
|
@ -2131,7 +2131,7 @@ string_lower(PyStringObject *self)
|
|||
|
||||
s = PyString_AS_STRING(newobj);
|
||||
|
||||
memcpy(s, PyString_AS_STRING(self), n);
|
||||
Py_MEMCPY(s, PyString_AS_STRING(self), n);
|
||||
|
||||
for (i = 0; i < n; i++) {
|
||||
int c = Py_CHARMASK(s[i]);
|
||||
|
|
@ -2164,7 +2164,7 @@ string_upper(PyStringObject *self)
|
|||
|
||||
s = PyString_AS_STRING(newobj);
|
||||
|
||||
memcpy(s, PyString_AS_STRING(self), n);
|
||||
Py_MEMCPY(s, PyString_AS_STRING(self), n);
|
||||
|
||||
for (i = 0; i < n; i++) {
|
||||
int c = Py_CHARMASK(s[i]);
|
||||
|
|
@ -2615,18 +2615,18 @@ replace_interleave(PyStringObject *self,
|
|||
/* TODO: special case single character, which doesn't need memcpy */
|
||||
|
||||
/* Lay the first one down (guaranteed this will occur) */
|
||||
memcpy(result_s, to_s, to_len);
|
||||
Py_MEMCPY(result_s, to_s, to_len);
|
||||
result_s += to_len;
|
||||
count -= 1;
|
||||
|
||||
for (i=0; i<count; i++) {
|
||||
*result_s++ = *self_s++;
|
||||
memcpy(result_s, to_s, to_len);
|
||||
Py_MEMCPY(result_s, to_s, to_len);
|
||||
result_s += to_len;
|
||||
}
|
||||
|
||||
/* Copy the rest of the original string */
|
||||
memcpy(result_s, self_s, self_len-i);
|
||||
Py_MEMCPY(result_s, self_s, self_len-i);
|
||||
|
||||
return result;
|
||||
}
|
||||
|
|
@ -2665,11 +2665,11 @@ replace_delete_single_character(PyStringObject *self,
|
|||
next = findchar(start, end-start, from_c);
|
||||
if (next == NULL)
|
||||
break;
|
||||
memcpy(result_s, start, next-start);
|
||||
Py_MEMCPY(result_s, start, next-start);
|
||||
result_s += (next-start);
|
||||
start = next+1;
|
||||
}
|
||||
memcpy(result_s, start, end-start);
|
||||
Py_MEMCPY(result_s, start, end-start);
|
||||
|
||||
return result;
|
||||
}
|
||||
|
|
@ -2719,12 +2719,12 @@ replace_delete_substring(PyStringObject *self, PyStringObject *from,
|
|||
break;
|
||||
next = start + offset;
|
||||
|
||||
memcpy(result_s, start, next-start);
|
||||
Py_MEMCPY(result_s, start, next-start);
|
||||
|
||||
result_s += (next-start);
|
||||
start = next+from_len;
|
||||
}
|
||||
memcpy(result_s, start, end-start);
|
||||
Py_MEMCPY(result_s, start, end-start);
|
||||
return result;
|
||||
}
|
||||
|
||||
|
|
@ -2754,7 +2754,7 @@ replace_single_character_in_place(PyStringObject *self,
|
|||
if (result == NULL)
|
||||
return NULL;
|
||||
result_s = PyString_AS_STRING(result);
|
||||
memcpy(result_s, self_s, self_len);
|
||||
Py_MEMCPY(result_s, self_s, self_len);
|
||||
|
||||
/* change everything in-place, starting with this one */
|
||||
start = result_s + (next-self_s);
|
||||
|
|
@ -2808,12 +2808,12 @@ replace_substring_in_place(PyStringObject *self,
|
|||
if (result == NULL)
|
||||
return NULL;
|
||||
result_s = PyString_AS_STRING(result);
|
||||
memcpy(result_s, self_s, self_len);
|
||||
Py_MEMCPY(result_s, self_s, self_len);
|
||||
|
||||
|
||||
/* change everything in-place, starting with this one */
|
||||
start = result_s + offset;
|
||||
memcpy(start, to_s, from_len);
|
||||
Py_MEMCPY(start, to_s, from_len);
|
||||
start += from_len;
|
||||
end = result_s + self_len;
|
||||
|
||||
|
|
@ -2823,7 +2823,7 @@ replace_substring_in_place(PyStringObject *self,
|
|||
0, end-start, FORWARD);
|
||||
if (offset==-1)
|
||||
break;
|
||||
memcpy(start+offset, to_s, from_len);
|
||||
Py_MEMCPY(start+offset, to_s, from_len);
|
||||
start += offset+from_len;
|
||||
}
|
||||
|
||||
|
|
@ -2883,20 +2883,20 @@ replace_single_character(PyStringObject *self,
|
|||
|
||||
if (next == start) {
|
||||
/* replace with the 'to' */
|
||||
memcpy(result_s, to_s, to_len);
|
||||
Py_MEMCPY(result_s, to_s, to_len);
|
||||
result_s += to_len;
|
||||
start += 1;
|
||||
} else {
|
||||
/* copy the unchanged old then the 'to' */
|
||||
memcpy(result_s, start, next-start);
|
||||
Py_MEMCPY(result_s, start, next-start);
|
||||
result_s += (next-start);
|
||||
memcpy(result_s, to_s, to_len);
|
||||
Py_MEMCPY(result_s, to_s, to_len);
|
||||
result_s += to_len;
|
||||
start = next+1;
|
||||
}
|
||||
}
|
||||
/* Copy the remainder of the remaining string */
|
||||
memcpy(result_s, start, end-start);
|
||||
Py_MEMCPY(result_s, start, end-start);
|
||||
|
||||
return result;
|
||||
}
|
||||
|
|
@ -2958,20 +2958,20 @@ replace_substring(PyStringObject *self,
|
|||
next = start+offset;
|
||||
if (next == start) {
|
||||
/* replace with the 'to' */
|
||||
memcpy(result_s, to_s, to_len);
|
||||
Py_MEMCPY(result_s, to_s, to_len);
|
||||
result_s += to_len;
|
||||
start += from_len;
|
||||
} else {
|
||||
/* copy the unchanged old then the 'to' */
|
||||
memcpy(result_s, start, next-start);
|
||||
Py_MEMCPY(result_s, start, next-start);
|
||||
result_s += (next-start);
|
||||
memcpy(result_s, to_s, to_len);
|
||||
Py_MEMCPY(result_s, to_s, to_len);
|
||||
result_s += to_len;
|
||||
start = next+from_len;
|
||||
}
|
||||
}
|
||||
/* Copy the remainder of the remaining string */
|
||||
memcpy(result_s, start, end-start);
|
||||
Py_MEMCPY(result_s, start, end-start);
|
||||
|
||||
return result;
|
||||
}
|
||||
|
|
@ -3358,7 +3358,7 @@ pad(PyStringObject *self, Py_ssize_t left, Py_ssize_t right, char fill)
|
|||
if (u) {
|
||||
if (left)
|
||||
memset(PyString_AS_STRING(u), fill, left);
|
||||
memcpy(PyString_AS_STRING(u) + left,
|
||||
Py_MEMCPY(PyString_AS_STRING(u) + left,
|
||||
PyString_AS_STRING(self),
|
||||
PyString_GET_SIZE(self));
|
||||
if (right)
|
||||
|
|
@ -3896,7 +3896,7 @@ str_subtype_new(PyTypeObject *type, PyObject *args, PyObject *kwds)
|
|||
n = PyString_GET_SIZE(tmp);
|
||||
pnew = type->tp_alloc(type, n);
|
||||
if (pnew != NULL) {
|
||||
memcpy(PyString_AS_STRING(pnew), PyString_AS_STRING(tmp), n+1);
|
||||
Py_MEMCPY(PyString_AS_STRING(pnew), PyString_AS_STRING(tmp), n+1);
|
||||
((PyStringObject *)pnew)->ob_shash =
|
||||
((PyStringObject *)tmp)->ob_shash;
|
||||
((PyStringObject *)pnew)->ob_sstate = SSTATE_NOT_INTERNED;
|
||||
|
|
@ -4791,7 +4791,7 @@ PyString_Format(PyObject *format, PyObject *args)
|
|||
*res++ = *pbuf++;
|
||||
}
|
||||
}
|
||||
memcpy(res, pbuf, len);
|
||||
Py_MEMCPY(res, pbuf, len);
|
||||
res += len;
|
||||
rescnt -= len;
|
||||
while (--width >= len) {
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue