Skip to content
Projeler
Gruplar
Parçacıklar
Yardım
Yükleniyor...
Oturum aç / Kaydol
Gezinmeyi değiştir
C
cpython
Proje
Proje
Ayrıntılar
Etkinlik
Cycle Analytics
Depo (repository)
Depo (repository)
Dosyalar
Kayıtlar (commit)
Dallar (branch)
Etiketler
Katkıda bulunanlar
Grafik
Karşılaştır
Grafikler
Konular (issue)
0
Konular (issue)
0
Liste
Pano
Etiketler
Kilometre Taşları
Birleştirme (merge) Talepleri
0
Birleştirme (merge) Talepleri
0
CI / CD
CI / CD
İş akışları (pipeline)
İşler
Zamanlamalar
Grafikler
Paketler
Paketler
Wiki
Wiki
Parçacıklar
Parçacıklar
Üyeler
Üyeler
Collapse sidebar
Close sidebar
Etkinlik
Grafik
Grafikler
Yeni bir konu (issue) oluştur
İşler
Kayıtlar (commit)
Konu (issue) Panoları
Kenar çubuğunu aç
Batuhan Osman TASKAYA
cpython
Commits
47a9d59d
Kaydet (Commit)
47a9d59d
authored
Ara 21, 2015
tarafından
Serhiy Storchaka
Dosyalara gözat
Seçenekler
Dosyalara Gözat
İndir
Sade Fark
Issue #25902: Fixed various refcount issues in ElementTree iteration.
üst
0c477e6a
66c08d90
Hide whitespace changes
Inline
Side-by-side
Showing
4 changed files
with
117 additions
and
36 deletions
+117
-36
test_xml_etree.py
Lib/test/test_xml_etree.py
+51
-0
ElementTree.py
Lib/xml/etree/ElementTree.py
+6
-4
NEWS
Misc/NEWS
+2
-0
_elementtree.c
Modules/_elementtree.c
+58
-32
No files found.
Lib/test/test_xml_etree.py
Dosyayı görüntüle @
47a9d59d
...
...
@@ -1668,6 +1668,57 @@ class BugsTest(unittest.TestCase):
ET
.
register_namespace
(
'test10777'
,
'http://myuri/'
)
ET
.
register_namespace
(
'test10777'
,
'http://myuri/'
)
def
test_lost_text
(
self
):
# Issue #25902: Borrowed text can disappear
class
Text
:
def
__bool__
(
self
):
e
.
text
=
'changed'
return
True
e
=
ET
.
Element
(
'tag'
)
e
.
text
=
Text
()
i
=
e
.
itertext
()
t
=
next
(
i
)
self
.
assertIsInstance
(
t
,
Text
)
self
.
assertIsInstance
(
e
.
text
,
str
)
self
.
assertEqual
(
e
.
text
,
'changed'
)
def
test_lost_tail
(
self
):
# Issue #25902: Borrowed tail can disappear
class
Text
:
def
__bool__
(
self
):
e
[
0
]
.
tail
=
'changed'
return
True
e
=
ET
.
Element
(
'root'
)
e
.
append
(
ET
.
Element
(
'tag'
))
e
[
0
]
.
tail
=
Text
()
i
=
e
.
itertext
()
t
=
next
(
i
)
self
.
assertIsInstance
(
t
,
Text
)
self
.
assertIsInstance
(
e
[
0
]
.
tail
,
str
)
self
.
assertEqual
(
e
[
0
]
.
tail
,
'changed'
)
def
test_lost_elem
(
self
):
# Issue #25902: Borrowed element can disappear
class
Tag
:
def
__eq__
(
self
,
other
):
e
[
0
]
=
ET
.
Element
(
'changed'
)
next
(
i
)
return
True
e
=
ET
.
Element
(
'root'
)
e
.
append
(
ET
.
Element
(
Tag
()))
e
.
append
(
ET
.
Element
(
'tag'
))
i
=
e
.
iter
(
'tag'
)
try
:
t
=
next
(
i
)
except
ValueError
:
self
.
skipTest
(
'generators are not reentrant'
)
self
.
assertIsInstance
(
t
.
tag
,
Tag
)
self
.
assertIsInstance
(
e
[
0
]
.
tag
,
str
)
self
.
assertEqual
(
e
[
0
]
.
tag
,
'changed'
)
# --------------------------------------------------------------------
...
...
Lib/xml/etree/ElementTree.py
Dosyayı görüntüle @
47a9d59d
...
...
@@ -429,12 +429,14 @@ class Element:
tag
=
self
.
tag
if
not
isinstance
(
tag
,
str
)
and
tag
is
not
None
:
return
if
self
.
text
:
yield
self
.
text
t
=
self
.
text
if
t
:
yield
t
for
e
in
self
:
yield
from
e
.
itertext
()
if
e
.
tail
:
yield
e
.
tail
t
=
e
.
tail
if
t
:
yield
t
def
SubElement
(
parent
,
tag
,
attrib
=
{},
**
extra
):
...
...
Misc/NEWS
Dosyayı görüntüle @
47a9d59d
...
...
@@ -115,6 +115,8 @@ Core and Builtins
Library
-------
- Issue #25902: Fixed various refcount issues in ElementTree iteration.
- Issue #22227: The TarFile iterator is reimplemented using generator.
This implementation is simpler that using class.
...
...
Modules/_elementtree.c
Dosyayı görüntüle @
47a9d59d
...
...
@@ -2070,6 +2070,7 @@ elementiter_next(ElementIterObject *it)
ElementObject
*
cur_parent
;
Py_ssize_t
child_index
;
int
rc
;
ElementObject
*
elem
;
while
(
1
)
{
/* Handle the case reached in the beginning and end of iteration, where
...
...
@@ -2083,38 +2084,47 @@ elementiter_next(ElementIterObject *it)
PyErr_SetNone
(
PyExc_StopIteration
);
return
NULL
;
}
else
{
elem
=
it
->
root_element
;
it
->
parent_stack
=
parent_stack_push_new
(
it
->
parent_stack
,
it
->
root_element
);
elem
);
if
(
!
it
->
parent_stack
)
{
PyErr_NoMemory
();
return
NULL
;
}
Py_INCREF
(
elem
);
it
->
root_done
=
1
;
rc
=
(
it
->
sought_tag
==
Py_None
);
if
(
!
rc
)
{
rc
=
PyObject_RichCompareBool
(
it
->
root_element
->
tag
,
rc
=
PyObject_RichCompareBool
(
elem
->
tag
,
it
->
sought_tag
,
Py_EQ
);
if
(
rc
<
0
)
if
(
rc
<
0
)
{
Py_DECREF
(
elem
);
return
NULL
;
}
}
if
(
rc
)
{
if
(
it
->
gettext
)
{
PyObject
*
text
=
element_get_text
(
it
->
root_element
);
if
(
!
text
)
PyObject
*
text
=
element_get_text
(
elem
);
if
(
!
text
)
{
Py_DECREF
(
elem
);
return
NULL
;
}
Py_INCREF
(
text
);
Py_DECREF
(
elem
);
rc
=
PyObject_IsTrue
(
text
);
if
(
rc
>
0
)
return
text
;
Py_DECREF
(
text
);
if
(
rc
<
0
)
return
NULL
;
if
(
rc
)
{
Py_INCREF
(
text
);
return
text
;
}
}
else
{
Py_INCREF
(
it
->
root_element
);
return
(
PyObject
*
)
it
->
root_element
;
return
(
PyObject
*
)
elem
;
}
}
else
{
Py_DECREF
(
elem
);
}
}
}
...
...
@@ -2124,54 +2134,68 @@ elementiter_next(ElementIterObject *it)
cur_parent
=
it
->
parent_stack
->
parent
;
child_index
=
it
->
parent_stack
->
child_index
;
if
(
cur_parent
->
extra
&&
child_index
<
cur_parent
->
extra
->
length
)
{
ElementObject
*
child
=
(
ElementObject
*
)
cur_parent
->
extra
->
children
[
child_index
];
elem
=
(
ElementObject
*
)
cur_parent
->
extra
->
children
[
child_index
];
it
->
parent_stack
->
child_index
++
;
it
->
parent_stack
=
parent_stack_push_new
(
it
->
parent_stack
,
child
);
elem
);
if
(
!
it
->
parent_stack
)
{
PyErr_NoMemory
();
return
NULL
;
}
Py_INCREF
(
elem
);
if
(
it
->
gettext
)
{
PyObject
*
text
=
element_get_text
(
child
);
if
(
!
text
)
PyObject
*
text
=
element_get_text
(
elem
);
if
(
!
text
)
{
Py_DECREF
(
elem
);
return
NULL
;
}
Py_INCREF
(
text
);
Py_DECREF
(
elem
);
rc
=
PyObject_IsTrue
(
text
);
if
(
rc
>
0
)
return
text
;
Py_DECREF
(
text
);
if
(
rc
<
0
)
return
NULL
;
if
(
rc
)
{
Py_INCREF
(
text
);
return
text
;
}
}
else
{
rc
=
(
it
->
sought_tag
==
Py_None
);
if
(
!
rc
)
{
rc
=
PyObject_RichCompareBool
(
child
->
tag
,
rc
=
PyObject_RichCompareBool
(
elem
->
tag
,
it
->
sought_tag
,
Py_EQ
);
if
(
rc
<
0
)
if
(
rc
<
0
)
{
Py_DECREF
(
elem
);
return
NULL
;
}
}
if
(
rc
)
{
Py_INCREF
(
child
);
return
(
PyObject
*
)
child
;
return
(
PyObject
*
)
elem
;
}
Py_DECREF
(
elem
);
}
}
else
{
PyObject
*
tail
;
ParentLocator
*
next
=
it
->
parent_stack
->
next
;
ParentLocator
*
next
;
if
(
it
->
gettext
)
{
Py_INCREF
(
cur_parent
);
tail
=
element_get_tail
(
cur_parent
);
if
(
!
tail
)
if
(
!
tail
)
{
Py_DECREF
(
cur_parent
);
return
NULL
;
}
Py_INCREF
(
tail
);
Py_DECREF
(
cur_parent
);
}
else
else
{
tail
=
Py_None
;
Py_XDECREF
(
it
->
parent_stack
->
parent
);
Py_INCREF
(
tail
);
}
next
=
it
->
parent_stack
->
next
;
cur_parent
=
it
->
parent_stack
->
parent
;
PyObject_Free
(
it
->
parent_stack
);
it
->
parent_stack
=
next
;
Py_XDECREF
(
cur_parent
);
/* Note that extra condition on it->parent_stack->parent here;
* this is because itertext() is supposed to only return *inner*
...
...
@@ -2179,12 +2203,14 @@ elementiter_next(ElementIterObject *it)
*/
if
(
it
->
parent_stack
->
parent
)
{
rc
=
PyObject_IsTrue
(
tail
);
if
(
rc
>
0
)
return
tail
;
Py_DECREF
(
tail
);
if
(
rc
<
0
)
return
NULL
;
if
(
rc
)
{
Py_INCREF
(
tail
);
return
tail
;
}
}
else
{
Py_DECREF
(
tail
);
}
}
}
...
...
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