Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
bb5d63fd
提交
bb5d63fd
authored
1月 08, 2008
作者:
olivier@olivier-desktop
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
added test file
上级
b8839686
全部展开
隐藏空白字符变更
内嵌
并排
正在显示
3 个修改的文件
包含
133 行增加
和
24 行删除
+133
-24
core.py
core.py
+0
-0
opt.py
opt.py
+6
-24
test.py
test.py
+127
-0
没有找到文件。
core.py
浏览文件 @
bb5d63fd
差异被折叠。
点击展开。
opt.py
浏览文件 @
bb5d63fd
...
...
@@ -23,24 +23,16 @@ import gof
# return gof.opt.OpSubOptimizer(op1, op2)
pattern_opt
=
gof
.
opt
.
PatternOptimizer
op_sub
=
gof
.
opt
.
OpSubOptimizer
pattern_opt
=
gof
.
PatternOptimizer
op_sub
=
gof
.
OpSubOptimizer
#def make_patterns(patterns):
# return [name, pattern_opt(inp, outp) for name, inp, outp in patterns]
def
export_opts
(
opts
):
for
name
,
opt
in
opts
:
if
name
:
globals
()[
name
]
=
opt
# double_transpose_eliminator = pattern_opt((transpose, (transpose, 'x')), 'x')
# patterns = make_patterns(patterns)
# export_patterns(patterns)
# List of optimizations to perform. They are listed in the order they are applied.
opts
=
[
...
...
@@ -62,24 +54,14 @@ opts = [
[
'add_to_iadd_reverse'
,
pattern_opt
((
add
,
'x'
,
'y'
),
(
iadd
,
'y'
,
'x'
))],
[
'remove_copies'
,
gof
.
opt
.
OpRemover
(
array_copy
)],
[
'remove_copies'
,
gof
.
OpRemover
(
array_copy
)],
[
None
,
gof
.
lib
.
DummyRemover
]
# has to be at the end
[
None
,
gof
.
DummyRemover
]
# has to be at the end
]
export_opts
(
opts
)
# publish the optimizations performed under individual names
# class AAA(gof.opt.Optimizer):
# def __init__(self, opt):
# self.opt = opt
# def optimize(self, env):
# build_mode()
# self.opt.optimize(env)
# pop_mode()
export_opts
(
opts
)
# publish the optimizations performed under individual names
optimizer
=
gof
.
lib
.
PythonOpt
(
gof
.
opt
.
MergeOptMerge
(
gof
.
opt
.
SeqOptimizer
([
opt
for
name
,
opt
in
opts
])))
optimizer
=
gof
.
PythonOpt
(
gof
.
MergeOptMerge
(
gof
.
SeqOptimizer
([
opt
for
name
,
opt
in
opts
])))
test.py
0 → 100644
浏览文件 @
bb5d63fd
# import gof
# gof.stealth.method_wrap(int, '__add__', [2, 1], )
# x = gof.stealth.wrap(3)
# y = gof.stealth.wrap(4)
# print x + y
import
gof
import
core
import
numpy
import
compile
import
grad
# a = core.NumpyR(numpy.ones((3, 3)))
# b = core.NumpyR(numpy.ones((3, 3)))
# w = core.dot #core.wrapper(numpy.dot)
# core.start_build()
# r = a * (b * b)
# core.end_build()
# #r = w(a, w(b, b))
# print r
# print r.owner
# env = gof.Env([a, b], [r._obj])
# print env
# print r
# gof.ThunkLinker()(env)()
# print r
# core.start_build()
# a += b + c
# a = a + b
# a += a + core.transpose(b)
# core.end_build()
# # env = gof.Env(gof.graph.inputs([a]), [a])
# # print env
# # gof.ThunkLinker()(env)()
# # print a
# print gof.Env(gof.graph.inputs([a]), [a])
# prog = compile.single(a)
# print prog.env
# prog()
# print a
############################
# core.build_mode()
# dim = core.wrap(())
# dim2 = core.wrap((2, 2))
# a = core.zeros(dim, dtype='int32') #(core.NumpyR(numpy.ones((3, 3))))
# b = core.ones(dim2, 'int32') #(core.NumpyR(numpy.ones((3, 3))))
# c = core.zeros(dim, dtype='int32')
# d = a + (b + b) + c + numpy.ones(())
# e = d + (b * c)
# core.pop_mode()
# #print e
# #print gof.graph.ops([dim], [e])
# #1/0
# #print gof.Env([dim], [e])
# #f = compile.to_func([dim], [e])
# f = compile.to_func([a, b, c], [e])
# print f(1, 2, 3)
# #print f((2,2))
############################
# a = core.ones((2, 2))
# b = core.ones((2, 2))
# def f():
# return (a + b) + (a + b)
# r = core.build(f)
# env = gof.Env([a, b], [r])
# print env
# gof.opt.MergeOptimizer().optimize(env)
# print env
# print compile.to_func([a, b], [r])(1, 2)
############################
a
=
core
.
ones
((
2
,
2
))
b
=
core
.
ones
((
2
,
2
))
def
f
():
return
(
a
+
b
)
+
(
a
+
b
)
r
=
core
.
build
(
f
)
g
=
grad
.
grad
(
r
,
a
)
core
.
print_graph
(
g
)
core
.
print_graph
(
r
)
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论