Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
C
cython
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
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
cython
Commits
992219fc
Commit
992219fc
authored
Dec 09, 2009
by
Stefan Behnel
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
speed up tree visitor somewhat by moving code out of the critical methods
parent
d6bc4573
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
61 additions
and
45 deletions
+61
-45
Cython/Compiler/Visitor.pxd
Cython/Compiler/Visitor.pxd
+5
-0
Cython/Compiler/Visitor.py
Cython/Compiler/Visitor.py
+56
-45
No files found.
Cython/Compiler/Visitor.pxd
View file @
992219fc
cimport
cython
cdef
class
BasicVisitor
:
cdef
dict
dispatch_table
cpdef
visit
(
self
,
obj
)
cpdef
find_handler
(
self
,
obj
)
cdef
class
TreeVisitor
(
BasicVisitor
):
cdef
public
list
access_path
cpdef
visitchild
(
self
,
child
,
parent
,
attrname
,
idx
)
@
cython
.
locals
(
idx
=
int
)
cpdef
dict
_visitchildren
(
self
,
parent
,
attrs
)
# cpdef visitchildren(self, parent, attrs=*)
cdef
class
VisitorTransform
(
TreeVisitor
):
...
...
Cython/Compiler/Visitor.py
View file @
992219fc
# cython: infer_types=True
#
# Tree visitor and transform framework
#
...
...
@@ -19,32 +21,36 @@ class BasicVisitor(object):
self
.
dispatch_table
=
{}
def
visit
(
self
,
obj
):
cls
=
type
(
obj
)
try
:
handler_method
=
self
.
dispatch_table
[
cls
]
handler_method
=
self
.
dispatch_table
[
type
(
obj
)
]
except
KeyError
:
#print "Cache miss for class %s in visitor %s" % (
# cls.__name__, type(self).__name__)
# Must resolve, try entire hierarchy
pattern
=
"visit_%s"
mro
=
inspect
.
getmro
(
cls
)
handler_method
=
None
for
mro_cls
in
mro
:
if
hasattr
(
self
,
pattern
%
mro_cls
.
__name__
):
handler_method
=
getattr
(
self
,
pattern
%
mro_cls
.
__name__
)
break
if
handler_method
is
None
:
print
type
(
self
),
type
(
obj
)
if
hasattr
(
self
,
'access_path'
)
and
self
.
access_path
:
print
self
.
access_path
if
self
.
access_path
:
print
self
.
access_path
[
-
1
][
0
].
pos
print
self
.
access_path
[
-
1
][
0
].
__dict__
raise
RuntimeError
(
"Visitor does not accept object: %s"
%
obj
)
#print "Caching " + cls.__name__
self
.
dispatch_table
[
cls
]
=
handler_method
handler_method
=
self
.
find_handler
(
obj
)
self
.
dispatch_table
[
type
(
obj
)]
=
handler_method
return
handler_method
(
obj
)
def
find_handler
(
self
,
obj
):
cls
=
type
(
obj
)
#print "Cache miss for class %s in visitor %s" % (
# cls.__name__, type(self).__name__)
# Must resolve, try entire hierarchy
pattern
=
"visit_%s"
mro
=
inspect
.
getmro
(
cls
)
handler_method
=
None
for
mro_cls
in
mro
:
if
hasattr
(
self
,
pattern
%
mro_cls
.
__name__
):
handler_method
=
getattr
(
self
,
pattern
%
mro_cls
.
__name__
)
break
if
handler_method
is
None
:
print
type
(
self
),
cls
if
hasattr
(
self
,
'access_path'
)
and
self
.
access_path
:
print
self
.
access_path
if
self
.
access_path
:
print
self
.
access_path
[
-
1
][
0
].
pos
print
self
.
access_path
[
-
1
][
0
].
__dict__
raise
RuntimeError
(
"Visitor does not accept object: %s"
%
obj
)
#print "Caching " + cls.__name__
return
handler_method
class
TreeVisitor
(
BasicVisitor
):
"""
Base class for writing visitors for a Cython tree, contains utilities for
...
...
@@ -144,6 +150,29 @@ class TreeVisitor(BasicVisitor):
stacktrace
=
stacktrace
.
tb_next
return
(
last_traceback
,
nodes
)
def
_raise_compiler_error
(
self
,
child
,
e
):
import
sys
trace
=
[
''
]
for
parent
,
attribute
,
index
in
self
.
access_path
:
node
=
getattr
(
parent
,
attribute
)
if
index
is
None
:
index
=
''
else
:
node
=
node
[
index
]
index
=
u'[%d]'
%
index
trace
.
append
(
u'%s.%s%s = %s'
%
(
parent
.
__class__
.
__name__
,
attribute
,
index
,
self
.
dump_node
(
node
)))
stacktrace
,
called_nodes
=
self
.
_find_node_path
(
sys
.
exc_info
()[
2
])
last_node
=
child
for
node
,
method_name
,
pos
in
called_nodes
:
last_node
=
node
trace
.
append
(
u"File '%s', line %d, in %s: %s"
%
(
pos
[
0
],
pos
[
1
],
method_name
,
self
.
dump_node
(
node
)))
raise
Errors
.
CompilerCrash
(
last_node
.
pos
,
self
.
__class__
.
__name__
,
u'
\
n
'
.
join
(
trace
),
e
,
stacktrace
)
def
visitchild
(
self
,
child
,
parent
,
attrname
,
idx
):
self
.
access_path
.
append
((
parent
,
attrname
,
idx
))
try
:
...
...
@@ -151,33 +180,16 @@ class TreeVisitor(BasicVisitor):
except
Errors
.
CompileError
:
raise
except
Exception
,
e
:
import
sys
if
DebugFlags
.
debug_no_exception_intercept
:
raise
trace
=
[
''
]
for
parent
,
attribute
,
index
in
self
.
access_path
:
node
=
getattr
(
parent
,
attribute
)
if
index
is
None
:
index
=
''
else
:
node
=
node
[
index
]
index
=
u'[%d]'
%
index
trace
.
append
(
u'%s.%s%s = %s'
%
(
parent
.
__class__
.
__name__
,
attribute
,
index
,
self
.
dump_node
(
node
)))
stacktrace
,
called_nodes
=
self
.
_find_node_path
(
sys
.
exc_info
()[
2
])
last_node
=
child
for
node
,
method_name
,
pos
in
called_nodes
:
last_node
=
node
trace
.
append
(
u"File '%s', line %d, in %s: %s"
%
(
pos
[
0
],
pos
[
1
],
method_name
,
self
.
dump_node
(
node
)))
raise
Errors
.
CompilerCrash
(
last_node
.
pos
,
self
.
__class__
.
__name__
,
u'
\
n
'
.
join
(
trace
),
e
,
stacktrace
)
self
.
_raise_compiler_error
(
child
,
e
)
self
.
access_path
.
pop
()
return
result
def
visitchildren
(
self
,
parent
,
attrs
=
None
):
return
self
.
_visitchildren
(
parent
,
attrs
)
def
_visitchildren
(
self
,
parent
,
attrs
):
"""
Visits the children of the given parent. If parent is None, returns
immediately (returning None).
...
...
@@ -223,8 +235,7 @@ class VisitorTransform(TreeVisitor):
are within a StatListNode or similar before doing this.)
"""
def
visitchildren
(
self
,
parent
,
attrs
=
None
):
result
=
cython
.
declare
(
dict
)
result
=
TreeVisitor
.
visitchildren
(
self
,
parent
,
attrs
)
result
=
self
.
_visitchildren
(
parent
,
attrs
)
for
attr
,
newnode
in
result
.
iteritems
():
if
not
type
(
newnode
)
is
list
:
setattr
(
parent
,
attr
,
newnode
)
...
...
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