diff options
author | Eli Bendersky <eliben@gmail.com> | 2012-06-15 04:52:49 (GMT) |
---|---|---|
committer | Eli Bendersky <eliben@gmail.com> | 2012-06-15 04:52:49 (GMT) |
commit | 113da642591d9e290c7d24a7e5c68c0f040ce42f (patch) | |
tree | 6039c49397bfd9f45338fffeaaf0846d9b6c42fb | |
parent | 64d11e60f23f6b1435704adb87ebf818e5a4c0c1 (diff) | |
download | cpython-113da642591d9e290c7d24a7e5c68c0f040ce42f.zip cpython-113da642591d9e290c7d24a7e5c68c0f040ce42f.tar.gz cpython-113da642591d9e290c7d24a7e5c68c0f040ce42f.tar.bz2 |
Fix windows compilation problems caused by previous commit.
-rw-r--r-- | Modules/_elementtree.c | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/Modules/_elementtree.c b/Modules/_elementtree.c index f0b5a3f..cb84048 100644 --- a/Modules/_elementtree.c +++ b/Modules/_elementtree.c @@ -1840,6 +1840,8 @@ elementiter_next(ElementIterObject *it) * - itertext() also has to handle tail, after finishing with all the * children of a node. */ + ElementObject *cur_parent; + Py_ssize_t child_index; while (1) { /* Handle the case reached in the beginning and end of iteration, where @@ -1881,8 +1883,8 @@ elementiter_next(ElementIterObject *it) /* See if there are children left to traverse in the current parent. If * yes, visit the next child. If not, pop the stack and try again. */ - ElementObject *cur_parent = it->parent_stack->parent; - Py_ssize_t child_index = it->parent_stack->child_index; + 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]; |