Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
C
cpython
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
cpython
Commits
2f8bfef1
Commit
2f8bfef1
authored
Sep 07, 2016
by
Benjamin Peterson
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
replace PY_SIZE_MAX with SIZE_MAX
parent
c75abff5
Changes
12
Hide whitespace changes
Inline
Side-by-side
Showing
12 changed files
with
18 additions
and
26 deletions
+18
-26
Include/pyport.h
Include/pyport.h
+1
-9
Modules/_elementtree.c
Modules/_elementtree.c
+1
-1
Modules/_tkinter.c
Modules/_tkinter.c
+1
-1
Modules/_tracemalloc.c
Modules/_tracemalloc.c
+2
-2
Modules/audioop.c
Modules/audioop.c
+1
-1
Objects/listobject.c
Objects/listobject.c
+2
-2
Objects/longobject.c
Objects/longobject.c
+1
-1
Objects/obmalloc.c
Objects/obmalloc.c
+1
-1
Parser/node.c
Parser/node.c
+1
-1
Python/asdl.c
Python/asdl.c
+4
-4
Python/ast.c
Python/ast.c
+1
-1
Python/compile.c
Python/compile.c
+2
-2
No files found.
Include/pyport.h
View file @
2f8bfef1
...
...
@@ -115,16 +115,8 @@ typedef Py_ssize_t Py_ssize_clean_t;
typedef
int
Py_ssize_clean_t
;
#endif
/* Largest possible value of size_t.
SIZE_MAX is part of C99, so it might be defined on some
platforms. If it is not defined, (size_t)-1 is a portable
definition for C89, due to the way signed->unsigned
conversion is defined. */
#ifdef SIZE_MAX
/* Largest possible value of size_t. */
#define PY_SIZE_MAX SIZE_MAX
#else
#define PY_SIZE_MAX ((size_t)-1)
#endif
/* Largest positive value of type Py_ssize_t. */
#define PY_SSIZE_T_MAX ((Py_ssize_t)(((size_t)-1)>>1))
...
...
Modules/_elementtree.c
View file @
2f8bfef1
...
...
@@ -1787,7 +1787,7 @@ element_ass_subscr(PyObject* self_, PyObject* item, PyObject* value)
step
=
-
step
;
}
assert
((
size_t
)
slicelen
<=
PY_
SIZE_MAX
/
sizeof
(
PyObject
*
));
assert
((
size_t
)
slicelen
<=
SIZE_MAX
/
sizeof
(
PyObject
*
));
/* recycle is a list that will contain all the children
* scheduled for removal.
...
...
Modules/_tkinter.c
View file @
2f8bfef1
...
...
@@ -976,7 +976,7 @@ static PyType_Spec PyTclObject_Type_spec = {
};
#if
PY_
SIZE_MAX > INT_MAX
#if SIZE_MAX > INT_MAX
#define CHECK_STRING_LENGTH(s) do { \
if (s != NULL && strlen(s) >= INT_MAX) { \
PyErr_SetString(PyExc_OverflowError, "string is too long"); \
...
...
Modules/_tracemalloc.c
View file @
2f8bfef1
...
...
@@ -655,7 +655,7 @@ tracemalloc_add_trace(_PyTraceMalloc_domain_t domain, uintptr_t ptr,
}
}
assert
(
tracemalloc_traced_memory
<=
PY_
SIZE_MAX
-
size
);
assert
(
tracemalloc_traced_memory
<=
SIZE_MAX
-
size
);
tracemalloc_traced_memory
+=
size
;
if
(
tracemalloc_traced_memory
>
tracemalloc_peak_traced_memory
)
tracemalloc_peak_traced_memory
=
tracemalloc_traced_memory
;
...
...
@@ -672,7 +672,7 @@ tracemalloc_alloc(int use_calloc, void *ctx, size_t nelem, size_t elsize)
PyMemAllocatorEx
*
alloc
=
(
PyMemAllocatorEx
*
)
ctx
;
void
*
ptr
;
assert
(
elsize
==
0
||
nelem
<=
PY_
SIZE_MAX
/
elsize
);
assert
(
elsize
==
0
||
nelem
<=
SIZE_MAX
/
elsize
);
if
(
use_calloc
)
ptr
=
alloc
->
calloc
(
alloc
->
ctx
,
nelem
,
elsize
);
...
...
Modules/audioop.c
View file @
2f8bfef1
...
...
@@ -1337,7 +1337,7 @@ audioop_ratecv_impl(PyObject *module, Py_buffer *fragment, int width,
weightA
/=
d
;
weightB
/=
d
;
if
((
size_t
)
nchannels
>
PY_
SIZE_MAX
/
sizeof
(
int
))
{
if
((
size_t
)
nchannels
>
SIZE_MAX
/
sizeof
(
int
))
{
PyErr_SetString
(
PyExc_MemoryError
,
"not enough memory for output buffer"
);
return
NULL
;
...
...
Objects/listobject.c
View file @
2f8bfef1
...
...
@@ -49,7 +49,7 @@ list_resize(PyListObject *self, Py_ssize_t newsize)
new_allocated
=
(
newsize
>>
3
)
+
(
newsize
<
9
?
3
:
6
);
/* check for integer overflow */
if
(
new_allocated
>
PY_
SIZE_MAX
-
newsize
)
{
if
(
new_allocated
>
SIZE_MAX
-
newsize
)
{
PyErr_NoMemory
();
return
-
1
;
}
else
{
...
...
@@ -59,7 +59,7 @@ list_resize(PyListObject *self, Py_ssize_t newsize)
if
(
newsize
==
0
)
new_allocated
=
0
;
items
=
self
->
ob_item
;
if
(
new_allocated
<=
(
PY_
SIZE_MAX
/
sizeof
(
PyObject
*
)))
if
(
new_allocated
<=
(
SIZE_MAX
/
sizeof
(
PyObject
*
)))
PyMem_RESIZE
(
items
,
PyObject
*
,
new_allocated
);
else
items
=
NULL
;
...
...
Objects/longobject.c
View file @
2f8bfef1
...
...
@@ -721,7 +721,7 @@ _PyLong_NumBits(PyObject *vv)
assert
(
ndigits
==
0
||
v
->
ob_digit
[
ndigits
-
1
]
!=
0
);
if
(
ndigits
>
0
)
{
digit
msd
=
v
->
ob_digit
[
ndigits
-
1
];
if
((
size_t
)(
ndigits
-
1
)
>
PY_
SIZE_MAX
/
(
size_t
)
PyLong_SHIFT
)
if
((
size_t
)(
ndigits
-
1
)
>
SIZE_MAX
/
(
size_t
)
PyLong_SHIFT
)
goto
Overflow
;
result
=
(
size_t
)(
ndigits
-
1
)
*
(
size_t
)
PyLong_SHIFT
;
do
{
...
...
Objects/obmalloc.c
View file @
2f8bfef1
...
...
@@ -1057,7 +1057,7 @@ new_arena(void)
if
(
numarenas
<=
maxarenas
)
return
NULL
;
/* overflow */
#if SIZEOF_SIZE_T <= SIZEOF_INT
if
(
numarenas
>
PY_
SIZE_MAX
/
sizeof
(
*
arenas
))
if
(
numarenas
>
SIZE_MAX
/
sizeof
(
*
arenas
))
return
NULL
;
/* overflow */
#endif
nbytes
=
numarenas
*
sizeof
(
*
arenas
);
...
...
Parser/node.c
View file @
2f8bfef1
...
...
@@ -91,7 +91,7 @@ PyNode_AddChild(node *n1, int type, char *str, int lineno, int col_offset)
if
(
current_capacity
<
0
||
required_capacity
<
0
)
return
E_OVERFLOW
;
if
(
current_capacity
<
required_capacity
)
{
if
((
size_t
)
required_capacity
>
PY_
SIZE_MAX
/
sizeof
(
node
))
{
if
((
size_t
)
required_capacity
>
SIZE_MAX
/
sizeof
(
node
))
{
return
E_NOMEM
;
}
n
=
n1
->
n_child
;
...
...
Python/asdl.c
View file @
2f8bfef1
...
...
@@ -9,14 +9,14 @@ _Py_asdl_seq_new(Py_ssize_t size, PyArena *arena)
/* check size is sane */
if
(
size
<
0
||
(
size
&&
(((
size_t
)
size
-
1
)
>
(
PY_
SIZE_MAX
/
sizeof
(
void
*
)))))
{
(
size
&&
(((
size_t
)
size
-
1
)
>
(
SIZE_MAX
/
sizeof
(
void
*
)))))
{
PyErr_NoMemory
();
return
NULL
;
}
n
=
(
size
?
(
sizeof
(
void
*
)
*
(
size
-
1
))
:
0
);
/* check if size can be added safely */
if
(
n
>
PY_
SIZE_MAX
-
sizeof
(
asdl_seq
))
{
if
(
n
>
SIZE_MAX
-
sizeof
(
asdl_seq
))
{
PyErr_NoMemory
();
return
NULL
;
}
...
...
@@ -40,14 +40,14 @@ _Py_asdl_int_seq_new(Py_ssize_t size, PyArena *arena)
/* check size is sane */
if
(
size
<
0
||
(
size
&&
(((
size_t
)
size
-
1
)
>
(
PY_
SIZE_MAX
/
sizeof
(
void
*
)))))
{
(
size
&&
(((
size_t
)
size
-
1
)
>
(
SIZE_MAX
/
sizeof
(
void
*
)))))
{
PyErr_NoMemory
();
return
NULL
;
}
n
=
(
size
?
(
sizeof
(
void
*
)
*
(
size
-
1
))
:
0
);
/* check if size can be added safely */
if
(
n
>
PY_
SIZE_MAX
-
sizeof
(
asdl_seq
))
{
if
(
n
>
SIZE_MAX
-
sizeof
(
asdl_seq
))
{
PyErr_NoMemory
();
return
NULL
;
}
...
...
Python/ast.c
View file @
2f8bfef1
...
...
@@ -3985,7 +3985,7 @@ decode_unicode_with_escapes(struct compiling *c, const char *s, size_t len)
const
char
*
end
;
/* check for integer overflow */
if
(
len
>
PY_
SIZE_MAX
/
6
)
if
(
len
>
SIZE_MAX
/
6
)
return
NULL
;
/* "ä" (2 bytes) may become "\U000000E4" (10 bytes), or 1:5
"\ä" (3 bytes) may become "\u005c\U000000E4" (16 bytes), or ~1:6 */
...
...
Python/compile.c
View file @
2f8bfef1
...
...
@@ -804,7 +804,7 @@ compiler_next_instr(struct compiler *c, basicblock *b)
oldsize
=
b
->
b_ialloc
*
sizeof
(
struct
instr
);
newsize
=
oldsize
<<
1
;
if
(
oldsize
>
(
PY_
SIZE_MAX
>>
1
))
{
if
(
oldsize
>
(
SIZE_MAX
>>
1
))
{
PyErr_NoMemory
();
return
-
1
;
}
...
...
@@ -4520,7 +4520,7 @@ assemble_init(struct assembler *a, int nblocks, int firstlineno)
a
->
a_lnotab
=
PyBytes_FromStringAndSize
(
NULL
,
DEFAULT_LNOTAB_SIZE
);
if
(
!
a
->
a_lnotab
)
return
0
;
if
((
size_t
)
nblocks
>
PY_
SIZE_MAX
/
sizeof
(
basicblock
*
))
{
if
((
size_t
)
nblocks
>
SIZE_MAX
/
sizeof
(
basicblock
*
))
{
PyErr_NoMemory
();
return
0
;
}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment