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
Labels
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Commits
Open sidebar
nexedi
cython
Commits
3241fbf0
Commit
3241fbf0
authored
Nov 15, 2010
by
Stefan Behnel
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
removed unused level of indirection from tree visitors to save some processing cycles
parent
8f7b6b8d
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
43 additions
and
49 deletions
+43
-49
Cython/Compiler/Visitor.pxd
Cython/Compiler/Visitor.pxd
+3
-4
Cython/Compiler/Visitor.py
Cython/Compiler/Visitor.py
+40
-45
No files found.
Cython/Compiler/Visitor.pxd
View file @
3241fbf0
cimport
cython
cimport
cython
cdef
class
BasicVisitor
:
cdef
class
TreeVisitor
:
cdef
public
list
access_path
cdef
dict
dispatch_table
cdef
dict
dispatch_table
cpdef
visit
(
self
,
obj
)
cpdef
visit
(
self
,
obj
)
cdef
_visit
(
self
,
obj
)
cdef
_visit
(
self
,
obj
)
cdef
find_handler
(
self
,
obj
)
cdef
find_handler
(
self
,
obj
)
cdef
class
TreeVisitor
(
BasicVisitor
):
cdef
public
list
access_path
cdef
_visitchild
(
self
,
child
,
parent
,
attrname
,
idx
)
cdef
_visitchild
(
self
,
child
,
parent
,
attrname
,
idx
)
@
cython
.
locals
(
idx
=
int
)
@
cython
.
locals
(
idx
=
int
)
cdef
dict
_visitchildren
(
self
,
parent
,
attrs
)
cdef
dict
_visitchildren
(
self
,
parent
,
attrs
)
...
...
Cython/Compiler/Visitor.py
View file @
3241fbf0
...
@@ -11,49 +11,7 @@ import Naming
...
@@ -11,49 +11,7 @@ import Naming
import
Errors
import
Errors
import
DebugFlags
import
DebugFlags
class
BasicVisitor
(
object
):
class
TreeVisitor
(
object
):
"""A generic visitor base class which can be used for visiting any kind of object."""
# Note: If needed, this can be replaced with a more efficient metaclass
# approach, resolving the jump table at module load time rather than per visitor
# instance.
def
__init__
(
self
):
self
.
dispatch_table
=
{}
def
visit
(
self
,
obj
):
return
self
.
_visit
(
obj
)
def
_visit
(
self
,
obj
):
try
:
handler_method
=
self
.
dispatch_table
[
type
(
obj
)]
except
KeyError
:
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 %r does not accept object: %s"
%
(
self
,
obj
))
#print "Caching " + cls.__name__
return
handler_method
class
TreeVisitor
(
BasicVisitor
):
"""
"""
Base class for writing visitors for a Cython tree, contains utilities for
Base class for writing visitors for a Cython tree, contains utilities for
recursing such trees using visitors. Each node is
recursing such trees using visitors. Each node is
...
@@ -96,9 +54,9 @@ class TreeVisitor(BasicVisitor):
...
@@ -96,9 +54,9 @@ class TreeVisitor(BasicVisitor):
out 3
out 3
out 0
out 0
"""
"""
def
__init__
(
self
):
def
__init__
(
self
):
super
(
TreeVisitor
,
self
).
__init__
()
super
(
TreeVisitor
,
self
).
__init__
()
self
.
dispatch_table
=
{}
self
.
access_path
=
[]
self
.
access_path
=
[]
def
dump_node
(
self
,
node
,
indent
=
0
):
def
dump_node
(
self
,
node
,
indent
=
0
):
...
@@ -176,10 +134,47 @@ class TreeVisitor(BasicVisitor):
...
@@ -176,10 +134,47 @@ class TreeVisitor(BasicVisitor):
last_node
.
pos
,
self
.
__class__
.
__name__
,
last_node
.
pos
,
self
.
__class__
.
__name__
,
u'
\
n
'
.
join
(
trace
),
e
,
stacktrace
)
u'
\
n
'
.
join
(
trace
),
e
,
stacktrace
)
def
find_handler
(
self
,
obj
):
# to resolve, try entire hierarchy
cls
=
type
(
obj
)
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 %r does not accept object: %s"
%
(
self
,
obj
))
#print "Caching " + cls.__name__
return
handler_method
def
visit
(
self
,
obj
):
return
self
.
_visit
(
obj
)
def
_visit
(
self
,
obj
):
try
:
handler_method
=
self
.
dispatch_table
[
type
(
obj
)]
except
KeyError
:
handler_method
=
self
.
find_handler
(
obj
)
self
.
dispatch_table
[
type
(
obj
)]
=
handler_method
return
handler_method
(
obj
)
def
_visitchild
(
self
,
child
,
parent
,
attrname
,
idx
):
def
_visitchild
(
self
,
child
,
parent
,
attrname
,
idx
):
self
.
access_path
.
append
((
parent
,
attrname
,
idx
))
self
.
access_path
.
append
((
parent
,
attrname
,
idx
))
try
:
try
:
result
=
self
.
_visit
(
child
)
try
:
handler_method
=
self
.
dispatch_table
[
type
(
child
)]
except
KeyError
:
handler_method
=
self
.
find_handler
(
child
)
self
.
dispatch_table
[
type
(
child
)]
=
handler_method
result
=
handler_method
(
child
)
except
Errors
.
CompileError
:
except
Errors
.
CompileError
:
raise
raise
except
Exception
,
e
:
except
Exception
,
e
:
...
...
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