Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
lwm1986
roslyn
提交
c2ce421b
R
roslyn
项目概览
lwm1986
/
roslyn
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
roslyn
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
c2ce421b
编写于
3月 20, 2018
作者:
N
Neal Gafter
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Minor changes per code review.
上级
d46f75ae
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
21 addition
and
24 deletion
+21
-24
src/Compilers/CSharp/Portable/Binder/DecisionDagBuilder.cs
src/Compilers/CSharp/Portable/Binder/DecisionDagBuilder.cs
+15
-18
src/Compilers/CSharp/Portable/Binder/PatternSwitchBinder.cs
src/Compilers/CSharp/Portable/Binder/PatternSwitchBinder.cs
+2
-2
src/Compilers/CSharp/Portable/Lowering/LocalRewriter/LocalRewriter_BasePatternSwitchLocalRewriter.cs
...lRewriter/LocalRewriter_BasePatternSwitchLocalRewriter.cs
+4
-4
未找到文件。
src/Compilers/CSharp/Portable/Binder/DecisionDagBuilder.cs
浏览文件 @
c2ce421b
...
@@ -386,7 +386,7 @@ out ImmutableArray<(BoundExpression, BoundDagTemp)> bindings)
...
@@ -386,7 +386,7 @@ out ImmutableArray<(BoundExpression, BoundDagTemp)> bindings)
/// when an assertion fails (it is unaffected by exception filters on enclosing frames).
/// when an assertion fails (it is unaffected by exception filters on enclosing frames).
/// </summary>
/// </summary>
[
Conditional
(
"DEBUG"
)]
[
Conditional
(
"DEBUG"
)]
private
void
Assert
(
bool
condition
,
string
message
=
null
)
private
static
void
Assert
(
bool
condition
,
string
message
=
null
)
{
{
if
(!
condition
)
if
(!
condition
)
{
{
...
@@ -573,7 +573,7 @@ DagState uniqifyState(DagState state)
...
@@ -573,7 +573,7 @@ DagState uniqifyState(DagState state)
workList
.
Free
();
workList
.
Free
();
// Now process the states in topological order, leaves first, and assign a BoundDecisionDag to each DagState.
// Now process the states in topological order, leaves first, and assign a BoundDecisionDag to each DagState.
ImmutableArray
<
DagState
>
sortedStates
=
initialState
.
TopologicallySortedReachableStates
;
ImmutableArray
<
DagState
>
sortedStates
=
initialState
.
TopologicallySortedReachableStates
()
;
Debug
.
Assert
(
_defaultLabel
!=
null
);
Debug
.
Assert
(
_defaultLabel
!=
null
);
var
finalStates
=
PooledDictionary
<
LabelSymbol
,
BoundDecisionDag
>.
GetInstance
();
var
finalStates
=
PooledDictionary
<
LabelSymbol
,
BoundDecisionDag
>.
GetInstance
();
finalStates
.
Add
(
_defaultLabel
,
defaultDecision
);
finalStates
.
Add
(
_defaultLabel
,
defaultDecision
);
...
@@ -935,27 +935,24 @@ public DagState(ImmutableArray<PartialCaseDecision> cases)
...
@@ -935,27 +935,24 @@ public DagState(ImmutableArray<PartialCaseDecision> cases)
public
BoundDagDecision
SelectedDecision
;
public
BoundDagDecision
SelectedDecision
;
public
DagState
TrueBranch
,
FalseBranch
;
public
DagState
TrueBranch
,
FalseBranch
;
public
ImmutableArray
<
DagState
>
TopologicallySortedReachableStates
public
ImmutableArray
<
DagState
>
TopologicallySortedReachableStates
()
{
{
get
// A successor function used to topologically sort the DagState set.
IEnumerable
<
DagState
>
succ
(
DagState
state
)
{
{
// A successor function used to topologically sort the DagState set.
if
(
state
.
TrueBranch
!=
null
)
IEnumerable
<
DagState
>
succ
(
DagState
state
)
{
{
if
(
state
.
TrueBranch
!=
null
)
yield
return
state
.
TrueBranch
;
{
yield
return
state
.
TrueBranch
;
}
if
(
state
.
FalseBranch
!=
null
)
{
yield
return
state
.
FalseBranch
;
}
}
}
// Now process the states in topological order, leaves first, and assign a BoundDecisionDag to each DagState.
if
(
state
.
FalseBranch
!=
null
)
return
TopologicalSort
.
IterativeSort
<
DagState
>(
SpecializedCollections
.
SingletonEnumerable
<
DagState
>(
this
),
succ
);
{
yield
return
state
.
FalseBranch
;
}
}
}
// Now process the states in topological order, leaves first, and assign a BoundDecisionDag to each DagState.
return
TopologicalSort
.
IterativeSort
<
DagState
>(
SpecializedCollections
.
SingletonEnumerable
<
DagState
>(
this
),
succ
);
}
}
// After the entire graph of DagState objects is complete, we translate each into its Dag.
// After the entire graph of DagState objects is complete, we translate each into its Dag.
...
@@ -987,7 +984,7 @@ internal BoundDagDecision ComputeSelectedDecision()
...
@@ -987,7 +984,7 @@ internal BoundDagDecision ComputeSelectedDecision()
/// </summary>
/// </summary>
internal
string
Dump
()
internal
string
Dump
()
{
{
var
allStates
=
this
.
TopologicallySortedReachableStates
;
var
allStates
=
this
.
TopologicallySortedReachableStates
()
;
var
stateIdentifierMap
=
PooledDictionary
<
DagState
,
int
>.
GetInstance
();
var
stateIdentifierMap
=
PooledDictionary
<
DagState
,
int
>.
GetInstance
();
for
(
int
i
=
0
;
i
<
allStates
.
Length
;
i
++)
for
(
int
i
=
0
;
i
<
allStates
.
Length
;
i
++)
{
{
...
...
src/Compilers/CSharp/Portable/Binder/PatternSwitchBinder.cs
浏览文件 @
c2ce421b
...
@@ -4,7 +4,7 @@
...
@@ -4,7 +4,7 @@
using
System.Collections.Generic
;
using
System.Collections.Generic
;
using
System.Collections.Immutable
;
using
System.Collections.Immutable
;
using
System.Diagnostics
;
using
System.Diagnostics
;
using
System.
Threading
;
using
System.
Linq
;
using
Microsoft.CodeAnalysis.CSharp.Symbols
;
using
Microsoft.CodeAnalysis.CSharp.Symbols
;
using
Microsoft.CodeAnalysis.CSharp.Syntax
;
using
Microsoft.CodeAnalysis.CSharp.Syntax
;
using
Microsoft.CodeAnalysis.PooledObjects
;
using
Microsoft.CodeAnalysis.PooledObjects
;
...
@@ -84,7 +84,7 @@ bool isSubsumed(BoundPatternSwitchLabel switchLabel)
...
@@ -84,7 +84,7 @@ bool isSubsumed(BoundPatternSwitchLabel switchLabel)
}
}
// If no switch sections are subsumed, just return
// If no switch sections are subsumed, just return
if
(
switchSections
.
Count
(
s
=>
s
.
SwitchLabels
.
Count
(
l
=>
isSubsumed
(
l
))
!=
0
)
==
0
)
if
(
!
switchSections
.
Any
(
s
=>
s
.
SwitchLabels
.
Any
(
l
=>
isSubsumed
(
l
)))
)
{
{
return
;
return
;
}
}
...
...
src/Compilers/CSharp/Portable/Lowering/LocalRewriter/LocalRewriter_BasePatternSwitchLocalRewriter.cs
浏览文件 @
c2ce421b
...
@@ -65,7 +65,7 @@ private void ComputeLabelSet(ImmutableArray<BoundDecisionDag> sortedNodes)
...
@@ -65,7 +65,7 @@ private void ComputeLabelSet(ImmutableArray<BoundDecisionDag> sortedNodes)
{
{
// Nodes with more than one predecessor are assigned a label
// Nodes with more than one predecessor are assigned a label
var
hasPredecessor
=
PooledHashSet
<
BoundDecisionDag
>.
GetInstance
();
var
hasPredecessor
=
PooledHashSet
<
BoundDecisionDag
>.
GetInstance
();
void
notePre
edeces
ssor
(
BoundDecisionDag
successor
)
void
notePre
dece
ssor
(
BoundDecisionDag
successor
)
{
{
if
(
successor
!=
null
&&
!
hasPredecessor
.
Add
(
successor
))
if
(
successor
!=
null
&&
!
hasPredecessor
.
Add
(
successor
))
{
{
...
@@ -92,11 +92,11 @@ void notePreedecesssor(BoundDecisionDag successor)
...
@@ -92,11 +92,11 @@ void notePreedecesssor(BoundDecisionDag successor)
_dagNodeLabels
[
node
]
=
d
.
Label
;
_dagNodeLabels
[
node
]
=
d
.
Label
;
break
;
break
;
case
BoundEvaluationPoint
e
:
case
BoundEvaluationPoint
e
:
notePre
edeces
ssor
(
e
.
Next
);
notePre
dece
ssor
(
e
.
Next
);
break
;
break
;
case
BoundDecisionPoint
p
:
case
BoundDecisionPoint
p
:
notePre
edeces
ssor
(
p
.
WhenTrue
);
notePre
dece
ssor
(
p
.
WhenTrue
);
notePre
edeces
ssor
(
p
.
WhenFalse
);
notePre
dece
ssor
(
p
.
WhenFalse
);
break
;
break
;
default
:
default
:
throw
ExceptionUtilities
.
UnexpectedValue
(
node
.
Kind
);
throw
ExceptionUtilities
.
UnexpectedValue
(
node
.
Kind
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录