mirror of https://github.com/python/cpython.git
2189 lines
47 KiB
C
2189 lines
47 KiB
C
/***********************************************************
|
||
Copyright 1991-1995 by Stichting Mathematisch Centrum, Amsterdam,
|
||
The Netherlands.
|
||
|
||
All Rights Reserved
|
||
|
||
Permission to use, copy, modify, and distribute this software and its
|
||
documentation for any purpose and without fee is hereby granted,
|
||
provided that the above copyright notice appear in all copies and that
|
||
both that copyright notice and this permission notice appear in
|
||
supporting documentation, and that the names of Stichting Mathematisch
|
||
Centrum or CWI or Corporation for National Research Initiatives or
|
||
CNRI not be used in advertising or publicity pertaining to
|
||
distribution of the software without specific, written prior
|
||
permission.
|
||
|
||
While CWI is the initial source for this software, a modified version
|
||
is made available by the Corporation for National Research Initiatives
|
||
(CNRI) at the Internet address ftp://ftp.python.org.
|
||
|
||
STICHTING MATHEMATISCH CENTRUM AND CNRI DISCLAIM ALL WARRANTIES WITH
|
||
REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF
|
||
MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH
|
||
CENTRUM OR CNRI BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL
|
||
DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
||
PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
|
||
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
||
PERFORMANCE OF THIS SOFTWARE.
|
||
|
||
******************************************************************/
|
||
|
||
/* String object implementation */
|
||
|
||
#include "Python.h"
|
||
|
||
#include "mymath.h"
|
||
#include <ctype.h>
|
||
|
||
#ifdef COUNT_ALLOCS
|
||
int null_strings, one_strings;
|
||
#endif
|
||
|
||
#ifdef HAVE_LIMITS_H
|
||
#include <limits.h>
|
||
#else
|
||
#ifndef UCHAR_MAX
|
||
#define UCHAR_MAX 255
|
||
#endif
|
||
#endif
|
||
|
||
static PyStringObject *characters[UCHAR_MAX + 1];
|
||
#ifndef DONT_SHARE_SHORT_STRINGS
|
||
static PyStringObject *nullstring;
|
||
#endif
|
||
|
||
/*
|
||
Newsizedstringobject() and newstringobject() try in certain cases
|
||
to share string objects. When the size of the string is zero,
|
||
these routines always return a pointer to the same string object;
|
||
when the size is one, they return a pointer to an already existing
|
||
object if the contents of the string is known. For
|
||
newstringobject() this is always the case, for
|
||
newsizedstringobject() this is the case when the first argument in
|
||
not NULL.
|
||
A common practice to allocate a string and then fill it in or
|
||
change it must be done carefully. It is only allowed to change the
|
||
contents of the string if the obect was gotten from
|
||
newsizedstringobject() with a NULL first argument, because in the
|
||
future these routines may try to do even more sharing of objects.
|
||
*/
|
||
PyObject *
|
||
PyString_FromStringAndSize(str, size)
|
||
const char *str;
|
||
int size;
|
||
{
|
||
register PyStringObject *op;
|
||
#ifndef DONT_SHARE_SHORT_STRINGS
|
||
if (size == 0 && (op = nullstring) != NULL) {
|
||
#ifdef COUNT_ALLOCS
|
||
null_strings++;
|
||
#endif
|
||
Py_INCREF(op);
|
||
return (PyObject *)op;
|
||
}
|
||
if (size == 1 && str != NULL &&
|
||
(op = characters[*str & UCHAR_MAX]) != NULL)
|
||
{
|
||
#ifdef COUNT_ALLOCS
|
||
one_strings++;
|
||
#endif
|
||
Py_INCREF(op);
|
||
return (PyObject *)op;
|
||
}
|
||
#endif /* DONT_SHARE_SHORT_STRINGS */
|
||
op = (PyStringObject *)
|
||
malloc(sizeof(PyStringObject) + size * sizeof(char));
|
||
if (op == NULL)
|
||
return PyErr_NoMemory();
|
||
op->ob_type = &PyString_Type;
|
||
op->ob_size = size;
|
||
#ifdef CACHE_HASH
|
||
op->ob_shash = -1;
|
||
#endif
|
||
#ifdef INTERN_STRINGS
|
||
op->ob_sinterned = NULL;
|
||
#endif
|
||
_Py_NewReference((PyObject *)op);
|
||
if (str != NULL)
|
||
memcpy(op->ob_sval, str, size);
|
||
op->ob_sval[size] = '\0';
|
||
#ifndef DONT_SHARE_SHORT_STRINGS
|
||
if (size == 0) {
|
||
nullstring = op;
|
||
Py_INCREF(op);
|
||
} else if (size == 1 && str != NULL) {
|
||
characters[*str & UCHAR_MAX] = op;
|
||
Py_INCREF(op);
|
||
}
|
||
#endif
|
||
return (PyObject *) op;
|
||
}
|
||
|
||
PyObject *
|
||
PyString_FromString(str)
|
||
const char *str;
|
||
{
|
||
register unsigned int size = strlen(str);
|
||
register PyStringObject *op;
|
||
#ifndef DONT_SHARE_SHORT_STRINGS
|
||
if (size == 0 && (op = nullstring) != NULL) {
|
||
#ifdef COUNT_ALLOCS
|
||
null_strings++;
|
||
#endif
|
||
Py_INCREF(op);
|
||
return (PyObject *)op;
|
||
}
|
||
if (size == 1 && (op = characters[*str & UCHAR_MAX]) != NULL) {
|
||
#ifdef COUNT_ALLOCS
|
||
one_strings++;
|
||
#endif
|
||
Py_INCREF(op);
|
||
return (PyObject *)op;
|
||
}
|
||
#endif /* DONT_SHARE_SHORT_STRINGS */
|
||
op = (PyStringObject *)
|
||
malloc(sizeof(PyStringObject) + size * sizeof(char));
|
||
if (op == NULL)
|
||
return PyErr_NoMemory();
|
||
op->ob_type = &PyString_Type;
|
||
op->ob_size = size;
|
||
#ifdef CACHE_HASH
|
||
op->ob_shash = -1;
|
||
#endif
|
||
#ifdef INTERN_STRINGS
|
||
op->ob_sinterned = NULL;
|
||
#endif
|
||
_Py_NewReference((PyObject *)op);
|
||
strcpy(op->ob_sval, str);
|
||
#ifndef DONT_SHARE_SHORT_STRINGS
|
||
if (size == 0) {
|
||
nullstring = op;
|
||
Py_INCREF(op);
|
||
} else if (size == 1) {
|
||
characters[*str & UCHAR_MAX] = op;
|
||
Py_INCREF(op);
|
||
}
|
||
#endif
|
||
return (PyObject *) op;
|
||
}
|
||
|
||
static void
|
||
string_dealloc(op)
|
||
PyObject *op;
|
||
{
|
||
PyMem_DEL(op);
|
||
}
|
||
|
||
int
|
||
PyString_Size(op)
|
||
register PyObject *op;
|
||
{
|
||
if (!PyString_Check(op)) {
|
||
PyErr_BadInternalCall();
|
||
return -1;
|
||
}
|
||
return ((PyStringObject *)op) -> ob_size;
|
||
}
|
||
|
||
/*const*/ char *
|
||
PyString_AsString(op)
|
||
register PyObject *op;
|
||
{
|
||
if (!PyString_Check(op)) {
|
||
PyErr_BadInternalCall();
|
||
return NULL;
|
||
}
|
||
return ((PyStringObject *)op) -> ob_sval;
|
||
}
|
||
|
||
/* Methods */
|
||
|
||
static int
|
||
string_print(op, fp, flags)
|
||
PyStringObject *op;
|
||
FILE *fp;
|
||
int flags;
|
||
{
|
||
int i;
|
||
char c;
|
||
int quote;
|
||
/* XXX Ought to check for interrupts when writing long strings */
|
||
if (flags & Py_PRINT_RAW) {
|
||
fwrite(op->ob_sval, 1, (int) op->ob_size, fp);
|
||
return 0;
|
||
}
|
||
|
||
/* figure out which quote to use; single is prefered */
|
||
quote = '\'';
|
||
if (strchr(op->ob_sval, '\'') && !strchr(op->ob_sval, '"'))
|
||
quote = '"';
|
||
|
||
fputc(quote, fp);
|
||
for (i = 0; i < op->ob_size; i++) {
|
||
c = op->ob_sval[i];
|
||
if (c == quote || c == '\\')
|
||
fprintf(fp, "\\%c", c);
|
||
else if (c < ' ' || c >= 0177)
|
||
fprintf(fp, "\\%03o", c & 0377);
|
||
else
|
||
fputc(c, fp);
|
||
}
|
||
fputc(quote, fp);
|
||
return 0;
|
||
}
|
||
|
||
static PyObject *
|
||
string_repr(op)
|
||
register PyStringObject *op;
|
||
{
|
||
/* XXX overflow? */
|
||
int newsize = 2 + 4 * op->ob_size * sizeof(char);
|
||
PyObject *v = PyString_FromStringAndSize((char *)NULL, newsize);
|
||
if (v == NULL) {
|
||
return NULL;
|
||
}
|
||
else {
|
||
register int i;
|
||
register char c;
|
||
register char *p;
|
||
int quote;
|
||
|
||
/* figure out which quote to use; single is prefered */
|
||
quote = '\'';
|
||
if (strchr(op->ob_sval, '\'') && !strchr(op->ob_sval, '"'))
|
||
quote = '"';
|
||
|
||
p = ((PyStringObject *)v)->ob_sval;
|
||
*p++ = quote;
|
||
for (i = 0; i < op->ob_size; i++) {
|
||
c = op->ob_sval[i];
|
||
if (c == quote || c == '\\')
|
||
*p++ = '\\', *p++ = c;
|
||
else if (c < ' ' || c >= 0177) {
|
||
sprintf(p, "\\%03o", c & 0377);
|
||
while (*p != '\0')
|
||
p++;
|
||
}
|
||
else
|
||
*p++ = c;
|
||
}
|
||
*p++ = quote;
|
||
*p = '\0';
|
||
_PyString_Resize(
|
||
&v, (int) (p - ((PyStringObject *)v)->ob_sval));
|
||
return v;
|
||
}
|
||
}
|
||
|
||
static int
|
||
string_length(a)
|
||
PyStringObject *a;
|
||
{
|
||
return a->ob_size;
|
||
}
|
||
|
||
static PyObject *
|
||
string_concat(a, bb)
|
||
register PyStringObject *a;
|
||
register PyObject *bb;
|
||
{
|
||
register unsigned int size;
|
||
register PyStringObject *op;
|
||
if (!PyString_Check(bb)) {
|
||
PyErr_BadArgument();
|
||
return NULL;
|
||
}
|
||
#define b ((PyStringObject *)bb)
|
||
/* Optimize cases with empty left or right operand */
|
||
if (a->ob_size == 0) {
|
||
Py_INCREF(bb);
|
||
return bb;
|
||
}
|
||
if (b->ob_size == 0) {
|
||
Py_INCREF(a);
|
||
return (PyObject *)a;
|
||
}
|
||
size = a->ob_size + b->ob_size;
|
||
op = (PyStringObject *)
|
||
malloc(sizeof(PyStringObject) + size * sizeof(char));
|
||
if (op == NULL)
|
||
return PyErr_NoMemory();
|
||
op->ob_type = &PyString_Type;
|
||
op->ob_size = size;
|
||
#ifdef CACHE_HASH
|
||
op->ob_shash = -1;
|
||
#endif
|
||
#ifdef INTERN_STRINGS
|
||
op->ob_sinterned = NULL;
|
||
#endif
|
||
_Py_NewReference((PyObject *)op);
|
||
memcpy(op->ob_sval, a->ob_sval, (int) a->ob_size);
|
||
memcpy(op->ob_sval + a->ob_size, b->ob_sval, (int) b->ob_size);
|
||
op->ob_sval[size] = '\0';
|
||
return (PyObject *) op;
|
||
#undef b
|
||
}
|
||
|
||
static PyObject *
|
||
string_repeat(a, n)
|
||
register PyStringObject *a;
|
||
register int n;
|
||
{
|
||
register int i;
|
||
register int size;
|
||
register PyStringObject *op;
|
||
if (n < 0)
|
||
n = 0;
|
||
size = a->ob_size * n;
|
||
if (size == a->ob_size) {
|
||
Py_INCREF(a);
|
||
return (PyObject *)a;
|
||
}
|
||
op = (PyStringObject *)
|
||
malloc(sizeof(PyStringObject) + size * sizeof(char));
|
||
if (op == NULL)
|
||
return PyErr_NoMemory();
|
||
op->ob_type = &PyString_Type;
|
||
op->ob_size = size;
|
||
#ifdef CACHE_HASH
|
||
op->ob_shash = -1;
|
||
#endif
|
||
#ifdef INTERN_STRINGS
|
||
op->ob_sinterned = NULL;
|
||
#endif
|
||
_Py_NewReference((PyObject *)op);
|
||
for (i = 0; i < size; i += a->ob_size)
|
||
memcpy(op->ob_sval+i, a->ob_sval, (int) a->ob_size);
|
||
op->ob_sval[size] = '\0';
|
||
return (PyObject *) op;
|
||
}
|
||
|
||
/* String slice a[i:j] consists of characters a[i] ... a[j-1] */
|
||
|
||
static PyObject *
|
||
string_slice(a, i, j)
|
||
register PyStringObject *a;
|
||
register int i, j; /* May be negative! */
|
||
{
|
||
if (i < 0)
|
||
i = 0;
|
||
if (j < 0)
|
||
j = 0; /* Avoid signed/unsigned bug in next line */
|
||
if (j > a->ob_size)
|
||
j = a->ob_size;
|
||
if (i == 0 && j == a->ob_size) { /* It's the same as a */
|
||
Py_INCREF(a);
|
||
return (PyObject *)a;
|
||
}
|
||
if (j < i)
|
||
j = i;
|
||
return PyString_FromStringAndSize(a->ob_sval + i, (int) (j-i));
|
||
}
|
||
|
||
static PyObject *
|
||
string_item(a, i)
|
||
PyStringObject *a;
|
||
register int i;
|
||
{
|
||
int c;
|
||
PyObject *v;
|
||
if (i < 0 || i >= a->ob_size) {
|
||
PyErr_SetString(PyExc_IndexError, "string index out of range");
|
||
return NULL;
|
||
}
|
||
c = a->ob_sval[i] & UCHAR_MAX;
|
||
v = (PyObject *) characters[c];
|
||
#ifdef COUNT_ALLOCS
|
||
if (v != NULL)
|
||
one_strings++;
|
||
#endif
|
||
if (v == NULL) {
|
||
v = PyString_FromStringAndSize((char *)NULL, 1);
|
||
if (v == NULL)
|
||
return NULL;
|
||
characters[c] = (PyStringObject *) v;
|
||
((PyStringObject *)v)->ob_sval[0] = c;
|
||
}
|
||
Py_INCREF(v);
|
||
return v;
|
||
}
|
||
|
||
static int
|
||
string_compare(a, b)
|
||
PyStringObject *a, *b;
|
||
{
|
||
int len_a = a->ob_size, len_b = b->ob_size;
|
||
int min_len = (len_a < len_b) ? len_a : len_b;
|
||
int cmp;
|
||
if (min_len > 0) {
|
||
cmp = Py_CHARMASK(*a->ob_sval) - Py_CHARMASK(*b->ob_sval);
|
||
if (cmp == 0)
|
||
cmp = memcmp(a->ob_sval, b->ob_sval, min_len);
|
||
if (cmp != 0)
|
||
return cmp;
|
||
}
|
||
return (len_a < len_b) ? -1 : (len_a > len_b) ? 1 : 0;
|
||
}
|
||
|
||
static long
|
||
string_hash(a)
|
||
PyStringObject *a;
|
||
{
|
||
register int len;
|
||
register unsigned char *p;
|
||
register long x;
|
||
|
||
#ifdef CACHE_HASH
|
||
if (a->ob_shash != -1)
|
||
return a->ob_shash;
|
||
#ifdef INTERN_STRINGS
|
||
if (a->ob_sinterned != NULL)
|
||
return (a->ob_shash =
|
||
((PyStringObject *)(a->ob_sinterned))->ob_shash);
|
||
#endif
|
||
#endif
|
||
len = a->ob_size;
|
||
p = (unsigned char *) a->ob_sval;
|
||
x = *p << 7;
|
||
while (--len >= 0)
|
||
x = (1000003*x) ^ *p++;
|
||
x ^= a->ob_size;
|
||
if (x == -1)
|
||
x = -2;
|
||
#ifdef CACHE_HASH
|
||
a->ob_shash = x;
|
||
#endif
|
||
return x;
|
||
}
|
||
|
||
static int
|
||
string_buffer_getreadbuf(self, index, ptr)
|
||
PyStringObject *self;
|
||
int index;
|
||
const void **ptr;
|
||
{
|
||
if ( index != 0 ) {
|
||
PyErr_SetString(PyExc_SystemError,
|
||
"accessing non-existent string segment");
|
||
return -1;
|
||
}
|
||
*ptr = (void *)self->ob_sval;
|
||
return self->ob_size;
|
||
}
|
||
|
||
static int
|
||
string_buffer_getwritebuf(self, index, ptr)
|
||
PyStringObject *self;
|
||
int index;
|
||
const void **ptr;
|
||
{
|
||
PyErr_SetString(PyExc_TypeError,
|
||
"Cannot use string as modifiable buffer");
|
||
return -1;
|
||
}
|
||
|
||
static int
|
||
string_buffer_getsegcount(self, lenp)
|
||
PyStringObject *self;
|
||
int *lenp;
|
||
{
|
||
if ( lenp )
|
||
*lenp = self->ob_size;
|
||
return 1;
|
||
}
|
||
|
||
static int
|
||
string_buffer_getcharbuf(self, index, ptr)
|
||
PyStringObject *self;
|
||
int index;
|
||
const char **ptr;
|
||
{
|
||
if ( index != 0 ) {
|
||
PyErr_SetString(PyExc_SystemError,
|
||
"accessing non-existent string segment");
|
||
return -1;
|
||
}
|
||
*ptr = self->ob_sval;
|
||
return self->ob_size;
|
||
}
|
||
|
||
static PySequenceMethods string_as_sequence = {
|
||
(inquiry)string_length, /*sq_length*/
|
||
(binaryfunc)string_concat, /*sq_concat*/
|
||
(intargfunc)string_repeat, /*sq_repeat*/
|
||
(intargfunc)string_item, /*sq_item*/
|
||
(intintargfunc)string_slice, /*sq_slice*/
|
||
0, /*sq_ass_item*/
|
||
0, /*sq_ass_slice*/
|
||
};
|
||
|
||
static PyBufferProcs string_as_buffer = {
|
||
(getreadbufferproc)string_buffer_getreadbuf,
|
||
(getwritebufferproc)string_buffer_getwritebuf,
|
||
(getsegcountproc)string_buffer_getsegcount,
|
||
(getcharbufferproc)string_buffer_getcharbuf,
|
||
};
|
||
|
||
|
||
|
||
#define LEFTSTRIP 0
|
||
#define RIGHTSTRIP 1
|
||
#define BOTHSTRIP 2
|
||
|
||
|
||
static PyObject *
|
||
split_whitespace(s, len, maxsplit)
|
||
char *s;
|
||
int len;
|
||
int maxsplit;
|
||
{
|
||
int i = 0, j, err;
|
||
int countsplit = 0;
|
||
PyObject* item;
|
||
PyObject *list = PyList_New(0);
|
||
|
||
if (list == NULL)
|
||
return NULL;
|
||
|
||
while (i < len) {
|
||
while (i < len && isspace(Py_CHARMASK(s[i]))) {
|
||
i = i+1;
|
||
}
|
||
j = i;
|
||
while (i < len && !isspace(Py_CHARMASK(s[i]))) {
|
||
i = i+1;
|
||
}
|
||
if (j < i) {
|
||
item = PyString_FromStringAndSize(s+j, (int)(i-j));
|
||
if (item == NULL)
|
||
goto finally;
|
||
|
||
err = PyList_Append(list, item);
|
||
Py_DECREF(item);
|
||
if (err < 0)
|
||
goto finally;
|
||
|
||
countsplit++;
|
||
while (i < len && isspace(Py_CHARMASK(s[i]))) {
|
||
i = i+1;
|
||
}
|
||
if (maxsplit && (countsplit >= maxsplit) && i < len) {
|
||
item = PyString_FromStringAndSize(
|
||
s+i, (int)(len - i));
|
||
if (item == NULL)
|
||
goto finally;
|
||
|
||
err = PyList_Append(list, item);
|
||
Py_DECREF(item);
|
||
if (err < 0)
|
||
goto finally;
|
||
|
||
i = len;
|
||
}
|
||
}
|
||
}
|
||
return list;
|
||
finally:
|
||
Py_DECREF(list);
|
||
return NULL;
|
||
}
|
||
|
||
|
||
static char split__doc__[] =
|
||
"S.split([sep [,maxsplit]]) -> list of strings\n\
|
||
\n\
|
||
Return a list of the words in the string S, using sep as the\n\
|
||
delimiter string. If maxsplit is nonzero, splits into at most\n\
|
||
maxsplit words If sep is not specified, any whitespace string\n\
|
||
is a separator. Maxsplit defaults to 0.";
|
||
|
||
static PyObject *
|
||
string_split(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
int len = PyString_GET_SIZE(self), n, i, j, err;
|
||
int splitcount, maxsplit;
|
||
char *s = PyString_AS_STRING(self), *sub;
|
||
PyObject *list, *item;
|
||
|
||
sub = NULL;
|
||
n = 0;
|
||
splitcount = 0;
|
||
maxsplit = 0;
|
||
if (!PyArg_ParseTuple(args, "|z#i:split", &sub, &n, &maxsplit))
|
||
return NULL;
|
||
if (sub == NULL)
|
||
return split_whitespace(s, len, maxsplit);
|
||
if (n == 0) {
|
||
PyErr_SetString(PyExc_ValueError, "empty separator");
|
||
return NULL;
|
||
}
|
||
|
||
list = PyList_New(0);
|
||
if (list == NULL)
|
||
return NULL;
|
||
|
||
i = j = 0;
|
||
while (i+n <= len) {
|
||
if (s[i] == sub[0] && (n == 1 || memcmp(s+i, sub, n) == 0)) {
|
||
item = PyString_FromStringAndSize(s+j, (int)(i-j));
|
||
if (item == NULL)
|
||
goto fail;
|
||
err = PyList_Append(list, item);
|
||
Py_DECREF(item);
|
||
if (err < 0)
|
||
goto fail;
|
||
i = j = i + n;
|
||
splitcount++;
|
||
if (maxsplit && (splitcount >= maxsplit))
|
||
break;
|
||
}
|
||
else
|
||
i++;
|
||
}
|
||
item = PyString_FromStringAndSize(s+j, (int)(len-j));
|
||
if (item == NULL)
|
||
goto fail;
|
||
err = PyList_Append(list, item);
|
||
Py_DECREF(item);
|
||
if (err < 0)
|
||
goto fail;
|
||
|
||
return list;
|
||
|
||
fail:
|
||
Py_DECREF(list);
|
||
return NULL;
|
||
}
|
||
|
||
|
||
static char join__doc__[] =
|
||
"S.join(sequence) -> string\n\
|
||
\n\
|
||
Return a string which is the concatenation of the string representation\n\
|
||
of every element in the sequence. The separator between elements is S.";
|
||
|
||
static PyObject *
|
||
string_join(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
char *sep = PyString_AS_STRING(self);
|
||
int seplen = PyString_GET_SIZE(self);
|
||
PyObject *res = NULL;
|
||
int reslen = 0;
|
||
char *p;
|
||
int seqlen = 0;
|
||
int sz = 100;
|
||
int i, slen;
|
||
PyObject *seq;
|
||
|
||
if (!PyArg_ParseTuple(args, "O:join", &seq))
|
||
return NULL;
|
||
|
||
seqlen = PySequence_Length(seq);
|
||
if (seqlen < 0 && PyErr_Occurred())
|
||
return NULL;
|
||
|
||
if (seqlen == 1) {
|
||
/* Optimization if there's only one item */
|
||
PyObject *item = PySequence_GetItem(seq, 0);
|
||
PyObject *stritem = PyObject_Str(item);
|
||
Py_DECREF(item);
|
||
return stritem;
|
||
}
|
||
if (!(res = PyString_FromStringAndSize((char*)NULL, sz)))
|
||
return NULL;
|
||
p = PyString_AsString(res);
|
||
|
||
/* optimize for lists. all others (tuples and arbitrary sequences)
|
||
* just use the abstract interface.
|
||
*/
|
||
if (PyList_Check(seq)) {
|
||
for (i = 0; i < seqlen; i++) {
|
||
PyObject *item = PyList_GET_ITEM(seq, i);
|
||
PyObject *sitem = PyObject_Str(item);
|
||
if (!sitem)
|
||
goto finally;
|
||
slen = PyString_GET_SIZE(sitem);
|
||
while (reslen + slen + seplen >= sz) {
|
||
if (_PyString_Resize(&res, sz*2)) {
|
||
Py_DECREF(sitem);
|
||
goto finally;
|
||
}
|
||
sz *= 2;
|
||
p = PyString_AsString(res) + reslen;
|
||
}
|
||
if (i > 0) {
|
||
memcpy(p, sep, seplen);
|
||
p += seplen;
|
||
reslen += seplen;
|
||
}
|
||
memcpy(p, PyString_AS_STRING(sitem), slen);
|
||
Py_DECREF(sitem);
|
||
p += slen;
|
||
reslen += slen;
|
||
}
|
||
}
|
||
else {
|
||
for (i = 0; i < seqlen; i++) {
|
||
PyObject *item = PySequence_GetItem(seq, i);
|
||
PyObject *sitem;
|
||
|
||
if (!item)
|
||
goto finally;
|
||
sitem = PyObject_Str(item);
|
||
Py_DECREF(item);
|
||
if (!sitem)
|
||
goto finally;
|
||
|
||
slen = PyString_GET_SIZE(sitem);
|
||
while (reslen + slen + seplen >= sz) {
|
||
if (_PyString_Resize(&res, sz*2)) {
|
||
Py_DECREF(sitem);
|
||
goto finally;
|
||
}
|
||
sz *= 2;
|
||
p = PyString_AsString(res) + reslen;
|
||
}
|
||
if (i > 0) {
|
||
memcpy(p, sep, seplen);
|
||
p += seplen;
|
||
reslen += seplen;
|
||
}
|
||
memcpy(p, PyString_AS_STRING(sitem), slen);
|
||
Py_DECREF(sitem);
|
||
p += slen;
|
||
reslen += slen;
|
||
}
|
||
}
|
||
if (_PyString_Resize(&res, reslen))
|
||
goto finally;
|
||
return res;
|
||
|
||
finally:
|
||
Py_DECREF(res);
|
||
return NULL;
|
||
}
|
||
|
||
|
||
|
||
static long
|
||
string_find_internal(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
char *s = PyString_AS_STRING(self), *sub;
|
||
int len = PyString_GET_SIZE(self);
|
||
int n, i = 0, last = INT_MAX;
|
||
|
||
if (!PyArg_ParseTuple(args, "t#|ii:find", &sub, &n, &i, &last))
|
||
return -2;
|
||
|
||
if (last > len)
|
||
last = len;
|
||
if (last < 0)
|
||
last += len;
|
||
if (last < 0)
|
||
last = 0;
|
||
if (i < 0)
|
||
i += len;
|
||
if (i < 0)
|
||
i = 0;
|
||
|
||
if (n == 0 && i <= last)
|
||
return (long)i;
|
||
|
||
last -= n;
|
||
for (; i <= last; ++i)
|
||
if (s[i] == sub[0] &&
|
||
(n == 1 || memcmp(&s[i+1], &sub[1], n-1) == 0))
|
||
return (long)i;
|
||
|
||
return -1;
|
||
}
|
||
|
||
|
||
static char find__doc__[] =
|
||
"S.find(sub [,start [,end]]) -> int\n\
|
||
\n\
|
||
Return the lowest index in S where substring sub is found,\n\
|
||
such that sub is contained within s[start,end]. Optional\n\
|
||
arguments start and end are interpreted as in slice notation.\n\
|
||
\n\
|
||
Return -1 on failure.";
|
||
|
||
static PyObject *
|
||
string_find(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
long result = string_find_internal(self, args);
|
||
if (result == -2)
|
||
return NULL;
|
||
return PyInt_FromLong(result);
|
||
}
|
||
|
||
|
||
static char index__doc__[] =
|
||
"S.index(sub [,start [,end]]) -> int\n\
|
||
\n\
|
||
Like S.find() but raise ValueError when the substring is not found.";
|
||
|
||
static PyObject *
|
||
string_index(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
long result = string_find_internal(self, args);
|
||
if (result == -2)
|
||
return NULL;
|
||
if (result == -1) {
|
||
PyErr_SetString(PyExc_ValueError,
|
||
"substring not found in string.index");
|
||
return NULL;
|
||
}
|
||
return PyInt_FromLong(result);
|
||
}
|
||
|
||
|
||
static long
|
||
string_rfind_internal(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
char *s = PyString_AS_STRING(self), *sub;
|
||
int len = PyString_GET_SIZE(self), n, j;
|
||
int i = 0, last = INT_MAX;
|
||
|
||
if (!PyArg_ParseTuple(args, "t#|ii:rfind", &sub, &n, &i, &last))
|
||
return -2;
|
||
|
||
if (last > len)
|
||
last = len;
|
||
if (last < 0)
|
||
last += len;
|
||
if (last < 0)
|
||
last = 0;
|
||
if (i < 0)
|
||
i += len;
|
||
if (i < 0)
|
||
i = 0;
|
||
|
||
if (n == 0 && i <= last)
|
||
return (long)last;
|
||
|
||
for (j = last-n; j >= i; --j)
|
||
if (s[j] == sub[0] &&
|
||
(n == 1 || memcmp(&s[j+1], &sub[1], n-1) == 0))
|
||
return (long)j;
|
||
|
||
return -1;
|
||
}
|
||
|
||
|
||
static char rfind__doc__[] =
|
||
"S.rfind(sub [,start [,end]]) -> int\n\
|
||
\n\
|
||
Return the highest index in S where substring sub is found,\n\
|
||
such that sub is contained within s[start,end]. Optional\n\
|
||
arguments start and end are interpreted as in slice notation.\n\
|
||
\n\
|
||
Return -1 on failure.";
|
||
|
||
static PyObject *
|
||
string_rfind(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
long result = string_rfind_internal(self, args);
|
||
if (result == -2)
|
||
return NULL;
|
||
return PyInt_FromLong(result);
|
||
}
|
||
|
||
|
||
static char rindex__doc__[] =
|
||
"S.rindex(sub [,start [,end]]) -> int\n\
|
||
\n\
|
||
Like S.rfind() but raise ValueError when the substring is not found.";
|
||
|
||
static PyObject *
|
||
string_rindex(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
long result = string_rfind_internal(self, args);
|
||
if (result == -2)
|
||
return NULL;
|
||
if (result == -1) {
|
||
PyErr_SetString(PyExc_ValueError,
|
||
"substring not found in string.rindex");
|
||
return NULL;
|
||
}
|
||
return PyInt_FromLong(result);
|
||
}
|
||
|
||
|
||
static PyObject *
|
||
do_strip(self, args, striptype)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
int striptype;
|
||
{
|
||
char *s = PyString_AS_STRING(self);
|
||
int len = PyString_GET_SIZE(self), i, j;
|
||
|
||
if (!PyArg_ParseTuple(args, ":strip"))
|
||
return NULL;
|
||
|
||
i = 0;
|
||
if (striptype != RIGHTSTRIP) {
|
||
while (i < len && isspace(Py_CHARMASK(s[i]))) {
|
||
i++;
|
||
}
|
||
}
|
||
|
||
j = len;
|
||
if (striptype != LEFTSTRIP) {
|
||
do {
|
||
j--;
|
||
} while (j >= i && isspace(Py_CHARMASK(s[j])));
|
||
j++;
|
||
}
|
||
|
||
if (i == 0 && j == len) {
|
||
Py_INCREF(self);
|
||
return (PyObject*)self;
|
||
}
|
||
else
|
||
return PyString_FromStringAndSize(s+i, j-i);
|
||
}
|
||
|
||
|
||
static char strip__doc__[] =
|
||
"S.strip() -> string\n\
|
||
\n\
|
||
Return a copy of the string S with leading and trailing\n\
|
||
whitespace removed.";
|
||
|
||
static PyObject *
|
||
string_strip(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
return do_strip(self, args, BOTHSTRIP);
|
||
}
|
||
|
||
|
||
static char lstrip__doc__[] =
|
||
"S.lstrip() -> string\n\
|
||
\n\
|
||
Return a copy of the string S with leading whitespace removed.";
|
||
|
||
static PyObject *
|
||
string_lstrip(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
return do_strip(self, args, LEFTSTRIP);
|
||
}
|
||
|
||
|
||
static char rstrip__doc__[] =
|
||
"S.rstrip() -> string\n\
|
||
\n\
|
||
Return a copy of the string S with trailing whitespace removed.";
|
||
|
||
static PyObject *
|
||
string_rstrip(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
return do_strip(self, args, RIGHTSTRIP);
|
||
}
|
||
|
||
|
||
static char lower__doc__[] =
|
||
"S.lower() -> string\n\
|
||
\n\
|
||
Return a copy of the string S converted to lowercase.";
|
||
|
||
static PyObject *
|
||
string_lower(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
char *s = PyString_AS_STRING(self), *s_new;
|
||
int i, n = PyString_GET_SIZE(self);
|
||
PyObject *new;
|
||
|
||
if (!PyArg_ParseTuple(args, ":lower"))
|
||
return NULL;
|
||
new = PyString_FromStringAndSize(NULL, n);
|
||
if (new == NULL)
|
||
return NULL;
|
||
s_new = PyString_AsString(new);
|
||
for (i = 0; i < n; i++) {
|
||
int c = Py_CHARMASK(*s++);
|
||
if (isupper(c)) {
|
||
*s_new = tolower(c);
|
||
} else
|
||
*s_new = c;
|
||
s_new++;
|
||
}
|
||
return new;
|
||
}
|
||
|
||
|
||
static char upper__doc__[] =
|
||
"S.upper() -> string\n\
|
||
\n\
|
||
Return a copy of the string S converted to uppercase.";
|
||
|
||
static PyObject *
|
||
string_upper(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
char *s = PyString_AS_STRING(self), *s_new;
|
||
int i, n = PyString_GET_SIZE(self);
|
||
PyObject *new;
|
||
|
||
if (!PyArg_ParseTuple(args, ":upper"))
|
||
return NULL;
|
||
new = PyString_FromStringAndSize(NULL, n);
|
||
if (new == NULL)
|
||
return NULL;
|
||
s_new = PyString_AsString(new);
|
||
for (i = 0; i < n; i++) {
|
||
int c = Py_CHARMASK(*s++);
|
||
if (islower(c)) {
|
||
*s_new = toupper(c);
|
||
} else
|
||
*s_new = c;
|
||
s_new++;
|
||
}
|
||
return new;
|
||
}
|
||
|
||
|
||
static char capitalize__doc__[] =
|
||
"S.capitalize() -> string\n\
|
||
\n\
|
||
Return a copy of the string S with only its first character\n\
|
||
capitalized.";
|
||
|
||
static PyObject *
|
||
string_capitalize(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
char *s = PyString_AS_STRING(self), *s_new;
|
||
int i, n = PyString_GET_SIZE(self);
|
||
PyObject *new;
|
||
|
||
if (!PyArg_ParseTuple(args, ":capitalize"))
|
||
return NULL;
|
||
new = PyString_FromStringAndSize(NULL, n);
|
||
if (new == NULL)
|
||
return NULL;
|
||
s_new = PyString_AsString(new);
|
||
if (0 < n) {
|
||
int c = Py_CHARMASK(*s++);
|
||
if (islower(c))
|
||
*s_new = toupper(c);
|
||
else
|
||
*s_new = c;
|
||
s_new++;
|
||
}
|
||
for (i = 1; i < n; i++) {
|
||
int c = Py_CHARMASK(*s++);
|
||
if (isupper(c))
|
||
*s_new = tolower(c);
|
||
else
|
||
*s_new = c;
|
||
s_new++;
|
||
}
|
||
return new;
|
||
}
|
||
|
||
|
||
static char count__doc__[] =
|
||
"S.count(sub[, start[, end]]) -> int\n\
|
||
\n\
|
||
Return the number of occurrences of substring sub in string\n\
|
||
S[start:end]. Optional arguments start and end are\n\
|
||
interpreted as in slice notation.";
|
||
|
||
static PyObject *
|
||
string_count(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
char *s = PyString_AS_STRING(self), *sub;
|
||
int len = PyString_GET_SIZE(self), n;
|
||
int i = 0, last = INT_MAX;
|
||
int m, r;
|
||
|
||
if (!PyArg_ParseTuple(args, "t#|ii:count", &sub, &n, &i, &last))
|
||
return NULL;
|
||
if (last > len)
|
||
last = len;
|
||
if (last < 0)
|
||
last += len;
|
||
if (last < 0)
|
||
last = 0;
|
||
if (i < 0)
|
||
i += len;
|
||
if (i < 0)
|
||
i = 0;
|
||
m = last + 1 - n;
|
||
if (n == 0)
|
||
return PyInt_FromLong((long) (m-i));
|
||
|
||
r = 0;
|
||
while (i < m) {
|
||
if (!memcmp(s+i, sub, n)) {
|
||
r++;
|
||
i += n;
|
||
} else {
|
||
i++;
|
||
}
|
||
}
|
||
return PyInt_FromLong((long) r);
|
||
}
|
||
|
||
|
||
static char swapcase__doc__[] =
|
||
"S.swapcase() -> string\n\
|
||
\n\
|
||
Return a copy of the string S with upper case characters\n\
|
||
converted to lowercase and vice versa.";
|
||
|
||
static PyObject *
|
||
string_swapcase(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
char *s = PyString_AS_STRING(self), *s_new;
|
||
int i, n = PyString_GET_SIZE(self);
|
||
PyObject *new;
|
||
|
||
if (!PyArg_ParseTuple(args, ":swapcase"))
|
||
return NULL;
|
||
new = PyString_FromStringAndSize(NULL, n);
|
||
if (new == NULL)
|
||
return NULL;
|
||
s_new = PyString_AsString(new);
|
||
for (i = 0; i < n; i++) {
|
||
int c = Py_CHARMASK(*s++);
|
||
if (islower(c)) {
|
||
*s_new = toupper(c);
|
||
}
|
||
else if (isupper(c)) {
|
||
*s_new = tolower(c);
|
||
}
|
||
else
|
||
*s_new = c;
|
||
s_new++;
|
||
}
|
||
return new;
|
||
}
|
||
|
||
|
||
static char translate__doc__[] =
|
||
"S.translate(table [,deletechars]) -> string\n\
|
||
\n\
|
||
Return a copy of the string S, where all characters occurring\n\
|
||
in the optional argument deletechars are removed, and the\n\
|
||
remaining characters have been mapped through the given\n\
|
||
translation table, which must be a string of length 256.";
|
||
|
||
static PyObject *
|
||
string_translate(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
register char *input, *table, *output;
|
||
register int i, c, changed = 0;
|
||
PyObject *input_obj = (PyObject*)self;
|
||
char *table1, *output_start, *del_table=NULL;
|
||
int inlen, tablen, dellen = 0;
|
||
PyObject *result;
|
||
int trans_table[256];
|
||
|
||
if (!PyArg_ParseTuple(args, "t#|t#:translate",
|
||
&table1, &tablen, &del_table, &dellen))
|
||
return NULL;
|
||
if (tablen != 256) {
|
||
PyErr_SetString(PyExc_ValueError,
|
||
"translation table must be 256 characters long");
|
||
return NULL;
|
||
}
|
||
|
||
table = table1;
|
||
inlen = PyString_Size(input_obj);
|
||
result = PyString_FromStringAndSize((char *)NULL, inlen);
|
||
if (result == NULL)
|
||
return NULL;
|
||
output_start = output = PyString_AsString(result);
|
||
input = PyString_AsString(input_obj);
|
||
|
||
if (dellen == 0) {
|
||
/* If no deletions are required, use faster code */
|
||
for (i = inlen; --i >= 0; ) {
|
||
c = Py_CHARMASK(*input++);
|
||
if (Py_CHARMASK((*output++ = table[c])) != c)
|
||
changed = 1;
|
||
}
|
||
if (changed)
|
||
return result;
|
||
Py_DECREF(result);
|
||
Py_INCREF(input_obj);
|
||
return input_obj;
|
||
}
|
||
|
||
for (i = 0; i < 256; i++)
|
||
trans_table[i] = Py_CHARMASK(table[i]);
|
||
|
||
for (i = 0; i < dellen; i++)
|
||
trans_table[(int) Py_CHARMASK(del_table[i])] = -1;
|
||
|
||
for (i = inlen; --i >= 0; ) {
|
||
c = Py_CHARMASK(*input++);
|
||
if (trans_table[c] != -1)
|
||
if (Py_CHARMASK(*output++ = (char)trans_table[c]) == c)
|
||
continue;
|
||
changed = 1;
|
||
}
|
||
if (!changed) {
|
||
Py_DECREF(result);
|
||
Py_INCREF(input_obj);
|
||
return input_obj;
|
||
}
|
||
/* Fix the size of the resulting string */
|
||
if (inlen > 0 &&_PyString_Resize(&result, output-output_start))
|
||
return NULL;
|
||
return result;
|
||
}
|
||
|
||
|
||
/* What follows is used for implementing replace(). Perry Stoll. */
|
||
|
||
/*
|
||
mymemfind
|
||
|
||
strstr replacement for arbitrary blocks of memory.
|
||
|
||
Locates the first occurance in the memory pointed to by MEM of the
|
||
contents of memory pointed to by PAT. Returns the index into MEM if
|
||
found, or -1 if not found. If len of PAT is greater than length of
|
||
MEM, the function returns -1.
|
||
*/
|
||
static int
|
||
mymemfind(mem, len, pat, pat_len)
|
||
char *mem;
|
||
int len;
|
||
char *pat;
|
||
int pat_len;
|
||
{
|
||
register int ii;
|
||
|
||
/* pattern can not occur in the last pat_len-1 chars */
|
||
len -= pat_len;
|
||
|
||
for (ii = 0; ii <= len; ii++) {
|
||
if (mem[ii] == pat[0] &&
|
||
(pat_len == 1 ||
|
||
memcmp(&mem[ii+1], &pat[1], pat_len-1) == 0)) {
|
||
return ii;
|
||
}
|
||
}
|
||
return -1;
|
||
}
|
||
|
||
/*
|
||
mymemcnt
|
||
|
||
Return the number of distinct times PAT is found in MEM.
|
||
meaning mem=1111 and pat==11 returns 2.
|
||
mem=11111 and pat==11 also return 2.
|
||
*/
|
||
static int
|
||
mymemcnt(mem, len, pat, pat_len)
|
||
char *mem;
|
||
int len;
|
||
char *pat;
|
||
int pat_len;
|
||
{
|
||
register int offset = 0;
|
||
int nfound = 0;
|
||
|
||
while (len >= 0) {
|
||
offset = mymemfind(mem, len, pat, pat_len);
|
||
if (offset == -1)
|
||
break;
|
||
mem += offset + pat_len;
|
||
len -= offset + pat_len;
|
||
nfound++;
|
||
}
|
||
return nfound;
|
||
}
|
||
|
||
/*
|
||
mymemreplace
|
||
|
||
Return a string in which all occurences of PAT in memory STR are
|
||
replaced with SUB.
|
||
|
||
If length of PAT is less than length of STR or there are no occurences
|
||
of PAT in STR, then the original string is returned. Otherwise, a new
|
||
string is allocated here and returned.
|
||
|
||
on return, out_len is:
|
||
the length of output string, or
|
||
-1 if the input string is returned, or
|
||
unchanged if an error occurs (no memory).
|
||
|
||
return value is:
|
||
the new string allocated locally, or
|
||
NULL if an error occurred.
|
||
*/
|
||
static char *
|
||
mymemreplace(str, len, pat, pat_len, sub, sub_len, count, out_len)
|
||
char *str;
|
||
int len; /* input string */
|
||
char *pat;
|
||
int pat_len; /* pattern string to find */
|
||
char *sub;
|
||
int sub_len; /* substitution string */
|
||
int count; /* number of replacements, 0 == all */
|
||
int *out_len;
|
||
|
||
{
|
||
char *out_s;
|
||
char *new_s;
|
||
int nfound, offset, new_len;
|
||
|
||
if (len == 0 || pat_len > len)
|
||
goto return_same;
|
||
|
||
/* find length of output string */
|
||
nfound = mymemcnt(str, len, pat, pat_len);
|
||
if (count > 0)
|
||
nfound = nfound > count ? count : nfound;
|
||
if (nfound == 0)
|
||
goto return_same;
|
||
new_len = len + nfound*(sub_len - pat_len);
|
||
|
||
new_s = (char *)malloc(new_len);
|
||
if (new_s == NULL) return NULL;
|
||
|
||
*out_len = new_len;
|
||
out_s = new_s;
|
||
|
||
while (len > 0) {
|
||
/* find index of next instance of pattern */
|
||
offset = mymemfind(str, len, pat, pat_len);
|
||
/* if not found, break out of loop */
|
||
if (offset == -1) break;
|
||
|
||
/* copy non matching part of input string */
|
||
memcpy(new_s, str, offset); /* copy part of str before pat */
|
||
str += offset + pat_len; /* move str past pattern */
|
||
len -= offset + pat_len; /* reduce length of str remaining */
|
||
|
||
/* copy substitute into the output string */
|
||
new_s += offset; /* move new_s to dest for sub string */
|
||
memcpy(new_s, sub, sub_len); /* copy substring into new_s */
|
||
new_s += sub_len; /* offset new_s past sub string */
|
||
|
||
/* break when we've done count replacements */
|
||
if (--count == 0) break;
|
||
}
|
||
/* copy any remaining values into output string */
|
||
if (len > 0)
|
||
memcpy(new_s, str, len);
|
||
return out_s;
|
||
|
||
return_same:
|
||
*out_len = -1;
|
||
return str;
|
||
}
|
||
|
||
|
||
static char replace__doc__[] =
|
||
"S.replace (old, new[, maxsplit]) -> string\n\
|
||
\n\
|
||
Return a copy of string S with all occurrences of substring\n\
|
||
old replaced by new. If the optional argument maxsplit is\n\
|
||
given, only the first maxsplit occurrences are replaced.";
|
||
|
||
static PyObject *
|
||
string_replace(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
char *str = PyString_AS_STRING(self), *pat,*sub,*new_s;
|
||
int len = PyString_GET_SIZE(self), pat_len,sub_len,out_len;
|
||
int count = 0;
|
||
PyObject *new;
|
||
|
||
if (!PyArg_ParseTuple(args, "t#t#|i:replace",
|
||
&pat, &pat_len, &sub, &sub_len, &count))
|
||
return NULL;
|
||
if (pat_len <= 0) {
|
||
PyErr_SetString(PyExc_ValueError, "empty pattern string");
|
||
return NULL;
|
||
}
|
||
new_s = mymemreplace(str,len,pat,pat_len,sub,sub_len,count,&out_len);
|
||
if (new_s == NULL) {
|
||
PyErr_NoMemory();
|
||
return NULL;
|
||
}
|
||
if (out_len == -1) {
|
||
/* we're returning another reference to self */
|
||
new = (PyObject*)self;
|
||
Py_INCREF(new);
|
||
}
|
||
else {
|
||
new = PyString_FromStringAndSize(new_s, out_len);
|
||
free(new_s);
|
||
}
|
||
return new;
|
||
}
|
||
|
||
|
||
static char startswith__doc__[] =
|
||
"S.startswith(prefix[, start[, end]]) -> int\n\
|
||
\n\
|
||
Return 1 if S starts with the specified prefix, otherwise return 0. With\n\
|
||
optional start, test S beginning at that position. With optional end, stop\n\
|
||
comparing S at that position.";
|
||
|
||
static PyObject *
|
||
string_startswith(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
char* str = PyString_AS_STRING(self);
|
||
int len = PyString_GET_SIZE(self);
|
||
char* prefix;
|
||
int plen;
|
||
int start = 0;
|
||
int end = -1;
|
||
|
||
if (!PyArg_ParseTuple(args, "t#|ii:startswith", &prefix, &plen, &start, &end))
|
||
return NULL;
|
||
|
||
/* adopt Java semantics for index out of range. it is legal for
|
||
* offset to be == plen, but this only returns true if prefix is
|
||
* the empty string.
|
||
*/
|
||
if (start < 0 || start+plen > len)
|
||
return PyInt_FromLong(0);
|
||
|
||
if (!memcmp(str+start, prefix, plen)) {
|
||
/* did the match end after the specified end? */
|
||
if (end < 0)
|
||
return PyInt_FromLong(1);
|
||
else if (end - start < plen)
|
||
return PyInt_FromLong(0);
|
||
else
|
||
return PyInt_FromLong(1);
|
||
}
|
||
else return PyInt_FromLong(0);
|
||
}
|
||
|
||
|
||
static char endswith__doc__[] =
|
||
"S.endswith(suffix[, start[, end]]) -> int\n\
|
||
\n\
|
||
Return 1 if S ends with the specified suffix, otherwise return 0. With\n\
|
||
optional start, test S beginning at that position. With optional end, stop\n\
|
||
comparing S at that position.";
|
||
|
||
static PyObject *
|
||
string_endswith(self, args)
|
||
PyStringObject *self;
|
||
PyObject *args;
|
||
{
|
||
char* str = PyString_AS_STRING(self);
|
||
int len = PyString_GET_SIZE(self);
|
||
char* suffix;
|
||
int plen;
|
||
int start = 0;
|
||
int end = -1;
|
||
int lower, upper;
|
||
|
||
if (!PyArg_ParseTuple(args, "t#|ii:endswith", &suffix, &plen, &start, &end))
|
||
return NULL;
|
||
|
||
if (start < 0 || start > len || plen > len)
|
||
return PyInt_FromLong(0);
|
||
|
||
upper = (end >= 0 && end <= len) ? end : len;
|
||
lower = (upper - plen) > start ? (upper - plen) : start;
|
||
|
||
if (upper-lower >= plen && !memcmp(str+lower, suffix, plen))
|
||
return PyInt_FromLong(1);
|
||
else return PyInt_FromLong(0);
|
||
}
|
||
|
||
|
||
|
||
static PyMethodDef
|
||
string_methods[] = {
|
||
/* counterparts of the obsolete stropmodule functions */
|
||
{"capitalize", (PyCFunction)string_capitalize, 1, capitalize__doc__},
|
||
{"count", (PyCFunction)string_count, 1, count__doc__},
|
||
{"endswith", (PyCFunction)string_endswith, 1, endswith__doc__},
|
||
{"find", (PyCFunction)string_find, 1, find__doc__},
|
||
{"index", (PyCFunction)string_index, 1, index__doc__},
|
||
{"join", (PyCFunction)string_join, 1, join__doc__},
|
||
{"lstrip", (PyCFunction)string_lstrip, 1, lstrip__doc__},
|
||
{"lower", (PyCFunction)string_lower, 1, lower__doc__},
|
||
/* maketrans */
|
||
{"replace", (PyCFunction)string_replace, 1, replace__doc__},
|
||
{"rfind", (PyCFunction)string_rfind, 1, rfind__doc__},
|
||
{"rindex", (PyCFunction)string_rindex, 1, rindex__doc__},
|
||
{"rstrip", (PyCFunction)string_rstrip, 1, rstrip__doc__},
|
||
{"split", (PyCFunction)string_split, 1, split__doc__},
|
||
{"startswith", (PyCFunction)string_startswith, 1, startswith__doc__},
|
||
{"strip", (PyCFunction)string_strip, 1, strip__doc__},
|
||
{"swapcase", (PyCFunction)string_swapcase, 1, swapcase__doc__},
|
||
{"translate", (PyCFunction)string_translate, 1, strip__doc__},
|
||
{"upper", (PyCFunction)string_upper, 1, upper__doc__},
|
||
/* TBD */
|
||
/* {"ljust" (PyCFunction)string_ljust, 1, ljust__doc__}, */
|
||
/* {"rjust" (PyCFunction)string_rjust, 1, rjust__doc__}, */
|
||
/* {"center" (PyCFunction)string_center, 1, center__doc__}, */
|
||
/* {"zfill" (PyCFunction)string_zfill, 1, zfill__doc__}, */
|
||
/* {"expandtabs" (PyCFunction)string_expandtabs, 1, ljust__doc__}, */
|
||
/* {"capwords" (PyCFunction)string_capwords, 1, capwords__doc__}, */
|
||
{NULL, NULL} /* sentinel */
|
||
};
|
||
|
||
static PyObject *
|
||
string_getattr(s, name)
|
||
PyStringObject *s;
|
||
char *name;
|
||
{
|
||
return Py_FindMethod(string_methods, (PyObject*)s, name);
|
||
}
|
||
|
||
|
||
PyTypeObject PyString_Type = {
|
||
PyObject_HEAD_INIT(&PyType_Type)
|
||
0,
|
||
"string",
|
||
sizeof(PyStringObject),
|
||
sizeof(char),
|
||
(destructor)string_dealloc, /*tp_dealloc*/
|
||
(printfunc)string_print, /*tp_print*/
|
||
(getattrfunc)string_getattr, /*tp_getattr*/
|
||
0, /*tp_setattr*/
|
||
(cmpfunc)string_compare, /*tp_compare*/
|
||
(reprfunc)string_repr, /*tp_repr*/
|
||
0, /*tp_as_number*/
|
||
&string_as_sequence, /*tp_as_sequence*/
|
||
0, /*tp_as_mapping*/
|
||
(hashfunc)string_hash, /*tp_hash*/
|
||
0, /*tp_call*/
|
||
0, /*tp_str*/
|
||
0, /*tp_getattro*/
|
||
0, /*tp_setattro*/
|
||
&string_as_buffer, /*tp_as_buffer*/
|
||
Py_TPFLAGS_DEFAULT, /*tp_flags*/
|
||
0, /*tp_doc*/
|
||
};
|
||
|
||
void
|
||
PyString_Concat(pv, w)
|
||
register PyObject **pv;
|
||
register PyObject *w;
|
||
{
|
||
register PyObject *v;
|
||
if (*pv == NULL)
|
||
return;
|
||
if (w == NULL || !PyString_Check(*pv)) {
|
||
Py_DECREF(*pv);
|
||
*pv = NULL;
|
||
return;
|
||
}
|
||
v = string_concat((PyStringObject *) *pv, w);
|
||
Py_DECREF(*pv);
|
||
*pv = v;
|
||
}
|
||
|
||
void
|
||
PyString_ConcatAndDel(pv, w)
|
||
register PyObject **pv;
|
||
register PyObject *w;
|
||
{
|
||
PyString_Concat(pv, w);
|
||
Py_XDECREF(w);
|
||
}
|
||
|
||
|
||
/* The following function breaks the notion that strings are immutable:
|
||
it changes the size of a string. We get away with this only if there
|
||
is only one module referencing the object. You can also think of it
|
||
as creating a new string object and destroying the old one, only
|
||
more efficiently. In any case, don't use this if the string may
|
||
already be known to some other part of the code... */
|
||
|
||
int
|
||
_PyString_Resize(pv, newsize)
|
||
PyObject **pv;
|
||
int newsize;
|
||
{
|
||
register PyObject *v;
|
||
register PyStringObject *sv;
|
||
v = *pv;
|
||
if (!PyString_Check(v) || v->ob_refcnt != 1) {
|
||
*pv = 0;
|
||
Py_DECREF(v);
|
||
PyErr_BadInternalCall();
|
||
return -1;
|
||
}
|
||
/* XXX UNREF/NEWREF interface should be more symmetrical */
|
||
#ifdef Py_REF_DEBUG
|
||
--_Py_RefTotal;
|
||
#endif
|
||
_Py_ForgetReference(v);
|
||
*pv = (PyObject *)
|
||
realloc((char *)v,
|
||
sizeof(PyStringObject) + newsize * sizeof(char));
|
||
if (*pv == NULL) {
|
||
PyMem_DEL(v);
|
||
PyErr_NoMemory();
|
||
return -1;
|
||
}
|
||
_Py_NewReference(*pv);
|
||
sv = (PyStringObject *) *pv;
|
||
sv->ob_size = newsize;
|
||
sv->ob_sval[newsize] = '\0';
|
||
return 0;
|
||
}
|
||
|
||
/* Helpers for formatstring */
|
||
|
||
static PyObject *
|
||
getnextarg(args, arglen, p_argidx)
|
||
PyObject *args;
|
||
int arglen;
|
||
int *p_argidx;
|
||
{
|
||
int argidx = *p_argidx;
|
||
if (argidx < arglen) {
|
||
(*p_argidx)++;
|
||
if (arglen < 0)
|
||
return args;
|
||
else
|
||
return PyTuple_GetItem(args, argidx);
|
||
}
|
||
PyErr_SetString(PyExc_TypeError,
|
||
"not enough arguments for format string");
|
||
return NULL;
|
||
}
|
||
|
||
#define F_LJUST (1<<0)
|
||
#define F_SIGN (1<<1)
|
||
#define F_BLANK (1<<2)
|
||
#define F_ALT (1<<3)
|
||
#define F_ZERO (1<<4)
|
||
|
||
static int
|
||
formatfloat(buf, flags, prec, type, v)
|
||
char *buf;
|
||
int flags;
|
||
int prec;
|
||
int type;
|
||
PyObject *v;
|
||
{
|
||
char fmt[20];
|
||
double x;
|
||
if (!PyArg_Parse(v, "d;float argument required", &x))
|
||
return -1;
|
||
if (prec < 0)
|
||
prec = 6;
|
||
if (prec > 50)
|
||
prec = 50; /* Arbitrary limitation */
|
||
if (type == 'f' && fabs(x)/1e25 >= 1e25)
|
||
type = 'g';
|
||
sprintf(fmt, "%%%s.%d%c", (flags&F_ALT) ? "#" : "", prec, type);
|
||
sprintf(buf, fmt, x);
|
||
return strlen(buf);
|
||
}
|
||
|
||
static int
|
||
formatint(buf, flags, prec, type, v)
|
||
char *buf;
|
||
int flags;
|
||
int prec;
|
||
int type;
|
||
PyObject *v;
|
||
{
|
||
char fmt[20];
|
||
long x;
|
||
if (!PyArg_Parse(v, "l;int argument required", &x))
|
||
return -1;
|
||
if (prec < 0)
|
||
prec = 1;
|
||
sprintf(fmt, "%%%s.%dl%c", (flags&F_ALT) ? "#" : "", prec, type);
|
||
sprintf(buf, fmt, x);
|
||
return strlen(buf);
|
||
}
|
||
|
||
static int
|
||
formatchar(buf, v)
|
||
char *buf;
|
||
PyObject *v;
|
||
{
|
||
if (PyString_Check(v)) {
|
||
if (!PyArg_Parse(v, "c;%c requires int or char", &buf[0]))
|
||
return -1;
|
||
}
|
||
else {
|
||
if (!PyArg_Parse(v, "b;%c requires int or char", &buf[0]))
|
||
return -1;
|
||
}
|
||
buf[1] = '\0';
|
||
return 1;
|
||
}
|
||
|
||
|
||
/* fmt%(v1,v2,...) is roughly equivalent to sprintf(fmt, v1, v2, ...) */
|
||
|
||
PyObject *
|
||
PyString_Format(format, args)
|
||
PyObject *format;
|
||
PyObject *args;
|
||
{
|
||
char *fmt, *res;
|
||
int fmtcnt, rescnt, reslen, arglen, argidx;
|
||
int args_owned = 0;
|
||
PyObject *result;
|
||
PyObject *dict = NULL;
|
||
if (format == NULL || !PyString_Check(format) || args == NULL) {
|
||
PyErr_BadInternalCall();
|
||
return NULL;
|
||
}
|
||
fmt = PyString_AsString(format);
|
||
fmtcnt = PyString_Size(format);
|
||
reslen = rescnt = fmtcnt + 100;
|
||
result = PyString_FromStringAndSize((char *)NULL, reslen);
|
||
if (result == NULL)
|
||
return NULL;
|
||
res = PyString_AsString(result);
|
||
if (PyTuple_Check(args)) {
|
||
arglen = PyTuple_Size(args);
|
||
argidx = 0;
|
||
}
|
||
else {
|
||
arglen = -1;
|
||
argidx = -2;
|
||
}
|
||
if (args->ob_type->tp_as_mapping)
|
||
dict = args;
|
||
while (--fmtcnt >= 0) {
|
||
if (*fmt != '%') {
|
||
if (--rescnt < 0) {
|
||
rescnt = fmtcnt + 100;
|
||
reslen += rescnt;
|
||
if (_PyString_Resize(&result, reslen) < 0)
|
||
return NULL;
|
||
res = PyString_AsString(result)
|
||
+ reslen - rescnt;
|
||
--rescnt;
|
||
}
|
||
*res++ = *fmt++;
|
||
}
|
||
else {
|
||
/* Got a format specifier */
|
||
int flags = 0;
|
||
int width = -1;
|
||
int prec = -1;
|
||
int size = 0;
|
||
int c = '\0';
|
||
int fill;
|
||
PyObject *v = NULL;
|
||
PyObject *temp = NULL;
|
||
char *buf;
|
||
int sign;
|
||
int len;
|
||
char tmpbuf[120]; /* For format{float,int,char}() */
|
||
fmt++;
|
||
if (*fmt == '(') {
|
||
char *keystart;
|
||
int keylen;
|
||
PyObject *key;
|
||
int pcount = 1;
|
||
|
||
if (dict == NULL) {
|
||
PyErr_SetString(PyExc_TypeError,
|
||
"format requires a mapping");
|
||
goto error;
|
||
}
|
||
++fmt;
|
||
--fmtcnt;
|
||
keystart = fmt;
|
||
/* Skip over balanced parentheses */
|
||
while (pcount > 0 && --fmtcnt >= 0) {
|
||
if (*fmt == ')')
|
||
--pcount;
|
||
else if (*fmt == '(')
|
||
++pcount;
|
||
fmt++;
|
||
}
|
||
keylen = fmt - keystart - 1;
|
||
if (fmtcnt < 0 || pcount > 0) {
|
||
PyErr_SetString(PyExc_ValueError,
|
||
"incomplete format key");
|
||
goto error;
|
||
}
|
||
key = PyString_FromStringAndSize(keystart,
|
||
keylen);
|
||
if (key == NULL)
|
||
goto error;
|
||
if (args_owned) {
|
||
Py_DECREF(args);
|
||
args_owned = 0;
|
||
}
|
||
args = PyObject_GetItem(dict, key);
|
||
Py_DECREF(key);
|
||
if (args == NULL) {
|
||
goto error;
|
||
}
|
||
args_owned = 1;
|
||
arglen = -1;
|
||
argidx = -2;
|
||
}
|
||
while (--fmtcnt >= 0) {
|
||
switch (c = *fmt++) {
|
||
case '-': flags |= F_LJUST; continue;
|
||
case '+': flags |= F_SIGN; continue;
|
||
case ' ': flags |= F_BLANK; continue;
|
||
case '#': flags |= F_ALT; continue;
|
||
case '0': flags |= F_ZERO; continue;
|
||
}
|
||
break;
|
||
}
|
||
if (c == '*') {
|
||
v = getnextarg(args, arglen, &argidx);
|
||
if (v == NULL)
|
||
goto error;
|
||
if (!PyInt_Check(v)) {
|
||
PyErr_SetString(PyExc_TypeError,
|
||
"* wants int");
|
||
goto error;
|
||
}
|
||
width = PyInt_AsLong(v);
|
||
if (width < 0) {
|
||
flags |= F_LJUST;
|
||
width = -width;
|
||
}
|
||
if (--fmtcnt >= 0)
|
||
c = *fmt++;
|
||
}
|
||
else if (c >= 0 && isdigit(c)) {
|
||
width = c - '0';
|
||
while (--fmtcnt >= 0) {
|
||
c = Py_CHARMASK(*fmt++);
|
||
if (!isdigit(c))
|
||
break;
|
||
if ((width*10) / 10 != width) {
|
||
PyErr_SetString(
|
||
PyExc_ValueError,
|
||
"width too big");
|
||
goto error;
|
||
}
|
||
width = width*10 + (c - '0');
|
||
}
|
||
}
|
||
if (c == '.') {
|
||
prec = 0;
|
||
if (--fmtcnt >= 0)
|
||
c = *fmt++;
|
||
if (c == '*') {
|
||
v = getnextarg(args, arglen, &argidx);
|
||
if (v == NULL)
|
||
goto error;
|
||
if (!PyInt_Check(v)) {
|
||
PyErr_SetString(
|
||
PyExc_TypeError,
|
||
"* wants int");
|
||
goto error;
|
||
}
|
||
prec = PyInt_AsLong(v);
|
||
if (prec < 0)
|
||
prec = 0;
|
||
if (--fmtcnt >= 0)
|
||
c = *fmt++;
|
||
}
|
||
else if (c >= 0 && isdigit(c)) {
|
||
prec = c - '0';
|
||
while (--fmtcnt >= 0) {
|
||
c = Py_CHARMASK(*fmt++);
|
||
if (!isdigit(c))
|
||
break;
|
||
if ((prec*10) / 10 != prec) {
|
||
PyErr_SetString(
|
||
PyExc_ValueError,
|
||
"prec too big");
|
||
goto error;
|
||
}
|
||
prec = prec*10 + (c - '0');
|
||
}
|
||
}
|
||
} /* prec */
|
||
if (fmtcnt >= 0) {
|
||
if (c == 'h' || c == 'l' || c == 'L') {
|
||
size = c;
|
||
if (--fmtcnt >= 0)
|
||
c = *fmt++;
|
||
}
|
||
}
|
||
if (fmtcnt < 0) {
|
||
PyErr_SetString(PyExc_ValueError,
|
||
"incomplete format");
|
||
goto error;
|
||
}
|
||
if (c != '%') {
|
||
v = getnextarg(args, arglen, &argidx);
|
||
if (v == NULL)
|
||
goto error;
|
||
}
|
||
sign = 0;
|
||
fill = ' ';
|
||
switch (c) {
|
||
case '%':
|
||
buf = "%";
|
||
len = 1;
|
||
break;
|
||
case 's':
|
||
temp = PyObject_Str(v);
|
||
if (temp == NULL)
|
||
goto error;
|
||
if (!PyString_Check(temp)) {
|
||
PyErr_SetString(PyExc_TypeError,
|
||
"%s argument has non-string str()");
|
||
goto error;
|
||
}
|
||
buf = PyString_AsString(temp);
|
||
len = PyString_Size(temp);
|
||
if (prec >= 0 && len > prec)
|
||
len = prec;
|
||
break;
|
||
case 'i':
|
||
case 'd':
|
||
case 'u':
|
||
case 'o':
|
||
case 'x':
|
||
case 'X':
|
||
if (c == 'i')
|
||
c = 'd';
|
||
buf = tmpbuf;
|
||
len = formatint(buf, flags, prec, c, v);
|
||
if (len < 0)
|
||
goto error;
|
||
sign = (c == 'd');
|
||
if (flags&F_ZERO) {
|
||
fill = '0';
|
||
if ((flags&F_ALT) &&
|
||
(c == 'x' || c == 'X') &&
|
||
buf[0] == '0' && buf[1] == c) {
|
||
*res++ = *buf++;
|
||
*res++ = *buf++;
|
||
rescnt -= 2;
|
||
len -= 2;
|
||
width -= 2;
|
||
if (width < 0)
|
||
width = 0;
|
||
}
|
||
}
|
||
break;
|
||
case 'e':
|
||
case 'E':
|
||
case 'f':
|
||
case 'g':
|
||
case 'G':
|
||
buf = tmpbuf;
|
||
len = formatfloat(buf, flags, prec, c, v);
|
||
if (len < 0)
|
||
goto error;
|
||
sign = 1;
|
||
if (flags&F_ZERO)
|
||
fill = '0';
|
||
break;
|
||
case 'c':
|
||
buf = tmpbuf;
|
||
len = formatchar(buf, v);
|
||
if (len < 0)
|
||
goto error;
|
||
break;
|
||
default:
|
||
PyErr_Format(PyExc_ValueError,
|
||
"unsupported format character '%c' (0x%x)",
|
||
c, c);
|
||
goto error;
|
||
}
|
||
if (sign) {
|
||
if (*buf == '-' || *buf == '+') {
|
||
sign = *buf++;
|
||
len--;
|
||
}
|
||
else if (flags & F_SIGN)
|
||
sign = '+';
|
||
else if (flags & F_BLANK)
|
||
sign = ' ';
|
||
else
|
||
sign = '\0';
|
||
}
|
||
if (width < len)
|
||
width = len;
|
||
if (rescnt < width + (sign != '\0')) {
|
||
reslen -= rescnt;
|
||
rescnt = width + fmtcnt + 100;
|
||
reslen += rescnt;
|
||
if (_PyString_Resize(&result, reslen) < 0)
|
||
return NULL;
|
||
res = PyString_AsString(result)
|
||
+ reslen - rescnt;
|
||
}
|
||
if (sign) {
|
||
if (fill != ' ')
|
||
*res++ = sign;
|
||
rescnt--;
|
||
if (width > len)
|
||
width--;
|
||
}
|
||
if (width > len && !(flags&F_LJUST)) {
|
||
do {
|
||
--rescnt;
|
||
*res++ = fill;
|
||
} while (--width > len);
|
||
}
|
||
if (sign && fill == ' ')
|
||
*res++ = sign;
|
||
memcpy(res, buf, len);
|
||
res += len;
|
||
rescnt -= len;
|
||
while (--width >= len) {
|
||
--rescnt;
|
||
*res++ = ' ';
|
||
}
|
||
if (dict && (argidx < arglen) && c != '%') {
|
||
PyErr_SetString(PyExc_TypeError,
|
||
"not all arguments converted");
|
||
goto error;
|
||
}
|
||
Py_XDECREF(temp);
|
||
} /* '%' */
|
||
} /* until end */
|
||
if (argidx < arglen && !dict) {
|
||
PyErr_SetString(PyExc_TypeError,
|
||
"not all arguments converted");
|
||
goto error;
|
||
}
|
||
if (args_owned) {
|
||
Py_DECREF(args);
|
||
}
|
||
_PyString_Resize(&result, reslen - rescnt);
|
||
return result;
|
||
error:
|
||
Py_DECREF(result);
|
||
if (args_owned) {
|
||
Py_DECREF(args);
|
||
}
|
||
return NULL;
|
||
}
|
||
|
||
|
||
#ifdef INTERN_STRINGS
|
||
|
||
static PyObject *interned;
|
||
|
||
void
|
||
PyString_InternInPlace(p)
|
||
PyObject **p;
|
||
{
|
||
register PyStringObject *s = (PyStringObject *)(*p);
|
||
PyObject *t;
|
||
if (s == NULL || !PyString_Check(s))
|
||
Py_FatalError("PyString_InternInPlace: strings only please!");
|
||
if ((t = s->ob_sinterned) != NULL) {
|
||
if (t == (PyObject *)s)
|
||
return;
|
||
Py_INCREF(t);
|
||
*p = t;
|
||
Py_DECREF(s);
|
||
return;
|
||
}
|
||
if (interned == NULL) {
|
||
interned = PyDict_New();
|
||
if (interned == NULL)
|
||
return;
|
||
}
|
||
if ((t = PyDict_GetItem(interned, (PyObject *)s)) != NULL) {
|
||
Py_INCREF(t);
|
||
*p = s->ob_sinterned = t;
|
||
Py_DECREF(s);
|
||
return;
|
||
}
|
||
t = (PyObject *)s;
|
||
if (PyDict_SetItem(interned, t, t) == 0) {
|
||
s->ob_sinterned = t;
|
||
return;
|
||
}
|
||
PyErr_Clear();
|
||
}
|
||
|
||
|
||
PyObject *
|
||
PyString_InternFromString(cp)
|
||
const char *cp;
|
||
{
|
||
PyObject *s = PyString_FromString(cp);
|
||
if (s == NULL)
|
||
return NULL;
|
||
PyString_InternInPlace(&s);
|
||
return s;
|
||
}
|
||
|
||
#endif
|
||
|
||
void
|
||
PyString_Fini()
|
||
{
|
||
int i;
|
||
for (i = 0; i < UCHAR_MAX + 1; i++) {
|
||
Py_XDECREF(characters[i]);
|
||
characters[i] = NULL;
|
||
}
|
||
#ifndef DONT_SHARE_SHORT_STRINGS
|
||
Py_XDECREF(nullstring);
|
||
nullstring = NULL;
|
||
#endif
|
||
#ifdef INTERN_STRINGS
|
||
if (interned) {
|
||
int pos, changed;
|
||
PyObject *key, *value;
|
||
do {
|
||
changed = 0;
|
||
pos = 0;
|
||
while (PyDict_Next(interned, &pos, &key, &value)) {
|
||
if (key->ob_refcnt == 2 && key == value) {
|
||
PyDict_DelItem(interned, key);
|
||
changed = 1;
|
||
}
|
||
}
|
||
} while (changed);
|
||
}
|
||
#endif
|
||
}
|