Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
PaddlePaddle
Paddle
提交
0ffba1c9
P
Paddle
项目概览
PaddlePaddle
/
Paddle
大约 1 年 前同步成功
通知
2298
Star
20931
Fork
5422
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
1423
列表
看板
标记
里程碑
合并请求
543
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
P
Paddle
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
1,423
Issue
1,423
列表
看板
标记
里程碑
合并请求
543
合并请求
543
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
未验证
提交
0ffba1c9
编写于
12月 13, 2022
作者:
J
joanna.wozna.intel
提交者:
GitHub
12月 13, 2022
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Correct multiple inputs and outputs (#48872)
上级
428fb804
变更
3
显示空白变更内容
内联
并排
Showing
3 changed file
with
129 addition
and
35 deletion
+129
-35
paddle/fluid/framework/ir/mkldnn/cpu_quantize_pass.cc
paddle/fluid/framework/ir/mkldnn/cpu_quantize_pass.cc
+77
-25
paddle/fluid/framework/ir/mkldnn/cpu_quantize_pass_tester.cc
paddle/fluid/framework/ir/mkldnn/cpu_quantize_pass_tester.cc
+39
-0
paddle/fluid/framework/ir/mkldnn/cpu_quantize_squash_pass.cc
paddle/fluid/framework/ir/mkldnn/cpu_quantize_squash_pass.cc
+13
-10
未找到文件。
paddle/fluid/framework/ir/mkldnn/cpu_quantize_pass.cc
浏览文件 @
0ffba1c9
...
...
@@ -146,6 +146,14 @@ void CPUQuantizePass::QuantizeInputs(Graph* g,
float
shift
,
std
::
string
shift_attr_name
)
const
{
auto
inputs
=
op
->
inputs
;
auto
var_names
=
op
->
Op
()
->
Inputs
().
at
(
input_name
);
std
::
vector
<
std
::
string
>
unique_var_names
;
for
(
unsigned
i
=
0
;
i
<
var_names
.
size
();
i
++
)
if
(
std
::
find
(
unique_var_names
.
begin
(),
unique_var_names
.
end
(),
var_names
[
i
])
==
unique_var_names
.
end
())
unique_var_names
.
push_back
(
var_names
[
i
]);
auto
output
=
op
->
outputs
[
0
];
PADDLE_ENFORCE_GE
(
inputs
.
size
(),
1
,
...
...
@@ -163,7 +171,6 @@ void CPUQuantizePass::QuantizeInputs(Graph* g,
// create a quantize op desc prototype
OpDesc
q_desc
;
q_desc
.
SetType
(
"quantize"
);
std
::
vector
<
Node
*>
quantize_out_nodes
(
inputs
.
size
());
std
::
vector
<
std
::
string
>
quantize_out_node_names
(
inputs
.
size
());
...
...
@@ -171,25 +178,52 @@ void CPUQuantizePass::QuantizeInputs(Graph* g,
unsigned
max
=
are_inputs_unsigned
?
U8_MAX
:
S8_MAX
;
float
scale
=
scale_out
*
max
;
for
(
size_t
i
=
0
;
i
<
inputs
.
size
();
i
++
)
{
// Create quantize output variable
for
(
size_t
var_id
=
0
;
var_id
<
unique_var_names
.
size
();
var_id
++
)
{
auto
index
=
-
1
;
for
(
size_t
it
=
0
;
it
<
inputs
.
size
();
it
++
)
{
if
(
inputs
[
it
]
->
Name
()
==
unique_var_names
[
var_id
])
index
=
it
;
}
if
(
index
==
-
1
)
{
PADDLE_ENFORCE_NE
(
index
,
-
1
,
platform
::
errors
::
InvalidArgument
(
"Var(%s) isn't the input of the %s operator."
,
unique_var_names
[
var_id
],
op
->
Op
()
->
Type
()));
}
auto
*
input
=
inputs
.
at
(
index
);
VarDesc
quantize_out_desc
(
patterns
::
PDNodeName
(
"quantize"
,
"out"
));
quantize_out_nodes
[
i
]
=
g
->
CreateVarNode
(
&
quantize_out_desc
);
quantize_out_node_names
[
i
]
=
quantize_out_nodes
[
i
]
->
Name
();
quantize_out_nodes
[
var_id
]
=
g
->
CreateVarNode
(
&
quantize_out_desc
);
quantize_out_node_names
[
var_id
]
=
quantize_out_nodes
[
var_id
]
->
Name
();
q_desc
.
SetAttr
(
"Scale"
,
scale
);
q_desc
.
SetAttr
(
"Shift"
,
shift
);
q_desc
.
SetInput
(
"Input"
,
std
::
vector
<
std
::
string
>
({
input
s
[
i
]
->
Name
()}));
q_desc
.
SetOutput
(
"Output"
,
std
::
vector
<
std
::
string
>
({
quantize_out_node_names
[
i
]}));
q_desc
.
SetInput
(
"Input"
,
std
::
vector
<
std
::
string
>
({
input
->
Name
()}));
q_desc
.
SetOutput
(
"Output"
,
std
::
vector
<
std
::
string
>
({
quantize_out_node_names
[
var_id
]}));
q_desc
.
SetAttr
(
"is_negative_input"
,
!
are_inputs_unsigned
);
auto
quantize_op
=
g
->
CreateOpNode
(
&
q_desc
);
// OpDesc will be copied.
// link quantize op
UnlinkNodes
(
inputs
[
i
],
op
);
IR_NODE_LINK_TO
(
inputs
[
i
],
quantize_op
);
IR_NODE_LINK_TO
(
quantize_op
,
quantize_out_nodes
[
i
]);
IR_NODE_LINK_TO
(
quantize_out_nodes
[
i
],
op
);
UnlinkNodes
(
input
,
op
);
IR_NODE_LINK_TO
(
input
,
quantize_op
);
IR_NODE_LINK_TO
(
quantize_op
,
quantize_out_nodes
[
var_id
]);
IR_NODE_LINK_TO
(
quantize_out_nodes
[
var_id
],
op
);
}
// If any inputs were duplicated, now you have to enter them in the correct
// order.
for
(
size_t
i
=
unique_var_names
.
size
();
i
<
var_names
.
size
();
i
++
)
{
auto
index
=
std
::
find
(
unique_var_names
.
begin
(),
unique_var_names
.
end
(),
var_names
[
i
]);
if
(
index
!=
unique_var_names
.
end
())
{
auto
id
=
std
::
distance
(
unique_var_names
.
begin
(),
index
);
quantize_out_node_names
[
i
]
=
quantize_out_nodes
[
id
]
->
Name
();
IR_NODE_LINK_TO
(
quantize_out_nodes
[
id
],
op
);
}
}
// update op's input
...
...
@@ -252,6 +286,8 @@ void CPUQuantizePass::DequantizeOutputs(Graph* g,
bool
is_unsigned
,
std
::
string
scale_attr_name
)
const
{
auto
outputs
=
op
->
outputs
;
auto
var_names
=
op
->
Op
()
->
Outputs
().
at
(
output_name
);
PADDLE_ENFORCE_GE
(
outputs
.
size
(),
1
,
platform
::
errors
::
InvalidArgument
(
...
...
@@ -259,37 +295,53 @@ void CPUQuantizePass::DequantizeOutputs(Graph* g,
op
->
Name
(),
outputs
.
size
()));
std
::
vector
<
std
::
string
>
quantize_in_node_names
(
outputs
.
size
());
std
::
vector
<
std
::
string
>
dequantize_in_node_names
(
outputs
.
size
());
std
::
vector
<
Node
*>
dequantize_in_nodes
(
outputs
.
size
());
unsigned
max
=
is_unsigned
?
U8_MAX
:
S8_MAX
;
float
scale
=
scale_to_one
*
max
;
for
(
size_t
i
=
0
;
i
<
outputs
.
size
();
i
++
)
{
for
(
size_t
var_id
=
0
;
var_id
<
var_names
.
size
();
var_id
++
)
{
auto
index
=
-
1
;
for
(
size_t
it
=
0
;
it
<
outputs
.
size
();
it
++
)
{
if
(
outputs
[
it
]
->
Name
()
==
var_names
[
var_id
])
index
=
it
;
}
if
(
index
==
-
1
)
{
PADDLE_ENFORCE_NE
(
index
,
-
1
,
platform
::
errors
::
InvalidArgument
(
"Var(%s) isn't the input of the %s operator."
,
var_names
[
var_id
],
op
->
Op
()
->
Type
()));
}
auto
*
output
=
outputs
.
at
(
index
);
// Create dequantize input variable
VarDesc
dequantize_in_desc
(
patterns
::
PDNodeName
(
"dequantize"
,
"in"
));
Node
*
dequantize_in_node
=
g
->
CreateVarNode
(
&
dequantize_in_desc
);
quantize_in_node_names
[
i
]
=
dequantize_in_node
->
Name
();
dequantize_in_nodes
[
var_id
]
=
g
->
CreateVarNode
(
&
dequantize_in_desc
);
dequantize_in_node_names
[
var_id
]
=
dequantize_in_nodes
[
var_id
]
->
Name
();
// create a dequantize op node for output.
OpDesc
deq_desc
;
deq_desc
.
SetType
(
"dequantize"
);
deq_desc
.
SetInput
(
"Input"
,
std
::
vector
<
std
::
string
>
({
quantize_in_node_names
[
i
]}));
deq_desc
.
SetOutput
(
"Output"
,
std
::
vector
<
std
::
string
>
({
outputs
[
i
]
->
Name
()}));
deq_desc
.
SetInput
(
"Input"
,
std
::
vector
<
std
::
string
>
({
dequantize_in_node_names
[
var_id
]}));
deq_desc
.
SetOutput
(
"Output"
,
std
::
vector
<
std
::
string
>
({
output
->
Name
()}));
deq_desc
.
SetAttr
(
"Scale"
,
scale
);
deq_desc
.
SetAttr
(
"is_negative_input"
,
!
is_unsigned
);
auto
dequantize_op
=
g
->
CreateOpNode
(
&
deq_desc
);
// OpDesc will be copied.
// link dequantize op
UnlinkNodes
(
op
,
output
s
[
i
]
);
IR_NODE_LINK_TO
(
op
,
dequantize_in_node
);
IR_NODE_LINK_TO
(
dequantize_in_node
,
dequantize_op
);
IR_NODE_LINK_TO
(
dequantize_op
,
output
s
[
i
]
);
UnlinkNodes
(
op
,
output
);
IR_NODE_LINK_TO
(
op
,
dequantize_in_node
s
[
var_id
]
);
IR_NODE_LINK_TO
(
dequantize_in_node
s
[
var_id
]
,
dequantize_op
);
IR_NODE_LINK_TO
(
dequantize_op
,
output
);
}
// update op's output
op
->
Op
()
->
SetOutput
(
output_name
,
quantize_in_node_names
);
op
->
Op
()
->
SetOutput
(
output_name
,
de
quantize_in_node_names
);
if
(
!
scale_attr_name
.
empty
())
op
->
Op
()
->
SetAttr
(
scale_attr_name
,
scale
);
}
...
...
paddle/fluid/framework/ir/mkldnn/cpu_quantize_pass_tester.cc
浏览文件 @
0ffba1c9
...
...
@@ -881,6 +881,45 @@ TEST(CpuQuantizePass, multi_gru_3) {
MainTestMultiGru
(
layers
);
}
static
const
std
::
initializer_list
<
std
::
string
>
variable_names_multi_inputs_outputs
=
{
"a"
,
"b"
,
"c1"
,
"c2"
,
"d"
,
"e"
};
// a->Pool->b
// b->Split->c1, c2
// (c1, c2, c1, c2)->Concat->d
// d->Pool->e
ProgramDesc
BuildProgramDescMulti
()
{
ProgramDesc
prog
;
for
(
auto
&
v
:
variable_names_multi_inputs_outputs
)
{
prog
.
MutableBlock
(
0
)
->
Var
(
v
)
->
SetDataType
(
proto
::
VarType
::
FP32
);
}
SetOp
(
&
prog
,
"pool2d"
,
"Pool"
,
{
"a"
},
{
"b"
},
true
,
"float32"
);
SetOp
(
&
prog
,
"split"
,
"Split"
,
{
"b"
},
{
"c1"
,
"c2"
},
true
,
"int8"
);
SetOp
(
&
prog
,
"concat"
,
"Concat"
,
{
"c1"
,
"c2"
,
"c1"
,
"c2"
},
{
"d"
},
true
,
"int8"
);
SetOp
(
&
prog
,
"pool2d"
,
"Pool2"
,
{
"d"
},
{
"e"
},
true
,
"float32"
);
return
prog
;
}
TEST
(
CpuQuantizePass
,
multi_inputs_outputs_ops
)
{
// a->QUANT1->Split
// b1->DEQUANT->OUT->QUANT
// b2->DEQUANT->OUT->QUANT
// (b1, b2, b1, b2)->Concat->c->DEQUANT->Pool->d
int
added_nodes
=
6
*
2
;
std
::
unordered_map
<
std
::
string
,
int
>
expected_operators
=
{{
"pool2d"
,
2
},
{
"concat"
,
1
},
{
"split"
,
1
},
{
"quantize"
,
3
},
{
"dequantize"
,
3
}};
MainTest
(
BuildProgramDescMulti
(),
variable_names_multi_inputs_outputs
,
expected_operators
,
added_nodes
);
}
}
// namespace ir
}
// namespace framework
}
// namespace paddle
...
...
paddle/fluid/framework/ir/mkldnn/cpu_quantize_squash_pass.cc
浏览文件 @
0ffba1c9
...
...
@@ -158,6 +158,11 @@ void CPUQuantizeSquashPass::DequantQuantSquash(
PADDLE_GET_CONST
(
float
,
quant_op
->
Op
()
->
GetAttr
(
"Scale"
));
float
dequant_shift
=
dequant_op
->
Op
()
->
GetAttrIfExists
<
float
>
(
"Shift"
);
float
quant_shift
=
quant_op
->
Op
()
->
GetAttrIfExists
<
float
>
(
"Shift"
);
if
(
quant_op
->
Op
()
->
GetAttrIfExists
<
bool
>
(
"is_negative_input"
)
!=
dequant_op
->
Op
()
->
GetAttrIfExists
<
bool
>
(
"is_negative_input"
))
{
return
;
}
PADDLE_ENFORCE_NE
(
nodes_keep_counter
->
find
(
dequant_out
),
nodes_keep_counter
->
end
(),
...
...
@@ -169,14 +174,13 @@ void CPUQuantizeSquashPass::DequantQuantSquash(
if
(
dequant_scale
==
quant_scale
&&
dequant_shift
==
quant_shift
)
{
// squash dequantize-quantize to nothing
auto
quant_out_var_name
=
quant_out
->
Name
();
auto
next_op_inputs
=
next_op_desc
->
InputNames
();
for
(
const
auto
&
name
:
next_op_inputs
)
{
auto
input_names
=
next_op_desc
->
Input
(
name
);
for
(
auto
input_name
:
next_op_desc
->
InputNames
())
{
auto
&
input_names
=
next_op_desc
->
MutableInputs
()
->
at
(
input_name
);
std
::
replace
(
input_names
.
begin
(),
input_names
.
end
(),
quant_out_var_name
,
dequant_in
->
Name
());
next_op_desc
->
SetInput
(
name
,
input_names
);
next_op_desc
->
SetInput
(
input_
name
,
input_names
);
}
if
(
keep_dequant
)
...
...
@@ -413,12 +417,11 @@ void CPUQuantizeSquashPass::MultipleQuantizeSquash(Graph* graph) const {
// update the next operator input,
// by replacing quant_out with first_quant_out
auto
last_op_names
=
last_op
->
Op
()
->
Input
(
last_op_input_name
);
last_op_names
.
erase
(
std
::
remove
(
last_op_names
.
begin
(),
last_op_names
.
end
(),
quant_out
->
Name
()),
last_op_names
.
end
());
last_op_names
.
push_back
(
first_quant_out
->
Name
());
auto
last_op_names
=
last_op
->
Op
()
->
Inputs
().
at
(
last_op_input_name
);
std
::
replace
(
last_op_names
.
begin
(),
last_op_names
.
end
(),
quant_out
->
Name
(),
first_quant_out
->
Name
());
last_op_op
->
SetInput
(
last_op_input_name
,
std
::
vector
<
std
::
string
>
(
last_op_names
));
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录